Normal approximation for statistics of randomly weighted complexes
From MaRDI portal
Publication:6620108
DOI10.1214/24-EJP1184MaRDI QIDQ6620108FDOQ6620108
Authors: Shu Kanazawa, Khanh Duy Trinh, D. Yogeshwaran
Publication date: 16 October 2024
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Recommendations
- Normal approximation for generalized \(U\)-statistics and weighted random graphs
- Normal approximation for sums of weighted \(U\)-statistics -- application to Kolmogorov bounds in random subgraph counting
- Multivariate central limit theorems for random clique complexes
- A flexible approach for normal approximation of geometric and topological statistics
- Multivariate central limit theorems for Rademacher functionals with applications
Central limit and other weak theorems (60F05) Probability theory on algebraic and topological structures (60B99) Simplicial sets and complexes in algebraic topology (55U10) Combinatorial aspects of simplicial complexes (05E45)
Cites Work
- Central limit theorems for some graphs in computational geometry.
- Limit theorems for Betti numbers of random simplicial complexes
- Random graphs and complex networks. Volume 1
- Concentration inequalities. A nonasymptotic theory of independence
- Probability theory of classical Euclidean optimization problems
- New Berry-Esseen bounds for functionals of binomial point processes
- Title not available (Why is that?)
- Random geometric complexes in the thermodynamic regime
- A new method of normal approximation
- Normal approximation on Poisson spaces: Mehler's formula, second order Poincaré inequalities and stabilization
- Asymptotic normality in random graphs with given vertex degrees
- A short survey of Stein's method
- On the phase transition in random simplicial complexes
- The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph
- Limit theorems for persistence diagrams
- A central limit theorem with applications to percolation, epidemics and Boolean models.
- Minimal spanning trees and Stein's method
- Load balancing in hypergraphs
- Central limit theorems in the configuration model
- Limit theorems for random cubical homology
- Minimum spanning acycle and lifetime of persistent homology in the Linial-Meshulam process
- Central limit theorem for statistics of subcritical configuration models
- The interpolation method for random graphs with prescribed degrees
- Randomly weighted \(d\)-complexes: minimal spanning acycles and persistence diagrams
- On central limit theorems in stochastic geometry for add-one cost stabilizing functionals
- Random simplicial complexes: around the phase transition
- Foundations of Data Science
- Quantitative two-scale stabilization on the Poisson space
- Testing goodness of fit for point processes via topological data analysis
- Central limit theorems for combinatorial optimization problems on sparse Erdős-Rényi graphs
- A simplified second-order Gaussian Poincaré inequality in discrete setting with applications
- Law of large numbers for Betti numbers of homogeneous and spatially independent random simplicial complexes
Cited In (1)
This page was built for publication: Normal approximation for statistics of randomly weighted complexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6620108)