Vertex Centrality Reconstruction in an Inverse Problem for Information Diffusion

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Gao, Yixian, Li, Songshuo, Yang, Yang
Natura: Preprint
Pubblicazione: 2026
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866914412915326976
author Gao, Yixian
Li, Songshuo
Yang, Yang
author_facet Gao, Yixian
Li, Songshuo
Yang, Yang
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2603_20710
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Vertex Centrality Reconstruction in an Inverse Problem for Information Diffusion
Gao, Yixian
Li, Songshuo
Yang, Yang
Mathematical Physics
05C50, 05C81, 05C22
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.
title Vertex Centrality Reconstruction in an Inverse Problem for Information Diffusion
topic Mathematical Physics
05C50, 05C81, 05C22
url https://arxiv.org/abs/2603.20710