Related papers: Probabilistic and fractal aspects of Levy trees
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…
The members of Martin-L\"of random closed sets under a distribution studied by Barmpalias et al. are exactly the infinite paths through Martin-L\"of random Galton--Watson trees with survival parameter $\frac{2}{3}$. To be such a member, a…
We prove a metric space scaling limit for a critical random graph with independent and identically distributed degrees having power-law tail behaviour with exponent $\alpha+1$, where $\alpha \in (1,2)$. The limiting components are…
We present a new pruning procedure on discrete trees by adding marks on the nodes of trees. This procedure allows us to construct and study a tree-valued Markov process $\{{\cal G}(u)\}$ by pruning Galton-Watson trees and an analogous…
The aim of this lecture is to give an overview of old and new resultson Bienaym\'e-Galton-Watson (BGW) trees. After introducing the framework of discretetrees, we first give alternative proofs of classical results on theextinction…
A step reinforced random walk is a discrete time process with memory such that at each time step, with fixed probability $p \in (0,1)$, it repeats a previously performed step chosen uniformly at random while with complementary probability…
We explore the tree limits recently defined by Elek and Tardos. In particular, we find tree limits for many classes of random trees. We give general theorems for three classes of conditional Galton-Watson trees and simply generated trees,…
We consider infinite Galton-Watson trees without leaves together with i.i.d.~random variables called marks on each of their vertices. We define a class of flow rules on marked Galton-Watson trees for which we are able, under some algebraic…
We prove that certain natural random variables associated with the local eigenvalue statistics for generalized lattice Anderson models constructed with finite-rank perturbations are compound Poisson distributed. This distribution is…
Using the theory of free random variables (FRV) and the Coulomb gas analogy, we construct stable random matrix ensembles that are random matrix generalizations of the classical one-dimensional stable L\'{e}vy distributions. We show that the…
We study survival properties of inhomogeneous Galton-Watson processes. We determine the so-called branching number (which is the reciprocal of the critical value for percolation) for these random trees (conditioned on being infinite), which…
We construct an estimator of the L\'evy density of a pure jump L\'evy process, possibly of infinite variation, from the discrete observation of one trajectory at high frequency. The novelty of our procedure is that we directly estimate the…
We consider the height process of a Levy process with no negative jumps, and its associated continuous tree representation. Using Levy snake tools developed by Duquesne and Le Gall, with an underlying Poisson process, we construct a…
We study a new type of random minimum spanning trees. It is built on the complete graph where each vertex is given a weight, which is a positive real number. Then, each edge is given a capacity which is a random variable that only depends…
Conditional independence and graphical models are crucial concepts for sparsity and statistical modeling in higher dimensions. For L\'evy processes, a widely applied class of stochastic processes, these notions have not been studied. By the…
We are interested in the biased random walk on a supercritical Galton--Watson tree in the sense of Lyons, Pemantle and Peres, and study a phenomenon of slow movement. In order to observe such a slow movement, the bias needs to be random;…
The hierarchical and recursive expressive capability of rooted trees is applicable to represent statistical models in various areas, such as data compression, image processing, and machine learning. On the other hand, such hierarchical…
A Levy walk is a non-Markovian stochastic process in which the elementary steps of the walker consist of motion with constant speed in randomly chosen directions and for a random period of time. The time of flight is chosen from a…
We give a unified treatment of the limit, as the size tends to infinity, of simply generated random trees, including both the well-known result in the standard case of critical Galton--Watson trees and similar but less well-known results in…
We study a class of Hermitian random matrices which includes and generalizes Wigner matrices, heavy-tailed random matrices, and sparse random matrices such as the adjacency matrices of Erdos-Renyi random graphs with p ~ 1/N. Our NxN random…