Cram'er type moderate deviations for the maximum of self-normalized sums.
Criteria of regularity at the end of a tree
Critical branching diffusions : proper normalization and conditioned limit
Critical constants for recurrence of random walks on -spaces
We introduce the notion of a critical constant for recurrence of random walks on -spaces. For a subgroup of a finitely generated group the critical constant is an asymptotic invariant of the quotient -space . We show that for any infinite -space . We say that is very small if . For a normal subgroup the quotient space is very small if and only if it is finite. However, we give examples of infinite very small -spaces. We show also that critical constants for recurrence can be used...
Critical exponents in percolation via lattice animals.
Critical path analysis for continuum percolation
Critical percolation on certain nonunimodular graphs.
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