Songshuo Li | Searcharxiv

arXiv2026

Vertex Centrality Reconstruction in an Inverse Problem for Information Diffusion

We consider an inverse problem in information diffusion modeled by random walks on combinatorial graphs. The problem concerns reconstruction of vertex centrality from the distribution of the first passage times observed on a subset of vertices. We adapt the boundary control method to obtain a direct algorithm that computes the unobserved vertex centrality. The algorithm is numerically implemented and validated on small graphs.

math-ph↗

arXiv2024

Vertex Weight Reconstruction in the Gel'fand's Inverse Problem on Connected Weighted Graphs

We consider the reconstruction of the vertex weight in the discrete Gel'fand's inverse boundary spectral problem for the graph Laplacian. Given the boundary vertex weight and the edge weight of the graph, we develop reconstruction procedures to recover the interior vertex weight from the Neumann boundary spectral data on a class of finite, connected and weighted graphs. The procedures are divided into two stages: the first stage reconstructs the Neumann-to-Dirichlet map for the graph wave equation from the Neumann boundary spectral data, and the second stage reconstructs the interior vertex weight from the Neumann-to-Dirichlet map using the boundary control method adapted to weighted graphs. For the second stage, we identify a class of weighted graphs where the unique continuation principle holds for the graph wave equation. The reconstruction procedures are further turned into an algorithm, which is implemented and validated on several numerical examples with quantitative performance reported.

math-ph↗