8,903 research outputs found

    Scaling window for mean-field percolation of averages

    Full text link
    For a complete graph of size nn, assign each edge an i.i.d. exponential variable with mean nn. For λ>0\lambda>0, consider the length of the longest path whose average weight is at most λ\lambda. It was shown by Aldous (1998) that the length is of order logn\log n for λ<1/e\lambda < 1/\mathrm{e} and of order nn for λ>1/e\lambda > 1/\mathrm{e}. Aldous (2003) posed the question on detailed behavior at and near criticality 1/e1/\mathrm{e}. In particular, Aldous asked whether there exist scaling exponents μ,ν\mu, \nu such that for λ\lambda within 1/e1/\mathrm{e} of order nμn^{-\mu}, the length for the longest path of average weight at most λ\lambda has order nνn^\nu. We answer this question by showing that the critical behavior is far richer: For λ\lambda around 1/e1/\mathrm{e} within a window of α(logn)2\alpha(\log n)^{-2} with a small absolute constant α>0\alpha>0, the longest path is of order (logn)3(\log n)^3. Furthermore, for λ1/e+β(logn)2\lambda \geq 1/\mathrm{e} + \beta (\log n)^{-2} with β\beta a large absolute constant, the longest path is at least of length a polynomial in nn. An interesting consequence of our result is the existence of a second transition point in 1/e+[α(logn)2,β(logn)2]1/\mathrm{e} + [\alpha (\log n)^{-2}, \beta (\log n)^{-2}]. In addition, we demonstrate a smooth transition from subcritical to critical regime. Our results were not known before even in a heuristic sense.Comment: 17pages. Minor revision upon previous version. To appear in Annals of Probabilit

    Mixing under monotone censoring

    Full text link
    We initiate the study of mixing times of Markov chain under monotone censoring. Suppose we have some Markov Chain MM on a state space Ω\Omega with stationary distribution π\pi and a monotone set AΩA \subset \Omega. We consider the chain MM' which is the same as the chain MM started at some xAx \in A except that moves of MM of the form xyx \to y where xAx \in A and yAy \notin A are {\em censored} and replaced by the move xxx \to x. If MM is ergodic and AA is connected, the new chain converges to π\pi conditional on AA. In this paper we are interested in the mixing time of the chain MM' in terms of properties of MM and AA. Our results are based on new connections with the field of property testing. A number of open problems are presented.Comment: 6 page
    corecore