Related papers: A structure theorem for Boolean functions with sma…
A method how to construct Boolean-valued models of some fragments of arithmetic was developed in Krajicek (2011), with the intended applications in bounded arithmetic and proof complexity. Such a model is formed by a family of random…
Let $(X,d)$ be a compact metric space and $\mu$ a Borel probability on $X$. For each $N\geq 1$ let $d^N_\infty$ be the $\ell_\infty$-product on $X^N$ of copies of $d$, and consider $1$-Lipschitz functions $X^N\to\mathbb{R}$ for…
We give a structure theorem for Boolean functions on the $p$-biased hypercube which are $\epsilon$-close to degree $d$ in $L_2$, showing that they are close to sparse juntas. Our structure theorem implies that such functions are…
We provide a sharp monotonicity theorem about the distribution of subharmonic functions on manifolds, which can be regarded as a new, measure theoretic form of the uncertainty principle. As an illustration of the scope of this result, we…
In this article, we give probabilistic versions of Sobolev embeddings on any Riemannian manifold $(M,g)$. More precisely, we prove that for natural probability measures on $L^2(M)$, almost every function belong to all spaces $L^p(M)$,…
Kempe, Kleinberg and Tardos (KKT) proposed the following conjecture about the general threshold model in social networks: local monotonicity and submodularity imply global monotonicity and submodularity. That is, if the threshold function…
The influence of a variable is an important concept in the analysis of Boolean functions. The more general notion of influence of a set of variables on a Boolean function has four separate definitions in the literature. In the present work,…
How many $k$-SAT functions on $n$ boolean variables are there? What does a typical such function look like? Bollob\'as, Brightwell, and Leader conjectured that, for each fixed $k \ge 2$, the number of $k$-SAT functions on $n$ variables is…
The classical sharp threshold theorem of Friedgut and Kalai (1996) asserts that any symmetric monotone function $f:\{0,1\}^{n}\to\{0,1\}$ exhibits a sharp threshold phenomenon. This means that the expectation of $f$ with respect to the…
On smooth compact manifolds with smooth boundary, we first establish the sharp lower bounds for the restrictions of harmonic functions in terms of their frequency functions, by using a combination of microlocal analysis and frequency…
We consider ergodic $\mathrm{Sym}(\mathbb{N})$-invariant probability measures on the space of $L$-structures with domain $\mathbb{N}$ (for $L$ a countable relational language), and call such a measure a properly ergodic structure when no…
A probability distribution over the Boolean cube is monotone if flipping the value of a coordinate from zero to one can only increase the probability of an element. Given samples of an unknown monotone distribution over the Boolean cube, we…
In this paper we introduce a method which allows us to study properties of the random uniform simplicial complex. That is, we assign equal probability to all simplicial complexes with a given number of vertices and then consider properties…
In a recent work with Kindler and Wimmer we proved an invariance principle for the slice for low-influence, low-degree functions. Here we provide an alternative proof for general low-degree functions, with no constraints on the influences.…
We generalize the structure theorem of Robertson and Seymour for graphs excluding a fixed graph $H$ as a minor to graphs excluding $H$ as a topological subgraph. We prove that for a fixed $H$, every graph excluding $H$ as a topological…
A plethora of natural, artificial and social complex systems exists which violate the basic hypothesis (e.g., ergodicity) of Boltzmann-Gibbs (BG) statistical mechanics. Many of such cases can be satisfactorily handled by introducing…
The planar graph product structure theorem of Dujmovi\'{c}, Joret, Micek, Morin, Ueckerdt, and Wood [J. ACM 2020] states that every planar graph is a subgraph of the strong product of a graph with bounded treewidth and a path. This result…
An important tool to quantify the likeness of two probability measures are f-divergences, which have seen widespread application in statistics and information theory. An example is the total variation, which plays an exceptional role among…
A classical result of Carleman, based on the theory of quasianalytic functions, shows that polynomials are dense in $L^2(\mu)$ for any $\mu$ such that the moments $\int x^k d\mu$ do not grow too rapidly as $k \to \infty$. In this work, we…
A fuzzy Boolean function is a map $f:\cube^n\to [0,1]$, where $n\in\mathbb N$. We introduce and compare three ways of saying that such a function has bounded complexity. The first is a sampling property: the value $f(x)$ can be recovered,…