相关论文: General Edgeworth expansions with applications to …

Edgeworth expansions for random walks on covering graphs with groups of polynomial volume growths are obtained under a few natural assumptions. The coefficients appearing in this expansion depends on not only geometric features of the…

Consider a branching random walk on $\mathbb Z$ in discrete time. Denote by $L_n(k)$ the number of particles at site $k\in\mathbb Z$ at time $n\in\mathbb N_0$. By the profile of the branching random walk (at time $n$) we mean the function…

Search trees are fundamental data structures in computer science. We study functionals on random search trees that satisfy recurrence relations of a simple additive form. Many important functionals including the space requirement, internal…

We obtain asymptotic expansions for local probabilities of partial sums for uniformly bounded independent but not necessarily identically distributed integer-valued random variables. The expansions involve products of polynomials and…

In this article, we study a class of lattice random variables in the domain of attraction of an $\alpha$-stable random variable with index $\alpha \in (0,2)$ which satisfy a truncated fractional Edgeworth expansion. Our results include…

Consider a branching random walk in which the offspring distribution and the moving law both depend on an independent and identically distributed random environment indexed by the time.For the normalised counting measure of the number of…

We prove non-asymptotic stretched exponential tail bounds on the height of a randomly sampled node in a random combinatorial tree, which we use to prove bounds on the heights and widths of random trees from a variety of models. Our results…

We study asymptotic expansions in free probability. In a class of classical limit theorems Edgeworth expansion can be obtained via a general approach using sequences of "influence" functions of individual random elements described by…

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…

This survey studies asymptotics of random fringe trees and extended fringe trees in random trees that can be constructed as family trees of a Crump-Mode-Jagers branching process, stopped at a suitable time. This includes random recursive…

We consider a model of random tree growth, where at each time unit a new vertex is added and attached to an already existing vertex chosen at random. The probability with which a vertex with degree $k$ is chosen is proportional to $w(k)$,…

Let $(g_n)_{n\geq 1}$ be a sequence of independent and identically distributed random elements with law $\mu$ on the general linear group $\textup{GL}(V)$, where $V=\mathbb R^d$. Consider the random walk $G_n : = g_n \ldots g_1$, $n \geq…

We investigate the number of permutations that occur in random labellings of trees. This is a generalisation of the number of subpermutations occurring in a random permutation. It also generalises some recent results on the number of…

We prove limit theorems for sums of functions of subtrees of binary search trees and random recursive trees. In particular, we give simple new proofs of the fact that the number of fringe trees of size $ k=k_n $ in the binary search tree…

We extend the results of B. Bollobas, O. Riordan, J. Spencer, G. Tusnady, and Mori. We consider a model of random tree growth, where at each time unit a new node is added and attached to an already existing node chosen at random. The…

Edgeworth expansion provides higher-order corrections to the normal approximation for a probability distribution. The classical proof of Edgeworth expansion is via characteristic functions. As a powerful method for distributional…

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…

We study the distribution of a general class of asymptoticallylinear statistics which are symmetric functions of $N$ independent observations. The distribution functions of these statistics are approximated by an Edgeworth expansion with a…

This paper extends the study of fringe trees in random plane trees with a given degree statistic. While previous work established the asymptotic normality of the count of fringe trees isomorphic to a fixed tree, we investigate the case…

We develop generalized approach to obtaining Edgeworth expansions for $t$-statistics of an arbitrary order using computer algebra and combinatorial algorithms. To incorporate various versions of mean-based statistics, we introduce Adjusted…