DeepAI AI Chat
Log In Sign Up

Random Graphs with Prescribed K-Core Sequences: A New Null Model for Network Analysis

by   Katherine Van Koevering, et al.

In the analysis of large-scale network data, a fundamental operation is the comparison of observed phenomena to the predictions provided by null models: when we find an interesting structure in a family of real networks, it is important to ask whether this structure is also likely to arise in random networks with similar characteristics to the real ones. A long-standing challenge in network analysis has been the relative scarcity of reasonable null models for networks; arguably the most common such model has been the configuration model, which starts with a graph G and produces a random graph with the same node degrees as G. This leads to a very weak form of null model, since fixing the node degrees does not preserve many of the crucial properties of the network, including the structure of its subgraphs. Guided by this challenge, we propose a new family of network null models that operate on the k-core decomposition. For a graph G, the k-core is its maximal subgraph of minimum degree k; and the core number of a node v in G is the largest k such that v belongs to the k-core of G. We provide the first efficient sampling algorithm to solve the following basic combinatorial problem: given a graph G, produce a random graph sampled nearly uniformly from among all graphs with the same sequence of core numbers as G. This opens the opportunity to compare observed networks G with random graphs that exhibit the same core numbers, a comparison that preserves aspects of the structure of G that are not captured by more local measures like the degree sequence. We illustrate the power of this core-based null model on some fundamental tasks in network analysis, including the enumeration of networks motifs.


page 1

page 2

page 3

page 4


Connectedness matters: Construction and exact random sampling of connected graphs

We describe a new method for the random sampling of connected networks w...

Sparse Networks with Core-Periphery Structure

We propose a statistical model for graphs with a core-periphery structur...

Approximate Conditional Sampling for Pattern Detection in Weighted Networks

Assessing the statistical significance of network patterns is crucial fo...

Configuration Models of Random Hypergraphs and their Applications

Networks of dyadic relationships between entities have emerged as a domi...

Detection threshold for correlated Erdős-Rényi graphs via densest subgraphs

The problem of detecting edge correlation between two Erdős-Rényi random...

Randomizing growing networks with a time-respecting null model

Complex networks are often used to represent systems that are not static...

Locality via Global Ties: Stability of the 2-Core Against Misspecification

For many random graph models, the analysis of a related birth process su...