A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Optimizing the end-to-end performance of reliable flows over wireless links
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
A flow-based model for internet backbone traffic
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
A Markov-based channel model algorithm for wireless networks
Wireless Networks
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
Stochastic models for the Web graph
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Graphs over time: densification laws, shrinking diameters and possible explanations
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Graph model selection using maximum likelihood
ICML '06 Proceedings of the 23rd international conference on Machine learning
Structure and evolution of online social networks
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Systematic topology analysis and generation using degree correlations
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
SybilGuard: defending against sybil attacks via social networks
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the 16th international conference on World Wide Web
Analysis of topological characteristics of huge online social networking services
Proceedings of the 16th international conference on World Wide Web
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
Scalable modeling of real graphs using Kronecker multiplication
Proceedings of the 24th international conference on Machine learning
Measurement and analysis of online social networks
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Growth of the flickr social network
Proceedings of the first workshop on Online social networks
User interactions in social networks and their implications
Proceedings of the 4th ACM European conference on Computer systems
De-anonymizing Social Networks
SP '09 Proceedings of the 2009 30th IEEE Symposium on Security and Privacy
Power-Law Distributions in Empirical Data
SIAM Review
K-path centrality: a new centrality measure in social networks
Proceedings of the 4th Workshop on Social Network Systems
Vulnerability in socially-informed peer-to-peer systems
Proceedings of the 4th Workshop on Social Network Systems
Structural trend analysis for online social networks
Proceedings of the VLDB Endowment
Prometheus: user-controlled P2P social data management for socially-aware applications
Proceedings of the ACM/IFIP/USENIX 11th International Conference on Middleware
Sharing graphs using differentially private graph models
Proceedings of the 2011 ACM SIGCOMM conference on Internet measurement conference
Traffic dispersion graph based anomaly detection
Proceedings of the Second Symposium on Information and Communication Technology
Understanding task-driven information flow in collaborative networks
Proceedings of the 21st international conference on World Wide Web
Confidant: protecting OSN data without locking it up
Middleware'11 Proceedings of the 12th ACM/IFIP/USENIX international conference on Middleware
Identifying influential users by their postings in social networks
Proceedings of the 3rd international workshop on Modeling social media
Competing memes propagation on networks: a case study of composite networks
ACM SIGCOMM Computer Communication Review
On the bursty evolution of online social networks
Proceedings of the First ACM International Workshop on Hot Topics on Interdisciplinary Social Networks Research
Degree relations of triangles in real-world networks and graph models
Proceedings of the 21st ACM international conference on Information and knowledge management
Evolution of social-attribute networks: measurements, modeling, and implications using google+
Proceedings of the 2012 ACM conference on Internet measurement conference
Beyond friendship: modeling user activity graphs on social network-based gifting applications
Proceedings of the 2012 ACM conference on Internet measurement conference
Confidant: protecting OSN data without locking it up
Proceedings of the 12th International Middleware Conference
An in-depth analysis of stochastic Kronecker graphs
Journal of the ACM (JACM)
Modeling Social Network Interaction Graphs
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Practical conflict graphs for dynamic spectrum distribution
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
Modeling/predicting the evolution trend of osn-based applications
Proceedings of the 22nd international conference on World Wide Web
Iolaus: securing online content rating systems
Proceedings of the 22nd international conference on World Wide Web
Modeling/predicting the evolution trend of osn-based applications
Proceedings of the 22nd international conference on World Wide Web
Decompositions of triangle-dense graphs
Proceedings of the 5th conference on Innovations in theoretical computer science
Hi-index | 0.00 |
Access to realistic, complex graph datasets is critical to research on social networking systems and applications. Simulations on graph data provide critical evaluation of new systems and applications ranging from community detection to spam filtering and social web search. Due to the high time and resource costs of gathering real graph datasets through direct measurements, researchers are anonymizing and sharing a small number of valuable datasets with the community. However, performing experiments using shared real datasets faces three key disadvantages: concerns that graphs can be de-anonymized to reveal private information, increasing costs of distributing large datasets, and that a small number of available social graphs limits the statistical confidence in the results. The use of measurement-calibrated graph models is an attractive alternative to sharing datasets. Researchers can "fit" a graph model to a real social graph, extract a set of model parameters, and use them to generate multiple synthetic graphs statistically similar to the original graph. While numerous graph models have been proposed, it is unclear if they can produce synthetic graphs that accurately match the properties of the original graphs. In this paper, we explore the feasibility of measurement-calibrated synthetic graphs using six popular graph models and a variety of real social graphs gathered from the Facebook social network ranging from 30,000 to 3 million edges. We find that two models consistently produce synthetic graphs with common graph metric values similar to those of the original graphs. However, only one produces high fidelity results in our application-level benchmarks. While this shows that graph models can produce realistic synthetic graphs, it also highlights the fact that current graph metrics remain incomplete, and some applications expose graph properties that do not map to existing metrics.