The critical random graph, with martingales
نویسندگان
چکیده
منابع مشابه
The critical random graph, with martingales
We give a short proof that the largest component of the random graph G(n, 1/n) is of size approximately n. The proof gives explicit bounds for the probability that the ratio is very large or very small.
متن کاملCritical Subgraphs of a Random Graph
We prove that the threshold for a random graph to have a k-core is equal to the threshold for having a subgraph which meets a necessary condition of Gallai for being k-critical. 1991 Mathematics Subject Classification: Primary 05C80; Secondary 05C15.
متن کاملDivide and conquer martingales and the number of triangles in a random graph
The goal of this paper is to present a novel application of a recent and useful martingale inequality. As an illustration, we prove an essentially sharp bound for the probability that a random graph contains significantly more triangles than expected.
متن کاملA Local Limit Theorem for the Critical Random Graph
We consider the limit distribution of the orders of the k largest components in the Erdős-Rényi random graph inside the “critical window” for arbitrary k. We prove a local limit theorem for this joint distribution and derive an exact expression for the joint probability density function.
متن کاملLocalization for controlled random walks and martingales
We consider controlled random walks that are martingales with uniformly bounded increments and nontrivial jump probabilities and show that such walks can be constructed so that P (Su n = 0) decays at polynomial rate n where α > 0 can be arbitrarily small. We also show, by means of a general delocalization lemma for martingales, which is of independent interest, that slower than polynomial decay...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Israel Journal of Mathematics
سال: 2010
ISSN: 0021-2172,1565-8511
DOI: 10.1007/s11856-010-0019-8