Constructing and sampling graphs with a prescribed joint degree distribution
From MaRDI portal
Publication:5406274
DOI10.1145/2133803.2330086zbMath1284.05248arXiv1103.4875OpenAlexW2025598851MaRDI QIDQ5406274
Publication date: 1 April 2014
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1103.4875
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Combinatorial probability (60C05)
Related Items
Graph realizations constrained by skeleton graphs ⋮ Neighborhood degree lists of graphs ⋮ Generating Maximally Disassortative Graphs with Given Degree Distribution ⋮ Constructing bounded degree graphs with prescribed degree and neighbor degree sequences ⋮ A survey of discrete methods in (algebraic) statistics for networks ⋮ On realizations of a joint degree matrix ⋮ Exact sampling of graphs with prescribed degree correlations ⋮ Configuring Random Graph Models with Fixed Degree Sequences ⋮ On the number of non-zero elements of joint degree vectors ⋮ Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree ⋮ Connected realizations of joint-degree matrices ⋮ Construction of Directed Assortative Configuration Graphs ⋮ 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 ⋮ Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices
