Graph reconstruction from path correlation data

DOI10.1088/1361-6420/aae798zbMath1403.05142arXiv1804.04574OpenAlexW2797040772WikidataQ129104781 ScholiaQ129104781MaRDI QIDQ4646414

N. G. Duffield, Mahmood Ettehad, Kyriakos Manousakis, Gregory Berkolaiko

Publication date: 14 January 2019

Published in: Inverse Problems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.04574

zbMATH Keywords

covariancenetwork tomographyend-to-end measurementasymmetric routinglogical treesunicast probing

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Communication networks in operations research (90B18) Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Combinatorial reconstruction problems
• Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves
• Pyramidal resistor networks for electrical impedance tomography with partial boundary measurements
• Network Tomography: Estimating Source-Destination Traffic Intensities from Link Data
• Network Tomography of Binary Network Performance Characteristics
• On revealing graph cycles via boundary measurements
• Electrical Impedance Tomography
• Multicast-based inference of network-internal loss characteristics
• Time-Varying Network Tomography: Router Link Data
• Multicast topology inference from measured end-to-end loss
• Optical tomography on graphs
• Recent progress in the boundary control method
• Identifiability of flow distributions from link measurements with applications to computer networks

This page was built for publication: Graph reconstruction from path correlation data