Deposits of clastic carbonate-dominated (calciclastic) sedimentary slope systems in the rock record have been identified mostly as linearly-consistent carbonate apron deposits, even though most ancient clastic carbonate slope deposits fit the submarine fan systems better. Calciclastic submarine fans are consequently rarely described and are poorly understood. Subsequently, very little is known especially in mud-dominated calciclastic submarine fan systems. Presented in this study are a sedimentological core and petrographic characterisation of samples from eleven boreholes from the Lower Carboniferous of Bowland Basin (Northwest England) that reveals a >250 m thick calciturbidite complex deposited in a calciclastic submarine fan setting. Seven facies are recognised from core and thin section characterisation and are grouped into three carbonate turbidite sequences. They include: 1) Calciturbidites, comprising mostly of highto low-density, wavy-laminated bioclast-rich facies; 2) low-density densite mudstones which are characterised by planar laminated and unlaminated muddominated facies; and 3) Calcidebrites which are muddy or hyper-concentrated debrisflow deposits occurring as poorly-sorted, chaotic, mud-supported floatstones. These

Phd by thesis

Convergence of Probability Measures. By P. Billingsley. Chichester, Sussex, Wiley, 1968. xii, 253 p. 9 1/4“. 117s.

Convergence of Probability Measures

The author's preface gives an outline: "This book is about weakconvergence methods in metric spaces, with applications sufficient to show their power and utility. The Introduction motivates the definitions and indicates how the theory will yield solutions to problems arising outside it. Chapter 1 sets out the basic general theorems, which are then specialized in Chapter 2 to the space C[0, l ] of continuous functions on the unit interval and in Chapter 3 to the space D [0, 1 ] of functions with discontinuities of the first kind. The results of the first three chapters are used in Chapter 4 to derive a variety of limit theorems for dependent sequences of random variables. " The book develops and expands on Donsker's 1951 and 1952 papers on the invariance principle and empirical distributions. The basic random variables remain real-valued although, of course, measures on C[0, l ] and D[0, l ] are vitally used. Within this framework, there are various possibilities for a different and apparently better treatment of the material. More of the general theory of weak convergence of probabilities on separable metric spaces would be useful. Metrizability of the convergence is not brought up until late in the Appendix. The close relation of the Prokhorov metric and a metric for convergence in probability is (hence) not mentioned (see V. Strassen, Ann. Math. Statist. 36 (1965), 423-439; the reviewer, ibid. 39 (1968), 1563-1572). This relation would illuminate and organize such results as Theorems 4.1, 4.2 and 4.4 which give isolated, ad hoc connections between weak convergence of measures and nearness in probability. In the middle of p. 16, it should be noted that C*(S) consists of signed measures which need only be finitely additive if 5 is not compact. On p. 239, where the author twice speaks of separable subsets having nonmeasurable cardinal, he means "discrete" rather than "separable." Theorem 1.4 is Ulam's theorem that a Borel probability on a complete separable metric space is tight. Theorem 1 of Appendix 3 weakens completeness to topological completeness. After mentioning that probabilities on the rationals are tight, the author says it is an

Convergence of probability measures

关于Semigroups of Linear Operators and Applications to Partial Differential Equations的两个注解

(1987). Applied Probability and Queues. Journal of the Operational Research Society: Vol. 38, No. 11, pp. 1095-1096.

https://link.springer.com/content/pdf/10.1057%2Fjors.1987.184.pdf

Applied Probability and Queues

The (standard) Brownian web is a collection of coalescing one-dimensional Brownian mo- tions, starting from each point in space and time. It arises as the diffusive scaling limit of a collection of coalescing random walks. We show that it is possible to obtain a nontrivial limiting object if the random walks in addition branch with a small probability. We call the limiting object the Brownian net, and study some of its elementary properties.

The Brownian net

The Brownian web is a collection of one-dimensional coalescing Brownian motions starting from everywhere in space and time, and the Brownian net is a generalization that also allows branching. They appear in the diusive scaling limits of many one-dimensional interacting particle systems with branching and coalescence. This article gives an introduction to the Brownian web and net, and how they arise in the scaling limits of various one-dimensional models, focusing mainly on coalescing random walks and random walks in i.i.d. space-time random environments. We will also briey survey models and results connected to the Brownian web and net, including alternative topologies, population genetic models, true self-repelling motion, planar aggregation, drainage networks, oriented percolation, black noise and critical percolation. Some open questions are discussed at the end.

The Brownian web, the Brownian net, and their universality

We study the ergodic behavior of systems of particles performing independent random walks, binary splitting, coalescence and deaths. Such particle systems are dual to systems of linearly interacting Wright-Fisher diffusions, used to model a population with resampling, selection and mutations. We use this duality to prove that the upper invariant measure of the particle system is the only homogeneous nontrivial invariant law and the limit started from any homogeneous nontrivial initial law.

/pdf/branching-coalescing-particle-systems-2865ssfc5c.pdf

Branching-coalescing particle systems

It is known that certain one-dimensional nearest-neighbour random walks in i.i.d. random space-time environments have diffusive scaling limits. Here, in the continuum limit, the random environment is represented by a 'stochastic flow of kernels', which is a collection of random kernels that can be loosely interpreted as the transition probabilities of a Markov process in a random environment. The theory of stochastic flows of kernels was first developed by Le Jan and Raimond, who showed that each such flow is characterised by its $n$-point motions. The authors' work focuses on a class of stochastic flows of kernels with Brownian $n$-point motions which, after their inventors, will be called Howitt-Warren flows. The authors' main result gives a graphical construction of general Howitt-Warren flows, where the underlying random environment takes on the form of a suitably marked Brownian web. This extends earlier work of Howitt and Warren who showed that a special case, the so-called "erosion flow", can be constructed from two coupled "sticky Brownian webs". The authors' construction for general Howitt-Warren flows is based on a Poisson marking procedure developed by Newman, Ravishankar and Schertzer for the Brownian web. Alternatively, the authors show that a special subclass of the Howitt-Warren flows can be constructed as random flows of mass in a Brownian net, introduced by Sun and Swart. Using these constructions, the authors prove some new results for the Howitt-Warren flows.

/pdf/stochastic-flows-in-the-brownian-web-and-net-27eo5ehniz.pdf

Jan M. Swart

Papers

The Brownian net

The Brownian web, the Brownian net, and their universality

The Brownian net

Branching-coalescing particle systems

Stochastic Flows in the Brownian Web and Net