The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Electrical Networks and Algebraic Graph Theory: Models, Properties, and Applications
Abstract
Algebraic graph theory is a cornerstone in the study of electrical networks ranging from miniature integrated circuits to continental-scale power systems. Conversely, many fundamental results of algebraic graph theory were laid out by early electrical circuit analysts. In this paper, we survey some fundamental and historic as well as recent results on how algebraic graph theory informs electrical network analysis, dynamics, and design. In particular, we review the algebraic and spectral properties of graph adjacency, Laplacian, incidence, and resistance matrices and how they relate to the analysis, network reduction, and dynamics of certain classes of electrical networks. We study these relations for models of increasing complexity ranging from static resistive direct current (dc) circuits, over dynamic resistor..inductor..capacitor (RLC) circuits, to nonlinear alternating current (ac) power flow. We conclude this paper by presenting a set of fundamental open questions at the intersection of algebraic graph theory and electrical networks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293 · cited 1×
“For example, λ2 is a popular metric in graph partitioning and community detection [111], [67] as it quantifies the smallest bottleneck in the graph, where “smallest” is understood in our context as the minimal current flow over any cut separating the nodes of an electrical network.”
BackgroundConsensus and Cooperation in Networked Multi-Agent Systems
Olfati-Saber, R., Fax, J. A., & Murray, R. M. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887293 · Cited by 10,522
Godsil, C., & Royle, G. (2001) · Graduate Texts in Mathematics · doi:10.1007/978-1-4613-0163-9 · Cited by 8,154
Matrix Analysis and Applied Linear Algebra
Meyer, C. (2000) · doi:10.1137/1.9780898719512 · Cited by 3,565
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
Fouss, F., Pirotte, A., Renders, J.-M., & Saerens, M. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.46 · Cited by 1,265
Stochastic Complementation, Uncoupling Markov Chains, and the Theory of Nearly Reducible Systems
Meyer, C. D. (1989) · SIAM Review · doi:10.1137/1031050 · Cited by 316
Comments on "Consensus and cooperation in networked multi-agent systems"
Chebotarev, P. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2049911 · Cited by 18
Cited by
Placing Grid-Forming Converters to Enhance Small Signal Stability of PLL-Integrated Power Systems
Yang, C., Huang, L., Xin, H., & Ju, P. (2021) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2020.3042741 · Cited by 279
Metadata
- Authors
- Dorfler, F., Simpson-Porco, J. W., & Bullo, F.
- Venue
- Proceedings of the IEEE
- Published
- 2018-05
- Volume
- 106
- Issue
- 5
- Pages
- 977-1005
- ISSN
- 0018-9219 (ISSN-L)
- 1558-2256
- OpenAlex
- W2796365873
- Cited by
- 227
- References
- 8
- FWCI
- 38.98
- 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
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.