Group-Walk Random Graphs

DOI10.1017/9781316576571.009MaRDI QIDQ5365548zbMATH OpenOpenAlexFDO

Authors Agelos Georgakopoulos

Publication date 6 October 2017

Full work available at URL https://arxiv.org/abs/1506.02697

zbMATH Keywords

geometric finite random graphsNaim kernelPoisson boundarySznitman's random interlacements

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

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.

Cited in

(6)

• Harmonic Dirichlet functions on planar graphs
• A time-invariant random graph with splitting events
• Every countable infinite group admits a long range percolation with a phase transition
• Random walks and induced Dirichlet forms on self-similar sets
• Percolation on an infinitely generated group
• Connectedness of spheres in Cayley graphs

This page was built for publication: Group-Walk Random Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5365548)