Related papers: Distribution of the cokernels of determinantal row…
This paper presents uniform convergence rates for kernel regression estimators, in the setting of a structural nonlinear cointegrating regression model. We generalise the existing literature in three ways. First, the domain to which these…
We use the steepest descents method to study the integral kernel of a family of normal random matrix ensembles with eigenvalue distribution P_{N}(z_{1},...,z_{N}) = Z_{N}^{-1} e^{-N\Sigma_{i=1}^{N}V_{\alpha}(z_{i})}…
Correlation matrices are the sub-class of positive definite real matrices with all entries on the diagonal equal to unity. Earlier work has exhibited a parametrisation of the corresponding Cholesky factorisation in terms of partial…
The matrix-variate normal distribution is a popular model for high-dimensional transposable data because it decomposes the dependence structure of the random matrix into the Kronecker product of two covariance matrices: one for each of the…
We investigate concentration properties of spectral measures of Hermitian random matrices with partially dependent entries. More precisely, let $X_n$ be a Hermitian random matrix of size $n\times n$ that can be split into independent blocks…
We study the averaging-based distributed optimization solvers over random networks. We show a general result on the convergence of such schemes using weight-matrices that are row-stochastic almost surely and column-stochastic in expectation…
We consider the empirical eigenvalue distribution of random real symmetric matrices with stochastically independent skew-diagonals and study its limit if the matrix size tends to infinity. We allow correlations between entries on the same…
This paper reviews the checkered history of predictive distributions in statistics and discusses two developments, one from recent literature and the other new. The first development is bringing predictive distributions into machine…
Statistical models for multivariate data often include a semi-orthogonal matrix parameter. In many applications, there is reason to expect that the semi-orthogonal matrix parameter satisfies a structural assumption such as sparsity or…
Let $M$ be a random $m \times n$ matrix with binary entries and i.i.d. rows. The weight (i.e., number of ones) of a row has a specified probability distribution, with the row chosen uniformly at random given its weight. Let $N(n,m)$ denote…
Let $f$ be the $\mathbb{F}_q$-linear map over $\mathbb{F}_{q^{2n}}$ defined by $x\mapsto x+ax^{q^s}+bx^{q^{n+s}}$ with $\gcd(n,s)=1$. It is known that the kernel of $f$ has dimension at most $2$, as proved by Csajb\'ok et al. in "A new…
A discrete-time stochastic process derived from a model of basketball is used to generalize any discrete distribution. The generalized distributions can have one or two more parameters than the parent distribution. Those derived from…
In [NVP22], Nguyen and Van Peski raised the question of whether the surjective flag of $\mathbb Z_p$-modules modeled by $\mathrm{cok}(M_1\cdots M_k)\twoheadrightarrow \dots\twoheadrightarrow \mathrm{cok}(M_1)$ for independent random…
The distribution of higher order level spacings, i.e. the distribution of $\{s_{i}^{(n)}=E_{i+n}-E_{i}\}$ with $n\geq 1$ is derived analytically using a Wigner-like surmise for Gaussian ensembles of random matrix as well as Poisson…
Let $f(x)=x^n+a_{n-1}x^{n-1}+\dots+a_0$ be an irreducible polynomial with integer coefficients. For a prime $p$ for which $f(x)$ is fully splitting modulo $ p$, we consider $n$ roots $r_i$ of $f(x)\equiv 0\bmod p$ with $0 \le r_1\le\dots\le…
In descriptive statistics, $U$-statistics arise naturally in producing minimum-variance unbiased estimators. In 1984, Serfling considered the distribution formed by evaluating the kernel of the $U$-statistics and proposed generalized…
In this paper, we derive the analytical behavior of the limiting spectral distribution of non-central covariance matrices of the "general information-plus-noise" type, as studied in [14]. Through the equation defining its Stieltjes…
Distributed machine learning systems have been receiving increasing attentions for their efficiency to process large scale data. Many distributed frameworks have been proposed for different machine learning tasks. In this paper, we study…
We consider the adjacency matrices of sparse random graphs from the Chung-Lu model, where edges are added independently between the $N$ vertices with varying probabilities $p_{ij}$. The rank of the matrix $(p_{ij})$ is some fixed positive…
We consider $n$ particles $0\leq x_1<x_2< \cdots < x_n < +\infty$, distributed according to a probability measure of the form $$ \frac{1}{Z_n}\prod_{1\leq i <j \leq n}(x_j-x_i)\prod_{1\leq i <j \leq…