15 problems
Let and be rooted graphs, with the space of isomorphism classes of rooted graphs equipped with the local metric. Restrict to transitive graphs satisfying…
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…
Universal mandatory and blocking edge conjecture. The marked random graphs
Construct the locally finite connected rooted random graph from the partially labeled rooted random tree as described in the source: even-generation vertice…
Infinite-condensation-root conjecture. If and , then converges locally in distribution towards a limit \tau^ whose root has an infinite number of…
Continuity-at-infinity conjecture. If , then converges locally in distribution towards \tau^ as .
High-regime convergence conjecture. If , equivalently if has some positive exponential moments, then converges locally in distribution towards \tau^ in the hi…
Compactified unrooted convergence conjecture. The sequence converges weakly with respect to .
Compactified rooted convergence conjecture. The sequence converges weakly with respect to .
Rooted minor-exclusion convergence conjecture. The sequence converges weakly.
Minor-closed-family convergence conjecture. The uniformly random -vertex graph from any minor-closed family converges in this sense.
Let be the canonical process under the excursion measure of the strong Markov process at zero. Write for the height process, for its lifetime, an…
Let be the canonical process under the excursion measure of the strong Markov process at zero. Write for the height process, for its lifetime, an…
A graphing is a bounded-degree Borel graph satisfying the Intrinsic Mass Transport Principle. A bounded-degree graph sequence has a Benjamini–Schramm limit when the distribution of…
Local convergence conjecture. The pair