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?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Effective graph resistance
Resistance distance and the normalized Laplacian spectrum
Geometry of complex networks and topological centrality
Generalized inverses. Theory and applications.
On resistance distance of Markov chain and its sum rules
Commute times for a directed graph using an asymmetric Laplacian
On the matrix equation \(Ax =\lambda Bx\)
Random graphs.
Who's \#1? The science of rating and ranking
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
Robotic Surveillance and Markov Chains With Minimal Weighted Kemeny Constant
Resistance distance in directed cactus graphs
An analysis of approximations for maximizing submodular set functions—I
Markov Chains
Kemeny's Constant and the Random Surfer
The Structure and Function of Complex Networks
Digraph Laplacian and the Degree of Asymmetry
Kron Reduction of Graphs With Applications to Electrical Networks
Biharmonic Distance-Based Performance Metric for Second-Order Noisy Consensus Networks
Resistance matrices of balanced directed graphs
Analysis of Markov Influence Graphs
Low-Mean Hitting Time for Random Walks on Heterogeneous Networks
Maximizing the Number of Spanning Trees in a Connected Graph
Scaling Laws for Consensus Protocols Subject to Noise
Generalized Inverses of Linear Transformations
Collective dynamics of ‘small-world’ networks
Consensus and Coherence in Fractal Networks
Fast Generation of Random Spanning Trees and the Effective Resistance Metric
An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations
The two-point resistance of a resistor network: a new formulation and application to the cobweb network
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
The Role of Kemeny's Constant in Properties of Markov Chains
Minimizing Effective Resistance of a Graph
A new approach to computing maximum flows using electrical flows
STACS 2005
Kron Reduction and Effective Resistance of Directed Graphs