The DBLP Computer Science Bibliography: Evolution, Research Issues, Perspectives
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
SybilGuard: defending against sybil attacks via social networks
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
A framework for community identification in dynamic social networks
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Social network analysis for routing in disconnected delay-tolerant MANETs
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Community evolution in dynamic multi-mode networks
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Colibri: fast mining of large static and dynamic graphs
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
On the evolution of user interaction in Facebook
Proceedings of the 2nd ACM workshop on Online social networks
MobiOpp '10 Proceedings of the Second International Workshop on Mobile Opportunistic Networking
Measuring the mixing time of social graphs
IMC '10 Proceedings of the 10th ACM SIGCOMM conference on Internet measurement
Drac: an architecture for anonymous low-volume communications
PETS'10 Proceedings of the 10th international conference on Privacy enhancing technologies
Understanding Social Networks Properties for Trustworthy Computing
ICDCSW '11 Proceedings of the 2011 31st International Conference on Distributed Computing Systems Workshops
BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks
IEEE Transactions on Mobile Computing
Multi-scale dynamics in a massive online social network
Proceedings of the 2012 ACM conference on Internet measurement conference
On the mixing time of directed social graphs and security implications
Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security
| Hi-index | 0.00 |
In this paper we advance communication using social networks in two directions by considering dynamics of social graphs. First, we formally define the problem of routing on dynamic graphs and show an interesting and intuitive connection between graph dynamics and random walks on weighted graphs; graphs in which weights summarize history of edge dynamics and allow for future dynamics to be used as weight adjustment. Second, we present several measurements of our proposed model on dynamic graphs extracted from real-world social networks and compare them to static structures driven from the same graphs. We show several interesting trade-offs and highlight the potential of our model to capture dynamics, enrich graph structure, and improves the quantitative sender anonymity when compared to the case of static graphs.