17,628 research outputs found

    Central Limit Theorems for some Set Partition Statistics

    Full text link
    We prove the conjectured limiting normality for the number of crossings of a uniformly chosen set partition of [n] = {1,2,...,n}. The arguments use a novel stochastic representation and are also used to prove central limit theorems for the dimension index and the number of levels

    Central limit theorems for patterns in multiset permutations and set partitions

    Full text link
    We use the recently developed method of weighted dependency graphs to prove central limit theorems for the number of occurrences of any fixed pattern in multiset permutations and in set partitions. This generalizes results for patterns of size 2 in both settings, obtained by Canfield, Janson and Zeilberger and Chern, Diaconis, Kane and Rhoades, respectively.Comment: version 2 (52 pages) implements referee's suggestions and uses journal layou

    Limit theory for geometric statistics of point processes having fast decay of correlations

    Full text link
    Let PP be a simple,stationary point process having fast decay of correlations, i.e., its correlation functions factorize up to an additive error decaying faster than any power of the separation distance. Let Pn:=PWnP_n:= P \cap W_n be its restriction to windows Wn:=[12n1/d,12n1/d]dRdW_n:= [-{1 \over 2}n^{1/d},{1 \over 2}n^{1/d}]^d \subset \mathbb{R}^d. We consider the statistic Hnξ:=xPnξ(x,Pn)H_n^\xi:= \sum_{x \in P_n}\xi(x,P_n) where ξ(x,Pn)\xi(x,P_n) denotes a score function representing the interaction of xx with respect to PnP_n. When ξ\xi depends on local data in the sense that its radius of stabilization has an exponential tail, we establish expectation asymptotics, variance asymptotics, and CLT for HnξH_n^{\xi} and, more generally, for statistics of the re-scaled, possibly signed, ξ\xi-weighted point measures μnξ:=xPnξ(x,Pn)δn1/dx\mu_n^{\xi} := \sum_{x \in P_n} \xi(x,P_n) \delta_{n^{-1/d}x}, as WnRdW_n \uparrow \mathbb{R}^d. This gives the limit theory for non-linear geometric statistics (such as clique counts, intrinsic volumes of the Boolean model, and total edge length of the kk-nearest neighbors graph) of α\alpha-determinantal point processes having fast decreasing kernels extending the CLTs of Soshnikov (2002) to non-linear statistics. It also gives the limit theory for geometric U-statistics of α\alpha-permanental point processes and the zero set of Gaussian entire functions, extending the CLTs of Nazarov and Sodin (2012) and Shirai and Takahashi (2003), which are also confined to linear statistics. The proof of the central limit theorem relies on a factorial moment expansion originating in Blaszczyszyn (1995), Blaszczyszyn, Merzbach, Schmidt (1997) to show the fast decay of the correlations of ξ\xi-weighted point measures. The latter property is shown to imply a condition equivalent to Brillinger mixing and consequently yields the CLT for μnξ\mu_n^\xi via an extension of the cumulant method.Comment: 62 pages. Fundamental changes to the terminology including the title. The earlier 'clustering' condition is now introduced as a notion of mixing and its connection to Brillinger mixing is remarked. Newer results for superposition of independent point processes have been adde

    Local limit theorems and mod-phi convergence

    Full text link
    We prove local limit theorems for mod-{\phi} convergent sequences of random variables, {\phi} being a stable distribution. In particular, we give two new proofs of a local limit theorem in the framework of mod-phi convergence: one proof based on the notion of zone of control, and one proof based on the notion of mod-{\phi} convergence in L1(iR). These new approaches allow us to identify the infinitesimal scales at which the stable approximation is valid. We complete our analysis with a large variety of examples to which our results apply, and which stem from random matrix theory, number theory, combinatorics or statistical mechanics.Comment: 35 pages. Version 2: improved presentation, in particular for the examples in Section

    Moments and central limit theorems for some multivariate Poisson functionals

    Full text link
    This paper deals with Poisson processes on an arbitrary measurable space. Using a direct approach, we derive formulae for moments and cumulants of a vector of multiple Wiener-It\^o integrals with respect to the compensated Poisson process. Second, a multivariate central limit theorem is shown for a vector whose components admit a finite chaos expansion of the type of a Poisson U-statistic. The approach is based on recent results of Peccati et al.\ combining Malliavin calculus and Stein's method, and also yields Berry-Esseen type bounds. As applications, moment formulae and central limit theorems for general geometric functionals of intersection processes associated with a stationary Poisson process of kk-dimensional flats in Rd\R^d are discussed

    Mod-phi convergence I: Normality zones and precise deviations

    Full text link
    In this paper, we use the framework of mod-ϕ\phi convergence to prove precise large or moderate deviations for quite general sequences of real valued random variables (Xn)nN(X_{n})_{n \in \mathbb{N}}, which can be lattice or non-lattice distributed. We establish precise estimates of the fluctuations P[XntnB]P[X_{n} \in t_{n}B], instead of the usual estimates for the rate of exponential decay log(P[XntnB])\log( P[X_{n}\in t_{n}B]). Our approach provides us with a systematic way to characterise the normality zone, that is the zone in which the Gaussian approximation for the tails is still valid. Besides, the residue function measures the extent to which this approximation fails to hold at the edge of the normality zone. The first sections of the article are devoted to a proof of these abstract results and comparisons with existing results. We then propose new examples covered by this theory and coming from various areas of mathematics: classical probability theory, number theory (statistics of additive arithmetic functions), combinatorics (statistics of random permutations), random matrix theory (characteristic polynomials of random matrices in compact Lie groups), graph theory (number of subgraphs in a random Erd\H{o}s-R\'enyi graph), and non-commutative probability theory (asymptotics of random character values of symmetric groups). In particular, we complete our theory of precise deviations by a concrete method of cumulants and dependency graphs, which applies to many examples of sums of "weakly dependent" random variables. The large number as well as the variety of examples hint at a universality class for second order fluctuations.Comment: 103 pages. New (final) version: multiple small improvements ; a new section on mod-Gaussian convergence coming from the factorization of the generating function ; the multi-dimensional results have been moved to a forthcoming paper ; and the introduction has been reworke

    Weighted dependency graphs

    Full text link
    The theory of dependency graphs is a powerful toolbox to prove asymptotic normality of sums of random variables. In this article, we introduce a more general notion of weighted dependency graphs and give normality criteria in this context. We also provide generic tools to prove that some weighted graph is a weighted dependency graph for a given family of random variables. To illustrate the power of the theory, we give applications to the following objects: uniform random pair partitions, the random graph model G(n,M)G(n,M), uniform random permutations, the symmetric simple exclusion process and multilinear statistics on Markov chains. The application to random permutations gives a bivariate extension of a functional central limit theorem of Janson and Barbour. On Markov chains, we answer positively an open question of Bourdon and Vall\'ee on the asymptotic normality of subword counts in random texts generated by a Markovian source.Comment: 57 pages. Third version: minor modifications, after review proces

    From infinite urn schemes to decompositions of self-similar Gaussian processes

    Get PDF
    We investigate a special case of infinite urn schemes first considered by Karlin (1967), especially its occupancy and odd-occupancy processes. We first propose a natural randomization of these two processes and their decompositions. We then establish functional central limit theorems, showing that each randomized process and its components converge jointly to a decomposition of certain self-similar Gaussian process. In particular, the randomized occupancy process and its components converge jointly to the decomposition of a time-changed Brownian motion B(tα),α(0,1)\mathbb B(t^\alpha), \alpha\in(0,1), and the randomized odd-occupancy process and its components converge jointly to a decomposition of fractional Brownian motion with Hurst index H(0,1/2)H\in(0,1/2). The decomposition in the latter case is a special case of the decompositions of bi-fractional Brownian motions recently investigated by Lei and Nualart (2009). The randomized odd-occupancy process can also be viewed as correlated random walks, and in particular as a complement to the model recently introduced by Hammond and Sheffield (2013) as discrete analogues of fractional Brownian motions.Comment: 25 page
    corecore