Transitive-graph nonpercolation conjecture for Brownian-moving nodes
Statement
Let be an infinite vertex-transitive graph of bounded degree, with every edge assigned length and the resulting graph metric. Let place one node at each vertex, and let be obtained by moving these nodes independently along the edges according to Brownian motion for time . Let be the union of metric balls of radius centered at the nodes of . Transitive-graph nonpercolation conjecture. For any , 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.