English
Related papers

Related papers: A phase transition for a spatial host-parasite mod…

200 papers

Spatial evolution is investigated in a simulated system of nine competing and mutating bacterium strains, which mimics the biochemical war among bacteria capable of producing two different bacteriocins (toxins) at most. Random sequential…

Statistical Mechanics · Physics 2009-10-31 Gyorgy Szabo , Tamas Czaran

We analyze the Susceptible-Infected-Recovered-Susceptible (SIRS) process, a continuous-time Markov chain frequently employed in epidemiology to model the spread of infections on networks. In this framework, infections spread as infected…

Probability · Mathematics 2025-08-21 Phuc Lam , Oanh Nguyen , Iris Yang

We are interested in modeling some two-level population dynamics, resulting from the interplay of ecological interactions and phenotypic variation of individuals (or hosts) and the evolution of cells (or parasites) of two types living in…

Probability · Mathematics 2011-01-21 Sylvie Méléard , Sylvie Roelly

We study a discrete time self interacting random process on graphs, which we call Greedy Random Walk. The walker is located initially at some vertex. As time evolves, each vertex maintains the set of adjacent edges touching it that have not…

Probability · Mathematics 2019-02-20 Tal Orenshtein , Igor Shinkar

We study degree-penalized contact processes on Galton-Watson trees (GW) and the configuration model. The model we consider is a modification of the usual contact process on a graph. In particular, each vertex can be either infected or…

Probability · Mathematics 2026-01-21 Zsolt Bartha , Júlia Komjáthy , Daniel Valesin

Consider the following stochastic model for immune response. Each pathogen gives birth to a new pathogen at rate $\lambda$. When a new pathogen is born, it has the same type as its parent with probability $1 - r$. With probability $r$, a…

Probability · Mathematics 2007-05-23 Thomas M. Liggett , Rinaldo B. Schinazi , Jason Schweinsberg

We study the contact process on a class of evolving scale-free networks, where each node updates its connections at independent random times. We give a rigorous mathematical proof that there is a transition between a phase where for all…

Probability · Mathematics 2015-12-03 Emmanuel Jacob , Peter Mörters

We study the spreading of two mutually cooperative diseases on different network topologies, and with two microscopic realizations, both of which are stochastic versions of an SIR type model studied by us recently in mean field…

Physics and Society · Physics 2016-05-04 Peter Grassberger , Li Chen , Fakhteh Ghanbarnejad , Weiran Cai

We consider the interacting particle system on the homogeneous tree of degree $(d + 1)$, known as frog model. In this model, active particles perform independent random walks, awakening all sleeping particles they encounter, and dying after…

Probability · Mathematics 2019-12-09 Elcio Lebensztayn , Jaime Utria

Migration between different habitats is ubiquitous among biological populations. In this Letter, we study a simple quasispecies model for evolution in two different habitats, with different fitness landscapes, coupled through one-way…

Populations and Evolution · Quantitative Biology 2010-12-23 Bartlomiej Waclaw , Rosalind J. Allen , Martin R. Evans

We study random graphs with latent geometric structure, where the probability of each edge depends on the underlying random positions corresponding to the two endpoints. We focus on the setting where this conditional probability is a…

Probability · Mathematics 2021-11-01 Suqi Liu , Miklos Z. Racz

We study how the recurrence and transience of space-time sets for a branching random walk on a graph depends on the offspring distribution. Here, we say that a space-time set $A$ is recurrent if it is visited infinitely often almost surely…

Probability · Mathematics 2020-11-13 Tom Hutchcroft

Coalescing-branching random walks, or {\em cobra walks} for short, are a natural variant of random walks on graphs that can model the spread of disease through contacts or the spread of information in networks. In a $k$-cobra walk, at each…

Data Structures and Algorithms · Computer Science 2016-03-22 Michael Mitzenmacher , Rajmohan Rajaraman , Scott Roche

Sood and Grassberger studied in [Phys. Rev. Lett. 99, 098701 (2007)] random walks on random graphs that are biased towards a fixed target point. They put forward a critical bias strength b_c such that a random walker on an infinite graph…

Statistical Mechanics · Physics 2009-11-13 O. Benichou , R. Voituriez

We study the spreading of families in two-dimensional multispecies predator-prey systems, in which species cyclically dominate each other. In each time step randomly chosen individuals invade one of the nearest sites of the square lattice…

Populations and Evolution · Quantitative Biology 2009-11-10 Maria Ravasz , Gyorgy Szabo , Attila Szolnoki

This paper considers a class of non-Markovian discrete-time random processes on a finite state space {1,...,d}. The transition probabilities at each time are influenced by the number of times each state has been visited and by a fixed a…

Probability · Mathematics 2007-05-23 Robin Pemantle

We study a continuous-time nearest-neighbor branching random walk on the $d$-dimensional $b$-ary hypercube $\{0,1,\dots,b-1\}^d$ as a model for viral quasispecies evolution under mutation and replication. Motivated by mutagenic antiviral…

Probability · Mathematics 2026-03-31 Jose Blanchet , Zhenyuan Zhang

We propose a hybrid dynamical system approach to model the evolution of a pathogen that experiences different selective pressures according to a stochastic process. In every environment, the evolution of the pathogen is described by a…

Classical Analysis and ODEs · Mathematics 2019-03-25 Jozsef Z. Farkas , Peter Hinow , Jan Engelstädter

We use a multitype continuous time Markov branching process model to describe the dynamics of the spread of parasites of two types that can mutate into each other in a common host population. Instead of using a single virulence…

Probability · Mathematics 2011-09-02 Konstantin Borovkov , Robert Day , Timothy Rice

We study the discrete-time threshold-$\theta \geq 2$ contact process on random graphs of general degrees. For random graphs with a given degree distribution $\mu$, we show that if $\mu$ is lower bounded by $\theta+2$ and has finite $k$th…

Probability · Mathematics 2019-07-12 Danny Nam
‹ Prev 1 3 4 5 6 7 10 Next ›