Small worlds: the dynamics of networks between order and randomness
Small worlds: the dynamics of networks between order and randomness
Computational & Mathematical Organization Theory
Experiences creating three implementations of the repast agent modeling toolkit
ACM Transactions on Modeling and Computer Simulation (TOMACS)
The link-prediction problem for social networks
Journal of the American Society for Information Science and Technology
Automated social hierarchy detection through email network analysis
Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 workshop on Web mining and social network analysis
ACM SIGMETRICS Performance Evaluation Review
Introductory tutorial: agent-based modeling and simulation
Proceedings of the Winter Simulation Conference
Dynamics of email communications among university students throughout a semester
Computers & Education
| Hi-index | 0.00 |
Understanding how the structure of a network evolves over time is one of the most interesting and complex topics in the field of social networks. In our attempt to model the dynamics of such systems, we explore an agent-based approach to model growth of email-based social networks, in which individuals establish, maintain and allow atrophy of links through contact-lists and emails. The model is based on the idea of common neighbors, but also on a detailed specialization of the classical preferential attachment theory, thus capturing a deeper understanding of the topology of inter-node connections. In our event-based simulation that schedules the agents' actions over time, the proposed model is amenable to significant efficiency improvements through an application of the Gillespie stochastic simulation schemes. Computer simulation results are used to validate the model by showing that its unique features endow it with ability to simulate real-world email networks with convincing realism.