169 citations · 527 across the 30 of their papers we have counts for
32 papers
Selection principles for quasi-stationary distributions and reinforcement processes
Michel Benaïm, Tresnia Berah, Pierre Germain
Let be a sub-Markov matrix on a finite set , representing the transition probabilities of a Markov chain on \(S\) absorbed at a cemetery point . We conside…
Sufficient condition for dispersal-induced growth on dynamic networks
Michel Benaïm, Claude Lobry, Tewfik Sari +1
We consider a population spreading across a finite number of sites. Individuals can move from one site to the other according to a network (oriented links between the sites) that v…
Regularity of invariant densities for random switching between two linear odes in Rd
Michel Benaim, Améthyste Bichard
In a paper entitled singularities of invariant densities for random switching between two linear odes in 2D, Bakhtin et al [5], consider a Markov process obtained by random switchi…
The asymptotic behavior of fraudulent algorithms
Michel Benaïm, Laurent Miclo
Let be a Morse function on a compact connected -dimensional Riemannian manifold, satisfying and let be the s…
On invariant distributions of Feller Markov chains with applications to dynamical systems with random switching
Michel Benaïm, Oliver Tough
We introduce simple conditions ensuring that invariant distributions of a Feller Markov chain on a compact Riemannian manifold are absolutely continuous with a lower semi-continuou…
Regularity of the stationary density for systems with fast random switching
Michel Benaïm, Oliver Tough
We consider the piecewise-deterministic Markov process obtained by randomly switching between the flows generated by a finite set of smooth vector fields on a compact set. We obtai…
Transcritical bifurcation for the conditional distribution of a diffusion process
Michel Benaïm, Nicolas Champagnat, William Oçafrain +1
In this article, we describe a simple class of models of absorbed diffusion processes with parameter, whose conditional law exhibits a transcritical bifurcation. Our proofs are bas…
Untangling the role of temporal and spatial variations in persistance of populations
Michel Benaïm, Claude Lobry, Tewfik Sari +1
We consider a population distributed between two habitats, in each of which it experiences a growth rate that switches periodically between two values, or $ -…
Degenerate processes killed at the boundary of a domain
Michel Benaïm, Nicolas Champagnat, William Oçafrain +1
We investigate certain properties of degenerate Feller processes that are killed when exiting a relatively compact set. Our main result provides general conditions ensuring that su…
Stochastic persistence in degenerate stochastic Lotka-Volterra food chains
Michel Benaïm, Antoine Bourquin, Dang H. Nguyen
We consider a Lotka-Volterra food chain model with possibly intra-specific competition in a stochastic environment represented by stochastic differential equations. In the non-dege…
Stochastic Persistence
Michel Benaim
Let be a continuous time Markov process on some metric space leaving invariant a closed subset called the {\em extinction set}. We give gen…
Convergence analysis of Adaptive Biasing Potential methods for diffusion processes
Michel Benaïm, Charles-Edouard Bréhier
This article is concerned with the mathematical analysis of a family of adaptive importance sampling algorithms applied to diffusion processes. These methods, referred to as Adapti…
Random Switching between Vector Fields Having a Common Zero
Michel Benaïm, Edouard Strickler
Let be a finite set, a family of vector fields on leaving positively invariant a compact set and having a common zero We consi…
On strict convergence of stochastic gradients
Michel Benaim
We discuss conditions ensuring the (strict) convergence of stochastic gradient algorithms.
Supports of Invariant Measures for Piecewise Deterministic Markov Processes
Michel Benaïm, Fritz Colonius, Lettau Ralph
For a class of piecewise deterministic Markov processes, the supports of the invariant measures are characterized. This is based on the analysis of controllability properties of an…
Ergodicity of inhomogeneous Markov chains through asymptotic pseudotrajectories
Michel Benaïm, Florian Bouguet, Bertrand Cloez
In this work, we consider an inhomogeneous (discrete time) Markov chain and are interested in its long time behavior. We provide sufficient conditions to ensure that some of its as…
Self-repelling diffusions on a Riemannian manifold
Michel Benaïm, Carl-Erik Gauthier
Let M be a compact connected oriented Riemannian manifold. The purpose of this paper is to investigate the long time behavior of a degenerate stochastic differential equation on th…
Smale Strategies for Network Prisoner's Dilemma Games
Kashi Behrstock, Michel Benaïm, Morris W. Hirsch
Smale's approach \cite{Smale80} to the classical two-players repeated Prisoner's Dilemma game is revisited here for -players and Network games in the framework of Blackwell's ap…
Lotka Volterra in fluctuating environment or "how switching between beneficial environments can make survival harder"
Michel Benaïm, Claude Lobry
We consider two dimensional Lotka-Volterra systems in fluctuating environment. Relying on recent results on stochastic persistence and piecewise deterministic Markov processes, we…
Self-repelling diffusions via an infinite dimensional approach
Michel Benaim, Ioana Ciotir, Carl-Erik Gauthier
In the present work we study self-interacting diffusions following an infinite dimensional approach. First we prove existence and uniqueness of a solution with Markov property. The…
A stochastic approximation approach to quasi-stationary distributions on finite spaces
Michel Benaïm, Bertrand Cloez
This work is concerned with the analysis of a stochastic approximation algorithm for the simulation of quasi-stationary distributions on finite state spaces. This is a generalizati…
A generalized Pólya's Urn with graph based interactions: convergence at linearity
Jun Chen, Cyrille Lucas
We consider a special case of the generalized Pólya's urn model introduced by Benaim et al (2013). Given a finite connected graph , place a bin at each vertex. Two bins are call…
A generalized Polya's urn with graph based interactions
Michel Benaim, Itai Benjamini, Jun Chen +1
Given a finite connected graph G, place a bin at each vertex. Two bins are called a pair if they share an edge of G. At discrete times, a ball is added to each pair of bins. In a p…
Strongly Vertex-Reinforced-Random-Walk on the complete graph
Michel Benaïm, Olivier Raimond, Bruno Schapira
We study Vertex-Reinforced-Random-Walk on the complete graph with weights of the form , with . Unlike for the Edge-Reinforced-Random-Walk, which in this case localiz…