ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A graphing is a measure-preserving graph limit object for bounded-degree graphs, and a unimodular distribution is a distribution on rooted countable graphs satisfying the unimodularity condition. A bounded-degree graph sequence is convergent when all rooted-neighborhood probabilities converge. Aldous–Lyons conjecture. Every graphing is the limit of a convergent sequence of bounded-degree graphs. Equivalently, every unimodular distribution on rooted countable graphs with bounded degree is the limit of a bounded-degree graph sequence.

This conjecture asks whether every analytic local weak limit of bounded-degree graphs can be approximated by finite bounded-degree graphs. The preceding theorem records equivalent limit objects for convergent sequences, but does not establish the converse asserted 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.