Conjecture on the asymptotic distribution of the longest expanded cycle
Statement
Let
be the spatial period and $r$ the neighborhood radius in the random-rule cellular automaton, and let $C_n$ denote the longest expanded cycle of its de Bruijn-like expanded cycle graph after cemetery vertices are eliminated. Fix arbitrary $,r\text{?}$ Wait. Letbe the spatial period parameter and the neighborhood radius, and consider the limit as . The asymptotic cycle-length conjecture. If
n^{-}C_n\to 1
is even, then converges in distribution to a nontrivial bimodal distribution. The conjecture extends the results proved when the spatial period does not exceed the number of neighbors; simulations suggest that the same parity-dependent behavior persists when , where dependencies among arcs make a rigorous analysis difficult.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.