SearcharxivSearch

arXiv subjects

Janko Gravner

Publications and source records attributed to Janko Gravner.

At least 19 recordsLinked to original sources

Two-stage Bootstrap Percolation

We introduce and study two variants of two-stage growth dynamics in $\mathbb{Z}^2$ with state space $\{0,1,2\}^{\mathbb{Z}^2}$. In each variant, vertices in state $0$ can be changed irreversibly to state $1$, and vertices in state $1$ can be changed permanently to state $2$. In the standard variant, a vertex flips from state $i$ to $i+1$ if it has at least two nearest-neighbors in state $i+1$. In the modified variant, a $0$ changes to a $1$ if it has both a north or south neighbor and an east or west neighbor in state $1$, and a $1$ changes to a $2$ if it has at least two nearest-neighbors in state $2$. We assume that the initial configuration is given by a product measure with small probabilities $p$ and $q$ of $1$s and $2$s. For both variants, as $p$ and $q$ tend to $0$, if $q$ is large compared to $p^{2+o(1)}$, then the final density of $0$s tends to $1$. When $q$ is small compared to $p^{2+o(1)}$, for standard variant the final density of $2$s tends to $1$, while for the modified variant the final density of $1$s tends to $1$. In fact, for the modified variant, the final density of $2$s approaches $0$ regardless of the relative size of $q$ versus $p$. These results remain unchanged if, in either variant, a $1$ changes to a $2$ only if it has both a north or south neighbor and an east or west neighbor in state $2$. An essential feature of these dynamics is that they are not monotone in the initial configuration.

math.PR

Polluted Modified Bootstrap Percolation

In the polluted modified bootstrap percolation model, sites in the square lattice are independently initially occupied with probability $p$ or closed with probability $q$. A site becomes occupied at a subsequent step if it is not closed and has at least one occupied nearest neighbor in each of the two coordinates. We study the final density of occupied sites when $p$ and $q$ are both small. We show that this density approaches $0$ if $q\ge Cp^2/\log p^{-1}$ and $1$ if $q\le p^2/(\log p^{-1})^{1+o(1)}$. Thus we establish a logarithmic correction in the critical scaling, which is known not to be present in the standard model, settling a conjecture of Gravner and McDonald from 1997.

math.PR

Young domination on Hamming rectangles

We introduce a family of domination-type problems in Cartesian products of two graphs. The framework captures several well-studied topics, including variants of bootstrap percolation, line growth, distance domination, and target set selection. We focus on Cartesian products of two complete graphs and formulate the notion of Young domination number in terms of a growth rule determined by a Young diagram; this number is the smallest cardinality of an initial set that covers the entire vertex set in a prescribed number $L$ of iterations of the rule. We compute the Young domination number with $L=1$ for several natural cases, including $k$-domination for Cartesian products of two complete graphs of the same order, thereby proving a conjecture from 2009 due to Burchett, Lane, and Lachniet. We show that the case of $L=1$ of Young domination is equivalent to computing bipartite Tur\'an numbers for families of double stars, yielding implications of our results in extremal graph theory. For arbitrary fixed $L$, we devise constant-factor approximation algorithms for the problem. Our approach is based on a variety of techniques, including duality between Young diagrams, algebraic formulations, explicit constructions, and dynamic programming.

math.CO

Competing deterministic growth models in two dimensions

We consider three-state cellular automata in two dimensions in which two colored states, blue and red, compete for control of the empty background, starting from low initial densities $p$ and $q$. When the dynamics of both colored types are one-dimensional, the dynamics has three distinct phases, characterized by a power relationship between $p$ and $q$: two in which one of the colors is prevalent, and one when the colored types block each other and leave most of the space forever empty. When one of the colors spread in two dimensions and the other in one dimension, we also establish a power relation between $p$ and $q$ that characterizes which of the two colors eventually controls most of the space.

math.PR

Two-dimensional supercritical growth dynamics with one-dimensional nucleation

We introduce a class of cellular automata growth models on the two-dimensional integer lattice with finite cross neighborhoods. These dynamics are determined by a Young diagram $\mathcal Z$ and the radius $ρ$ of the neighborhood, which we assume to be sufficiently large. A point becomes occupied if the pair of counts of currently occupied points on the horizontal and vertical parts of the neighborhood lies outside $\mathcal Z$. Starting with a small density $p$ of occupied points, we focus on the first time $T$ at which the origin is occupied. We show that $T$ scales as a power of $1/p$, and identify that power, when $\mathcal Z$ is the triangular set that gives threshold-$r$ bootstrap percolation, when $\mathcal Z$ is a rectangle, and when it is a union of a finite rectangle and an infinite strip. We give partial results when $\mathcal Z$ is a union of two finite rectangles. The distinguishing feature of these dynamics is nucleation of lines that grow to significant length before most of the space is covered.

