The configuration model for partially directed graphs

DOI10.1007/S10955-015-1360-4MaRDI QIDQ904381zbMATH OpenOpenAlexWikidataFDO

Authors Kristoffer Spricer, T. Britton

Publication date 13 January 2016

Published in Journal of Statistical Physics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1503.05081

zbMATH Keywords

asymptotic convergencedegree distributionconfiguration modelpartially directedsemi-directed

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Abstract: The configuration model was originally defined for undirected networks and has recently been extended to directed networks. Many empirical networks are however neither undirected nor completely directed, but instead usually partially directed meaning that certain edges are directed and others are undirected. In the paper we define a configuration model for such networks where nodes have in-, out-, and undirected degrees that may be dependent. We prove conditions under which the resulting degree distributions converge to the intended degree distributions. The new model is shown to better approximate several empirical networks compared to undirected and completely directed networks.

Recommendations

• Directed random graphs with given degree distributions
• Typical distances in the directed configuration model
• Counting graphs and null models of complex networks: configuration model and extensions
• The diameter of the directed configuration model
• Constructing and sampling directed graphs with given degree sequences

Cites work

• A critical point for random graphs with a given degree sequence
• Directed random graphs with given degree distributions
• Generating simple random graphs with prescribed degree distribution
• Introduction to probability models
• Predicting epidemics on directed contact networks
• Random graphs.
• The probability that a random multigraph is simple

Cited in

(6)

• Epidemic models on social networks—With inference
• Configuring random graph models with fixed degree sequences
• Directed preferential attachment models: limiting degree distributions and their tails
• Graph realizations constrained by skeleton graphs
• Turán problems for mixed graphs
• Persistence time of SIS infections in heterogeneous populations and networks

Describes a project that uses

Uses Software

• SNAP

This page was built for publication: The configuration model for partially directed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q904381)