<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>On a Linear Polymerisation Process</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Sergei Zuyev</string-name>
          <email>sergei.zuyev@chalmers.se</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Chalmers University of Technology and University of Gothenburg, Department of Mathematical Sciences</institution>
          ,
          <addr-line>412 96 Gothenburg</addr-line>
          ,
          <country country="SE">Sweden</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>We consider a Markov fusion-disaggregation process of `molecules' which are linear arrangements of `atoms'. Molecules may fuse at the ending atoms by creating a bond in between at a given rate. Each bond joining two atoms in a molecule can break so that a molecule disaggregates into two shorter molecules at another rate. We give en explicit expression for the stationary distribution of the number of molecules and the conditional distribution of their lengths given their number. We show an asymptotic normality of the distribution of the number of molecules when the number of atoms in the system grows.</p>
      </abstract>
      <kwd-group>
        <kwd>Fusion-Disaggregation Process</kwd>
        <kwd>Distribution</kwd>
        <kwd>Markov Chain</kwd>
        <kwd>Reversibility</kwd>
        <kwd>Stationary</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>The model we consider in this article has origins in colloidal chemistry. Colloid
is a mixture of molecules which stay evenly dispersed in the volume neither
settling to the botton nor oating to the surface of the container. Although the
geometry of molecules can be rather complex, some materials, like lacquers, have
long chains of atoms in a linear molecules which combine to form a net when the
lacquer sets. The molecule bonds may also break causing emergence of shorter
molecules, this is the main mechanism of degradation of the material. The two
competing mechanisms: fusion and disaggregation compete with each other and
should be in balance in a stable system.</p>
      <p>To mathematically model a colloid with linear molecules, we consider a
system consisting of N elements called atoms. n 2 atoms may form a molecule
of size n (or an n-molecule) which is a linearly arranged set of atoms linked by
bonds. We will also call a singular atom a 1-molecule.</p>
      <p>Time evolution of the system is described by a homogeneous continuous time
Markov chain (MC) determined by two competing processes: fusion (or
clustering) and disaggregation (or severance). Two molecules close to each other may
combine by creating a bond between terminal atoms. Ignoring spatial
considerations, each n-molecule fuses to an r molecule at rate to form an n + r molecule.
In other words, each pair of molecules fuses at the rate 2 &gt; 0 independently of
their sizes. Each bond breaks with the rate 1, so that an n-molecule disaggregates
to two shorter molecules at rate n 1.</p>
      <p>It is clear that the longer molecule is, the more bonds it contains, the more
is its rate of disaggregation. On the other hand, the more molecules are in the
system, the more is the number of their terminal atoms which may fuse, so the
two competing mechanisms should balance each other in the long run leading to
a stationary distribution. Since the system is nite, the stationary distribution
is also its asymptotic distribution which we aim to characterise.</p>
      <p>The similar (and even more general) model has been considered by Frank
Kelly who obtained a product form of the stationary distribution [3, Th.8.1].
Unfortunately, no details on how the expression was obtained is given there, the
proof consists in just checking that the solution satis es the so-called Detailed
Balance Equations which is a necessary and su cient condition for the
reversibility of the corresponding Markov chain. In this short article, we ll this gap by
explicitly describing a procedure which can be used to establish reversibility
and complement Kelly's result with nding exact asymptotics of the stationary
distribution when the number of atoms in the system grows.</p>
      <p>In the next section we give the necessary de nitions and describe the model
we are working with. In Section 3 we nd an explicit expression for the stationary
distribution of the model and then study its asymptotic properties when the
number of atoms grows in Section 4.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Markov Model and Reversibility</title>
      <p>The states of the system can be described by a vector n = (n1; n2; : : : ; nN ),
PN</p>
      <p>k=1 knk = N with nk being the number of k-molecules in the system. Let
X(t); t 0 denotes the corresponding MC in this state space and ek stands
for the k-th coordinate vector of RN . If is the time of the rst change of the
system state, then X( ) X(0) with positive probability may assume only the
following values:
1. vij = ei ej + ei+j ; i 6= j, when two unequal size i- and j- molecules fuse.</p>
      <p>The intensity of this jump is 2 ninj .
