Stochastic Analysis Seminar

We analyse stability properties of stochastic Lagrangian Navier stokes flows on compact Riemannian manifolds.

Abstract: A random polytope $K_n$ is, by definition, the convex hull of $n$ random independent, uniform points from a convex body $K subset R^d$. The investigation of random polytopes started with Sylvester in 1864. Hundred years later R\'enyi and Sulanke began studying the expectation of various functionals of $K_n$, for instance number of vertices, volume, surface area, etc. Since then many papers have been devoted to deriving precise asymptotic formulae for the expectation of the volume of $K \setminus K_n$, for instance. But with few notable exceptions, very little has been known about the distribution of this functional. In the last couple of years, however, two breakthrough results have been proved: Van Vu has given tail estimates for the random variables in question, and M. Reitzner has obtained a central limit theorem in the case when $K$ is a smooth convex body. In this talk I will explain these new results and some of the subsequent development: upper and lower bounds for the variance, central limit theorems when $K$ is a polytope. Time permitting, I will indicate some connections lattice polytopes.

A very general model of evolving graphs was introduced by Cooper and Frieze in 2003, and further analysed by Cooper. At each stage of the process, either a new edge is added
between existing vertices, or a new vertex is added and joined to some number of existing vertices. Each vertex gaining a new neighbour may be chosen either uniformly, or by preferential attachment, i.e., with probability proportional to the current degree.
It is known that the degrees of vertices in any such model follow a ``power law''. Here we study in detail the degree sequence of a graph obtained from such a procedure, looking at the vertices of large degree as well as the numbers of vertices of each fixed degree.
This is joint work with Graham Brightwell.

Let $X$ be a Poisson point process and $K$ a d-dimensional convex set.
For a point $x \in X$ denote by $v_X(x)$ the Voronoi cell with respect to $X$, and set $$ v_X (K) := \bigcup_{x \in X \cap K } v_X(x) $$ which is the union of all Voronoi cells with center in $K$. We call $v_X(K)$ the Poisson-Voronoi approximation of $K$.
For $K$ a compact convex set the volume difference $V_d(v_X(K))-V_d(K) $ and the symmetric difference $V_d(v_X(K) \triangle K)$ are investigated.
Estimates for the variance and limit theorems are obtained using the chaotic decomposition of these functions in multiple Wiener-Ito integrals

"Rough paths of inhomogeneous degree of smoothness (Pi-rough paths) can be treated as p-rough paths (of homogeneous degree of
smoothness) for a sufficiently large p. The theory of integration with respect to p-rough paths can be applied to prove existence and uniqueness of solutions of differential equations driven by Pi-rough paths. However the required conditions on the one-form determining the differential equation are too strong and can be weakened. The talk proves the existence and uniqueness under weaker conditions and explores some applications of Pi-rough paths