Application of a generalized Sherman–Morrison formula to the computation of network Green's functions and the construction of spanning trees

DOI10.1088/1742-5468/2015/05/P05007zbMath1465.05106OpenAlexW2204762443MaRDI QIDQ3302234

C. Pozrikidis

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://doi.org/10.1088/1742-5468/2015/05/p05007

zbMATH Keywords

node degree distributionMoore-Penrose pseudoinverse of the graph Laplacian

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Monte Carlo methods (65C05) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Stochastic analysis in statistical mechanics (82M60)

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• Spanning trees on hypercubic lattices and nonorientable surfaces
• Theory of resistor networks: the two-point resistance
• On Iterative Computation of Generalized Inverses and Associated Projections
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Application of a generalized Sherman–Morrison formula to the computation of network Green's functions and the construction of spanning trees