The Structure and Dynamics of Networks: (Princeton Studies in Complexity)

513 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.

An analysis of the fixation probability of a mutant on special classes of non-directed graphs (2008, background): “This has the benefit of extending to larger more complex graphical systems, such as the small world networks of Bollobas & Chung (1988) (see also Durrett (2007), Newman et al. (2006), Newman & Watts (1999) and Watts & Strogatz (1998)).”
Random Graphs and Complex Networks (2016, background): “Many of the original references can also be found in the collection in [204], along with an introduction explaining their relevance.”
Random graphs with a given degree sequence (2010, background): “By Sourav Chatterjee1, Persi Diaconis and Allan Sly”
The Length of Bridge Ties: Structural and Geographic Properties of Online Social Interactions (2012, background): “…and social factors and binds together individuals, affecting complex processes such as the spreading of information over social links (Rogers 1995; Newman, Barabasi, and Watts 2006) or the ability to navigate the social networks to route a message to a particular individual (Kleinberg 2000).”
Interbank Tiering and Money Center Banks (2010, unknown): “The standard classes are random graphs introduced by Erdös and Rényi and scale-free networks popularized by Albert and Barabási and widely observed in the natural sciences (Newman et al. (2006)): A random graph is obtained by connecting any two nodes with a xed and independent probability p.”