An algebraic Monte-Carlo algorithm for the Partition Adjacency Matrix realization problem
arXiv:1708.08242 · doi:10.2140/astat.2021.12.115
Abstract
The graphical realization of a given degree sequence and given partition adjacency matrix simultaneously is a relevant problem in data driven modeling of networks. Here we formulate common generalizations of this problem and the Exact Matching Problem, and solve them with an algebraic Monte-Carlo algorithm that runs in polynomial time if the number of partition classes is bounded.
References in corpus (7)
- Quantifying randomness in real networks
- Maximum lilkelihood estimation in the -model
- Exact sampling of graphs with prescribed degree correlations
- On Realizations of a Joint Degree Matrix
- Graphic Realizations of Joint-Degree Matrices
- A decomposition based proof for fast mixing of a Markov chain over balanced realizations of a joint degree matrix
- Statistical Models for Degree Distributions of Networks