Related papers: Chio Condensation and Random Sign Matrices

Given a map $\phi:X\rightarrow Y$ between $F$-analytic manifolds over a local field $F$ of characteristic $0$, we introduce an invariant $\epsilon_{\star}(\phi)$ which quantifies the integrability of pushforwards of smooth compactly…

Let X_1 ,..., X_n be a collection of binary valued random variables and let f : {0,1}^n -> R be a Lipschitz function. Under a negative dependence hypothesis known as the {\em strong Rayleigh} condition, we show that f - E f satisfies a…

Chou and Wang's existence result for the $L_p$-Minkowski problem on ${\mathbb S}^{n-1}$ for $p\in(-n,1)$ and an absolutely continuous measure $\mu$ is discussed and extended to more general measures. In particular, we provide an almost…

Recently, Chau [Quant. Inform. & Comp. 11, 721 (2011)] showed that one can define certain metrics and pseudo-metrics on U(n), the group of all $n\times n$ unitary matrices, based on the arguments of the eigenvalues of the unitary matrices.…

Given $n$ independent random marked $d$-vectors $X_i$ with a common density, define the measure $\nu_n = \sum_i \xi_i $, where $\xi_i$ is a measure (not necessarily a point measure) determined by the (suitably rescaled) set of points near…

Testing hypothesis of independence between two random elements on a joint alphabet is a fundamental exercise in statistics. Pearson's chi-squared test is an effective test for such a situation when the contingency table is relatively small.…

Affinity has proven to be a useful tool for quantifying the non-equilibrium character of time continuous Markov processes since it serves as a measure for the breaking of time reversal symmetry. It has recently been conjectured that the…

The question of testing for equality in distribution between two linear models, each consisting of sums of distinct discrete independent random variables with unequal numbers of observations, has emerged from the biological research. In…

A 1-independent bond percolation model on a graph $G$ is a probability distribution on the spanning subgraphs of $G$ in which, for all vertex-disjoint sets of edges $S_1$ and $S_2$, the states of the edges in $S_1$ are independent of the…

We study the characteristic polynomial of random permutation matrices following some measures which are invariant by conjugation, including Ewens' measures which are one-parameter deformations of the uniform distribution on the permutation…

A $1$-factorization of a graph $G$ is a collection of edge-disjoint perfect matchings whose union is $E(G)$. A trivial necessary condition for $G$ to admit a $1$-factorization is that $|V(G)|$ is even and $G$ is regular; the converse is…

Adopting the graph-theoretic approach to the correlation experiments, we analyze the origin of monogamy and prove that it can be recognized as a consequence of the exclusivity principle(EP). We provide an operational criterion for monogamy:…

Let $n \ge 3$ be an integer. Let $P_n = \{1, 2, 3, ..., n-1, n \}$ and let $S_n$ be the symmetric group of permutations on $P_n$. Motivated by the theory of discrete dynamical systems on the interval, we associate each permutation $\si_n$…

We establish a characterization of almost $P$-matrices via a sign non-reversal property. In this we are inspired by the analogous results for $N$-matrices. Next, the interval hull of two $m \times n$ matrices $A=(a_{ij})$ and $B =…

We study robust versions of properties of $(n,d,\lambda)$-graphs, namely, the property of a random sparsification of an $(n,d,\lambda)$-graph, where each edge is retained with probability $p$ independently. We prove such results for the…

We establish new algorithmic guarantees with matching hardness results for coloring and independent set problems in one-sided expanders and related classes of graphs. For example, given a $3$-colorable regular one-sided expander, we compute…

We study the empirical measure $L_{A_n}$ of the eigenvalues of non-normal square matrices of the form $A_n=U_nD_nV_n$ with $U_n,V_n$ independent Haar distributed on the unitary group and $D_n$ real diagonal. We show that when the empirical…

A recent breakthrough by K\"unnemann, Mazowiecki, Sch\"utze, Sinclair-Banks, and Wegrzycki (ICALP, 2023) bounds the running time for the coverability problem in $d$-dimensional vector addition systems under unary encoding to $n^{2^{O(d)}}$,…

Distribution testing can be described as follows: $q$ samples are being drawn from some unknown distribution $P$ over a known domain $[n]$. After the sampling process, a decision must be made about whether $P$ holds some property, or is far…

The notion of return probability -- explored most famously by George P\'{o}lya on d-dimensional lattices -- has potential as a measure for the analysis of networks. We present an efficient method for finding return probability distributions…