Related papers: A discretized version of Krylov's estimate and its…
We extend slow manifolds near a transcritical singularity in a fast-slow system given by the explicit Euler discretization of the corresponding continuous-time normal form. The analysis uses the blow-up method and direct trajectory-based…
We introduce a new method for analyzing midpoint discretizations of stochastic differential equations (SDEs), which are frequently used in Markov chain Monte Carlo (MCMC) methods for sampling from a target measure $\pi \propto \exp(-V)$.…
In this paper, we studied a set of generalised Krylov complexity for operator growth. We demonstrate their universal features at both initial times and long times using half-analytical technique as well as numerical results. In particular,…
Weak approximations have been developed to calculate the expectation value of functionals of stochastic differential equations, and various numerical discretization schemes (Euler, Milshtein) have been studied by many authors. We present a…
In this paper, we first use PDE techniques and probabilistic methods to identify a kind of quasi-continuous random variables. Then we give a characterization of the $G$-integrable processes and get a kind of quasi-continuous processes by…
The statement of the mean field approximation theorem in the mean field theory of Markov processes particularly targets the behaviour of population processes with an unbounded number of agents. However, in most real-world engineering…
In this work, we consider rather general and broad class of Markov chains, Ito chains, that look like Euler-Maryama discretization of some Stochastic Differential Equation. The chain we study is a unified framework for theoretical analysis.…
Krylov complexity is an attractive measure for the rate at which quantum operators spread in the space of all possible operators under dynamical evolution. One expects that its late-time plateau would distinguish between integrable and…
The paper considers an Euler discretization based numerical scheme for approximating functionals of invariant distribution of an ergodic diffusion. Convergence of the numerical scheme is shown for suitably chosen discretization step, and a…
The paper studies the rate of convergence of the weak Euler approximation for It\^{o} diffusion and jump processes with H\"{o}lder-continuous generators. It covers a number of stochastic processes including the nondegenerate diffusion…
This paper is devoted to studying the application of the block Krylov subspace method for approximation of the truncated tensor SVD (T-SVD). The theoretical results of the proposed randomized approach are presented. Several experimental…
We introduce the "continuized" Nesterov acceleration, a close variant of Nesterov acceleration whose variables are indexed by a continuous time parameter. The two variables continuously mix following a linear ordinary differential equation…
Using the method of Krylov's estimates, we prove the existence of weak solutions of stochastic differential equations driven by purely discontinuous Levy processes satisfying an additional assumption. The diffusion coefficient is assumed to…
In this paper, we investigate the problem of strong approximation of the solutions of stochastic differential equations (SDEs) when the drift coefficient is given in integral form. We investigate its upper error bounds, in terms of the…
We describe an Euler scheme to approximate solutions of L\'evy driven Stochastic Differential Equations (SDE) where the grid points are random and given by the arrival times of a Poisson process. This result extends a previous work of the…
In this paper, we show the strong well-posedness of Mckean-Vlasov SDEs with non-Lipschitz coefficients. Moreover, propagation of chaos and the convergence rate for Euler's scheme of Mckean-Vlasov SDEs are also obtained.
We study the asymptotics of the point process induced by an interacting particle system with mean-field drift interaction. Under suitable assumptions, we establish propagation of chaos for this point process: it has the same weak limit as…
Krylov complexity has recently been proposed as a quantum probe of chaos. The Krylov exponent characterising the exponential growth of Krylov complexity is conjectured to upper-bound the Lyapunov exponent. We compute the Krylov and the…
A new class of explicit Euler schemes, which approximate stochastic differential equations (SDEs) with superlinearly growing drift and diffusion coefficients, is proposed in this article. It is shown, under very mild conditions, that these…
We propose an adaptive randomized truncation estimator for Krylov subspace methods that optimizes the trade-off between the solution variance and the computational cost, while remaining unbiased. The estimator solves a constrained…