A Particle System with Mean-Field Interaction: Large-Scale Limit of Stationary Distributions
Abstract
We consider a system consisting of n particles, moving forward in jumps on the real line. System state is the empirical distribution of particle locations. Each particle “jumps forward” at some time points, with the instantaneous rate of jumps given by a decreasing function of the particle’s location quantile within the current state (empirical distribution). Previous work on this model established, under certain conditions, the convergence, as , of the system random dynamics to that of a deterministic mean-field model (MFM), which is a solution to an integro-differential equation. Another line of previous work established the existence of MFMs that are traveling waves, as well as the attraction of MFM trajectories to traveling waves. The main results of this paper are: (a) We prove that, as , the stationary distributions of (recentered) states concentrate on a (recentered) traveling wave; (b) we obtain a uniform across n moment bound on the stationary distributions of (recentered) states; and (c) we prove a convergence-to-MFM result, which is substantially more general than that in previous work. Results (b) and (c) serve as “ingredients” of the proof of (a), but also are of independent interest.
1. Introduction
We consider a system consisting of n particles, moving forward on the real line. The particles move in jumps. The system state at a given time is the current empirical distribution of particle locations. Each particle gets “urges to jump” as an independent Poisson process of constant rate. However, a particle getting a jump urge actually jumps with the probability given by a decreasing function of the particle’s location quantile within the current state (i.e., empirical distribution); hence, this is a mean-field type of particles’ interaction with each other. When a particle does jump, the jump size is independent, distributed as a random variable Z > 0. We are interested in the system behavior when n is large.
This model was introduced in Greenberg et al. (1995, 1996) as an idealized model of distributed parallel simulation. In this case, n particles represent n processors (“sites”) simulating different part of some large system, and a particle location is the current “local simulation time” of the corresponding processor. The following types of questions are of interest, as n becomes large: how the local times of the processors progress over time; whether local times “stay closely together”; whether the evolution of the empirical distribution of local times becomes that of a traveling wave; etc. This model, and similar models, are motivated by other applications as well (including recent applications, such as blockchains), where, roughly speaking, a distributed synchronization of a large number of sites is of interest; cf. Manita and Shcherbakov (2005), Malyshev and Manita (2006), Manita (2006, 2009, 2014), Malyshkin (2006), Balazs et al. (2014), and references therein for examples of synchronization models.
There are two lines of work on the particle system described above. The first one is in Greenberg et al. (1995), where it is shown that, under certain additional conditions, as , the system random dynamics converges to that of a deterministic mean-field model (MFM), which is a solution to an integro-differential equation. There are several additional assumptions made in Greenberg et al. (1995), one of which is especially restrictive, in that the proof technique crucially relies on it—a particle jump probability depends on the current locations of K other particles chosen uniformly at random, where K > 0 is a fixed parameter, same for all n. We will refer to this additional assumption as the finite-dependence assumption, and it substantially restricts the more general model of this paper.
The second line of work is represented by Greenberg et al. (1996) and Stolyar (2023), where formally defined mean-field models (solutions to an integro-differential equation) are studied. The results of Greenberg et al. (1996) prove, in particular, that if an MFM that is a traveling wave exist, then “typically,” the traveling wave is unique, and MFM trajectories are attracted to it as time increases; the question of a traveling-wave existence under general assumptions was left open in Greenberg et al. (1996). Stolyar (2023) proves the existence of a traveling wave, under very general assumptions. (We also note that, for some MFMs that are different from the one in this paper, the existence and explicit forms of the traveling waves are obtained in Balazs et al. 2014, Hongler 2015, and Hongler and Filliger 2019, in some special cases of the jump-size distribution.)
The combination of the results of Greenberg et al. (1995, 1996) and Stolyar (2023) strongly suggests the following asymptotic property of the stationary distributions: As , the stationary distributions of (recentered) states concentrate on a (recentered) traveling wave. This property is stated as conjecture 7.1 in Stolyar (2023, section 7).
Our main results are:
(a) We prove (Theorem 1) that, as , the stationary distributions of (recentered) states concentrate on a (recentered) traveling wave. (This proves conjecture 7.1 in Stolyar (2023, section 7), under a slightly stronger assumption on the jump size, namely, , as opposed to .)
(b) As a key “ingredient” of the proof of (a), we obtain (Theorem 2) a uniform across n moment bound on the stationary distributions of (recentered) states. This result is also of independent interest.
(c) We prove (Theorem 3) the convergence-to-MFM result in our general setting, without the additional finite-dependence assumption. (This substantially generalizes the result of Greenberg et al. 1995. The proof largely follows the approach used in Balazs et al. 2014, for a different model. The approach is more generic than that in Greenberg et al. 1995; in particular, it does not rely on the finite-dependence assumption.) This result is another ingredient of the proof of (a), but is also of independent interest.
The proof of (a) relies on (b) and (c) and on the results in Greenberg et al. (1996) and Stolyar (2023) on the existence/uniqueness of—and attraction to—traveling waves.
1.1. Outline of the Rest of the Paper
In Section 2, we formally define the model and informally state the main results. Section 3 gives some basic notation, definitions, and conventions used throughout the paper. In Section 4, we state our main results, Theorems 1, 2, and 3, formally. Sections 5, 6, and 7 contain the proofs of Theorems 2, 3, and 1, respectively. A brief discussion of our results is in Section 8.
2. The Model and Main Results
The particle system model is as follows. There are n particles, moving in the positive direction (“right”) on the real axis . Each particle moves in jumps, as follows. For each particle, there is an independent Poisson process of rate of “jump urges.” When a particle gets an urge to jump, it actually jumps, to the right, with probability , where ν is its quantile in the current empirical distribution of the particles’ locations; that is, when the particle location is -th from the left. With complementary probability , the particle does not jump. To have the model well-defined, assume that quantile-ties between colocated particles are broken uniformly at random. We adopt the convention that function is defined for a continuous argument , by assuming that it is constant in each interval for and . Assume that, for each n, function is nonincreasing and that, as , it uniformly converges to a continuous, strictly decreasing function with . The jump sizes, when a particle does jump, are given by independent and identically distributed (i.i.d.) nonnegative random variables (r.v.) with cumulative distribution function (CDF) ; we denote by the complementary CDF; a generic jump size is given by the r.v. . Without loss of generality, we can and will assume that Z > 0—that is, . We will use notation
For some (not all) of our results, we will need the following two additional conditions on the jump-size distribution:
Note that, without loss of generality (WLOG), we can and do assume μ = 1; otherwise, we can achieve this condition by rescaling time. Also, if , we can and do assume, WLOG, that ; otherwise, is achieved by rescaling space.
Let be the (random) empirical distribution of the particle locations at time t; namely, is the fraction of particles located in at time t.
As , it is very intuitive that converges (in appropriate sense, under appropriate conditions) to a deterministic function , such that is a distribution function for each t, and the following equation holds:
It is known (Greenberg et al. 1996, Stolyar 2023) that, as long as (or, , WLOG), for any mean-field model, the speed at which the mean of the distribution f(t) moves right, is equal to . A distribution function is called a traveling wave shape (TWS) if is a mean-field model. By substituting into (4), we see that any TWS must satisfy equation
It is known (Stolyar 2023) that a TWS exists as long as (no other assumption on the jump-size distribution is required), and it is unique (up to a shift) if, in addition, (3) holds.
We now informally state the main results of this paper. (The formal results will be given later, in Section 4, after introducing more notation.) Let denote the distribution , recentered so that the distribution mean is at 0.
(in Section 4). Assume (2) and (3). Then, as , the stationary distribution of the process converges to the (Dirac) distribution concentrated on the unique TWS , centered so that its mean is at zero. Moreover, has finite absolute -th moment: .
(in Section 4). Assume (2) and (3). Then, for all sufficiently large n, the Markov process is stable (positive Harris recurrent), and its stationary distribution is such that the expected absolute -th moment of is bounded uniformly in n:
(in Section 4). Assume (or, , WLOG) and (3). Suppose that, as , the initial conditions converge to a deterministic proper distribution f(0). (Nothing else about f(0) is assumed, not even the existence of a finite mean.) Then, the process converges to the unique mean-field model with initial condition f(0).
3. Basic Notation
The set of real numbers is denoted by and is viewed as the usual Euclidean space. As a measurable space, is endowed with Borel σ-algebra. For scalar functions h(x) of a real x: is L1-norm; h(x) is called c-Lipschitz if it is Lipschitz with constant . Let be the set of continuous bounded functions on , which are constant outside a closed interval (one constant value to the “left” of it and possibly another constant value to the right of it.)
For functions h(x) of a real x: and are the right and left limits; a function h(x) is RCLL if it is right-continuous and has left limits at each x.
A function h of x may be written as either h(x) or hx. Notation for a multivariate function h(x, t), where , means the differential in x.
Denote by the set of scalar RCLL nondecreasing functions , which are (proper) probability distribution functions—that is, such that and . For elements , we use the terms distribution function and distribution interchangeably. Space is endowed with the Levy-Prohorov metric (cf. Ethier and Kurtz 1986) and the corresponding topology of weak convergence (which is equivalent to the convergence at every point of continuity of the limit); the weak convergence in is denoted . Note that, for , the L1-norm of their difference, , is equal to the Wasserstein W1-distance between the corresponding two distributions. The inverse (ν-th quantile) of is ; when f(y) < 1 for all y.
Unless explicitly specified otherwise, we use the following conventions regarding random elements and random processes. A measurable space is considered equipped with a Borel σ-algebra, induced by the metric, which is clear from the context. A random process always takes values in a complete separable metric space (clear from the context) and has RCLL sample paths. For a random process we denote by the random value of Y(t) in a stationary regime (which will be clear from the context). Symbol signifies convergence of random elements in distribution; means convergence in probability. W.p.1 or a.s. means with probability one. For a condition/event A, if A holds, and otherwise.
Space (respectively (resp.) ) is the Skorohod space of RCLL functions on taking values in (resp. ), with the corresponding Skorohod (J1) metric and topology (cf. Ethier and Kurtz 1986); denotes the convergence in these spaces.
For a distribution and scalar function , .
For scalar functions , with some domain is the sup-norm. When are operators mapping the space of such functions into itself, and mean the uniform convergence: .
Suppose we have a Markov process with state space and transition function . A measurable set is called small (cf. Bramson 2008) if there exist constants T > 0 and and probability distribution on , such that for any and any measurable . Pt, as an operator, is , where h is a scalar function with domain ; is the identity operator. The process (infinitesimal) generator B is
Function h is within the domain of the generator B if Bh is well-defined. We say that a Markov process is stable if it is positive Harris recurrent (cf. Bramson 2008); if it is, it has unique stationary distribution.
For real numbers a and b, we use notations: , . RHS and LHS mean right-hand side and left-hand side, respectively. Abbreviation w.r.t. means with respect to; a.e. means almost everywhere w.r.t. Lebesgue measure.
4. Formal Statements of Main Results
4.1. Uniform Moment Bound for Stationary Distributions. Limit of Stationary Distributions
For an element , denote by the mean of the corresponding distribution,
When is finite, denote by the centered version of f, namely,
If we denote by the state space of the process , then is the state space of . If we use notation
Suppose Conditions (2) and (3) hold. Then, as ,
and a stronger form of convergence (6) holds:
The proof of Theorem 1 is in Section 7.
Suppose Conditions (2) and (3) hold. Then, there exist and such that, for all , the Markov process is stable, and we have
The proof of Theorem 2 is in Section 5.
4.2. Transient Behavior: Convergence to a Mean-Field Model
Essentially all our asymptotic results on the transient behavior of the processes are for the noncentered processes . The result for the centered processes (Theorem 3(ii)) is obtained essentially as a corollary.
Denote by the generator of the process . For any , function of fn is within the domain of (where we use the fact each function in is constant outside a closed interval), and
Suppose , where is the deterministic sequence of , and . (Note that we do not assume that f(0) has well-defined mean .) Assume that conditions (or , WLOG) and (3) hold. Then, we have:
(i) in , where is deterministic, uniquely determined by f(0). Moreover, is a continuous element of , which satisfies
(10)The dependence of (as an element of space with J1-convergence topology) on f(0) (as an element of with weak convergence topology) is continuous.
(ii) If, in addition, , then , and, consequently, is a continuous element of , uniquely determined by , with for all . The dependence of on is continuous. And if, in addition, for all n, then in .
The proof of Theorem 3 is in Section 6. Also in Section 6, we show (Theorem 8) that solutions to (10) are exactly the mean-field models (Definition 1). We note that many of the supplementary results in Section 6, which may be of independent interest, require assumptions on the jump-size distribution that are much weaker than conditions and (3). In particular, some of those results assume nothing about the jump-size distribution besides it being a proper distribution.
5. Proof of Theorem 2
5.1. Equivalent View of Process
State can be equivalently described as , where are the locations of the n particles w.r.t. the mean , listed in a nondecreasing order. (So, the average at all times.) From now on, for each , we will consider the corresponding vector , and vice versa. Any function of may be expressed via the corresponding wn, and vice versa. In particular,
Note that the topology on , induced by the (weak convergence) topology on , is equivalent to the usual topology of component-wise convergence of the corresponding vectors wn.
The evolution of is as follows. Between the times of the jump urges, remains constant. At a time t of a jump urge, the following occurs. Let be the actual jumps size of particle i, in the system without recentering, upon this urge; and can be nonzero for at most one particle. Then, in the recentered system, particle i jump size (i.e., the increment of ) at t is (which may be positive or negative). After the jumps (if any) at t occur, the particles indices i are changed, if necessary, to keep nondecreasing in i.
5.2. Informal Intuition for the Proof
The proof of stability, in Subsection 5.3, uses fluid limit technique and is fairly straightforward. Let us discuss the intuition for the proof of the bound (9) in Subsection 5.4.
At a very high level, the bound (9) is due to the fundamental property of the system, which can be called the “egalitarian trend”: In a recentered system, the particles at high quantiles (large i) will have a negative drift, whereas particles at low quantiles (small i) will have a positive drift, thus preventing the centered empirical distribution from “spreading out.”
To obtain the bound on the expected -th moment of , we need the finite -th moment on a jump size. Informally speaking, we use as a Lyapunov function. If is the generator of process , then, “generally speaking,” we have ; in other words, the expected drift of in steady-state is zero. Function
Taking expectation w.r.t. , we obtain, informally speaking,
In the actual proof, instead of , we use its truncated version as the Lyapunov function because the latter is certainly within the domain of generator . And then let .
We note that this “program” for proving a property of the type of (9) is likely applicable to other models having the egalitarian trend property, though the technical details may differ.
5.3. Stability
The stability (positive Harris recurrence) is easily established using the fluid-limit technique (Rybko and Stolyar 1992, Dai 1995, Stolyar 1995, Bramson 2008). We note that the stability proof only uses Conditions (3) and (as opposed to stronger Condition (2)).
To prove stability, we will use the equivalent representation of the process , given in Subsection 5.1. The state space of is
Pick any two numbers, , and choose large enough so that for any , . (All we need here is that the jump probabilities of the “left-most” and “right-most” particle are separated by a positive constant.) Consider any fixed .
Consider a sequence of versions of the process , namely, processes with increasing norm of the initial state, , with . Given that is a closed small set for any a > 0, to establish stability, it suffices to show that, for some fixed T > 0, . This, in turn, follows from the fact that the limit (in appropriate sense) of the sequence of processes has trajectories such that for all , , and , as long as ; therefore, for all . We omit further details, which are straightforward. □
5.4. Proof of (9)
At some level, this proof is similar to the proof of an analogous result in Stolyar (2022) for a different particle system. However, the difference of our model from that in Stolyar (2022) is substantial, so we give full details of the proof for our model.
Consider the following function
As we will see, function can be thought of as the “first-order approximation of the generator of process , applied to function ”; but we do not even claim that is within the generator domain. Note that, for each n, is continuous in .
Note that each is the quantity of the order , which motivates the definition
We observe that, if particle i location wi is the -th from the left, and it is not colocated with any other particle, then
We define the function as follows: , where i is the particle whose location wi is the closest to x on the left; we also adopt a convention that, if wi is the location of the left-most particle, then for all . Clearly, function is a piece-wise constant nonincreasing function.
We can write:
The inequality in (15) follows by the following argument. Denote
To be specific, consider the case when . (The case is treated analogously.) We have . Note that
Then, we have
Next, we claim the following property: There exists a sufficiently large C > 0 and some , such that, uniformly in all sufficiently large n and all with ,
The proof of (16) is given in Section 5.5.
From (16) and (15), we obtain that, uniformly in all sufficiently large n,
Denote by the function truncated at level . Given that this is a continuous bounded function of , and the process of jump urges is Poisson, it is not hard to see that is within the domain of the generator of process .
Next, we claim the following fact: There exists such that for any fixed , uniformly in all large n and such that , we have
From (19) and inequality , which holds for a sufficiently large fixed , we obtain
Bound (20), in turn, implies that for any fixed ,
Recalling that is the random value of in the stationary regime, we have for all large n:
Letting , we finally obtain that
5.5. Proof of (16)
The definition of in (11) can be interpreted as follows: is the expected jump size of particle i, conditioned on this particle receiving the jump urge, and then centered by the expected jump size of any particle upon a jump urge in the system.
The proof is by contradiction. Suppose Property (16) does not hold. Then, we can and do choose a subsequence of , and corresponding , so that along this subsequence and
Consider separately two cases: (a) and (b) .
Consider a subsequence of such that and, moreover, , where f is a proper distribution.
For a fixed , denote
Using the facts that f is proper and , we easily see that, for any fixed ,
Pick a sufficiently small such that, for some and all large n, and . Then, we have
Denote , and consider the sequence of rescaled versions of , namely,
Note that
Consider two subcases: (b.1) and (b.2) . In the subcase (b.1), on account of (23), we can obtain a contradiction in the same way as in the Case (a).
So, the remaining case to consider is (b.2).
For an , let us formally define a “limiting version” of the functional defined in the LHS of the inequality in (15):
Note that , so that . Consider a subsequence of such that and . Distribution f cannot be concentrated at a single point. (Otherwise, because for all n, could not remain bounded.) Therefore, , and then
5.6. Proof of (18)
We will use the following inequality, which holds, for some constant , for any numbers y and δ:
Indeed,
Consider a fixed state and consider the expected increment Δ of upon a jump urge, which occurs in this state. Then, using (25),
For ζi, we have:
Next,
Assembling these bounds, we obtain
Now, consider the value of the generator at point such that . For that, consider the expected increment of over a small interval , with . First, note that, as , the contribution into this expected increment of the event that more than one jump urge occurs, is o(t) (because jump urges follow a Poisson process of rate n, and is bounded). With probability , there will be exactly one jump urge in , which, therefore, occurs into the state (such that ); then, the expected increment of will not exceed that of . Using these observations and the Estimate (28), we obtain (18). We omit the remaining straightforward formalities. □
6. Proof of Theorem 3
This proof largely follows the approach used in Balazs et al. (2014), for a different model. Unlike in Balazs et al. (2014), we work with the Levy-Prohorov metric (inducing the weak convergence topology) on , as opposed to the stronger Wasserstein W1-metric. This, in fact, simplifies some parts of the proof in our case; we will point out those parts as they appear. However, some other parts of our proof of Theorem 3 are completely different from (or not present in) the development in Balazs et al. (2014). They are Section 6.3 and Theorem 8, which establish the equivalence between solutions to (10) and mean-field models; and Theorem 9, which establishes the uniqueness of a mean-field model and its continuous dependence on the initial state.
We note that many of the supplementary results in this section, which may be of independent interest, require assumptions on the jump-size distribution that are much weaker than conditions and (3). In particular, some of the results assume nothing about the jump-size distribution besides it being a proper distribution. We will emphasize such weaker assumptions, where applicable, in the results’ statements.
6.1. C-relative Compactness of the Processes
A sequence of random processes with sample path in the Skorohod space (resp., ) is called C-relatively compact (see Perkins 2002 and Balazs et al. 2014) if it is: (a) relatively compact—that is, its any subsequence has a further subsequence converging in distribution to some limiting process; and (b) any such limiting process has continuous sample paths, a.s.
Suppose , where is the deterministic sequence of , and . Then, for any , the sequence of processes is C-relatively compact in the Skorohod space . (Note that we do not assume that f(0) has well-defined mean , or (3), or (2), or even . Jump-size distribution only needs to be proper.)
This result is analogous to theorem 6.9 in Balazs et al. (2014). Note that, although the model in Balazs et al. (2014) is different from ours, the only property that is used in the proof of theorem 6.9 in Balazs et al. (2014) is that the rate of jumps of each particle is upper bounded by a finite constant a at all times. The latter property, obviously, holds for our model as well, with . Therefore, the proof of theorem 6.9 in Balazs et al. (2014) applies essentially verbatim, with the following adjustments.
What in the proof of theorem 6.9 in Balazs et al. (2014) are , in our notation, are , respectively. In the proof, denote the locations of the particles, uniquely determined by the process state at time t, and vice versa. The notation is used for the locations of particles in an artificial system, with the same initial particle locations , but such that each particle jumps every time it gets a jump urge; the artificial system is coupled to the original one in the natural way, so that the corresponding particles have common processes of jump urges and common jump sizes (if the particles in the original system happen to jump at a jump urge). Clearly, with this coupling, and at all times . Finally, in our case, . □
Suppose , where is the deterministic sequence of , and . Then, the sequence of processes is C-relatively compact in the Skorohod space . (Note that we do not assume that f(0) has well-defined mean , or (3), or (2), or even . Jump-size distribution only needs to be proper.)
This result is analogous to corollary 6.10 in Balazs et al. (2014), with essentially the same proof. In fact, in our case, the proof is simpler. We need to verify conditions (i) and (ii) of theorem II.4.1 in Perkins (2002), which in our case take the following form.
(i) For any T > 0 and , there exists K > 0 such that
(ii) For any , the sequence of processes is C-relatively compact in the Skorohod space . (Note that the class of functions is separating, which means that a probability measure g is uniquely determined by the values of for .)
Condition (ii) is verified by Theorem 4. The verification of condition (i) repeats the proof of corollary 6.10 in Balazs et al. (2014), essentially verbatim, up to and including the display where Markov inequality is used for the first time. At that point, it remains to observe that the probability in the RHS of the display can be made arbitrarily small by making K sufficiently large. The measure in the proof of corollary 6.10 in Balazs et al. (2014) is in our notation the measure (distribution) on ; the particle locations and in the coupled original and artificial systems, are as described above in the proof of our Theorem 5. □
6.2. Trajectories of a Limit Satisfy (10)
For trajectories with for all , let us define the following functional for each and :
We will also formally define a “limit version” of for trajectories , for each and :
Suppose , where is deterministic sequence of , and . Then, the sequence of processes is such that, for every and any ,
The proof repeats the proof of theorem 6.11 in Balazs et al. (2014), in which we replace: L by ; f by h; μn by f n; a by μ = 1. In particular, in our case, , so that is replaced by
Finally, note that in our theorem, we only need to consider . We do not need to consider the identity test function h(x) = x, and that is why in Theorem 6, we do not need condition —it suffices that Z has a proper distribution. □
Suppose , where is deterministic sequence of , and . Suppose the sequence of processes is such that, as , in . Then, for every and any ,
The statement of this theorem is analogous to that of theorem 6.12 in Balazs et al. (2014). However, the proof in our case is simpler and is as follows. We know that, by Theorem 5, a.s. the limiting process has continuous trajectories in . We can use Skorohod representation to construct all processes on a common probability space so that, w.p.1, as ; moreover, by the continuity of , we see that uniformly on compact sets of t; we also see that, w.p.1, is nonincreasing in t (because so are ). Then, it is easy to see (using, in particular, the facts that convergence is uniform, and is strictly decreasing continuous) that w.p.1. □
Suppose , where is the deterministic sequence of , and . Then, the sequence of processes is such that its any distributional limit in is such that, a.s., is continuous, and it satisfies (i.e., (10)) for every and any . (Note that we do not assume that f(0) has well-defined mean , or (3), or (2), or even . Jump-size distribution only needs to be proper.)
By Theorem 5, there exists a subsequence of , which converges in distribution to a process with a.s. continuous trajectories. By Theorems 6 and 7, this process must satisfy for every and any . □
6.3. Equivalent Characterization of Solutions to (10) as Mean-Field Models
A function will be called a mean-field model if it satisfies the following conditions.
(a) For any t, .
(b) For any x, is nonincreasing c-Lipschitz in t, with constant c independent of x.
(c) For any x, for any t where the partial derivative exists (which is almost all t w.r.t. Lebesgue measure, by the Lipschitz property), equation
(29)holds.
Note that, by the change of variable in the integral in the RHS of (29), Equation (29) can be equivalently written as
For any initial condition satisfies (10) if and only if it is a mean-field model. (Note that we do not assume that f(0) has well-defined mean , or (3), or (2), or even . Jump-size distribution only needs to be proper.)
“Only if.” Let be the left-continuous step-function , jumping from one to zero at point x. Let be a continuous approximation of h, which is linearly decreasing from one to zero in . We see that
Indeed, is upper bounded by the probability that a random jump of size Z of a particle randomly located according to f(t) is such that the jump either originates or lands in ; this probability vanishes as . Also, because both and are within , for all t and ϵ, we have a universal bound . Then, for any fixed t, by taking the limit in , we obtain
This means that is absolutely continuous in t, with the derivative equal to a.e. in t. This, in particular, implies that, for any fixed y, the is continuous in t (in fact, Lipschitz); this, in turn, means that, possible discontinuity points y of “cannot move” in time t. We can then conclude that, for any x, the derivative is, in fact, continuous in t. Therefore, at every t. It remains to observe that is exactly the RHS of (29).
“If.” The definition of a mean-field model implies that (10) holds for the defined above step-function h for any x. Then, we have (10) for any h, which is piece-wise constant with finite number of pieces; and the set of such functions h is tight within the space of test functions , equipped with uniform metric. Then, (10) holds for any . □
6.4. Uniqueness of Solution to (10) and Continuity in Initial State. Proof of Theorem 3(i)
Assume that (or, , WLOG) and Condition (3) holds. Then, for any initial condition , a solution of (10) (i.e., a mean-field model) is unique. (Note that we do not assume that f(0) has well-defined mean , or (2).)
We know that solutions to (10) are mean-field models. Papers Greenberg et al. (1996) and Stolyar (2023) study the properties of mean-field models. It is easy to check that the proofs of all results in sections 4.4 and 4.5 of Greenberg et al. (1996), including Theorem 2, stating that the Wasserstein W1-distance (i.e., the L1-norm of the difference) between any two mean-field models and is nonincreasing, never use the fact that the means and are well-defined and equal to zero. Those proofs only use the fact that and
For any , a mean-field model is such that (see Stolyar 2023)
Now, if and are two different solutions with the same initial condition, , then, from (31),
Therefore, the Wasserstein W1-distance between and cannot increase, which implies the uniqueness. □
We have established that the family of distributions of the processes is C-tight, any subsequential distributional limit is concentrated on solutions to (10) (i.e., mean-field models), and the solution with initial condition f(0) is unique. This implies the convergence .
The continuity of in f(0) is then a consequence of convergence and uniqueness. Indeed, consider a sequence of initial states , converging to some ; namely, as . Fix and any . We can choose an increasing sequence and corresponding , such that as , and for each k, the process is within distance ϵ from the deterministic trajectory with probability at least . Then, for all large k, is within distance ϵ from both and with probability at least . Because this is true for any ϵ and δ, the only option is that . □
6.5. Corollaries for the Centered Processes: Proof of Theorem 3(ii)
Suppose . Then, from (31), we have . Then, the continuity and uniqueness of , as well as the continuity of its dependence on , follow from the corresponding properties of noncentered in Theorem 3(i).
Suppose, in addition, that for all n. Because ηn converges to η, we easily see directly that for any t. Combining these observations with Theorem 3(i), we obtain the convergence ; for example, we can use Skorohod representation to obtain a.s. convergence to the limit. □
7. Proof of Theorem 1
7.1. Basic Properties of a Limit of Stationary Distributions
The sequence of stationary distributions—that is, the distributions of —is tight. Any subsequential distributional limit is such that:
is concentrated on ;
By Theorem 2 and Markov inequality, for any , there exists a sufficiently large number , such that for all large n, with probability at least . The set
7.2. Characterization of a Limit of Stationary Distributions
Suppose —that is, and . If is a mean-field model with initial state f(0) (i.e., the solution to (10)), then the corresponding centered trajectory will be called the centered mean-field model.
The distribution of any subsequential limit is a stationary distribution of the deterministic process evolving along centered mean-field limits.
By Theorem 3(ii), the dependence of the deterministic trajectory on the initial state is continuous. Then, we can apply theorem 8.5.1 in Liptser and Shiryaev (1989), adapted to our setting. Or, the proof is also easy to obtain directly as follows. We need to show that for any test function and any , we have
7.3. Completion of the Proof of Theorem 1
Consider any subsequential distributional limit . Its distribution is a stationary distribution of the deterministic process evolving along centered mean-field limits .
Consider any two different initial conditions and of the deterministic process . The Wasserstein W1-distance must strictly decrease with t, by theorem 2 in Greenberg et al. (1996). Then, the only option is that is concentrated on a single element , which then must be a traveling wave shape, and then a unique traveling wave shape. Otherwise, if we consider two independent stationary versions of the process , say, and , then is finite for t = 0 (which follows from ), and it is strictly decreasing in t; this contradicts the stationarity. Finally, we obtain (7)—that is, —because . □
By theorem 3.2 in Stolyar (2023), we have the existence of the unique traveling wave shape . Then, by theorem 2 in Greenberg et al. (1996), for any , the Wasserstein W1-distance is strictly decreasing when it is nonzero. Then, must be concentrated at . Property (7) follows from . □
We have given two proofs that complete the proof of Theorem 1. They both require additional Assumptions (2) and (3). Note that, as a byproduct of the first proof, we also obtain the existence of the unique traveling wave shape, but only under these additional conditions. As far as the existence of the traveling wave shape is concerned, it is established in theorem 3.1 in Stolyar (2023) under weaker conditions, only requiring the finite second moment of jump size, .
8. Discussion
The main results of this paper, in a sense, complete the “program” represented by previous work by Greenberg et al. (1995, 1996) and Stolyar (2023) on the specific model in this paper. Greenberg et al. (1995), informally speaking, prove the convergence to a deterministic mean-field model as (In our paper, we generalize that result to a more general model, without the finite-dependence assumption.) Greenberg et al. (1996), informally speaking, prove that if a traveling wave exists, then each mean-field model trajectory is attracted to that traveling wave, as ; Stolyar (2023) shows that a traveling wave does exist under very general assumptions. This paper proves that the convergence to the traveling wave also holds if we “interchange the limits”: first consider the stationary distribution (take limit in ) and then consider the limit of stationary distribution; if we take limits in this order, the limit is the same—a traveling wave. Thus, the results of this program answer essentially “all” questions about the behavior of the system when n is large—both about its transient behavior and about its stationary distribution.
There are many other well-motivated large-scale particle systems (cf. Manita and Shcherbakov 2005; Malyshev and Manita 2006; Manita 2006, 2009, 2014; Malyshkin 2006, and Balazs et al. 2014), for which implementing a similar program would be of interest.
References
- (2014) Modeling flocks and prices: Jumping particles with an attractive interaction. Ann. Institut Henri Poincare Probab. Statist. 50(2):425–454.Google Scholar
- (2008) Stability of Queueing Networks (Springer Berlin Heidelberg, Berlin).Google Scholar
- (1995) On the positive Harris recurrence for multiclass queueing networks: A unified approach via fluid models. Ann. Appl. Probab. 5:49–77.Google Scholar
- (1986) Markov Processes: Characterization and Convergence (Wiley, Hoboken, NJ).Google Scholar
- (1995) Stochastic model of massively parallel computation. Markov Processes Related Fields 1(4):473–490.Google Scholar
- (1996) Asynchronous updates in large parallel systems. Proc. ACM SIGMETRICS Internat. Conf. Measurement Modeling Comput. Systems (ACM, New York), 91–103.Google Scholar
- (2015) Exact soliton-like probability measures for interacting jump processes. Math. Sci. 40(1):62–66.Google Scholar
- (2019) When do redundant requests reduce latency? Methodology Comput. Appl. Probab. 21:753–764.Google Scholar
- (1989) Theory of Martingales (Kluwer Academic Publishers Dordrecht, Dordrecht, Netherlands).Google Scholar
- (2006) Phase transitions in the time synchronization model. Theory Probab. Appl. 50:134–141.Google Scholar
- (2006) Limit dynamics for stochastic models of data exchange in parallel computation networks. Problems Inform. Transmission 42:234–250.Google Scholar
- (2006) Markov processes in the continuous model of stochastic synchronization. Russian Math. Surveys 61:993–995.Google Scholar
- (2009) Stochastic synchronization in a large system of identical particles. Theory Probab. Appl. 53:155–161.Google Scholar
- (2014) Clock synchronization in symmetric stochastic networks. Queueing Systems 76:149–180.Google Scholar
- (2005) Asymptotic analysis of a particle system with mean-field interaction. Markov Processes Related Fields 11:489–518.Google Scholar
- (2002)
Dawson-Watanabe superprocesses and measure-valued diffusions . Bernard P, ed. Lectures on Probability Theory and Statistics: Ecole d’Eté de Probabilités de Saint-Flour XXIX, 1999, Lecture Notes in Mathematics, vol. 1781 (Springer, Berlin), 125–324.Google Scholar - (1992) Ergodicity of stochastic processes describing the operation of open queueing networks. Problems Inform. Transmission 28:199–220.Google Scholar
- (1995) On the stability of multiclass queueing networks: A relaxed sufficient condition via limiting fluid processes. Markov Processes Related Fields 1(4):491–512.Google Scholar
- (2022) Parallel server systems with cancel-on-completion redundancy. Stochastic Systems 12(4):340–372.Link, Google Scholar
- (2023) Large-scale behavior of a particle system with mean-field interaction: Traveling wave solutions. Adv. Appl. Probab. 55(1):245–274.Google Scholar

