Approximating Shortest Paths in Spatial Social Networks
Name
Ratti_Approximating Shortest.pdf
Size
312.53 KB
Format
Adobe PDF
Checksum (MD5)
39ab5a58b64cece8079b77171440a5ec
Author(s)
Ratti, Carlo
Sommer, Christian
Date Issued
September 2012
Journal
Proceedings of the 2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Ratti, Carlo, and Christian Sommer. “Approximating Shortest Paths in Spatial Social Networks.” 2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing (September 2012).
Version
Author's final manuscript
Abstract
We evaluate an algorithm that efficiently computes short paths in social networks by exploiting their spatial component. The main idea is very simple and builds upon Milgram's seminal social experiment, where target individuals were found by having participants forward, or route, messages towards the target. Motivated by the somewhat surprising success of this experiment, Kleinberg introduced a model for spatial social networks, wherein a procedure called 'greedy routing' can be used to find short, but not necessarily shortest paths between any two individuals. We extend Klein berg's greedy routing procedure to explore k>;=1 links at each routing step. Experimental evaluations on social networks obtained from real-world mobile and landline phone communication data demonstrate that such adaptations can efficiently compute accurate estimates for shortest-path distances.
MIT Department
Massachusetts Institute of Technology. Department of Urban Studies and Planning
Massachusetts Institute of Technology. SENSEable City Laboratory
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/SocialCom-PASSAT.2012.132
