相关论文: Inverse problems for discrete heat equations and r…

We study an inverse problem on a finite connected graph G = (X, E), on whose vertices a conductivity {\gamma} is defined. Our data consists in a sequence of partial observations of a fractional random walk on G. The observations are partial…

We consider an inverse problem for a finite graph $(X,E)$ where we are given a subset of vertices $B\subset X$ and the distances $d_{(X,E)}(b_1,b_2)$ of all vertices $b_1,b_2\in B$. The distance of points $x_1,x_2\in X$ is defined as the…

We study the escape probability problem in random walks over graphs. Given vertices, $s,t,$ and $p$, the problem asks for the probability that a random walk starting at $s$ will hit $t$ before hitting $p$. Such probabilities can be…

We consider the following problem arising from the study of human problem solving: Let $G$ be a vertex-weighted graph with marked "in" and "out" vertices. Suppose a random walker begins at the in-vertex, steps to neighbors of vertices with…

We study the discrete Gel'fand's inverse boundary spectral problem of determining a finite weighted graph. Suppose that the set of vertices of the graph is a union of two disjoint sets: $X=B\cup G$, where $B$ is called the set of the…

This article examines the inverse problem for a lossy quantum graph that is internally excited and sensed. In particular, we supply an algorithmic methodology for deducing the topology and geometric structure of the underlying metric graph.…

Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…

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…

For a given graph $G$, we aim to determine the possible realizable spectra for a generalized (or sometimes referred to as a weighted) Laplacian matrix associated with $G$. This new specialized inverse eigenvalue problem is considered for…

We propose a model of random walks on weighted graphs where the weights are interval valued, and connect it to reversible imprecise Markov chains. While the theory of imprecise Markov chains is now well established, this is a first attempt…

We study the inverse problem of recovering a tree graph together with the weights on its edges (equivalently a metric tree) from the knowledge of the Dirichlet-to-Neumann matrix associated with the Laplacian. We prove an explicit formula…

We study diffusions, variational principles and associated boundary value problems on directed graphs with natural weightings. Using random walks and exit times, we associate to certain subgraphs (domains) a pair of sequences, each of which…

Hypergraphs are used in machine learning to model higher-order relationships in data. While spectral methods for graphs are well-established, spectral theory for hypergraphs remains an active area of research. In this paper, we use random…

This paper studies the formulation, well-posedness, and numerical solution of Bayesian inverse problems on metric graphs, in which the edges represent one-dimensional wires connecting vertices. We focus on the inverse problem of recovering…

This paper investigates an inverse random source problem for stochastic evolution equations, including stochastic heat and wave equations, with the unknown source modeled as $g(x)f(t)\dot{W}(t)$. The research commences with the…

We present a solution to the inverse scattering problem for differential Laplace operators on metric noncompact graphs. We prove that for almost all boundary conditions (i) the scattering matrix uniquely determines the graph and its metric…

We study the inverse eigenvector centrality problem on connected undirected graphs, namely, whether a given positive vector can be realized by assigning suitable edge weights. We provide a complete characterization in terms of stable sets…

We discuss inverse problems of determining the time-dependent source coefficient for a general class of subelliptic heat equations. We show that a single data at an observation point guarantees the existence of a (smooth) solution pair for…

In this note, we try to analyze and clarify the intriguing interplay between some counting problems related to specific thermalized weighted graphs and random walks consistent with such graphs.

In this paper we introduce a novel polynomial-time algorithm to compute graph invariants based on the modified random walk idea on graphs. However not proved to be a full graph invariant by now, our method gives the right answer for the…