arXiv · 1506.02697
Group-Walk Random Graphs
Abstract
We introduce a construction that gives rise to a variety of "geometric" finite random graphs, and describe connections to the Poisson boundary, Naim's kernel, and Sznitman's random interlacements.
Explore related subjects
Keep this discovery
Agelos Georgakopoulos. 2015-05-24. Group-Walk Random Graphs. https://arxiv.org/abs/1506.02697
Cite the original work for its findings. Save a collection to share your selection of sources.