Resistance distances on networks
From MaRDI portal
Publication:5034280
DOI10.2298/AADM1701136CzbMATH Open1499.05181OpenAlexW2612213398MaRDI QIDQ5034280FDOQ5034280
Authors:
Publication date: 24 February 2022
Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/aadm1701136c
Recommendations
- Resistance distances in extended or contracted networks
- Kirchhoff indexes of a network
- Effective graph resistance
- A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
- Effective resistance is more than distance: Laplacians, simplices and the Schur complement
Cites Work
- A recursion formula for resistance distances and its applications
- Encyclopedia of distances
- Some characterizations of symmetric inverse \(M\)-matrices
- Description of the sub-Markov kernel associated to generalized ultrametric matrices. An algorithmic approach
- Ultrametric matrices and induced Markov chains
- Discrete elliptic operators and their Green operators
- Potential theory for Schrödinger operators on finite networks
- Potential theory on finite networks
- Kirchhoff indexes of a network
- Characterization of symmetric \(M\)-matrices as resistive inverses
- Effective graph resistance
- Title not available (Why is that?)
- On proximity measures for graph vertices
- Studying new classes of graph metrics
Cited In (16)
- A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
- Title not available (Why is that?)
- Resistance distances in extended or contracted networks
- Resistance distance and the normalized Laplacian spectrum
- The resistance perturbation distance: a metric for the analysis of dynamic networks
- A physics perspective on the resistance distance for graphs
- Resistance between two nodes of a ring clique network
- The forest metrics of a graph and their properties
- Resistance distances in corona and neighborhood corona networks based on Laplacian generalized inverse approach
- Resistance distance distribution in large sparse random graphs
- Some spectral invariants of the neighborhood corona of graphs
- Resistance conditions and applications
- Recursive calculation of effective resistances in distance-regular networks based on Bose-Mesner algebra and Christoffel-Darboux identity
- Effective resistance on graphs and the epidemic quasimetric
- A Hilbert space approach to effective resistance metric
- Hubs-biased resistance distances on graphs and networks
This page was built for publication: Resistance distances on networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5034280)