Related papers: Randomization and the Gross-Pitaevskii hierarchy
Stochastic models share many characteristics with generic parametric models. In some ways they can be regarded as a special case. But for stochastic models there is a notion of weak distribution or generalised random variable, and the same…
Recently, a new paradigm was introduced in automata theory. The main idea is to classify regular languages according to their propensity to be sorted, establishing a deep connection between automata theory and data compression [J. ACM…
We consider the problem of learning an unknown, possibly nonlinear operator between separable Hilbert spaces from supervised data. Inputs are drawn from a prescribed probability measure on the input space, and outputs are (possibly noisy)…
Suppose we observe a trajectory of length $n$ from an exponentially $\alpha$-mixing stochastic process over a finite but potentially large state space. We consider the problem of estimating the probability mass placed by the stationary…
Based on a renormalization group (RG) analysis, we study the bosonization formulas in spin-$S$ Kitaev-Gamma and Kitaev-Heisenberg-Gamma chains in the $(K<0,\Gamma>0,J>0)$ parameter region, where $S$ is a half-odd integer. We find that the…
We study one-dimensional disordered systems with average non-invertible symmetries, where quenched disorder may locally break part of the symmetry while preserving it upon disorder averaging. A canonical example is the random…
We introduce a stochastic global optimization method based on random walks on Grassmannian manifolds. To minimize a continuous objective $\ell:\mathbb{R}^d\rightarrow\mathbb{R}$, the method repeatedly samples random $k$-dimensional linear…
Motivated by engineering applications such as resource allocation in networks and inventory systems, we consider average-reward Reinforcement Learning with unbounded state space and reward function. Recent works studied this problem in the…
In classical random matrix theory the Gaussian and chiral Gaussian random matrix models with a source are realized as shifted mean Gaussian, and chiral Gaussian, random matrices with real $(\beta = 1)$, complex ($\beta = 2)$ and real…
This article is the second one of three successive articles of the authors on the matrix-weighted Besov-type and Triebel--Lizorkin-type spaces. In this article, we obtain the sharp boundedness of almost diagonal operators on matrix-weighted…
Computing the distribution of permanents of random matrices has been an outstanding open problem for several decades. In quantum computing, "anti-concentration" of this distribution is an unproven input for the proof of hardness of the task…
We introduce a new perspective on positive continuous additive functionals (PCAFs) of Markov processes, which we call space--time occupation measures (STOMs). This notion provides a natural generalization of classical occupation times and…
Our work is part of the close link between continuous-time dissipative dynamical systems and optimization algorithms, and more precisely here, in the stochastic setting. We aim to study stochastic convex minimization problems through the…
Probabilistic integration of a continuous dynamical system is a way of systematically introducing model error, at scales no larger than errors introduced by standard numerical discretisation, in order to enable thorough exploration of…
Wheeler emphasized the study of Superspace - the space of 3-geometries on a spatial manifold of fixed topology. This is a configuration space for GR; knowledge of configuration spaces is useful as regards dynamics and QM.In this Article I…
We develop a pivot-shifted Carleman linearization framework for quantum algorithms solving quadratic nonlinear ordinary differential equations. By shifting the dynamics by a pivot state prior to Carleman lifting, and combining this with a…
We study the problem of estimating the average of a Lipschitz continuous function $f$ defined over a metric space, by querying $f$ at only a single point. More specifically, we explore the role of randomness in drawing this sample. Our goal…
Random walks on expanders play a crucial role in Markov Chain Monte Carlo algorithms, derandomization, graph theory, and distributed computing. A desirable property is that they are rapidly mixing, which is equivalent to having a spectral…
Using the technique of enrichment of contractive type mappings by Krasnoselskij averaging, presented here for the first time, we introduce and study the class of {\it enriched nonexpansive mappings} in Hilbert spaces. In order to…
In geostatistics, traditional spatial models often rely on the Gaussian Process (GP) to fit stationary covariances to data. It is well known that this approach becomes computationally infeasible when dealing with large data volumes,…