Constructing and sampling directed graphs with given degree sequences

DOI10.1088/1367-2630/14/2/023012zbMath1448.05089arXiv1109.4590OpenAlexW3102797530MaRDI QIDQ5137614

Zoltán Toroczkai, K. E. Bassler, Charo I. del Genio, Hyunju Kim

Publication date: 2 December 2020

Published in: New Journal of Physics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (9)

Half-regular factorizations of the complete bipartite graph ⋮ Sufficient Conditions for Graphicality of Bidegree Sequences ⋮ Methods for the graph realization problem ⋮ Exact sampling of graphs with prescribed degree correlations ⋮ The Zipf-Poisson-stopped-sum distribution with an application for modeling the degree sequence of social networks ⋮ Fast and accurate determination of modularity and its effect size ⋮ Network community detection using modularity density measures ⋮ Unbiased sampling of network ensembles ⋮ A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Zero-one matrices with zero trace
• Generating simple random graphs with prescribed degree distribution
• A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Sequences with a unique realization by simple graphs
• The asymptotic number of labeled graphs with given degree sequences
• Connected components in random graphs with given expected degree sequences
• Complex networks. Papers from the conference `complex networks: structure, dynamics, and function', 23rd annual conference of the Center for Nonlinear Studies, Santa Fe, NM, USA, May 12--16, 2003.
• Complex networks: structure and dynamics
• Algorithms for constructing graphs and digraphs with given valences and factors
• A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
• A remark on the existence of finite graphs
• Dynamical Processes on Complex Networks
• Degree-based graph construction
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Switchings Constrained to 2-Connectivity in Simple Graphs
• A critical point for random graphs with a given degree sequence
• Sampling Regular Graphs and a Peer-to-Peer Network
• Computing and Combinatorics
• Networks

This page was built for publication: Constructing and sampling directed graphs with given degree sequences