On the range of the simple random walk bridge on groups
From MaRDI portal
Publication:2461982
Abstract: Let G be a vertex transitive graph. A study of the range of simple random walk on G and of its bridge is proposed. While it is expected that on a graph of polynomial growth the sizes of the range of the unrestricted random walk and of its bridge are the same in first order, this is not the case on some larger graphs such as regular trees. Of particular interest is the case when G is the Cayley graph of a group. In this case we even study the range of a general symmetric (not necessarily simple) random walk on G. We hope that the few examples for which we calculate the first order behavior of the range here will help to discover some relation between the group structure and the behavior of the range. Further problems regarding bridges are presented.
Recommendations
Cited in
(7)- On range and local time of many-dimensional submartingales
- Capacity of the range of random walks on groups
- Random walks on braid groups: Brownian bridges, complexity and statistics
- Return probabilities on nonunimodular transitive graphs
- Some results for range of random walk on graph with spectral dimension two
- Random mappings of scaled graphs.
- Bridge mixtures of random walks on an abelian group
This page was built for publication: On the range of the simple random walk bridge on groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2461982)