Related papers: Brownian Motion on The Spider Like Quantum Graphs
A particle moves randomly over the integer points of the real line. Jumps of the particle outside the membrane (a fixed "locally perturbating set") are i.i.d., have zero mean and finite variance, whereas jumps of the particle from the…
The single graphene layer is a novel material consisting of a flat monolayer of carbon atoms packed in a two-dimensional honeycomb-lattice, in which the electron dynamics is governed by the Dirac equation. A pseudo-spin phase-space approach…
We analyze quantal Brownian motion in $d$ dimensions using the unified model for diffusion localization and dissipation, and Feynman-Vernon formalism. At high temperatures the propagator possess a Markovian property and we can write down an…
We discuss a particular kind of quantum walk on a general graph. We affix two semi-infinite lines to a general finite graph, which we call tails. On the tails, the particle making the walk simply advances one unit at each time step, so that…
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…
An old problem in mathematical physics deals with the structure of the dispersion relation of the Schr\"odinger operator $-\Delta+V(x)$ in $R^n$ with periodic potential near the edges of the spectrum. A well known conjecture says that…
This is the first of a series of papers considering symmetry properties of quantum systems over 2D graphs or manifolds, with continuous spins, in the spirit of the Mermin--Wagner theorem. In the model considered here (quantum rotators) the…
Many signals evolve in time as a stochastic process, randomly switching between states over discretely sampled time points. Here we make an explicit link between the underlying stochastic process of a signal that can take on a bounded…
We consider the statics and dynamics of distinguishable spin-1/2 systems on an arbitrary graph G with N vertices. In particular, we consider systems of quantum spins evolving according to one of two hamiltonians: (i) the XY hamiltonian…
We set the ground for a theory of quantum walks on graphs- the generalization of random walks on finite graphs to the quantum world. Such quantum walks do not converge to any stationary distribution, as they are unitary and reversible.…
We study the empirical spectral distribution of the normalized Laplacian of linear preferential attachment graphs in the Barab{\'a}si-Albert regime with fixed out-degree. For the resulting sequence of random multigraphs, we prove that the…
Brownian dynamics of Dirac fermions in twisted bilayer graphene is investigated within the framework of semiclassical relativistic Langevin equations. We find that under the influence of orthogonal, commensurate ac drives in the periodic…
We introduce a novel quantum algorithm for similar subgraph identification in form of an NP-hard cardinality-constrained binary quadratic optimization problem. Given a weighted reference graph with Laplacian $\boldsymbol{B}$, our algorithm…
We consider scaled Brownian motion (sBm), a random process described by a diffusion equation with explicitly time-dependent diffusion coefficient $D(t) = D_0 t^{\alpha - 1}$ (Batchelor's equation) which, for $\alpha < 1$, is often used for…
The (standard) Brownian web is a collection of coalescing one- dimensional Brownian motions, starting from each point in space and time. It arises as the diffusive scaling limit of a collection of coalescing random walks. We show that it is…
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the submanifold. The graph Laplacian of such a graph is used in…
Quantum walks are roughly analogous to classical random walks, and like classical walks they have been used to find new (quantum) algorithms. When studying the behavior of large graphs or combinations of graphs it is useful to find the…
The join $X\vee Y$ of two graphs $X$ and $Y$ is the graph obtained by joining each vertex of $X$ to each vertex of $Y$. We explore the behaviour of a continuous quantum walk on a weighted join graph having the adjacency matrix or Laplacian…
The stationary reflected Brownian motion in a three-quarter plane has been rarely analyzed in the probabilistic literature, in comparison with the quarter plane analogue model. In this context, our main result is to prove that the…
In this paper we study spectral properties of Schr\"odinger operators with quasi-periodic potentials related to quasi-periodic action minimizing trajectories for analytic twist maps. We prove that the spectrum contains a component of…