A quantitative comparison of graph-based models for Internet topology
IEEE/ACM Transactions on Networking (TON)
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A random graph model for massive graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On the origin of power laws in Internet topologies
ACM SIGCOMM Computer Communication Review
Network topology generators: degree-based vs. structural
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
ANF: a fast and scalable tool for data mining in massive graphs
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Distributed Network Simulations Using the Dynamic Simulation Backplane
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Power laws and the AS-level internet topology
IEEE/ACM Transactions on Networking (TON)
Network modeling and simulation: on standardized network topologies for network research
Proceedings of the 34th conference on Winter simulation: exploring new frontiers
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
IEEE Communications Magazine
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Path preserving scale down for validation of internet inter-domain routing protocols
Proceedings of the 38th conference on Winter simulation
Sampling large Internet topologies for simulation purposes
Computer Networks: The International Journal of Computer and Telecommunications Networking
Large-scale testing of the Internet's Border Gateway Protocol (BGP) via topological scale-down
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Basic properties of the IPv6 AS-level topology
ACM SIGMETRICS Performance Evaluation Review
On unbiased sampling for unstructured peer-to-peer networks
IEEE/ACM Transactions on Networking (TON)
Towards privacy for social networks: a zero-knowledge based definition of privacy
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Local graph sparsification for scalable clustering
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
On sampling type distribution from heterogeneous social networks
PAKDD'11 Proceedings of the 15th Pacific-Asia conference on Advances in knowledge discovery and data mining - Volume Part II
Obtaining provably legitimate internet topologies
IEEE/ACM Transactions on Networking (TON)
Bridge analysis in a Social Internetworking Scenario
Information Sciences: an International Journal
Crawling Social Internetworking Systems
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Moving from social networks to social internetworking scenarios: The crawling perspective
Information Sciences: an International Journal
Flow-based partitioning of network testbed experiments
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
In this paper, we develop methods to “sample” a small realistic graph from a large real network. Despite recent activity, the modeling and generation of realistic graphs is still not a resolved issue. All previous work has attempted to grow a graph from scratch. We address the complementary problem of shrinking a graph. In more detail, this work has three parts. First, we propose a number of reduction methods that can be categorized into three classes: (a) deletion methods, (b) contraction methods, and (c) exploration methods. We prove that some of them maintain key properties of the initial graph. We implement our methods and show that we can effectively reduce the nodes of a graph by as much as 70% while maintaining its important properties. In addition, we show that our reduced graphs compare favourably against construction-based generators. Apart from its use in simulations, the problem of graph sampling is of independent interest.