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

Journal Article · · PLoS ONE
 [1];  [1];  [2]
  1. Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
  2. Beihang Univ. (China)
+ Show Author Affiliations

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.

Research Organization:
Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
Sponsoring Organization:
USDOE
Grant/Contract Number:
AC52-06NA25396
OSTI ID:
1222471
Journal Information:
PLoS ONE, Vol. 10, Issue 9; ISSN 1932-6203
Publisher:
Public Library of ScienceCopyright Statement
Country of Publication:
United States
Language:
English
Citation Metrics:
Cited by: 5 works
Citation information provided by
Web of Science

References (27)

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
Modeling and Simulation of Large Biological, Information and Socio-Technical Systems: An Interaction Based Approach book January 2006
Efficient generation of large random networks journal March 2005
Sparse random graphs with clustering text January 2008
Networks book March 2010
The Structure and Function of Complex Networks journal January 2003
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
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
Community structure and scale-free collections of Erdős-Rényi graphs journal May 2012

Similar Records

Related Subjects

97 MATHEMATICS AND COMPUTING
graphs
algorithms
kernel methods
random variables
integrals
computing systems
mathematical models
network analysis