DeepAI AI Chat
Log In Sign Up

Algorithmic techniques for finding resistance distances on structured graphs

by   E. J. Evans, et al.

In this paper we give a survey of methods used to calculate values of resistance distance (also known as effective resistance) in graphs. Resistance distance has played a prominent role not only in circuit theory and chemistry, but also in combinatorial matrix theory and spectral graph theory. Moreover resistance distance has applications ranging from quantifying biological structures, distributed control systems, network analysis, and power grid systems. In this paper we discuss both exact techniques and approximate techniques and for each method discussed we provide an illustrative example of the technique. We also present some open questions and conjectures.


page 1

page 2

page 3

page 4


Computing Effective Resistances on Large Graphs Based on Approximate Inverse of Cholesky Factor

Effective resistance, which originates from the field of circuits analys...

Who Asked Us? How the Theory of Computing Answers Questions about Analysis

Algorithmic fractal dimensions – constructs of computability theory – ha...

Metric and Path-Connectedness Properties of the Frechet Distance for Paths and Graphs

The Frechet distance is often used to measure distances between paths, w...

Graph Similarity and Homomorphism Densities

We introduce the tree distance, a new distance measure on graphs. The tr...

A linear-time algorithm and analysis of graph Relative Hausdorff distance

Graph similarity metrics serve far-ranging purposes across many domains ...

A minimalist approach for speeding up the computation of geodesic distances on triangular meshes

The computation of geodesic distances is an important research topic in ...

Rounds, Color, Parity, Squares

This is a sequel to our paper "Permute, Graph, Map, Derange", involving ...