27 problems
- 0 votes0 replies1 view
Quantum symmetry conjecture for the graphs
Let be one of the -transitive orthogonal polar graphs, where is a prime power and . A graph has quantum symmetry if its quantum automorphism group…
- 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
Relentless percolation conjecture on touching edges of infinite clusters
Consider Bernoulli percolation on a transitive graph in a parameter regime where there are almost surely infinitely many infinite clusters. Two infinite clusters are said to have i…
- 0 votes0 replies1 view
Benjamini–Lyons–Schramm conjecture on transience of infinite percolation clusters
Benjamini–Lyons–Schramm conjecture. For every ,
- 0 votes0 replies1 view
Positive critical lifespan conjecture for the frog model on transitive graphs
Let be a vertex-transitive graph with superlinear growth, and let denote the critical lifespan for particle density . Positive critical lifes…
- 0 votes0 replies1 view
Abelianity conjecture for transitive graphs of non-negative Ollivier--Ricci curvature
Let be a transitive graph with non-negative Ollivier--Ricci curvature. Recall that two metric spaces are quasi-isometric if they are equivalent up to multiplicative and additiv…
- 0 votes0 replies0 views
Logarithmic correction conjecture for maximal displacement on transitive graphs
Maximal-displacement conjecture. The maximal displacement for a supercritical branching random walk on a transitive graph should exhibit the same behaviour; namely, if is…
- 0 votes0 replies1 view
Conjecture on the limiting order densities of cubic arc-transitive and semisymmetric graphs
For a positive integer , let the order density of a class of graphs mean the proportion of positive integers up to that occur as orders of graphs in that class. Order-densit…
- 0 votes0 replies0 views
Uniform expected-degree conjecture for percolation on transitive graphs
Let be a transitive graph that is not one-dimensional, let be a vertex of , and let denote its degree in the random open subgraph. Uniform expected-degree conj…
- 0 votes0 replies1 view
Benjamini–Schramm–Lyons–Peres–Schramm conjecture on the uniqueness threshold
Let be an infinite transitive graph, let be its critical percolation threshold, and let be its uniqueness threshold, the infimum of parameters for which there…
- 0 votes0 replies0 views
Easo–Hutchcroft universal critical-probability bound for transitive graphs
Easo–Hutchcroft conjecture. There exists a universal constant such that
- 0 votes0 replies0 views
Universal inverse-degree upper bound for critical percolation
Let be an infinite, connected, transitive, simple graph of vertex degree that is not one-dimensional, and let be its Bernoulli bond percolation critical probabilit…
- 0 votes0 replies0 views
Uniform subcritical decay criterion for non-one-dimensional transitive graphs
Let be the class of infinite transitive graphs of degree that are not one-dimensional. For a graph with origin , let be the sphere of radius a…
- 0 votes0 replies0 views
Uniform finite-size criterion for percolation on non-one-dimensional transitive graphs
Let be the class of infinite transitive graphs of degree that are not one-dimensional. For a graph with origin , let be the sphere of radius a…
- 0 votes0 replies0 views
Benjamini's uniqueness conjecture for giant components in finite transitive graphs
Benjamini's conjecture. The giant cluster should always be unique in the supercritical regime, irrespective of the geometry of .
- 0 votes0 replies0 views
The one-big-excursion conjecture for conditioned return times
Let be a locally finite, connected, transitive, transient graph with spectral radius , fix , and let be simple random walk started at .…
- 0 votes0 replies0 views
The first-return asymptotic conjecture for transient transitive graphs
The first-return asymptotic conjecture. One has , and more precisely
- 0 votes0 replies1 view
The folklore upper-bound conjecture for return probabilities
Consider simple random walk on a locally finite, connected, infinite, transitive graph , with -step return probability and spectra…
- 0 votes0 replies0 views
Tang's connectedness conjecture for free uniform spanning forests
Tang's connectedness conjecture. For every and every finite vertex-transitive graph , the on is connected almost surely.
- 0 votes0 replies0 views
Mean-field conjecture for critical percolation on transitive graphs of exponential growth
Let be a transitive graph of exponential growth, let be a vertex of , and let be the cluster of in critical Bernoulli bond percolation. Write for…
- 0 votes0 replies0 views
Finite Hamilton-cover conjecture for two-ended transitive graphs
Let be a two-ended transitive graph. A finite Hamilton cover is a finite collection of Hamiltonian spanning subgraphs whose union covers the relevant graph structure, as i…
- 0 votes0 replies0 views
Schramm's local-property conjecture for percolation thresholds
Consider Bernoulli bond percolation on a transitive graph, and let its percolation threshold be the critical probability separating almost-sure absence of an infinite cluster from…
- 0 votes0 replies0 views
The non-amenability and non-uniqueness phase conjecture for transitive graphs
Let be a general transitive graph, and consider independent percolation on . A graph is non-amenable when its isoperimetric constant is positive, and a non-uniqueness phase…
- 0 votes0 replies0 views
Quasi-spherical symmetry conjecture for percolation boundary measures
Let be a transitive graph, let be the radius- ball about , and let be its boundary. For simple random walk on , write for the…