论文信息 - Are Erdös- Rényi Random Graphs Topologically Random?

Are Erdös- Rényi Random Graphs Topologically Random?

No. We prove that Erdos- Renyi Random Graphs are not topologically random. This begins to provide mathematical explanation as to why random graphs fail to explain topological characteristics of real world networks. This has far reaching consequences for the randomisation processes implemented in Network Science.

Javier Escudero | Keith Smith | J. Escudero | Keith M. Smith

[1] E. Todeva. Networks , 2007 .

[2] M. Newman. Random Graphs as Models of Networks , 2002, cond-mat/0202208.

[3] J. Escudero,et al. The complex hierarchical topology of EEG functional connectivity , 2017, Journal of Neuroscience Methods.

[4] Stefan Bornholdt,et al. Handbook of Graphs and Networks: From the Genome to the Internet , 2003 .

[5] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.