[2603.24763] Binary Expansion Group Intersection Network

Mathematics > Statistics Theory arXiv:2603.24763 (math) [Submitted on 25 Mar 2026] Title:Binary Expansion Group Intersection Network Authors:Sicheng Zhou, Kai Zhang View a PDF of the paper titled Binary Expansion Group Intersection Network, by Sicheng Zhou and Kai Zhang View PDF Abstract:Conditional independence is central to modern statistics, but beyond special parametric families it rarely admits an exact covariance characterization. We introduce the binary expansion group intersection network (BEGIN), a distribution-free graphical representation for multivariate binary data and bit-encoded multinomial variables. For arbitrary binary random vectors and bit representations of multinomial variables, we prove that conditional independence is equivalent to a sparse linear representation of conditional expectations, to a block factorization of the corresponding interaction covariance matrix, and to block diagonality of an associated generalized Schur complement. The resulting graph is indexed by the intersection of multiplicative groups of binary interactions, yielding an analogue of Gaussian graphical modeling beyond the Gaussian setting. This viewpoint treats data bits as atoms and local BEGIN molecules as building blocks for large Markov random fields. We also show how dyadic bit representations allow BEGIN to approximate conditional independence for general random vectors under mild regularity conditions. A key technical device is the Hadamard prism, a linear map that li...