arXiv · 2603.20710
Vertex Centrality Reconstruction in an Inverse Problem for Information Diffusion
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.
Explore related subjects
Keep this discovery
Yixian Gao, Songshuo Li, Yang Yang. 2026-03-21. Vertex Centrality Reconstruction in an Inverse Problem for Information Diffusion. https://arxiv.org/abs/2603.20710
Cite the original work for its findings. Save a collection to share your selection of sources.