Skip to main content Accessibility help
×
×
Home
Introduction to Random Graphs
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 8
  • Cited by
    This book has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Frieze, Alan Krivelevich, Michael Michaeli, Peleg and Peled, Ron 2018. On the trace of random walks on random graphs. Proceedings of the London Mathematical Society, Vol. 116, Issue. 4, p. 847.

    Karjalainen, Joona van Leeuwaarden, Johan S. H. and Leskelä, Lasse 2018. Algorithms and Models for the Web Graph. Vol. 10836, Issue. , p. 44.

    Molloy, Michael 2018. The Freezing Threshold for k-Colourings of a Random Graph. Journal of the ACM, Vol. 65, Issue. 2, p. 1.

    Schlaile, Michael P. Zeman, Johannes and Mueller, Matthias 2018. It’s a match! Simulating compatibility-based learning in a network of networks. Journal of Evolutionary Economics, Vol. 28, Issue. 5, p. 1111.

    Erman, Daniel and Yang, Jay 2018. Random flag complexes and asymptotic syzygies. Algebra & Number Theory, Vol. 12, Issue. 9, p. 2151.

    Abbas, Ghulam 2017. A review of “Random graphs and complex networks” by Hofstad. Complex Adaptive Systems Modeling, Vol. 5, Issue. 1,

    Parczyk, Olaf and Person, Yury 2016. Spanning structures and universality in sparse hypergraphs. Random Structures & Algorithms, Vol. 49, Issue. 4, p. 819.

    Bloznelis, Mindaugas and Leskelä, Lasse 2016. Algorithms and Models for the Web Graph. Vol. 10088, Issue. , p. 22.

    ×

Book description

From social networks such as Facebook, the World Wide Web and the Internet, to the complex interactions between proteins in the cells of our bodies, we constantly face the challenge of understanding the structure and development of networks. The theory of random graphs provides a framework for this understanding, and in this book the authors give a gentle introduction to the basic tools for understanding and applying the theory. Part I includes sufficient material, including exercises, for a one semester course at the advanced undergraduate or beginning graduate level. The reader is then well prepared for the more advanced topics in Parts II and III. A final part provides a quick introduction to the background material needed. All those interested in discrete mathematics, computer science or applied probability and their applications will find this an ideal introduction to the subject.

Reviews

'This is a well-planned book that is true to its title in that it is indeed accessible for anyone with just an undergraduate student’s knowledge of enumerative combinatorics and probability.'

Miklós Bóna Source: MAA Reviews

Refine List
Actions for selected content:
Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Send to Kindle
  • Send to Dropbox
  • Send to Google Drive
  • Send content to

    To send content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about sending content to .

    To send content items to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle.

    Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

    Find out more about the Kindle Personal Document Service.

    Please be advised that item(s) you selected are not available.
    You are about to send
    ×

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
×

Page 1 of 2



Page 1 of 2


Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Book summary page views

Total views: 0 *
Loading metrics...

* Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

Usage data cannot currently be displayed