Characterization and space embedding of directed graphs and social networks through magnetic Laplacians

12/05/2018
by   Bruno Messias, et al.
0

Though commonly found in the real world, directed networks have received relatively less attention from the literature in which concerns their topological and dynamical characteristics. In this work, we develop a magnetic Laplacian-based framework that can be used for studying directed complex networks. More specifically, we introduce a specific heat measurement that can help to characterize the network topology. It is shown that, by using this approach, it is possible to identify the types of several networks, as well as to infer parameters underlying specific network configurations. Then, we consider the dynamics associated with the magnetic Laplacian as a means of embedding networks into a metric space, allowing the identification of mesoscopic structures in artificial networks or unravel the polarization on political blogosphere. By defining a coarse-graining procedure in this metric space, we show how to connect the specific heat measurement and the positions of nodes in this space.

READ FULL TEXT

page 6

page 8

page 10

page 13

research
12/05/2018

Characterization and space embedding of directed graphs trough magnetic Laplacians

Directed graphs are essential data structures which model several real-w...
research
03/09/2023

Characterizing bearing equivalence in directed graphs

In this paper, we study bearing equivalence in directed graphs. We first...
research
09/12/2018

Finding Cheeger Cuts in Hypergraphs via Heat Equation

Cheeger's inequality states that a tightly connected subset can be extra...
research
07/23/2021

Graph Pseudometrics from a Topological Point of View

We explore pseudometrics for directed graphs in order to better understa...
research
05/26/2022

SigMaNet: One Laplacian to Rule Them All

This paper introduces SigMaNet, a generalized Graph Convolutional Networ...
research
11/20/2014

Metric recovery from directed unweighted graphs

We analyze directed, unweighted graphs obtained from x_i∈R^d by connecti...
research
01/23/2023

Characterizing Polarization in Social Networks using the Signed Relational Latent Distance Model

Graph representation learning has become a prominent tool for the charac...

Please sign up or login with your details

Forgot password? Click here to reset