Related papers: Inverse problems for discrete heat equations and r…

An inverse source problem for the heat equation is considered. Extraction formulae for information about the time and location when and where the unknown source of the equation firstly appeared are given from a single lateral boundary…

We analyze the invariant distributions of continuous-time and discrete-time random walks on randomly weighted complete digraphs. These distributions correspond to the principal left eigenvectors of the associated random Markov generators…

We consider the group of permutations of the vertices of a lattice. A random walk is generated by unit steps that each interchange two nearest neighbor vertices of the lattice. We study the heat equation on the permutation group, using the…

We undertake a systematic investigation of the maxima and minima of the eigenfunctions associated with the first nontrivial eigenvalue of the Laplacian on a metric graph equipped with standard (continuity--Kirchhoff) vertex conditions. This…

The spectral gap theorem of Caputo, Liggett, and Richthammer states that on any connected graph equipped with edge weights, the 2nd eigenvalue of the interchange process equals the 2nd eigenvalue of the random walk process. In this work we…

We investigate the integrability of the discrete non-linear equation governing the dependence on geodesic distance of planar graphs with inner vertices of even valences. This equation follows from a bijection between graphs and blossom…

We consider the problem of recovering a function input of a differential equation formulated on an unknown domain $M$. We assume to have access to a discrete domain $M_n=\{x_1, \dots, x_n\} \subset M$, and to noisy measurements of the…

Symplectic geometry plays an increasingly important role in mathematics, physics and applications, and naturally gives rise to interesting matrix families and properties. One of these is the notion of symplectic eigenvalues, whose existence…

We study inverse boundary problems for a one dimensional linear integro-differential equation of the Gurtin--Pipkin type with the Dirichlet-to-Neumann map as the inverse data. Under natural conditions on the kernel of the integral operator,…

In this paper, we develop two approaches to investigation of inverse spectral problems for a new class of nonlocal operators on metric graphs. The Laplace differential operator is considered on a star-shaped graph with nonlocal integral…

We show how to construct discrete-time quantum walks on directed, Eulerian graphs. These graphs have tails on which the particle making the walk propagates freely, and this makes it possible to analyze the walks in terms of scattering…

Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the recent research on dynamic networks has only addressed the…

The central purpose of this article is to establish new inverse and implicit function theorems for differentiable maps with isolated critical points. One of the key ingredients is a discovery of the fact that differentiable maps with…

We consider modified Laplacian matrices of graphs, obtained by adding the identity matrix to the Laplacian matrix $L_G$ of a graph $G$. This results in a positive definite matrix $\tilde{L}_G$. The inverse of $\tilde{L}_G$ is a doubly…

In this paper, we initiate the study of the inverse eigenvalue problem for probe graphs. A probe graph is a graph whose vertices are partitioned into probe vertices and non-probe vertices such that the non-probe vertices form an independent…

A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…

We consider weighted, directed graphs with a notion of absorption on the vertices, related to absorbing random walks on graphs. We define a generalized inverse of the graph Laplacian, called the absorption inverse, that reflects both the…

We study exceptional sets of the local time of the continuous-time simple random walk in scaled-up (by $N$) versions $D_N\subseteq \mathbb Z^2$ of bounded open domains $D\subseteq \mathbb R^2$. Upon exit from $D_N$, the walk lands on a…

This paper studies the on- and off-diagonal upper estimate and the two-sided transition probability estimate of random walks on weighted graphs.

Quantum walks underlie an important class of quantum computing algorithms, and represent promising approaches in various simulations and practical applications. Here we design stroboscopically monitored quantum walks and their subsequent…