No article text was recorded for this version.
dense graph assumption
Version 2 of 2528 papers755 conceptsfrozen 2026-10-04
Papers in this version
- Blog: A Generative Model for Extremely Sparse Edge-Exchangeable Networks
- Blog: Sparse graphs using exchangeable random measures
- Blog: Edge-exchangeable graphs and sparsity
- Blog: The Class of Random Graphs Arising from Exchangeable Random Measures
- Blog: Graphons of Line Graphs
- Blog: Graphon Mixtures
- Blog: Learning Mean Field Games on Sparse Graphs: A Hybrid Graphex Approach
- Blog: Generalized Graphon Process: Convergence of Graph Frequencies in Stretched Cut Distance
- Blog: Sparse Graphs Using Exchangeable Random Measures
- Blog: Exchangeable Random Measures for Sparse and Modular Graphs with Overlapping Communities
- Blog: Completely random measures for modelling block-structured sparse networks
- Blog: GLMLE: graph-limit enabled fast computation for fitting exponential random graph models to large social networks
- Blog: Graph Neural Tangent Kernel: Convergence on Large Graphs
- Blog: Edge-exchangeable graphs and sparsity (NIPS 2016)
- Blog: Completely random measures for modelling block-structured networks
- Blog: A Nonparametric Bayesian Model for Sparse Temporal Multigraphs
- Blog: Limits, approximation and size transferability for GNNs on sparse graphs via graphops
- Blog: A Complete Characterization of Projectivity for Statistical Relational Models
- Blog: Modeling Sparse Graph Sequences and Signals Using Generalized Graphons
- Blog: Edge-exchangeable graphs and sparsity
- Blog: Learning Mean Field Games on Sparse Graphs: A Hybrid Graphex Approach
- Blog: Learning Sparse Graphon Mean Field Games
- Blog: Graph Neural Tangent Kernel: Convergence on Large Graphs
- Blog: Sum-of-Squares Lower Bounds for Sparse Independent Set
- Blog: Learning Mean Field Control on Sparse Graphs
- Blog: Convergent sequences of sparse graphs: A large deviations approach
- Blog: Convergence and Stability of Graph Convolutional Networks on Large Random Graphs
- Blog: Rapidly Varying Completely Random Measures for Modeling Extremely Sparse Networks
- Blog: Bayesian Models of Graphs, Arrays and Other Exchangeable Random Structures
- Blog: Learning Sparse Graphon Mean Field Games
- Blog: A Tractable Fully Bayesian Method for the Stochastic Block Model
- Blog: Sampling and Inference for Beta Neutral-to-the-Left Models of Sparse Networks
- Blog: Graph space: using both geometric and probabilistic structure to evaluate statistical graph models
- Blog: Nonparametric Embeddings of Sparse High-Order Interaction Events
- Blog: Anomalous Edge Detection in Edge Exchangeable Social Network Models
- Blog: Random function priors for exchangeable arrays with applications to graphs and relational data
- Blog: A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation
- Blog: Tame sparse exponential random graphs
- Blog: Approximating sparse graphs: The random overlapping communities model
- Blog: A Dynamic Edge Exchangeable Model for Sparse Temporal Networks
- Blog: Dynamic Network Model from Partial Observations
- Blog: Modelling sparsity, heterogeneity, reciprocity and community structure in temporal interaction data
- Blog: A Bayesian model for sparse graphs with flexible degree distribution and overlapping community structure
- Blog: The Graphon Fourier Transform
- Blog: What Do Temporal Graph Learning Models Learn?
- Blog: Discussions of the paper "Sparse graphs using exchangeable random measures" by F. Caron and E. B. Fox
- Blog: Graph Homomorphism Convolution
- Blog: Diszkrét és folytonos: a gráfelmélet, algebra, analízis és geometria találkozási pontjai = Discrete and Continuous: interfaces between graph theory, algebra, analysis and geometry
- Blog: Brief Announcement: On the Existence of δ-Temporal Cliques in Random Simple Temporal Graphs
- Blog: Learning Graphon Mean Field Games and Approximate Nash Equilibria
- Blog: OOD Link Prediction Generalization Capabilities of Message-Passing GNNs in Larger Test Graphs
- Blog: Counting maximal near perfect matchings in quasirandom and dense graphs
- Blog: Structural Sparsity of Complex Networks: Random Graph Models and Linear Algorithms
- Blog: Some Probabilistic Results on Width Measures of Graphs
- Blog: Hypergraphon Mean Field Games
- Blog: A Complete Characterization of Projectivity for Statistical Relational Models
- Blog: The adaptive interpolation method for proving replica formulas. Applications to the Curie-Weiss and Wigner spike models
- Blog: Metastability of Glauber dynamics with inhomogeneous coupling disorder
- Blog: Morse Theory and an Impossibility Theorem for Graph Clustering.
- Blog: Sparse Networks with Core-Periphery Structure
Showing 60 of 528 papers.
History & citation
Current · Permanent link
- Edge Exchangeability for Sparse and Power-Law Networks merged into this direction (100% overlap)
- Nonparametric Modeling of Asymptotically Sparse Tensors merged into this direction (62% overlap)
- Sparse Network Modeling with Edge Exchangeability merged into this direction (86% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_dense_graph_assumption_8204f00e,
title = {dense graph assumption},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/dense-graph-assumption/rdr_8204f00e4f1444fbb494ef101d884da8},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 2, frozen text):
@misc{lacuna_dense_graph_assumption_8204f00e_v2,
title = {dense graph assumption},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/dense-graph-assumption/rdr_8204f00e4f1444fbb494ef101d884da8/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-20},
}