Related papers: A Linear Time, and Constant Space, Algorithm to Co…
We introduce structured random matrix ensembles, constructed to model many-body quantum systems with local interactions. These ensembles are employed to study equilibration of isolated many-body quantum systems, showing that rather complex…
The standard implementation of the conjugate gradient algorithm suffers from communication bottlenecks on parallel architectures, due primarily to the two global reductions required every iteration. In this paper, we study conjugate…
This paper presents a quantum generalization of the multinomial distribution for the transition probabilities of $m$ identical photons in a $k$-port linear optical interferometer: two multinomial coefficients (one for the input…
Since the introduction of Stein's method in the early 1970s, much research has been done in extending and strengthening it; however, there does not exist a version of Stein's original method of exchangeable pairs for multivariate normal…
Multivariate hypergeometric distribution arises frequently in elementary statistics and probability courses, for simultaneously studying the occurence law of specified events, when sampling without replacement from a finite population with…
The method of moments is a classical statistical technique for density estimation that solves a system of moment equations to estimate the parameters of an unknown distribution. A fundamental question critical to understanding…
This paper proposes famillies of multimatricvariate and multimatrix variate distributions based on elliptically contoured laws in the context of real normed division algebras. The work allows to answer the following inference problems about…
In this paper we establish a multivariate exchangeable pairs approach within the framework of Stein's method to assess distributional distances to potentially singular multivariate normal distributions. By extending the statistics into a…
We study the problem of distributed adaptive estimation over networks where nodes cooperate to estimate physical parameters that can vary over both space and time domains. We use a set of basis functions to characterize the space-varying…
We present a message-passing based parallel version of the Space Saving algorithm designed to solve the $k$--majority problem. The algorithm determines in parallel frequent items, i.e., those whose frequency is greater than a given…
This article presents a validation of a recently proposed strongly polynomial-time algorithm for the general linear programming problem. The proposed algorithm is an implicit reduction procedure that combines primal and dual linear…
In this paper we relate the matrix $S_B$ of the second moments of a spherically truncated normal multivariate to its full covariance matrix $\Sigma$ and present an algorithm to invert the relation and reconstruct $\Sigma$ from $S_B$. While…
We consider an ensemble of nxn real symmetric random matrices A whose entries are determined by independent identically distributed random variables that have symmetric probability distribution. Assuming that the moment 12+2delta of these…
We introduce and study the Weingarten calculus for centered random permutation matrices in the symmetric group S_N. After presenting a formulation of the Weingarten calculus on the symmetric group, we derive a formula in the centered case,…
Mixture models are a fundamental tool in applied statistics and machine learning for treating data taken from multiple subpopulations. The current practice for estimating the parameters of such models relies on local search heuristics…
We consider the moment space $\mathcal{M}_n$ corresponding to $p \times p$ real or complex matrix measures defined on the interval $[0,1]$. The asymptotic properties of the first $k$ components of a uniformly distributed vector $(S_{1,n},…
We propose a statistical method for clustering of multivariate longitudinal data into homogeneous groups. This method relies on a time-varying extension on the classical K-means algorithm, where a multivariate vector autoregressive model is…
We derive the joint distribution of the moments $\mathrm{Tr}\, Q^{\kappa}$ ($\kappa\geq0$) of the Wigner-Smith matrix for a chaotic cavity supporting a large number of scattering channels $n$. This distribution turns out to be…
In recent work, Zeilberger and the author used a functional equations approach for enumerating permutations with r occurrences of the pattern 12...k. In particular, the approach yielded a polynomial-time enumeration algorithm for any fixed…
We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials over a sufficiently large finite field, produces a common…