|
The free uniform spanning forest is a factor of IID
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
LOADING...
0%
thinking... about 3 hours remaining
GAME #231
The free uniform spanning forest is a factor of IID
1 level of pure luck, magnets!
PLAY
LEAN
VERIFIED
If this game doesn't work on your computer, go here for help. (Lean version available!)expertly designed by an internal OpenAI model
| >>> How to Play <<< |
| The free uniform spanning forest is a factor of IID. On every infinite connected locally finite simple unweighted graph, the free uniform spanning forest is a factor of independent vertex labels, by one isomorphism-equivariant rule using no root. Translation-invariant strongly Rayleigh binary processes on every countable group, including invariant determinantal processes with Hermitian positive-contraction kernels, are also factors of IID. |
| >>> Level Select <<< |
|
We prove that the free uniform spanning forest is a factor of IID on every infinite connected locally finite simple unweighted graph. One Borel rule works for all such graphs and uses no root, answering affirmatively the general factor question for unimodular random graphs. We also show that every translation-invariant strongly Rayleigh process indexed by a countable group is a factor of IID, including invariant determinantal processes with Hermitian positive-contraction kernels. This group-action conclusion requires no amenability.
|
|