An algebraic Monte-Carlo algorithm for the Partition Adjacency Matrix realization problem
Combinatorics
2021-12-15 v2
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.
Cite
@article{arxiv.1708.08242,
title = {An algebraic Monte-Carlo algorithm for the Partition Adjacency Matrix realization problem},
author = {Eva Czabarka and Laszlo A. Szekely and Zoltan Toroczkai and Shanise Walker},
journal= {arXiv preprint arXiv:1708.08242},
year = {2021}
}