| |
| |
Complex network - Wikipedia, the free encyclopedia |
 | | Most real world networks can be considered complex on account of their having several topological features that do not exist in simple networks, e.g., a heavy-tail in the degree distribution, a high clustering coefficient, assortativity or disassortativty among vertices, community structure at many scales and evidence of a hierarchical structure. |
 | | A network is named scale-free if its degree distribution, i.e., the probability that a node selected uniformly at random has a certain number of links (degree), follows a particular mathematical function called a power law. |
 | | Networks with a power-law degree distribution can be highly resistant to the random deletion of vertices, i.e., the vast majority of vertices remain connected together in a giant component. |
| en.wikipedia.org /wiki/Complex_network (915 words) |
|