Centrality metrics and localization in core-periphery networks
From MaRDI portal
Publication:3302535
DOI10.1088/1742-5468/2016/02/023401zbMath1456.68126arXiv1510.01116OpenAlexW2224335401MaRDI QIDQ3302535
Fabrizio Lillo, Daniele Tantari, Paolo Barucca
Publication date: 11 August 2020
Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.01116
Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Principal eigenvector localization and centrality in networks: revisited, Detection of core–periphery structure in networks using spectral methods and geodesic paths, Multifractal analysis for core-periphery structure of complex networks, Disentangling bipartite and core-periphery structure in financial networks, Double phase transition of the Ising model in core–periphery networks, Spectral density of equitable core-periphery graphs
Cites Work
- Unnamed Item
- Anergy in self-directed B lymphocytes: a statistical mechanics perspective
- Spectral statistics of Erdős-Rényi graphs. I: Local semicircle law
- Eigenvalues of random power law graphs
- Spectral redemption in clustering sparse networks
- Emergence of Scaling in Random Networks
- The centrality of groups and classes
- The Largest Eigenvalue of Sparse Random Graphs
- Core-Periphery Structure in Networks
- Spectral properties of Google matrix of Wikipedia and other networks
