中文
相关论文

相关论文: Multicritical continuous random trees

200 篇论文

Every finite metric tree has generalized roundness strictly greater than one. On the other hand, some countable metric trees have generalized roundness precisely one. The purpose of this paper is to identify some large classes of countable…

泛函分析 · 数学 2016-08-18 Elena Caffarelli , Ian Doust , Anthony Weston

We study analytically the late time statistics of the number of particles in a growing tree model introduced by Aldous and Shields. In this model, a cluster grows in continuous time on a binary Cayley tree, starting from the root, by…

统计力学 · 物理学 2009-11-11 David S. Dean , Satya N. Majumdar

In the critical beta-splitting model of a random $n$-leaf rooted tree, clades are recursively split into sub-clades, and a clade of $m$ leaves is split into sub-clades containing $i$ and $m-i$ leaves with probabilities $\propto 1/(i(m-i))$.…

概率论 · 数学 2024-12-16 David J. Aldous , Svante Janson

Let $b$ be an integer greater than 1 and let $W^{\ee}=(W^{\ee}_n; n\geq 0)$ be a random walk on the $b$-ary rooted tree $\U_b$, starting at the root, going up (resp. down) with probability $1/2+\epsilon$ (resp. $1/2 -\epsilon$), $\epsilon…

概率论 · 数学 2007-05-23 Thomas Duquesne

A weighted recursive tree is an evolving tree in which vertices are assigned random vertex-weights and new vertices connect to a predecessor with a probability proportional to its weight. Here, we study the maximum degree and near-maximum…

概率论 · 数学 2023-01-31 Laura Eslava , Bas Lodewijks , Marcel Ortgiese

We present a simple yet rigorous approach to the determination of the spectral dimension of random trees, based on the study of the massless limit of the Gaussian model on such trees. As a byproduct, we obtain evidence in favor of a new…

凝聚态物理 · 物理学 2008-11-26 C. Destri , L. Donetti

In the critical beta-splitting model of a random $n$-leaf rooted tree, clades are recursively (from the root) split into sub-clades, and a clade of $m$ leaves is split into sub-clades containing $i$ and $m-i$ leaves with probabilities…

概率论 · 数学 2025-04-21 David J. Aldous , Svante Janson

We compute bounds in the expected Ollivier curvature for the Brownian continuum random tree $\mathcal{T}_{\mathbb{e}}$. The results indicate that when the scale dependence of the Ollivier curvature is properly taken into account, the…

概率论 · 数学 2023-12-05 Christy Kelly

We prove asymptotic normality for the number of fringe subtrees isomorphic to any given tree in uniformly random trees with given vertex degrees. As applications, we also prove corresponding results for random labelled trees with given…

概率论 · 数学 2023-12-08 Gabriel Berzunza Ojeda , Cecilia Holmgren , Svante Janson

We investigate scaling limits of trees built by uniform attachment with freezing, which is a variant of the classical model of random recursive trees introduced in a companion paper. Here vertices are allowed to freeze, and arriving…

We consider the number of nodes in the levels of unlabelled rooted random trees and show that the stochastic process given by the properly scaled level sizes weakly converges to the local time of a standard Brownian excursion. Furthermore…

组合数学 · 数学 2010-03-08 Michael Drmota , Bernhard Gittenberger

We introduce a family of branch merging operations on continuum trees and show that Ford CRTs are distributionally invariant. This operation is new even in the special case of the Brownian CRT, which we explore in more detail. The…

概率论 · 数学 2016-06-23 Franz Rembart

Understanding the patterns and processes of diversification of life in the planet is a key challenge of science. The Tree of Life represents such diversification processes through the evolutionary relationships among the different taxa, and…

We consider maps which are constructed from plane trees by assigning marks to the corners of each vertex and then connecting each pair of consecutive marks on their contour by a single edge. A measure is defined on the set of such maps by…

概率论 · 数学 2023-02-22 Daniel Amankwah , Sigurdur Örn Stefánsson

We analyze the eigenvalues of the adjacency matrices of a wide variety of random trees. Using general, broadly applicable arguments based on the interlacing inequalities for the eigenvalues of a principal submatrix of a Hermitian matrix and…

概率论 · 数学 2011-04-12 Shankar Bhamidi , Steven N. Evans , Arnab Sen

We obtain new non-asymptotic tail bounds for the height of uniformly random trees with a given degree sequence, simply generated trees and conditioned Bienaym\'e trees (the family trees of branching processes), in the process settling three…

概率论 · 数学 2024-03-11 Louigi Addario-Berry , Serte Donderwinkel

The critical beta-splitting tree, introduced by Aldous, is a Markov branching phylogenetic tree. Aldous and Pittel recently proved, amongst other results, a central limit theorem for the height of a random leaf. We give an alternative…

概率论 · 数学 2025-11-18 Brett Kolesnik

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…

概率论 · 数学 2021-08-02 Guillaume Conchon--Kerjan , Christina Goldschmidt

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…

概率论 · 数学 2008-01-28 Jean-François Marckert

We consider the Laplacian on a rooted metric tree graph with branching number $ K \geq 2 $ and random edge lengths given by independent and identically distributed bounded variables. Our main result is the stability of the absolutely…

数学物理 · 物理学 2007-05-23 Michael Aizenman , Robert Sims , Simone Warzel