An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem
Algebraic Statistics · 2021
DOI: 10.2140/astat.2021.12.115 ↗Kurz gefasst
Fachartikel in der Zeitschrift Algebraic Statistics, 2021. Verfasst von Éva Czabarka und 3 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 25 Literaturangaben.
Abstract (Originalsprache)
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.
Zitieren
APA
Czabarka, É., Székely, L., Toroczkai, Z., & Walker, S. (2021). An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem. Algebraic Statistics. https://doi.org/10.2140/astat.2021.12.115
Vancouver
Czabarka É, Székely L, Toroczkai Z, Walker S. An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem. Algebraic Statistics. 2021. doi:10.2140/astat.2021.12.115
BibTeX
@article{Czabarka2021,
author = {Czabarka, Éva and Székely, László and Toroczkai, Zoltán and Walker, Shanise},
title = {An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem},
journal = {Algebraic Statistics},
year = {2021},
doi = {10.2140/astat.2021.12.115}
}
EUVIMED