Degree-based graph construction
From MaRDI portal
Publication:3650407
DOI10.1088/1751-8113/42/39/392001zbMath1177.05120arXiv0905.4892OpenAlexW2063409331MaRDI QIDQ3650407
Zoltán Toroczkai, Péter L. Erdős, László A. Székely, Hyunju Kim, István Miklós
Publication date: 14 December 2009
Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0905.4892
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (16)
Graph realizations constrained by skeleton graphs ⋮ Global dynamics of an epidemic model with incomplete recovery in a complex network ⋮ On fractional realizations of graph degree sequences ⋮ Graph realizations: maximum degree in vertex neighborhoods ⋮ Methods for the graph realization problem ⋮ A survey of discrete methods in (algebraic) statistics for networks ⋮ Constructing and sampling directed graphs with given degree sequences ⋮ On realizations of a joint degree matrix ⋮ Rejection sampling of bipartite graphs with given degree sequence ⋮ Exact sampling of graphs with prescribed degree correlations ⋮ New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling ⋮ On the Swap-Distances of Different Realizations of a Graphical Degree Sequence ⋮ On partial sorting in restricted rounds ⋮ An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem ⋮ A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix ⋮ Relaxed and approximate graph realizations
This page was built for publication: Degree-based graph construction
