Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Improving Search in Peer-to-Peer Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
ACM SIGKDD Explorations Newsletter
Graphs over time: densification laws, shrinking diameters and possible explanations
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Analysis and comparison of P2P search methods
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Small-world overlay P2P networks: construction, management and handling of dynamic flash crowds
Computer Networks: The International Journal of Computer and Telecommunications Networking
Novel approaches to efficient flooding search in peer-to-peer networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Statistical properties of community structure in large social and information networks
Proceedings of the 17th international conference on World Wide Web
LightFlood: Minimizing Redundant Messages and Maximizing Scope of Peer-to-Peer Search
IEEE Transactions on Parallel and Distributed Systems
Proceedings of the 19th international conference on World wide web
Structuring unstructured peer-to-peer networks
HiPC'07 Proceedings of the 14th international conference on High performance computing
Rumour spreading and graph conductance
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Expansion properties of large social graphs
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications
Benefits of bias: towards better characterization of network sampling
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Leveraging trust and distrust for sybil-tolerant voting in online social media
Proceedings of the 1st Workshop on Privacy and Security in Online Social Media
Hi-index | 0.02 |
Borrowing from concepts in expander graphs, we study the expansion properties of real-world, complex networks (e.g. social networks, unstructured peer-to-peer or P2P networks) and the extent to which these properties can be exploited to understand and address the problem of decentralized search. We first produce samples that concisely capture the overall expansion properties of an entire network, which we collectively refer to as the expansion signature. Using these signatures, we find a correspondence between the magnitude of maximum expansion and the extent to which a network can be efficiently searched. We further find evidence that standard graph-theoretic measures, such as average path length, fail to fully explain the level of "searchability" or ease of information diffusion and dissemination in a network. Finally, we demonstrate that this high expansion can be leveraged to facilitate decentralized search in networks and show that an expansion-based search strategy outperforms typical search methods.