Effective graph resistance
From MaRDI portal
Publication:550630
DOI10.1016/j.laa.2011.02.024zbMath1222.05155OpenAlexW2156286761MaRDI QIDQ550630
W. Ellens, Piet Van Mieghem, Flora M. Spieksma, Robert E. Kooij, Almerima Jamakovic
Publication date: 13 July 2011
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2011.02.024
Applications of graph theory (05C90) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Analytic circuit theory (94C05) Applications of graph theory to circuits and networks (94C15) Random walks on graphs (05C81)
Related Items (40)
Resistance distances on networks ⋮ Sixty years of network reliability ⋮ Node and network resistance to bribery in multi-agent systems ⋮ Graph coarsening: from scientific computing to machine learning ⋮ Monitoring and compartmentalized structures ⋮ Generalization of effective conductance centrality for egonetworks ⋮ A novel measure of edge and vertex centrality for assessing robustness in complex networks ⋮ Variance and Covariance of Distributions on Graphs ⋮ NETWORK COHERENCE ANALYSIS ON A FAMILY OF NESTED WEIGHTED n-POLYGON NETWORKS ⋮ Extremal graphs of bipartite graphs of given diameter for two indices on resistance-distance ⋮ Computing an expected hitting time for the 3-urn Ehrenfest model via electric networks ⋮ Hitting time quasi-metric and its forest representation ⋮ Kemeny's constant and the effective graph resistance ⋮ Comparison theorems on resistance distances and Kirchhoff indices of \(S,T\)-isomers ⋮ Group inverse of the Laplacian of connections of networks ⋮ On the Kirchhoff index of bipartite graphs with given diameters ⋮ Bounding robustness in complex networks under topological changes through majorization techniques ⋮ The resistance perturbation distance: a metric for the analysis of dynamic networks ⋮ Controlling the spread of infectious diseases by using random walk method to remove many important links ⋮ Graph curvature via resistance distance ⋮ Unnamed Item ⋮ The Kirchhoff index of subdivisions of graphs ⋮ Kirchhoffian indices for weighted digraphs ⋮ Resistance distance-based graph invariants of subdivisions and triangulations of graphs ⋮ Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis ⋮ The correlation of metrics in complex networks with applications in functional brain networks ⋮ On generalized windmill graphs ⋮ Optimizing network robustness by edge rewiring: a general framework ⋮ On the lower bound of the sum of the algebraic connectivity of a graph and its complement ⋮ Hubs-biased resistance distances on graphs and networks ⋮ Theoretical and computational methods to minimize Kirchhoff index of graphs with a given edge \(k\)-partiteness ⋮ Extremal bipartite graphs and unicyclic graphs with respect to the eccentric resistance-distance sum ⋮ The impact of the topology on cascading failures in a power grid model ⋮ A topological investigation of phase transitions of cascading failures in power grids ⋮ Kirchhoff index of simplicial networks ⋮ Natural Preconditioning and Iterative Methods for Saddle Point Systems ⋮ Effective resistance is more than distance: Laplacians, simplices and the Schur complement ⋮ Every nonsingular spherical Euclidean distance matrix is a resistance distance matrix ⋮ Optimization of Stochastic Lossy Transport Networks and Applications to Power Grids ⋮ Resistance distances in Cayley graphs on symmetric groups
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graphs with given diameter maximizing the algebraic connectivity
- Graphs with given diameter maximizing the spectral radius
- Non-negative matrices and Markov chains. 2nd ed
- Lower bounds for covering times for reversible Markov chains and random walks on graphs
- Rank one perturbation and its application to the laplacian spectrum of a graph∗
This page was built for publication: Effective graph resistance
