Related papers: Branching annihilating random walk on random regul…
We study the asymptotic behavior of ``true" self-avoiding random walks on general infinite locally finite trees. In this model, the walk starts at the root and, at each step, from its current vertex chooses a neighboring edge to traverse…
Random walks with a general, nonlinear barrier have found recent applications ranging from reionization topology to refinements in the excursion set theory of halos. Here, we derive the first-crossing distribution of random walks with a…
Let $G$ be an infinite, locally finite graph. We investigate the relation between supercritical, transient branching random walk and the Martin boundary of its underlying random walk. We show results regarding the typical asymptotic…
We study a generalized branching random walk where particles breed at a rate which depends on the number of neighboring particles. Under general assumptions on the breeding rates we prove the existence of a phase where the population…
Asymptotic estimates of the hitting distribution of a long segment on the real axis for two dimensional random walks on ${\bf Z}^2$ of zero mean and finite variances are obtained: some are general and exhibit its apparent similarity to the…
We study the statistics of branching polymers with excluded-volume interactions, by modeling them as single self-avoiding trees on a generic regular periodic lattice with coordination number $q$. Each lattice site can be occupied at most by…
Several interesting approaches have been reported in the literature on complex networks, random walks, and hierarchy of graphs. While many of these works perform random walks on stable, fixed networks, in the present work we address the…
We introduce a biologically natural, mathematically tractable model of random phylogenetic network to describe evolution in the presence of hybridization. One of the features of this model is that the hybridization rate of the lineages…
It is well-known that 0 is the absorbing state for a branching system. Each particle in the system lives a random long time and gives a random number of new particles at its death time. It stops when the system has no particle. This paper…
We study the annihilating random walk with long-range interaction in one dimension. Each particle performs random walks on a one-dimensional ring in such a way that the probability of hopping toward the nearest particle is $W= [1 - \epsilon…
When identical particles on a line collide, they merge and continue as one. Exact determinantal formulas have long been available for particles conditioned never to collide, but collisions change the number of particles, and exact…
Let $\left\{ Z_{n},n=0,1,2,...\right\} $ be a critical branching process in i.i.d. random environment, $Z_{r,n}$ be the number of particles in the process at moment $0\leq r\leq n-1$ that have a positive number of descendants in generation…
Let $Z_{n,}n=0,1,...,$ be a branching process evolving in the random environment generated by a sequence of iid generating functions $% f_{0}(s),f_{1}(s),...,$ and let $S_{0}=0,S_{k}=X_{1}+...+X_{k},k\geq 1,$ be the associated random walk…
We study a system of coalescing random walks on the integer lattice $\mathbb{Z}^{d}$ in which the walk is oriented in the $d$-th direction and follows certain specified rules. We first study the geometry of the paths and show that, almost…
Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…
We consider an interacting particle system where equal-sized populations of two types of particles move by random walk steps on a graph, the two types may have different speeds, and meetings of opposite-type particles result in…
We study the effects of hard core (HC) interactions between different species of particles on two-species branching annihilating random walks with one offspring(BAW$_2$(1)). The single-species model belongs to the directed percolation (DP)…
Many regular graphs admit a natural partition of their edge set into cliques of the same order such that each vertex is contained in the same number of cliques. In this paper, we study the mixing rate of certain random walks on such graphs…
Families of symmetric simple random walks on Cayley graphs of Abelian groups with a bound on the number of generators are shown to never have sharp cut off in the sense of [1], [3], or [5]. Here convergence to the stationary distribution is…
We study a $d$-dimensional branching random walk (BRW) in an i.i.d. random environment on $\mathbb{Z}^d$ in discrete time. A Bernoulli trap field is attached to $\mathbb{Z}^d$, where each site, independently of the others, is a trap with a…