Bilinear Coagulation Equations
Daniel Heydecker, Robert I. A. Patterson

TL;DR
This paper studies bilinear coagulation equations, establishing a phase transition at gelation time, and connects the stochastic process to random graph models to analyze behavior before and after gelation.
Contribution
It introduces a general class of coagulation kernels with bilinear form, characterizes the gelation transition via eigenvalue problems, and extends analysis using random graph couplings.
Findings
Gelation occurs at a finite time characterized by an eigenvalue problem.
Hydrodynamic limit established for stochastic coagulation process.
Analysis extended beyond gelation time through random graph coupling.
Abstract
We consider coagulation equations of Smoluchowski or Flory type where the total merge rate has a bilinear form for a vector of conserved quantities , generalising the multiplicative kernel. For these kernels, a gelation transition occurs at a finite time , which can be given exactly in terms of an eigenvalue problem in finite dimensions. We prove a hydrodynamic limit for a stochastic coagulant, including a corresponding phase transition for the largest particle, and exploit a coupling to random graphs to extend analysis of the limiting process beyond the gelation time.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Bilinear Coagulation Equations
Daniel Heydecker, Robert I. A. Patterson University of Cambridge, [email protected]. This work was supported by the UK Engineering and Physical Sciences Research Council (EPSRC) grant EP/L016516/1 for the University of Cambridge Centre for Doctoral Training, the Cambridge Centre for [email protected]. This research was supported by the Deutsche Forschungsgemeinschaft (DFG) grant CRC 1114 “Scaling Cascades in Complex Systems”, Project C08.
Abstract
We consider coagulation equations of Smoluchowski or Flory type where the total merge rate has a bilinear form for a vector of conserved quantities , generalising the multiplicative kernel. For these kernels, a gelation transition occurs at a finite time , which can be given exactly in terms of an eigenvalue problem in finite dimensions. We prove a hydrodynamic limit for a stochastic coagulant, including a corresponding phase transition for the largest particle, and exploit a coupling to random graphs to extend analysis of the limiting process beyond the gelation time.
1 Introduction and Main Results
Smolouchowski [32] introduced the basic mathematical model for coagulating particles, giving an ordinary differential equation describing the distribution of particle masses, which arises from considering a microscopic particle system. The physics of the underlying system enters into the model through a choice of interaction kernel , describing the speed of the coagulation ; the particular case is known as the multiplicative kernel, and is particularly well-studied. It is well-known that the resulting Smolouchowski equation corresponds to the distribution of cluster sizes in the Erdős-Réyni random graphs in the limit, which, together with the simplicity of the kernel, allows a fairly complete analysis of this case.
In many physical situations, the rate of coagulation will depend on more than only the mass of the particles, and so it is desirable to generalise Smoluchowski’s equation. In particular, we note the works [27, 28] which allow coagulation in more than one possible way, and where the total rate of coagulation between particles of types can be bounded in terms of a function which is conserved as particles coagulation.
There are two natural ways to frame the study of coagulation: one can either start from an interacting particle system, where existence and uniqueness is elementary, but where characterising the many particle limit may require substantial effort, or one can work directly with the mean-field Smolouchowski and Flory equations, for which existence and uniqueness require more consideration, and can fail in some cases [27]. Relatedly, there are several different ways in which one can characterise gelation. At the level of the particle system, one can study the phase transition where the size of the largest particle goes from size to a size comparable to [23]. At the level of the limiting equation, gelation refers to the point where the solution to the Smolouchowski or Flory equation fails to conserve the total particle mass, which is known to be related [23, 28] to the divergence of the second moment of the particle mass.
We will study coagulation systems where, as above, coagulation can occur in several possible ways, and where the internal structure of particles can evolve, in a mass-preserving way, without coagulation. The important hypothesis is the bilinear structure: we ask that the total mass of the kernel can be expressed in the form , for a fixed matrix and a vector of conserved quantities. In this case, the limiting Flory equation is well-posed, globally in time, and the stochastic particle system couples exactly to a class of random graphs introduced by [5] which generalise the Erdős-Réyni graphs. We analyse the limiting equation in Theorem 1 and prove a law of large numbers for the stochastic particle systems in Theorem 2, together demonstrating that the three effects described above all occur at the same time .
1.1 Definitions
As mentioned above, our analysis rests on the bilinear form of the total rate , which allows us to connect the Smoluchowski equation to random graphs in Section 4. The following definition makes this precise.
Definition 1**.**
A Bilinear Coagulation System is a 5-tuple consisting of a complete metric space , a continuous involution on , a finite collection of continuous maps , from to , and nonnegative kernels on and respectively, such that the following hold.
- i).
For all and all ,
[TABLE] 2. ii).
For , the map takes only nonnegative values, and takes values in the positive integers 3. iii).
The involution satisfies
[TABLE]
and, for all ,
[TABLE]
Here, and throughout, the subscript # denotes the pushforward of a measure. 4. iv).
There exists a constant such that, for all ,
[TABLE]
where . Moreover, the sublevel sets are compact, for all . 5. v).
For all , the total rate may be expressed as
[TABLE]
for a fixed symmetric real matrix . Moreover, the matrix is of the block-diagonal form
[TABLE]
where are and square matrices respectively, and all entries of are nonnegative. Finally, for all , there exists such that , so that no row or column of vanishes. For , we ask that the total rate satisfies 6. vi).
For , the maps
[TABLE]
[TABLE]
are continuous.
Remark 1.1**.**
*We think of as counting the number of particles at time [math] which have been absorbed into . As a result, we will ask in (A5.) below that our initial measure is supported on , and artificially introduces monodisperse initial conditions.
If we are given a space equipped only with , we can replace by , and setting . In this way, and since does not enter the total rate , the artificial requirements on above do not restrict the physics of the coagulation system.*
Stochastic Particle Systems.
With the setting defined above, we can introduce the interacting particle systems under consideration.
We study a system of coagulating particles , and the associated empirical measure
[TABLE]
with the following dynamical rules.
- i).
The rate at which unordered pairs of particles in merge to form a new particle in is . 2. ii).
A particle of type evolves can a particle of type with a total rate .
This is a generalisation of a Marcus–Lushnikov coagulation process [23] on , which we will refer to as the stochastic coagulant. Note that a scaling of the pair interaction rate is used, which ensures that each molecule has a total evolution rate of order . Dividing jump rates by is equivalent to accelerating time by the same factor and this alternative formulation means that the jump rates in the definition of the “stochastic coalescent” in [2] as well as of the “stochastic -coagulant” in [28] omit the from the rates and rescale time when taking the limit.
Limiting kinetic equations.
We now consider various forms of the limiting Smoluchowski equation. Define a drift operator , by specifying for all ,
[TABLE]
The weak form of the Smolochowski equation for a process of measures on is to ask that
[TABLE]
The equation (Sm) captures the effects of coagulations between finite clusters. However, as discussed above, we wish to include the possibility of a macroscopic component, which we term gel. To include this effect, we modify the drift operator by specifying, for ,
[TABLE]
The weak form of the Flory equation is to ask, similarly,
[TABLE]
Here, the additional term comes into play only after ceases to conserve the quantities , and the extra term represents the interaction with the gel. This generalises the Smoluchowski coagulation equations [32] in a way analogous to Flory [36], and we use the term ‘-coagulant’ for a solution to (Fl), following [28].
Precise conditions on measurability and integrability required to interpret these equations concretely are given in Appendix a.
We write
[TABLE]
for the gel data, where are the , , and coordinates, respectively. Following remarks in [28], one may show that if is a solution to (Fl), then the maps are non-increasing, which guarantees that . We write for the state space of gel data, given by
[TABLE]
and use the same notation for the projections onto the factors. When and , we use for the rate of absorption, given by (5) with the new meanings of We will also write for the linear combination , defined on both and .
Definition 2** (Conservative Solutions).**
Let be a bilinear coagulation system. We say that a solution to either (Sm) or (Fl) is conservative if all the functions are constant on .
Thus, any solution to (Sm) or (Fl) is conservative up to some time , and non-conservative thereafter.
We will usually impose symmetry requirements (A1.) on the initial data which guarantee that for all , for all . As noted above, the functions are non-increasing, whenever is a local solution to either equation. Therefore, under hypothesis (A1.), a solution to either equation is conservative if, and only if, the map is constant on .
Let be the space of measures on with total mass at most 1. We equip with the vague topology induced by continuous, compactly supported functions on , and fix a complete metric compatible with this topology.
1.2 Statement of Results
We will make the following hypotheses on the initial data .
Assumption A**.**
We will ask that the initial data is a sub-probability measure on a bilinear coagulation space , satisfying the following hypotheses.
- (A1.)
The measure is even under the transformation : 2. (A2.)
For all , we have 3. (A3.)
The set is linearly independent in the space . In particular, none of the functions are [math] -almost everywhere. 4. (A4.)
The kernel is -irreducible: if is such that, for all and , , then either or Moreover, is not a point mass. 5. (A5.)
The initial data is supported on
We summarise our results on the analysis of the Flory equation (Fl) as follows.
Theorem 1**.**
Let be a -bilinear coagulation system, and let be a sub-probability measure on satisfying Assumption A. Then the equation (Fl) has a unique solution starting at ; we write for the gel data defined in (12). This solution has the following properties.
1. Phase Transition.
Let be the first time at which the solution fails to be conservative, that is:
[TABLE]
Then , and can be given explicitly in terms of the moments of as
[TABLE]
where denotes the spectral radius of a matrix.
2. Behaviour of the Second Moment.
Consider the second moments
[TABLE]
Then
- i).
* is finite and continuous, and so locally bounded, on * 2. ii).
On , each moment is monotonically increasing, as is . 3. iii).
At the gelation time, , and as
3. Representation of Gel Data.
For each , there exists a unique maximal -tuple such that, for all ,
[TABLE]
* undergoes a phase transition at time : if , then , and if then at least one component of is strictly positive. Moreover, the map is continuous. *
The gel data are given in terms of by
[TABLE]
Therefore, if then , and componentwise. Moreover, the map is continuous, and .
4. Gel Dynamics.
The map is differentiable on , and
[TABLE]
5. Order of the Phase Transition, and the Size-Biasing Effect.
The map is right-differentiable at , and as a consequence, the phase transition is first order; that is, the right-derivatives of the gel data exist and are strictly positive at . Moreover, there exist , such that and such that
[TABLE]
We call this a size-biasing effect: the average of the linear combination over particles in the early gel is at least the average over all particles. Let us define also the total interaction rate, which will quantify the inhomogeneity of the initial data :
[TABLE]
If is not constant -almost everywhere, then can be chosen so that the inequality in (20) is strict.
We also prove the following theorem, which is a law of large numbers result for the coagulating particle system . Firstly, following ideas of [28], we show that the empirical measure converges to the limiting solution in the vague topology, uniformly in time. The second part of the result is that the stochastic gel itself satisfies a law of large numbers, converging to the true gel as , where we order the particles so that is the largest particle by .
We make the following hypotheses for the law of large numbers. These are naturally satisfied when, for example, the initial particles are sampled as a Poisson random measure with intensity . However, it is useful for some intermediate results to give these results in the more general form used here.
Assumption B**.**
Let be the initial data the stochastic coagulant, and let be the initial data of the limiting Flory equation.
- (B1.)
As , the initial measures converge in probability to under the vague topology, that is:
[TABLE]
Moreover, is supported on the set 2. (B2.)
We also have the convergence
[TABLE]
for all , and the uniform integrability
[TABLE]
Theorem 2**.**
Let be a sub-probability measure on satisfying Assumption A, and let be the associated solution to (Fl) and corresponding gel. For , let be the stochastic coagulant with initial data satisfying Assumption B, and write for the particles of the stochastic system, sorted in decreasing order of . Let be the data of the largest particle in the stochastic system, normalised by . Then we have the convergence
[TABLE]
in probability. In particular, we have the following phase transition:
- i).
If , then the largest particle has gel data of the order ; 2. ii).
If , the largest particle has gel data of the order .
Moreover, if is any sequence with and , then we may define by summing the data of all particles with , and normalising by . Then the same result holds when we replace by in (25).
Here, and throughout, we use the notation for the probabilistic equivalents of , and say that an event111or, more formally, a sequence of events indexed by holds with high probability if relevant probabilities converge to as . Precise definitions can be found in [15].
1.3 Plan of the Paper.
Our programme will be as follows.
In the remainder of this section, we will discuss other works on coagulating particle systems in the literature, and how they relate to our results. 2. 2.
In Section 2, we will prove that the limiting equation (Fl) has unique, globally defined solutions, based on a truncation argument from [27, 28]. 3. 3.
In Section 3, we prove an initial result, Lemma 3.1, on the convergence of the stochastic coagulant, using the ideas of [28, Theorem 4.1]. This will later be used to prove later points of Theorem 1 based on probabilistic arguments for the empirical measures , and the random graphs introduced in Section 4. 4. 4.
In Section 4, we show how the stochastic coagulant can be coupled to a family of inhomogenous random graphs defined in [5]. Key results for these graphs are recalled in Appendix b. The critical time for these graphs may be found exactly, leading to the explicit expression in Theorem 1. 5. 5.
A weakness of the preceding sections is that, a priori, the critical time for the graph processes may differ from the gelation time ; in Section 5, we show that this cannot happen. This is based on a preliminary version of Theorem 2, which shows convergence of at a single fixed time . 6. 6.
Section 6 is dedicated to a proof of item 2 of Theorem 1, concerning the second moments . The statements about the subcritical and critical cases follow general ideas in [27, 28], while the statement about the supercritical case uses additional ideas from the theory of random graphs. 7. 7.
Section 7 uses the ideas of previous sections to prove items 3 and 4 of Theorem 1, concerning the gel data beyond the critical point. 8. 8.
Section 8 uses the analysis of the gel to extend Lemma 3.1 to show that convergence is uniform in time. 9. 9.
Section 9 proves item 5 of Theorem 1, concerning the behaviour near the critical point. This completes the proof of this theorem. 10. 10.
To finish the proof of Theorem 2, we revisit the ideas of Section 5 to prove convergence of the stochastic gel , uniformly in time. This is the focus of Section 10, and builds further on ideas of previous sections.
1.4 Literature Review
The original equation introduced by Smoluchowski considers the case of coagulating particles, whose only property is a mass belonging to , and where the coaguation has a general rate . In this case, identifying measures with a summable sequence, the equation analagous to (Sm) reads
[TABLE]
For an extensive review the reader is referred to [2]. The case is known as the multiplicative coagulation kernel and in this case with , the solution of (26) exhibits gelation at .
The existence and value of the gelation time has been studied for a range of . For particles with integer masses and Jeon [16] proved the existence of a gelation phase transition and provided an upper bound on the gelation time.
Norris [27, 28] introduced a more general form, analagous to (Sm) on a general space , allowing particles with internal structure and where, for any pair of particles, there are multiple possible coagulation products, in the case for some function growing no more than linearly in particle mass, a step that is important for the present work. A lower bound for the gelation time was proved in [27] and an upper bound was added under appropriate assumptions in [28]; however, these bounds do not coincide in general. Normand [25] obtained explicit results concerning the blowup of a second moment for a sexed model which gives a lower bound on the gelation time, and in a later work [26] finds explicit expressions for the gelation time for a selection of models with arms. Let us also mention the more recent work of Merle and Normand, who show results similar to Theorems 1, 2 for the multiplicative coagulant, but where particles become inert when they reach a scale ; particles above this size play the role of the gel. Consequently, ours is one of the first models for which the gelation time can be found exactly; moreover, several aspects of our analysis extend what was previously known about the Smoluchowski equation, using the connection to random graphs [5].
The study of gelation as the formation of a very large connected structure by joining basic building blocks goes back at least to Flory [11] whose motivation was hydrocarbon polymerisation in the manufacture of plastics. Flory understood polymerisation as the formation of a random graph, rather than in terms of coagulation, and was aware of a sharp phase transition at the emergence of a giant connected structure, which he termed ‘gel’. A rigorous proof of the random graph phase transition was provided by Erdős and Rényi [9]. The existence of a phase transition corresponding to the formation of a giant particle, which corresponds to the phase transition in Theorem 2, was first discussed by Lushnikov [23], who uses this to explain the explosion of the second moment, corresponding to item 2 of Theorem 1, in the particular case of the multiplicative kernel. The first connection between random graph and particle approaches appears in [7], where the phase transition is proved for the particle coagulation process and an interpretation as a new proof for a phase transition in the Erdős-Rényi random graph is noted; this is also discussed in the survey article [2]. We extend this connection, and show that the bilinear form of the merger rate allows us to couple the stochastic coagulant process to inhomogeneous random graphs as considered by [5].
Our original motivation was to study a concept of interaction clusters introduced by Gabrielov et al. [12] in the context of the billiard model for an ideal gas. The distribution of the sizes of the interaction clusters is formally derived in [29] in terms of the solution of the Boltzmann equation. Reducing to the case of cutoff Maxwell molecules for the spatially homogeneous Boltzmann equation, the phase transition observed in [12] can be identified precisely and the cluster size distributions observed to match those arising from the Smoluchowski coagulation equation with product kernel [23, 2, 29]. Heuristically, when a collision occurs, the corresponding clusters merge, which may be represented as a coagulation event at the level of interaction clusters. In [30] the clusters were studied for the Kac process, which is a stochastic approximation to the billiard model with elastic collisions, and the restriction to Maxwell molecules was lifted. This allowed a general collision rate including the hard sphere case and it was formally shown in a large particle number limit that the distribution of the cluster sizes converges to a version of the Smoluchowski coagulation equation with a time-dependent product kernel. In the Kac model where the rate of collision between two molecules with velocities is proportional to , a sum over particles in a cluster shows that the total merge rate depends on the mass, momentum and energy of the two clusters. Moreover, since collisions are elastic, these quantities add when two clusters merge, and are unchanged when a cluster undergoes an internal collision. This quadratic collision rate is of significant interest [22, 30, 34], although it does not have a natural physical interpretation. The explicit representation of the critical times in the present work enable us to verify the conjecture that the phase transition occurs strictly before the mean free time [30].
2 Well-Posedness of the Limiting Equation
This chapter is dedicated to a first analysis of the Smoluchowski equations (Sm, Fl), following Norris [27, 28]. Our goal in this section is to prove the following lemma on the well-posedness of (Fl).
Lemma 2.1**.**
For any measure satisfying (A1.), the equation with gel (Fl) has a unique global solution starting at . Moreover, for all .
Corollary 2.2**.**
Suppose is a conservative local solution to the equation without gel, (Sm), starting at . Then for all , and . Hence, (Sm) has a unique maximal conservative solution, given by .
Our proof of Lemma 2.1 is an adaptation of the arguments in [27, Section 2] and [28, Section 2] and is based on a truncation argument. Recalling that , we see that for some For all , we define the truncated particle space
[TABLE]
We consider the following ‘truncation at level ’: in the empirical measure, we track only those particles inside , and consider all other particles to belong to a ‘truncated gel’. Although the particles in the truncated gel affect the dynamics in , these contributions depend only on the total data of the truncated gel, due to the bilinear form of the kernel. This leads to an ordinary differential equation with Lipschitz coefficients in an infinite dimensional space.
We formalise this intuition as follows. For a measure supported on and , we define a signed measure on by specifying, for all ,
[TABLE]
This corresponds to the dynamics of particles inside . The rate of change of the truncated gel data is given by
[TABLE]
We now seek measures supported on and gel data such that, for all bounded measurable on ,
[TABLE]
[TABLE]
We will use the following existence and uniqueness result for the restricted dynamics (Fl, Fl).
Lemma 2.3**.**
[Existence and Uniqueness of Restricted Dynamics] Suppose is a finite measure on which satisfies (A1.), and satisfies for all . Then there exists a unique map on , which solves the restricted dynamics (Fl, Fl). Moreover, for all , is a positive, finite measure on , for all times , and .
Sketch Proof of Lemma 2.3.
This may be proved by a trivial modification of the arguments in [27, Proposition 2.2]. We define Picard iterates by
[TABLE]
One then uses bilinear continuity arguments in total variation norm to show that, given a bound , there is a positive time such that the Picard iterates converge uniformly in total variation on , and that the limit solves (Fl, Fl), possibly allowing to be a signed measure. This argument also implies that the solution is unique on this interval. Now, we note that the quantity is constant in time, and therefore this construction can be repeated on , , etc, which proves global existence and uniqueness. Finally, an integrating factor is introduced to argue that is a positive measure. In our case, it is also straightforward to see that the gel data , and that , thanks to the symmetry (A1.). ∎
Proof of Lemma 2.1.
We first show existence. For all , we let be the solution to the dynamics (Fl, Fl) restricted to , with initial data
[TABLE]
Observe that, if , then given by
[TABLE]
solve the dymanics (Fl,Fl) with the same initial data . From uniqueness in Lemma 2.3, it follows that . This shows that the measures are increasing in , while the gel data are decreasing, and is identically [math], by symmetry (A1.). Therefore, the limits
[TABLE]
exist in the sense of monotone limits; one can then check that and satisfy the full equation (Fl), with initial values and
To see uniqueness, let be the solution constructed above and write for the data of the gel. Let be any solution to (Fl) starting at , and let be the associated data of the gel. For all , it is simple to verify that
[TABLE]
is a solution to the dynamics (Fl, Fl) on . By uniqueness in Lemma 2.3, it follows that , and taking monotone limits, we see that . The argument for is identical. ∎
3 Convergence of the Stochastic Coagulant
We now turn to a preliminary version of Theorem 2. In this section, we will outline the proof of the convergence of the stochastic coagulant to a solution of (Fl), locally uniformly in time. Most of the arguments are well-known for the Smoluchowski equation [27, 28], and for brevity, we will sketch the proof with an indication of the nontrivial technical details. Throughout, we fix satisfying Assumption A, and with initial data satisfying Assumption B. Our result is as follows.
Lemma 3.1**.**
Suppose satisfies Assumption A, and let be the solution to (Fl) starting at . Let be stochastic coalescents with initial data satisfying Assumption B. Then we have the local uniform convergence
[TABLE]
where recall that is a complete metric inducing the vague topology.
Remark 3.2**.**
We will later upgrade the local uniform convergence to full uniform convergence in Lemma 8.2. We also remark that this does not immediately imply the convergence of the gel terms in Theorem 2, as the test functions involved are neither compactly supported nor even bounded. This will be dealt with in Sections 5, 10, where the proofs build on this result.
Proof.
The proof follows the well known method of proving tightness and identifying possible limit paths: Firstly, the jump rates can bounded, uniformly in time, in terms of the initial second moment and, thanks to (B2.), these are stochastically bounded: as . As a result, it follows that for all , the processes are tight in the Skorohod topology of .
Next, we wish to argue that if is any subsequential limit point, then coincides with the solution to (Fl). For this stage, we show that for certain well-chosen , the pair
[TABLE]
converge to a pair which solve the restricted evolution equations (Fl, Fl), started at
[TABLE]
In order to prove this convergence, we will need a pair of regularity conditions (C1-C2.) which will be displayed below. These allow us to obtain vague convergence of , despite the discontinuity of the cutoff . Moreover, one can show that these conditions are satisfied for almost all .
- i).
Almost surely, for almost all ,
[TABLE] 2. ii).
This also holds for . That is, almost surely,
[TABLE]
Thanks to the construction of solutions to the global equation (Fl) in Lemma 2.1, we know that for all such , coincides with . Finally, we take a limit of such , to conclude the equality . Since the limit process is continuous in the vague topology , it follows that we may upgrade from Skorohod to uniform convergence:
[TABLE]
as claimed. ∎
4 Coupling of the Stochastic Coagulant to Random Graphs
In this section, we will show that the stochastic coagulant defined in the introduction may be coupled to a dynamic version of the random graphs considered in [5]. This allows us to apply some results of that paper, which we summarise in Appendix b, to analyse the stochastic coagulant process and the limit equation.
Definition 3**.**
[Dynamic Inhomogenous Random Graphs] Fix a measure satisfying Assumption A. Let be a collection random points in of potentially random length , and sample , independently of each other, for , and independently of . We define the kernel
[TABLE]
where the right-hand side is the total mass of the interaction kernel . We form the random graphs on by including the edge if
[TABLE]
We write for the distribution of , for a single fixed . We say that satisfy Assumption B for if the same is true of the empirical measures . We emphasise that the do not change during the dynamics.
This has the following immediate consequences. Firstly, the conditions in Assumption B guarantee that , is a generalised vertex space in the sense of [5], which is recalled in Definition b.1, and is an irreducible kernel as described in Definition b.2, thanks to (A4.). Using both parts of (B2.), one can also show that the kernel is graphical in the sense of Definition b.5.
For all times , is an instance of the inhomogeneous random graph from Definition b.3. Moreover, the process is increasing, and is a Markov process, by the memoryless property of the exponential variables . We write for the convolution operator
[TABLE]
and for the associated operator norm in .
We write also . The following is the basic statement of a phase transition for , which follows from Theorem b.8.
Lemma 4.1**.**
Let satisfy Assumption A, and let be the random graphs constructed above, such that satify Assumption B. Write for the size of the largest component of . Then we have the following phase transition:
- i).
If , then in probability. 2. ii).
If , then there exists such that, with high probability,
We write for the connected components, which we also call clusters, of , in decreasing order of size, allowing if has fewer than components and for the number of vertices in . For a cluster of the graph , we will write
[TABLE]
for the unnormalised data, and
[TABLE]
We write for the point mass , and for the normalised empirical measure
[TABLE]
where the sum is over all clusters of . This is connected to the stochastic coagulants as follows:
Lemma 4.2** (Coupling of Random Graphs and Stochastic Coagulants).**
Fix points in , and let be the random graph process described in Definition 3 for this choice of vertex data. Consider also a stochastic coagulant started from . Then the processes and are equal in law.
Remark 4.3**.**
This is the key result which makes much of our analysis possible. Many of the remaining points of Theorem 1 above concern only the moments , which depend on only through the pushforward By applying Lemma 3.1 in the space , we can use the pushforwards as stochastic proxies to , and thanks to Lemma 4.2, the measures can be realised as for a random graph process . In this way, we can apply results from the theory of random graphs [5] to deduce results about solutions to the Smoluchowski equation (Fl).
Sketch of proof of Lemma 4.2.
Let us fix . Firstly, both processes are Markov: for , the follows because the total rate (5) depends only on , and similarly for . One may also verify that the two processes undergo the same transitions at the same rates, again thanks to (5), and that the total rate is bounded in terms of . The boundedness of the total rate implies the uniquness in law for the corresponding Markov generator, which concludes the proof. ∎
Combining this with the approximation result Lemma 3.1 for the stochastic coagulant, we may connect the random graph process to the limit equation as follows.
Lemma 4.4** (Convergence of the Random Graphs).**
Let be a measure on satisfying Assumption A, and let be the random graph processes constructed above with initial data which satisfies Assumption B. Let be the solution to the Smoluchowski Equation (Fl) starting at ; then we have the local uniform convergence
[TABLE]
in probability, for all where is a metric for the vague topology .
We can also compute the critical time associated to explicitly:
Lemma 4.5** (Computation of critical time).**
Let be a measure satisfying Assumption A, and let be random graphs satisfying Assumption B. Then the convolution operator constructed above is a bounded linear map on and the inverse of the critical time for the graph phase transition, , is the largest eigenvalue of the matrix given by . In particular,
Remark 4.6**.**
This is exactly the form claimed for in Theorem 1. However, we have not yet established that ; this is the content of Lemma 5.1.
Proof of Lemma 4.5.
Firstly, by (A2.), it is easy to see that , and so, by Lemma b.10, is the largest eigenvalue of ; its eigenspace is one-dimensional and consists of functions that are single signed, - almost everywhere. Since we have .
In order to reduce from the operator to the matrix we construct a basis of such that
[TABLE]
and, for , is orthogonal to . Note that plays no special role in the basis, because it does not appear in the rate . We also write and . By expanding the total rate , we see that, for all
[TABLE]
where denotes the inner product. Therefore, maps into the subspace , and is 0 on its orthogonal complement. We further note that the subspaces are orthogonal, and are invariant under . Therefore, the eigenspace corresponding to is a direct sum of eigenspaces contained within .
Since is one-dimensional, one summand must be trivial, and so either , or . To exclude the second possibility, we note that any satisfies for all by Definition 1, while eigenfunctions of are single-signed -almost everywhere. It therefore follows that and that is the largest eigenvalue of .
The result is now immediate since (48) shows that is the matrix representation of respect to the basis introduced above. ∎
We also define as the survival function from Lemma b.7, given by the maximal solution to
[TABLE]
We note, for future use, the following properties where is the kernel given above.
Lemma 4.7**.**
The survival function takes the form
[TABLE]
for some . Moreover, the functions are continuous.
This proves the first two assertions of item 4 of Theorem 1.
Proof.
Using the symmetry and Assumption (A1.), it is simple to verify that also satisfies the fixed point equation (49). By maximality of , we must have for all , which implies that is even under .
Using the identification of the range of as in Lemma 4.5, we see that there exist such that
[TABLE]
and expanding as in (48), the coefficients are given explicitly by
[TABLE]
Since is even, we have for , and since , for . Using (49) again, we obtain the claimed representation
[TABLE]
The continuity follows by applying dominated convergence to (52), and using the continuity of established in Theorem b.12. ∎
5 Equality of the Critical Times
In this section, we will prove that the critical time for the graph process, introduced in Section 4, coincides with the gelation time for the limiting equation, defined in Section 2 as the time at which mass and energy begin to escape to infinity.
Lemma 5.1**.**
Let be a measure on satisfying Assumption A. Let be the solution to (Fl) starting at , with associated data of the gel; recall that is defined by
[TABLE]
Let be the random graph processes constructed above, and suppose that Assumption B holds for . Then the critical time for the graph transition process coincides with the gelation time .
The following is a straightforward corollary.
Corollary 5.2**.**
Let satisfy Assumption A, and let be the solution to (Fl) starting at , with gelation at . Then is given explicitly by (15).
Proof of Corollary 5.2.
Let us form by sampling points as a Poisson random measure with intensity . It is immediate that the resulting data satisfies Assumption B for the measure , and the critical time of the associated graphs is given by the claimed expression (15). From the previous lemma, it now follows that the gelation time , which proves the claimed result. ∎
The proof of Lemma 5.1 is based on the following weak version of the convergence of the gel in Theorem 2, which will be revisited in Section 10 to establish uniform convergence.
Lemma 5.3**.**
Let be as in Lemma 5.1 and be as in the proof of Corollary 5.2. Fix , and write for the scaled mass and energy of the largest particle in , as in Section 4:
[TABLE]
Then and in probability.
We first show that Lemma 5.3 implies Lemma 5.1; the remainder of this section is dedicated to the proof of Lemma 5.3.
Proof of Lemma 5.1.
Let us assume, for the moment, that Lemma 5.3 holds. Throughout, let be the vertex data of the random graph process, which we recall are independent of time.
Firstly, suppose for a contradiction that . Then , but we bound
[TABLE]
The first term converges to [math] in probability, by definition of the phase transition in Theorem b.8, and the second term is bounded in by hypothesis (B2.). This implies that in probability, which contradicts Lemma 5.3; we must therefore have that
Conversely, if , then by definition. Now, the convergence
[TABLE]
in probability implies that the largest cluster is of the order , which is only possible if by Lemma 4.1. Since was arbitrary, we must have , and together with the previous argument, we have shown that as claimed. ∎
The proof of Lemma 5.3 is based on the following argument. We know, from Theorem b.11, that any ‘mesoscopic’ clusters contain negligable mass; thanks to the integrability assumption (A2.), the same is true for the energy. Therefore, almost all mass and energy either belongs to the ‘microscopic’ scale, whose convergence is quantified by Lemma 3.1, or the giant component, whose convergence is the subject of interest here. Therefore, with a suitable approximation argument, the claimed convergence will follow from the quoted results.
We begin with a preparatory lemma; throughout, we will assume the notation of Lemma 5.3. For the proof of of Lemma 5.1, and later Theorem 2, we will wish to study the convergence of integrals , for bounded continuous functions with non-compact support. However, the convergence result Lemma 3.1 only gives us information when the support of is compact. Our second preparatory lemma allows us to approximate the integrals for functions whose support is bounded in the -direction.
Lemma 5.4** (A step towards uniform integrability).**
Let , be as in the previous lemma. Then, for every ,
[TABLE]
Proof.
We note that depends on only through the pushforward , since the integrand only depends on the values of at the different particles. From Lemma 4.2, we can find random graphs , such that is an enumeration of the atoms of and for all times . With this coupling, we express the integral as follows:
[TABLE]
Using Cauchy-Schwarz, we bound
[TABLE]
As remarked in Definition 3, the data associated with the graph nodes are constant in time, so the first factor is independent of , and is bounded in by the second assertion of (B2.). Therefore, it is sufficient to prove the claim with replaced by .
Now we note that with probability one
[TABLE]
and the result follows from (B2.). ∎
Using the preparatory lemma developed above, we now prove Lemma 5.3.
Proof of Lemma 5.3.
Throughout, we let be a stochastic coagulant coupled to a random graph process , as described in Section 4 with vertex data ; thanks to this construction, is exactly the size of the largest cluster in , and are the sums
[TABLE]
The case is trivial, and can be omitted. We deal first with the coordinate ; the cases for the coordinates are entirely analagous.
Fix , and let be a sequence, to be constructed later, such that
[TABLE]
We now construct ‘bump functions’ as follows. Let be a sequence growing sufficiently fast that, in the notation of Lemma 5.4, , and let
[TABLE]
Let be the indicator , and construct a continuous, compactly supported function such that
[TABLE]
The final condition is compatible with continuity because is continuous and integer valued. We define and . We now decompose the difference
[TABLE]
where we recall that . We now estimate the errors , the remaining term will be dealt with separately, and requires careful construction of the sequence .
1. Estimate on .
Let be the lower bound , so that . As , , and so by monotone convergence, . This implies that the (nonrandom) error .
2. Estimate on .
From the definitions of , we observe that
[TABLE]
Therefore, in the notation of Lemma 5.4, . By construction of , and since , it follows that which implies convergence to [math] in probability.
3. Estimate on .
Recalling that and using the coupling to random graphs, we have the equality
[TABLE]
which gives the equality
[TABLE]
Using Cauchy-Schwarz, we bound
[TABLE]
The first term converges to [math] in probability by Theorem b.11 and (B2.), and the second converges to [math] since . Together, these imply that in probability.
4. Estimate on .
Using the first part of (B2.), we have the convergence in distribution
[TABLE]
which implies that in probability as desired.
5. Construction of , and convergence of .
It remains to show how a sequence can be constructed such that in probability and such that (62) holds. Recalling the definition of above, let be the events ; as with fixed, both , by Lemma 3.1. We now define inductively for by setting , and letting be the minimal such that, for all , Now, we set for It follows that and , and
[TABLE]
Therefore, satisfies the requirements (62) above. Moreover,
[TABLE]
and so, with this choice of , in probability. Since we have now dealt with every term appearing in the decomposition (65), it follows that in probability, as claimed.
The arguments for the components are identical to those above, using the same bound (69) on . ∎ We also note, for future use, an important corollary of this argument.
Corollary 5.5**.**
At the instant of gelation, the gel is negligible: .
Proof.
For the components, this follows from the critical case of Theorem b.8 exactly as in (56). The remaining components are identically [math] by the symmetry (A1.), as in Lemma 2.1. ∎
6 Behaviour of the Second Moments
In this section, we consider part 2 of Theorem 1, concerning the behaviour of the second moments and . Following [23, 28], one might expect that the gelation time corresponds to a divergence of as ; by an approximation argument, we will show that this is indeed the case. We also introduce a duality argument, corresponding to Theorem b.13, which allows us to prove that is finite on . The final assertion follows from the fact that , which is the content of Corollary 5.5.
6.1 Subcritical Regime
We first deal with the subcritical regime , to show that the second moments are finite and increasing on this interval, and that is exactly the first time at which diverges.
Lemma 6.1**.**
Suppose satisfies Assumption A, and let be the corresponding solution to (Fl). The second moments are finite, continuous and increasing on , and increases to infinity as , where is the associated gelation time.
The ideas of this argument follow [28], where there is a similar result for approximately multiplicative kernels, for which the total rate is bounded above and below by nonzero multiples of , where is a mass function playing the same rôle as our . Unfortunately, this cannot be applied directly, for two reasons.
- i).
Firstly, the total rate in (5) contains the terms of indefinite sign. 2. ii).
Secondly, the remaining combination of is not a priori of approximately multiplicative form: particles where some are small, and others large, will in general prevent such a bound from holding.
Our strategy will be as follows.
Firstly, we will show that if solves (Fl), then the pushforward measures solve a modified equation (mFl) on the simpler space , with a reduced kernel . This allows us to eliminate the terms of indefinite sign mentioned above. This new equation has unique solutions, and so is the unique solution starting at ; in particular, the second moments , coincide, and gelation takes place at the same time . Therefore, we can prove the desired result working solely at the level of (mFl). 2. 2.
Thanks to results of Norris [28, Theorem 2.1], if is a solution to (mFl) with , then there exists such that is locally integrable on and such that as . 3. 3.
We introduce a truncated state space , which excludes particles where any is either very large or very small, and construct new initial data which are supported in this space. In this context, the kernel is approximately multiplicative, and so [28, Theorem 2.2] guarantees that the solutions undergo gelation at exactly the blow-up time . 4. 4.
We argue, from the characterisation of the gelation time in Section 4, that our construction gives an approximation of the gelation times: . We will argue, based on a system of ordinary differential equations for the moments , that the blowup time is also continuous: . Together with the previous points, this proves the claimed result.
We begin by introducing the modified equation.
Lemma 6.2**.**
Let be the kernel on given by
[TABLE]
Consider the corresponding equation incorporating gel, for measures on , which we write as
[TABLE]
Let be a measure on satisfying Assumption A, and let be the corresponding solution to (Fl). Then the pushforward measures are the unique solution to (mFl) starting at .
Remark 6.3**.**
Under the new kernel , the quantities are still conserved for , but not for . However, since we seek to analyse , we will not need any conservation properties of for in this section.
Sketch Proof of Lemma 6.2.
Much of the proof consists of algebraic manipulations, using the definitions and hypotheses in Definition 1. In the interest of brevity, such manipulations will omitted.
Let us first consider the reflected measures on . By (A1.), , and using part iii) of Definition 1, one can show that for all , all finite measures on and all bounded, measurable functions on , . From this, and performing a similar manipulation for the gel term, it follows that also solves the equation (Fl) with the same initial data which implies, by uniqueness, we must have for all . Using this, one can now similarly prove that, for all and as above,
[TABLE]
Taking a linear combination, and again performing a similar manipulation for the gel term, it follows that solves the equation analagous to (Fl) for the symmetrised kernel
[TABLE]
Since the coagulation rate in only depends on , one can verify that the pushforward measures on solve the projected equation (mFl) as claimed. ∎
We now turn to the second point, which concerns the moment behaviour of the solutions to (mFl). The following result follows from ideas of [28], which we will briefly sketch.
Lemma 6.4**.**
Let be a measure on satisfying Assumption A, and let be the corresponding solution to (mFl). Then there exists such that is finite and increasing on , and as . Moreover, is conservative, and so .
The subscript e here denotes ‘explosion’: is the first time the second moment diverges to .
Sketch Proof of Lemma 6.4.
This argument applies different results from [28] to our case. We say that a local solution to (mFl) is strong if the map is integrable on compact subsets of . Applying the results of [28, Theorem 2.1], there exists a unique maximal strong solution to (mFl), which is conservative and that for some constant depending on .
We next apply Corollary 2.2 to see that this solution must be an initial segment of : that is, , and for all . Therefore, the results of [28] will apply to our process .
Since is conservative, we follow the ideas of [28, Proposition 2.7], to obtain the integral relations, for all and ,
[TABLE]
These immediately imply that is bounded on compact subsets of , and in particular does not diverge before . Moreover, since all terms on the right-hand side are nonnegative, these relations imply that all moments and are increasing on
Finally, we show that diverges near . This follows from the time-of-existence estimate quoted above: for , the unique maximal strong solution starting at is precisely , and so for some ,
[TABLE]
This rearranges to show that which diverges as , as claimed. ∎
In order to obtain the full connection of the explosion and gelation times, we modify the setting to exclude the problematic particles identified above. Let
[TABLE]
Note that this state space is preserved under the kernel . Moreover, on the reduced state space , the modified kernel is approximately multiplicative [28] in the sense that, for some and , we have
[TABLE]
for all .
We now construct approximations to which are supported on . Let us fix satisfying Assumption A and ; for any , let be given by specifying, for all bounded measurable functions on ,
[TABLE]
In this way, we shift slightly away from the axes, while also truncating when any becomes large. It follows, from existence and uniqueness, that the solution to (mFl) starting at is supported on for all We can now apply [28, Theorem 2.2] to obtain the connection between gelation and explosion for these solutions:
Lemma 6.5**.**
Let be the solution to (mFl) starting at the measure constructed above. Let be the explosion time of the second moment, as above, and the first time that fails to be conservative. Then .
This then connects the gelation phenomenon to the blowup of the second moment, as desired, but only for the special case of the truncated and shifted initial distribution. We now seek to remove this restriction to obtain the result for the original measures To do this, we will show that and as we take
Lemma 6.6** (Convergence of Gelation Times).**
Let be the measures constructed above, and the corresponding gelation times. Then, as , .
Proof.
First, we recall that are linearly independent in , and hence in , by hypothesis. Using the convergence , it follows that for small enough, and any with , we have . This, in turn, guarantees that are linearly independent in , for all small enough.
We can now apply the explicit characterisation of obtained in Lemma 4.5 for the measures :
[TABLE]
where is the matrix and denotes the largest eigenvalue of a matrix. Moreover, as , the coefficients of the matrices converge to the analagous matrix for the measure .
It is well-known, following for instance from [35], that as the coefficients of a matrix vary continuously, so to do the associated eigenvalues, meaning that
[TABLE]
as . Combining this with the characterisation of above, it follows that
[TABLE]
as desired. ∎
Finally, we show the same result for the explosion times. Thanks to Lemma 6.4 and (76), the matrix of second moments satisfies a closed differential equation, with locally Lipschtiz coefficients, on . We will now show that is exactly the time of existence of a solution started at .
Lemma 6.7**.**
Consider the ordinary differential equations
[TABLE]
[TABLE]
*Then, for all , there exists a unique maximal solution starting at , defined until the time where (Q1) blows up.
Then, for any measure on , the time of existence is exactly the explosion time:*
[TABLE]
Proof.
Firstly, it is straightforward to verify that does not depend on the initial data , since (Q1) only depends on ; in particular, the blowup time is a function only of . It is also straightforward to verify that (Q2) cannot blow up before , since on compact subsets , the coefficients of (Q2) are Lipschitz, uniformly in time. As a result, the time of existence for the pair (Q1, Q2) is exactly the time of existence , as claimed.
To link the explosion times and the time of existence , the equations (76) show that the matrix and the vector solve the system (Q1, Q2) on , which implies that . For the converse, for , we have the equality
[TABLE]
where the initial data are
[TABLE]
The left hand side is bounded on compact subsets of and the right-hand side dominates up to a constant , which leads to a contradiction if we assume that , since as . We therefore have which proves the equality desired. ∎
We will now analyse the pair of equations presented above. This will prove the desired continuity of , and some points which will be helpful for later reference.
Lemma 6.8**.**
Consider the differential equations (Q1, Q2) in the previous lemma, and the sets
[TABLE]
[TABLE]
Then, if , , and similarly if , then . We have the following properties:
- i).
Let be the set
[TABLE]
Then for all , the set is bounded. 2. ii).
Suppose and . Then 3. iii).
Suppose is an open interval, and the map is continuous, and such that for all Then the maps and are continuous on .
Proof.
- i).
Let us first fix . First of all write and let be such that . We now estimate
[TABLE]
This differential inequality may be integrated to obtain
[TABLE]
In particular, this gives the upper bound , which implies the claimed boundedness of in the coordinate whenever .
We will now extend this boundedness to all coordinates when we restrict to . Let be the maximum diagonal entry of :
[TABLE]
and fix where this maximum is attained; by hypothesis on , there exists such that . It is straightforward to see that the derivative is increasing along the solution, which implies the estimate
[TABLE]
By hypothesis, , so . Applying the bound on above, we find that
[TABLE]
Finally, since we chose , we have the uniform bound
[TABLE] 2. ii).
The lower semicontinuity of explosion times is standard, and follows from the continuous dependence on the initial data. Therefore, it is sufficient to prove that
Suppose, for a contradiction, that for some , we have ; by passing to a subsequence, we may assume that for all , where we write . Moreover, since and , we may assume that for all , for some , which implies that for all and all .
Now, if , we have , which implies the containment
[TABLE]
which we know, from item i)., to be bounded: for some ,
[TABLE]
By the lemma of leaving compact sets, there exists such that, for all , However, if we pick , we have , by the continuity of the dependence in the initial conditions, which is a contradiction. Therefore, , which proves the claimed convergence. 3. iii).
Let us first establish the claim for . Firstly, we note that by ii)., the map is continuous on . Therefore, fixing , we may choose choose such that, if , then and . Now, we observe that, for
[TABLE]
As , the first term converges to [math] by continuity of the solution in the initial data ; it is therefore sufficient to control the second term. By the choice of , for all we have
[TABLE]
so that Moreover, by compactness of , there exists some such that for all , and since and these sets are preserved under the flow, we have for all However, we showed in point i). above that that the intersection of these three regions is compact and so there exists a constant : for all , and for all ,
[TABLE]
This implies the bound, for all ,
[TABLE]
which implies the claimed continuity.
The case for is similar. Let us fix ; following the same argument leading to (100), there exists such that, if then and for all , . The equation (Q2) can now be integrated directly to obtain, for ,
[TABLE]
In particular, it follows that is bounded as varies in . With this, the argument for can be modified to prove the same result
∎
We can finally combine the previous lemmas to prove Lemma 6.1.
Proof of Lemma 6.1.
Let us fix satisfying Assumption A, and let be its pushforward ; let and be the solutions to (Fl, mFl) with these starting points, respectively. By Lemma 6.2, is given by and in particular, , and .
From Lemma 6.4, we know that there exists such that is finite, continuous and increasing on , and diverges to infinity as Moreover, thanks to the differential equations (76), all components of are continuous and increasing on .
Consider next the shifted initial data given by (80); thanks to Lemma 6.5, we know that By Lemma 6.6, . For the explosion times, we know from Lemma 6.7 that and , where are the matrixes
[TABLE]
By dominated convergence, ; by hypothesis (A3.), each , so for some . Finally, for all , which certainly satisfies the desired Cauchy-Schwarz inequality , so . A similar argument shows that for all , so Lemma 6.8 shows that . Comparing these two limits, , concluding the proof. ∎
6.2 The Critical Point
Using the concepts introduced above, we next consider the behaviour at and near the critical time .
Lemma 6.9**.**
In the notation of Lemma 6.1, we have
[TABLE]
Proof.
We first show that . Suppose, for a contradiction, that Then, applying [28, Proposition 2.7] as in Lemma 6.4, we see that, for some positive , there exists a strong solution to (Sm), starting at This solution is conservative, so is an initial segment of the solution to (Fl) starting at . By uniqueness in Lemma 2.1,
[TABLE]
By Corollary 5.5, , and by definition of ,
[TABLE]
This contradicts the fact that is strong, which therefore shows that .
The second point follows, because is continuous, and is lower semicontinuous, when is equipped with the vague topology. ∎
6.3 The Supercritical Regime
We finally turn to the supercritical case; our result is as follows.
Lemma 6.10**.**
In the notation of Lemma 6.1, the map is finite and continuous, and therefore locally bounded, on .
The proof is based on a duality argument following Theorem b.13, which connects the measures in the supercritical regime to an auxiliary process in the subcritical case. Let be the random graph processes described in Section 4 with points sampled as a Poisson random measure of intensity ; it is straightforward to see that Assumption B holds. Fix , and let be the graph with the giant component deleted.
Let be the survival function defined in Lemmas 4.7, b.7, and let . By Lemma 2.1, there exists a unique solution to the equation (Fl) starting at ; write for its gelation time.
Let be an enumeration of the vertexes not belonging to the giant component in . By Theorem b.13, we can construct a random graph on ,
In order to appeal to Lemmas 4.4, 5.1, we will now verify that the desired Assumptions A, B hold for the vertex space .
Lemma 6.11**.**
Fix , and let and be as described above. Then Assumption B hold for and
Proof.
To ease notation, we write for , for the initial empirical measure of the unmodified process corresponding to , and for the reduced empirical measure corresponding to :
[TABLE]
It is straightforward to see that inherits the properties in Assumption A from , and so it is sufficient to establish Assumption B.
For (B1.), we note that part of the content of Theorem b.13 is the weak convergence
[TABLE]
Since the vague topology is weaker than the weak topology, we immediately have the vague convergence required. Moreover, by construction, , so it follows from (B1.) that is supported on as required.
We will now show that (B2.) follows from the previous point, together with the moment estimates for the original initial measure .
Fix , and let be such that . We observe that
[TABLE]
for some constant , thanks to the bound in part iv) of the definition (1). We now fix . Thanks to (A2., B2.), is bounded in and , and so we may choose such that the second and third terms are at most with probability exceeding , for all . For this choice of , the first term vanishes as by vague convergence in probability, and so is at most with probability exceeding for all large enough. Therefore, for all such , we have
[TABLE]
which proves the desired convergence in probability.
For the second assertion of (B2.), we note that by the construction of , and is uniformly integrable by the hypothesis (B2.). ∎
We now use this preparatory result to prove Lemma 6.10.
Proof of Lemma 6.10.
Let be as above. Recalling that we consider equality of graphs to include equality of the vertex data, it follows from Theorem b.13 that
[TABLE]
From Lemmas 4.4, 6.11, we obtain the following convergences in probability:
[TABLE]
in the vague topology, in probability. Moreover, the difference
[TABLE]
converges to [math] in the vague topology in probability, since the support is eventually disjoint from any compact set, with high probability. It follows that
[TABLE]
in the vague topology, in probability, and by uniqueness of limits, we have . In particular, it follows that
[TABLE]
Using assumption (A2.), we can see that , and so it follows from Theorem b.13 that the graphs are subcritical. By Lemma 5.1, it follows that that , and so by Lemma 6.1, we have
[TABLE]
Using Theorem b.12 and dominated convergence, the map
[TABLE]
are continuous, and takes values in . Therefore, by the general ODE considerations in Lemma 6.8 point iii)., it follows that the maps
[TABLE]
are finite and continuous on Since , item iii) of Lemma 6.8 shows that the maps are finite and continuous on , which implies that they are bounded on compact subsets. ∎
Remark 6.12**.**
The same argument also shows that is continuous. This fact will be used later in the proof of Lemma 10.4.
7 Representation and Dynamics of the Gel
7.1 Representation Formula
The duality construction used in the proof of Lemma 6.10 gives us a natural way to relate the gel data to the survival function . This is the content of the following lemma.
Lemma 7.1**.**
Let be an initial data satisfying Assumption A, and let be the gel data for the corresponding solution to (Fl). Let be the corresponding survival function defined in Section 4 and Appendix b. Then we have the equality
[TABLE]
In particular, is continuous and if then , and componentwise.
Together with the identification of in Lemma 4.7, this proves part 3 of Theorem 1.
Proof.
We deal with the supercritical and subcritical/critical cases, separately.
1. Supercritical Case .
Let and be as in the proof of Theorem 6.10. Then, since is conservative on , and , we have, for all ,
[TABLE]
As shown in Lemma 6.10, , so we have
[TABLE]
as claimed.
2. Subcritical and Critical Cases .
For , the result is immediate: we have by definition of , and by Theorem b.7. The critical case is identical, recalling from Corollary 5.5 that
Continuity follows from Theorem b.12 by using dominated convergence. For the final claim, if then - almost everywhere, by Lemma b.7. By hypothesis (A3.), for all , on a set of positive measure. Together, these imply that , as claimed. ∎
7.2 Gel Dynamics Beyond the Critical Time
We now obtain point 4 of Theorem 1 as a consequence of the previous results. We have already proven the continuity of on the whole time interval and the finiteness of the second moments in the supercritical regime. Therefore, it is sufficient to prove the following result.
Lemma 7.2**.**
In the notation of Theorem 1, let be the data of the gel associated to . Then, for , we have
[TABLE]
Thanks to the continuity of the second moments above , this has the differential form, holding in the classical sense,
[TABLE]
Remark 7.3**.**
In proving Lemma 7.2, we will split the growth of the gel into two terms , where represents the absorption of particles into the gel, and represents the coagulation of smaller particles. We will show that , giving the claimed result; this may be expected following the relationship between gelation and blowup of the second moment in Lemma 6.1, and the finiteness of in the supercritical regime.
Proof.
We return to the truncated dynamics (Fl, Fl) used in the proof of Lemma 2.1. We recall that, starting at
[TABLE]
the solution to (Fl, Fl) exists and is unique, and we have
[TABLE]
where is the solution to (Fl) starting at , and are the nonzero components of the associated gel data.
Fix such that . Rewriting (Fl) and using that , we have that
[TABLE]
Let us write for the two terms appearing in (126) for ease of notation.
We first show that converges to the expression analagous to the claimed limit in (122). By the monotonicity , and local boundedness in Lemma 6.10, each is bounded, uniformly in and . It is also straightforward to see that the truncated gel data are bounded by , so the integrand appearing in is bounded. Using (125) and bounded convergence, we take the limit to obtain
[TABLE]
We now deal with the second term , which we claim converges to [math]. Expanding the total rate , we have
[TABLE]
The integrand converges to [math] pointwise as , and is dominated by . By Lemma 6.10,
[TABLE]
Therefore, by dominated convergence, as , as claimed. Combining this with the analysis of the first term, we have shown that
[TABLE]
Taking , and using the continuity established in Lemma 7.1, we obtain the claimed result. ∎
8 Uniform Convergence of the Stochastic Coagulant
We now show how previous results, describing the dynamics of , imply convergence to their maximum values as . Using this, we will be able to upgrade the previous result, Lemma 3.1, on the convergence of the stochastic coagulant to uniform convergence.
Lemma 8.1**.**
Let be an initial measure satisfying Assumption A, and let be the gel data for the associated solution to (Fl). As , we have
[TABLE]
for
Proof.
Let us fix , and write for the claimed limit ; it is immediate that for all . Choose and such that . Thanks to Lemma 7.1, , and note also that is increasing, so that this bound holds uniformly in . Applying Lemma 7.2 and taking , we obtain the integral inequality
[TABLE]
where the limit on the left hand side exists since is increasing. Recalling that is bounded, the integral appearing on the right-hand side must converge, and since the integrand is decreasing in , this is only possible if as , as desired.
We must deal separately with , since does not appear in the dynamics explicitly and the argument above does not apply. For this case, we note that the monotonicity whenever implies that converges pointwise to a limit . Using Lemma 7.1 and dominated convergence, we have, for all
[TABLE]
This implies the containment
[TABLE]
for a -null set , for each Taking an intersection, and since by irreducibility (A4.), we see that -almost everywhere. By Lemma 7.1 and dominated convergence again,
[TABLE]
which is the claimed limit. ∎
Lemma 8.2**.**
Fix a measure satisfying Assumption A, and let be the associated solution to (Fl). Let be the stochastic coagulants, with initial data satisfying Assumption B. Then we have the uniform convergence
[TABLE]
in probability.
Proof.
From the definition of the vague topology, it is sufficient to prove that, for any with , we have the uniform convergence in probability.
Fix . By Lemma 8.1, we can find such that Let be the event
[TABLE]
By Lemma 5.3 and condition (B2.), it follows that . On this event, we have
[TABLE]
and the first term converges to [math] in probability by Lemma 3.1.∎
9 Behaviour Near the Critical Point
We now prove item 5 of Theorem 1, concerning the phase transition: we will show that the gel data have nonnegative right-derivatives at the gelation time . We start from the nonlinear fixed point equation (17), which we rewrite as
[TABLE]
The following proof is a modification of the arguments in [5, Theorem 3.17], which itself generalises an analagous, well-known result for the phase transition of Erdős-Réyni graphs.
Lemma 9.1**.**
Suppose that satisfies Assumption A, and let be as in Lemma 4.7. Then is right-differentiable at , and the right-derivative is componentwise positive.
Proof.
Let us equip with the inner product
[TABLE]
which is the pullback of the inner product under , and write for the associated norm. Differentiating under the integral sign twice, and using (A2.), we write
[TABLE]
where is the matrix found in Lemma 4.5, is a quadratic term, and is a remainder:
[TABLE]
The signs here are chosen to guarantee that, if , then , and is self-adjoint with respect to . We also recall from Lemma 4.5 that the largest eigenvalue of is precisely , and the corresponding eigenspace is 1-dimensional. Let be an associated eigenvector, scaled so that . We note that is an eigenfunction of , and in particular, the sign of can be chosen so that is strictly positive -almost everywhere; using (48) it follows that for all From Lemma 4.7, Theorem b.8 and Theorem b.12, we know that , that for all , and that is continuous at
Let us write for the orthogonal compliment of with respect to . Since is exactly the eigenspace , it follows from the self-adjointness of that maps into itself, and that, for small enough, is invertible, and that the operator norm is bounded as .
Let be the orthogonal projection onto with respect to , and write so that we have the orthogonal decomposition
[TABLE]
for some . Noting that , it follows from (139, 145) that
[TABLE]
The function is of quadratic growth as , and using the invertibility of described above, it follows that there exists such that whenever . In turn, it follows that as Now, using (139) and the self-adjointness of , we obtain
[TABLE]
We now expand to second order in ; for clarity, we will number the error terms Since , it follows that that and that . Expanding using (145),
[TABLE]
It therefore follows that
[TABLE]
For small enough, , and we may rearrange to find
[TABLE]
and in particular as , since
[TABLE]
Finally, we obtain
[TABLE]
The calculations above show that , and the claimed right-differentiability now follows. Finally, since is strictly positive componentwise and , it follows that componentwise. ∎
We now show how this implies item 5 of Theorem 1. From Lemmas 4.7, 7.1, we have, for all
[TABLE]
Differentiating under the integral sign using hypothesis (A2.), we obtain
[TABLE]
In the notation of the previous lemma, we see that for ,
[TABLE]
which proves the desired right-differentiability. For the positivity, since all components of are strictly positive, we have the lower bound for
[TABLE]
A similar argument holds for the component.
Finally, we address the size-biasing effect. We wish to choose a convex combination such that
[TABLE]
Thanks to the calculation above, this is equivalent to proving that
[TABLE]
If we choose , then these follow from the Cauchy-Schwarz inequality
[TABLE]
We recall that the linear combination is an eigenfunction of , and so can only be constant -almost everywhere if is constant. In particular, if is not constant -almost everywhere, the inequality (159) is strict, and hence so is (157), as desired.
10 Convergence of the Gel
We now prove the remaining part of Theorem 2, concerning the uniform convergence of the stochastic gel, drawing on other results we have proven. We recall that are the data of the largest particle in the stochastic coagulant ; to conclude the proof of Theorem 2, we must extend Lemma 5.3, to show uniform convergence in time, in probability.
Throughout this section, let be an initial measure satisfying Assumption A, and be stochastic coagulants satisfying Assumption B for this choice of . We will also let be random graphs coupled to as described in Section 4, so that is the data of the largest component in .
This subsection is structured as follows. We recall that, in the proof of Lemma 5.3, we used the result on mesoscopic clusters from [5]: if and , then for all ,
[TABLE]
in probability. We will first state a lemma which extends this convergence to be uniform in time. Equipped with this lemma, and previous results, we will show how the proof of Lemma 5.3 can be modified to establish uniform convergence, and prove the analagous result when we sum over all clusters exceeding a deterministic size Finally, we return to prove the preliminary lemma.
The key lemma which we will require is the following, which generalises the result of Bollobás et al. recalled in Lemma b.11.
Lemma 10.1**.**
Let be as above, and let be any sequence such that , Then we have the uniform estimate
[TABLE]
The proof of this lemma will be deferred until Subsection 10.2
10.1 Proof of Theorem 2
It remains to prove that the convergence of the stochastic approximations , to the gel, given by the gel data of the largest cluster, and of all clusters exceeding a certain scale respectively. This is the content of the following two lemmas.
Lemma 10.2**.**
In the notation above, we have the uniform convergence
[TABLE]
Lemma 10.3**.**
Fix a sequence such that and , and let be given by
[TABLE]
Then
[TABLE]
We now prove these two lemmas, looking primarily at the coordinate. The other coordinates follow, with minor modifications which will be discussed later.
Proof of Lemma 10.2.
This is an extension of the proof of Lemma 5.3, from where much of the notation is taken. We deal first with the coordinate . Let be a fast-growing sequence such that in the notation of Lemma 5.4, and let be as in Lemma 5.3. Let also be a sequence, to be constructed later, such that
[TABLE]
and write . We recall also the decomposition (65)
[TABLE]
where the definitions of the error terms are given in (65). The bounds obtained on in the proof of Lemma 5.3 are already uniform in time; we will now show how the previous proof can be modified to estimate the other terms uniformly in time.
1. Estimate on
is the nonrandom error . The estimate in Lemma 5.3 shows that for each fixed . The maps , are both continuous on , by the definition of the Flory dynamics (Fl) and Lemma 7.1 respectively. Let us extend both of these maps to by defining both to be [math] at ; the extensions are continuous, by Lemma 8.1. Therefore, by Dini’s theorem, it follows that uniformly, which implies that as desired.
2. Estimate on .
As in (68), we have the equality, for all
[TABLE]
where we have used the coupling of the random graphs to the stochastic coagulant. Therefore, we have the uniform bound
[TABLE]
which converges to [math], by Lemma 10.1, (B2.), and because
3. Construction of , and convergence of .
To conclude the proof of the supercritical case, it remains to show how a sequence can be constructed such that uniformly, in probability. Recalling the definitions of above, let be the events
[TABLE]
Then, as with fixed, by Lemma 8.2. We now define inductively for inductively, as in Lemma 5.3, by setting and letting be the minimal such that, for all ,
[TABLE]
Now, we set for It follows that satisfies the requirements above, and
[TABLE]
Therefore, with this choice of , uniformly in probability on
This concludes the proof for the coordinate ; the - coordinates are identical. For the remaining coordinates, we replace by , which makes identically [math] by symmetry, and use the bound in estimating . ∎
Proof of Lemma 10.3.
We now turn to the case where, instead of considering the largest cluster, we sum over the (possibly empty) set of clusters of size at least , for a deterministic sequence In this way, we have
[TABLE]
Let us write , so that With this notation,
[TABLE]
is exactly the term estimated in the proofs of Lemma 5.3, 10.2, for the new choice of . The estimate (168) therefore applies to bound , and the hypotheses on are sufficient to guarantee that the right-hand side converges to [math] in probability. ∎
10.2 Proof of Lemma 10.1
We now turn to the proof of Lemma 10.1; our strategy is as follows. First, we prove uniform convergence on compact subsets in Lemma 10.4. We will then show how this may be extended to the whole interval , by arguing separately for an initial interval and for large times
Lemma 10.4**.**
Let and be as above. Fix a compact subset . Then we have the convergence
[TABLE]
Proof of Lemma 10.4.
It is sufficient to show that for every the claim holds for some of the form containing . As in Theorem 6.10, let be the measure on given by . We also write for the gelation time of the solution to (Fl) starting at . We showed in the proof of Theorem 6.10 that, for all , , and the map is continuous. Therefore, for any , we can choose such that
[TABLE]
We form from by deleting all vertexes of the giant component of . We now form a new graph, by including all edges between vertexes of which are present in the graph .
From Theorem b.13 and Lemma 6.11, we can construct a sequence satisfying Assumption B for and random graphs , such that
[TABLE]
We now form from by adding those edges present in . By the Markov property of the graph process , these edges are independent of the construction of , and so .
Since Assumption B applies to and , Lemma 5.1 shows that the critical time for is exactly the gelation time of , which we have written as . By the choices of , , and in particular, is still subcritical. By construction,
[TABLE]
For , let be the connected component of which contains , and let be its size. By definition, and so
[TABLE]
Moreover, the right-hand side is increasing as runs over , since it can be rewritten as
[TABLE]
and each summand can only increase in as the clusters grow. Evaluating at the endpoint , the construction of gives
[TABLE]
Combining (177, 178, 180) we see that, with high probability,
[TABLE]
The first term of the right-hand side converges to [math] in probability because is subcritical, and the second term converges to [math] in probability by Theorem b.11. ∎
Proof of Lemma 10.1.
For as in the hypothesis, let be the mass of the gel associated to the solution to (Fl). Fix ; without loss of generality, assume that By continuity from Lemma 7.1 and Lemma 8.1, we can choose such that
[TABLE]
Consider now the events
[TABLE]
[TABLE]
Thanks to the coupling described in Section 4, Lemma 5.3 implies that , and from Theorem b.11. On the event , we bound as follows.
- i).
For the initial interval , an argument similar to that of Lemma 10.4 shows that, on this event,
[TABLE] 2. ii).
For late times , the largest cluster is at least the size of the cluster containing . Therefore,
[TABLE]
and so
[TABLE]
Now, consider the events
[TABLE]
[TABLE]
By Lemma 10.4, , and so . On the event , we have
[TABLE]
which proves the claimed convergence in probability. ∎
Appendix a Weak Formulation of Smoluchowski and Flory Equations
Throughout, we work with the weak formulation of the Smoluchowski and Flory equations described in the introduction. In order to make sense of every term for a putative solution , we ask for the following conditions to hold.
- i).
For all Borel sets , the map is measurable; 2. ii).
For all bounded, measurable functions of compact support, ; 3. iii).
For all compact subsets and all ,
[TABLE]
If these hold, then we say can make sense of the following weak form of the Smoluchowski equation (Sm).
- iv).
For all and ,
[TABLE]
Appendix b Introduction to Inhomogenous Random Graphs
As discussed in the introduction, the connection between gelation and random graphs is well-understood, and the multiplicative kernel corresponds to the well-known Erdős-Réyni random graphs [11, 9, 2]. However, for our purposes, not all particles are equal: particles with large values of will undergo more collisions and exhibit quantitatively different behaviour, and so we will need a more sophisticated model of random graphs to accommodate this inhomogeneity. In this section, we will review the theory of inhomogenous random graphs developed in [5], which will play the same rôle for our model that the Erdős-Réyni model does for the multiplicative kernel. We now summarise the key definitions and results from [5] which we use in our work.
Definition b.1**.**
A generalised vertex space is a triple , consisting of
- •
A separable metric space , equipped with its Borel -algebra;
- •
A measure on , with ;
- •
A family of random variables taking values in , and of potentially random length , such that the empirical measures
[TABLE]
converge to in the weak topology , in probability.
In the special case where and , we say that is a vertex space.
Definition b.2**.**
A kernel is a symmetric, measurable map We say that is irreducible if, whenever is such that for all and , then either or .
Definition b.3** (Inhomogenous random graphs).**
Given a kernel and a generalised vertex space , we let be a random graph on given as follows. Conditional on the values of , the edge is included with probability
[TABLE]
and such that the presence of different edges is (conditionally) independent. We write . We also consider the vertex data to be part of the data of , so that an equality of random graphs includes the equality of the vertex data.
Remark b.4**.**
This differs slightly from the main definition in [5], but is rather one of the alternatives considered in [5][Remark 2.4]
To treat a general class of kernels , additional regularity is required, to prevent pathologies. This is the content of the following defintion:
Definition b.5** (Graphical Kernel).**
We say that a kernel on a vertex space is graphical if the following hold.
- i).
* is almost everywhere continuous on * 2. ii).
; 3. iii).
If , then
[TABLE]
where denotes the number of edges of the graph.
Definition b.6**.**
Given a graph , we write for the connected components of , in decreasing order of their sizes . If there are fewer than connected components, then and .
The phase transition is given in terms of the convolution operator
[TABLE]
for functions such that the right-hand side is defined (i.e., finite or ) for -almost all ; for instance, if then is well-defined, possibly taking the value . We define
[TABLE]
If defines a bounded linear map from to itself, then is precisely its operator norm in this setting; otherwise, It is straightforward to show that if then is a Hilbert-Schmidt operator, and that . In this case, is certainly finite, and is the operator norm of . The example of interest to us will fall into this case.
The analysis of the random graphs uses a branching process, similar to that used in the standard analysis of Erdős-Rényi graphs. Many quantities of the graph can be expressed in terms of the ‘survival probability’ when the data of the first vertex is given. To avoid the unnecessary complication of making this into a precise definition, we use the following characterisation, which is equivalent by [5, Theorem 6.2].
Theorem b.7**.**
Let be an irreducible kernel on a generalised vertex space , such that , and such that, for all
[TABLE]
Consider the nonlinear fixed-point equation
[TABLE]
where is the convolution operator (42). Then (199) has a maximal solution ; that is, for any other solution ,
[TABLE]
It therefore follows that for all . The maximal solution is necessarily unique, and so this uniquely defines Moreover, we have the following dichotomy:
- i).
If , then for all ; 2. ii).
If , then for all -almost all .
This can be stated dynamically as follows. Consider the survival function ‘at time ’, given by , which we will write throughout as . Then
- •
If , then for all ;
- •
If , then for all .
We can now state the main results on the phase transition, given by [5, Theorem 3.1 and Corollary 3.2].
Theorem b.8** (Phase Transition).**
Let be a graphical and irreducible kernel for a vertex space , with Let be random graphs on a common probability space. Then we have the convergence
[TABLE]
Therefore, if is a dynamic family of random graphs , then we have the following dichotomy:
- i).
If , then there is no giant component, in particular
[TABLE]
in probability. 2. ii).
If , then there is a giant component: there exists such that
[TABLE]
Remark b.9**.**
Following [5], based on this dichotomy, we say that
- i).
* is subcritical if * 2. ii).
* is critical if * 3. iii).
* is supercritical if *
The next result characterises in terms of the point spectrum as an operator on , and appears as [5, Lemma 5.15]
Theorem b.10** (Spectrum of ).**
Let be a generalised vertex space and be a graphical, irreducible kernel on such that . Then the operator defined in (42) has an eigenvalue in , and the corresponding eigenspace is 1-dimensional. Moreover, there exists an eigenfunction such that -almost everywhere.
The third result we will recall is [5, Theorem 3.6], which considers clusters of a scale , excluding the largest cluster. We term these mesoscopic clusters.
Theorem b.11**.**
Let , for a (generalised) vertex space and an irreducible graphical kernel . Let be a sequence with
[TABLE]
Then
[TABLE]
in probability.
We will also make use of the following monotonicity and continuity properties, from [5, Theorem 6.4].
Theorem b.12**.**
Let be a kernel on a vertex space , and let be the survival function defined above. Then the map is monotonically increasing, in the sense that for all and for all , We also have the following continuity property. Let be a monotone sequence, either increasing or decreasing. Then
[TABLE]
[TABLE]
The final result which we will need is a ‘duality’ result, connecting the supercritical and subcritical behaviours. This is given by [5, Theorem 12.1].
Theorem b.13**.**
Let be an irreducible graphical kernel on a generalised vertex space , such that . Let , and form by deleting all vertexes in the largest component Then, defined on the same underlying probability space, there is a generalised vertex space with
[TABLE]
and such that is an enumeration of those not belonging to the component , and a random graph such that
[TABLE]
Furthermore, if , then is subcritical.
We emphasise here that we have defined the equality to include equality of the values associated to each vertex; this follows from the construction in [5], since the values associated to are exactly those not belonging to the giant component. This generalises the standard ‘duality result’ of Bollobás [3] for Erdős-Rényi graphs.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Aldous, D., The Incipient Giant Component in Bond Percolation on General Finite Weighted graphs, Electronic Communications in Probability, 21, paper 68 (2016).
- 2[2] Aldous, D.J., Deterministic and Stochastic Models for Coalescence (Aggregation and Coagulation): a Review of the Mean-Field Theory for Probabilists, Bernoulli, 5(1), pp.3-48 (1999).
- 3[3] Bollobás, B., The Evolution of Random Graphs, Transactions of the American Mathematical Society, 286(1), pp.257-274 (1984).
- 4[4] Bollobás, B., Random graphs (No. 73), Cambridge University Press, Cambridge (2001).
- 5[5] Bollobás, B., Janson, S. and Riordan, O., The Phase transition in Inhomogeneous Random Graphs, Random Structures & Algorithms, 31(1), pp.3-122 (2007).
- 6[6] Boltzmann, L., Vorlesungen über Gastheorie (Vol. 1). JA Barth, Leipzig (1896).
- 7[7] Buffet, E. and Pulé, J. V., Polymers and Random Graphs, Journal of Statistical Physics, 64, pp.87–110 (1991).
- 8[8] Darling, R.W.R. and Norris, J.R., Differential Equation Approximations for Markov Chains. Probability surveys, 5, pp.37-79 (2008).
