Isoperimetric inequalities and transient random walks on graphs
From MaRDI portal
Publication:1201190
DOI10.1214/aop/1176989708zbMath0756.60065OpenAlexW1994457272MaRDI QIDQ1201190
Publication date: 17 January 1993
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aop/1176989708
hyperbolicityrandom walks on graphsparabolicitysmallest number of vertices in the boundary of a connected subgraph
Random graphs (graph-theoretic aspects) (05C80) Sums of independent random variables; random walks (60G50) Applications of graph theory to circuits and networks (94C15)
Related Items
Anchored expansion, speed and the Poisson-Voronoi tessellation in symmetric spaces ⋮ Transience and anchored isoperimetric dimension of supercritical percolation clusters ⋮ Minimal webs in Riemannian manifolds ⋮ A generalized Cheeger inequality ⋮ Topological groups and recurrence of quasi transitive graphs ⋮ Finite-energy infinite clusters without anchored expansion ⋮ Entire functions arising from trees ⋮ Cutpoints and resistance of random walk paths ⋮ Rough Isometries and Dirichlet Finite Harmonic Functions on Graphs ⋮ Anchored expansion, percolation and speed. (With an appendix by Gábor Pete) ⋮ Random walks on supercritical percolation clusters ⋮ A note on exit time for anchored isoperimetry ⋮ Planar stochastic hyperbolic triangulations ⋮ Anchored expansion of Delaunay complexes in real hyperbolic space and stationary point processes ⋮ Random walks on stochastic hyperbolic half planar triangulations ⋮ Strong isoperimetric inequality for the edge graph of a tiling of the plane
