Kirchhoff Index as a Measure of Edge Centrality in Weighted Networks: Nearly Linear Time Algorithms
Abstract
Formats available
You can view the full content in the following formats:
Information & Authors
Information
Published In

Copyright
History
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- Diagonal of Pseudoinverse of Graph Laplacian: Fast Estimation and Exact ResultsTheoretical Computer Science | 1 Jan 2025
- Cover and hitting times of hyperbolic random graphsRandom Structures & Algorithms, Vol. 65, No. 4 | 26 July 2024
- Distributed Design of Strong Structurally Controllable and Maximally Robust NetworksIEEE Transactions on Network Science and Engineering, Vol. 11, No. 5 | 1 Sep 2024
- Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle DecompositionsSIAM Journal on Computing, Vol. 52, No. 6 | 9 June 2020
- Evolution of Robustness in Growing Random NetworksEntropy, Vol. 25, No. 9 | 15 September 2023
- Measures and Optimization for Robustness and Vulnerability in Disconnected NetworksIEEE Transactions on Information Forensics and Security, Vol. 18 | 1 Jan 2023
- Spectral analysis and its applications for a class of scale‐free network based on the weighted m‐clique annex operationMathematical Methods in the Applied Sciences, Vol. 261 | 21 December 2022
- Discriminating Power of Centrality Measures in Complex NetworksIEEE Transactions on Cybernetics, Vol. 52, No. 11 | 1 Nov 2022
- On Weighted Graph Sparsification by Linear Sketching2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) | 1 Oct 2022
- New Generalized ‘Useful’ Entropies using Weighted Quasi-Linear Mean for Efficient NetworkingMobile Networks and Applications, Vol. 27, No. 3 | 18 February 2022
- Biharmonic Distance-Based Performance Metric for Second-Order Noisy Consensus NetworksIEEE Transactions on Information Theory, Vol. 68, No. 2 | 1 Feb 2022
- A Comparison of Graph Centrality Measures Based on Lazy Random WalksApplied Modeling Techniques and Data Analysis 1 | 16 April 2021
- NetKI: A kirchhoff index based statistical graph embedding in nearly linear timeNeurocomputing, Vol. 433 | 1 Apr 2021
- Scaling up network centrality computations – A brief overviewit - Information Technology, Vol. 62, No. 3-4 | 11 March 2020
- Optimal Offline Dynamic 2, 3-Edge/Vertex ConnectivityAlgorithms and Data Structures | 12 July 2019
- Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) | 1 Oct 2018
- The Relative Concentration of Interaction—A Proposal for an Integrated Understanding of Centrality and Central PlacesLand, Vol. 7, No. 3 | 20 July 2018
View Options
View options
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].