Related papers: A note on the enumeration of directed animals via …
In this paper, we revisit the enumeration of directed animals using gas models. We show that there exists a natural construction of random directed animals on any directed graph together with a particle system that explains at the level of…
We give a systematic presentation of relations between lattice gas models with hard-core interactions, enumeration of directed-site animals, and the algebra of formal power-series in the partially commutative case, along the work of…
This article introduces a new, simple solvable lattice for directed animals: the directed king's lattice, or square lattice with next nearest neighbor bonds and preferred directions {W, NW, N, NE, E}. We show that the directed animals in…
A directed animal is a percolation cluster in the directed site percolation model. The aim of this paper is to exhibit a strong relation between the problem of computing the generating function $\G$ of directed animals on the square…
We define a lattice model for rock, absorbers, and gas that makes it possible to examine the flow of gas to a complicated absorbing boundary over long periods of time. The motivation is to deduce the geometry of the boundary from the time…
We consider the local limit of finite uniformly distributed directed animals on the square lattice viewed from the root. Two constructions of the resulting uniform infinite directed animal are given: one as a heap of dominoes, constructed…
Improved communication systems, shrinking battery sizes and the price drop of tracking devices have led to an increasing availability of trajectory tracking data. These data are often analyzed to understand animal behavior. In this work, we…
Using the generalized normally ordered form of words in a locally-free group of $n$ generators, we show that in the limit $n\to\infty$, the partition function of weighted directed lattice animals on a semi-infinite strip coincides with the…
It is well established that gene expression can be modeled as a Markovian stochastic process and hence proper observables might be subjected to large fluctuations and rare events. Since dynamics is often more than statics, one can work with…
We present a general functional central limit theorem started at a point also known under the name of quenched. As a consequence, we point out several new classes of stationary processes, defined via projection conditions, which satisfy…
The tail chain of a Markov chain can be used to model the dependence between extreme observations. For a positive recurrent Markov chain, the tail chain aids in describing the limit of a sequence of point processes $\{N_n,n\geq1\}$,…
This paper presents a novel theoretical Monte Carlo Markov chain procedure in the framework of graphs. It specifically deals with the construction of a Markov chain whose empirical distribution converges to a given reference one. The Markov…
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 prove an apparently novel concentration of measure result for Markov tree processes. The bound we derive reduces to the known bounds for Markov processes when the tree is a chain, thus strictly generalizing the known Markov process…
We relate $\phi(\bf{x},s)$, the average number of sites at a transverse distance $\bf{x}$ in the directed animals with $s$ sites in $d$ transverse dimensions, to the two-point correlation function of a lattice gas with nearest neighbor…
For a spatial characteristic, there exist commonly fat-tail frequency distributions of fragment-size and -mass of glass, areas enclosed by city roads, and pore size/volume in random packings. In order to give a new analytical approach for…
We introduce a statistical mechanics formalism for the study of constrained graph evolution as a Markovian stochastic process, in analogy with that available for spin systems, deriving its basic properties and highlighting the role of the…
We present a new, efficient procedure to establish Markov equivalence between directed graphs that may or may not contain cycles under the \textit{d}-separation criterion. It is based on the Cyclic Equivalence Theorem (CET) in the seminal…
We consider the problem of uniformly generating a spanning tree, of a connected undirected graph. This process is useful to compute statistics, namely for phylogenetic trees. We describe a Markov chain for producing these trees. For cycle…
We define a random walk problem which admits analytic results, on a class of infinite periodic lattices which are directed and colored. Our approach is motivated from the fact that such lattices arise in string theoretic constructs of…