相关论文: The phase transition for parking on Galton--Watson…

Let ${\cal T}$ be a rooted Galton-Watson tree with offspring distribution $\{p_k\}$ that has $p_0=0$, mean $m=\sum kp_k>1$ and exponential tails. Consider the $\lambda$-biased random walk $\{X_n\}_{n\geq 0}$ on ${\cal T}$; this is the…

The study of Gaussian free field level sets on supercritical Galton-Watson trees has been initiated by Ab\"acherli and Sznitman in Ann. Inst. Henri Poincar\'{e} Probab. Stat., 54(1):173--201, 2018. By means of entirely different tools, we…

We are interested in nodes with fixed outdegrees in large conditioned Galton--Watson trees. We first study the scaling limits of processes coding the evolution of the number of such nodes in different explorations of the tree…

Place one active particle at the root of a graph and a Poisson-distributed number of dormant particles at the other vertices. Active particles perform simple random walk. Once the number of visits to a site reaches a random threshold, any…

In this paper we consider coalescing random walks on a general connected graph $G=(V,E)$. We set up a unified framework to study the leading order of the decay rate of $P_t$, the expectation of the fraction of occupied sites at time $t$,…

The cellular automaton model for traffic flow exhibits a jamming transition from a free-flow phase to a congested phase. In the deterministic case this transition corresponds to a critical point with diverging correlation length. We present…

We study a linear-fractional Bienaym\'e-Galton-Watson process with a general type space. The corresponding tree contour process is described by an alternating random walk with the downward jumps having a geometric distribution. This leads…

The phase transition of $M$-digging random on a general tree was studied by Collevecchio, Huynh and Kious (2018). In this paper, we study particularly the critical $M$-digging random walk on a superperiodic tree that is proved to be…

Consider an infinite, rooted, connected graph where each vertex is labelled with an independent and identically distributed Uniform(0,1) random variable, plus a parameter $\theta$ times its distance from the root $\rho$. That is, we label…

Consider a branching process $\{Z_n\}_{n\ge 0}$ with immigration in varying environment. For $a\in\{0,1,2,...\},$ let $C=\{n\ge0:Z_n=a\}$ be the collection of times at which the population size of the process attains level $a.$ We give a…

In the Biham-Middleton-Levine traffic model cars are placed with some density p on a two dimensional torus, and move according to a (simple) set of predefined rules. Computer simulations show this system exhibits many interesting phenomena:…

This paper deals with branching processes in varying environment, namely, whose offspring distributions depend on the generations. We provide sufficient conditions for survival or extinction which rely only on the first and second moments…

We consider the behaviour of minimax recursions defined on random trees. Such recursions give the value of a general class of two-player combinatorial games. We examine in particular the case where the tree is given by a Galton-Watson…

It is suggested that the question of existence of a jamming phase transition in a broad class of single-lane cellular-automaton traffic models may be studied using a correspondence to the asymmetric chipping model. In models where such…

We study the total variation (TV) distance between the laws of the 2D Ising/FK-Ising model in a box of side-length $N$ with and without an i.i.d.\ Gaussian external field with variance $\epsilon^2$. Letting the external field strength…

This thesis examines linearly edge-reinforced random walks on infinite trees. In particular, recurrence and transience of such random walks on general (fixed) trees as well as on Galton-Watson trees (i.e. random trees) is characterized, and…

We introduce two simple two-dimensional lattice models to study traffic flow in cities. We have found that a few basic elements give rise to the characteristic phase diagram of a first-order phase transition from a freely moving phase to a…

We study the simple random walk on trees and give estimates on the mixing and relaxation time. Relying on a recent characterization by Basu, Hermon and Peres, we give geometric criteria, which are easy to verify and allow to determine…

Considering the quintom model with arbitrary potential, it is shown that there always exists a solution which evolves from w > -1 region to w < -1 region. The problem is restricted to the slowly varying potentials, i.e. the slow-roll…

Aldous, Evans and Pitman (1998) studied the behavior of the fragmentation process derived from deleting the edges of a uniform random tree on $n$ labelled vertices. In particular, they showed that, after proper rescaling, the above…