Resistance distances in directed graphs: definitions, properties, and applications

Cites Work

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

Cited In (1)

A method for constructing graphs with the same resistance spectrum

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)