DocumentCode
3220861
Title
Using exponential random graph (p∗) models to generate social networks in artificial society
Author
Liu Liang ; Ge Yuanzheng ; Qiu Xiaogang
Author_Institution
Coll. of Inf. Syst. & Manage., Nat. Univ. of Defense Technol., Changsha, China
fYear
2013
fDate
28-30 July 2013
Firstpage
596
Lastpage
601
Abstract
Artificial society, which is a bottom-up method, has become a significant mean of studying complexity and complex phenomena in human society. Social networks play an important role in the research of social interaction among people, and are also key components of the artificial society. A good social network model should be both estimable and representable. Exponential random graph (p*) models (ERGMs) can satisfy the requirements. In this paper, ERGMs are applied to the generation of social networks in the artificial society, and a general process of generating social networks is proposed. As a case study, friendship networks in an artificial classroom are generated based on the statnet suite. The results indicate that ERGMs are efficient to generate social networks, and this method is practicable and worthy of application.
Keywords
graph theory; social networking (online); ERGM; artificial classroom; artificial society; bottom-up method; complex phenomena; exponential random graph p* models; friendship networks; human society; social interaction; social networks; statnet suite; Complexity theory; Computational modeling; Data models; Estimation; Markov processes; Mathematical model; Social network services; artificial society; exponential random graph models; model generation; p∗ models; social networks; statnet;
fLanguage
English
Publisher
ieee
Conference_Titel
Service Operations and Logistics, and Informatics (SOLI), 2013 IEEE International Conference on
Conference_Location
Dongguan
Print_ISBN
978-1-4799-0529-4
Type
conf
DOI
10.1109/SOLI.2013.6611484
Filename
6611484
Link To Document