Skip to main content

All Questions

Filter by
Sorted by
Tagged with
1 vote
1 answer
420 views

Poisson approximation of random sub-graphs

I add the edges of $G(n)$ the complete graph on $n$ vertices one by one, at random and without replacement, and denote by $G(n,m)$ the resulting Erdos Renyi random graph process. At step $m$ in the ...
Olivier's user avatar
  • 468
7 votes
4 answers
1k views

Recent impressive combinatorial developments in probability theory

In the preface to the second edition of Daniel Stroock's book "Probability Theory: An Analytic View", there is this striking claim (on p. xv) ... I suspect that, for at least a decade, the most ...
an12's user avatar
  • 1,302