On realizations of a joint degree matrix
From MaRDI portal
Publication:479053
DOI10.1016/j.dam.2014.10.012zbMath1304.05020arXiv1302.3548OpenAlexW2013783692MaRDI QIDQ479053
Éva Czabarka, István Miklós, Aaron Dutle, Péter L. Erdős
Publication date: 5 December 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.3548
Related Items
Graph realizations constrained by skeleton graphs, Neighborhood degree lists of graphs, Constructing bounded degree graphs with prescribed degree and neighbor degree sequences, A survey of discrete methods in (algebraic) statistics for networks, Exact sampling of graphs with prescribed degree correlations, Configuring Random Graph Models with Fixed Degree Sequences, New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling, On the number of non-zero elements of joint degree vectors, Connected realizations of joint-degree matrices, 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
Cites Work
- Unnamed Item
- Unnamed Item
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Relations between graphs and integer-pair sequences
- Connected realizations of joint-degree matrices
- A remark on the existence of finite graphs
- Degree-based graph construction
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- On the Swap-Distances of Different Realizations of a Graphical Degree Sequence
- Constructing and sampling graphs with a prescribed joint degree distribution
