Random Graphs-英文文献.pdfVIP

RANDOM GRAPHS Svante Janson Once up on a time I b egan as an analyst I studied function spaces such as BMO and op erators on function spaces see for example but gradually I b ecame more and more interested in probability theory Some years ago I worked on random coverings and other problems in geometrical probability and at present most of my time is devoted to the related eld of combinatorial probability in particular random graphs This may seem to b e very dierent from the harmonic and functional analysis that I once worked on and still continue with sometimes but the dierence in metho ds is not so great I study random graphs as a probabilist dealing with some combinatorial structures and my metho ds are probabilistic and based on analysis using for example integration theory functional analysis martingales and sto chastic integration In this presentation I will give a survey over some recent results on random graphs where I have b een at least partly involved The systematic study of random graphs was started by Erdos and Rnyi in and the theory has expanded rapidly during the last decade For a fuller historical account and for many other results on random graphs I refer to Bollobss b o ok Definitions A random graph is a graph generated by some random pro cedure There are many nonequivalent ways to dene random graphs The simplest denoted by G or one nm of several common similar notations where n and m are two integers with  m  n 2 is obtained