Croissance exponentielle de produits markoviens de matrices aléatoires
C-semigroups on Banach spaces and functional inequalities
Cube root fluctuations for the corner growth model associated to the exclusion process.
Cumulants de vecteurs aléatoires
Cumulative processes in basketball games
We assume that the current score of a basketball game can be modeled by a bivariate cumulative process based on some marked renewal process. The basic element of a game is a cycle, which is concluded whenever a team scores. This paper deals with the joint probability distribution function of this cumulative process, the process describing the host's advantage and its expected value. The practical usefulness of the model is demonstrated by analyzing the effect of small modifications of the model...
Curvature measures and fractals [Book]
Curve crossing for the reflected Lev́y process at zero and infinity.
Curvilinear integrals along enriched paths.
Cut points and diffusive random walks in random environment
Cut times for random walks on the discrete Heisenberg group
Cut times for simple random walk.
Cut-off for large sums of graphs
If is the combinatorial Laplacian of a graph, converges to a matrix with identical coefficients. The speed of convergence is measured by the maximal entropy distance. When the graph is the sum of a large number of components, a cut-off phenomenon may occur: before some instant the distance to equilibrium tends to infinity; after that instant it tends to . A sufficient condition for cut-off is given, and the cut-off instant is expressed as a function of the gap and eigenvectors of components....
Cutoff for samples of Markov chains
Cutoff for samples of Markov chains
We study the convergence to equilibrium of n-samples of independent Markov chains in discrete and continuous time. They are defined as Markov chains on the n-fold Cartesian product of the initial state space by itself, and they converge to the direct product of n copies of the initial stationary distribution. Sharp estimates for the convergence speed are given in terms of the spectrum of the initial chain. A cutoff phenomenon occurs in the sense that as n tends to infinity, the total variation...
Cycle lengths in a permutation are typically Poisson.
Cycle structure of percolation on high-dimensional tori
In the past years, many properties of the largest connected components of critical percolation on the high-dimensional torus, such as their sizes and diameter, have been established. The order of magnitude of these quantities equals the one for percolation on the complete graph or Erdős–Rényi random graph, raising the question whether the scaling limits of the largest connected components, as identified by Aldous (1997), are also equal. In this paper, we investigate the cycle structureof the largest...
Cycle time of stochastic max-plus linear systems.
Cyclic random inequalities
Cyclic random motions in -space with n directions
We study the probability distribution of the location of a particle performing a cyclic random motion in . The particle can take n possible directions with different velocities and the changes of direction occur at random times. The speed-vectors as well as the support of the distribution form a polyhedron (the first one having constant sides and the other expanding with time t). The distribution of the location of the particle is made up of two components: a singular component (corresponding...
Cyclic system with preemptive priority