Strong-recurrence threshold conjecture for branching random walks on bounded-degree graphs
Statement
Let be a graph with bounded degrees, let be the transition kernel of the underlying random walk, and for each induced connected subgraph with finite boundary let be the corresponding restricted transition kernel. Define
where the infimum is over all such induced connected subgraphs . Let 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 be a graph with bounded degrees. Then the BRW is strongly recurrent if and only if
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.