| Degree Distribution |
Article Index for Degree |
Website Links For Degree |
Information AboutDegree Distribution |
| CATEGORIES ABOUT DEGREE DISTRIBUTION | |
| graph theory | |
| graph invariants | |
|
Its use originates from the study of Random Graph by Paul Erdős and Alfréd Rényi Erdos, P. and Renyi, A., 1959, Publ. Math. (Debrecen) 6, 290., and it has become an important concept which describes the topology of complex networks. __TOC__ DEFINITION Degree The Degree Of A Node (or Connectivity ) is, , tells how many links (or edges) the node has to other nodes. In directed networks nodes has two types of degrees. The incoming degree ''k''in denotes the number of links that point to a node, and an outgoing degree ''k''out denotes the number of links that start from it. An undirected network with ''N'' nodes and '''''L''''' links is characterized by an average degree (where <> denotes the average)A.-L. Barabási and Z. N. Oltvai, Nature Reviews Genetics 5, 101-113 (2004). Degree distribution The degree distribution, , is a function describing the total number of Vertices in a graph with a given Degree (number of connections to other vertices). Formally, the degree distribution is |
|
|