The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Minimizing Effective Resistance of a Graph
Abstract
The effective resistance between two nodes of a weighted graph is the electrical resistance seen between the nodes of a resistor network with branch conductances given by the edge weights. The effective resistance comes up in many applications and fields in addition to electrical network analysis, including, for example, Markov chains and continuous-time averaging networks. In this paper we study the problem of allocating edge weights on a given graph in order to minimize the total effective resistance, i.e., the sum of the resistances between all pairs of nodes. We show that this is a convex optimization problem and can be solved efficiently either numerically or, in some cases, analytically. We show that optimal allocation of the edge weights can reduce the total effective resistance of the graph (compared to uniform weights) by a factor that grows unboundedly with the size of the graph. We show that among all graphs with n nodes, the path has the largest value of optimal total effective resistance and the complete graph has the least.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Self-citationHorn, R. A., & Johnson, C. R. (1991) · Cambridge University Press eBooks · doi:10.1017/cbo9780511840371 · Cited by 9,319
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Sturm, J. F. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805766 · Cited by 7,377
Algebraic connectivity of graphs
Fiedler, M. (1973) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1973.101168 · Cited by 3,977
Fast linear iterations for distributed averaging
Xiao, L., & Boyd, S. (2004) · Systems & Control Letters · doi:10.1016/j.sysconle.2004.02.022 · Cited by 2,706
Self-citationThe Transient Response of Damped Linear Networks with Particular Regard to Wideband Amplifiers
Elmore, W. C. (1948) · Journal of Applied Physics · doi:10.1063/1.1697872 · Cited by 1,779
(1993) · Choice Reviews Online · doi:10.5860/choice.31-0986 · Cited by 1,540
Klein, D. J., & Randić, M. (1993) · Journal of Mathematical Chemistry · doi:10.1007/bf01164627 · Cited by 1,372
Distributed average consensus with least-mean-square deviation
Xiao, L., Boyd, S., & Kim, S.-J. (2007) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2006.08.010 · Cited by 1,107
Self-citationRandom Walks and Electric Networks
Doyle, P., & Snell, J. (1984) · Carus Mathematical Monographs · doi:10.5948/upo9781614440222 · Cited by 1,061
Cited by
USING CIRCUIT THEORY TO MODEL CONNECTIVITY IN ECOLOGY, EVOLUTION, AND CONSERVATION
McRae, B. H., Dickson, B. G., Keitt, T. H., & Shah, V. B. (2008) · Ecology · doi:10.1890/07-1861.1 · Cited by 2,244
DropEdge: Towards Deep Graph Convolutional Networks on Node Classification
Rong, Y., Huang, W., Xu, T., & Huang, J. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.10903 · Cited by 607
Distributed Reactive Power Feedback Control for Voltage Regulation and Loss Minimization
Bolognani, S., Carli, R., Cavraro, G., & Zampieri, S. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2363931 · Cited by 252
Metadata
- Authors
- Ghosh, A., Boyd, S., & Saberi, A.
- Venue
- SIAM Review
- Published
- 2008-01
- Volume
- 50
- Issue
- 1
- Pages
- 37-66
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W1987717935
- Cited by
- 443
- References
- 20
- FWCI
- 21.62
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Minimizing Effective Resistance of a Graph. https://app.cochat.ai/papers/10.1137/050645452
- The paper
- Ghosh, A., Boyd, S., & Saberi, A. (2008). Minimizing Effective Resistance of a Graph. SIAM Review. https://doi.org/10.1137/050645452
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.