相关论文: Is 'being above the median' a noise sensitive prop…

We study first-passage percolation on $\mathbb Z ^2$ with independent and identically distributed weights, whose common distribution is uniform on $\{a,b\}$ with $0<a<b<\infty $. Following Ahlberg and De la Riva, we consider the passage…

The noise sensitivity of a Boolean function describes its likelihood to flip under small perturbations of its input. Introduced in the seminal work of Benjamini, Kalai and Schramm [Inst. Hautes \'{E}tudes Sci. Publ. Math. 90 (1999) 5-43],…

We study noise sensitivity of properties of the largest components $({\cal C}_j)_{j\geq 1}$ of the random graph ${\cal G}(n,p)$ in its critical window $p=(1+\lambda n^{-1/3})/n$. For instance, is the property "$|{\cal C}_1|$ exceeds its…

We give the first non-trivial upper bounds on the average sensitivity and noise sensitivity of polynomial threshold functions. More specifically, for a Boolean function f on n variables equal to the sign of a real, multivariate polynomial…

The study of noise sensitivity of Boolean functions was initiated in a seminal paper of Benjamini, Kalai and Schramm, published in 1999. While this study has revealed fascinating phenomena in the context of Bernoulli percolation, few…

A Boolean function $f:\{0,1\}^n \to \{0,1\}$ is said to be noise sensitive if inserting a small random error in its argument makes the value of the function almost unpredictable. Benjamini, Kalai and Schramm showed that if the sum of…

We find the noise sensitivities (i.e., the quadratic terms of the energy with respect to the perturbation of the noise) of a particle shuttled by an optical lattice that moves according to a shortcut-to-adiabaticity transport protocol.…

A natural measure of smoothness of a Boolean function is its sensitivity (the largest number of Hamming neighbors of a point which differ from it in function value). The structure of smooth or equivalently low-sensitivity functions is still…

It is shown that a large class of events in a product probability space are highly sensitive to noise, in the sense that with high probability, the configuration with an arbitrary small percent of random errors gives almost no prediction…

We consider random walk on a mildly random environment on finite transitive d- regular graphs of increasing girth. After scaling and centering, the analytic spectrum of the transition matrix converges in distribution to a Gaussian noise. An…

In this paper, we study the complete graph $K_n$ with n vertices, where we attach an independent and identically distributed (i.i.d.) weight to each of the n(n-1)/2 edges. We focus on the weight $W_n$ and the number of edges $H_n$ of the…

Quantum graphs with leads to infinity serve as convenient models for studying various aspects of systems which are usually attributed to chaotic scattering. They are also studied in several experimental systems and practical applications.…

We study the bias of the isotonic regression estimator. While there is extensive work characterizing the mean squared error of the isotonic regression estimator, relatively little is known about the bias. In this paper, we provide a sharp…

Consider estimating a structured signal $\mathbf{x}_0$ from linear, underdetermined and noisy measurements $\mathbf{y}=\mathbf{A}\mathbf{x}_0+\mathbf{z}$, via solving a variant of the lasso algorithm: $\hat{\mathbf{x}}=\arg\min_\mathbf{x}\{…

Scattering of normally incident longitudinal and transverse acoustic waves by a randomly rough surface of an elastically isotropic solid is analyzed within the small perturbation approach. In the limiting case of a large correlation length…

Given a weighted graph $G$, a $(\beta,\varepsilon)$-hopset $H$ is an edge set such that for any $s,t \in V(G)$, where $s$ can reach $t$ in $G$, there is a path from $s$ to $t$ in $G \cup H$ which uses at most $\beta$ hops whose length is in…

The estimation of parameters in a linear model is considered under the hypothesis that the noise, with finite second order statistics, can be represented in a given deterministic basis by random coefficients. An extended underdetermined…

We study the noise sensitivity of the minimum spanning tree (MST) of the $n$-vertex complete graph when edges are assigned independent random weights. It is known that when the graph distance is rescaled by $n^{1/3}$ and vertices are given…

This paper studies the problem of estimation from relative measurements in a graph, in which a vector indexed over the nodes has to be reconstructed from pairwise measurements of differences between its components associated to nodes…

Consider the minimum mean-square error (MMSE) of estimating an arbitrary random variable from its observation contaminated by Gaussian noise. The MMSE can be regarded as a function of the signal-to-noise ratio (SNR) as well as a functional…