pith. sign in

arxiv: 1409.2339 · v1 · pith:OPY3Q7UUnew · submitted 2014-09-08 · 🧮 math.PR

Networks, Random Graphs and Percolation

classification 🧮 math.PR
keywords randomnetworksgraphmodelsreal-lifeenyigraphsmodelling
0
0 comments X
read the original abstract

The theory of random graphs goes back to the late 1950s when Paul Erd\H{o}s and Alfr\'ed R\'enyi introduced the Erd\H{o}s-R\'enyi random graph. Since then many models have been developed, and the study of random graph models has become popular for real-life network modelling such as social networks and financial networks. The aim of this overview is to review relevant random graph models for real-life network modelling. Therefore, we analyse their properties in terms of stylised facts of real-life networks.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.