Discrete Green's functions for products of regular graphs

Details Discrete Green's functions for products of regular graphs Discrete Green's functions for products of regular graphs

2003-09-04

arxiv.org/abs/math/0309080v2

Mathematics

Combinatorics

17 pages, 1 figure

Scientific paper

Discrete Green's functions are the inverses or pseudo-inverses of combinatorial Laplacians. We present compact formulas for discrete Green's functions, in terms of the eigensystems of corresponding Laplacians, for products of regular graphs with or without boundary. Explicit formulas are derived for the cycle, torus, and 3-dimensional torus, as is an inductive formula for the $t$-dimensional torus with $n$ vertices, from which the Green's function can be completely determined in time $O(t n^{2-1/t}\log{n})$. These Green's functions may be used in conjunction with diffusion-like problems on graphs such as electric potential, random walks, and chip-firing games or other balancing games.

Affiliated with

Also associated with

No associations

Rating

Discrete Green's functions for products of regular graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Discrete Green's functions for products of regular graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Discrete Green's functions for products of regular graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-57334