Resistance distances in directed graphs: definitions, properties, and applications
From MaRDI portal
Publication:6589847
Cites work
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 3934150 (Why is no real title available?)
- scientific article; zbMATH DE number 635657 (Why is no real title available?)
- scientific article; zbMATH DE number 5485569 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- scientific article; zbMATH DE number 3111121 (Why is no real title available?)
- A New Notion of Effective Resistance for Directed Graphs—Part I: Definition and Properties
- A New Notion of Effective Resistance for Directed Graphs—Part II: Computing Resistances
- A new approach to computing maximum flows using electrical flows
- An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations
- An analysis of approximations for maximizing submodular set functions—I
- Analysis of Markov influence graphs
- Biharmonic Distance-Based Performance Metric for Second-Order Noisy Consensus Networks
- Collective dynamics of `small-world' networks
- Commute times for a directed graph using an asymmetric Laplacian
- Consensus and Coherence in Fractal Networks
- Digraph Laplacian and the degree of asymmetry
- Effective graph resistance
- Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs
- Fast generation of random spanning trees and the effective resistance metric
- Generalized Inverses of Linear Transformations
- Generalized inverses. Theory and applications.
- Geometry of complex networks and topological centrality
- Kemeny's Constant and the Random Surfer
- Kirchhoff index as a measure of edge centrality in weighted networks: nearly linear time algorithms
- Kron Reduction and Effective Resistance of Directed Graphs
- Kron Reduction of Graphs With Applications to Electrical Networks
- Low-Mean Hitting Time for Random Walks on Heterogeneous Networks
- Markov Chains
- Maximizing the Number of Spanning Trees in a Connected Graph
- Minimizing Effective Resistance of a Graph
- On resistance distance of Markov chain and its sum rules
- On the matrix equation \(Ax =\lambda Bx\)
- Random graphs.
- Resistance distance and the normalized Laplacian spectrum
- Resistance distance in directed cactus graphs
- Resistance matrices of balanced directed graphs
- Robotic Surveillance and Markov Chains With Minimal Weighted Kemeny Constant
- STACS 2005
- Scaling Laws for Consensus Protocols Subject to Noise
- The Structure and Function of Complex Networks
- The role of Kemeny's constant in properties of Markov chains
- The two-point resistance of a resistor network: a new formulation and application to the cobweb network
- Who's \#1? The science of rating and ranking
This page was built for publication: Resistance distances in directed graphs: definitions, properties, and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589847)
