Skip to main content Accessibility help
×
Hostname: page-component-586b7cd67f-r5fsc Total loading time: 0 Render date: 2024-11-27T15:43:58.547Z Has data issue: false hasContentIssue false

8 - Ends of Branching Random Walks on Planar Hyperbolic Cayley Graphs

Published online by Cambridge University Press:  20 July 2017

Lorenz A. Gilch
Affiliation:
Know Center GmbH, Inffeldgasse 13, A-8010 Graz, Austria
Sebastian Müller
Affiliation:
Aix Marseille University, CNRS, Centrale Marseille, I2M, Marseille, France
Tullio Ceccherini-Silberstein
Affiliation:
Università degli Studi del Sannio, Italy
Maura Salvatori
Affiliation:
Università degli Studi di Milano
Ecaterina Sava-Huss
Affiliation:
Cornell University, New York
Get access

Summary

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2017

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] D., Aldous and R., Lyons. Processes on unimodular random networks. Electron. J. Probab., 12:no. 54, 1454–508, 2007.Google Scholar
[2] I., Benjamini, R., Lyons, and O., Schramm. Unimodular random trees. Preprint, http://arxiv.org/abs/1207.1752, 2012.
[3] I., Benjamini and S., Müller. On the trace of branching random walks. Groups Geom. Dyn., 2(2):231–47, 2012.Google Scholar
[4] I., Benjamini and Y., Peres. Markov chains indexed by trees. Ann. Probab., 1(1):219–43, 1994.Google Scholar
[5] D., Calegari. The ergodic theory of hyperbolic groups. Contemp. Math, pages 15–52, 2013.Google Scholar
[6] E., Candellero, L.A., Gilch, and S., Müller. Branching random walks on free products of groups. Proc. Lond. Math. Soc. (3), 6(6):1085–120, 2012.Google Scholar
[7] E., Candellero and M. I., Roberts. The number of ends of critical branching random walks. http://arxiv.org/abs/1401.0429, 2014.
[8] N., Gantert and S., Müller. The critical branching Markov chain is transient. Markov Process. and Rel. Fields., 12:805–14, 2007.Google Scholar
[9] S., Gouëzel. Local limit theorem for symmetric random walks in Gromovhyperbolic groups. J. Amer. Math. Soc., 3(3):893–928, 2014.Google Scholar
[10] S., Gouëzel and S. P., Lalley. Random walks on co-compact Fuchsian groups. Ann. Sci. Éc. Norm. Supér. (4), 1(1):129–73, 2013.Google Scholar
[11] I., Hueter and S. P., Lalley. Anisotropic branching random walks on homogeneous trees. Probab. Th. Rel. Fields, 1(1):57–88, 2000.Google Scholar
[12] R., Lyons, with Y., Peres. Probability on Trees and Networks. Cambridge University press, In preparation. Current version available at http://mypage.iu.edu/~rdlyons/.
[13] S., Müller. Interacting growth processes and invariant percolation. Ann. Appl. Prob., 1(1):268–86, 2015.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×