Partial data from fractional random walks on finite graphs determines a gauge class of the transition matrix and allows recovery of the graph and conductivity when the matrix is known.
Monotonicity-based inversion of the fractional S chr \"o dinger equation I I
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.AP 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An inverse problem for fractional random walks on finite graphs
Partial data from fractional random walks on finite graphs determines a gauge class of the transition matrix and allows recovery of the graph and conductivity when the matrix is known.