English
Related papers

Related papers: Some properties of stable snakes

200 papers

We discuss subordination of random compact R-trees. We focus on the case of the Brownian tree, where the subordination function is given by the past maximum process of Brownian motion indexed by the tree. In that particular case, the…

Probability · Mathematics 2016-05-25 Jean-François Le Gall

We consider so-called discrete snakes obtained from size-conditioned critical Bienaym\'e-Galton-Watson trees by assigning to each node a random spatial position in such a way that the increments along each edge are i.i.d. When the offspring…

Probability · Mathematics 2021-03-26 Cyril Marzouk

We define what we call an on/off Brownian snake. We use this to construct on/off super Brownian motion recently introduced to the literature by Blath and Jacobi and which is a measure-valued branching process with a dormant state and an…

Probability · Mathematics 2026-04-03 Matthew Buckland , Dave Jacobi

We prove a scaling limit for globally centered discrete snakes on size-conditioned critical Bienaym\'e trees. More specifically, under a global finite variance condition, we prove convergence in the sense of random finite-dimensional…

Probability · Mathematics 2025-07-18 Louigi Addario-Berry , Serte Donderwinkel , Christina Goldschmidt , Rivka Mitchell

In this article, we introduce Brownian motion on stable looptrees using resistance techniques. We prove an invariance principle characterising it as the scaling limit of random walks on discrete looptrees, and prove precise local and global…

Probability · Mathematics 2020-12-15 Eleanor Archer

The Brownian map is a random sphere-homeomorphic metric measure space obtained by "gluing together" the continuum trees described by the $x$ and $y$ coordinates of the Brownian snake. We present an alternative "breadth-first" construction…

Probability · Mathematics 2020-04-09 Jason Miller , Scott Sheffield

We extend existing connections between random walks, branching processes, and spatial branching processes, and their respective scaling limits, to include processes in dependent random environments. More specifically, we prove new scaling…

Probability · Mathematics 2025-12-16 Douglas Buchanan

In this paper we discuss Hausdorff and packing measures of random continuous trees called stable trees. Stable trees form a specific class of L\'evy trees (introduced by Le Gall and Le Jan in 1998) that contains Aldous's continuum random…

Probability · Mathematics 2010-02-01 Thomas Duquesne

We provide a new construction of the Brownian disks, which have been defined by Bettinelli and Miermont as scaling limits of quadrangulations with a boundary when the boundary size tends to infinity. Our method is very similar to the…

Probability · Mathematics 2017-10-23 Jean-François Le Gall

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…

Probability · Mathematics 2007-05-23 Romain Abraham , Jean-Francois Delmas

It has been claimed in Aldous, Miermont and Pitman [PTRF, 2004] that all L\'evy trees are mixings of inhomogeneous continuum random trees. We give a rigorous proof of this claim in the case of a stable branching mechanism, relying on a new…

Probability · Mathematics 2022-11-15 Minmin Wang

The Brownian sphere is a random metric space, homeomorphic to the two-dimensional sphere, which arises as the universal scaling limit of many types of random planar maps. The direct construction of the Brownian sphere is via a continuous…

Probability · Mathematics 2025-02-19 Omer Angel , Emmanuel Jacob , Brett Kolesnik , Grégory Miermont

Standard Schramm-Loewner evolution (SLE) is driven by a continuous Brownian motion which then produces a trace, a continuous fractal curve connecting the singular points of the motion. If jumps are added to the driving function, the trace…

Statistical Mechanics · Physics 2008-01-24 P. Oikonomou , I. Rushkin , I. A. Gruzberg , L. P. Kadanoff

Snakes can move through almost any terrain. Similarly, snake robots hold the promise as a versatile platform to traverse complex environments like earthquake rubble. Unlike snake locomotion on flat surfaces which is inherently stable, when…

Biological Physics · Physics 2025-09-22 Qiyuan Fu , Sean W. Gart , Thomas W. Mitchel , Jin Seob Kim , Gregory S. Chirikjian , Chen Li

Given a general critical or sub-critical branching mechanism and its associated L\'evy continuum random tree, we consider a pruning procedure on this tree using a Poisson snake. It defines a fragmentation process on the tree. We compute the…

Probability · Mathematics 2010-02-25 Guillaume Voisin

Given a general critical or sub-critical branching mechanism, we define a pruning procedure of the associated L\'evy continuum random tree. This pruning procedure is defined by adding some marks on the tree, using L\'evy snake techniques.…

Probability · Mathematics 2011-01-27 Romain Abraham , Jean-Francois Delmas , Guillaume Voisin

We consider branching random walks built on Galton-Watson trees with offspring distribution having a bounded support, conditioned to have $n$ nodes, and their rescaled convergences to the Brownian snake. We exhibit a notion of "globally…

Probability · Mathematics 2007-05-23 Jean-François Marckert

The branching capacity has been introduced by [Zhu 2016] as the limit of the hitting probability of a symmetric branching random walk in $\mathbb Z^d$, $d\ge 5$. Similarly, we define the Brownian snake capacity in $\mathbb R^d$, as the…

Probability · Mathematics 2024-02-23 Tianyi Bai , Jean-François Delmas , Yueyun Hu

Snakes can move through almost any terrain. Although their locomotion on flat surfaces using planar gaits is inherently stable, when snakes deform their body out of plane to traverse complex terrain, maintaining stability becomes a…

Biological Physics · Physics 2025-09-18 Qiyuan Fu , Chen Li

Noise sensitivity of functions on the leaves of a binary tree is studied, and a hypercontractive inequality is obtained. We deduce that the spider walk is not noise stable.

Probability · Mathematics 2008-11-26 Oded Schramm , Boris Tsirelson
‹ Prev 1 2 3 10 Next ›