4,058 research outputs found

    Perfect simulation for interacting point processes, loss networks and Ising models

    Get PDF
    We present a perfect simulation algorithm for measures that are absolutely continuous with respect to some Poisson process and can be obtained as invariant measures of birth-and-death processes. Examples include area- and perimeter-interacting point processes (with stochastic grains), invariant measures of loss networks, and the Ising contour and random cluster models. The algorithm does not involve couplings of the process with different initial conditions and it is not tied up to monotonicity requirements. Furthermore, it directly provides perfect samples of finite windows of the infinite-volume measure, subjected to time and space ``user-impatience bias''. The algorithm is based on a two-step procedure: (i) a perfect-simulation scheme for a (finite and random) relevant portion of a (space-time) marked Poisson processes (free birth-and-death process, free loss networks), and (ii) a ``cleaning'' algorithm that trims out this process according to the interaction rules of the target process. The first step involves the perfect generation of ``ancestors'' of a given object, that is of predecessors that may have an influence on the birth-rate under the target process. The second step, and hence the whole procedure, is feasible if these ``ancestors'' form a finite set with probability one. We present a sufficiency criteria for this condition, based on the absence of infinite clusters for an associated (backwards) oriented percolation model.Comment: Revised version after referee of SPA: 39 page

    Spatial birth-and-death processes in random environment

    Full text link
    We consider birth-and-death processes of objects (animals) defined in Zd{\bf Z}^d having unit death rates and random birth rates. For animals with uniformly bounded diameter we establish conditions on the rate distribution under which the following holds for almost all realizations of the birth rates: (i) the process is ergodic with at worst power-law time mixing; (ii) the unique invariant measure has exponential decay of (spatial) correlations; (iii) there exists a perfect-simulation algorithm for the invariant measure. The results are obtained by first dominating the process by a backwards oriented percolation model, and then using a multiscale analysis due to Klein to establish conditions for the absence of percolation.Comment: 48 page

    Loss network representation of Peierls contours

    Get PDF
    We present a probabilistic approach for the study of systems with exclusions, in the regime traditionally studied via cluster-expansion methods. In this paper we focus on its application for the gases of Peierls contours found in the study of the Ising model at low temperatures, but most of the results are general. We realize the equilibrium measure as the invariant measure of a loss-network process whose existence is ensured by a subcriticality condition of a dominant branching process. In this regime, the approach yields, besides existence and uniqueness of the measure, properties such as exponential space convergence and mixing, and a central limit theorem. The loss network converges exponentially fast to the equilibrium measure, without metastable traps. This convergence is faster at low temperatures, where it leads to the proof of an asymptotic Poisson distribution of contours. Our results on the mixing properties of the measure are comparable to those obtained with ``duplicated-variables expansion'', used to treat systems with disorder and coupled map lattices. It works in a larger region of validity than usual cluster-expansion formalisms, and it is not tied to the analyticity of the pressure. In fact, it does not lead to any kind of expansion for the latter, and the properties of the equilibrium measure are obtained without resorting to combinatorial or complex analysis techniques.Comment: 42 pages. Revised version after the first referee repor
    • …
    corecore