Searcharxiv⌕ Search

arXiv subjects

Ofer Zeitouni

Publications and source records attributed to Ofer Zeitouni.

At least 37 records · Page 2Linked to original sources

On-Site Potential Creates Complexity in Systems with Disordered Coupling

We calculate the average number of critical points $\overline{\mathcal{N}}$ of the energy landscape of a many-body system with disordered two-body interactions and a weak on-site potential. We find that introducing a weak nonlinear on-site potential dramatically increases $\overline{\mathcal{N}}$ to exponential in system size and give a complete picture of the organization of critical points. Our results extend solvable spin-glass models to physically more realistic models and are of relevance to glassy systems, nonlinear oscillator networks and many-body interacting systems.

cond-mat.dis-nn↗

The maximum of branching Brownian motion in $\mathbb{R}^d$

We show that in branching Brownian motion (BBM) in $\mathbb{R}^d$, $d\geq 2$, the law of $R_t^*$, the maximum distance of a particle from the origin at time $t$, converges as $t\to\infty$ to the law of a randomly shifted Gumbel random variable.

math.PR↗

Lower Bounds on the Generalization Error of Nonlinear Learning Models

We study in this paper lower bounds for the generalization error of models derived from multi-layer neural networks, in the regime where the size of the layers is commensurate with the number of samples in the training data. We show that unbiased estimators have unacceptable performance for such nonlinear networks in this regime. We derive explicit generalization lower bounds for general biased estimators, in the cases of linear regression and of two-layered networks. In the linear case the bound is asymptotically tight. In the nonlinear case, we provide a comparison of our bounds with an empirical study of the stochastic gradient descent algorithm. The analysis uses elements from the theory of large random matrices.

stat.ML↗

The maximum of log-correlated Gaussian fields in random environments

We study the distribution of the maximum of a large class of Gaussian fields indexed by a box $V_N\subset Z^d$ and possessing logarithmic correlations up to local defects that are sufficiently rare. Under appropriate assumptions that generalize those in Ding, Roy and Zeitouni (Annals Probab. (45) 2017, 3886-3928), we show that asymptotically, the centered maximum of the field has a randomly-shifted Gumbel distribution. We prove that the two dimensional Gaussian free field on a super-critical bond percolation cluster with $p$ close enough to $1$, as well as the Gaussian free field in i.i.d. bounded conductances, fall under the assumptions of our general theorem.

math.PR↗

On the limiting law of line ensembles of Brownian polymers with geometric area tilts

We study the line ensembles of non-crossing Brownian bridges above a hard wall, each tilted by the area of the region below it with geometrically growing pre-factors. This model, which mimics the level lines of the $(2+1)$D SOS model above a hard wall, was studied in two works from 2019 by Caputo, Ioffe and Wachtel. In those works, the tightness of the law of the top $k$ paths, for any fixed $k$, was established under either zero or free boundary conditions, which in the former setting implied the existence of a limit via a monotonicity argument. Here we address the open problem of a limit under free boundary conditions: we prove that as the interval length, followed by the number of paths, go to $\infty$, the top $k$ paths converge to the same limit as in the free boundary case, as conjectured by Caputo, Ioffe and Wachtel.

math.PR↗

Universality of Poisson limits for moduli of roots of Kac polynomials

We give a new proof of a recent resolution by Michelen and Sahasrabudhe of a conjecture of Shepp and Vanderbei that the moduli of roots of Gaussian Kac polynomials of degree $n$, centered at $1$ and rescaled by $n^2$, should form a Poisson point process. We use this new approach to verify a conjecture of Michelen and Sahasrabudhe that the Poisson statistics are in fact universal.

math.PR↗

Concentration of the complexity of spherical pure $p$-spin models at arbitrary energies

We consider critical points of the spherical pure $p$-spin spin glass model with Hamiltonian $H_{N}\left(\boldsymbolσ\right)=\frac{1}{N^{\left(p-1\right)/2}}\sum_{i_{1},...,i_{p}=1}^{N}J_{i_{1},...,i_{p}}σ_{i_{1}}\cdotsσ_{i_{p}}$, where $\boldsymbolσ=\left(σ_{1},...,σ_{N}\right)\in \mathbb{S}^{N-1}:=\left\{ \boldsymbolσ\in\mathbb{R}^{N}:\,\left\Vert \boldsymbolσ\right\Vert _{2}=\sqrt{N}\right\} $ and $J_{i_{1},...,i_{p}}$ are i.i.d standard normal variables. Using a second moment analysis, we prove that for $p\geq 32$ and any $E>-E_\infty$, where $E_\infty$ is the (normalized) ground state, the ratio of the number of critical points $\boldsymbolσ$ with $H_N(\boldsymbolσ)\leq NE$ and its expectation asymptotically concentrates at $1$. This extends to arbitrary $E$ a similar conclusion of [Sub17a].

