Variance and Covariance of Distributions on Graphs
DOI10.1137/20M1361328zbMath1489.05152arXiv2008.09155OpenAlexW3080801325MaRDI QIDQ5075836
Karel Devriendt, Renaud Lambiotte, Samuel Martin-Gutierrez
Publication date: 12 May 2022
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.09155
variance and covariancenetwork analysisgeometric networkeffective resistanceWikipedia networkdiversity measurebibliographic network
Programming involving graphs or networks (90C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the resistance matrix of a graph
- On a quadratic programming problem involving distances in trees
- Effective graph resistance
- Average distance in weighted graphs
- \(k\)-core decomposition of internet graphs: hierarchies, self-similarity and measurement biases
- Generalization of a fundamental matrix
- Finite metric spaces of strictly negative type
- Effective resistance is more than distance: Laplacians, simplices and the Schur complement
- On solving a non-convex quadratic programming problem involving resistance distances in graphs
- Kemeny's constant and the effective graph resistance
- Hitting and commute times in large graphs are often misleading
- Random Geometric Graphs
- Networks
- Entropy and Diversity
- Minimizing Effective Resistance of a Graph
- Graphs and matrices
This page was built for publication: Variance and Covariance of Distributions on Graphs
