scholarly journals An infinite particle system with additive interactions

1979 ◽  
Vol 11 (2) ◽  
pp. 355-383 ◽  
Author(s):  
Richard Durrett
Keyword(s):  
Necessary Conditions ◽  
Particle System ◽  
Particle Systems ◽  
Compact Set ◽  
Translation Invariant ◽  
Limiting Behavior ◽  
Branching Random Walks ◽  
Sufficient And Necessary Conditions ◽  
Infinite Particle ◽  
Number Of Particles

The models under consideration are a class of infinite particle systems which can be written as a superposition of branching random walks. This paper gives some results about the limiting behavior of the number of particles in a compact set as t → ∞ and also gives both sufficient and necessary conditions for the existence of a non-trivial translation-invariant stationary distribution.

scholarly journals An infinite particle system with additive interactions

1979 ◽  
Vol 11 (02) ◽  
pp. 355-383 ◽  
Author(s):  
Richard Durrett
Keyword(s):  
Necessary Conditions ◽  
Particle System ◽  
Particle Systems ◽  
Compact Set ◽  
Translation Invariant ◽  
Limiting Behavior ◽  
Branching Random Walks ◽  
Sufficient And Necessary Conditions ◽  
Infinite Particle ◽  
Number Of Particles

The models under consideration are a class of infinite particle systems which can be written as a superposition of branching random walks. This paper gives some results about the limiting behavior of the number of particles in a compact set ast→ ∞ and also gives both sufficient and necessary conditions for the existence of a non-trivial translation-invariant stationary distribution.

Explicit sufficient invariants for an interacting particle system

1998 ◽  
Vol 35 (3) ◽  
pp. 633-641 ◽  
Author(s):  
Yoshiaki Itoh ◽  
Colin Mallows ◽  
Larry Shepp
Keyword(s):  
Markov Chain ◽  
Finite Time ◽  
Interacting Particle Systems ◽  
Particle System ◽  
Particle Systems ◽  
The Other ◽  
New Class ◽  
Interacting Particle ◽  
Death State ◽  
Number Of Particles

We introduce a new class of interacting particle systems on a graph G. Suppose initially there are Ni(0) particles at each vertex i of G, and that the particles interact to form a Markov chain: at each instant two particles are chosen at random, and if these are at adjacent vertices of G, one particle jumps to the other particle's vertex, each with probability 1/2. The process N enters a death state after a finite time when all the particles are in some independent subset of the vertices of G, i.e. a set of vertices with no edges between any two of them. The problem is to find the distribution of the death state, ηi = Ni(∞), as a function of Ni(0).We are able to obtain, for some special graphs, the limiting distribution of Ni if the total number of particles N → ∞ in such a way that the fraction, Ni(0)/S = ξi, at each vertex is held fixed as N → ∞. In particular we can obtain the limit law for the graph S2, the two-leaf star which has three vertices and two edges.

An infinite particle system with continual input and random death

1978 ◽  
Vol 10 (04) ◽  
pp. 764-787
Author(s):  
J. N. McDonald ◽  
N. A. Weiss
Keyword(s):  
Markov Chain ◽  
State Space ◽  
Limit Theorems ◽  
Particle System ◽  
Countable State Space ◽  
Infinite Particle System ◽  
Large Numbers ◽  
Countable State ◽  
Infinite Particle ◽  
Number Of Particles

At times n = 0, 1, 2, · · · a Poisson number of particles enter each state of a countable state space. The particles then move independently according to the transition law of a Markov chain, until their death which occurs at a random time. Several limit theorems are then proved for various functionals of this infinite particle system. In particular, laws of large numbers and central limit theorems are proved.

Explicit sufficient invariants for an interacting particle system

1998 ◽  
Vol 35 (03) ◽  
pp. 633-641 ◽  
Author(s):  
Yoshiaki Itoh ◽  
Colin Mallows ◽  
Larry Shepp
Keyword(s):  
Markov Chain ◽  
Finite Time ◽  
Interacting Particle Systems ◽  
Particle System ◽  
Particle Systems ◽  
The Other ◽  
New Class ◽  
Interacting Particle ◽  
Death State ◽  
Number Of Particles

We introduce a new class of interacting particle systems on a graph G. Suppose initially there are N i (0) particles at each vertex i of G, and that the particles interact to form a Markov chain: at each instant two particles are chosen at random, and if these are at adjacent vertices of G, one particle jumps to the other particle's vertex, each with probability 1/2. The process N enters a death state after a finite time when all the particles are in some independent subset of the vertices of G, i.e. a set of vertices with no edges between any two of them. The problem is to find the distribution of the death state, η i = N i (∞), as a function of N i (0). We are able to obtain, for some special graphs, the limiting distribution of N i if the total number of particles N → ∞ in such a way that the fraction, N i (0)/S = ξ i , at each vertex is held fixed as N → ∞. In particular we can obtain the limit law for the graph S 2, the two-leaf star which has three vertices and two edges.

Sur Une Équation Fonctionnelle Et SES Applications: Une Extension Du Théorème De Kesten-Stigum Concernant Des Processus De Branchement

