Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Greedy approximation algorithms for finding dense components in a graph
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Graphs over time: densification laws, shrinking diameters and possible explanations
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
A stochastic model for the evolution of the Web allowing link deletion
ACM Transactions on Internet Technology (TOIT)
HT06, tagging paper, taxonomy, Flickr, academic article, to read
Proceedings of the seventeenth conference on Hypertext and hypermedia
Group formation in large social networks: membership, growth, and evolution
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Structure and evolution of online social networks
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Social ties and their relevance to churn in mobile telecom networks
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Influence and correlation in social networks
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Feedback effects between similarity and social influence in online communities
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Microscopic evolution of social networks
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Proceedings of the forty-first annual ACM symposium on Theory of computing
Everyone's an influencer: quantifying influence on twitter
Proceedings of the fourth ACM international conference on Web search and data mining
Proceedings of the 20th international conference on World wide web
Preventing unraveling in social networks: the anchored k-core problem
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
To stay or not to stay: modeling engagement dynamics in social graphs
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Social resilience in online communities: the autopsy of friendster
Proceedings of the first ACM conference on Online social networks
Unveiling group characteristics in online social games: a socio-economic analysis
Proceedings of the 23rd international conference on World wide web
| Hi-index | 0.00 |
In this paper, we consider the natural arrival and departure of users in a social network, and ask whether the dynamics of arrival, which have been studied in some depth, also explain the dynamics of departure, which are not as well studied. Through study of the DBLP co-authorship network and a large online social network, we show that the dynamics of departure behave differently from the dynamics of formation. In particular, the probability of departure of a user with few friends may be understood most accurately as a function of the raw number of friends who are active. For users with more friends, however, the probability of departure is best predicted by the overall fraction of the user's neighborhood that is active, independent of size. We then study global properties of the sub-graphs induced by active and inactive users, and show that active users tend to belong to a core that is densifying and is significantly denser than the inactive users. Further, the inactive set of users exhibit a higher density and lower conductance than the degree distribution alone can explain. These two aspects suggest that nodes at the fringe are more likely to depart and subsequent departure are correlated among neighboring nodes in tightly-knit communities.