๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the fluctuations of concentration in disperse systems The random number of particles in a fixed volume

โœ Scribed by Yu.A. Buyevich

Publisher
Elsevier Science
Year
1971
Tongue
English
Weight
607 KB
Volume
26
Category
Article
ISSN
0009-2509

No coin nor oath required. For personal study only.

โœฆ Synopsis

The statistical theory is presented which describes the number of particles in some volume of a concentrated disperse system, this number being a random function of time. This theory is a natural generalization of the Smoluchowski's statistics developed for Brownian movement of independent particles on the systems of high concentration. In particular, the expressions for the dispersion of that number, its Eulerian correlation function and for other quantities are obtained which can be used for estimation of the residence time of particles within the given volume of a fluidised bed, etc.

๐Ÿ“œ SIMILAR VOLUMES

On the fluctuations of concentration in
On the fluctuations of concentration in disperse systems. Spectral description of the random concentration field and applicatiion to solute dispersion in packed beds
โœ Yu.A. Buyevich ๐Ÿ“‚ Article ๐Ÿ“… 1972 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 834 KB

The spectral theory is presented which describes the concentration of a disperse system as a random spatial field. A representation for the spectral density of the concentration fluctuations is derived. As an example, local flows of a fluid, filtrating through a random particulate bed, caused by the

On the number of hamilton cycles in a ra
On the number of hamilton cycles in a random graph
โœ C. Cooper; A. M. Frieze ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 576 KB

Let a random graph G be constructed by adding random edges one by one, starting with n isolated vertices. We show that with probability going to one as n goes to infinity, when G first has minimum degree two, it has at least (log n)('-')" distinct hamilton cycles for any fixed E > 0.

On the number of vertices of given degre
On the number of vertices of given degree in a random graph
โœ Zbigniew Palka ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 115 KB ๐Ÿ‘ 1 views

This note can be treated a s a supplement to a paper written by Bollobas which was devoted to the vertices of a given degree in a random graph. We determine some values of the edge probability p for which the number of vertices of a given degree of a random graph G E ?An, p) asymptotically has a nor