A factor of IID is a stochastic process obtained by applying a measurable equivariant rule to independent
identically distributed labels. On a graph, place independent uniform labels in at the vertices and apply
a rule that respects graph isomorphisms. The output may consist of vertex
states or an edge configuration. For a fixed graph,
equivariance means that relabeling by any graph
automorphism relabels the output in the same way. The rule can depend on infinitely
many input labels and need not be a finite-radius algorithm.
Factor of IID
See also
Graph Automorphism, Independent StatisticsExplore with Wolfram|Alpha
References
Lyons, R. "Factors of IID on Trees." Combin. Probab. Comput. 26, 285-300, 2017. https://doi.org/10.1017/S096354831600033X.Cite this as:
Weisstein, Eric W. "Factor of IID." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/FactorofIID.html