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

In this paper we develop a very general class of bivariate discrete distributions. The basic idea is very simple. The marginals are obtained by taking the random geometric sum of a baseline distribution function. The proposed class of…

We study a family of directed random graphs whose arcs are sampled independently of each other, and are present in the graph with a probability that depends on the attributes of the vertices involved. In particular, this family of models…

Spectral independence is a recently-developed framework for obtaining sharp bounds on the convergence time of the classical Glauber dynamics. This new framework has yielded optimal $O(n \log n)$ sampling algorithms on bounded-degree graphs…

Given an integer $k\geq 3$ and an initial $k-1$ isolated vertices, an {\em antiregular $k$-hypergraph} is constructed by alternatively adding an isolated vertex (connected to no other vertices) or a dominating vertex (connected to every…

Let $k$ be a unital commutative ring. In this paper, we study polynomial functors from the category of finitely generated free nilpotent groups to the category of $k$-modules, focusing on comparisons across different nilpotency classes and…

The path independence of additive functionals for SDEs driven by the G-Brownian motion is characterized by nonlinear PDEs. The main result generalizes the existing ones for SDEs driven by the standard Brownian motion.

Ailon and Rudnick have shown that if $a,b \in C[T]$ are multiplicatively independent polynomials, then $\deg(\gcd(a^n-1,b^n-1))$ is bounded for all $n\ge1$. We show that if instead $a,b \in F[T]$ for a finite field $F$ of characteristic…

We consider the following basic, and very broad, statistical problem: Given a known high-dimensional distribution ${\cal D}$ over $\mathbb{R}^n$ and a collection of data points in $\mathbb{R}^n$, distinguish between the two possibilities…

A $k$-uniform hypergraph with $n$ vertices is an $(n,k,\ell)$-omitting system if it does not contain two edges whose intersection has size exactly $\ell$. If in addition it does not contain two edges whose intersection has size greater than…

Let $G=(V,E)$ be a finite simple graph. In this paper, we study the degree of the $h$-polynomial of the edge ideal of $G$ in relation to the independence number of $G$. Our approach is based on the value of the independence polynomial of…

Significant advances in edge computing capabilities enable learning to occur at geographically diverse locations. In general, the training data needed in those learning tasks are not only heterogeneous but also not fully generated locally.…

Probabilistic independence can dramatically simplify the task of eliciting, representing, and computing with probabilities in large domains. A key technique in achieving these benefits is the idea of graphical modeling. We survey existing…

In this paper, we estimate the linear independence measures for the values of a class Mahler functions of degree one and two. For the purpose, we study the determinants of suitable Hermite-Pad\'{e} approximation polynomials. Based on the…

The independence polynomial $i(G,x)$ of a graph $G$ is the generating function of the numbers of independent sets of each size. A graph of order $n$ is very well-covered if every maximal independent set has size $n/2$. Levit and Mandrescu…

Boundary value problems for integrable nonlinear evolution PDEs formulated on the finite interval can be analyzed by the unified method introduced by one of the authors and used extensively in the literature. The implementation of this…

Many underlying structural and functional factors that determine the fault behavior of a combinational network, are not yet fully understood. In this paper, we show that there exists a large class of Boolean functions, called root…

The tree-width of a multivariate polynomial is the tree-width of the hypergraph with hyperedges corresponding to its terms. Multivariate polynomials of bounded tree-width have been studied by Makowsky and Meer as a new sparsity condition…

The present paper introduces a modified version of cyclic-monotone independence which originally arose in the context of random matrices, and also introduces its natural analogy called cyclic-Boolean independence. We investigate formulas…

We study the Fourier spectrum of functions $f\colon \{0,1\}^{mk} \to \{-1,0,1\}$ which can be written as a product of $k$ Boolean functions $f_i$ on disjoint $m$-bit inputs. We prove that for every positive integer $d$, \[ \sum_{S \subseteq…

We study approximate integration of a function $f$ over $[0,1]^s$ based on taking the median of $2r-1$ integral estimates derived from independently randomized $(t,m,s)$-nets in base $2$. The nets are randomized by Matousek's random linear…