Abstract
We consider determinantal point processes (DPPs) constrained by spanning trees. Given a graph G=(V,E) and a positive semi-definite matrix A indexed by E, a spanning-tree DPP defines a distribution such that we draw S⊆E with probability ∝det(AS)only ifS induces a spanning tree. We prove #P-hardness of computing the normalizing constant for spanning-tree DPPs and provide an approximation-preserving reduction from the mixed discriminant, for which FPRAS is not known. We show similar results for DPPs constrained by forests.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
