Random Graphs: Notation

5,192 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Error and attack tolerance of complex networks (2000, neutral): “We start by investigating the robustness of the two basic network models, the Erd˝os-R´enyi (ER) model [9,10] that produces a network with an exponential tail, and the scale-free model [17] with a power-law tail.”
Business Intelligence in Blogs: Understanding Consumer Interactions and Communities (2012, background): “However, no giant component (clusters containing more than 60% of the members (Bollobás 1985)) was found in these networks.”
Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms (2009, neutral): “Stochastic link models: Although we do not present any result on this topic in this notes, it is possible to develop robotic networks models over random graphs and random geometric graphs, as studied in Bollobás [2001], Penrose [2003].”
Bipartite Graphs as Models of Complex Networks (2003, neutral): “Finally, the degree distribution follows a Poisson law pk ∼ e −λ λ k! [13], which implies in particular that all vertices have nearly the same degree.”
Network robustness and fragility: percolation on random graphs. (2000, neutral): “The simplest and most widely studied model of undirected networks is the random graph [7], which has been investigated in depth for several decades now.”