作者: Judith Lehnert
DOI: 10.1007/978-3-319-25115-8_2
关键词: Discrete mathematics 、 Cluster coefficient 、 Adjacency matrix 、 Network model 、 Mathematics 、 Complex network 、 Random graph 、 Term (logic) 、 Delay differential equation 、 Complex dynamics
摘要: The term complex networks refers to graphs with non-trivial topological features. This chapter gives a recapitulation on the theory of networks, discusses quantities used describe and introduces most important network models namely random (Solomonoff Rapoport 1951; 1957; Erdős Renyi 1959, 1960), small-world (Watts Strogatz 1998; Monasson 1999), scale-free (Barabasi Bonabeau 2003). For reviews textbooks see Boccaletti et al. (2006b), Albert Barabasi (2002), Newman (2003), (2006), (2010), (2012), (2014), Kivela (2014).