Fast Generation of Sparse Random Kernel Graphs.
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 p...
Main Authors: | Aric Hagberg, Nathan Lemons |
---|---|
Format: | Article |
Language: | English |
Published: |
Public Library of Science (PLoS)
2015-01-01
|
Series: | PLoS ONE |
Online Access: | http://europepmc.org/articles/PMC4565681?pdf=render |
Similar Items
-
On randomly colouring locally sparse graphs
by: Alan Frieze, et al.
Published: (2006-01-01) -
On the max-cut of sparse random graphs
by: Gamarnik, David, et al.
Published: (2019) -
Right-convergence of sparse random graphs
by: Gamarnik, David
Published: (2014) -
Thresholds and the structure of sparse random graphs
by: Fountoulakis, N.
Published: (2003) -
Spatial-Spectral Graph Regularized Kernel Sparse Representation for Hyperspectral Image Classification
by: Jianjun Liu, et al.
Published: (2017-08-01)