The following pages link to Weighted dependency graphs (Q1990226):
Displaying 16 items.
- The volume of simplices in high-dimensional Poisson-Delaunay tessellations (Q2077150) (← links)
- The method of cumulants for the normal approximation (Q2135728) (← links)
- A central limit theorem for descents of a Mallows permutation and its inverse (Q2155509) (← links)
- Central limit theorems for patterns in multiset permutations and set partitions (Q2180386) (← links)
- Normal approximation for U- and V-statistics of a stationary absolutely regular sequence (Q2182250) (← links)
- Bivariate fluctuations for the number of arithmetic progressions in random sets (Q2285791) (← links)
- A multi-threading algorithm to detect and remove cycles in vertex- and arc-weighted digraph (Q2633178) (← links)
- On the asymptotic normality conditions for the number of repetitions in a stationary random sequence (Q2685504) (← links)
- Dependencies for Graphs (Q5012611) (← links)
- Mod-ϕ Convergence, II: Estimates on the Speed of Convergence (Q5126533) (← links)
- Asymptotic normality in random graphs with given vertex degrees (Q5128753) (← links)
- Central limit theorem for statistics of subcritical configuration models (Q5131011) (← links)
- Beyond Dependency Graphs (Q5191112) (← links)
- Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels (Q6074662) (← links)
- Asymptotic normality of pattern counts in conjugacy classes (Q6126958) (← links)
- Berry-Esseen-type estimates for random variables with a sparse dependency graph (Q6633191) (← links)
