Weighted dependency graphs
From MaRDI portal
Publication:1990226
Abstract: 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 , 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.
Recommendations
- Weighted dependency graphs and the Ising model
- Central limit theorems for patterns in multiset permutations and set partitions
- Normal approximation for generalized \(U\)-statistics and weighted random graphs
- On normal approximations of distributions in terms of dependency graphs
- Central limit type theorems in the generalized random graphs with random vertex weights
Cites work
- scientific article; zbMATH DE number 1713116 (Why is no real title available?)
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 51763 (Why is no real title available?)
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- scientific article; zbMATH DE number 1003159 (Why is no real title available?)
- scientific article; zbMATH DE number 1984547 (Why is no real title available?)
- scientific article; zbMATH DE number 1460605 (Why is no real title available?)
- scientific article; zbMATH DE number 1504583 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 765034 (Why is no real title available?)
- A Combinatorial Central Limit Theorem
- A central limit theorem for m-dependent random variables with unbounded m
- A functional combinatorial central limit theorem
- A functional limit theorem for random graphs with applications to subgraph count statistics
- An estimate of the remainder in a combinatorial central limit theorem
- Asymptotic behavior of some statistics in Ewens random permutations
- Asymptotic lower bounds for Ramsey functions
- Asymptotic normality of statistics on permutation tableaux
- Asymptotic theory of statistics and probability
- Central limit theorems for Gaussian polytopes
- Central limit theorems for some set partition statistics
- Crossings and alignments of permutations
- Crossings and nestings of matchings and partitions
- Cumulants in noncommutative probability theory. I: Noncommutative exchangeability systems
- Entropy of open lattice systems
- Error bound in a central limit theorem of double-indexed permutation statistics
- Exact solution of a 1D asymmetric exclusion model using a matrix formulation
- Fluctuations in the weakly asymmetric exclusion process with open boundary conditions
- Formulae for Askey-Wilson moments and enumeration of staircase tableaux
- Gaussian fluctuations of characters of symmetric groups and of Young diagrams
- Gaussian limit for determinantal random point fields.
- Hidden word statistics
- Introduction to algorithms.
- Large deviations for sums of partly dependent random variables
- Logarithmic combinatorial structures: A probabilistic approach
- Mod-\(\Phi\) convergence. Normality zones and precise deviations
- Moderate deviations via cumulants
- Motif statistics.
- Non-equilibrium steady states: fluctuations and large deviations of the density and of the current
- Normal approximation under local dependence.
- Normal convergence by higher semi-invariants with applications to sums of dependent random variables and random graphs
- On a Method of Calculation of Semi-Invariants
- On a Theorem of Janson
- On central limit theorems in geometrical probability
- On normal approximations of distributions in terms of dependency graphs
- On pattern frequency occurrences in a Markovian sequence
- On the Markov chain central limit theorem
- On the relation between the multidimensional moment problem and the one-dimensional moment problem.
- On three different notions of monotone subsequences
- Orthogonal decompositions and functional limit theorems for random graph statistics
- Pattern Matching Statistics on Correlated Sources
- Random Geometric Graphs
- Relations between cumulants in noncommutative probability
- Terminal chords in connected chord diagrams
- The Central Limit Theorem for a Sequence of Random Variables with a Slowly Growing Number of Dependences
- The central limit theorem for dependent random variables
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Two moments suffice for Poisson approximations: The Chen-Stein method
- When are small subgraphs of a random graph normally distributed?
- Zeros of Gaussian analytic functions and determinantal point processes
Cited in
(17)- Asymptotic normality of pattern counts in conjugacy classes
- Beyond Dependency Graphs
- Asymptotic normality in random graphs with given vertex degrees
- A central limit theorem for descents of a Mallows permutation and its inverse
- Central limit theorems for patterns in multiset permutations and set partitions
- The method of cumulants for the normal approximation
- A multi-threading algorithm to detect and remove cycles in vertex- and arc-weighted digraph
- Weighted dependency graphs and the Ising model
- Mod-\(\phi\) convergence. II: Estimates on the speed of convergence
- Berry-Esseen-type estimates for random variables with a sparse dependency graph
- Normal approximation for U- and V-statistics of a stationary absolutely regular sequence
- Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels
- On the asymptotic normality conditions for the number of repetitions in a stationary random sequence
- Bivariate fluctuations for the number of arithmetic progressions in random sets
- Central limit theorem for statistics of subcritical configuration models
- The volume of simplices in high-dimensional Poisson-Delaunay tessellations
- Dependencies for Graphs
This page was built for publication: Weighted dependency graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1990226)
