Related papers: A central limit theorem for almost local additive …
We consider the hard-edge scaling of the Mittag-Leffler ensemble confined to a fixed disk inside the droplet. Our primary emphasis is on fluctuations of rotationally-invariant additive statistics that depend on the radius and thus give rise…
Cost functions provide a framework for constructions of sets Turing below the halting problem that are close to computable. We carry out a systematic study of cost functions. We relate their algebraic properties to their expressive…
We discuss several connections between discrete and continuous random trees. In the discrete setting, we focus on Galton-Watson trees under various conditionings. In particular, we present a simple approach to Aldous' theorem giving the…
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 derive a functional central limit theorem (fclt) for normalised sums of a function of the partial sums of independent and identically distributed random variables. In particular, we show, using a technique presented in Huang and Zhang…
Consider the edge-deletion process in which the edges of some finite tree T are removed one after the other in the uniform random order. Roughly speaking, the cut-tree then describes the genealogy of connected components appearing in this…
We prove a functional limit theorem for Markov chains that, in each step, move up or down by a possibly state dependent constant with probability $1/2$, respectively. The theorem entails that the law of every one-dimensional regular…
To any real rational function with generic ramification points we assign a combinatorial object, called a garden, which consists of a weighted labeled directed planar chord diagram and of a set of weighted rooted trees each corresponding to…
This paper establishes the rate region for a class of source coding function computation setups where sources of information are available at the nodes of a tree and where a function of these sources must be computed at the root. The rate…
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…
The paper deals with a random connection model, a random graph whose vertices are given by a homogeneous Poisson point process on $\mathbb{R}^d$, and edges are independently drawn with probability depending on the locations of the two end…
We study topological and geometric functionals of $l_\infty$-random geometric graphs on the high-dimensional torus in a sparse regime, where the expected number of neighbors decays exponentially in the dimension. More precisely, we…
In this paper, we introduce the notion of $q$-quasiadditivity of arithmetic functions, as well as the related concept of $q$-quasimultiplicativity, which generalise strong $q$-additivity and -multiplicativity, respectively. We show that…
We prove an almost sure central limit theorem on the Poisson space, which is perfectly tailored for stabilizing functionals emerging in stochastic geometry. As a consequence, we provide almost sure central limit theorems for $(i)$ the total…
We study the distributional behavior of additive arithmetic functions evaluated at integers drawn from the harmonic distribution. Our main result shows that a broad family of such functions converges in law to conditioned Dickman-type…
We establish inequalities for assessing the distance between the distribution of a (possibly multidimensional) functional of a Poisson random measure and that of a Gaussian element. Our bounds only involve add-one cost operators at the…
The central limit theorem is, with the strong law of large numbers, one of the two fundamental limit theorems in probability theory. Benjamin Jourdain and Alvin Tse have extended to non-linear functionals of the empirical measure of…
We introduce the notion of a hereditary property for rooted real trees and we also consider reduction of trees by a given hereditary property. Leaf-length erasure, also called trimming, is included as a special case of hereditary reduction.…
This thesis examines linearly edge-reinforced random walks on infinite trees. In particular, recurrence and transience of such random walks on general (fixed) trees as well as on Galton-Watson trees (i.e. random trees) is characterized, and…
The notion of a root functional of a system of polynomials or ideal of polynomials is a generalization of the notion of a root, in particular, for a multiple root. A root functional is a linear functional that is defined on a polynomial…