A discrete Gauss-Green identity for unbounded Laplace operators and transience of random walks

Mathematics – Functional Analysis

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

31 pages

Scientific paper

A resistance network is a connected graph $(G,c)$. The conductance function $c_{xy}$ weights the edges, which are then interpreted as resistors of possibly varying strengths. The relationship between the natural Dirichlet form $\mathcal E$ and the discrete Laplace operator $\Delta$ on a finite network is given by $\mathcal E(u,v) = \la u, \Lap v\ra_2$, where the latter is the usual $\ell^2$ inner product. We extend this formula to infinite networks, where a new (boundary) term appears. The Laplace operator is typically unbounded in this context; we construct a reproducing kernel for the space of functions of finite energy which allows us to specify a dense domain for $\Delta$ and give several criteria for the transience of the random walk on the network. The extended Gauss-Green identity and the reproducing kernel are the foundation for a boundary integral representation for harmonic functions of finite energy, akin to that of Martin boundary theory.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A discrete Gauss-Green identity for unbounded Laplace operators and transience of random walks 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 A discrete Gauss-Green identity for unbounded Laplace operators and transience of random walks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A discrete Gauss-Green identity for unbounded Laplace operators and transience of random walks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-64206

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.