Geometry of complex networks and topological centrality

DOI10.1016/J.PHYSA.2013.04.013zbMath1395.05163arXiv1107.0989OpenAlexW2964155796MaRDI QIDQ1673137

Zhi-Li Zhang, Gyan Ranjan

Publication date: 11 September 2018

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1107.0989

zbMATH Keywords

Kirchhoff indexconnected bi-partitions of a graphequivalent electrical networkexpected hitting and commute timesMoore-Penrose pseudo-inverse of the Laplaciantopological centrality

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (11)

Graph coarsening: from scientific computing to machine learning ⋮ Measuring centrality by a generalization of degree ⋮ Kemeny's constant and the effective graph resistance ⋮ Incremental Computation of Pseudo-Inverse of Laplacian ⋮ A note on Moore–Penrose inverse of Laplacian matrix of graphs ⋮ Leontief meets Markov: sectoral vulnerabilities through circular connectivity ⋮ Fractional interaction of financial agents in a stock market network ⋮ Markov fundamental tensor and its applications to network analysis ⋮ Kirchhoffian indices for weighted digraphs ⋮ Resistance distances in directed graphs: definitions, properties, and applications ⋮ Numerically efficient \(H_\infty\) analysis of cooperative multi-agent systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random walks and the effective resistance of networks
• Kirchhoff indexes of a network
• Jamming and correlation patterns in traffic of information on sparse modular networks
• Random walks on graphs
• The matrix-forest theorem and measuring relations in small social groups
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• Metric structure of random networks
• Generalized inverses. Theory and applications.
• On proximity measures for graph vertices
• Commute times for a directed graph using an asymmetric Laplacian
• Incremental Computation of Pseudo-Inverse of Laplacian
• Series expansion of the directed percolation probability
• Distances in Weighted Trees and Group Inverse of Laplacian Matrices
• Collective dynamics of ‘small-world’ networks

This page was built for publication: Geometry of complex networks and topological centrality