Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userGalton-Watson trees with vanishing martingale limit
134
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We show that an infinite Galton-Watson tree, conditioned on its martingale limit being smaller than $eps$, agrees up to generation $K$ with a regular $mu$-ary tree, where $mu$ is the essential minimum of the offspring distribution and the random variable $K$ is strongly concentrated near an explicit deterministic function growing like a multiple of $log(1/eps)$. More precisely, we show that if $muge 2$ then with high probability as $eps downarrow 0$, $K$ takes exactly one or two values. This shows in particular that the conditioned trees converge to the regular $mu$-ary tree, providing an example of entropic repulsion where the limit has vanishing entropy.
rate research
Read More
At each site of a supercritical Galton-Watson tree place a parking spot which can accommodate one car. Initially, an independent and identically distributed number of cars arrive at each vertex. Cars proceed towards the root in discrete time and park in the first available spot they come to. Let $X$ be the total number of cars that arrive to the root. Goldschmidt and Przykucki proved that $X$ undergoes a phase transition from being finite to infinite almost surely as the mean number of cars arriving to each vertex increases. We show that $EX$ is finite at the critical threshold, describe its growth rate above criticality, and prove that it increases as the initial car arrival distribution becomes less concentrated. For the canonical case that either 0 or 2 cars arrive at each vertex of a $d$-ary tree, we give improved bounds on the critical threshold and show that $P(X = 0)$ is discontinuous.
We consider multi-type Galton Watson trees, and find the distribution of these trees when conditioning on very general types of recursive events. It turns out that the conditioned tree is again a multi-type Galton Watson tree, possibly with more types and with offspring distributions, depending on the type of the father node and on the height of the father node. These distributions are given explicitly. We give some interesting examples for the kind of conditioning we can handle, showing that our methods have a wide range of applications.
We study the totally asymmetric simple exclusion process (TASEP) on trees where particles are generated at the root. Particles can only jump away from the root, and they jump from $x$ to $y$ at rate $r_{x,y}$ provided $y$ is empty. Starting from the all empty initial condition, we show that the distribution of the configuration at time $t$ converges to an equilibrium. We study the current and give conditions on the transition rates such that the current is of linear order or such that there is zero current, i.e. the particles block each other. A key step, which is of independent interest, is to bound the first generation at which the particle trajectories of the first $n$ particles decouple.
A recursive function on a tree is a function in which each leaf has a given value, and each internal node has a value equal to a function of the number of children, the values of the children, and possibly an explicitly specified random element $U$. The value of the root is the key quantity of interest in general. In this first study, all node values and function values are in a finite set $S$. In this note, we describe the limit behavior when the leaf values are drawn independently from a fixed distribution on $S$, and the tree $T_n$ is a random Galton--Watson tree of size $n$.
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 event that a Galton-Watson tree is infinite, and let $mathcal{T}_2$ be the event that it contains an infinite binary tree starting from its root. These events satisfy similar recursive properties: $mathcal{T}_1$ holds if and only if $mathcal{T}_1$ holds for at least one of the trees initiated by children of the root, and $mathcal{T}_2$ holds if and only if $mathcal{T}_2$ holds for at least two of these trees. The probability of $mathcal{T}_1$ has a continuous phase transition, increasing from 0 when the mean of the child distribution increases above 1. On the other hand, the probability of $mathcal{T}_2$ has a first-order phase transition, jumping discontinuously to a nonzero value at criticality. Given the recursive property satisfied by the event, we describe the critical child distributions where a continuous phase transition takes place. In many cases, we also characterize the event undergoing the phase transition.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
