A self-regulating and patch subdivided population

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

16 pages, fixed some minor misprints in the proof of Theorem 3.2

Scientific paper

We consider an interacting particle process on a graph which, from a macroscopic point of view, looks like $\Z^d$ and, at a microscopic level, is a complete graph of degree $N$ (called a patch). There are two birth rates: an inter-patch one $\lambda$ and an intra-patch one $\phi$. Once a site is occupied, there is no breeding from outside the patch and the probability $c(i)$ of success of an intra-patch breeding decreases with the size $i$ of the population in the site. We prove the existence of a critical value $\lambda_{cr}(\phi, c, N)$ and a critical value $\phi_{cr}(\lambda, c, N)$. We consider a sequence of processes generated by the families of control functions $\{c_i\}_{i \in \N}$ and degrees $\{N_i\}_{i \in \N}$; we prove, under mild assumptions, the existence of a critical value $i_{cr}$. Roughly speaking we show that, in the limit, these processes behave as the branching random walk on $\Z^d$ with external birth rate $\lambda$ and internal birth rate $\phi$. Some examples of models that can be seen as particular cases are given.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A self-regulating and patch subdivided population does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A self-regulating and patch subdivided population, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A self-regulating and patch subdivided population will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-245737

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.