The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Graphs over time: densification laws, shrinking diameters and possible explanations
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Structure and evolution of online social networks
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Analysis of topological characteristics of huge online social networking services
Proceedings of the 16th international conference on World Wide Web
Measurement and analysis of online social networks
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Why we twitter: understanding microblogging usage and communities
Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 workshop on Web mining and social network analysis
Proceedings of the first workshop on Online social networks
Protean graphs with a variety of ranking schemes
Theoretical Computer Science
Estimating node similarity from co-citation in a spatial graph model
Proceedings of the 2010 ACM Symposium on Applied Computing
A Course on the Web Graph
Realistic, mathematically tractable graph generation and evolution, using kronecker multiplication
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
A geometric model for on-line social networks
Proceedings of the International Workshop on Modeling Social Media
Assessing the effects of a soft cut-off in the twitter social network
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part II
Modeling social networks through user background and behavior
WAW'11 Proceedings of the 8th international conference on Algorithms and models for the web graph
Effects of a soft cut-off on node-degree in the Twitter social network
Computer Communications
Innocent by association: early recognition of legitimate users
Proceedings of the 2012 ACM conference on Computer and communications security
SocialWatch: detection of online service abuse via large-scale social graphs
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
| Hi-index | 0.00 |
We study the link structure of on-line social networks (OSNs), and introduce a new model for such networks which may help infer their hidden underlying reality. In the geo-protean (GEO-P) model for OSNs nodes are identified with points in Euclidean space, and edges are stochastically generated by a mixture of the relative distance of nodes and a ranking function. With high probability, the GEO-P model generates graphs satisfying many observed properties of OSNs, such as power law degree distributions, the small world property, densification power law, and bad spectral expansion. We introduce the dimension of an OSN based on our model, and examine this new parameter using actual OSN data. We discuss how the dimension parameter of an OSN may eventually be used as a tool to group users with similar attributes using only the link structure of the network.