No article text was recorded for this version.
linear-time graph generation
Version 1 of 131 papers41 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Coin-Flipping, Ball-Dropping, and Grass-Hopping for Generating Random Graphs from Matrices of Edge Probabilities
- Blog: Learning multifractal structure in large networks
- Blog: A Graph is Worth $K$ Words: Euclideanizing Graph using Pure Transformer
- Blog: BalanSiNG: Fast and Scalable Generation of Realistic Signed Networks
- Blog: A Graph is Worth $K$ Words: Euclideanizing Graph using Pure Transformer
- Blog: Temporal Heterogeneous Graph Generation with Privacy, Utility, and Efficiency
- Blog: Quilting Stochastic Kronecker Product Graphs to Generate Multiplicative Attribute Graphs
- Blog: Efficient Graph Generation with Graph Recurrent Attention Networks
- Blog: Generating large scale-free networks with the Chung-Lu random graph model
- Blog: Categorical Normalizing Flows via Continuous Transformations
- Blog: Generating massive complex networks with hyperbolic geometry faster in practice
- Blog: Autoregressive Generative Modeling of Weighted Graphs
- Blog: Deep Generation of Heterogeneous Networks
- Blog: Conditional Structure Generation through Graph Variational Generative Adversarial Nets
- Blog: Flatten Graphs as Sequences: Transformers are Scalable Graph Generators
- Blog: SCGG: A deep structure-conditioned graph generative model
- Blog: Spanning Tree-based Graph Generation for Molecules
- Blog: DAG-Aware Variational Autoencoder for Social Propagation Graph Generation
- Blog: Incorporating Assortativity and Degree Dependence into Scalable Network Models
- Blog: Scalable modeling of real graphs using Kronecker multiplication
- Blog: Efficient and Degree-Guided Graph Generation via Discrete Diffusion Modeling
- Blog: Unified Representation and Lifted Sampling for Generative Models of Social Networks
- Blog: Improving Graph Generation by Restricting Graph Bandwidth
- Blog: Revisiting Graph Analytics Benchmark
- Blog: Node Copying: A Random Graph Model for Effective Graph Sampling
- Blog: Social-Affiliation Networks: Patterns and the SOAR Model
- Blog: A Sequential Algorithm for Generating Random Graphs
- Blog: Scalable Deep Generative Modeling for Sparse Graphs
- Blog: A parallel algorithm for generating a random graph with a prescribed degree sequence
- Blog: A Simple and Scalable Representation for Graph Generation
- Blog: When Labels Fall Short: Property Graph Simulation via Blending of Network Structure and Vertex Attributes
History & citation
Current · Permanent link
- This direction split from Scaling Graph Generation Beyond the Quadratic Bottleneck (55% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_linear_time_graph_generation_bca488cd,
title = {linear-time graph generation},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/linear-time-graph-generation/rdr_bca488cd86b748ceade2fe224c117d41},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-22},
}This exact version (version 1, frozen text):
@misc{lacuna_linear_time_graph_generation_bca488cd_v1,
title = {linear-time graph generation},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/linear-time-graph-generation/rdr_bca488cd86b748ceade2fe224c117d41/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-22},
}