2. vii = 2ei +e2i, when two i-molecules fuse. The intensity is then ni(ni 1).
3. vij ; i 6= j, when an i + j-molecule breaks into two uneven parts. There are
two bonds in each i+j-molecule which breaking results in i- and j-molecules,
so the intensity of this transition is 2ni+j .
4. vii, when a 2i-molecule breaks in the middle into two i-molecules, the
intensity of this is n2i.</p>
      <p>Not all these transitions are possible from all the states: the ones which would
lead to negative values of any coordinate are forbidden.</p>
      <p>Obviously, any state of the system is attainable from any other state by a
sequence of positive-intensity jumps: for instance, by disaggregating to singular
atoms and then fusing to the other con guration. This means the associated MC
is irreducible and hence geometrically ergodic, i.e. there exists a unique
stationary distribution to which convergence of the distribution at a time t happens
exponentially fast whatever is the starting state X(0), see, e.g., [2].</p>
      <p>An important property some MCs possess is time reversibility. Recall that
a continuous time irreducible MC X(t) with states f1; 2; 3; : : : g and transition
rates q(i; j) is called reversible if (X(t1); : : : ; X(tn)) has the same distribution as
(X(t0 t1); : : : ; X(t0 tn)) for all t0; t1; : : : ; tn. Then X(t0 t) is a distributional
copy of X(t), hence the name.</p>
      <p>A MC is reversible if and only if there is a probability distribution ( (i))
such that the following Detailed Balance Equations are satis ed for all pairs of
states i; j:</p>
      <p>(i)q(i; j) = (j)q(j; i);
see, e.g., [3, Th. 1.2]. Such ( (i)) is then the stationary distribution of the MC.</p>
      <p>
        The Kolmogorov's criterion of reversibility states that MC is reversible if
