Related papers: UST branches, martingales, and multiple SLE(2)
We propose a tree-based algorithm for classification and regression problems in the context of functional data analysis, which allows to leverage representation learning and multiple splitting rules at the node level, reducing…
We consider the local limit of finite uniformly distributed directed animals on the square lattice viewed from the root. Two constructions of the resulting uniform infinite directed animal are given: one as a heap of dominoes, constructed…
The minimum spanning tree of a graph is a well-studied structure that is the basis of countless graph theoretic and optimization problem. We study the minimum spanning tree (MST) perturbation problem where the goal is to spend a fixed…
We study the scaling limits of three different aggregation models on the integer lattice Z^d: internal DLA, in which particles perform random walks until reaching an unoccupied site; the rotor-router model, in which particles perform…
The minimum spanning tree (MST) is a combinatorial optimization problem: given a connected graph with a real weight ("cost") on each edge, find the spanning tree that minimizes the sum of the total cost of the occupied edges. We consider…
In this article, we propose a Milstein finite difference scheme for a stochastic partial differential equation (SPDE) describing a large particle system. We show, by means of Fourier analysis, that the discretisation on an unbounded domain…
We define radial exploration processes from $a$ to $b$ and from $b$ to $a$ in a domain $D$ of hexagons where $a$ is a boundary point and $b$ is an interior point. We prove the reversibility: the time-reversal of the process from $b$ to $a$…
For $\alpha \in (1,2]$, the $\alpha$-stable graph arises as the universal scaling limit of critical random graphs with i.i.d. degrees having a given $\alpha$-dependent power-law tail behavior. It consists of a sequence of compact measured…
In the series of lectures, we will discuss probability laws of random points, curves, and surfaces. Starting from a brief review of the notion of martingales, one-dimensional Brownian motion (BM), and the $D$-dimensional Bessel processes,…
We study non-compact scaling limits of uniform random planar quadrangulations with a boundary when their size tends to infinity. Depending on the asymptotic behavior of the boundary size and the choice of the scaling factor, we observe…
Large deviations for additive path functionals of stochastic processes have attracted significant research interest, in particular in the context of stochastic particle systems and statistical physics. Efficient numerical `cloning'…
We consider a continuous time random walk on the rooted binary tree of depth $n$ with all transition rates equal to one and study its cover time, namely the time until all vertices of the tree have been visited. We prove that, normalized by…
Suppose that $X=(X_{t})_{t\ge 0}$ is either a general supercritical non-local branching Markov process, or a general supercritical non-local superprocess, on a Luzin space. Here, by ``supercritical" we mean that the mean semigroup of $X$…
We point out that the construction of a martingale observable describing the spin interface of the two-dimensional Ising model extends to a class of non-integrable variants of the two-dimensional Ising model, and express it in terms of…
Phylogenetic trees constitute an interesting class of objects for stochastic processes due to the non-standard nature of the space they inhabit. In particular, many statistical applications require the construction of Markov processes on…
We propose a novel finite size scaling analysis for percolation transition observed in complex networks. While it is known that cooperative systems in growing networks often undergo an infinite order transition with inverted…
In Bhatt and Roy's minimal directed spanning tree (MDST) construction for a random partially ordered set of points in the unit square,all edges must respect the ``coordinatewise'' partial order and there must be a directed path from each…
By applying an idea of Borodin and Olshanski [J. Algebra 313 (2007), 40-60], we study various scaling limits of determinantal point processes with trace class projection kernels given by spectral projections of selfadjoint Sturm-Liouville…
In this thesis, we study a new disordered system called random spanning tree in random environment (RSTRE) across different families of graphs with varying disorder distributions. We examine several observables as functions of the disorder…
In this paper we ask whether one can take the limit of multiple SLE as the number of slits goes to infinity. In the special case of $n$ slits that connect $n$ points of the boundary to one fixed point, one can take the limit of the Loewner…