Related papers: A central limit theorem for almost local additive …
In this work, a generalised version of the central limit theorem is proposed for nonlinear functionals of the empirical measure of i.i.d. random variables, provided that the functional satisfies some regularity assumptions for the…
In this article we derive a self-normalized functional limit theorem for strictly stationary linear processes with i.i.d. heavy-tailed innovations and random coefficients under the condition that all partial sums of the series of…
We establish a novel bijective encoding that represents permutations as forests of decorated (or enriched) trees. This allows us to prove local convergence of uniform random permutations from substitution-closed classes satisfying a…
Motivated from the study of eccentricity, center, and sum of eccentricities in graphs and trees, we introduce several new distance-based global and local functions based on the smallest distance from a vertex to some leaf (called the…
A central limit theorem for binary tree is numerically examined. Two types of central limit theorem for higher-order branches are formulated. A topological structure of a binary tree is expressed by a binary sequence, and the…
Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…
In this paper we introduce an equivalence relation on the classes of almost periodic functions of a real or complex variable which is used to refine Bochner's result that characterizes these spaces of functions. In fact, with respect to the…
Let T be a rooted supercritical multi-type Galton-Watson (MGW) tree with types coming from a finite alphabet, conditioned to non-extinction. The lambda-biased random walk (X_t, t>=0) on T is the nearest-neighbor random walk which, when at a…
In this paper, we extend the central limit theorem of the additive functional of the nearest-neighbor zero-range process given in \cite{Quastel2002} to the long-range case. Our main results show that in several cases the limit processes are…
In conformal field theory (CFT) on simply connected domains of the Riemann sphere, the natural conformal symmetries under self-maps are extended, in a certain way, to local symmetries under general conformal maps, and this is at the basis…
Many existing interpretation methods are based on Partial Dependence (PD) functions that, for a pre-trained machine learning model, capture how a subset of the features affects the predictions by averaging over the remaining features.…
For linear processes with independent identically distributed innovations that are regularly varying with tail index $\alpha \in (0, 2)$, we study functional convergence of the joint partial sum and partial maxima processes. We derive a…
By restricting the variables running over various (possibly different) subfields, we introduce the notion of a partial zeta function. We prove that the partial zeta function is rational in an interesting case, generalizing Dwork's well…
We discuss a complementary asymptotic analysis of the so called minimal random walk. More precisely, we present a version of the almost sure central limit theorem as well as a generalization of the recently proposed quadratic strong laws.…
Central limit theorems (CLTs) have a long history in probability and statistics. They play a fundamental role in constructing valid statistical inference procedures. Over the last century, various techniques have been developed in…
It is discussed how a limiting procedure of conformal field theories may result in logarithmic conformal field theories with Jordan cells of arbitrary rank. This extends our work on rank-two Jordan cells. We also consider the limits of…
We discuss various forms of convergence of the vicinity of a uniformly at random selected vertex in random simply generated trees, as the size tends to infinity. For the standard case of a critical Galton-Watson tree conditioned to be large…
We give an FPTAS for computing the number of matchings of size $k$ in a graph $G$ of maximum degree $\Delta$ on $n$ vertices, for all $k \le (1-\delta)m^*(G)$, where $\delta>0$ is fixed and $m^*(G)$ is the matching number of $G$, and an…
We combine the method of exchangeable pairs with Stein's method for functional approximation. As a result, we give a general linearity condition under which an abstract Gaussian approximation theorem for stochastic processes holds. We apply…
We establish a functional limit theorem for the joint-law of occupations near and away from indifferent fixed points of interval maps, and of waits for the occupations away from these points, in the sense of strong distributional…