math.PR

Weakly robust periodic solutions of one-dimensional cellular automata with random rules

We study $2$-neighbor one-dimensional cellular automata with a large number $n$ of states and randomly selected rules. We focus on the rules with weakly robust periodic solutions (WRPS). WRPS are global configurations that exhibit spatial and temporal periodicity and advance into any environment with at least a fixed strictly positive velocity. Our main result quantifies how unlikely WRPS are: the probability of existence of a WRPS within a finite range of periods is asymptotically proportional to $1/n$, provided that a divisibility condition is satisfied. Our main tools come from random graph theory and the Chen-Stein method for Poisson approximation.

math.PR

Transitive closure in a polluted environment

We introduce and study a new percolation model, inspired by recent works on jigsaw percolation, graph bootstrap percolation, and percolation in polluted environments. Start with an oriented graph $G_0$ of initially occupied edges on $n$ vertices, and iteratively occupy additional (oriented) edges by transitivity, with the constraint that only open edges in a certain random set can ever be occupied. All other edges are closed, creating a set of obstacles for the spread of occupied edges. When $G_0$ is an unoriented linear graph, and leftward and rightward edges are open independently with possibly different probabilities, we identify three regimes in which the set of eventually occupied edges is either all open edges, the majority of open edges in one direction, or only a very small proportion of all open edges. In the more general setting where $G_0$ is a connected unoriented graph of bounded degree, we show that the transition between sparse and full occupation of open edges occurs when the probability of open edges is $(\log n)^{-1/2+o(1)}$. We conclude with several conjectures and open problems.

math.PR

Maximal temporal period of a periodic solution generated by a one-dimensional cellular automaton

We study one-dimensional cellular automata evolutions with both temporal and spatial periodicity. The main objective is to investigate the longest temporal periods among all two-neighbor rules, with a fixed spatial period $σ$ and number of states $n$. When $σ= 2, 3, 4$, or $6$, and we restrict the rules to be additive, the longest period can be expressed as the exponent of the multiplicative group of an appropriate ring. We also construct non-additive rules with temporal period on the same order as the trivial upper bound $n^σ$. Experimental results, open problems, and possible extensions of our results are also discussed.

math.DS

Periodic solutions of one-dimensional cellular automata with random rules

We study cellular automata with randomly selected rules. Our setting are two-neighbor rules with a large number $n$ of states. The main quantity we analyze is the asymptotic probability, as $n \to \infty$, that the random rule has a periodic solution with given spatial and temporal periods. We prove that this limiting probability is non-trivial when the spatial and temporal periods are confined to a finite range. The main tool we use is the Chen-Stein method for Poisson approximation. The limiting probability distribution of the smallest temporal period for a given spatial period is deduced as a corollary and relevant empirical simulations are presented.

math.PR

One-dimensional cellular automata with random rules: longest temporal period of a periodic solution

We study one-dimensional cellular automata whose rules are chosen at random from among $r$-neighbor rules with a large number $n$ of states. Our main focus is the asymptotic behavior, as $n \to \infty$, of the longest temporal period $X_{σ,n}$ of a periodic solution with a given spatial period $σ$. We prove, when $σ\le r$, that this random variable is of order $n^{σ/2}$, in that $X_{σ,n}/n^{σ/2}$ converges to a nontrivial distribution. For the case $σ> r$, we present empirical evidence in support of the conjecture that the same result holds.

math.PR

Parking on transitive unimodular graphs

Place a car independently with probability $p$ at each site of a graph. Each initially vacant site is a parking spot that can fit one car. Cars simultaneously perform independent random walks. When a car encounters an available parking spot it parks there. Other cars can still drive over the site, but cannot park there. For a large class of transitive and unimodular graphs, we show that the root is almost surely visited infinitely many times when $p \geq 1/2$, and only finitely many times otherwise.

math.PR

Bootstrap percolation on the product of the two-dimensional lattice with a Hamming square

Bootstrap percolation on a graph is a deterministic process that iteratively enlarges a set of occupied sites by adjoining points with at least $θ$ occupied neighbors. The initially occupied set is random, given by a uniform product measure with a low density $p$. Our main focus is on this process on the product graph $\mathbb{Z}^2\times K_n^2$, where $K_n$ is a complete graph. We investigate how $p$ scales with $n$ so that a typical site is eventually occupied. Under critical scaling, the dynamics with even $θ$ exhibits a sharp phase transition, while odd $θ$ yields a gradual percolation transition. We also establish a gradual transition for bootstrap percolation on $\mathbb{Z}^2\times K_n$. The main tool is heterogeneous bootstrap percolation on $\mathbb{Z}^2$.

