Related papers: Marginal dynamics of probabilistic cellular automa…
Recently, there has been significant interest in understanding the properties of Markov random fields (M.r.f.) defined on the independent sets of sparse graphs. When these M.r.f. are restricted to pairwise interactions (i.e. hardcore…
Evolution algebras are a new type of non-associative algebras which are inspired from biological phenomena. A special class of such algebras, called Markov evolution algebras, is strongly related to the theory of discrete time Markov…
A probabilistic cellular automaton (PCA) can be viewed as a Markov chain. The cells are updated synchronously and independently, according to a distribution depending on a finite neighborhood. We investigate the ergodicity of this Markov…
A classical local cellular automaton can describe an interacting quantum field theory for fermions. We construct a simple classical automaton for a particular version of the Thirring model with imaginary coupling. This interacting fermionic…
Interacting particle systems can often be constructed from a graphical representation, by applying local maps at the times of associated Poisson processes. This leads to a natural coupling of systems started in different initial states. We…
In this paper we study long-term evolution of a finite system of locally interacting birth-and-death processes labelled by vertices of a finite connected graph. A detailed description of the asymptotic behaviour is obtained in the case of…
We analyze the properties of degree-preserving Markov chains based on elementary edge switchings in undirected and directed graphs. We give exact yet simple formulas for the mobility of a graph (the number of possible moves) in terms of its…
We present a new family of models that is based on graphs that may have undirected, directed and bidirected edges. We name these new models marginal AMP (MAMP) chain graphs because each of them is Markov equivalent to some AMP chain graph…
We consider local Markov chain Monte-Carlo algorithms for sampling from the weighted distribution of independent sets with activity $\l$, where the weight of an independent set $I$ is $\l^{|I|}$. A recent result has established that Gibbs…
Many complex structures and stochastic patterns emerge from simple kinetic rules and local interactions, and are governed by scale invariance properties in combination with effects of the global geometry. We consider systems that can be…
We study marginally compact macromolecular trees that are created by means of two different fractal generators. In doing so, we assume Gaussian statistics for the vectors connecting nodes of the trees. Moreover, we introduce bond-bond…
Discrete dynamical systems can exhibit complex behaviour from the iterative application of straightforward local rules. A famous example are cellular automata whose global dynamics are notoriously challenging to analyze. To address this, we…
We study the properties of random walks on complex trees. We observe that the absence of loops reflects in physical observables showing large differences with respect to their looped counterparts. First, both the vertex discovery rate and…
Random models of evolution are instrumental in extracting rates of microscopic evolutionary mechanisms from empirical observations on genetic variation in genome sequences. In this context it is necessary to know the statistical properties…
We are interested in modeling some two-level population dynamics, resulting from the interplay of ecological interactions and phenotypic variation of individuals (or hosts) and the evolution of cells (or parasites) of two types living in…
Consider a discrete locally finite subset $\Gamma$ of $R^d$ and the complete graph $(\Gamma,E)$, with vertices $\Gamma$ and edges $E$. We consider Gibbs measures on the set of sub-graphs with vertices $\Gamma$ and edges $E'\subset E$. The…
This paper studies directional dynamics in cellular automata, a formalism previously introduced by the third author. The central idea is to study the dynamical behaviour of a cellular automaton through the conjoint action of its global rule…
We consider random walks on dynamical networks where edges appear and disappear during finite time intervals. The process is grounded on three independent stochastic processes determining the walker's waiting-time, the up-time and down-time…
We consider weakly interacting jump processes on time-varying random graphs with dynamically changing multi-color edges. The system consists of a large number of nodes in which the node dynamics depends on the joint empirical distribution…
The evolution of many stochastic systems is accurately described by random walks on graphs. We here explore the close connection between local steady-state fluctuations of random walks and the global structure of the underlying graph.…