ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an infinite vertex-transitive graph of bounded degree, with every edge assigned length 11 and the resulting graph metric. Let Π0(G)\Pi_0(G) place one node at each vertex, and let Πt(G)\Pi_t(G) be obtained by moving these nodes independently along the edges according to Brownian motion for time tt. Let R(Πt(G))R(\Pi_t(G)) be the union of metric balls of radius 1/21/2 centered at the nodes of Πt(G)\Pi_t(G). Transitive-graph nonpercolation conjecture. For any t>0t>0, R(Πt(G))R(\Pi_t(G)) contains only finite components almost surely. The conjecture asks whether vertex transitivity alone, together with bounded degree, prevents percolation after every positive-time Brownian perturbation; the supplied parser status is unknown, so its resolution is not established here.

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.