math.PR↗

A Spectral Condition for Spectral Gap: Fast Mixing in High-Temperature Ising Models

We prove that Ising models on the hypercube with general quadratic interactions satisfy a Poincaré inequality with respect to the natural Dirichlet form corresponding to Glauber dynamics, as soon as the operator norm of the interaction matrix is smaller than $1$. The inequality implies a control on the mixing time of the Glauber dynamics. Our techniques rely on a localization procedure which establishes a structural result, stating that Ising measures may be decomposed into a mixture of measures with quadratic potentials of rank one, and provides a framework for proving concentration bounds for high temperature Ising models.

math.PR↗

A local CLT for linear statistics of 2D Coulomb gases

We prove a local central limit theorem for fluctuations of linear statistics of smooth enough test functions under the canonical Gibbs measure of two-dimensional Coulomb gases at any positive temperature. The proof relies on the existing global central limit theorem and a new decay estimate for the characteristic function of such fluctuations.

math.PR↗

Localization of eigenvectors of non-Hermitian banded noisy Toeplitz matrices

We prove localization with high probability on sets of size of order $N/\log N$ for the eigenvectors of non-Hermitian finitely banded $N\times N$ Toeplitz matrices $P_N$ subject to small random perturbations, in a very general setting. As perturbation we consider $N\times N$ random matrices with independent entries of zero mean, finite moments, and which satisfy an appropriate anti-concentration bound. We show via a Grushin problem that an eigenvector for a given eigenvalue $z$ is well approximated by a random linear combination of the singular vectors of $P_N-z$ corresponding to its small singular values. We prove precise probabilistic bounds on the local distribution of the eigenvalues of the perturbed matrix and provide a detailed analysis of the singular vectors to conclude the localization result.

math.SP↗

The random heat equation in dimensions three and higher: the homogenization viewpoint

We consider the stochastic heat equation $\partial_{s}u =\frac{1}{2}Δu +(βV(s,y)-λ)u$, with a smooth space-time stationary Gaussian random field $V(s,y)$, in dimensions $d\geq 3$, with an initial condition $u(0,x)=u_0(\varepsilon x)$ and a suitably chosen $λ\in{\mathbb R}$. It is known that, for $β$ small enough, the diffusively rescaled solution $u^{\varepsilon}(t,x)=u(\varepsilon^{-2}t,\varepsilon^{-1}x)$ converges weakly to a scalar multiple of the solution $\bar u(t,x)$ of the heat equation with an effective diffusivity $a$, and that fluctuations converge, also in a weak sense, to the solution of the Edwards-Wilkinson equation with an effective noise strength $ν$ and the same effective diffusivity. In this paper, we derive a pointwise approximation $w^\varepsilon(t,x)=\bar u(t,x)Ψ^\varepsilon(t,x)+\varepsilon u_1^\varepsilon(t,x)$, where $Ψ^\varepsilon(t,x)=Ψ(t/\varepsilon^2,x/\varepsilon)$, $Ψ$ is a solution of the SHE with constant initial conditions, and $u^\varepsilon_1$ is an explicit corrector. We show that $Ψ(t,x)$ converges to a stationary process $\tilde Ψ(t,x)$ as $t\to\infty$, that $\mathbf{E}|u^\varepsilon(t,x)-w^\varepsilon(t, x)|^2$ converges pointwise to $0$ as $\varepsilon\to 0$, and that $\varepsilon^{-d/2+1}(u^\varepsilon-w^\varepsilon)$ converges weakly to $0$ for fixed $t$. As a consequence, we derive new representations of the diffusivity $a$ and effective noise strength $ν$. Our approach uses a Markov chain in the space of trajectories introduced in Gu, Ryzhik, and Zeitouni, "The Edwards-Wilkinson limit of the random heat equation in dimensions three and higher," as well as tools from homogenization theory. The corrector $u_1^\varepsilon(t,x)$ is constructed using a seemingly new approximation scheme on a mesoscopic time scale.

math.PR↗

Persistence exponents in Markov chains

