On sparsity, power-law, and clustering properties of graphex processes
DOI10.1017/apr.2022.75arXiv1708.03120OpenAlexW2998944247MaRDI QIDQ6198068
Francesca Panero, Judith Rousseau, François Caron
Publication date: 20 February 2024
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.03120
networkstransitivityPoisson processespower lawsparsitycommunity structuresubgraph countsgeneralised graphon
Random graphs (graph-theoretic aspects) (05C80) Strong limit theorems (60F15) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Density (toughness, etc.) (05C42)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rate-optimal graphon estimation
- Variational Bayes model averaging for graphon functions and motif frequencies inference in \(W\)-graph models
- The method of moments and degree distributions for network models
- Normal approximation on Poisson spaces: Mehler's formula, second order Poincaré inequalities and stabilization
- Limits of dense graph sequences
- Exchangeable random measures in the plane
- Notes on the occupancy problem with infinitely many boxes: general asymptotics and power laws
- Statistical analysis of network data. Methods and models
- Representations for partially exchangeable arrays of random variables
- Limits of sparse configuration models and beyond: graphexes and multigraphexes
- On convergence for graphexes
- Bootstrap estimators for the tail-index and for the count statistics of graphex processes
- Sampling perspectives on sparse exchangeable graphs
- Sampling and estimation for (sparse) exchangeable graphs
- Matrix estimation by universal singular value thresholding
- Central limit theorems for \(U\)-statistics of Poisson point processes
- A nonparametric view of network models and Newman–Girvan and other modularities
- Asymptotic tail behaviour of Poisson mixtures by applications
- Graph limits and exchangeable random graphs
- Metrics for sparse graphs
- Random Geometric Graphs
- Estimation and Prediction for Stochastic Blockstructures
- Sparse exchangeable graphs and their limits via graphon processes
- Sparse Graphs Using Exchangeable Random Measures
- Exchangeable Random Measures for Sparse and Modular Graphs with Overlapping Communities
- The phase transition in inhomogeneous random graphs
- Networks
This page was built for publication: On sparsity, power-law, and clustering properties of graphex processes
