Download Full Text (306 KB)


Paul Erdős, one of the greatest mathematicians of the twentieth century, was a champion of applications of probabilistic methods in many areas of mathematics, such as a graph theory, combinatorics and number theory. He also, almost fifty years ago, jointly with another great Hungarian mathematician Alfred Rényi, laid out foundation of the theory of random graphs: the theory which studies how large and complex systems evolve when randomness of the relations between their elements is incurred. In my talk I will sketch the long journey of this theory from the pioneering Erdős era to modern attempts to model properties of large real world networks which grow unpredictably, including the Internet, World Wide Web (WWW), peer-to-peer, social, neural and metabolic networks.

Publication Date


Relational Format



Applied Mathematics | Mathematics


Event location: Lewis Hall 101

Random Graphs: From Paul Erdős to the Internet



To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.