DOE OSTI · 1222471
Fast generation of sparse random kernel graphs
Abstract
The development of kernel-based inhomogeneous random graphs has provided models that are flexible enough to capture many observed characteristics of real networks, and that are also mathematically tractable. We specify a class of inhomogeneous random graph models, called random kernel graphs, that produces sparse graphs with tunable graph properties, and we develop an efficient generation algorithm to sample random instances from this model. As real-world networks are usually large, it is essential that the run-time of generation algorithms scales better than quadratically in the number of vertices n. We show that for many practical kernels our algorithm runs in time at most ο(n(logn)²). As an example, we show how to generate samples of power-law degree distribution graphs with tunable assortativity.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Hagberg, Aric, Lemons, Nathan, Du, Wen -Bo. 2015-09-10. Fast generation of sparse random kernel graphs. https://doi.org/10.1371/journal.pone.0135177. https://engineeringpapers.com/record/osti%3A1222471/fast-generation-of-sparse-random-kernel-graphs
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Engineering Papers by Indiciae: BibTeX · RIS.