Related papers: Brownian Motion on The Spider Like Quantum Graphs
Fractional Brownian motion is a Gaussian stochastic process with stationary, long-time correlated increments and is frequently used to model anomalous diffusion processes. We study numerically fractional Brownian motion confined to a finite…
We present a detailed study of a simple quantum stochastic process, the quantum phase space Brownian motion, which we obtain as the Markovian limit of a simple model of open quantum system. We show that this physical description of the…
We discuss approximations of vertex couplings of quantum graphs using families of thin branched manifolds. We show that if a Neumann type Laplacian on such manifolds is amended by suitable potentials, the resulting Schr\"odinger operators…
As an extension of isotropic Gaussian random fields and Q-Wiener processes on d-dimensional spheres, isotropic Q-fractional Brownian motion is introduced and sample H\"older regularity in space-time is shown depending on the regularity of…
We uncover the very rich graph topology of generic bounded non-Hermitian spectra, distinct from the topology of conventional band invariants and complex spectral winding. The graph configuration of complex spectra are characterized by the…
This article presents a novel and succinct algorithmic framework via alternating quantum walks, unifying quantum spatial search, state transfer and uniform sampling on a large class of graphs. Using the framework, we can achieve exact…
We consider a particle diffusing along the links of a general graph possessing some absorbing vertices. The particle, with a spatially-dependent diffusion constant D(x) is subjected to a drift U(x) that is defined in every point of each…
In this note we study the phase transition for percolation on quasi-transitive graphs with quasi-transitively inhomogeneous edge-retention probabilities. A quasi-transitive graph is an infinite graph with finitely many different "types" of…
In this paper, we study Grover's search algorithm focusing on continuous-time quantum walk on graphs. We propose an alternative optimization approach to Grover's algorithm on graphs that can be summarized as follows: instead of finding…
We determine conditions for the quantisation of graphs using the Dirac operator for both two and four component spinors. According to the Bohigas-Giannoni-Schmit conjecture for such systems with time-reversal symmetry the energy level…
Graph sparsification underlies a large number of algorithms, ranging from approximation algorithms for cut problems to solvers for linear systems in the graph Laplacian. In its strongest form, "spectral sparsification" reduces the number of…
Spatial search on graphs is one of the most important algorithmic applications of quantum walks. To show that a quantum-walk-based search is more efficient than a random-walk-based search is a difficult problem, which has been addressed in…
We consider the quantum centipede made of $N$ fermionic quantum walkers on the one-dimensional lattice interacting by means of the simplest of all hard-bound constraints: the distance between two consecutive fermions is either one or two…
A randomly walking quantum particle evolving by Schr\"odinger's equation searches for a unique marked vertex on the "simplex of complete graphs" in time $\Theta(N^{3/4})$. In this paper, we give a weighted version of this graph that…
In the present paper, we prove that the $C_{0}$-semigroup generated by a Schr\"odinger operator with drift on a complete Riemannian manifold is approximated by the discrete semigroups associated with a family of discrete time random walks…
In this article it is shown that the Brownian motion on the continuum random tree is the scaling limit of the simple random walks on any family of discrete $n$-vertex ordered graph trees whose search-depth functions converge to the Brownian…
The dynamical behavior for a quantum Brownian particle is investigated under a random potential of the fractional iterative map on a one-dimensional lattice. For our case, the quantum expectation values can be obtained numerically from the…
This paper is devoted to the investigation of the spectral theory and dynamical properties of periodic graphs which are not locally finite but carry non-negative, symmetric and summable edge weights. These graphs are shown to exhibit rather…
We introduce a minimal set of physically motivated postulates that the Hamiltonian H of a continuous-time quantum walk should satisfy in order to properly represent the quantum counterpart of the classical random walk on a given graph. We…
These are notes on the method of normalized graph cuts and its applications to graph clustering. I provide a fairly thorough treatment of this deeply original method due to Shi and Malik, including complete proofs. I include the necessary…