Name
Abstract | ||
|---|---|---|
It is based on well-known network models Euler graph, Erdos and Renyi random graph, Watts-Strogatz small-world model and Barabasi-Albert scale-free networks, and combined the unified hybrid network theoretical frame. One kind of network complexity pyramid with universality and diversity is constructed, described and reviewed. It is found that most unweighted and weighted models of network science can be investigated in a unification form using four hybrid ratios (dr,fd,gr,vg). As a number of hybrid ratios increase, from the top level to the bottom level complexity and diversity of the pyramid is increasing but universality and simplicity is decreasing. The network complexity pyramid may have preferable understanding in complicated transition relationship between complexity-diversity and simplicity-universality. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-02466-5_6 | Lecture Notes of the Institute for Computer Sciences Social Informatics and Telecommunications Engineering |
Keywords | Field | DocType |
scale free network,random graph,network model | Network science,Network complexity,Random graph,Unification,Euler's formula,Pyramid,Artificial intelligence,Universality (philosophy),Network model,Machine learning,Mathematics | Conference |
Volume | Issue | ISSN |
4 | 00 | 1867-8211 |
Citations | PageRank | References |
1 | 0.43 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jin-Qing Fang | 1 | 5 | 2.74 |
| Yong Li | 2 | 5 | 1.73 |