A simple stochastic kinetic transport model. (English) Zbl 1264.60053

The authors propose to connect a stochastic single-particle model to the well-known deterministic model which describes this process by a pair of partial differential equations (PDEs). Thus they consider a mathematical model for the displacement of a solute through a medium which apart from a constant flow (advection) and a dispersion (diffusion) interacts with the medium by intermittent adsorption (the kinetics).
The paper is organized into 8 sections.
After an Introduction, in Section 2, the deterministic reactive transport model characterized by a pair of PDEs is introduced.
Then, in the next section, the behaviour of a single particle in the solute is described; and, in Section 4, the probability generating functions of the Markov binomial distribution which was described in the previous section is calculated.
Based on these, in Section 5, the convergence of the simple discrete-time stochastic model by letting the time step go to 0 is discussed.
In Section 6, it is shown that, in the case of instantaneous injection of the solute, the partial probability densities of the free and adsorbed parts of the solute do satisfy the PDEs defined in Section 2.
The means and variances of the established stochastic reactive transport model are computed in Section 7. In this sense, the authors mention that they obtain a correct formula for the free case in Proposition 7.2 (making reference to some results obtained previously by other authors).
The probability density function of the proposed stochastic reactive transport model is studied in Section 8. Remarks regarding to previous results obtained by other authors are made, too.
The paper finishes with some conclusions. – A good paper and a very instructive one.


60J20 Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.)
60J10 Markov chains (discrete-time Markov processes on discrete state spaces)
Full Text: DOI arXiv Euclid


[1] Benson, D. A. and Meerschaert, M. M. (2009). A simple and efficient random walk solution of multi-rate mobile/immobile mass transport equations. Adv. Water Resources 32 , 532-539.
[2] Billingsley, P. (1995). Probability and Measure , 3rd edn. John Wiley, New York. · Zbl 0822.60002
[3] Dehling, H. G., Hoffmann, A. C. and Stuut, H. W. (2000). Stochastic models for transport in a fluidized bed. SIAM J. Appl. Math. 60 , 337-358. · Zbl 0949.60086
[4] Dekking, M. and Kong, D. (2011). Multimodality of the Markov binomial distribution. J. Appl. Prob. 48 , 938-953. · Zbl 1231.60064
[5] Durrett, R. (2010). Probability: Theory and Examples , 4th edn. Cambridge University Press. · Zbl 1202.60001
[6] Gut, A. and Ahlberg, P. (1981). On the theory of chromatography based upon renewal theory and a central limit theorem for randomly iterated indexed partial sums of random variables. Chemica Scripta 18 , 248-255.
[7] Kinzelbach, W. (1988). The random walk method in pollutant transport simulation. In Groundwater Flow and Quality Modelling (NATO ASI Ser. C Math. Phys. Sci. 224 ), pp. 227-245.
[8] Lindstrom, F. T. and Narasimham, M. N. L. (1973). Mathematical theory of a kinetic model for dispersion of previously distributed chemicals in a sorbing porous medium. SIAM J. Appl. Math. 24 , 496-510. · Zbl 0237.76071
[9] Michalak, A. M. and Kitanidis, P. K. (2000). Macroscopic behavior and random-walk particle tracking of kinetically sorbing solutes. Water Resources Res. 36 , 2133-2146.
[10] Omey, E., Santos, J. and Van Gulck, S. (2008). A Markov-binomial distribution. Appl. Anal. Discrete Math. 2 , 38-50. · Zbl 1274.60233
[11] Uffink, G. \et (2012). Understanding the non-Gaussian nature of linear reactive solute transport in 1D and 2D: from particle dynamics to the partial differential equations. Transport Porous Media 91 , 547-571.
[12] Viveros, R., Balasubramanian, K. and Balakrishnan, N. (1994). Binomial and negative binomial analogues under correlated Bernoulli trials. Amer. Statist. 48 , 243-247.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.