1,609 research outputs found
Super-diffusivity in a shear flow model from perpetual homogenization
This paper is concerned with the asymptotic behavior solutions of stochastic
differential equations , and
. is a skew-symmetric matrix associated to a shear
flow characterized by an infinite number of spatial scales
, with where are smooth functions of period 1, ,
and grow exponentially fast with . We can show that
has an anomalous fast behavior (\E[|y_t|^2]\sim t^{1+\nu} with ) and
obtain quantitative estimates on the anomaly using and developing the tools of
homogenization
Biased random walks on random graphs
These notes cover one of the topics programmed for the St Petersburg School
in Probability and Statistical Physics of June 2012.
The aim is to review recent mathematical developments in the field of random
walks in random environment. Our main focus will be on directionally transient
and reversible random walks on different types of underlying graph structures,
such as , trees and for .Comment: Survey based one of the topics programmed for the St Petersburg
School in Probability and Statistical Physics of June 2012. 64 pages, 16
figure
Multi-scale homogenization with bounded ratios and Anomalous Slow Diffusion
We show that the effective diffusivity matrix for the heat operator
in a periodic potential
obtained as a superposition of Holder-continuous
periodic potentials (of period \T^d:=\R^d/\Z^d, ,
) decays exponentially fast with the number of scales when the
scale-ratios are bounded above and below. From this we deduce the
anomalous slow behavior for a Brownian Motion in a potential obtained as a
superposition of an infinite number of scales: Comment: 29 pages, 1 figure, submitted versio
Poisson convergence for the largest eigenvalues of Heavy Tailed Random Matrices
We study the statistics of the largest eigenvalues of real symmetric and
sample covariance matrices when the entries are heavy tailed. Extending the
result obtained by Soshnikov in \cite{Sos1}, we prove that, in the absence of
the fourth moment, the top eigenvalues behave, in the limit, as the largest
entries of the matrix.Comment: 22 pages, to appear in Annales de l'Institut Henri Poincar
Algorithmic thresholds for tensor PCA
We study the algorithmic thresholds for principal component analysis of
Gaussian -tensors with a planted rank-one spike, via Langevin dynamics and
gradient descent. In order to efficiently recover the spike from natural
initializations, the signal to noise ratio must diverge in the dimension. Our
proof shows that the mechanism for the success/failure of recovery is the
strength of the "curvature" of the spike on the maximum entropy region of the
initial data. To demonstrate this, we study the dynamics on a generalized
family of high-dimensional landscapes with planted signals, containing the
spiked tensor models as specific instances. We identify thresholds of
signal-to-noise ratios above which order 1 time recovery succeeds; in the case
of the spiked tensor model these match the thresholds conjectured for
algorithms such as Approximate Message Passing. Below these thresholds, where
the curvature of the signal on the maximal entropy region is weak, we show that
recovery from certain natural initializations takes at least stretched
exponential time. Our approach combines global regularity estimates for spin
glasses with point-wise estimates, to study the recovery problem by a
perturbative approach.Comment: 34 pages. The manuscript has been updated to add a proof of what was
Conjecture 1 in the first versio
- …
