English
Related papers

Related papers: Convergence in the $p$-contest

200 papers

For Markov processes with absorption, we provide general criteria ensuring the existence and the exponential non-uniform convergence in total variation norm to a quasi-stationary distribution. We also characterize a subset of its domain of…

Probability · Mathematics 2022-10-24 Nicolas Champagnat , Denis Villemonais

We consider the classical problem of making mobile processes gather or converge at a same position (as performed by swarms of animals in Nature). Existing works assume that each process can see all other processes, or all processes within a…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-06-17 Rachid Guerraoui , Alexandre Maurer

We consider time-inhomogeneous ODEs whose parameters are governed by an underlying ergodic Markov process. When this underlying process is accelerated by a factor $\varepsilon^{-1}$, an averaging phenomenon occurs and the solution of the…

Probability · Mathematics 2025-08-13 Pierre Monmarché , Edouard Strickler

In the analysis of Markov chains and processes, it is sometimes convenient to replace an unbounded state space with a "truncated" bounded state space. When such a replacement is made, one often wants to know whether the equilibrium behavior…

Probability · Mathematics 2022-03-30 Alex Infanger , Peter W. Glynn , Yuanyuan Liu

In this paper, we consider convergence properties of a second order Markov chain. Similar to a column stochastic matrix is associated to a Markov chain, a so called {\em transition probability tensor} $P$ of order 3 and dimension $n$ is…

Numerical Analysis · Mathematics 2013-07-29 Shenglong Hu , Liqun Qi

Motivated by recent applications of the Lyapunov's method in artificial neural networks, which could be considered as dynamical systems for which the convergence of the system trajectories to equilibrium states is a necessity. We re-look at…

Classical Analysis and ODEs · Mathematics 2007-05-23 Raveen Goundar , Jito Vanualailai

We construct birth-and-death Markov evolution of states(distributions) of point particle systems in $\mathbb{R}^d$. In this evolution, particles reproduce themselves at distant points (disperse) and die under the influence of each other…

Mathematical Physics · Physics 2012-04-09 Dmitri Finkelshtein , Yuri Kondratiev , Yuri Kozitsky , Oleksandr Kutoviy

We study the convergence of random function iterations for finding an invariant measure of the corresponding Markov operator. We call the problem of finding such an invariant measure the stochastic fixed point problem. This generalizes…

Optimization and Control · Mathematics 2024-04-16 Neal Hermer , D. Russell Luke , Anja Sturm

We study properties of a $p-$type subcritical branching process in random environment initiated at moment zero by a vector $\mathbf{z}=\left( z_{1},..,z_{p}\right) $\ of particles of different types. Assuming that the process belongs to the…

Probability · Mathematics 2020-07-07 Vladimir Vatutin , Elena Dyakonova

A Markov evolution of a system of point particles in $\mathbb{R}^d$ is described at micro-and mesoscopic levels. The particles reproduce themselves at distant points (dispersal) and die, independently and under the influence of each other…

Mathematical Physics · Physics 2015-06-11 Dmitri Finkelshtein , Yuri Kondratiev , Yuri Kozitsky , Oleksandr Kutoviy

Our main result is to prove almost-sure convergence of a stochastic-approximation algorithm defined on the space of measures on a non-compact space. Our motivation is to apply this result to measure-valued P\'olya processes (MVPPs, also…

Probability · Mathematics 2020-01-22 Cécile Mailler , Denis Villemonais

We establish sufficient conditions for exponential convergence to a unique quasi-stationary distribution in the total variation norm. These conditions also ensure the existence and exponential ergodicity of the Q-process, the process…

Probability · Mathematics 2023-08-01 Aurélien Velleret

We consider stationary configurations of points in Euclidean space which are marked by positive random variables called scores. The scores are allowed to depend on the relative positions of other points and outside sources of randomness.…

Probability · Mathematics 2025-06-25 Bojan Basrak , Ilya Molchanov , Hrvoje Planinić

We consider the dynamics of the disordered, one-dimensional, symmetric zero range process in which a particle from an occupied site $k$ hops to its nearest neighbour with a quenched rate $w(k)$. These rates are chosen randomly from the…

Statistical Mechanics · Physics 2009-11-07 Mustansir Barma , Kavita Jain

An infinite system of point particles placed in $\mathds{R}^d$ is studied. The particles are of two types; they perform random walks in the course of which those of distinct types repel each other. The interaction of this kind induces an…

Probability · Mathematics 2022-07-18 Yuri Kozitsky , Michael Röckner

In this work, a convergence lemma for function $f$ being finite compositions of analytic mappings and the maximum operator is proved. The lemma shows that the set of $\delta$-stationary points near an isolated local minimum point $x^*$ is…

Computer Science and Game Theory · Computer Science 2022-08-12 Xiaotie Deng , Hanyu Li , Ningyuan Li

We consider Markov decision processes with synchronizing objectives, which require that a probability mass of $1-\epsilon$ accumulates in a designated set of target states, either once, always, infinitely often, or always from some point…

Logic in Computer Science · Computer Science 2022-04-28 Laurent Doyen , Marie van den Bogaard

Three similar convergence notions are considered. Two of them are the long established notions of convergent dynamics and incremental stability. The other is the more recent notion of contraction analysis. All three convergence notions…

Optimization and Control · Mathematics 2018-11-06 Duc N. Tran , Björn S. Rüffer , Christopher M. Kellett

In many branches of engineering, Banach contraction mapping theorem is employed to establish the convergence of certain deterministic algorithms. Randomized versions of these algorithms have been developed that have proved useful in…

Probability · Mathematics 2023-09-25 Abhishek Gupta , Rahul Jain , Peter Glynn

We consider the problem of computing the q->p norm of a matrix A, which is defined for p,q \ge 1, as |A|_{q->p} = max_{x !=0 } |Ax|_p / |x|_q. This is in general a non-convex optimization problem, and is a natural generalization of the…

Data Structures and Algorithms · Computer Science 2010-05-04 Aditya Bhaskara , Aravindan Vijayaraghavan
‹ Prev 1 4 5 6 7 8 10 Next ›