The following pages link to Factors of IID on Trees (Q5366945):
Displaying 24 items.
- A monotone isomorphism theorem (Q525106) (← links)
- Finitely dependent processes are finitary (Q782416) (← links)
- Spectral measures of factor of i.i.d. processes on vertex-transitive graphs (Q1700413) (← links)
- Measure concentration and the weak Pinsker property (Q1720271) (← links)
- Finite-energy infinite clusters without anchored expansion (Q1983609) (← links)
- Ising model on trees and factors of IID (Q2071790) (← links)
- Unimodular Hausdorff and Minkowski dimensions (Q2076635) (← links)
- Stationary distributions for the Voter model in \(d\geq 3\) are factors of IID (Q2139108) (← links)
- Entropy inequalities for factors of IID (Q2319838) (← links)
- Suboptimality of local algorithms for a class of max-cut problems (Q2421823) (← links)
- On the almost eigenvectors of random regular graphs (Q2421826) (← links)
- Correlation Bounds for Distant Parts of Factor of IID Processes (Q4601049) (← links)
- Equivariant thinning over a free group (Q5220085) (← links)
- Invariant tilings and unimodular decorations of Cayley graphs (Q5236804) (← links)
- Factor of IID Percolation on Trees (Q5298168) (← links)
- Local approximation of the maximum cut in regular graphs (Q5918122) (← links)
- Factor-of-iid balanced orientation of non-amenable graphs (Q6057456) (← links)
- A factor of i.i.d. with uniform marginals and infinite clusters spanned by equal labels (Q6068420) (← links)
- Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree (Q6076731) (← links)
- Continuity of the Ising phase transition on nonamenable groups (Q6080995) (← links)
- A note on internal partitions: the 5-regular case and beyond (Q6121923) (← links)
- Uniform even subgraphs and graphical representations of Ising as factors of i.i.d. (Q6126971) (← links)
- Random interlacement is a factor of i.i.d. (Q6165199) (← links)
- On minimum vertex bisection of random \(d\)-regular graphs (Q6564623) (← links)
