arXiv math/05112032005-11math.PR

A Necessary and Sufficient Condition for the Tail-Triviality of a Recursive Tree Process

Antar Bandyopadhyay

备注：: Minor changes in the wordings. 20 pages, 1 figure. To appear in Sankhya

英文摘要：

Given a recursive distributional equation (RDE) and a solution $μ$ of it, we consider the tree indexed invariant process called the recursive tree process (RTP) with marginal $μ$. We introduce a new type of bivariate uniqueness property which is different from the one defined by Aldous and Bandyopadhyay (2005), and we prove that this property is equivalent to tail-triviality for the RTP, thus obtaining a necessary and sufficient condition to determine tail-triviality for a RTP in general. As an application we consider Aldous' (2000) construction of the frozen percolation process on a infinite regular tree and show that the associated RTP has a trivial tail.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

On Tail Triviality of Negatively Dependent Stochastic Processes

We prove that every negatively associated sequence of Bernoulli random variables with "summable covariances" has a trivial tail sigma-field. A corollary of this result is the tail triviality of strongly Rayleigh processes. This is a generalization of a result due to Lyons which establishes tail triviality for discrete determinantal processes. We also study the tail behavior of negatively associated Gaussian and Gaussian threshold processes. We show that these processes are tail trivial though they do not in general satisfy the summable covariances property. Furthermore, we construct negatively…

2022-05-22math.PR

A Note on Tail Triviality for Determinantal Point Processes

We give a very short proof that determinantal point processes have a trivial tail $σ$-field. This conjecture of the author has been proved by Osada and Osada as well as by Bufetov, Qiu, and Shamov. The former set of authors relied on the earlier result of the present author that the conjecture held in the discrete case, as does the present short proof.

2018-10-03math.PR

Discrete approximations of determinantal point processes on continuous spaces: tree representations and tail triviality

We prove tail triviality of determinantal point processes $ μ$ on continuous spaces. Tail triviality had been proved for such processes only on discrete spaces, and hence we have generalized the result to continuous spaces. To do this, we construct tree representations, that is, discrete approximations of determinantal point processes enjoying a determinantal structure. There are many interesting examples of determinantal point processes on continuous spaces such as zero points of the hyperbolic Gaussian analytic function with Bergman kernel, and the thermodynamic limit of eigenvalues of Gauss…

2018-02-05math.PR

STIT Tessellations have trivial tail σ-algebra

We consider homogeneous STIT tessellations Y in the \ell-dimensional Euclidean space and show the triviality of the tail σ-algebra. This is a sharpening of the mixing result by Lachièze-Rey.

2012-10-15math.PR

On tail bounds for random recursive trees

We consider a multivariate distributional recursion of sum-type as arising in the probabilistic analysis of algorithms and random trees. We prove an upper tail bound for the solution using Chernoff's bounding technique by estimating the Laplace transform. The problem is traced back to the corresponding problem for binary search trees by stochastic domination. The result obtained is applied to the internal path length and Wiener index of random b-ary recursive trees with weighted edges and random linear recursive trees. Finally, lower tail bounds for the Wiener index of these trees are given.

2011-06-20math.PR

随机递归树中异常高度的异常衰减率

Atypical Decay Rates for Atypical Heights in Random Recursive Trees

Beijing Normal University（北京师范大学）；Technion - Israel’s Institute of Technology（以色列理工学院）

本文建立了随机递归树高度的大偏差概率，发现上尾呈多项式衰减，下尾呈拉伸指数衰减，且下尾具有异常前因子，其增长速度慢于任何n重迭代对数。

2026-06-16math.PR

更多相关论文收起更多论文

随机递归树基底网络上的亚临界渗流与网络考古学

Subcritical percolation and network archaeology on random recursive tree substrate networks

研究随机递归树基底网络的网络考古学问题，利用辅助亚临界键渗流揭示树状重整化结构，通过在最大辅助渗流组件内应用乔丹中心性，为循环网络构建确定性大小的根置信集。

2026-07-24math.PR

On martingale tail sums for the path length in random trees

For a martingale $(X_n)$ converging almost surely to a random variable $X$, the sequence $(X_n - X)$ is called martingale tail sum. Recently, Neininger [Random Structures Algorithms, 46 (2015), 346-361] proved a central limit theorem for the martingale tail sum of R{é}gnier's martingale for the path length in random binary search trees. Gr{ü}bel and Kabluchko [to appear in Annals of Applied Probability, (2016), arXiv 1410.0469] gave an alternative proof also conjecturing a corresponding law of the iterated logarithm. We prove the central limit theorem with convergence of higher moments and the…

2016-03-22cs.DSmath.PR

Fine asymptotics for the maximum degree in weighted recursive trees with bounded random weights

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 degrees in weighted recursive trees when the vertex-weights are almost surely bounded and their distribution function satisfies a mild regularity condition near zero. We are able to specify higher-order corrections to the first order growth of the maximum degree established in prior work. The accuracy of the results depends on the behaviour of the weight dist…

2023-01-30math.PR

Heavy tailed branching process with immigration

In this paper we analyze a branching process with immigration defined recursively by $X_t=θ_t\circ X_{t-1}+B_t$ for a sequence $(B_t)$ of i.i.d. random variables and random mappings $ θ_t\circ x:=θ_t(x)=\sum_{i=1}^xA_i^{(t)}, $ with $(A_i^{(t)})_{i\in \mathbb{N}_0}$ being a sequence of $\mathbb{N}_0$-valued i.i.d. random variables independent of $B_t$. We assume that one of generic variables $A$ and $B$ has a regularly varying tail distribution. We identify the tail behaviour of the distribution of the stationary solution $X_t$. We also prove CLT for the partial sums that could be further gene…

2012-07-30math.PR

递归油漆盒与Hoffman有根树图的Martin边界

Recursive Paintboxes and the Martin Boundary of the Hoffman Rooted-Tree Graph

本文确定了Hoffman有根树图的Martin边界，证明其由递归油漆盒参数化，并给出了递归Ewens族的极值分解。

2026-09-25math.COmath.PR

随机递归树中的历史估计：通过迭代Jordan中心性的逐点方法

History estimation in random recursive trees: Pointwise approach via iterated Jordan centralities

Mathematical Institute, University of Koblenz（科布伦茨大学数学研究所）；Department of Mathematics and Computer Science, UniDistance（UniDistance数学与计算机科学系）；Department of Statistics, University of Oxford（牛津大学统计系）

研究从无标号结构估计均匀随机递归树顶点到达时间的问题，采用逐点视角分析相对估计误差分布，并推导出关于顶点和树大小一致的尾界。

2026-06-24math.PRmath.STstat.ML