Communicability Angles Reveal Critical Edges for Network Consensus Dynamics
July 21, 2015 Β· Declared Dead Β· π Physical review. E, Statistical, nonlinear, and soft matter physics
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Ernesto Estrada, Eusebio Vargas-Estrada, Hiroyasu Ando
arXiv ID
1507.05881
Category
physics.soc-ph
Cross-listed
cs.SI
Citations
13
Venue
Physical review. E, Statistical, nonlinear, and soft matter physics
Last Checked
3 months ago
Abstract
We consider the question of determining how the topological structure influences a consensus dynamical process taking place on a network. By considering a large dataset of real-world networks we first determine that the removal of edges according to their communicability angle -an angle between position vectors of the nodes in an Euclidean communicability space- increases the average time of consensus by a factor of 5.68 in real-world networks. The edge betweenness centrality also identifies -in a smaller proportion- those critical edges for the consensus dynamics, i.e., its removal increases the time of consensus by a factor of 3.70. We justify theoretically these findings on the basis of the role played by the algebraic connectivity and the isoperimetric number of networks on the dynamical process studied, and their connections with the properties mentioned before. Finally, we study the role played by global topological parameters of networks on the consensus dynamics. We determine that the network density and the average distance-sum -an analogous of the node degree for shortest-path distances, account for more than 80% of the variance of the average time of consensus in the real-world networks studied.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β physics.soc-ph
π
π
The Cartographer
R.I.P.
π»
Ghosted
Networks beyond pairwise interactions: structure and dynamics
R.I.P.
π»
Ghosted
Statistical physics of human cooperation
R.I.P.
π»
Ghosted
Vital nodes identification in complex networks
R.I.P.
π»
Ghosted
Influence maximization in complex networks through optimal percolation
R.I.P.
π»
Ghosted
Scale-free networks are rare
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted