Related papers: Hitting time in regular sets and logarithm law for…
How long does a trajectory take to reach a stable equilibrium point in the basin of attraction of a dynamical system? This is a question of quite general interest, and has stimulated a lot of activities in dynamical and stochastic systems…
This paper presents a method for calculating Region of Attraction of a target set (not necessarily an equilibrium) for controlled polynomial dynamical systems, using a hierarchy of semidefinite programming problems (SDPs). Our approach…
We consider large random matrices $X$ with centered, independent entries but possibly different variances. We compute the normalized trace of $f(X) g(X^*)$ for $f,g$ functions analytic on the spectrum of $X$. We use these results to compute…
We give the first deterministic fully polynomial-time approximation scheme (FPTAS) for computing the partition function of a two-state spin system on an arbitrary graph, when the parameters of the system satisfy the uniqueness condition on…
We consider a system of asymmetric independent random walks on $\mathbb{Z}^d$, denoted by $\{\eta_t,t\in{\mathbb{R}}\}$, stationary under the product Poisson measure $\nu_{\rho}$ of marginal density $\rho>0$. We fix a pattern $\mathcal{A}$,…
In application as hyperthermia and nanowarming, power dissipation arises when the time-dependent magnetization $M(t)$ of an out-of-equilibrium system of nanoparticles lags behind the applied field $H(t)$. The key parameter governing this…
The article introduces a new algorithm for solving a class ofequilibrium problems involving strongly pseudomonotone bifunctions with Lipschitz-type condition. We describe how to incorporate the proximal-like regularized technique with…
We study the $L^1$-approximation of the log-Heston SDE at equidistant time points by Euler-type methods. We establish the convergence order $ 1/2-\epsilon$ for $\epsilon >0$ arbitrarily small, if the Feller index $\nu$ of the underlying CIR…
We first devise a branching algorithm that computes a minimum independent dominating set on any graph with running time O*(2^0.424n) and polynomial space. This improves the O*(2^0.441n) result by (S. Gaspers and M. Liedloff, A…
We consider the mean-field limit of systems of particles with singular interactions of the type $-\log|x|$ or $|x|^{-s}$, with $0< s<d-2$, and with an additive noise in dimensions $d \geq 3$. We use a modulated-energy approach to prove a…
Low-dimensional, complex systems are often characterized by logarithmically slow dynamics. We study the generic motion of a labeled particle in an ensemble of identical diffusing particles with hardcore interactions in a strongly…
We consider a billiard in the plane with periodic configuration of convex scatterers. This system is recurrent, in the sense that almost every orbit comes back arbitrarily close to the initial point. In this paper we study the time needed…
Existing fundamental theorems for mean-square convergence of numerical methods for stochastic differential equations (SDEs) require globally or one-sided Lipschitz continuous coefficients, while strong convergence results under merely local…
We study the time decay estimates for the linearized Landau equation on torus when the initial perturbation is not necessarily smooth. Our result reveals the kinetic and fluid aspects of the equation. We design a Picard-type iteration and…
What happens when a continuously evolving stochastic process is interrupted with large changes at random intervals $\tau$ distributed as a power-law $\sim \tau^{-(1+\alpha)};\alpha>0$? Modeling the stochastic process by diffusion and the…
We study the non-equilibrium dynamics of a one-dimensional interacting particle system that is a mixture of the voter model and the exclusion process. With the process started from a finite perturbation of the ground state Heaviside…
We prove tight mixing time bounds for natural random walks on bases of matroids, determinantal distributions, and more generally distributions associated with log-concave polynomials. For a matroid of rank $k$ on a ground set of $n$…
We prove that for any $\alpha$-mixing stationnary process the hitting time of any $n$-string $A_n$ converges, when suitably normalized, to an exponential law. We identify the normalization constant $\lambda(A_n)$. A similar statement holds…
We provide a new approach for establishing hardness of approximation results, based on the theory recently introduced by the author. It allows one to directly show that approximating a problem beyond a certain threshold requires…
For a probability measure preserving dynamical system $(\mathcal{X},f,\mu)$, the Poincar\'e Recurrence Theorem asserts that $\mu$-almost every orbit is recurrent with respect to its initial condition. This motivates study of the statistics…