ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph with bounded degrees, let PP be the transition kernel of the underlying random walk, and for each induced connected subgraph F⊂GF\subset G with finite boundary let PFP_F be the corresponding restricted transition kernel. Define

ρ~(P)=inf⁡Fρ(PF),\widetilde{\rho}(P)=\inf_F\rho(P_F),

where the infimum is over all such induced connected subgraphs FF. Let mm be the mean number of offspring of the branching random walk (BRW), and call the BRW strongly recurrent when it eventually visits every vertex almost surely.

Strong-recurrence threshold conjecture. Let GG be a graph with bounded degrees. Then the BRW is strongly recurrent if and only if

m>1/ρ~(P).m>1/\widetilde{\rho}(P).

This conjecture was previously made in the cited work of Müller and collaborators. General criteria for strong recurrence remain incomplete, so the conjecture is open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.