Effective graph resistance
From MaRDI portal
Publication:550630
DOI10.1016/j.laa.2011.02.024zbMath1222.05155MaRDI 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
05C90: Applications of graph theory
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
94C05: Analytic circuit theory
94C15: Applications of graph theory to circuits and networks
05C81: Random walks on graphs
Related Items
Resistance distances on networks, Variance and Covariance of Distributions on Graphs, NETWORK COHERENCE ANALYSIS ON A FAMILY OF NESTED WEIGHTED n-POLYGON NETWORKS, Unnamed Item, Optimization of Stochastic Lossy Transport Networks and Applications to Power Grids, Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis, Bounding robustness in complex networks under topological changes through majorization techniques, Comparison theorems on resistance distances and Kirchhoff indices of \(S,T\)-isomers, Resistance distance-based graph invariants of subdivisions and triangulations of graphs, Node and network resistance to bribery in multi-agent systems, Sixty years of network reliability, The resistance perturbation distance: a metric for the analysis of dynamic networks, Kirchhoffian indices for weighted digraphs, On generalized windmill graphs, Optimizing network robustness by edge rewiring: a general framework, 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, On the lower bound of the sum of the algebraic connectivity of a graph and its complement, 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, Kirchhoff index of simplicial networks, Effective resistance is more than distance: Laplacians, simplices and the Schur complement, Every nonsingular spherical Euclidean distance matrix is a resistance distance matrix, Graph coarsening: from scientific computing to machine learning, Generalization of effective conductance centrality for egonetworks, A novel measure of edge and vertex centrality for assessing robustness in complex networks, Extremal graphs of bipartite graphs of given diameter for two indices on resistance-distance, Hitting time quasi-metric and its forest representation, On the Kirchhoff index of bipartite graphs with given diameters, Hubs-biased resistance distances on graphs and networks, Resistance distances in Cayley graphs on symmetric groups, Computing an expected hitting time for the 3-urn Ehrenfest model via electric networks, Kemeny's constant and the effective graph resistance, Group inverse of the Laplacian of connections of networks, The Kirchhoff index of subdivisions of graphs, Natural Preconditioning and Iterative Methods for Saddle Point Systems, The correlation of metrics in complex networks with applications in functional brain networks, Monitoring and compartmentalized structures
Cites Work
- 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∗
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
