Network bipartitioning in the anti-communicability Euclidean space

We define the anti-communicability function for the nodes of a simple graph as the nondiagonal entries of exp (-A). We prove that it induces an embedding of the nodes into a Euclidean space. The anti-communicability angle is then defined as the angle spanned by the position vectors of the correspond...

Full description

Bibliographic Details

Published in:	AIMS Mathematics
Main Authors:	Jesús Gómez-Gardeñes, Ernesto Estrada
Format:	Article
Language:	English
Published:	AIMS Press 2021-11-01
Subjects:	network theory complex networks communicability bipartite graphs
Online Access:	https://www.aimspress.com/article/10.3934/math.2021070/fulltext.html