Reconstructing the shape of a tree from observed dissimilarity data
Advances in Applied Mathematics
Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Elements of information theory
Elements of information theory
Discrete Applied Mathematics
A few logs suffice to build (almost) all trees: part II
Theoretical Computer Science
Optimal phylogenetic reconstruction
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On the longest path algorithm for reconstructing trees from distance matrices
Information Processing Letters
Learning network structure from passive measurements
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Optimal query complexity bounds for finding graphs
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Graphical Models, Exponential Families, and Variational Inference
Foundations and Trends® in Machine Learning
On the bias of traceroute sampling: Or, power-law degree distributions in regular graphs
Journal of the ACM (JACM)
Predicting positive and negative links in online social networks
Proceedings of the 19th international conference on World wide web
Efficient and dynamic routing topology inference from end-to-end measurements
IEEE/ACM Transactions on Networking (TON)
Inferring networks of diffusion and influence
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Network delay inference from additive metrics
Random Structures & Algorithms
Optimally reconstructing weighted graphs using queries
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Walking on a graph with a magnifying glass: stratified sampling via weighted random walks
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Network Discovery and Verification
IEEE Journal on Selected Areas in Communications
Approximate discovery of random graphs
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
Misleading stars: what cannot be measured in the Internet?
DISC'11 Proceedings of the 25th international conference on Distributed computing
Graph reconstruction via distance oracles
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Hi-index | 0.00 |
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. The rest of the nodes are hidden, and do not provide any information for topology discovery. We consider topology discovery under two routing models: (a) the participants exchange messages along the shortest paths and obtain end-to-end measurements, and (b) additionally, the participants exchange messages along the second shortest path. For scenario (a), our proposed algorithm results in a sub-linear edit-distance guarantee using a sub-linear number of uniformly selected participants. For scenario (b), we obtain a much stronger result, and show that we can achieve consistent reconstruction when a sub-linear number of uniformly selected nodes participate. This implies that accurate discovery of sparse random graphs is tractable using an extremely small number of participants. We finally obtain a lower bound on the number of participants required by any algorithm to reconstruct the original random graph up to a given edit distance. We also demonstrate that while consistent discovery is tractable for sparse random graphs using a small number of participants, in general, there are graphs which cannot be discovered by any algorithm even with a significant number of participants, and with the availability of end-to-end information along all the paths between the participants.