System Maintenance:
There may be intermittent impact on performance while updates are in progress. We apologize for the inconvenience.
By Topic

A study of a time-graph friendship model

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Oikonomou, K. ; Dept. of Inf., Ionian Univ., Corfu, Greece ; Loukidou, A. ; Sioutas, S.

Modeling friendship is a challenging task in social networking given the opportunistic behavior of human relationships that is hard to model. In this paper a simple two-state markov chain model is introduced attempting to give further insight on friendship and particularly how relations evolve as time passes, given that the corresponding graph is a time evolving one with interesting properties. Based on this model four distinct behavioral categories are identified and studied. As it is analytically shown, and subsequently confirmed by simulations, any network of nodes having the same friendship characteristics (e.g., a network consisted exclusively of nodes of one of the behavioral categories characterized in this work) eventually results to a network with properties similar to that of random graphs. Since modern society is characterized by power-law distributions, it is shown by simulations that there exists a certain mix of the previously mentioned categories such that the resulting graph has similar to power-law distribution.

Published in:

World of Wireless, Mobile and Multimedia Networks (WoWMoM), 2011 IEEE International Symposium on a

Date of Conference:

20-24 June 2011