Related papers: On some properties of transitions operators
We explore the existence of a class of generalised Laplace maps for third order partial differential operators of the form…
We prove the boundedness on $L^p$, $1<p<\infty$, of operators on manifolds which arise by taking conditional expectation of transformations of stochastic integrals. These operators include various classical operators such as second order…
A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. If this unitary evolution operator has an associated group of symmetries, then for certain…
The paper presents two results. The first one provides separate conditions for the upper and lower estimate of the distribution of the exit time from balls of a random walk on a weighted graph. The main result of the paper is that the lower…
We present a generalized definition of discrete-time quantum walks convenient for capturing a rather broad spectrum of walker's behavior on arbitrary graphs. It includes and covers both: the geometry of possible walker's positions with…
Laplacian operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of $\delta$ and $\delta'$ types. An infinite series of trace formulae is obtained which link together two…
We present an explicit formula for the characteristic polynomial of the transition matrix of the discrete-time quantum walk on a graph via the second weighted zeta function. As applications, we obtain new proofs for the results on spectra…
Starting from the approach to the Laplacian with respect to coupling measures and undirected weighted graphs, we provide a setting for a general point of view for a Kirchhoff type divergence and a Laplace operators built on the trivial…
I start by reviewing some basic properties of random graphs. I then consider the role of random walks in complex networks and show how they may be used to explain why so many long tailed distributions are found in real data sets. The key…
In this paper we study the component structure of random graphs with independence between the edges. Under mild assumptions, we determine whether there is a giant component, and find its asymptotic size when it exists. We assume that the…
We expand on some invariants used for classifying nonselfadjoint operator algebras. Specifically to nonselfadjoint operator algebras which have a conditional expectation onto a commutative diagonal we construct an edge-colored directed…
Random walks on graphs are widely used in all sciences to describe a great variety of phenomena where dynamical random processes are affected by topology. In recent years, relevant mathematical results have been obtained in this field, and…
Let $\mu_1,... \mu_k$ be $d$-dimensional probability measures in $\R^d$ with mean 0. At each step we choose one of the measures based on the history of the process and take a step according to that measure. We give conditions for transience…
We study the Ergodic Properties of Random Walks in stationary ergodic environments without uniform ellipticity under a minimal assumption. There are two main components in our work. The first step is to adopt the arguments of Lawler to…
We study random walks in a random environment on a regular, rooted, coloured tree. The asymptotic behaviour of the walks is classified for ergodicity/transience in terms of the geometric properties of the matrix describing the random…
Consider the random Cayley graph of a finite group $G$ with respect to $k$ generators chosen uniformly at random, with $1 \ll k \lesssim \log |G|$. The results of this article supplement those in the three main papers on random Cayley…
We consider the Dyson hierarchical graph $\mathcal{G}$, that is a weighted fully-connected graph, where the pattern of weights is ruled by the parameter $\sigma \in (1/2, 1]$. Exploiting the deterministic recursivity through which…
A reduction of the transmission eigenvalue problem for multiplicative sign-definite perturbations of elliptic operators with constant coefficients to an eigenvalue problem for a non-selfadjoint compact operator is given. Sufficient…
Here we introduce connectivity operators, namely, diffusion operators, general Laplacian operators, and general adjacency operators for hypergraphs. These operators are generalisations of some conventional notions of apparently different…
This article represents a major step in the unification of the theory of algebraic, topological and singular transition matrices by introducing a definition which is a generalization that encompasses all of the previous three. When this…