相关论文: Scaling limits of random trees and planar maps

This paper investigates L\'evy walks with random velocities, extending classical models beyond constant speed assumptions. We derive scaling limits, demonstrating that diffusion depends on interplay between heavy-tailed duration and…

The theory of Gromov-Hausdorff convergence is applied to sequences of quotient rings of integers. It is shown the existence of limit rings (fields) as the Gromov-Hausdorff limits of sequences of metric quotient rings. The relation of these…

Scale transformations have played an extremely successful role in studies of cosmological large-scale structure by relating the non-linear spectrum of cosmological density fluctuations to the linear primordial power at longer wavelengths.…

The talk presented at ICMP 97 focused on the scaling limits of critical percolation models, and some other systems whose salient features can be described by collections of random lines. In the scaling limit we keep track of features seen…

The existence of the scaling limit and its universality, for correlations between zeros of {\it Gaussian} random polynomials, or more generally, {\it Gaussian} random sections of powers of a line bundle over a compact manifold has been…

We review some of the results that have been derived in the last years on conformal invariance, scaling limits and properties of some two-dimensional random curves. In particular, we describe the intuitive ideas that lead to the definition…

We introduce a class of absorption mechanisms and study the behavior of real-valued centered random walks with finite variance that do not get absorbed. In particular, we prove persistence and scaling limit results, which, in many cases of…

In this paper, we survey some properties, encoding, and bijections involving combinatorial maps, double occurrence words, and chord diagrams. We particularly study quasi-trees from a purely combinatorial point of view and derive a…

We introduce random spatial forests, a method of bagging regression trees allowing for spatial correlation. Our main contribution is the development of a computationally efficient tree building algorithm which selects each split of the tree…

We study the scaling limit of the volume and perimeter of the discovered regions in the Markovian explorations known as peeling processes for infinite random planar maps such as the uniform infinite planar triangulation (UIPT) or…

These notes were used in a short graduate course on branching processes the author gave in Beijing Normal University. The following main topics are covered: scaling limits of Galton--Watson processes, continuous-state branching processes,…

We study rooted planar random trees with a probability distribution which is proportional to a product of weight factors $w_n$ associated to the vertices of the tree and depending only on their individual degrees $n$. We focus on the case…

We introduce a new model of random tree that grows like a random recursive tree, except at some exceptional "doubling events" when the tree is replaced by two copies of itself attached to a new root. We prove asymptotic results for the size…

In this paper, we provide a framework of estimates for describing 2D scaling limits by Schramm's SLE curves. In particular, we show that a weak estimate on the probability of an annulus crossing implies that a random curve arising from a…

We re-examine the notion of relative $(p,\eps)$-approximations, recently introduced in [CKMS06], and establish upper bounds on their size, in general range spaces of finite VC-dimension, using the sampling theory developed in [LLS01] and in…

We analyze dynamic random network models where younger vertices connect to older ones with probabilities proportional to their degrees as well as a propensity kernel governed by their attribute types. Using stochastic approximation…

Ge, Rusjan, and Zweifel (J. Stat. Phys. 59, 1265 (1990)) introduced a binary tree which represents all the periodic windows in the chaotic regime of iterated one-dimensional unimodal maps. We consider the scaling behavior in a modified tree…

We consider random walk on a mildly random environment on finite transitive d- regular graphs of increasing girth. After scaling and centering, the analytic spectrum of the transition matrix converges in distribution to a Gaussian noise. An…

In this article it is shown that the Brownian motion on the continuum random tree is the scaling limit of the simple random walks on any family of discrete $n$-vertex ordered graph trees whose search-depth functions converge to the Brownian…

We consider a branching random walk on the lattice, where the branching rates are given by an i.i.d. Pareto random potential. We show that the system of particles, rescaled in an appropriate way, converges in distribution to a scaling limit…