相关论文: Parking on supercritical Galton-Watson trees

In this paper we consider a null recurrent random walk in random environment on a super-critical Galton-Watson tree. We consider the case where the log-Laplace transform $\psi$ of the branching process satisfies $\psi(1)=\psi'(1)=0$ for…

We consider a branching random walk (BRW) taking its values in the $\mathtt{b}$-ary rooted tree $\mathbb W_{ \mathtt{b}}$ (i.e. the set of finite words written in the alphabet $\{ 1, \ldots, \mathtt{b} \}$, with $\mathtt{b}\! \geq \! 2$).…

We study the McKean--Vlasov equation on the finite tori of length scale $L$ in $d$--dimensions. We derive the necessary and sufficient conditions for the existence of a phase transition, which are based on the criteria first uncovered in…

Rapidly-exploring random tree (RRT) has been applied for autonomous parking due to quickly solving high-dimensional motion planning and easily reflecting constraints. However, planning time increases by the low probability of extending…

We analyze the metastable states near criticality of the bootstrap percolation on Galton-Watson trees. We find that, depending on the exact choice of the offspring distribution, it is possible to have several distinct metastable states,…

We continue our study of the distribution of the maximal number $X^{\ast}_k$ of offsprings amongst all individuals in a critical Galton-Watson process started with $k$ ancestors, treating the case when the reproduction law has a regularly…

In this paper, we study the time required for a {\lambda}-biased ({\lambda}>1) walk to visit all the vertices of a supercritical Galton-Watson tree up to generation n. Inspired by the extremal landscape approach in [Cortines, Louidor,…

In this paper, we establish the necessary and sufficient criterion for the contact process on Galton-Watson trees (resp. random graphs) to exhibit the phase of extinction (resp. short survival). We prove that the survival threshold…

Consider a critical Galton-Watson process Z={Z_n: n=0,1,...} of index 1+alpha, alpha in (0,1]. Let S_k(j) denote the sum of the Z_n with n in the window [k,...,k+j), and M_m(j) the maximum of the S_k with k moving in [0,m-j]. We describe…

The displacement of a car with respect to a parking function is the number of spots it must drive past its preferred spot in order to park. An $\ell$-interval parking function is one in which each car has displacement at most $\ell$. Among…

We consider branching random walks and contact processes on infinite, connected, locally finite graphs whose reproduction and infectivity rates across edges are inversely proportional to vertex degree. We show that when the ambient graph is…

Let $\{Z_{n}\}_{n\geq0}$ be a critical Galton--Waston branching process with finite variance $\sigma^{2}$. Spitzer (unpublished), Lamperti and Ney (1968) proved that for any fixed $0<t<1$,…

We study completely asymmetric 2-channel exclusion processes in 1 dimension. It describes a two-way traffic flow with cars moving in opposite directions. The interchannel interaction makes cars slow down in the vicinity of approaching cars…

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…

We introduce a random finite rooted tree $\mathcal{C}$, the steady state cluster, characterized by a recursive description: $\mathcal{C}$ is a singleton with probability $1/2$ and otherwise is obtained by joining by an edge the roots of two…

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…

We study two different versions of the simple exclusion process on augmented Galton-Watson trees, the constant speed model and the varying speed model. In both cases, the simple exclusion process starts from an equilibrium distribution with…

We give a realization of the stable L\'evy forest of a given size conditioned by its mass from the path of the unconditioned forest. Then, we prove an invariance principle for this conditioned forest by considering $k$ independent…

Place an active particle at the root of a $d$-ary tree and a single dormant particle at each non-root site. In discrete time, active particles move towards the root with probability $p$ and, otherwise, away from the root to a uniformly…

In this paper, the parking problem of a swarm of mobile robots has been studied. The robots are deployed at the nodes of an infinite grid, which has a subset of prefixed nodes marked as parking nodes. Each parking node p_i has a capacity of…