On the size of a maximal induced tree in a random graph
We consider the standard first passage percolation on : with each edge of the lattice we associate a random capacity. We are interested in the maximal flow through a cylinder in this graph. Under some assumptions Kesten proved in 1987 a law of large numbers for the rescaled flow. Chayes and Chayes established that the large deviations far away below its typical value are of surface order, at least for the Bernoulli percolation and cylinders of certain height. Thanks to another approach we extend...
In this paper, we establish a small time large deviation principle (small time asymptotics) for the two-dimensional stochastic Navier–Stokes equations driven by multiplicative noise, which not only involves the study of the small noise, but also the investigation of the effect of the small, but highly nonlinear, unbounded drifts.
Second order Markov chains which are trajectorially reversible are considered. Contrary to the reversibility notion for usual Markov chains, no symmetry property can be deduced for the corresponding transition operators. Nevertheless and even if they are not diagonalizable in general, we study some features of their spectral decompositions and in particular the behavior of the spectral gap under appropriate perturbations is investigated. Our quantitative and qualitative results confirm that the...
The spectral representation of the sampling cardinal series expansion (SCSE) of non-band-limited weakly stationary scalar and vector stochastic processes and their correlation functions are derived. The upper bound of the mean-square aliasing error is given for vector processes.