712 problems
- 0 votes0 replies0 views
Schramm's locality conjecture for the percolation critical probability
Let and be rooted graphs, with the space of isomorphism classes of rooted graphs equipped with the local metric. Restrict to transitive graphs satisfying…
- 0 votes0 replies0 views
Kasteleyn's bunkbed conjecture
Let and be two copies of a finite graph with vertex labels . For , form the bunkbed graph with…
- 0 votes0 replies0 views
Schramm's SLE conjecture for the percolation strip hull
Consider a square lattice at the critical percolation point , and its medial lattice with wired boundary conditions on one side and free boundary conditions on the other.…
- 0 votes0 replies0 views
Self-dual critical-point conjecture for plaquette percolation
Self-dual critical-point conjecture. In these systems, the critical point is conjectured to be
- 0 votes0 replies0 views
Erdős–Spencer giant-component conjecture for the hypercube
Let be the graph with vertex set in which two vertices are adjacent if they differ in exactly one coordinate, and write for its order. Let be the…
- 0 votes0 replies0 views
Benjamini's conjecture on the anchored isoperimetric profile in supercritical percolation
Let and consider i.i.d. bond percolation on with parameter . Let be the almost surely unique infinite open cluster, let…
- 0 votes0 replies0 views
Cardy's formula in Carleson's version for critical percolation
Let be a simply connected domain in the complex plane, and let be boundary points in counterclockwise order. Suppose that is conformally equivalent to the equilat…
- 0 votes0 replies0 views
Erdős–Spencer phase-transition conjecture for percolated hypercubes
Let be the binary hypercube and let be the random subgraph obtained by retaining each edge independently with probability . A giant component is a connected compon…
- 0 votes0 replies0 views
Noise sensitivity of being above the median for rectangle crossing times
Let denote the rectangle crossing time, and let be a sequence with . Being above the median of means the corresponding indicator p…
- 0 votes0 replies0 views
Pemantle–Stacey conjecture on local changes and the contact-process critical parameter
Consider the contact process on a connected graph, and modify the graph only locally while preserving connectedness. Pemantle–Stacey conjecture. The critical parameter of the conta…
- 0 votes0 replies0 views
Newman's infinite-ends conjecture for the graph of infection
Let be the graph of infection from the origin in first-passage percolation, and let denote its number of ends. **Newman's infinite-ends c…
- 0 votes0 replies0 views
Higher-dimensional phase-transition conjecture for merged percolation and random graphs
Higher-dimensional phase-transition conjecture. Similar results hold in higher dimensions whenever
- 0 votes0 replies0 views
Critical torus cluster-size conjecture
Critical torus cluster-size conjecture. The largest cluster with periodic boundary conditions should have the same scaling as the largest cluster with zero boundary conditions, nam…
- 0 votes0 replies0 views
Small-boundary-ball hitting conjecture for critical percolation clusters
Let , let , define … and let be the set of vertices in connected to the origin by open paths contained in . Small-bou…
- 0 votes0 replies1 view
Locality of the critical percolation probability
For a sequence of graphs whose local limits determine their local structure, consider the critical percolation probability for transitive graphs, where is the infimum o…
- 0 votes0 replies0 views
Long-cycle conjecture for the percolated hypercube above the supercritical threshold
Long-cycle conjecture. Let be a constant, and let
- 0 votes0 replies0 views
Slab nonamenability criterion for strict Hausdorff threshold inequality
Let be a graph equipped with a nonunimodular transitive automorphism group, and let and denote the Hausdorff and uniqueness thresholds, respectively. Suppose that t…
- 0 votes0 replies0 views
The CLE scaling-limit conjecture for critical Q-Potts random cluster interfaces
CLE scaling-limit conjecture. CLE with parameter is conjectured to be the scaling limit of the percolation interfaces in the critical -Potts random cluster model.
- 0 votes0 replies0 views
Critical percolation absence conjecture for transitive graphs
Critical percolation absence conjecture. If , then there are no infinite clusters at .
- 0 votes0 replies0 views
Continuity conjecture for the percolation order parameter on infinite transitive graphs
Let be an infinite transitive graph, let denote the percolation order parameter at parameter , and say that is one-dimensional in the sense used for transi…
- 0 votes0 replies0 views
High-temperature Ising–percolation universality conjecture
Consider the high-temperature Ising model and critical Bernoulli percolation as two planar lattice models. High-temperature Ising–percolation universality conjecture. The universal…
- 0 votes0 replies0 views
Linusson's bunkbed conjecture for hypergraph percolation
Let be a hypergraph and let be a set of posts. In the conditioned model , precisely one of the two copies…
- 0 votes0 replies0 views
Connectivity threshold conjecture for the k-cluster random geometric graph
Connectivity threshold conjecture. For the filtered graph,
- 0 votes0 replies0 views
The CLE scaling-limit conjecture for FK random-cluster models
Recall that the Fortuin–Kasteleyn (FK) random-cluster model has cluster weight . More generally, let , and set … For , let…
- 0 votes0 replies1 view
Absence of an infinite cluster at criticality for high-dimensional percolation
Let and consider Bernoulli bond percolation on , with critical probability … An edge is open when its Bernoulli() state is , and an open cluster is a…