Vertex Centrality Reconstruction in an Inverse Problem for Information Diffusion
Mathematical Physics
2026-03-24 v1 math.MP
Abstract
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.
Cite
@article{arxiv.2603.20710,
title = {Vertex Centrality Reconstruction in an Inverse Problem for Information Diffusion},
author = {Yixian Gao and Songshuo Li and Yang Yang},
journal= {arXiv preprint arXiv:2603.20710},
year = {2026}
}
Comments
20 pages, 6 figures