Group-Walk Random Graphs
classification
🧮 math.PR
math.CO
keywords
randomgraphsboundaryconnectionsconstructiondescribefinitegeometric
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.