25 problems
Exceptional-time conjecture. Almost surely, exceptional times at which contains an unbounded component exist, and the Hausdorff dimension of the random set of such…
Let denote the rectangle crossing time, and let be a sequence with . Being above the median of means the corresponding indicator p…
Let denote the relevant point-to-point passage time, and let be its variance. Variance conjecture. The variance satisfies … This prediction is u…
Let be Boolean functions on , and let be continuous-time -biased random walks, with denoting the number of value cha…
Consider planar last-passage percolation with geometric weights. Let and denote the last-passage times in the original and site-resampled enviro…
Let be a sequence of connected graphs, with vertices, edge set , and maximum degree . Let be a non-negative sequence of times, let…
Dynamical exclusion-sensitivity threshold conjecture. If
Let a height process arise from a polymer model with a multilinear chaos expansion in an underlying environment field, and let be a bounded measurable functional of the height…
Consider a last-passage percolation model with a perturbation parameter , in which stability and chaos refer respectively to persistence and decorrelation of the geodesic, while…
Let and be the passage times at perturbation times and , and let and be the corresponding geodesics. Write for the varian…
Jacka–Warren–Windridge conjecture. Choosing a variable with maximum current value stochastically dominates every other strategy for general .
Let be the sparse random matrix and let denote its sparsity parameter. Theorem 1 and Theorem 2 concern the noise sensitivity results established in the paper for the top ei…
Benjamini–Kalai–Schramm conjecture. Knowing the Voronoi tessellation, but not the colouring of its cells, typically gives almost no information about whether the colouring contains…
Let be the Erdős–Rényi random graph at criticality, and let denote its largest component. For fixed , consider the property…
Let be a sequence of biases and let be Boolean functions, with the number of changes of during . A sequence…
Let be a random walk, where is a group and is its probability measure. The walk is entropy noise sensitive when its entropy noise sensitivity is defined in the…
Let be the first Grigorchuk group. The first Grigorchuk group's conjecture. The first Grigorchuk group is -noise sensitive. This is presented as a particular case of th…
Benjamini–Kalai–Schramm conjecture. With high probability, the quenched crossing probabilities are very close to the annealed crossing probabilities.
Consider Voronoi percolation in a region with a point configuration whose points are independently perturbed according to Brownian motions run for time . Let the event…
Expander noise-insensitivity conjecture. The condition should imply that complete occupation is noise insensitive.
Voronoi noise-sensitivity conjecture. Voronoi percolation is noise sensitive at criticality.
Shape-noise-sensitivity conjecture. If is bounded and simply connected, then the Poisson Boolean model for is noise sensitive at criticality.
Random-radius noise-sensitivity conjecture. For every and , the Poisson Boolean model with random radii chosen according to is noise sensitive at criticality.
Spectral–pivotal singularity conjecture. The scaling limits of
Let be the Boolean crossing functions under consideration, with spectral sample and pivotal set . Spectral-sample singularity conjectur…