Related papers: Parking on supercritical Galton-Watson trees
We establish a phase transition for the parking process on critical Galton--Watson trees. In this model, a random number of cars with mean $m$ and variance $\sigma^{2}$ arrive independently on the vertices of a critical Galton--Watson tree…
Consider a supercritical Bienaym\'e--Galton--Watson tree $ \mathcal{T}$ with geometric offspring distribution. Each vertex of this tree represents a parking spot which can accommodate at most one car. On the top of this tree, we add $(A_u :…
Let $(A_u : u \in \mathbb{B})$ be i.i.d.~non-negative integers that we interpret as car arrivals on the vertices of the full binary tree $ \mathbb{B}$. Each car tries to park on its arrival node, but if it is already occupied, it drives…
Consider a uniform random rooted tree on vertices labelled by $[n] = \{1,2,\ldots,n\}$, with edges directed towards the root. We imagine that each node of the tree has space for a single car to park. A number $m \le n$ of cars arrive one by…
In the parking model on $\mathbb{Z}^d$, each vertex is initially occupied by a car (with probability $p$) or by a vacant parking spot (with probability $1-p$). Cars perform independent random walks and when they enter a vacant spot, they…
In this paper, we investigate the parking process on a uniform random rooted binary tree with $n$ vertices. Viewing each vertex as a single parking space, a random number of cars independently arrive at and attempt to park on each vertex…
Recently, a phase transition phenomenon has been established for parking on random trees. We extend the results of Curien and H\'enard on general Galton--Watson trees and allow different car arrival distributions depending on the vertex…
In this paper, we investigate a parking process on a uniform random rooted plane tree with $n$ vertices. Every vertex of the tree has a parking space for a single car. Cars arrive at independent uniformly random vertices of the tree. If the…
Consider a rooted tree on the top of which we let cars arrive on its vertices. Each car tries to park on its arriving vertex but if it is already occupied, it drives towards the root of the tree and parks as soon as possible. In this…
We enumerate a class of fully parked trees. In a probabilistic context, this means computing the partition function $F(x,y)$ of the parking process where an i.i.d. number of cars arrives at each vertex of a Galton-Watson tree with a…
Consider an infinite tree with random degrees, i.i.d. over the sites, with a prescribed probability distribution with generating function G(s). We consider the following variation of Renyi's parking problem, alternatively called blocking…
Consider a uniform rooted Cayley tree $T_{n}$ with $n$ vertices and let $m$ cars arrive sequentially, independently, and uniformly on its vertices. Each car tries to park on its arrival node, and if the spot is already occupied, it drives…
We study the parking process on the random recursive tree. We first prove that although the random recursive tree has a non-degenerate Benjamini--Schramm limit, the phase transition for the parking process appears at density $0$. We then…
We show that large critical multi-type Galton-Watson trees, when conditioned to be large, converge locally in distribution to an infinite tree which is analoguous to Kesten's infinite monotype Galton-Watson tree. This is proven when we…
We are interested in the asymptotic behavior of critical Galton-Watson trees whose offspring distribution may have infinite variance, which are conditioned on having a large fixed number of leaves. We first find an asymptotic estimate for…
Distinguishing between continuous and first-order phase transitions is a major challenge in random discrete systems. We study the topic for events with recursive structure on Galton-Watson trees. For example, let $\mathcal{T}_1$ be the…
Place a car independently with probability $p$ at each site of a graph. Each initially vacant site is a parking spot that can fit one car. Cars simultaneously perform independent random walks. When a car encounters an available parking spot…
We study a particular type of subcritical Galton--Watson trees, which are called non-generic trees in the physics community. In contrast with the critical or supercritical case, it is known that condensation appears in certain large…
We consider the random conductance model, where the underlying graph is an infinite supercritical Galton--Watson tree, the conductances are independent but their distribution may depend on the degree of the incident vertices. We prove that,…
We propose a new way to condition random trees, that is, condition random trees to have large maximal out-degree. Under this new conditioning, we show that conditioned critical Galton-Watson trees converge locally to size-biased trees with…