Structural Balance and Random Walks on Complex Networks with Complex Weights
From MaRDI portal
Signed and weighted graphs (05C22) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random walks on graphs (05C81) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Dynamical systems involving maps of trees and graphs (37E25) Linear difference equations (39A06) Social networks; opinion dynamics (91D30) Applications of graph theory to circuits and networks (94C15)
Abstract: Complex numbers define the relationship between entities in many situations. A canonical example would be the off-diagonal terms in a Hamiltonian matrix in quantum physics. Recent years have seen an increasing interest to extend the tools of network science when the weight of edges are complex numbers. Here, we focus on the case when the weight matrix is Hermitian, a reasonable assumption in many applications, and investigate both structural and dynamical properties of the complex-weighted networks. Building on concepts from signed graphs, we introduce a classification of complex-weighted networks based on the notion of structural balance, and illustrate the shared spectral properties within each type. We then apply the results to characterise the dynamics of random walks on complex-weighted networks, where local consensus can be achieved asymptotically when the graph is structurally balanced, while global consensus will be obtained when it is strictly unbalanced. Finally, we explore potential applications of our findings by generalising the notion of cut, and propose an associated spectral clustering algorithm. We also provide further characteristics of the magnetic Laplacian, associating directed networks to complex-weighted ones. The performance of the algorithm is verified on both synthetic and real networks.
Recommendations
- Spreading and Structural Balance on Signed Networks
- Laplacian matrices of general complex weighted directed graphs
- Characterizing bipartite consensus on signed matrix-weighted networks via balancing set
- On spectra and real energy of complex weighted digraphs
- Spectra of Laplacian matrices of weighted graphs: structural genericity properties
Cited in
(2)
This page was built for publication: Structural Balance and Random Walks on Complex Networks with Complex Weights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6442587)
