Related papers: Probabilistic and fractal aspects of Levy trees
Drmota and Gittenberger (1997) proved a conjecture due to Aldous (1991) on the height profile of a Galton-Watson tree with an offspring distribution of finite variance, conditioned on a total size of $n$ individuals. The conjecture states…
Rooted, weighted continuum random trees are used to describe limits of sequences of random discrete trees. Formally, they are random quadruples $(\mathcal{T},d,r,p)$, where $(\mathcal{T},d)$ is a tree-like metric space, $r\in\mathcal{T}$ is…
Consider a one dimensional critical branching L\'{e}vy process $((Z_t)_{t\geq 0}, \mathbb {P}_x)$. Assume that the offspring distribution either has finite second moment or belongs to the domain of attraction to some $\alpha$-stable…
We introduce an extension of the P\'olya tree approach for constructing distributions on the space of probability measures. By using optional stopping and optional choice of splitting variables, the construction gives rise to random…
We analyze a class of linear partial differential equations that arise as deterministic descriptions of the scaling limits of L\'evy walks, in which transport is driven by a convex combination of fractional material derivatives and a source…
The time process of transport on randomly evolving trees is investigated. By introducing the notions of living and dead nodes a model of random tree evolution is constructed which describes the spreading in time of objects corresponding to…
In this manuscript, we continue with the systematic study of the speed of extinction of continuous state branching processes in L\'evy environments under more general branching mechanisms. Here, we deal with the weakly subcritical regime…
As a model of trapping by biased motion in random structure, we study the time taken for a biased random walk to return to the root of a subcritical Galton-Watson tree. We do so for trees in which these biases are randomly chosen,…
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…
The simple Galton--Watson process describes populations where individuals live one season and are then replaced by a random number of children. It can also be viewed as a way of generating random trees, each vertex being an individual of…
Let $\mathcal{B}$ be the set of rooted trees containing an infinite binary subtree starting at the root. This set satisfies the metaproperty that a tree belongs to it if and only if its root has children $u$ and $v$ such that the subtrees…
Continuous time branching models are used to create random fractals in a Euclidean space, whose Hausdorff dimension is controlled by an input parameter. Finite realizations are applied in modelling the set of sites visited in models of…
We construct a modified continuous-state branching process whose Malthusian parameter is replaced by another when passing below a certain level. The construction is obtained via a Lamperti-like transform applied to a refracted L\'evy…
We study the speed of extinction of continuous state branching processes in a L\'evy environment, where the associated L\'evy process oscillates. Assuming that the L\'evy process satisfies the Spitzer's condition and the existence of some…
This paper proves sharp bounds on the tails of the L\'evy exponent of an operator semistable law on $\mathbb R^d$. These bounds are then applied to explicitly compute the Hausdorff and packing dimensions of the range, graph, and other…
We discuss various forms of convergence of the vicinity of a uniformly at random selected vertex in random simply generated trees, as the size tends to infinity. For the standard case of a critical Galton-Watson tree conditioned to be large…
We study the evolution of a particle system whose genealogy is given by a supercritical continuous time Galton--Watson tree. The particles move independently according to a Markov process and when a branching event occurs, the offspring…
We prove empirical central limit theorems for the distribution of levels of various random fields defined on high-dimensional discrete structures as the dimension of the structure goes to $\infty$. The random fields considered include costs…
We consider a model of random tree growth, where at each time unit a new vertex is added and attached to an already existing vertex chosen at random. The probability with which a vertex with degree $k$ is chosen is proportional to $w(k)$,…
The properties of randomly evolving special trees having defined and analyzed already in two earlier papers (arXiv:cond-mat/0205650 and arXiv:cond-mat/0211092) have been investigated in the case when the continuous time parameter converges…