Asymptotic analysis of statistical estimators related to multigraphex processes under misspecification
DOI10.3150/23-BEJ1689MaRDI QIDQ6589566
François Caron, Judith Rousseau, Zacharie Naulet
Publication date: 20 August 2024
Published in: Bernoulli (Search for Journal in Brave)
maximum likelihood estimationnetworksrandom graphsBayesian nonparametricsBayesian estimationinferencemisspecificationsparsityCaron and Fox model
Characterization and structure theory for multivariate probability distributions; copulas (62H05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Stochastic processes (60Gxx) Nonparametric inference (62Gxx)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Oracle inequalities for network models and sparse graphon estimation
- The method of moments and degree distributions for network models
- Distance in random graphs with infinite mean degrees
- Tail index estimation, concentration and adaptivity
- Notes on the occupancy problem with infinitely many boxes: general asymptotics and power laws
- On edge exchangeable random graphs
- An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence
- Exchangeable and partially exchangeable random partitions
- Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing
- Consistent nonparametric estimation for heavy-tailed sparse graphs
- Nonexchangeable random partition models for microclustering
- Limits of sparse configuration models and beyond: graphexes and multigraphexes
- Bootstrap estimators for the tail-index and for the count statistics of graphex processes
- Sampling and estimation for (sparse) exchangeable graphs
- Optimal graphon estimation in cut distance
- Random graphs and complex networks. Volume 1
- Optimal estimation and completion of matrices with biclustering structures
- Adaptive and minimax optimal estimation of the tail coefficient
- A nonparametric view of network models and Newman–Girvan and other modularities
- Metrics for sparse graphs
- Sparse exchangeable graphs and their limits via graphon processes
- Edge Exchangeable Models for Interaction Networks
- Sparse Graphs Using Exchangeable Random Measures
- A critical point for random graphs with a given degree sequence
- Generalized Gamma measures and shot-noise Cox processes
- An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
- On sparsity, power-law, and clustering properties of graphex processes
- Near-optimal estimation of the unseen under regularly varying tail populations
This page was built for publication: Asymptotic analysis of statistical estimators related to multigraphex processes under misspecification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589566)