math.PR

Maximal spanning time for neighborhood growth on the Hamming plane

We consider a long-range growth dynamics on the two-dimensional integer lattice, initialized by a finite set of occupied points. Subsequently, a site $x$ becomes occupied if the pair consisting of the counts of occupied sites along the entire horizontal and vertical lines through $x$ lies outside a fixed Young diagram $\mathcal{Z}$. We study the extremal quantity $μ(\mathcal{Z})$, the maximal finite time at which the lattice is fully occupied. We give an upper bound on $μ(\mathcal{Z})$ that is linear in the area of the bounding rectangle of $\mathcal{Z}$, and a lower bound $\sqrt{s-1}$, where $s$ is the side length of the largest square contained in $\mathcal{Z}$. We give more precise results for a restricted family of initial sets, and for a simplified version of the dynamics.

math.CO

Polluted Bootstrap Percolation in Three Dimensions

In the polluted bootstrap percolation model, vertices of the cubic lattice $\mathbb{Z}^3$ are independently declared initially occupied with probability $p$ or closed with probability $q$. Under the standard (respectively, modified) bootstrap rule, a vertex becomes occupied at a subsequent step if it is not closed and it has at least $3$ occupied neighbors (respectively, an occupied neighbor in each coordinate). We study the final density of occupied vertices as $p,q\to 0$. We show that this density converges to $1$ if $q \ll p^3(\log p^{-1})^{-3}$ for both standard and modified rules. Our principal result is a complementary bound with a matching power for the modified model: there exists $C$ such that the final density converges to $0$ if $q > Cp^3$. For the standard model, we establish convergence to $0$ under the stronger condition $q>Cp^2$.

math.PR

Polluted Bootstrap Percolation with Threshold Two in All Dimensions

In the polluted bootstrap percolation model, the vertices of a graph are independently declared initially occupied with probability p or closed with probability q. At subsequent steps, a vertex becomes occupied if it is not closed and it has at least r occupied neighbors. On the cubic lattice Z^d of dimension d>=3 with threshold r=2, we prove that the final density of occupied sites converges to 1 as p and q both approach 0, regardless of their relative scaling. Our result partially resolves a conjecture of Morris, and contrasts with the d=2 case, where Gravner and McDonald proved that the critical parameter is q/{p^2}.

math.PR

Limiting behavior of 3-color excitable media on arbitrary graphs

Fix a simple graph $G=(V,E)$ and choose a random initial 3-coloring of vertices drawn from a uniform product measure. The 3-color cycle cellular automaton is a process in which at each discrete time step in parallel, every vertex with color $i$ advances to the successor color $(i+1)$ mod 3 if in contact with a neighbor with the successor color, and otherwise retains the same color. In the Greenberg-Hastings Model, the same update rule applies only to color 0, while other two colors automatically advance. The limiting behavior of these processes has been studied mainly on the integer lattices. In this paper, we introduce a monotone comparison process defined on the universal covering space of the underlying graph, and characterize the limiting behavior of these processes on arbitrary connected graphs. In particular, we establish a phase transition on the Erdös-Rényi random graph. On infinite trees, we connect the rate of color change to the cloud speed of an associated tree-indexed walk. We give estimates of the cloud speed by generalizing known results to trees with leaves.

math.PR

Neighborhood growth dynamics on the Hamming plane

We initiate the study of general neighborhood growth dynamics on two dimensional Hamming graphs. The decision to add a point is made by counting the currently occupied points on the horizontal and the vertical line through it, and checking whether the pair of counts lies outside a fixed Young diagram. We focus on two related extremal quantities. The first is the size of the smallest set that eventually occupies the entire plane. The second is the minimum of an energy-entropy functional that comes from the scaling of the probability of eventual full occupation versus the density of the initial product measure within a rectangle. We demonstrate the existence of this scaling and study these quantities for large Young diagrams.

math.CO

Stability of cellular automata trajectories revisited: branching walks and Lyapunov profiles

We study non-equilibrium defect accumulation dynamics on a cellular automaton trajectory: a branching walk process in which a defect creates a successor on any neighborhood site whose update it affects. On an infinite lattice, defects accumulate at different exponential rates in different directions, giving rise to the Lyapunov profile. This profile quantifies instability of a cellular automaton evolution and is connected to the theory of large deviations. We rigorously and empirically study Lyapunov profiles generated from random initial states. We also introduce explicit and computationally feasible variational methods to compute the Lyapunov profiles for periodic configurations, thus developing an analogue of Floquet theory for cellular automata.

math.PR