Laplacian paths in complex networks: information core emerges from entropic transitions
Not on the map. Why?
Abstract (arXiv)
Complex networks usually exhibit a rich architecture organized over multiple intertwined scales. Information pathways are expected to pervade these scales reflecting structural insights that are not manifest from analyses of the network topology. Moreover, small-world effects correlate with the different network hierarchies complicating the identification of coexisting mesoscopic structures and functional cores. We present a communicability analysis of effective information pathways throughout complex networks based on information diffusion to shed further light on these issues. We employ a variety of brand-new theoretical techniques allowing for: (i) bring the theoretical framework to quantify the probability of information diffusion among nodes, (ii) identify critical scales and structures of complex networks regardless of their intrinsic properties, and (iii) demonstrate their dynamical relevance in synchronization phenomena. By combining these ideas, we evidence how the information flow on complex networks unravels different resolution scales. Using computational techniques, we focus on entropic transitions, uncovering a generic mesoscale object, the information core, and controlling information processing in complex networks. Altogether, this study sheds much light on allowing new theoretical techniques paving the way to introduce future renormalization group approaches based on diffusion distances.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 14 Feb 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 0; 2026: 1.
2 papers.
- 2026Conditional Entropy of Heat Diffusion on Temporal Networks15 May 2026
- 2023Renormalized Graph Representations for Node Classification1 Jun 2023