Related papers: Inverse problems for discrete heat equations and r…
We consider the reconstruction of the vertex weight in the discrete Gel'fand's inverse boundary spectral problem for the graph Laplacian. Given the boundary vertex weight and the edge weight of the graph, we develop reconstruction…
This paper concerns discrete-time occupancy processes on a finite graph. Our results can be formulated in two theorems, which are stated for vertex processes, but also applied to edge process (e.g., dynamic random graphs). The first theorem…
We pose a new and intriguing question motivated by distributed computing regarding random walks on graphs: How long does it take for several independent random walks, starting from the same vertex, to cover an entire graph? We study the…
This paper studies a family of random walks defined on the finite ordinals using their order reversing involutions. Starting at $x \in \{0,1,\ldots,n-1\}$, an element $y \le x$ is chosen according to a prescribed probability distribution,…
Consider the following computational problem: given a regular digraph $G=(V,E)$, two vertices $u,v \in V$, and a walk length $t\in \mathbb{N}$, estimate the probability that a random walk of length $t$ from $u$ ends at $v$ to within $\pm…
We study the effect of random scattering in quantum walks on a finite graph and compare it with the effect of repeated measurements. To this end, a constructive approach is employed by introducing a localized and a delocalized basis for the…
The paper considers an inverse source problem for a one-dimensional time-fractional heat equation with the generalized impedance boundary condition. The inverse problem is the time dependent source parameter identification together with the…
We consider a random object that is associated with both random walks and random media, specifically, the superposition of a configuration of subcritical Bernoulli percolation on an infinite connected graph and the trace of the simple…
This paper is concerned with the Cauchy problem of a multivalued ordinary differential equation governed by the hypergraph Laplacian, which describes the diffusion of ``heat'' or ``particles'' on the vertices of hypergraph. We consider the…
Under consideration are mathematical models of heat and mass transfer. We study inverse problems of recovering lower-order coefficients in a second order parabolic equation. The coefficients are representable in the form of a finite…
The quantum walk dynamics obey the laws of quantum mechanics with an extra locality constraint, which demands that the evolution operator is local in the sense that the walker must visit the neighboring locations before endeavoring to…
For a shift-invariant weighted directed graph with vertex set $\mathbb{Z}$, we examine the minimal weight $\kappa_0$ exiting a finite, strongly connected set of vertices. Although $\kappa_0$ is defined as an infimum, it has been shown that…
In this article, we investigate inverse source problems for a wide range of PDEs of parabolic and hyperbolic types as well as time-fractional evolution equations by partial interior observation. Restricting the source terms to the form of…
Recently, the quaternionic quantum walk was formulated by the first author as a generalization of discrete-time quantum walks. We treat the right eigenvalue problem of quaternionic matrices to analysis the spectra of its transition matrix.…
We study a local data inverse problem for the time-dependent Convection-Diffusion Equation (CDE) in a bounded domain where a part of the boundary is treated to be inaccessible. Up on assuming the inaccessible part to be flat, we seek for…
We consider the inverse scattering problems for two types of Schr\"odinger operators on locally perturbed periodic lattices. For the discrete Hamiltonian, the knowledge of the S-matrix for all energies determines the graph structure and the…
Recently, several papers have been devoted to the analysis of lamplighter random walks, in particular when the underlying graph is the infinite path $\mathbb{Z}$. In the present paper, we develop a spectral analysis for lamplighter random…
Hypergraph has been selected as a powerful candidate for characterizing higher-order networks and has received increasing attention in recent years. In this article, we study random walks with resetting on hypergraph by utilizing spectral…
Various applications of graphs, in particular applications related to finding shortest paths, naturally get inputs with real weights on the edges. However, for algorithmic or visualization reasons, inputs with integer weights would often be…
Sood and Grassberger studied in [Phys. Rev. Lett. 99, 098701 (2007)] random walks on random graphs that are biased towards a fixed target point. They put forward a critical bias strength b_c such that a random walker on an infinite graph…