Topology discovery of sparse random graphs with few participants

DOI10.1002/rsa.20420zbMath1270.05088OpenAlexW2568950526MaRDI QIDQ2844081

Animashree Anandkumar, Jonathan A. Kelner, Avinatan Hassidim

Publication date: 27 August 2013

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://resolver.caltech.edu/CaltechAUTHORS:20170920-132342501

zbMATH Keywords

sparse random graphstopology discoveryhidden nodesend-to-end measurementsquartet tests

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Planar graphs; geometric and topological aspects of graph theory (05C10) Density (toughness, etc.) (05C42)

Related Items (4)

Unnamed Item ⋮ Misleading stars: what cannot be measured in the internet? ⋮ Topology discovery of sparse random graphs with few participants ⋮ Adversarial topology discovery in network virtualization environments: a threat for ISPs?

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reconstructing the shape of a tree from observed dissimilarity data
• Spread of (mis)information in social networks
• On the longest path algorithm for reconstructing trees from distance matrices
• The many facets of internet topology and traffic
• Distance realization problems with applications to internet tomography
• A few logs suffice to build (almost) all trees. II
• Network tomography: recent developments
• Landmarks in graphs
• A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application
• Topology discovery of sparse random graphs with few participants
• Optimal phylogenetic reconstruction
• Emergence of Scaling in Random Networks
• Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
• Graphical Models, Exponential Families, and Variational Inference
• Approximate Discovery of Random Graphs
• Biological Sequence Analysis
• Random graph models of social networks
• Inexact graph matching for structural pattern recognition
• The diameter of sparse random graphs
• Elements of Information Theory
• On the bias of traceroute sampling
• Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms
• The diameter of sparse random graphs

This page was built for publication: Topology discovery of sparse random graphs with few participants