Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Iddo Ben-Ari"'
Autor:
Behrang Forghani, Iddo Ben-Ari
Publikováno v:
Transactions of the American Mathematical Society. 373:2207-2227
A discrete-time Markov chain can be transformed into a new Markov chain by looking at its states along iterations of an almost surely finite stopping time. By the optional stopping theorem, any bounded harmonic function with respect to the transition
Autor:
Iddo Ben-Ari, Rinaldo B. Schinazi
We consider a model for which every site of $\mathbb{N}$ is assigned a fitness in $[0,1]$. At every discrete time all the sites are updated and each site samples a uniform on $[0,1]$, independently of everything else. At every discrete time and indep
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::988ac48aa89d3445ad4963ff22fce8a2
http://arxiv.org/abs/2101.00705
http://arxiv.org/abs/2101.00705
We consider the discrete-time voter model on complete bipartite graphs and study the quasi-stationary distribution (QSD) for the model as the size of one of the partitions tends to infinity while the other partition remains fixed. We show that the QS
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::82f78c1bb06ceab8676a332f2ecc51c3
Autor:
Roger W. C. Silva, Iddo Ben-Ari
Publikováno v:
Journal of Statistical Physics. 173:362-380
A major difficulty in studying the Bak–Sneppen model is in effectively comparing it with well-understood models. This stems from the use of two geometries: complete graph geometry to locate the global fitness minimizer, and graph geometry to replac
The Central Limit Theorem (CLT) for additive functionals of Markov chains is a well known result with a long history. In this paper we present applications to two finite-memory versions of the Elephant Random Walk, solving a problem from arXiv:1812.0
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2ef10378b72d9c2e6667e1d46cd69be0
Autor:
Hugo Panzo, Iddo Ben-Ari
We study a model of continuous-time nearest-neighbor random walk on $\mathbb{Z}^d$ penalized by its occupation time at the origin, also known as a homopolymer. For a fixed real parameter $\beta$ and time $t>0$, we consider the probability measure on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f7541fcb25a64c7e25a4944ae59c1ed
http://arxiv.org/abs/1803.09335
http://arxiv.org/abs/1803.09335
Autor:
Iddo Ben-Ari, Rinaldo B. Schinazi
Publikováno v:
Journal of Statistical Physics. 162:415-425
We introduce a discrete time model for a virus-like evolving population with high mutation probability. Different genomes correspond to different points (or sites) in the interval [0, 1]. Each site has one or more individual on it (corresponding to t
Publikováno v:
Electron. J. Probab.
Random population dynamics with catastrophes (events pertaining to possible elimination of a large portion of the population) has a long history in the mathematical literature. In this paper we study an ergodic model for random population dynamics wi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2441727ae5b4cdd02b31a769c632099b
Autor:
Keith Conrad, Iddo Ben-Ari
Publikováno v:
Mathematics Magazine. 87:14-24
SummaryMaclaurin's inequality is a natural, but nontrivial, generalization of the arithmetic-geometric mean inequality. We present a new proof that is based on an analogous generalization of Bernoulli's inequality. Applications of Maclaurin's inequal
Autor:
Michael Neumann, Iddo Ben-Ari
Publikováno v:
Linear and Multilinear Algebra. 60:39-63
A probabilistic approach to the study of the Perron root of irreducible nonnegative matrices is presented. Our two main results are a probabilistic representation for the generalized inverse of the generator of a continuous-time finite-state Markov c