Work

Vertex Centrality Reconstruction in an Inverse Problem for Information Diffusion

Year: 2026
Type: preprint
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.
Open Access status: green
OpenAlex ID: W7140178486
Cites:
Cited by:
Related to: