Related papers: Polynomial-time sampling despite disorder chaos
We show that if $p=O(1/n)$, then the Erd\H{o}s-R\'{e}nyi random graph $G(n,p)$ with high probability admits a canonical labeling computable in time $O(n\log n)$. Combined with the previous results on the canonization of random graphs, this…
We define a (chaotic) deterministic variant of random multiplicative cascade models of turbulence. It preserves the hierarchical tree structure, thanks to the addition of infinitesimal noise. The zero-noise limit can be handled by…
A fundamental issue in nonlinear dynamics and statistical physics is how to distinguish chaotic from stochastic fluctuations in short experimental recordings. This dilemma underlies many complex systems models from stochastic gene…
A new class of particle systems with sequential interaction is proposed to approximate the McKean-Vlasov process that originally arises as the limit of the mean-field interacting particle system. The weighted empirical measure of this…
The subject of this study is the long-time equilibration dynamics of a strongly disordered one-dimensional chain of coupled weakly anharmonic classical oscillators. It is argued that chaos in this system has a very particular spatial…
Chaotic behavior of quantum systems can be characterized by the adherence of the expectation values of given probes to moments of the Haar distribution. In this work, we analyze the behavior of several probes of chaos using a technique…
Asynchronous Gibbs sampling has been recently shown to be fast-mixing and an accurate method for estimating probabilities of events on a small number of variables of a graphical model satisfying Dobrushin's condition~\cite{DeSaOR16}. We…
We show that a distribution related to Gaussian Boson Sampling (GBS) on graphs can be sampled classically in polynomial time. Graphical applications of GBS typically sample from this distribution, and thus quantum algorithms do not provide…
Using i.i.d. data to estimate a high-dimensional distribution in Wasserstein distance is a fundamental instance of the curse of dimensionality. We explore how structural knowledge about the data-generating process which gives rise to the…
Algorithmic robust statistics has traditionally focused on the contamination model where a small fraction of the samples are arbitrarily corrupted. We consider a recent contamination model that combines two kinds of corruptions: (i) small…
We have studied numerically the statistics for electronic states (level-spacings and participation ratios) from disordered graphene of finite size, described by the aspect ratio $W/L$ and various geometries, including finite or torroidal,…
In a recent letter [Phys.Rev.Lett. {\bf 30}, 3269 (1995), chao-dyn/9510011], we reported that a macroscopic chaotic determinism emerges in a multistable system: the unidirectional motion of a dissipative particle subject to an apparently…
Even in low dimensions, sampling from multi-modal distributions is challenging. We provide the first sampling algorithm for a broad class of distributions -- including all Gaussian mixtures -- with a query complexity that is polynomial in…
Consider directed polymers in a random environment on the complete graph of size $N$. This model can be formulated as a product of i.i.d. $N\times N$ random matrices and its large time asymptotics is captured by Lyapunov exponents and the…
The hard-core model has as its configurations the independent sets of some graph instance $G$. The probability distribution on independent sets is controlled by a `fugacity' $\lambda>0$, with higher $\lambda$ leading to denser…
Here we review and extend central limit theorems for highly chaotic but deterministic semi-dynamical discrete time systems. We then apply these results show how Brownian motion-like results are recovered, and how an Ornstein-Uhlenbeck…
Inspired by recent work of Alberts, Khanin and Quastel, we formulate general conditions ensuring that a sequence of multi-linear polynomials of independent random variables (called polynomial chaos expansions) converges to a limiting random…
Chaos is generic in strongly-coupled recurrent networks of model neurons, and thought to be an easily accessible dynamical regime in the brain. While neural chaos is typically seen as an impediment to robust computation, we show how such…
Dynamical chaos has recently been shown to exist in the Gaussian approximation in quantum mechanics and in the self-consistent mean field approach to studying the dynamics of quantum fields. In this study, we first show that any variational…
We consider a system of classical particles, interacting via a smooth, long-range potential, in the mean-field regime, and we optimally analyze the propagation of chaos in form of sharp estimates on many-particle correlation functions.…