A SOCIAL NETWORK MODEL WITH PROXIMITY PRESTIGE PROPERTY

Yuli Zhao; Hai Yu; Wei Zhang; Wenhua Zhang; Zhiliang Zhu

doi:10.11948/2015016

2015 Volume 5 Issue 2

Article Contents

Article navigation > Journal of Applied Analysis & Computation > 2015 > 5(2): 177-188

Next Article Previous Article

Yuli Zhao, Hai Yu, Wei Zhang, Wenhua Zhang, Zhiliang Zhu. A SOCIAL NETWORK MODEL WITH PROXIMITY PRESTIGE PROPERTY[J]. Journal of Applied Analysis & Computation, 2015, 5(2): 177-188. doi: 10.11948/2015016

Citation:

Yuli Zhao, Hai Yu, Wei Zhang, Wenhua Zhang, Zhiliang Zhu. A SOCIAL NETWORK MODEL WITH PROXIMITY PRESTIGE PROPERTY[J]. Journal of Applied Analysis & Computation, 2015, 5(2): 177-188. doi: 10.11948/2015016

A SOCIAL NETWORK MODEL WITH PROXIMITY PRESTIGE PROPERTY

Software College, Northeastern University, Shenyang, China

Fund Project:

Abstract

Abstract

In general, many real-world networks not only possess scale-free and high clustering coefficient properties, but also have a fast information transmission capability. However, the existing network models are unable to well present the intrinsic fast information transmission feature. The initial infected nodes and the network topology are two factors that affect the information transmission capability. By using preferential attachment to high proximity prestige nodes and triad formation, we provide a proximity prestige network model, which has scale-free property and high clustering coefficient. Simulation results further indicate that the new model also possesses tunable information transmission capability archived by adjusting its parameters. Moreover, comparing with the BA scale-free network, the proximity prestige network PPNet05 achieves a higher transmission capability when messages travel based on SIR and SIS models. Our conclusions are directed to possible applications in rumor or information spreading mechanisms.
- Complex network /
- proximity prestige /
- fast information spreading
MSC: 05C75;05C20

FullText(HTML)

References

[1]	R. Albert and A.-L. Barabási, Topology of evolving networks:Local events and universality, Physical Review Letters, 85(2000), 5234-5237. Google Scholar
[2]	A.-L. Barabási, R. Albert, and H. Jeong, Scale-free characteristics of random networks:The topology of the World-Wide Web, Physica A, 281(2000), 69-77. Google Scholar
[3]	A.-L. Barabási, and R. Albert, Emergence of scaling in random networks, Science, 286(1999), 509-512. Google Scholar
[4]	E. R. Colman, and G. J. Rodgers, Complex scale-free networks with tunable power-law exponent and clustering, Physica A, 392(2013), 5501-5510. Google Scholar
[5]	K. B. Hajra, and P. Sen, Modelling aging characteristics in citation networks, Physica A, 368(2006), 575-582. Google Scholar
[6]	P. Holme and B. J. Kim, Growing scale-free networks with tunable clustering, Physical Review E, 65(2002), 026107. Google Scholar
[7]	L. L. Huang, and Z. Y. Xia, Measuring user prestige and interaction preference on social network site, 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science, 2009, 1161-1166. Google Scholar
[8]	H. Jeong, B. Tombor, R. Albert, Z. N. Oltvai, and A.-L. Barabási, The largescale organization of metabolic networks, Nature, 407(2000), 651-654. Google Scholar
[9]	M. Kitsak, L. K. Gallos, S. Havlin, and F. Liljeros, Identification of influential spreaders in complex networks, Nature Physics, 6(2010), 888-893. Google Scholar
[10]	Y. Moreno, R. Pastor-Satorras, and A. Vespignani, Epidemic outbreaks in complex heterogeneous networks, European Physical Journal B, 26(2002), 521-529. Google Scholar
[11]	R. Pastor-Satorras, and A. Vespignani, Epidemic spreading in scale-free networks, Physical Review Letters, 86(2001), 3200-3203. Google Scholar
[12]	D. D. S. Price, Networks of scientific papers, Science, 149(1965), 510-515. Google Scholar
[13]	D. D. S. Price, A general theory of bibliometric and other cumulative advantage processes, Journal of the American Society for Information Science, 27(1976), 292-306. Google Scholar
[14]	F. X. Ren, H. W. Shen, and X. Q Cheng, Modeling the clustering in citation networks, Physica A, 391(2012), 3533-3539. Google Scholar
[15]	D. H. Shi, G. R. Chen, W. W. K. Thong, and X. Y. Yan, Searching for optimal network topology with best possible synchronizability, IEEE Circuits and Systems Magazine, 13(2013), 66-75. Google Scholar
[16]	X. F Wang, X. Li, and G. R. Chen, Network Science:An Introduction, Beijing:Higher Education Press, 2012. Google Scholar
[17]	M. Wang, and G. Yu, Effect of the age of papers on the preferential attachment in citation networks, Physica A, 388(2009), 4273. Google Scholar
[18]	G. Wilson, and W. Banzhaf, Discovery of email communication networks from the enron corpus with a genetic algorithm using social network analysis, 2009 IEEE Congress on Evolutionary Computation, CEC 2009, 2009, Trondheim, Norway, 3256-3263. Google Scholar
[19]	F. J. Zhang, Z. Q. You, C. Y. Fan, C. Gao, R. Cohen, Y. Hsueh and Z. K. Zhou, Friendship quality, social preference, proximity prestige, and self-perceived social competence:Interactive influences on children's loneliness, Journal of School Psychology, 52(2014), 511-526. Google Scholar