31 citations · 113 across the 17 of their papers we have counts for
6 papers · 1 filter
Positive-rate PCA and IPS with stationary Bernoulli measures are rapidly forgetful
Irène Marcovici, Siamak Taati
We prove that every probabilistic cellular automaton with strictly positive transition probabilities that admits a stationary Bernoulli measure is exponentially ergodic. Moreover,…
Zero-one laws for events with positional symmetries
Yahya Ayach, Anthony Khairallah, Tia Manoukian +3
We use an information-theoretic argument due to O'Connell (2000) to prove that every sufficiently symmetric event concerning a countably infinite family of independent and identica…
Crossover times in bipartite networks with activity constraints and time-varying switching rates
Sem Borst, Frank den Hollander, Francesca Nardi +1
In this paper we study the performance of a bipartite network in which customers arrive at the nodes of the network, but not all nodes are able to serve their customers at all time…
Ergodicity of some classes of cellular automata subject to noise
Irène Marcovici, Mathieu Sablik, Siamak Taati
Cellular automata (CA) are dynamical systems on symbolic configurations on the lattice. They are also used as models of massively parallel computers. As dynamical systems, one woul…
Metastability of hard-core dynamics on bipartite graphs
Frank den Hollander, Francesca R. Nardi, Siamak Taati
We study the metastable behaviour of a stochastic system of particles with hard-core interactions in a high-density regime. Particles sit on the vertices of a bipartite graph. New…
Restricted density classification in one dimension
Siamak Taati
The density classification task is to determine which of the symbols appearing in an array has the majority. A cellular automaton solving this task is required to converge to a uni…