Marginal dynamics of probabilistic cellular automata on trees

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Lacker, Daniel, Ramanan, Kavita, Wu, Ruoyu
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915577346392064
author Lacker, Daniel
Ramanan, Kavita
Wu, Ruoyu
author_facet Lacker, Daniel
Ramanan, Kavita
Wu, Ruoyu
contents We study locally interacting processes in discrete time, often called probabilistic cellular automata, indexed by locally finite graphs. For infinite regular trees and certain generalized Galton-Watson trees, we show that the marginal evolution at a single vertex and its neighborhood can be characterized by an autonomous stochastic recursion referred to as the local-field equation. This evolution can be viewed as a nonlinear or measure-dependent chain, but the measure dependence arises from the symmetries of the underlying tree rather than from any mean field interactions. We discuss applications to simulation of marginal dynamics and approximations of empirical measures of interacting chains on several generic classes of large-scale finite graphs that are locally tree-like. In addition to the symmetries of the tree, a key role is played by a second-order Markov random field property, which we establish for general graphs along with some other novel Gibbs measure properties.
format Preprint
id arxiv_https___arxiv_org_abs_2510_22533
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Marginal dynamics of probabilistic cellular automata on trees
Lacker, Daniel
Ramanan, Kavita
Wu, Ruoyu
Probability
Primary: 60K35, 60J05, Secondary: 37B15, 60J80
We study locally interacting processes in discrete time, often called probabilistic cellular automata, indexed by locally finite graphs. For infinite regular trees and certain generalized Galton-Watson trees, we show that the marginal evolution at a single vertex and its neighborhood can be characterized by an autonomous stochastic recursion referred to as the local-field equation. This evolution can be viewed as a nonlinear or measure-dependent chain, but the measure dependence arises from the symmetries of the underlying tree rather than from any mean field interactions. We discuss applications to simulation of marginal dynamics and approximations of empirical measures of interacting chains on several generic classes of large-scale finite graphs that are locally tree-like. In addition to the symmetries of the tree, a key role is played by a second-order Markov random field property, which we establish for general graphs along with some other novel Gibbs measure properties.
title Marginal dynamics of probabilistic cellular automata on trees
topic Probability
Primary: 60K35, 60J05, Secondary: 37B15, 60J80
url https://arxiv.org/abs/2510.22533