and only if for any cyclic sequence of states i; i1; i2; : : : ; in; i, the product of the
transition intensities on one and opposite directions coincide:
q(i; i1)q(i1; i2) : : : q(in; i) = q(i; in)q(in; in 1) : : : q(i1; i);
(
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
see, e.g., [3, Th. 1.8]. Both (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) and (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) allow to express the stationary distribution
of a reversible MC in the form:
      </p>
      <p>q(i0; i1)q(ii; i2) : : : q(in; j)
(j) = (i0) q(j; in)q(in; in 1) : : : q(i1; i0)
for any chosen state i0 and a sequence of states (a path) i0; i1; : : : ; in; j for which
the product of the intensities above is non-zero. The value of (i0) itself is then
found from normalisation: Pj (j) = 1.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Stationary Distribution</title>
      <p>
        In this section we give a closed form expression for the stationary distribution of
the MC modelling the molecular system described in the previous section. For
this, we rst establish that the MC is reversible. Property (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) is hard to check.
Instead, we evaluate expressions (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) and see if the obtained sequence ( (j))
satis es the detailed balance equations (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ). Then the MC is reversible and such
( (j)) is its stationary distribution. This the way we prove the main result of
this section.
      </p>
      <sec id="sec-3-1">
        <title>Theorem 1. The Markov chain describing evolution of the system of N atoms</title>
        <p>is reversible. Its stationary distribution satis es, for n0 = (N; 0; : : : ; 0),
(n) = (n0) L(n)</p>
        <p>N !
Qk 1 nk!
;
where L(n) = Pk 2(k</p>
      </sec>
      <sec id="sec-3-2">
        <title>1)nk is the number of links in the state n.</title>
        <p>
          Proof. Take the state n0 = (N; 0; : : : ; 0), where all atoms are separated, to
express the probability of all other states in the form of (
          <xref ref-type="bibr" rid="ref3">3</xref>
          ). We choose the
following path to reach a state n = (n1; : : : ; nN ) 6= n0 from n0. Let m; m 2 be
(
          <xref ref-type="bibr" rid="ref1">1</xref>
          )
(
          <xref ref-type="bibr" rid="ref3">3</xref>
          )
(
          <xref ref-type="bibr" rid="ref4">4</xref>
          )
the length of the longest molecule in n, i.e. all nm+1 = = nN = 0. At rst,
the atoms join one by one to create an m-molecule, then, if nm &gt; 1, the second
m-molecule, the third, etc., until all m-molecules are created. Then it comes the
turn of m 1-molecules (or the next smaller size molecules if nm 1 = 0 until
all the molecules of that size are created. Then, the next smaller size molecules,
etc., until all k-molecules, k 2, are created. n1 = n0 2e1 + e2. The next
one is n2 = n0 e1 e2 + e3 and so on. The state with one m-molecule is
obtained by adding e1 em 1 + em to the previous state. This creation process
is exempli ed on Figure 1. Each state can be represented uniquely as an array
of segments representing molecules spanning the grid points f1; 2; : : : ; N g. The
k-molecules are represented by disjoint segments [j; j + m 1] arranged by their
size, the longest on the left.
        </p>
        <p>The rate at which the rst link is established is N (N 1) since there are
N2 pairs of atoms in con guration (N; 0; : : : ; 0) and each pair joins at rate 2 .
The next atom joins the newly formed 2-molecule at the rate 2 (N 2), the
next one at the rate 2 (N 3) and so on, the last atom to complete the rst
m-molecule joins at the rate 2 (N m + 1). Now there are N m separate
atoms in the system and one m-molecule. The product of the intensities of all
the above steps is then
2m 2 m 1N (N</p>
        <p>Now there are N mnm atoms in the system and the construction of (m
1)molecules proceed similarly. Once all k-molecules for k 3 are created, there
are N 0 = N Pk 3 knk atoms. The rst 2-molecule is created with intensity</p>
        <p>N 0(N 0 1), the second { (N 0 2)(N 0 3) etc. until the last n2-nd one with
intensity (N 0 2(n2 1))(N 0 2(n2 1) 1). The product of intensities of the
transitions involving creation of all 2-molecules is thus
n2</p>
        <p>N 0!
This gives the following product of the intensities of all the transitions from n0
to n:
2Pk 3(k 2)nk Pk 2(k 1)nk N ! = 2I(n) L(n) N ! ; (5)
n1! n1!
where I(n) = Pk 3(k 2)nk is the number of inner atoms (i.e. connected to
two other atoms in the molecules) and L(n) = Pk 2(k 1)nk is the number of
links.</p>
        <p>The reversed moving along the same path consists, rst, in one of n2
2molecules to break if n2 1. This happens at the rate n2, because there are
that many links in all 2-molecules. The next 2-molecule breaks at the rate n2 1,
etc. The last one breaks at the rate 1, so that the product of intensities of all
these breaks is n2!. If n3 1, the next step is a link of a 3-molecule to break,
this happens at rate 2n3, and then the second link of the same, now 2-molecule,
breaks at rate 1. Now the number of 3-molecules in the system is decreased by
one, so if there are still 3-molecules, the next one disintegrates into single atoms
at rate 2(n3 1). Thus, the product of intensities of the steps from n to the state
where all 2- and 3-molecules are disintegrated into atoms equals n2! 2n3 n3!. After
all the molecules of the sizes smaller than k have disintegrated into single atoms,
the rst link in a k-molecule breaks at rate (k 1)nk, the second link in the same
molecule breaks at rate 2 (since there are two ends) and so on until the last one
breaks at rate 1. So the rst disintegrated k-molecule contributes 2k 2nk to the
product of intensities. Similarly, the second contributes 2k 2(nk 1) and so on.
Hence, the product of the intensities of all the steps from n back to n0 is given
by</p>
        <p>Y 2nk(k 2)nk! = 2I(n) Y nk! :
This allows us to de ne the quantities
(n) = (n0) 2I(n) Q</p>
        <p>N !
which is true. Similarly one can easily verify that for transition n $ n + vii, the
detailed balance equation
(n) ni(ni</p>
        <p>
          1) = (n + vii) (n2i + 1)
also holds. Thus by [3, Th. 1.2], the Markov chain is reversible and its stationary
distribution is given by (
          <xref ref-type="bibr" rid="ref4">4</xref>
          ).
        </p>
        <p>Corollary 1 Denote by M (n) = Pk nk the total number of molecules (including
atoms) in the state n. Under the stationary regime, the probability mass function
(p.m.f.) of M is given by
(M (n) = m) = Z 1( ; N )
;</p>
        <p>m = 1; : : : ; N;
m
m!
where Ln(x) is the generalised Laguerre polynomial of degree n, see, e.g., [4].</p>
      </sec>
      <sec id="sec-3-3">
        <title>The distribution is unimodal with the mode at the point</title>
        <p>m =
&amp; (1 + ) + p(1 + )2 + 4 N '
2
O(pN= ) as N ! 1:</p>
      </sec>
      <sec id="sec-3-4">
        <title>Its Laplace transform is</title>
        <p>LM (t) = E e tM =
=
e tL1N 1( e t= ))</p>
        <p>The p.m.f. of the number M of molecules under the stationary regime are shown
on Figure 2.</p>
        <p>0
20
40
60
80
100
0
100
300
400</p>
        <p>
          Proof. Taking into account that Pk knk = N , expression (
          <xref ref-type="bibr" rid="ref4">4</xref>
          ) gives that
(M (n) = m) = (n0) N m
(13)
        </p>
        <p>X
n: Pk nk=m
Pk knk=N</p>
        <p>N !</p>
        <p>:
Qk nk!
Assume the system contains exactly m molecules. Number them all somehow
from 1 to m and let (l1; : : : ; lm) be their sizes. If we represent each k-molecule
by a closed segment of length k 1, then they can be put from left to right
starting from the rst to the last segment disjointly on [1; N ] so that each
kmolecule spans exactly k integer points, like on Figure 1, but not ordered by
their lengths, but by their number. Since Pk knk = N , all the integer points of
[1; N ] are covered and there are exactly m 1 open segments of the form (i; i + 1)
which separate the molecules. Thus all the sequences (l1; : : : ; lm) of the sizes of
ordered molecules can be obtained by throwing away m 1 open unit segments
out of total N 1 of [1; N ] n N, so there are mN 11 of these.</p>
        <p>Alternatively, the sequences (l1; : : : ; lm); li 1 satisfying Pim=1 li = N can
be produced from n = (n1; n2; : : : ) satisfying Pk nk = m; Pk knk = N by
assigning n1 1's, n2 2's, etc. to places 1; : : : ; m, so that each such n generates
the multinomial number m!= Qk nk! of such distinct sequences. Therefore,</p>
        <p>X
The normalising condition PNm=1 (M (n) = m) = 1 allows to express
that gives for M (n) distribution (8) after cancelling out N ! N .</p>
        <p>Notice that
(M (n) = m + 1) =</p>
        <p>(M (n) = m):
N m
m(m + 1)
The multiplicative coe cient given by the fraction is monotonely decreasing and
becomes less than 1 for m = m as in (10). Thus the distribution is unimodal.</p>
        <p>The expression for the Laplace transform is immediate from (9) and hence
the moments follow from its Taylor expansion at t = 0.</p>
        <p>
          The obtained expression (14) for (n0) plugged into (
          <xref ref-type="bibr" rid="ref4">4</xref>
          ) together with the
distribution (8) leads to the main result of this section:
        </p>
      </sec>
      <sec id="sec-3-5">
        <title>Theorem 2. The stationary distribution is given by</title>
        <p>(n) = Z 1( ; N ) Qk nk!</p>
        <p>M(n)
(14)
(15)
with Z( ; N ) as in (9). The conditional distribution of the molecule lengths given
their total number is
(n</p>
        <p>M (n) = m) =</p>
        <p>m!
N 1 Qk nk!
m 1
=</p>
        <p>m
n1;:::;nN</p>
        <p>N 1
m 1
which is the symmetric Multinomial distribution Mult(m; N 1; : : : ; N 1)
conditioned on the set fn : Pk knk = N g.
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Asymptotic Distribution for Molecule Number</title>
      <p>In this section we consider the limit distributions for the system when the number
N of molecules grow. In the previous section we expressed the Laplace transform
of the stationary distribution of the total number M = MN of molecules in the
system with N atoms in terms of the generalised Laguerre polynomials. In [1],
the following asymptotics in n for xed parameters and z was obtained:
Ln( z) =
e z=2
2p
Introduce aN = pN z = pN= and denote
(16)
(17)
: (18)
For the Laplace transform of N we have the identity</p>
      <p>N =</p>
      <p>MN
paN =2
aN</p>
      <p>:
L N (t) = etp2aN LMN</p>
      <p>t
paN =2
and it is straightforward to check using (18) that limN!1 L N (t) = t2=2. Thus
we have proved the following Central limit theorem:</p>
      <sec id="sec-4-1">
        <title>Theorem 3. The stationary distributions of the number MN of molecules in</title>
        <p>the system with N atoms when properly centred and scaled weakly converge to
the standard Normal law:</p>
        <p>MN</p>
        <p>aN =) N (0; 1);
paN =2
where aN = pN= .</p>
        <p>(19)
Note that from (12) and (17), both E MN and var Mn under the stationary
regime have order of pN= , so the centering and scaling in (19) is as could be
expected.</p>
        <p>Using the standard methods, a local limit theorem can also be established
which we give without a proof, see illustrative Figure 3:
.....1020000304 ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● N●● =λ●1●=●05●^●● 6●● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ●
−3 −2 −1 1 2 3</p>
        <p>Theorem 4. The value (MN = m) for m = O(pN ) is approximated when
N ! 1 by the density of the Normal N (aN ; aN =2) distribution, where aN =
pN= , i.e.</p>
        <p>(MN = m) = p 1aN exp n
(m</p>
        <p>aN )2 o
aN
+ o(N 1=4):
(20)
5</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Discussion</title>
      <p>The model we considered in this paper allows for generalisation in various
directions. First of all, the linear structure of the molecules we impose can be dropped,
instead, terminal atoms to where the molecules can attach (the molecule
endpoints as now) may be de ned, possibly of varying accommodation capacities, see
[3, Sec. 8]. It is interesting if explicit expressions and the asymptotic behaviour
can also be established for the stationary distribution in these cases.</p>
      <p>Another direction is to allow some molecules to disappear and to come into
the system. This could model the di usion, its parameters, for instance, may
depend on the molecule size. One may expect a Poisson distribution to appear
in the stationary regime in such an open system, as in [3, Th. 8.2].</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgement</title>
      <p>The author thanks his Master students: Lydia Andersson, Karin Furufors,
Jessica Gilmsjoe and Emelie Loof, for the simulation studies which con rmed the
theoretical results reported here.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Borwein</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Borwein</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Crandall</surname>
          </string-name>
          , R.:
          <article-title>E ective Laguerre asymptotics</article-title>
          .
          <source>SIAM J. Number. Anal</source>
          .
          <volume>46</volume>
          (
          <issue>6</issue>
          ),
          <volume>3285</volume>
          {
          <fpage>3312</fpage>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Diaconis</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Miclo</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>On quantitative convergence to quasi-stationarity</article-title>
          . Ann. Fac. Sci. Toulouse Math.
          <volume>24</volume>
          (
          <issue>4</issue>
          ),
          <volume>973</volume>
          {
          <fpage>1016</fpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Kelly</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Reversibility and stochastic networks</article-title>
          . Cambridge University Press (
          <year>1979</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Rusev</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Classical orthogonal polynomials and their associated functions in complex domain</article-title>
          .
          <source>Mann Drinov Academic Publishing House, So</source>
          a (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>