skip to main content


Title: A PDE hierarchy for directed polymers in random environments
Abstract For a Brownian directed polymer in a Gaussian random environment, with q ( t , ⋅) denoting the quenched endpoint density and Q n ( t , x 1 , … , x n ) = E [ q ( t , x 1 ) … q ( t , x n ) ] , we derive a hierarchical PDE system satisfied by { Q n } n ⩾ 1 . We present two applications of the system: (i) we compute the generator of { μ t ( d x ) = q ( t , x ) d x } t ⩾ 0 for some special functionals, where { μ t ( d x ) } t ⩾ 0 is viewed as a Markov process taking values in the space of probability measures; (ii) in the high temperature regime with d ⩾ 3, we prove a quantitative central limit theorem for the annealed endpoint distribution of the diffusively rescaled polymer path. We also study a nonlocal diffusion-reaction equation motivated by the generator and establish a super-diffusive O ( t 2/3 ) scaling.  more » « less
Award ID(s):
2003110
PAR ID:
10323462
Author(s) / Creator(s):
;
Date Published:
Journal Name:
Nonlinearity
Volume:
34
Issue:
10
ISSN:
0951-7715
Page Range / eLocation ID:
7335 to 7370
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. We study a class of second-order degenerate linear parabolic equations in divergence form in ( − ∞ , T ) × R + d (-\infty , T) \times {\mathbb {R}}^d_+ with homogeneous Dirichlet boundary condition on ( − ∞ , T ) × ∂ R + d (-\infty , T) \times \partial {\mathbb {R}}^d_+ , where R + d = { x ∈ R d : x d > 0 } {\mathbb {R}}^d_+ = \{x \in {\mathbb {R}}^d: x_d>0\} and T ∈ ( − ∞ , ∞ ] T\in {(-\infty , \infty ]} is given. The coefficient matrices of the equations are the product of μ ( x d ) \mu (x_d) and bounded uniformly elliptic matrices, where μ ( x d ) \mu (x_d) behaves like x d α x_d^\alpha for some given α ∈ ( 0 , 2 ) \alpha \in (0,2) , which are degenerate on the boundary { x d = 0 } \{x_d=0\} of the domain. Our main motivation comes from the analysis of degenerate viscous Hamilton-Jacobi equations. Under a partially VMO assumption on the coefficients, we obtain the well-posedness and regularity of solutions in weighted Sobolev spaces. Our results can be readily extended to systems. 
    more » « less
  2. For(t,x)∈<#comment/>(0,∞<#comment/>)×<#comment/>TD(t,x) \in (0,\infty )\times \mathbb {T}^{\mathfrak {D}}, the generalized Kasner solutions (which we refer to as Kasner solutions for short) are a family of explicit solutions to various Einstein-matter systems that, exceptional cases aside, start out smooth but then develop a Big Bang singularity ast↓<#comment/>0t \downarrow 0, i.e., a singularity along an entire spacelike hypersurface, where various curvature scalars blow up monotonically. The family is parameterized by the Kasner exponentsq~<#comment/>1,⋯<#comment/>,q~<#comment/>D∈<#comment/>R\widetilde {q}_1,\cdots ,\widetilde {q}_{\mathfrak {D}} \in \mathbb {R}, which satisfy two algebraic constraints. There are heuristics in the mathematical physics literature, going back more than 50 years, suggesting that the Big Bang formation should be dynamically stable, that is, stable under perturbations of the Kasner initial data, given say at{t=1}\lbrace t = 1 \rbrace, as long as the exponents are “sub-critical” in the following sense:maxI,J,B=1,⋯<#comment/>,DI>J{q~<#comment/>I+q~<#comment/>J−<#comment/>q~<#comment/>B}>1\underset {\substack {I,J,B=1,\cdots , \mathfrak {D}\\ I > J}}{\max } \{\widetilde {q}_I+\widetilde {q}_J-\widetilde {q}_B\}>1. Previous works have rigorously shown the dynamic stability of the Kasner Big Bang singularity under stronger assumptions: (1) the Einstein-scalar field system withD=3\mathfrak {D}= 3andq~<#comment/>1≈<#comment/>q~<#comment/>2≈<#comment/>q~<#comment/>3≈<#comment/>1/3\widetilde {q}_1 \approx \widetilde {q}_2 \approx \widetilde {q}_3 \approx 1/3, which corresponds to the stability of the Friedmann–Lemaître–Robertson–Walker solution’s Big Bang or (2) the Einstein-vacuum equations forD≥<#comment/>38\mathfrak {D}\geq 38withmaxI=1,⋯<#comment/>,D|q~<#comment/>I|>1/6\underset {I=1,\cdots ,\mathfrak {D}}{\max } |\widetilde {q}_I| > 1/6. In this paper, we prove that the Kasner singularity is dynamically stable forallsub-critical Kasner exponents, thereby justifying the heuristics in the literature in the full regime where stable monotonic-type curvature-blowup is expected. We treat in detail the1+D1+\mathfrak {D}-dimensional Einstein-scalar field system for allD≥<#comment/>3\mathfrak {D}\geq 3and the1+D1+\mathfrak {D}-dimensional Einstein-vacuum equations forD≥<#comment/>10\mathfrak {D}\geq 10; both of these systems feature non-empty sets of sub-critical Kasner solutions. Moreover, for the Einstein-vacuum equations in1+31+3dimensions, where instabilities are in general expected, we prove that all singular Kasner solutions have dynamically stable Big Bangs under polarizedU(1)U(1)-symmetric perturbations of their initial data. Our results hold for open sets of initial data in Sobolev spaces without symmetry, apart from our work on polarizedU(1)U(1)-symmetric solutions.

    Our proof relies on a new formulation of Einstein’s equations: we use a constant-mean-curvature foliation, and the unknowns are the scalar field, the lapse, the components of the spatial connection and second fundamental form relative to a Fermi–Walker transported spatial orthonormal frame, and the components of the orthonormal frame vectors with respect to a transported spatial coordinate system. In this formulation, the PDE evolution system for the structure coefficients of the orthonormal frame approximately diagonalizes in a way that sharply reveals the significance of the Kasner exponent sub-criticality condition for the dynamic stability of the flow: the condition leads to the time-integrability of many terms in the equations, at least at the low derivative levels. At the high derivative levels, the solutions that we study can be much more singular with respect tott, and to handle this difficulty, we usett-weighted high order energies, and we control non-linear error terms by exploiting monotonicity induced by thett-weights and interpolating between the singularity-strength of the solution’s low order and high order derivatives. Finally, we note that our formulation of Einstein’s equations highlights the quantities that might generate instabilities outside of the sub-critical regime.

     
    more » « less
  3. Oh, A ; Naumann, T ; Globerson, A ; Saenko, K ; Hardt, M ; Levine, S (Ed.)
    We consider the problem of learning a single-index target function f∗ : Rd → R under the spiked covariance data: f∗(x) = σ∗   √ 1 1+θ ⟨x,μ⟩   , x ∼ N(0, Id + θμμ⊤), θ ≍ dβ for β ∈ [0, 1), where the link function σ∗ : R → R is a degree-p polynomial with information exponent k (defined as the lowest degree in the Hermite expansion of σ∗), and it depends on the projection of input x onto the spike (signal) direction μ ∈ Rd. In the proportional asymptotic limit where the number of training examples n and the dimensionality d jointly diverge: n, d → ∞, n/d → ψ ∈ (0,∞), we ask the following question: how large should the spike magnitude θ be, in order for (i) kernel methods, (ii) neural networks optimized by gradient descent, to learn f∗? We show that for kernel ridge regression, β ≥ 1 − 1 p is both sufficient and necessary. Whereas for two-layer neural networks trained with gradient descent, β > 1 − 1 k suffices. Our results demonstrate that both kernel methods and neural networks benefit from low-dimensional structures in the data. Further, since k ≤ p by definition, neural networks can adapt to such structures more effectively. 
    more » « less
  4. We study the bit complexity of two related fundamental computational problems in linear algebra and control theory. Our results are: (1) An Õ(n^{ω+3}a+n⁴a²+n^ωlog(1/ε)) time algorithm for finding an ε-approximation to the Jordan Normal form of an integer matrix with a-bit entries, where ω is the exponent of matrix multiplication. (2) An Õ(n⁶d⁶a+n⁴d⁴a²+n³d³log(1/ε)) time algorithm for ε-approximately computing the spectral factorization P(x) = Q^*(x)Q(x) of a given monic n× n rational matrix polynomial of degree 2d with rational a-bit coefficients having a-bit common denominators, which satisfies P(x)⪰0 for all real x. The first algorithm is used as a subroutine in the second one. Despite its being of central importance, polynomial complexity bounds were not previously known for spectral factorization, and for Jordan form the best previous best running time was an unspecified polynomial in n of degree at least twelve [Cai, 1994]. Our algorithms are simple and judiciously combine techniques from numerical and symbolic computation, yielding significant advantages over either approach by itself. 
    more » « less
  5. F or c e d at a f or a fl a p pi n g f oil e n er g y h ar v e st er wit h a cti v e l e a di n g e d g e m oti o n o p er ati n g i n t h e l o w r e d u c e d fr e q u e n c y r a n g e i s c oll e ct e d t o d et er mi n e h o w l e a di n g e d g e m oti o n aff e ct s e n er g y h ar v e sti n g p erf or m a n c e. T h e f oil pi v ot s a b o ut t h e mi dc h or d a n d o p er at e s i n t h e l o w r e d u c e d fr e q u e n c y r a n g e of 𝑓𝑓 𝑓𝑓 / 𝑈𝑈 ∞ = 0. 0 6 , 0. 0 8, a n d 0. 1 0 wit h 𝑅𝑅 𝑅𝑅 = 2 0 ,0 0 0 − 3 0 ,0 0 0 , wit h a pit c hi n g a m plit u d e of 𝜃𝜃 0 = 7 0 ∘ , a n d a h e a vi n g a m plit u d e of ℎ 0 = 0. 5 𝑓𝑓 . It i s f o u n d t h at l e a di n g e d g e m oti o n s t h at r e d u c e t h e eff e cti v e a n gl e of att a c k e arl y t h e str o k e w or k t o b ot h i n cr e a s e t h e lift f or c e s a s w ell a s s hift t h e p e a k lift f or c e l at er i n t h e fl a p pi n g str o k e. L e a di n g e d g e m oti o n s i n w hi c h t h e eff e cti v e a n gl e of att a c k i s i n cr e a s e d e arl y i n t h e str o k e s h o w d e cr e a s e d p erf or m a n c e. I n a d diti o n a di s cr et e v ort e x m o d el wit h v ort e x s h e d di n g at t h e l e a di n g e d g e i s i m pl e m e nt f or t h e m oti o n s st u di e d; it i s f o u n d t h at t h e m e c h a ni s m f or s h e d di n g at t h e l e a di n g e d g e i s n ot a d e q u at e f or t hi s p ar a m et er r a n g e a n d t h e m o d el c o n si st e ntl y o v er pr e di ct s t h e a er o d y n a mi c f or c e s. 
    more » « less