Related papers: On some properties of transitions operators
We introduce a class of operators associated with the signature of a smooth path $X$ with values in a $C^{\star}$ algebra $\mathcal{A}$. These operators serve as the basis of Taylor expansions of solutions to controlled differential…
In this paper we show that a non-local operator of certain type extends to the generator of a strong Markov process, admitting the transition probability density. For this transition probability density we construct the intrinsic upper and…
We consider a walker that at each step keeps the same direction with a probabilitythat depends on the time already spent in the direction the walker is currently moving. In this paper, we study some asymptotic properties of this persistent…
A connection between the asymptotic behavior of the open quantum walk and the spectrum of a generalized quantum coins is studied. For the case of simultaneously diagonalizable transition operators an exact expression for probability…
We construct the conditional version of $k$ independent and identically distributed random walks on $\R$ given that they stay in strict order at all times. This is a generalisation of so-called non-colliding or non-intersecting random…
A cyclic random walk is a random walk whose transition probabilities/rates can be written as a superposition of the empirical measures of a family of finite cycles. This identifies a convex set of models. We discuss the problem of…
We investigate properties of spectrum of normalized Laplacian $\mathcal L$ for finite graphs over non-Archimedean ordered fields. We prove a Cheeger's inequality for first non-zero eigenvalue. Then we describe properties of the operator…
Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…
We continue the development of transfer operator techniques for expanding maps on a lattice coupled by general interaction functions. We obtain a spectral gap for an appropriately defined transfer operator, and, as corollaries, the…
Establishing cutoff, an abrupt transition from "not mixed" to "well mixed", is a classical topic in the theory of mixing times for Markov chains. Interest has grown recently in determining not only the existence of cutoff and the order of…
We give a necessary and sufficient condition on a positive compact operator $T$ for the existence of a singular trace (i.e. a trace vanishing on the finite rank operators) which takes a finite non-zero value on $T$. This generalizes…
In this paper we introduce the notion of Random Walk in Changing Environment - a random walk in which each step is performed in a different graph on the same set of vertices, or more generally, a weighted random walk on the same vertex and…
One can view quantum mechanics as a generalization of classical probability theory that provides for pairwise interference among alternatives. Adopting this perspective, we ``quantize'' the classical random walk by finding, subject to a…
The spectral determinant of the Schr\"odinger operator ($ - \Delta + V(x) $) on a graph is computed for general boundary conditions. ($\Delta$ is the Laplacian and $V(x)$ is some potential defined on the graph). Applications to restricted…
We discuss the relationship between the capacity and the geometry for the range of the random walk for $d=3$. In particular, we consider how efficiently the random walk moves or what shape it forms in order to maximize its capacity. In one…
We consider a random walk on a $d$-regular graph $G$ where $d\to\infty$ and $G$ satisfies certain conditions. Our prime example is the $d$-dimensional hypercube, which has $n=2^d$ vertices. We explore the likely component structure of the…
A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution…
A network is a countable, connected graph X viewed as a one-complex, where each edge [x,y]=[y,x] (x,y in X^0, the vertex set) is a copy of the unit interval within the graph's one-skeleton X^1 and is assigned a positive conductance c(xy). A…
A quantum walk places a traverser into a superposition of both graph location and traversal "spin." The walk is defined by an initial condition, an evolution determined by a unitary coin/shift-operator, and a measurement based on the…
This note illustrates how a simple random walk with possibly long jumps is related to fractional powers of the Laplace operator. The exposition is elementary and self-contained.