skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: 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.

Authors:
 [1];  [1];  [2]
  1. Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
  2. Beihang Univ. (China)
Publication Date:
Research Org.:
Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
Sponsoring Org.:
USDOE
OSTI Identifier:
1222471
Grant/Contract Number:  
AC52-06NA25396
Resource Type:
Journal Article: Accepted Manuscript
Journal Name:
PLoS ONE
Additional Journal Information:
Journal Volume: 10; Journal Issue: 9; Journal ID: ISSN 1932-6203
Publisher:
Public Library of Science
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICS AND COMPUTING; graphs; algorithms; kernel methods; random variables; integrals; computing systems; mathematical models; network analysis

Citation Formats

Hagberg, Aric, Lemons, Nathan, and Du, Wen -Bo. Fast generation of sparse random kernel graphs. United States: N. p., 2015. Web. doi:10.1371/journal.pone.0135177.
Hagberg, Aric, Lemons, Nathan, & Du, Wen -Bo. Fast generation of sparse random kernel graphs. United States. https://doi.org/10.1371/journal.pone.0135177
Hagberg, Aric, Lemons, Nathan, and Du, Wen -Bo. 2015. "Fast generation of sparse random kernel graphs". United States. https://doi.org/10.1371/journal.pone.0135177. https://www.osti.gov/servlets/purl/1222471.
@article{osti_1222471,
title = {Fast generation of sparse random kernel graphs},
author = {Hagberg, Aric and Lemons, Nathan and Du, Wen -Bo},
abstractNote = {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.},
doi = {10.1371/journal.pone.0135177},
url = {https://www.osti.gov/biblio/1222471}, journal = {PLoS ONE},
issn = {1932-6203},
number = 9,
volume = 10,
place = {United States},
year = {Thu Sep 10 00:00:00 EDT 2015},
month = {Thu Sep 10 00:00:00 EDT 2015}
}

Journal Article:
Free Publicly Available Full Text
Publisher's Version of Record

Citation Metrics:
Cited by: 5 works
Citation information provided by
Web of Science

Save / Share:

Works referenced in this record:

Resisting structural re-identification in anonymized social networks
journal, December 2010


Simple Markov-chain algorithms for generating bipartite graphs and tournaments
journal, July 1999


A Scalable Generative Graph Model with Community Structure
journal, January 2014


Asymptotic equivalence and contiguity of some random graphs
journal, January 2010


The asymptotic number of labeled graphs with given degree sequences
journal, May 1978


A Random Graph Model for Power Law Graphs
journal, January 2001


A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
journal, March 2011


A Sequential Algorithm for Generating Random Graphs
journal, July 2009


The phase transition in inhomogeneous random graphs
text, January 2005


Are We There Yet? When to Stop a Markov Chain while Generating Random Graphs
book, January 2012


Random Graphs
journal, December 1959


Efficient generation of large random networks
journal, March 2005


Sparse random graphs with clustering
text, January 2008


The Structure and Function of Complex Networks
journal, January 2003


A Random Graph Model for Power Law Graphs
journal, January 2001


Resisting structural re-identification in anonymized social networks
journal, December 2010


Modelling dynamical processes in complex socio-technical systems
journal, December 2011


Some features of the spread of epidemics and information on a random graph
journal, February 2010


A Scalable Generative Graph Model with Community Structure
journal, January 2014


Random Graphs
journal, December 1959


Connected Components in Random Graphs with Given Expected Degree Sequences
journal, November 2002


A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs
journal, December 1980


General formalism for inhomogeneous random graphs
journal, December 2002


The phase transition in inhomogeneous random graphs
journal, January 2007


Sparse random graphs with clustering
journal, March 2011


Statistical mechanics of complex networks
journal, January 2002


Assortative Mixing in Networks
journal, October 2002


Uncovering disassortativity in large scale-free networks
journal, February 2013


A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
journal, March 2011


The asymptotic number of labeled graphs with given degree sequences
journal, May 1978


A Sequential Algorithm for Generating Random Graphs
journal, July 2009


Community structure and scale-free collections of Erdős-Rényi graphs
journal, May 2012


Asymptotic equivalence and contiguity of some random graphs
journal, January 2010