相关论文: Average site perimeter of directed animals on the …

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 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…

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…

We consider minimal-perimeter lattice animals, providing a set of conditions which are sufficient for a lattice to have the property that inflating all minimal-perimeter animals of a certain size yields (without repetitions) all…

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 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…

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…

In this paper, following the paper ``On the average hitting times of the squares of cycles,'' we provide an explicit formula for the average hitting times of a simple random walk on a directed graph with $N$ vertices, where the graph…

We present an implementation of Redelemeier's algorithm for the enumeration of lattice animals in high dimensional lattices. The implementation is lean and fast enough to allow us to extend the existing tables of animal counts, perimeter…

We have developed an improved algorithm that allows us to enumerate the number of site animals (polyominoes) on the square lattice up to size 46. Analysis of the resulting series yields an improved estimate, $\tau = 4.062570(8)$, for the…

Biggins [Uniform convergence of martingales in the branching random walk. {\em Ann. Probab.}, 20(1):137--151, 1992] proved local uniform convergence of additive martingales in $d$-dimensional supercritical branching random walks at complex…

Transfer-matrix methods on finite-width strips with free boundary conditions are applied to lattice site animals, which provide a model for randomly branched polymers in a good solvent. By assigning a distinct fugacity to sites along the…

We study here the social network generated by the asynchronous visits, to a fixed set of sites, of mobile agents modelled as independent random walks on the plane lattice. The social network is constructed by assuming that a group of agents…

We give a series of combinatorial results that can be obtained from any two collections (both indexed by $\Z\times \N$) of left and right pointing arrows that satisfy some natural relationship. When applied to certain self-interacting…

We study the statistics of column-convex lattice animals resulting from the stacking of squares on a single or double staircase. We obtain exact expressions for the number of animals with a given length and area, their mean length and their…

Stacked directed animals and multi-directed animals are two lattice models defined by Bousquet-M\'{e}lou and Rechnitzer in 2002. The original definitions of those models involve heaps of pieces, i.e., some geometric representation of…

We study diffusion on comb lattices of arbitrary dimension. Relying on the loopless structure of these lattices and using first-passage properties, we obtain exact and explicit formulae for the Laplace transforms of the propagators…

In this paper we study the statistical properties of convex hulls of $N$ random points in a plane chosen according to a given distribution. The points may be chosen independently or they may be correlated. After a non-exhaustive survey of…

We analyze how the transient dynamics of large dynamical systems in the vicinity of a stationary point, modeled by a set of randomly coupled linear differential equations, depends on the network topology. We characterize the transient…

We consider polygonal tilings of certain regions and use these to give intuitive definitions of tiling-based perimeter and area. We apply these definitions to rhombic tilings of Elnitsky polygons, computing sharp bounds and average values…