Related papers: Bounded Independence Fools Degree-2 Threshold Func…

We extend the classical preferential attachment random graph model to random simplicial complexes. At each stage of the model, we choose one of the existing $k$-simplices with probability proportional to its $k$-degree. The chosen…

Probabilistic independence is a useful concept for describing the result of random sampling---a basic operation in all probabilistic languages---and for reasoning about groups of random variables. Nevertheless, existing verification methods…

We consider theories with fermionic degrees of freedom that have a fixed point of Wilson-Fisher type in non-integer dimension $d = 4-2\epsilon$. Due to the presence of evanescent operators, i.e., operators that vanish in integer dimensions,…

We give lower bounds for the degree of multiplicative combinations of iterates of rational functions (with certain exceptions) over a general field, establishing the multiplicative independence of said iterates. This leads to a…

We introduce partial differential encodings of Boolean functions as a way of measuring the complexity of Boolean functions. These encodings enable us to derive from group actions non-trivial bounds on the Chow-Rank of polynomials used to…

Given a random sample of size $n$ from a $p$ dimensional random vector, where both $n$ and $p$ are large, we are interested in testing whether the $p$ components of the random vector are mutually independent. This is the so-called complete…

Random subsampling of edges is a commonly employed technique in graph algorithms, underlying a vast array of modern algorithmic breakthroughs. Unfortunately, using this technique often leads to randomized algorithms with no clear path to…

Unitary ensembles of large N x N random matrices with a non-Gaussian probability distribution P[H] ~ exp{-TrV[H]} are studied using a theory of polynomials orthogonal with respect to exponential weights. Asymptotically exact expressions for…

We consider random trigonometric polynomials with general dependent coefficients. We show that under mild hypotheses on the structure of dependence, the asymptotics as the degree goes to infinity of the expected number of real zeros…

For a graph $G$, its $k$-th power $G^k$ is constructed by placing an edge between two vertices if they are within distance $k$ of each other. The $k$-independence number $\alpha_k(G)$ is defined as the independence number of $G^k$. By using…

We consider random trigonometric polynomials of the form \[ f_n(t):=\sum_{1\le k \le n} a_{k} \cos(kt) + b_{k} \sin(kt), \] whose entries $(a_{k})_{k\ge 1}$ and $(b_{k})_{k\ge 1}$ are given by two independent stationary Gaussian processes…

A general model independent approach using the `off-shell Bethe Ansatz' is presented to obtain an integral representation of generalized form factors. The general techniques are applied to the quantum sine-Gordon model alias the massive…

We consider functions $f$ of two real variables, given as trigonometric functions over a finite set $F$ of frequencies. This set is assumed to be closed under rotations in the frequency plane of angle $\frac{2k\pi}{M}$ for some integer $M$.…

We prove bounds for the absolute sum of all level-$k$ Fourier coefficients for $(-1)^{p(x)}$, where polynomial $p:\mathbf{F}_2^n \to \mathbf{F}_2$ is of degree $1$ or degree $2$.

We consider the spectral statistics of the superposition of a random diagonal matrix and a GUE matrix. By means of two alternative superanalytic approaches, the coset method and the graded eigenvalue method, we derive the two-level…

We propose a new family of copulas generalizing the Farlie-Gumbel-Morgenstern family and generated by two univariate functions. The main feature of this family is to permit the modeling of high positive dependence. In particular, it is…

We study the zero sets of the independence polynomial on recursive sequences of graphs. We prove that for a maximally independent starting graph and a stable and expanding recursion algorithm, the zeros of the independence polynomial are…

In this paper we use e-values in the context of multiple hypothesis testing assuming that the base tests produce independent, or sequential, e-values. Our simulation and empirical studies and theoretical considerations suggest that, under…

A random geometric graph $G(\mathcal{X}_n, r_n)$ is formed by taking a binomial process $\mathcal{X}_n$ as the set of vertices and joining any two distinct points with an edge if they lie within distance $r_n$ of each other. We investigate…

The degrees-of-freedom of a K-user Gaussian interference channel (GIFC) has been defined to be the multiple of (1/2)log_2(P) at which the maximum sum of achievable rates grows with increasing P. In this paper, we establish that the…