Related papers: Convergence in the $p$-contest

We study a stochastic $N$-particle system representing economic agents in a population randomly exchanging their money, which is associated to a class of one-dimensional kinetic equations modelling the evolution of the distribution of…

In this paper, we generalize and improve some fundamental concentration inequalities using information on the random variables' higher moments. In particular, we improve the classical Hoeffding's and Bennett's inequalities for the case…

We investigate the behavior of the sum and difference sets of $A \subseteq \mathbb{Z}/n\mathbb{Z}$ chosen independently and randomly according to a binomial parameter $p(n) = o(1)$. We show that for rapidly decaying $p(n)$, $A$ is almost…

A continuous-time Markov process $X$ can be conditioned to be in a given state at a fixed time $T > 0$ using Doob's $h$-transform. This transform requires the typically intractable transition density of $X$. The effect of the $h$-transform…

This paper deals with three major types of convergence of probability measures on metric spaces: weak convergence, setwise converges, and convergence in the total variation. First, it describes and compares necessary and sufficient…

Given an autoregressive process X of order p (i.e. X_n = a_1 X_{n-1} + ...+ a_p X_{n_p} + Y_n where the random variables Y_1, Y_2, ... are i.i.d.), we study the asymptotic behaviour of the probability that the process does not exceed a…

We exploit analogies between first-order algorithms for constrained optimization and non-smooth dynamical systems to design a new class of accelerated first-order algorithms for constrained optimization. Unlike Frank-Wolfe or projected…

We analyze the convergence rates for a family of auto-regressive Markov chains $(X^{(n)}_k)_{k\geq 0}$ on $\mathbb R^d$, where at each step a randomly chosen coordinate is replaced by a noisy damped weighted average of the others. The…

We introduce the notion of a random relaxed asymptotic contraction in the setting of random normed modules. The contraction condition employs two quasi-metrics that are built directly from the random operator: a lower quasi-metric which…

We start with a rather detailed, general discussion of recent results of the replica approach to statistical mechanics of a single classical particle placed in a random $N (\gg 1)$-dimensional Gaussian landscape and confined by a…

We prove necessary and sufficient conditions for the $L^p$-convergence, $p>1$, of the Biggins martingale with complex parameter in the supercritical branching random walk. The results and their proofs are much more involved (especially in…

This paper deals with the stability analysis of a mass-spring system subject to friction using Lyapunov-based arguments. As the described system presents a stick-slip phenomenon, the mass may then periodically sticks to the ground. The…

For the iterations of $x\mapsto |x-\theta|$ random functions with Lipschitz number one, we represent the dynamics as a Markov chain and prove its convergence under mild conditions. We also demonstrate that the Wasserstein metric of any two…

We consider continuous--time Markov kinetics with a finite number of states and a given positive equilibrium distribution P*. For an arbitrary probability distribution $P$ we study the possible right hand sides, dP/dt, of the Kolmogorov…

Many sequential decision problems can be formulated as Markov Decision Processes (MDPs) where the optimal value function (or cost-to-go function) can be shown to satisfy a monotone structure in some or all of its dimensions. When the state…

We study density thresholds that force a measurable set $E\subseteq\mathbb{R}^d$ to contain all sufficiently large similar copies of every $n$-point configuration. We prove a lower bound of the form $1-O((\log n)/n)$, which matches the…

We develop a unified approach to defining a point at infinity for an arbitrary space and formalizing convergence to this point. Central to our work is a method to quantify and classify the rates at which functions approach their limits at…

Adaptive Monte Carlo methods can be viewed as implementations of Markov chains with infinite memory. We derive a general condition for the convergence of a Monte Carlo method whose history dependence is contained within the simulated…

We consider zero-range processes in ${\mathbb{Z}}^d$ with site dependent jump rates. The rate for a particle jump from site $x$ to $y$ in ${\mathbb{Z}}^d$ is given by $\lambda_xg(k)p(y-x)$, where $p(\cdot)$ is a probability in…

For a Markov semigroup $P_t$ with invariant probability measure $\mu$, a constant $\ll>0$ is called a lower bound of the ultra-exponential convergence rate of $P_t$ to $\mu$, if there exists a constant $C\in (0,\infty)$ such that $$…