Group-Walk Random Graphs
Probability
2015-06-10 v1 Combinatorics
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.
Cite
@article{arxiv.1506.02697,
title = {Group-Walk Random Graphs},
author = {Agelos Georgakopoulos},
journal= {arXiv preprint arXiv:1506.02697},
year = {2015}
}