Geometry of complex networks and topological centrality
Authors:
- Gyan RanjanGRGyan Ranjan
- Zhi-Li ZhangZZZhi-Li Zhang
- 1 September 2013
- journal article
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 392 (17) , 3833-3845
Abstract
No abstract availableKeywords
All Related Versions
This publication has 34 references indexed in Scilit:
- Commute times for a directed graph using an asymmetric LaplacianLinear Algebra and its Applications, 2011
- Bounds for the Kirchhoff index of regular graphs via the spectra of their random walksInternational Journal of Quantum Chemistry, 2009
- Spectral and dynamical properties in classes of sparse networks with mesoscopic inhomogeneitiesPhysical Review E, 2009
- Finding community structure in networks using the eigenvectors of matricesPhysical Review E, 2006
- Spectra of complex networksPhysical Review E, 2003
- Spectra of “real-world” graphs: Beyond the semicircle lawPhysical Review E, 2001
- Error and attack tolerance of complex networksNature, 2000
- Resistance distanceJournal of Mathematical Chemistry, 1993
- Random walks and the effective resistance of networksJournal of Theoretical Probability, 1991
- A Set of Measures of Centrality Based on BetweennessSociometry, 1977