We prove the existence of the persistence exponent $$\logλ:=\lim_{n\to\infty}\frac{1}{n}\log \mathbb{P}_μ(X_0\in S,\ldots,X_n\in S)$$ for a class of time homogeneous Markov chains $\{X_i\}_{i\geq 0}$ taking values in a Polish space, where $S$ is a Borel measurable set and $μ$ is an initial distribution. Focusing on the case of AR($p$) and MA($q$) processes with $p,q\in \mathbb{N}$ and continuous innovation distribution, we study the existence of $λ$ and its continuity in the parameters of the AR and MA processes, respectively, for $S=\mathbb{R}_{\geq 0}$. For AR processes with log-concave innovation distribution, we prove the strict monotonicity of $λ$. Finally, we compute new explicit exponents in several concrete examples.

math.PR↗

Directed polymers on infinite graphs

We study the directed polymer model for general graphs (beyond $\mathbb Z^d$) and random walks. We provide sufficient conditions for the existence or non-existence of a weak disorder phase, of an $L^2$ region, and of very strong disorder, in terms of properties of the graph and of the random walk. We study in some detail (biased) random walk on various trees including the Galton Watson trees, and provide a range of other examples that illustrate counter-examples to intuitive extensions of the $\mathbb Z^d$/SRW result.

math.PR↗

Everything is a Race and Nakamoto Always Wins

Nakamoto invented the longest chain protocol, and claimed its security by analyzing the private double-spend attack, a race between the adversary and the honest nodes to grow a longer chain. But is it the worst attack? We answer the question in the affirmative for three classes of longest chain protocols, designed for different consensus models: 1) Nakamoto's original Proof-of-Work protocol; 2) Ouroboros and SnowWhite Proof-of-Stake protocols; 3) Chia Proof-of-Space protocol. As a consequence, exact characterization of the maximum tolerable adversary power is obtained for each protocol as a function of the average block time normalized by the network delay. The security analysis of these protocols is performed in a unified manner by a novel method of reducing all attacks to a race between the adversary and the honest nodes.

cs.CR↗

Outliers of random perturbations of Toeplitz matrices with finite symbols

Consider an $N\times N$ Toeplitz matrix $T_N$ with symbol ${a }(λ) := \sum_{\ell=-d_2}^{d_1} a_\ell λ^\ell$, perturbed by an additive noise matrix $N^{-γ} E_N$, where the entries of $E_N$ are centered i.i.d.~random variables of unit variance and $γ>1/2$. It is known that the empirical measure of eigenvalues of the perturbed matrix converges weakly, as $N\to\infty$, to the law of ${a}(U)$, where $U$ is distributed uniformly on $\mathbb{S}^1$. In this paper, we consider the outliers, i.e. eigenvalues that are at a positive ($N$-independent) distance from ${a}(\mathbb{S}^1)$. We prove that there are no outliers outside ${\rm spec} \, T({a})$, the spectrum of the limiting Toeplitz operator, with probability approaching one, as $N \to \infty$. {In contrast,} in ${\rm spec}\, T({a})\setminus {a}({\mathbb S}^1)$ the process of outliers converges to the point process described by the zero set of certain random {analytic} functions. The limiting random {analytic} functions can be expressed as linear combinations of the determinants of finite sub-matrices of an infinite dimensional matrix, whose entries are i.i.d.~having the same law as that of $E_N$. The coefficients in the linear combination depend on the roots of the polynomial $P_{z, {a}}(λ):= ({a}(λ) -z)λ^{d_2}=0$ and semi-standard Young Tableaux with shapes determined by the number of roots of $P_{z,{a}}(λ)=0$ that are greater than one in moduli.

math.PR↗

Maximum of Branching Brownian motion in a periodic environment

We study the maximum of Branching Brownian motion (BBM) with branching rates that vary in space, via a periodic function of a particle's location. This corresponds to a variant of the F-KPP equation in a periodic medium, extensively studied in the last 15 years, admitting pulsating fronts as solutions. Recent progress on this PDE due to Hamel, Nolen, Roquejoffre and Ryzhik ('16) implies tightness for the centered maximum of BBM in a periodic environment. Here we establish the convergence in distribution of specific subsequences of this centered maximum, and identify the limiting distribution. Consequently, we find the asymptotic shift between the solution to the corresponding F-KPP equation with Heavyside initial data and the pulsating wave, thereby answering a question of Hamel et al. Analogous results are given for the cases where the Brownian motion is replaced by an Ito diffusion with periodic coefficients, as well as for nearest-neighbor branching random walks.

math.PR↗