Algebraic Potential Theory on Graphs

This paper encompasses a motley collection of ideas from several areas of mathematics, including, in no particular order, random walks, the Picard group, exchange rate networks, chip‐firing games, cohomology, and the conductance of an electrical network. The linking threads are the discrete Laplacian on a graph and the solution of the associated Dirichlet problem. Thirty years ago, this subject was dismissed by many as a trivial specialisation of cohomology theory, but it has now been shown to have hidden depths. Plumbing these depths leads to new theoretical advances, many of which throw light on the diverse applications of the theory. 1991 Mathematics Subject Classification 05C50.

[1]  A. Nerode,et al.  An Algebraic Proof of Kirchhoff's Network Theorem , 1961 .

[2]  R. Foster.  An Extension of a Network Theorem , 1961 .

[3]  E. Margarita,et al.  On vector spaces associated with a graph , 1977 .

[4]  C. Satyanarayana,et al.  Applied graph theory: Graphs and electrical networks , 1976, Proceedings of the IEEE.

[5]  Kenneth A. Berman.  A Graph Theoretical Approach to Handicap Ranking of Tournaments and Paired Comparisons , 1980, SIAM J. Matrix Anal. Appl..

[6]  J. Laurie Snell,et al.  Random Walks and Electrical Networks , 1984 .

[7]  Kenneth A. Berman,et al.  Balanced vertex weightings and arborescences , 1987, J. Comb. Theory, Ser. B.

[8]  D. Aldous.  An introduction to covering problems for random walks on graphs , 1989 .

[9]  Carsten Thomassen,et al.  Resistances and currents in infinite electrical networks , 1990, J. Comb. Theory, Ser. B.

[10]  Dhar,et al.  Self-organized critical state of sandpile automaton models. , 1990, Physical review letters.

[11]  László Lovász,et al.  Chip-firing Games on Graphs , 1991, Eur. J. Comb..

[12]  P. Tetali.  Random walks and the effective resistance of networks , 1991 .

[13]  A. Brouwer,et al.  On the p-Rank of the Adjacency Matrices of Strongly Regular Graphs , 1992 .

[14]  László Lovász,et al.  Chip-Firing Games on Directed Graphs , 1992 .

[15]  Abelian Avalanches,et al.  Abelian Avalanches and Tutte Polynomials , 1992 .

[16]  Norman L. Biggs,et al.  Potential Theory on Distance-Regular Graphs , 1993, Combinatorics, Probability and Computing.

[17]  Prasad Tetali.  An Extension of Foster's Network Theorem , 1994, Comb. Probab. Comput..

[18]  Peter Winkler,et al.  Mixing of random walks and other diffusions on a graph , 1995 .

[19]  P. Harpe,et al.  The lattice of integral flows and the lattice of integral coboundaries on a finite graph , 1995 .

[20]  J. Lagarias.  Point lattices , 1996 .

[21]  Béla Bollobás,et al.  Random Walks and Electrical Resistances in Products of Graphs , 1997, Discret. Appl. Math..

[22]  姜 波克.  国际金融学 = International finance , 1999 .

[23]  Norman Biggs,et al.  Chip-Firing and the Critical Group of a Graph , 1999 .