IBIddo Ben-Ari

Iddo Ben-Ari

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Iddo Ben-Ari has a total of 37 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    On quasi-stationary distributions for stochastic rumor models

    by Iddo Ben-Ari, Elcio Lebensztayn, Lucas Sousa Santos

    This paper examines the quasi-stationary behavior of stochastic rumor processes. Using the results by van Doorn and Pollett (2008), we first prove that the continuous-time Maki--Thompson model has a unique quasi-stationary distribution (QSD) given by the point mass at the state \((0, 1)\). To obtain a non-trivial QSD, we modify the absorption set by conditioning the process on not returning to the level \(y=1\) after leaving the initial state \((N, 1)\). For this modified model, we establish the existence and uniqueness of a non-trivial QSD that assigns positive probability to all transient states, and then derive an explicit formula for this QSD in terms of paths and transition rates. We also discuss the ratio of expectations distribution as an alternative approach to describe the long-term behavior before absorption. The analysis is further extended to the Daley--Kendall rumor model and the stochastic SIR epidemic model.

  • Open Access

    Quasistationary Distribution for The Invasion Model on a Complete Bipartite Graph

    by Clayton Allard, Iddo Ben-Ari, Shrikant Chand, Van Hovenga, Edith Lee, Julia Shapiro

    The Invasion Model on the complete bipartite graph was introduced and studied by physicists as a rudimentary model for opinion dynamics on complex networks. Our main result provides the limit of the Quasistationary Distribution (QSD) for the model as one partition size tends to infinity. This limit is a highly dispersed measure. The results are in stark contrast to the Voter Model whose QSD is essentially a perturbation to absorbing states. A distinct feature not present in the Voter Model and demanding a new approach developed here is the appearance of two time scales with a non-trivial interaction. Our analysis is based on decoupling of the scales and using a Stein-type operator to identify a limit distribution. It also involves an application of a known duality with coalescing Markov chains through which asymptotic survival rates associated with the QSD are obtained.

  • Open Access

    Can a single migrant per generation rescue a dying population?

    by Iddo Ben-Ari, Rinaldo B. Schinazi

    We introduce a population model to test the hypothesis that even a single migrant per generation may rescue a dying population. Let $(c_k)$ be a sequence of real numbers in $(0,1)$. Let $X_n$ be a size of the population at time $n\geq 0$. Then, $X_{n+1}=X_n - Y_{n+1}+1$, where the conditional distribution of $Y_{n+1}$ given $X_n=k$ is a binomial random variable with parameters $(k ,c(k))$. We assume that $\lim_{k\to\infty}kc(k)=ρ$ exists. If $ρ1$ the process is positive recurrent. In the critical case $ρ=1$ the process is recurrent or transient according to how $k c(k)$ converges to $1$. When $ρ=0$ and under some regularity conditions, the support of the increments is eventually finite.

  • Open Access

    Quasistationary Distribution for the Invasion Model on a Complete Bipartite Graph

    by Iddo Ben-Ari, Clayton Allard, Shrikant Chand, Van Hovenga, Edith Lee, Julia Shapiro

    The Invasion Model on the complete bibartitle graph was introduced and studied by physicists as a rudimentary model for opinion dynamics on complex networks. We identify the limit of the Quasistationary distribution for the model as one partition size tends to infinity. The limit is a highly dispersed measure. A distinctive feature of the model is that of two time scales with non-trivial interaction. The work and the results complement and are in sharp contrast to the analogous results on the closely related Voter Model.

  • Open Access

    Quasi-Stationary Distributions for the Voter Model on Complete Bipartite Graphs

    by Iddo Ben-Ari, Hugo Panzo, Philip Speegle, R. Oliver VandenBerg

    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 QSDs converge weakly to a nontrivial limit which features a consensus with the exception of a random number of dissenting vertices in the "large" partition. Moreover, we explicitly calculate the law of the number of dissenters and show that it follows the heavy-tailed Sibuya distribution with parameter depending on the size of the "small" partition. Our results rely on a discrete-time analogue of the well-known duality between the continuous-time voter model and coalescing random walks which we develop in the paper.

  • Open Access

    Quasi-Limiting Behavior of Drifted Brownian Motion

    by SangJoon Lee, Iddo Ben-Ari

    A Quasi-Stationary Distribution (QSD)for a Markov process with an almost surely hit absorbing state is a time-invariant initial distribution for the process conditioned on not being absorbed by any given time. An initial distribution for the process is in the domain of attraction of some QSD $\nu$ if the distribution of the process a time $t$, conditioned not to be absorbed by time $t$ converges to $\nu$. In this work study mostly Brownian motion with constant drift on the half line $[0,\infty)$ absorbed at $0$. Previous work by Martinez et al. identifies all QSDs and provides a nearly complete characterization for their domain of attraction. Specifically, it was shown that if the distribution a well-defined exponential tail (including the case of lighter than any exponential tail), then it is in the domain of attraction of a QSD determined by the exponent. In this work we 1. Obtain a new approach to existing results, explaining the direct relation between a QSD and an initial distribution in its domain of attraction. 2. Study the behavior under a wide class of initial distributions whose tail is heavier than exponential, and obtain no-trivial limits under appropriate scaling.

  • Open Access

    Power-Law Tails in a Fitness-Driven Model for Biological Evolution

    by Iddo Ben-Ari, Carter Bedsole, Grace O'Neil

    We study a discrete-time stochastic process that can also be interpreted as a model for a viral evolution. A distinguishing feature of our process is power-law tails due to dynamics that resembles preferential attachment models. In the model we study, a population is partitioned into sites, with each site labeled by a uniquely-assigned real number in the interval $[0,1]$ known as fitness. The population size is a discrete-time transient birth-and-death process with probability $p$ of birth and $1-p$ of death. The fitness is assigned at birth according to the following rule: the new member of the population either "mutates" with probability $r$, creating a new site uniformly distributed on $[0,1]$ or "inherits" with probability $1-r$, joining an existing site with probability proportional to the site's size. At each death event, a member from the site with the lowest fitness is killed. The number of sites eventually tends to infinity if and only if $pr>1-p$. Under this assumption, we show that as time tends to infinity, the joint empirical measure of site size and fitness (proportion of population in sites of size and fitness in given ranges) converges a.s. to the product of a modified Yule distribution and the uniform distribution on $[(1-p)/(pr),1]$. Our approach is based on the method developed in \cite{similar-but-different}. The model and the results were independently obtained by Roy and Tanemura in [RT].

  • Open Access

    Finite-Memory Elephant Random Walk and the Central Limit Theorem for Additive Functionals

    by Iddo Ben-Ari, Jonah Green, Taylor Meredith, Hugo Panzo, Xiaoran Tan

    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.01915. We also present a derivation of the CLT for additive functionals of finite state Markov chains, which is based on positive recurrence, the CLT for IID sequences and some elementary linear algebra, and which focuses on characterization of the variance.