Related papers: Noise sensitivity in last-passage percolation
Using the fact that the Airy process describes the limiting fluctuations of the Hammersley last-passage percolation model, we prove that it behaves locally like a Brownian motion. Our method is quite straightforward, and it is based on a…
Recent works explore deep learning's success by examining functions or data with hierarchical structure. To study the learning complexity of functions with hierarchical structure, we study the noise stability of functions with tree…
We prove that, the diffusivity and conductivity on $\mathbb{Z}^d$-Bernoulli percolation ($d \geq 2$) are infinitely differentiable in supercritical regime. This extends a result by Kozlov [Uspekhi Mat. Nauk 44 (1989), no. 2(266), pp 79 -…
We study, theoretically and numerically, a minimal model for phonons in a disordered system. For sufficient disorder, the vibrational modes of this classical system can become Anderson localized, yet this problem has received significantly…
Considering supercritical Bernoulli percolation on $\mathbb{Z}^d$, Garet and Marchand [GM09] proved a diffusive concentration for the graph distance. In this paper, we sharpen this result by establishing the subdiffusive concentration…
In the classic model of first passage percolation, for pairs of vertices separated by a Euclidean distance $L$, geodesics exhibit deviations from their mean length $L$ that are of order $L^\chi$, while the transversal fluctuations, known as…
In this survey article we consider the directed last-passage percolation model on the planar square lattice with nearest-neighbor steps and general i.i.d. weights on the vertices, outside of the class of exactly solvable models. We show how…
Let $G$ be the product of finitely many trees $T_1\times T_2 \times \cdots \times T_N$, each of which is regular with degree at least three. We consider Bernoulli bond percolation and the Ising model on this graph, giving a short proof that…
Let us consider subcritical Bernoulli percolation on a connected, transitive, infinite and locally finite graph. In this paper, we propose a new (and short) proof of the exponential decay property for the volume of clusters. We do not rely…
We employ the heat perturbations correlation function to study thermal transport in the one-dimensional (1D) Fermi-Pasta-Ulam-$\beta$ lattice with both nearest-neighbor and next-nearest-neighbor couplings. We find that such a system bears a…
As shown recently (O.B.Isaeva et al., Phys.Rev E64, 055201), the phenomena intrinsic to dynamics of complex analytic maps under appropriate conditions may occur in physical systems. We study scaling regularities associated with the effect…
We give the first properties of independent Bernoulli percolation, for oriented graphs on the set of vertices $\Z^d$ that are translation-invariant and may contain loops. We exhibit some examples showing that the critical probability for…
The transport properties of Brownian ratchet was studied in the presence of stochastic intensity noise (SIN) in both overdamped and underdamped regimes. In the overdamped case, analytical solution using the matrix continued fraction method…
We study the directed last-passage percolation model on the planar square lattice with nearest-neighbor steps and general i.i.d. weights on the vertices, outside of the class of exactly solvable models. Stationary cocycles are constructed…
We give the first non-trivial upper bounds on the average sensitivity and noise sensitivity of degree-$d$ polynomial threshold functions (PTFs). These bounds hold both for PTFs over the Boolean hypercube and for PTFs over $\R^n$ under the…
We review a recent asymptotic weak noise approach to the Kardar-Parisi-Zhang equation for the kinetic growth of an interface in higher dimensions. The weak noise approach provides a many body picture of a growing interface in terms of a…
We show that classical integrable models of last passage percolation and the related nonintersecting random walks converge uniformly on compact sets to the Airy line ensemble. Our core approach is to show convergence of nonintersecting…
Recently, the authors showed that the critical probability for random Voronoi percolation in the plane is 1/2. A by-product of the method was a short proof of the Harris-Kesten Theorem concerning bond percolation in the planar square…
A high efficiency hardware integration of neural networks benefits from realizing nonlinearity, network connectivity and learning fully in a physical substrate. Multiple systems have recently implemented some or all of these operations, yet…
Crackling noise is a common feature in many systems that are pushed slowly, the most familiar instance of which is the sound made by a sheet of paper when crumpled. In percolation and regular aggregation clusters of any size merge until a…