id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
cord-016196-ub4mgqxb	Wang, Cheng	Study on Efficient Complex Network Model	2012-11-20		.txt	text/plain	2486	92	51	This paper summarizes the relevant research of the complex network systematically based on Statistical Property, Structural Model, and Dynamical Behavior. An important discover in the complex network researching is that the average path length of the most of the large-scale real networks is much less than our imagine, which we call ''Small-world Effect''. Paul Erdös and Alfred Rényi discovered a complete random network model in the late 50s twentieth century, it is made of any two nodes which connected with probability p in the graph made of N nodes, its average degree is \k [ ¼ pðN À 1Þ % PN; the average path length l : ln N= lnð\k [ Þ; the convergence factor C ¼ P; when the value of N is very large, the distribution of the node degree approximately equals poisson distribution. However, the regular network has aggregation, but its average shortest path length is larger, random graph has the opposite property, having small-world and less convergence factor.	./cache/cord-016196-ub4mgqxb.txt	./txt/cord-016196-ub4mgqxb.txt