Invariant rho-percolation on regular trees

Itai Benjamini, Ori Gurel-Gurevich

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Given an invariant bond percolation on the d-regular tree, where the probability of an edge to be open equals p, is it always possible to find, with positive probability, an infinite self-avoiding path along which the density of open edges is bigger than p? We give positive answer when d >= 4 and explore related questions.

Original languageEnglish
Title of host publicationUNIMODULARITY IN RANDOMLY GENERATED GRAPHS
EditorsF Sobieczky
PublisherAmerican Mathematical Society
Pages29-32
Number of pages4
DOIs
StatePublished - 2018
EventDenver AMS Sectional Meeting on Unimodularity in Randomly Generated Graphs - Denver, United States
Duration: 8 Oct 20169 Oct 2016

Publication series

NameContemporary Mathematics
Volume719
ISSN (Print)0271-4132

Conference

ConferenceDenver AMS Sectional Meeting on Unimodularity in Randomly Generated Graphs
Country/TerritoryUnited States
CityDenver
Period8/10/169/10/16

Fingerprint

Dive into the research topics of 'Invariant rho-percolation on regular trees'. Together they form a unique fingerprint.

Cite this