Related papers: A functional limit theorem for the profile of sear…
We survey some geometrical properties of trajectories of $d$-dimensional random walks via the application of functional limit theorems. We focus on the functional law of large numbers and functional central limit theorem (Donsker's…
Tries are among the most versatile and widely used data structures on words. In particular, they are used in fundamental sorting algorithms such as radix sort which we study in this paper. While the performance of radix sort and tries under…
This paper is part of the general project of proof mining, developed by Kohlenbach. By "proof mining" we mean the logical analysis of mathematical proofs with the aim of extracting new numerically relevant information hidden in the proofs.…
A sharp, distribution free, non-asymptotic result is proved for the concentration of a random function around the mean function, when the randomization is generated by a finite sequence of independent data and the random functions satisfy…
Let $(X_k,\xi_k)_{k\in \mathbb {N}}$ be a sequence of independent copies of a pair $(X,\xi)$ where $X$ is a random process with paths in the Skorokhod space $D[0,\infty)$ and $\xi$ is a positive random variable. The random process with…
Let $L_n(k)$ denote the least common multiple of $k$ independent random integers uniformly chosen in $\{1,2,\ldots ,n\}$. In this note, using a purely probabilistic approach, we derive a criterion for the convergence in distribution as…
Multivariate distributions are explored using the joint distributions of marginal sample quantiles. Limit theory for the mean of a function of order statistics is presented. The results include a multivariate central limit theorem and a…
For a regular functional J defined on a Hilbert space X, we consider the set N of points x of X such that the projection of the gradient of J at x onto a closed linear subspace V(x) of X vanishes. We study sufficient conditions for a…
It is shown that for sums of functionals of digits in continued fraction expansion the Kolmogorov-Feller weak laws of large numbers and the Khinchine-L\'evy-Feller-Raikov characterization of the domain of attraction of the normal law hold.
We consider unitary ensembles of Hermitian NxN matrices H with a confining potential NV where V is analytic and uniformly convex. From work by Zinn-Justin, Collins, and Guionnet and Maida it is known that the large-N limit of the…
Let $(\xi_1,\eta_1)$, $(\xi_2,\eta_2),\ldots$ be a sequence of i.i.d. two-dimensional random vectors. In the earlier article Iksanov and Pilipenko (2014) weak convergence in the $J_1$-topology on the Skorokhod space of…
We estimate linear functionals in the classical deconvolution problem by kernel estimators. We obtain a uniform central limit theorem with $\sqrt{n}$-rate on the assumption that the smoothness of the functionals is larger than the…
The $k$-d tree is one of the oldest and most widely used data structures for nearest neighbor search. It partitions Euclidean space into axis-aligned rectangular cells. There are two standard ways to find the nearest neighbor to a query in…
We study the statistics of height and balanced height in the binary search tree problem in computer science. The search tree problem is first mapped to a fragmentation problem which is then further mapped to a modified directed polymer…
The notion of regularity has been used by S. Kleiman in the construction of bounded families of ideals or sheaves with given Hilbert polynomial, a crucial point in the construction of Hilbert or Picard scheme. In a related direction,…
In this paper, we explore some interesting applications of the matrix tree theorem. In particular, we present a combinatorial interpretation of a distribution of $(n-1)^{n-1}$, in the context of uprooted spanning trees of the complete graph…
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…
We give general theorems on asymptotic normality for additive functionals of random tries generated by a sequence of independent strings. These theorems are applied to show asymptotic normality of the distribution of random fringe trees in…
We study the problem of collective tree exploration (CTE) where a team of $k$ agents is tasked to traverse all the edges of an unknown tree as fast as possible, assuming complete communication between the agents. In this paper, we present…
We study vectors chosen at random from a compact convex polytope in $\mathbb{R}^n$ given by a finite number of linear constraints. We determine which projections of these random vectors are asymptotically normal as $n\to\infty$. Marginal…