Minimizing Effective Resistance of a Graph
From MaRDI portal
Publication:5450278
DOI10.1137/050645452zbMath1134.05057OpenAlexW1987717935MaRDI QIDQ5450278
Arpita Ghosh, Amin Saberi, Stephen P. Boyd
Publication date: 19 March 2008
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/050645452
Programming involving graphs or networks (90C35) Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)
Related Items
A measure of dissimilarity between diffusive processes on networks, Kron Reduction and Effective Resistance of Directed Graphs, Inverse Perron values and connectivity of a uniform hypergraph, Role of sparsity and structure in the optimization landscape of non-convex matrix sensing, Quantum state transfer in coronas, Maximizing Convergence Time in Network Averaging Dynamics Subject to Edge Removal, A novel measure of edge and vertex centrality for assessing robustness in complex networks, Boundary Value Problems on Finite Networks, Variance and Covariance of Distributions on Graphs, Unnamed Item, Resistance distance distribution in large sparse random graphs, Algorithmic techniques for finding resistance distances on structured graphs, The first two cacti with larger multiplicative eccentricity resistance-distance, Spectrally optimized pointset configurations, Sparsity-promoting optimal control of systems with symmetries, consensus and synchronization networks, Average Resistance of Toroidal Graphs, A Local Search Framework for Experimental Design, A Spectral Approach to Network Design, Comparison theorems on resistance distances and Kirchhoff indices of \(S,T\)-isomers, Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey, Unnamed Item, Modeling spatial networks by contact graphs of disk packings, Pseudoinverses of Signed Laplacian Matrices, Bounding robustness in complex networks under topological changes through majorization techniques, The resistance perturbation distance: a metric for the analysis of dynamic networks, Unnamed Item, The communicability distance in graphs, Spectral dynamics of guided edge removals and identifying transient amplifiers for death-birth updating, Unnamed Item, Shaping bursting by electrical coupling and noise, La métrica de resistencia efectiva, A note on Moore–Penrose inverse of Laplacian matrix of graphs, Free probability on the limit \(C^\ast\)-algebra induced by a chain of graphs, On Semicircular Elements Induced by Connected Finite Graphs, The Kirchhoff indexes of some composite networks, The Moore-Penrose inverse of the normalized graph Laplacian, Synchronization of coupled limit cycles, Optimization Methods for Frame Conditioning and Application to Graph Laplacian Scaling, Effective Resistance Preserving Directed Graph Symmetrization, The Kirchhoff index of subdivisions of graphs, Resistance distance-based graph invariants of subdivisions and triangulations of graphs, Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian, The Kirchhoff indices and the matching numbers of unicyclic graphs, Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis, A primal-dual optimization strategy for elliptic partial differential equations, The correlation of metrics in complex networks with applications in functional brain networks, Corona graphs as a model of small-world networks, Optimizing network robustness by edge rewiring: a general framework, Computing the smallest eigenpairs of the graph Laplacian, The Moore-Penrose inverse of symmetric matrices with nontrivial equitable partitions, Approximate \(\ell_0\)-penalized estimation of piecewise-constant signals on graphs, Hubs-biased resistance distances on graphs and networks, A distributed solution to the network reconstruction problem, Kirchhoff indexes of a network, Resistance distances in extended or contracted networks, Moore-Penrose inverse of the incidence matrix of a distance regular graph, Minimizing landscape resistance for habitat conservation, Nonlinear network dynamics with consensus-dissensus bifurcation, Modulus on graphs as a generalization of standard graph theoretic quantities, Resistance distance of blowups of trees, Characterization of symmetric \(M\)-matrices as resistive inverses, The maximum relaxation time of a random walk, Green's function in partial subdivision networks, Kirchhoff index of simplicial networks, A Laplacian approach to \(\ell_1\)-norm minimization, Subspace Acceleration for Large-Scale Parameter-Dependent Hermitian Eigenproblems, Random walks on networks with preferential cumulative damage: generation of bias and aging, Efficient algorithm for locating and sizing series compensation devices in large power transmission grids: I. Model implementation, The semicircular law of free probability as noncommutative multivariable operator theory, The Kirchhoff indices of join networks, Effective resistance is more than distance: Laplacians, simplices and the Schur complement, Multi-objective Optimization to Improve Robustness in Networks, Optimization of Stochastic Lossy Transport Networks and Applications to Power Grids, Bounds for the global cyclicity index of a general network via weighted majorization, On the Kirchhoff index of graphs with diameter 2
Uses Software