1997 ◽  
Vol 29 (2) ◽  
pp. 353-373 ◽  
Author(s):  
Quansheng Liu
Keyword(s):  
Invariant Measures ◽  
Random Variables ◽  
Particle Systems ◽  
Independent Random Variables ◽  
Probability Measures ◽  
Optimal Conditions ◽  
Branching Random Walks ◽  
Random Integer ◽  
Watson Process ◽  
Infinite Particle

Given a random integer N ≧ 0 and a sequence of random variables Ai ≧ 0, we define a transformation T on the class of probability measures on [0, ∞) by letting Tμ be the distribution of , where {Zi} are independent random variables with distribution μ, which are independent of N and of {Ai} as well. We obtain the optimal conditions for the functional equation μ = Tμ to have a non-trivial solution of finite mean, and we study the existence of moments of the solutions. The work unifies the corresponding theorems of Kesten-Stigum concerning the Galton-Watson process, of Biggins for branching random walks, of Kahane-Peyrière for a model of turbulence of Yaglom made precise by Mandelbrot, and of Durrett-Liggett for the study of invariant measures for certain infinite particle systems.

scholarly journals Asymptotic Optimality of the Triangular Lattice for a Class of Optimal Location Problems

2021 ◽  
Author(s):  
David P. Bourne ◽  
Riccardo Cristoferi
Keyword(s):  
Probability Measure ◽  
Triangular Lattice ◽  
Best Approximation ◽  
Particle System ◽  
Asymptotic Optimality ◽  
Optimal Location ◽  
Two Dimensions ◽  
Particle Systems ◽  
Discrete Measure ◽  
Number Of Particles

AbstractWe prove an asymptotic crystallization result in two dimensions for a class of nonlocal particle systems. To be precise, we consider the best approximation with respect to the 2-Wasserstein metric of a given absolutely continuous probability measure $$f \mathrm {d}x$$ f d x by a discrete probability measure $$\sum _i m_i \delta _{z_i}$$ ∑ i m i δ z i , subject to a constraint on the particle sizes $$m_i$$ m i . The locations $$z_i$$ z i of the particles, their sizes $$m_i$$ m i , and the number of particles are all unknowns of the problem. We study a one-parameter family of constraints. This is an example of an optimal location problem (or an optimal sampling or quantization problem) and it has applications in economics, signal compression, and numerical integration. We establish the asymptotic minimum value of the (rescaled) approximation error as the number of particles goes to infinity. In particular, we show that for the constrained best approximation of the Lebesgue measure by a discrete measure, the discrete measure whose support is a triangular lattice is asymptotically optimal. In addition, we prove an analogous result for a problem where the constraint is replaced by a penalization. These results can also be viewed as the asymptotic optimality of the hexagonal tiling for an optimal partitioning problem. They generalise the crystallization result of Bourne et al. (Commun Math Phys, 329: 117–140, 2014) from a single particle system to a class of particle systems, and prove a case of a conjecture by Bouchitté et al. (J Math Pures Appl, 95:382–419, 2011). Finally, we prove a crystallization result which states that optimal configurations with energy close to that of a triangular lattice are geometrically close to a triangular lattice.

Sur Une Équation Fonctionnelle Et SES Applications: Une Extension Du Théorème De Kesten-Stigum Concernant Des Processus De Branchement

1997 ◽  
Vol 29 (02) ◽  
pp. 353-373 ◽  
Author(s):  
Quansheng Liu
Keyword(s):  
Invariant Measures ◽  
Random Variables ◽  
Particle Systems ◽  
Independent Random Variables ◽  
Probability Measures ◽  
Optimal Conditions ◽  
Branching Random Walks ◽  
Random Integer ◽  
Watson Process ◽  
Infinite Particle

Given a random integerN≧ 0 and a sequence of random variablesAi≧ 0, we define a transformation T on the class of probability measures on [0, ∞) by lettingTμ be the distribution of, where {Zi} are independent random variables with distribution μ, which are independent of N and of {Ai} as well. We obtain the optimal conditions for the functional equation μ =Tμ to have a non-trivial solution of finite mean, and we study the existence of moments of the solutions. The work unifies the corresponding theorems of Kesten-Stigum concerning the Galton-Watson process, of Biggins for branching random walks, of Kahane-Peyrière for a model of turbulence of Yaglom made precise by Mandelbrot, and of Durrett-Liggett for the study of invariant measures for certain infinite particle systems.

An infinite particle system with continual input and random death

1978 ◽  
Vol 10 (4) ◽  
pp. 764-787 ◽  
Author(s):  
J. N. McDonald ◽  
N. A. Weiss
Keyword(s):  
Markov Chain ◽  
State Space ◽  
Limit Theorems ◽  
Particle System ◽  
Countable State Space ◽  
Infinite Particle System ◽  
Large Numbers ◽  
Countable State ◽  
Infinite Particle ◽  
Number Of Particles

At times n = 0, 1, 2, · · · a Poisson number of particles enter each state of a countable state space. The particles then move independently according to the transition law of a Markov chain, until their death which occurs at a random time. Several limit theorems are then proved for various functionals of this infinite particle system. In particular, laws of large numbers and central limit theorems are proved.

Sign in / Sign up

Export Citation Format

Share Document