Pages that link to "Item:Q3597136"
From MaRDI portal
The following pages link to Graph limits and exchangeable random graphs (Q3597136):
Displaying 35 items.
- Vertex Nomination Between Graphs via Spectral Embedding and Quadratic Programming (Q5057261) (← links)
- Iterative Collaborative Filtering for Sparse Matrix Estimation (Q5060494) (← links)
- Testing for Equivalence of Network Distribution Using Subgraph Counts (Q5065993) (← links)
- Exchangeable and sampling-consistent distributions on rooted binary trees (Q5067211) (← links)
- (Q5093998) (← links)
- A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth (Q5108706) (← links)
- Classification on Large Networks: A Quantitative Bound via Motifs and Graphons (Research) (Q5118665) (← links)
- (Q5136293) (← links)
- Semantic limits of dense combinatorial objects (Q5138464) (← links)
- Random Walks on Dense Graphs and Graphons (Q5164714) (← links)
- Poset limits can be totally ordered (Q5247001) (← links)
- On the Density of Transitive Tournaments (Q5272630) (← links)
- Book Review: Probabilistic symmetries and invariance principles (Q5494749) (← links)
- Harmonic analysis of symmetric random graphs (Q5858551) (← links)
- Tree limits and limits of random trees (Q5886114) (← links)
- The cut metric, random graphs, and branching processes (Q5961848) (← links)
- Concentration estimates for functions of finite high‐dimensional random arrays (Q6063348) (← links)
- Projective families of distributions revisited (Q6066860) (← links)
- Graphon convergence of random cographs (Q6074665) (← links)
- Random cographs: Brownian graphon limit and asymptotic degree distribution (Q6074680) (← links)
- Mixture models and networks: The stochastic blockmodel (Q6078169) (← links)
- Nilspace Factors for General Uniformity Seminorms, Cubic Exchangeability and Limits (Q6107960) (← links)
- Dense multigraphon-valued stochastic processes and edge-changing dynamics in the configuration model (Q6165253) (← links)
- Localization in 1D non-parametric latent space models from pairwise affinities (Q6170608) (← links)
- Projective, sparse and learnable latent position network models (Q6183873) (← links)
- On sparsity, power-law, and clustering properties of graphex processes (Q6198068) (← links)
- Weakly interacting oscillators on dense random graphs (Q6198976) (← links)
- Kernel density estimation for undirected dyadic data (Q6199653) (← links)
- Theory of graph neural networks: representation and learning (Q6200219) (← links)
- The intransitive dice kernel: \( \frac{1\kern-2pt\mathrm{I}_{x\ge y}-1\kern-2pt\mathrm{I}_{x\le y}}{4} - \frac{3(x-y)(1+xy)}{8} \) (Q6582363) (← links)
- Empirical Likelihood for Network Data (Q6631710) (← links)
- Network Estimation by Mixing: Adaptivity and More (Q6631716) (← links)
- Forcing generalised quasirandom graphs efficiently (Q6632790) (← links)
- Computational lower bounds for graphon estimation via low-degree polynomials (Q6656622) (← links)
- From flip processes to dynamical systems on graphons (Q6663958) (← links)
