Related papers: Inverse problems for discrete heat equations and r…
We suggest a new formulation of the inverse spectral problem for second-order functional-differential operators on star-shaped graphs with global delay. The latter means that the delay, being measured in the direction to a specific boundary…
In this paper, we analyse a sub-class of two-dimensional homogeneous nearest neighbour (simple) random walk restricted on the lattice using the matrix geometric approach. In particular, we first present an alternative approach for the…
We develop a formalism to compute the statistics of the top eigenpair of weighted sparse graphs with finite mean connectivity and bounded maximal degree. Framing the problem in terms of optimisation of a quadratic form on the sphere and…
We study the inverse problem of recovering a spatially dependent variable order in a time-fractional diffusion model from the boundary flux measurement generated by a single boundary excitation. It arises in the identification of…
In this paper we study the Heat Flow on Metric Random Walk Spaces, which unifies into a broad framework the heat flow on locally finite weighted connected graphs, the heat flow determined by finite Markov chains and some nonlocal evolution…
This paper deals with the distributed order time-fractional diffusion equations with non-homogeneous Dirichlet (Nuemann) boundary condition. We first prove the wellposedness of the weak solution to the initial boundary value problem for the…
We consider a discrete-time random walk on the nodes of an unbounded hexagonal lattice. We determine the probability generating functions, the transition probabilities and the relevant moments. The convergence of the stochastic process to a…
We consider the problem of exact and inexact matching of weighted undirected graphs, in which a bijective correspondence is sought to minimize a quadratic weight disagreement. This computationally challenging problem is often relaxed as a…
In this paper, we study the $k$-center problem of uncertain points on a graph. Given are an undirected graph $G = (V, E)$ and a set $\mathcal{P}$ of $n$ uncertain points where each uncertain point with a non-negative weight has $m$ possible…
We study the inverse problem of determining the conductivity matrix of an electrical network from the prescribed knowledge of the magnitude of the induced current along the edges coupled with the imposed voltage or injected current on the…
When averages over all starting points are considered, the Type Problem for the recurrence or transience of a simple random walk on an inhomogeneous network in general differs from the usual "local" Type Problem. This difference leads to a…
Interest in inverse dynamical, spectral and scattering problems for differential equations on graphs is motivated by possible applications to nano-electronics and quantum waveguides and by a variety of other classical and quantum…
The main purpose of this thesis is to study the interplay between geometric properties of infinite graphs and analytic and probabilistic objects such as transition operators, harmonic functions and random walks on these graphs. For a…
In a finite-dimensional Euclidian space we consider a connected metric graph with the following property: each two cycles can have at most one common point. Such graphs are called A-graphs. On noncompact A-graph we consider a scattering…
In this work, we investigate inverse problems of recovering the time-dependent coefficient in the nonlinear transport equation in both cases: two-dimensional Riemannian manifolds and Euclidean space $\mathbb{R}^n$, $n\geq 2$. Specifically,…
We present an extension of two policy-iteration based algorithms on weighted graphs (viz., Markov Decision Problems and Max-Plus Algebras). This extension allows us to solve the following inverse problem: considering the weights of the…
\textsc{Directed Token Sliding} asks, given a directed graph and two sets of pairwise nonadjacent vertices, whether one can reach from one set to the other by repeatedly applying a local operation that exchanges a vertex in the current set…
We solve inverse problems from the D-N map for the quantum graph on a finite domain in a square lattice and that on a hexagonal lattice, as well as inverse scattering problems from the S-matrix for a locally perturbed square lattice and a…
A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. Hitting times for discrete quantum walks on graphs give an average time before the walk…
We extend the notion of nonbacktracking walks from unweighted graphs to graphs whose edges have a nonnegative weight. Here the weight associated with a walk is taken to be the product over the weights along the individual edges. We give two…