Back to Search
Start Over
An algebraic Monte-Carlo algorithm for the Partition Adjacency Matrix realization problem
- Source :
- Alg. Stat. 12 (2021) 115-124
- Publication Year :
- 2017
-
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.
- Subjects :
- Mathematics - Combinatorics
05D15, 05D40, 05C82, 68W20
Subjects
Details
- Database :
- arXiv
- Journal :
- Alg. Stat. 12 (2021) 115-124
- Publication Type :
- Report
- Accession number :
- edsarx.1708.08242
- Document Type :
- Working Paper
- Full Text :
- https://doi.org/10.2140/astat.2021.12.115