Related papers: Chio Condensation and Random Sign Matrices

In N=1 supersymmetric SO(N)/USp(2N) gauge theories with the tree-level superpotential W(\Phi) that is an arbitrary polynomial of the adjoint matter \Phi, the massless fluctuations about each quantum vacuum are described by U(1)^n gauge…

We introduce a new notion of acyclicity representation in labeled graphs, and present three applications thereof. Our main result is an algorithm that, given a graph $G$ and a $k$-clique expression of $G$, in time $O(6^kn^c)$ counts modulo…

The generalised eigenvalues for a pair of $N\times N$ matrices $(X_1,X_2)$ are defined as the solutions of the equation $\det (X_1-\lambda X_2)=0$, or equivalently, for $X_2$ invertible, as the eigenvalues of $X_2^{-1}X_1$. We consider…

We derive a necessary and sufficient condition for the sum of M independent continuous random variables modulo 1 to converge to the uniform distribution in L^1([0,1]), and discuss generalizations to discrete random variables. A consequence…

Let $G$ be a locally compact group and $\mu$ an admissible probability measure on $G$. Let $(B,\nu)$ be the universal topological Poisson $\mu$-boundary of $(G,\mu)$ and $\Pi_s(G)$ the universal minimal strongly proximal $G$-flow. This note…

In this paper, we derive nearly tight probabilistic norm bounds for a class of random matrices we call graph matrices. While the classical case of symmetric matrices with independent random entries (Wigner's matrices) is a special case, in…

We consider the following stochastic optimization problem first introduced by Chen et al. in \cite{chen}. We are given a vertex set of a random graph where each possible edge is present with probability p_e. We do not know which edges are…

It is proven that a conjecture of Tao (2010) holds true for log-concave random variables on the integers: For every $n \geq 1$, if $X_1,\ldots,X_n$ are i.i.d. integer-valued, log-concave random variables, then $$ H(X_1+\cdots+X_{n+1}) \geq…

Let $n, m\ge 2$. Let $\Gamma<\text{SO}^\circ(n+1,1)$ be a Zariski dense convex cocompact subgroup and $\Lambda\subset\mathbb{S}^n$ be its limit set. Let $\rho : \Gamma \to \text{SO}^\circ(m+1,1)$ be a Zariski dense convex cocompact faithful…

Motivated by a well-known result in extremal set theory, due to Nicolaas Govert de Bruijn and Paul Erd\H{o}s, we consider curves in the unit $n$-cube $[0,1]^n$ of the form \[ A=\{(x,f_1(x),\ldots,f_{n-2}(x),\alpha): x\in [0,1]\}, \] where…

We give a bijective proof of an identity relating primed shifted gl(n)-standard tableaux to the product of a gl(n) character in the form of a Schur function and a product of sums of x and y terms. This result generalises a number of…

We propose a general new method, the conditional permutation test, for testing the conditional independence of variables $X$ and $Y$ given a potentially high-dimensional random vector $Z$ that may contain confounding factors. The proposed…

Let $F_n$ be an $n$ by $n$ symmetric matrix whose entries are bounded by $n^{\gamma}$ for some $\gamma>0$. Consider a randomly perturbed matrix $M_n=F_n+X_n$, where $X_n$ is a random symmetric matrix whose upper diagonal entries $x_{ij}$…

A novel positive dependence property is introduced, called positive measure inducing (PMI for short), being fulfilled by numerous copula classes, including Gaussian, Fr\'echet, Farlie-Gumbel-Morgenstern and Frank copulas; it is conjectured…

We consider $n\times n$ real symmetric and hermitian random matrices $H_{n,m}$ equals the sum of a non-random matrix $H_{n}^{(0)}$ matrix and the sum of $m$ rank-one matrices determined by $m$ i.i.d. isotropic random vectors with…

We consider the set $\mathcal{M}_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain a new upper bound on the number of matrices from $\mathcal{M}_n(\mathbb Z; H)$ with a given characteristic…

In a graph $G=(V,E)$, each vertex $v\in V$ is labelled with $0$, $1$ or $2$ such that each vertex labelled with $0$ is adjacent to at least one vertex labelled $2$ or two vertices labelled $1$. Such kind of labelling is called an Italian…

Testing the equality of the covariance matrices of two high-dimensional samples is a fundamental inference problem in statistics. Several tests have been proposed but they are either too liberal or too conservative when the required…

For d at least two and integer n, let c_n = c_n(d) denote the number of length n self-avoiding walks beginning at the origin in the integer lattice Z^d, and, for even n, let p_n = p_n(d) denote the number of length n self-avoiding polygons…

This paper explores the mixing time of the random transposition walk on permutations with one-sided interval restrictions. In particular, we're interested in the notion of cutoff, a phenomenon which occurs when mixing occurs in a window of…