Zobrazeno 1 - 10
of 68
pro vyhledávání: '"Taati, Siamak"'
Autor:
Ayach, Yahya, Khairallah, Anthony, Manoukian, Tia, Mchaimech, Jad, Salha, Adam, Taati, Siamak
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 identically distributed random variables is deterministic (i.e., has a probabi
Externí odkaz:
http://arxiv.org/abs/2406.14902
Chaotic dependence on temperature refers to the phenomenon of divergence of Gibbs measures as the temperature approaches a certain value. Models with chaotic behaviour near zero temperature have multiple ground states, none of which are stable. We st
Externí odkaz:
http://arxiv.org/abs/2302.07326
Autor:
Taati, Siamak
We consider reversible and surjective cellular automata perturbed with noise. We show that, in the presence of positive additive noise, the cellular automaton forgets all the information regarding its initial configuration exponentially fast. In part
Externí odkaz:
http://arxiv.org/abs/2105.00725
Publikováno v:
Fundamenta Informaticae, Volume 185, Issue 1 (March 10, 2022) fi:7178
Given a finite set of local constraints, we seek a cellular automaton (i.e., a local and uniform algorithm) that self-stabilises on the configurations that satisfy these constraints. More precisely, starting from a finite perturbation of a valid conf
Externí odkaz:
http://arxiv.org/abs/2101.12682
Gibbsian representations of continuous specifications: the theorems of Kozlov and Sullivan revisited
Publikováno v:
Communications in Mathematical Physics, 382(2):1111-1164, 2021
The theorems of Kozlov and Sullivan characterize Gibbs measures as measures with positive continuous specifications. More precisely, Kozlov showed that every positive continuous specification on symbolic configurations of the lattice is generated by
Externí odkaz:
http://arxiv.org/abs/2001.03880
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 times. Each node can be either active or inactive, and two nodes connected
Externí odkaz:
http://arxiv.org/abs/1912.13011
Publikováno v:
Nonlinearity, 33(5): 2409-2454, mar 2020
We formulate and prove a very general relative version of the Dobrushin-Lanford-Ruelle theorem which gives conditions on constraints of configuration spaces over a finite alphabet such that for every absolutely summable relative interaction, every tr
Externí odkaz:
http://arxiv.org/abs/1809.00078
Publikováno v:
Electronic Journal of Probability, Volume 24 (2019), paper no. 41, 44 pp
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 would like to understand the effect of small random perturbations on the d
Externí odkaz:
http://arxiv.org/abs/1712.05500
Publikováno v:
Electronic Journal of Probability 2018, Vol. 23, paper no. 97, 1-65
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 particles appear subject to a neighbourhood exclusion constraint, whil
Externí odkaz:
http://arxiv.org/abs/1710.10232
The density classification problem is the computational problem of finding the majority in a given array of votes in a distributed fashion. It is known that no cellular automaton rule with binary alphabet can solve the density classification problem.
Externí odkaz:
http://arxiv.org/abs/1604.04402