Pages that link to "Item:Q5227976"
From MaRDI portal
The following pages link to An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions (Q5227976):
Displaying 12 items.
- Kontsevich Graphons (Q6166503) (← links)
- Projective, sparse and learnable latent position network models (Q6183873) (← links)
- Subgraph densities in Markov spaces (Q6184559) (← links)
- Graphon mean field systems (Q6187473) (← links)
- Non-representative sampled networks: estimation of network structural properties by weighting (Q6199630) (← links)
- Graphon games: a statistical framework for network games and interventions (Q6536514) (← links)
- Hypergraphon mean field games (Q6570812) (← links)
- On the continuum limit of epidemiological models on graphs: convergence and approximation results (Q6572312) (← links)
- Asymptotic analysis of statistical estimators related to multigraphex processes under misspecification (Q6589566) (← links)
- Tractably modelling dependence in networks beyond exchangeability (Q6632619) (← links)
- Robust recovery of Robinson property in \(L^p\)-graphons: a cut-norm approach (Q6635185) (← links)
- Computational lower bounds for graphon estimation via low-degree polynomials (Q6656622) (← links)
