Related papers: Periodic solutions of one-dimensional cellular aut…
A random boolean cellular automaton is a network of boolean gates where the inputs, the boolean function, and the initial state of each gate are chosen randomly. In this article, each gate has two inputs. Let $a$ (respectively $c$) be the…
Many discrete-time optimal stopping problems are known to have more tractable limit forms based on a planar Poisson process. Using this tool we find a solution to the optimal stopping problem for i.i.d. sequence of $n$ discrete uniform…
We investigate the low-noise regime of a large class of probabilistic cellular automata, including the North-East-Center model of A. Toom. They are defined as stochastic perturbations of cellular automata with a binary state space and a…
We consider the stochastic ranking process with the jump times of the particles determined by Poisson random measures. We prove that the joint empirical distribution of scaled position and intensity measure converges almost surely in the…
Timed automata are the formal model for real-time systems. Extensions with discrete probabilistic branching have been considered in the literature and successfully applied. Probabilistic timed automata (PTA) do require all branching…
Random events in space and time often exhibit a locally dependent structure. When the events are very rare and dependent structure is not too complicated, various studies in the literature have shown that Poisson and compound Poisson…
A convenient framework for dealing with asymptotic limit problems of probabilistic nature is provided. These problems include questions such as finding the asymptotic proportion of terms of a sequence falling inside a given interval, or the…
We consider the rate of piecewise constant approximation to a locally stationary process $X(t),t\in [0,1]$, having a variable smoothness index $\alpha(t)$. Assuming that $\alpha(\cdot)$ attains its unique minimum at zero and satisfies the…
The paper proposes a simple formalism for dealing with deterministic, non-deterministic and stochastic cellular automata in a unifying and composable manner. Armed with this formalism, we extend the notion of intrinsic simulation between…
We study the long-time asymptotics of the total mass of the solution to the parabolic Anderson model (PAM) on a supercritical Galton-Watson random tree with bounded degrees. We identify the second-order contribution to this asymptotics in…
The asymptotic behavior of a cellular automaton iterated on a random configuration is well described by its limit probability measure(s). In this paper, we characterize measures and sets of measures that can be reached as limit points after…
In this article, we consider Poisson and Poisson convoluted geometric approximation to the sums of $n$ independent random variables under moment conditions. We use Stein's method to derive the approximation results in total variation…
We studied the rule 150 elementary cellular automaton in terms of the distribution of the spacings of the singular values of the matieces obtained from proper time evolutions patterns. The distribution has strong resembrance to that of the…
We establish abstract limit theorems which provide sufficient conditions for a sequence $(A_{l})$ of rare events in an ergodic probability preserving dynamical system to exhibit Poisson asymptotics, and for the consecutive positions inside…
We study qualitative properties of two-dimensional freezing cellular automata with a binary state set initialized on a random configuration. If the automaton is also monotone, the setting is equivalent to bootstrap percolation. We explore…
We revisit a fundamental result in real-time verification, namely that the binary reachability relation between configurations of a given timed automaton is definable in linear arithmetic over the integers and reals. In this paper we give a…
Cellular automata are often used to model systems in physics, social sciences, biology that are inherently asynchronous. Over the past 20 years, studies have demonstrated that the behavior of cellular automata drastically changed under…
We consider the state-minimisation problem for weighted and probabilistic automata. We provide a numerically stable polynomial-time minimisation algorithm for weighted automata, with guaranteed bounds on the numerical error when run with…
We develop an algorithm for computing bounded reachability probability for hybrid systems, i.e., the probability that the system reaches an unsafe region within a finite number of discrete transitions. In particular, we focus on hybrid…
The Metropolis process (MP) and Simulated Annealing (SA) are stochastic local search heuristics that are often used in solving combinatorial optimization problems. Despite significant interest, there are very few theoretical results…