Group-Walk Random Graphs

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.