Related papers: Discrete diffusion-type equation on regular graphs…
We provide a unified method to study the adjacency matrices of regular graphs (including infinite ones) using holomorphic functional calculus. By applying this calculus on a specific ellipse that contains the spectrum, we derive an…
We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each. We are interested in walks that proceed from one half line, through…
We study the inverse problem of determining a finite weighted graph $(X,E)$ from the source-to-solution map on a vertex subset $B\subset X$ for heat equations on graphs, where the time variable can be either discrete or continuous. We prove…
Continuous time random walks are non-Markovian stochastic processes, which are only partly characterized by single-time probability distributions. We derive a closed evolution equation for joint two-point probability density functions of a…
We study the average probability that a discrete-time quantum walk finds a marked vertex on a graph. We first show that, for a regular graph, the spectrum of the transition matrix is determined by the weighted adjacency matrix of an…
Graph is a prevalent discrete data structure, whose generation has wide applications such as drug discovery and circuit design. Diffusion generative models, as an emerging research focus, have been applied to graph generation tasks.…
Representations based on random walks can exploit discrete data distributions for clustering and classification. We extend such representations from discrete to continuous distributions. Transition probabilities are now calculated using a…
We study the regularity of the law of a quadratic form $Q(X,X)$, evaluated in a sequence $X = (X_{i})$ of independent and identically distributed random variables, when $X_{1}$ can be expressed as a sufficiently smooth function of a…
Randomly breaking connections in a graph alters its transport properties, a model used to describe percolation. In the case of quantum walks, dynamic percolation graphs represent a special type of imperfections, where the connections appear…
We give some graph theoretical formulas for the trace $Tr_k(\mathbb {T})$ of a tensor $\mathbb {T}$ which do not involve the differential operators and auxiliary matrix. As applications of these trace formulas in the study of the spectra of…
We consider a discrete-time quantum walk, called the Grover walk, on a distance regular graph $X$. Given that $X$ has diameter $d$ and invertible adjacency matrix, we show that the square of the transition matrix of the Grover walk on $X$…
We establish the representation of general regular diffusions on star-shaped graphs as time-changed Walsh Brownian motions. These are regular continuous Markov processes described locally by a family generalized second order differential…
The aim of this paper is to develop a sequence of discrete approximations to a one-dimensional It\^o diffusion that almost surely converges to a weak solution of the given stochastic differential equation. Under suitable conditions, the…
With a view towards studying the multitemporal wave equation on affine buildings recently introduced by Anker-R\'emy-Trojan [arXiv:2312.06860], we systematically develop the basic properties of the discrete wave equation on $\mathbb{Z}$ and…
We introduce the concept of regular quantum graphs and construct connected quantum graphs with discrete symmetries. The method is based on a decomposition of the quantum propagator in terms of permutation matrices which control the way…
The diffusion equation and its time-fractional counterpart can be obtained via the diffusion limit of continuous-time random walks with exponential and heavy-tailed waiting time distributions. The space dependent variable-order…
In this paper we present an integro-differential diffusion equation for continuous time random walk that is valid for a generic waiting time probability density function. Using this equation we also study diffusion behaviors for a couple of…
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,…
Quantum walks, both discrete and continuous, serve as fundamental tools in quantum information processing with diverse applications. This work introduces a hybrid quantum walk model that integrates the coin mechanism of discrete walks with…
We give a new proof of the trace formula for regular graphs. Our approach is inspired by path integral approach in quantum mechanics, and calculations are mostly combinatorial.