The shape of a typical boxed plane partition.
The single server queue and the storage model: large deviations and fixed points.
The single server queue with Erlang input and semi-Markov service times
The size of a pond in 2D invasion percolation.
The sizes of components in random circle graphs
We study random circle graphs which are generated by throwing n points (vertices) on the circle of unit circumference at random and joining them by an edge if the length of shorter arc between them is less than or equal to a given parameter d. We derive here some exact and asymptotic results on sizes (the numbers of vertices) of "typical" connected components for different ways of sampling them. By studying the joint distribution of the sizes of two components, we "go into" the structure of random...
The Skorokhod embedding problem and its offspring.
The Skorokhod oblique reflection problem in a convex polyhedron.
The smallest g-supermartingale and reflected BSDE with single and double obstacles
The space of distribution functions is separable.
The space of distribution functions endowed with the metric introduced in [5] is separable.
The spatial -coalescent.
The spectral gap for a Glauber-type dynamics in a continuous gas
The spectral laws of Hermitian block-matrices with large random blocks.
The spread of a catalytic branching random walk
We consider a catalytic branching random walk on that branches at the origin only. In the supercritical regime we establish a law of large number for the maximal position : For some constant , almost surely on the set of infinite number of visits of the origin. Then we determine all possible limiting laws for as goes to infinity.
The stability of Markov operators on Polish spaces
A sufficient condition for the asymptotic stability of Markov operators acting on measures defined on Polish spaces is presented.
The stationary G/G/ queue.
The stationary G/G/ queue with non-identical servers.
The stationary local sojourn time in single server tandem queues with renewal input.
The stationary waiting time and other variables in single-server queues with specialities at the beginning of a busy period
The statistical equilibrium of an isotropic stochastic flow with negative Lyapounov exponents is trivial
The steepest descent method for forward-backward SDEs.