We consider a Markov chain of point processes such that each state is a super position of an independent cluster process with the previous state as its centre process together with some independent noise process. The model extends earlier work by Felsenstein and Shimatani describing a reproducing population. We discuss when closed term expressions of the first and second order moments are available for a given state. In a special case it is known that the pair correlation function for these type of point processes converges as the Markov chain progresses, but it has not been shown whether the Markov chain has an equilibrium distribution with this, particular, pair correlation function and how it may be constructed. Assuming the same reproducing system, we construct an equilibrium distribution by a coupling argument.
[(vii)] In particular, @cite_8 considered the case @math and when @math or equivalently when the intensities @math are invariant over generations, and then he showed that as @math , the PCF for @math diverges and all offspring will eventually have the same ancestor''. It follows from item (iii) that the model is equivalent to a replicated Neyman-Scott process; this becomes a replicated Thomas process when each cluster size is Poisson distributed, and hence the result in @cite_8 agrees with the results in @cite_13 and @cite_15 . Note that @cite_8 implicitly assumed that a cluster can have more than one point. Otherwise the PCF of @math becomes equal to 1; we discuss this rather trivial case again in and ; see also Section 3 in @cite_15 .
@cite_15 @cite_13 @cite_8
2040948450 2026924428 2545825365 2898008966
Malecot's models of isolation by distance seem to assume random distribution in space, Poisson distribution of offspring number, and independent migration of individuals. These assumptions are inconsistent. By calculating the probability of joint occupancy of two locations at a distance x, it is shown that a haploid model embodying the latter two assumptions violates the first, forming larger and larger clumps of individuals separated by greater and greater distances. Thus the model is biologically irrelevant, even though it is possible to use it to calculate probabilities of genetic identity at different distances. The formation of these clumps is verified by computer simulation. The same phenomenon occurs in two- and three-dimensional models. In models of finite regions (a circle or a torus), the formation of clumps takes the form of the certainty of ultimate local extinction of the organism in each region. This does not occur if we hold the number of individuals on the circle or torus constant, but con... where (an)n ENo is some sequence of nonnegative numbers, (Sn),nENo is the sequence of partial sums, S0 = 0, Sn = XflXk, of another sequence (Xk)kEN of i.i.d. random variables, and A c R is a fixed Borel set such as [0,1] or [0, oo). Examples of such convolution series are subordinated distributions (f=0Oan = 1) which arise as distributions of random sums, and harmonic and ordinary renewal measures (a0 = 0, an = 1 n for all n C N in the first, an = 1 for all n C NO in the second case). These examples are in turn essential for the analysis of the large time behaviour of diverse applied models such as branching and queueing processes, they are also of interest in connection with representation theorems such as the Levy representation of infinitely divisible distributions. A traditional approach to such problems is via regular variation: If the underlying random variables are nonnegative we can use Laplace transforms and the related Abelian and Tauberian theorems [see, e.g., Stam (1973) in the context of subordination and Feller (1971, XIV.3) in connection with renewal theory; Embrechts, Maejima, and Omey (1984) is a recent treatment of generalized renewal measures along these lines]. The approach of the present paper is based on the Wiener-Levy-Gel'fand theorem and has occasionally been called the Banach algebra method. In Gruibel (1983) we gave a new variant of this method for the special case of lattice distributions, showing that by using the appropriate Banach algebras of sequences, arbitrarily fine expansions are possible under certain assumptions on the higher-order differences of (P(X1 = n))fnEN. Here we give a corresponding treatment of nonlattice distributions. We restrict ourselves to an analogue of first-order differences and obtain a number of theorems which perhaps are described best as next-term results. To explain this let us consider a special case in more detail. Consider a uniform random rooted tree on vertices labelled by @math , with edges directed towards the root. We imagine that each node of the tree has space for a single car to park. A number @math of cars arrive one by one, each at a node chosen independently and uniformly at random. If a car arrives at a space which is already occupied, it follows the unique path oriented towards the root until it encounters an empty space, in which case it parks there; if there is no empty space, it leaves the tree. Consider @math and let @math denote the event that all @math cars find spaces in the tree. Lackner and Panholzer proved (via analytic combinatorics methods) that there is a phase transition in this model. Then if @math , we have @math , whereas if @math we have @math . We give a probabilistic explanation for this phenomenon, and an alternative proof via the objective method. Along the way, we are led to consider the following variant of the problem: take the tree to be the family tree of a Galton-Watson branching process with Poisson(1) offspring distribution, and let an independent Poisson( @math ) number of cars arrive at each vertex. Let @math be the number of cars which visit the root of the tree. Then for @math , we have @math , whereas for @math , we have @math . This discontinuous phase transition turns out to be a generic phenomenon in settings with an arbitrary offspring distribution of mean at least 1 for the tree and arbitrary arrival distribution. The key to our investigation is an improved (and in a sense sharp) understanding of the survival time of the contact process on star graphs. Using these results, we show that for the contact process on Galton-Watson trees, when the offspring distribution (i) is subexponential the critical value for local survival @math and (ii) when it is geometric( @math ) we have @math , where the @math are much smaller than previous estimates. We also study the critical value @math for "prolonged persistence" on graphs with @math vertices generated by the configuration model. In the case of power law and stretched exponential distributions where it is known @math we give estimates on the rate of convergence. Physicists tell us that @math where @math is the maximum eigenvalue of the adjacency matrix. Our results show that this is not correct.