2010/08/17 by Michael Robinson, Robinson, Michael
Computer Science · Mathematics · #Data Management and Algorithms #FOS: Mathematics #Markov Chains and Monte Carlo Methods #Metric Geometry (math.MG) #Topological and Geometric Data Analysis
paper · pdf · doi:10.48550/arxiv.1008.2933
openalex publication_date 2010/08/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This article examines the inverse problem for a lossy quantum graph that is internally excited and sensed. In particular, we supply an algorithmic methodology for deducing the topology and geometric structure of the underlying metric graph. Our algorithms rely on narrowband and visibility measurements, and are therefore of considerable value to urban remote sensing applications. In contrast to the traditional methods in quantum graphs, we employ ideas related to algebraic and differential topology directly to our problem. This neatly exposes and separates the impact of the graph topology and geometry.