Determinantal Representations of Sparse Rayleigh Laws: Cactus Graphs and Fixed-Moment Mixtures

We prove that a Bernoulli law with a triangle-free cactus covariance graph has a Hermitian determinantal representation when the Rayleigh inequalities hold near the unweighted field. Strongly Rayleigh laws have such a representation on every cactus. For bipartite covariance graphs with two hubs, a positive semidefinite matrix parametrizes the law, and its rank characterizes determinantal representation. We determine which fourth moments can distinguish mixtures whose individual components preserve the same means and covariances. An explicit rational law on eight variables separates every such mixture using eight fourth moments. Removing any one of these observations leaves data that a mixture can match. We also compute the nearest determinantal distance for a symmetric five-variable law. The files include the manuscript, LaTeX source, and exact Python computations.

Authors

Publication Details

Journal
Figshare
Published
2026-11-16
DOI
https://doi.org/10.6084/m9.figshare.35021818
Primary Topic
Random Matrices and Applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Determinantal Representations of Sparse Rayleigh Laws: Cactus Graphs and Fixed-Moment Mixtures

Akihiro Koide
Figshare
Random Matrices and Applications
preprint

Determinantal Representations of Sparse Rayleigh Laws: Cactus Graphs and Fixed-Moment Mixtures

Akihiro Koide
preprint en

Abstract

We prove that a Bernoulli law with a triangle-free cactus covariance graph has a Hermitian determinantal representation when the Rayleigh inequalities hold near the unweighted field. Strongly Rayleigh laws have such a representation on every cactus. For bipartite covariance graphs with two hubs, a positive semidefinite matrix parametrizes the law, and its rank characterizes determinantal representation. We determine which fourth moments can distinguish mixtures whose individual components preserve the same means and covariances. An explicit rational law on eight variables separates every such mixture using eight fourth moments. Removing any one of these observations leaves data that a mixture can match. We also compute the nearest determinantal distance for a symmetric five-variable law. The files include the manuscript, LaTeX source, and exact Python computations.

Figshare
Random Matrices and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon