Related papers: A functional limit theorem for the profile of sear…

We give a detailed asymptotic analysis of the profiles of random symmetric digital search trees, which are in close connection with the performance of the search complexity of random queries in such trees. While the expected profiles have…

We analyse q-functional equations arising from tree-like combinatorial structures, which are counted by size, internal path length, and certain generalisations thereof. The corresponding counting parameters are labelled by a positive…

Let $(X_{k})_{k \in \mathbb Z }$ be a linear process with values in a separable Hilbert space $\mathbb{H}$ given by $X_{k} =\sum_{j=0}^{\infty} (j+1)^{-N}\varepsilon_{k-j}$ for each $k \in \mathbb Z$, where $N:\mathbb{H} \to \mathbb{H}$ is…

Let $\{X_k\}_{k \in \mathbb{Z}}$ be a stationary Gaussian process with values in a separable Hilbert space $\mathcal{H}_1$, and let $G:\mathcal{H}_1 \to \mathcal{H}_2$ be an operator acting on $X_k$. Under suitable conditions on the…

We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a…

Let $\xi_0,\xi_1,...$ be independent identically distributed (i.i.d.) random variables such that $\E \log (1+|\xi_0|)<\infty$. We consider random analytic functions of the form $$ G_n(z)=\sum_{k=0}^{\infty} \xi_k f_{k,n} z^k, $$ where…

We study the distribution of fringe trees in Patricia tries (extending earlier results by Ischebeck (2025)) and compressed binary search trees; both cases are random binary trees that have been compressed by deleting nodes of outdegree 1 so…

We identify the mean growth of the independence number of random binary search trees and random recursive trees and show normal fluctuations around their means. Similarly we also show normal limit laws for the domination number and…

Additive tree functionals represent the cost of many divide-and-conquer algorithms. We derive the limiting distribution of the additive functionals induced by toll functions of the form (a) n^\alpha when \alpha > 0 and (b) log n (the…

In arXiv:1609.05666v1 [math.PR] a functional limit theorem was proved. It states that symmetric processes associated with resistance metric measure spaces converge when the underlying spaces converge with respect to the…

We study parity decision trees for Boolean functions. The motivation of our study is the log-rank conjecture for XOR functions and its connection to Fourier analysis and parity decision tree complexity. Let f be a Boolean function with…

Consider d uniformly random permutation matrices on n labels. Consider the sum of these matrices along with their transposes. The total can be interpreted as the adjacency matrix of a random regular graph of degree 2d on n vertices. We…

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…

Let $X=\{X_n: n\in\mathbb{N}\}$ be a long memory linear process in which the coefficients are regularly varying and innovations are independent and identically distributed and belong to the domain of attraction of an $\alpha$-stable law…

The main result of this paper is a functional limit theorem for the sine-process. In particular, we study the limit distribution, in the space of trajectories, for the number of particles in a growing interval. The sine-process has the…

This paper extends the proof of density of neural networks in the space of continuous (or even measurable) functions on Euclidean spaces to functions on compact sets of probability measures. By doing so the work parallels a more then a…

Let $(\xi_1, \eta_1)$, $(\xi_2, \eta_2),\ldots$ be independent identically distributed $\mathbb{R}^2$-valued random vectors. Assuming that $\xi_1$ has zero mean and finite variance and imposing three distinct groups of assumptions on the…

Many practical problems need the output of a machine learning model to satisfy a set of constraints, $K$. Nevertheless, there is no known guarantee that classical neural network architectures can exactly encode constraints while…

For a stationary sequence of random variables we derive a self-normalized functional limit theorem under joint regular variation with index $\alpha \in (0,2)$ and weak dependence conditions. The convergence takes place in the space of…

We prove an asymptotic Edgeworth expansion for the profiles of certain random trees including binary search trees, random recursive trees and plane-oriented random trees, as the size of the tree goes to infinity. All these models can be…