Related papers: On some properties of transitions operators
Formal Laplace operators are analyzed for a large class of resistance networks with vertex weights. The graphs are completed with respect to the minimal resistance path metric. Compactness and a novel connectivity hypothesis for the…
We consider semigroups of continuous, surjective, locally injective maps of a compact metric space, and whether such semigroups admit a transfer operator.
In this short paper, we consider the Once-reinforced random walk with reinforcement parameter $a$ on trees with bounded degree which are transient for the simple random walk. On each of these trees, we prove that there exists an explicit…
The concept of intransitiveness for games, which is the condition for which there is no first-player winning strategy can arise surprisingly, as happens in the Penney game, an extension of the heads or tails. Since a game can be converted…
A random phase property establishing a link between quasi-one-dimensional random Schroedinger operators and full random matrix theory is advocated. Briefly summarized it states that the random transfer matrices placed into a normal system…
In this work we study the main dynamical properties of the push-forward map, a transformation in the space of probabilities P(X) induced by a map T: X \to X, X a compact metric space. We also establish a connection between topological…
Given a discrete random walk on a finite graph $G$, the vacant set and vacant net are, respectively, the sets of vertices and edges which remain unvisited by the walk at a given step $t$.%These sets induce subgraphs of the underlying graph.…
We develope the framework of transitional conditional independence. For this we introduce transition probability spaces and transitional random variables. These constructions will generalize, strengthen and unify previous notions of…
We discuss ways in which momentum operators can be introduced on an oriented metric graph. A necessary condition appears to the balanced property, or a matching between the numbers of incoming and outgoing edges; we show that a graph…
There is a condition (T'), such that it is the necessary condition that a random walk in random environment is ballistic. Under this condition, we show the law of the iterated logarithm for a random walk in random environment.
We establish a sufficient condition for a continuous map, acting on a compact metric space, to have a Baire residual set of points exhibiting historic behavior (also known as irregular points). This criterion applies, for instance, to a…
An infinite graph G has the property that a random walk in random environment on G defined by i.i.d. resistances with any common distribution is almost surely transient, if and only if for some p<1, simple random walk is transient on a…
Given a pair $(M,X)$, where $X$ is a smooth submanifold in a closed smooth manifold $M$, we study the operation, which takes each operator $D$ on the ambient manifold to a certain operator on the submanifold. The latter operator is called…
We study the quantum-mechanical transport on two-dimensional graphs by means of continuous-time quantum walks and analyse the effect of different boundary conditions (BCs). For periodic BCs in both directions, i.e., for tori, the problem…
We consider large deviations for nearest-neighbor random walk in a uniformly elliptic i.i.d. environment on $\mathbb{Z}^d$. There exist variational formulae for the quenched and averaged rate functions $I_q$ and $I_a$, obtained by…
Let $A$ and $B$ be compact operators over a topological space $X$ and suppose that these operators are normal and have same distinct eigenvalues at each point. By obstruction theory, we establish a necessary and sufficient condition for $A$…
On finite metric graphs the set of all realizations of the Laplace operator in the edgewise defined $L^2$-spaces are studied. These are defined by coupling boundary conditions at the vertices most of which define non-self-adjoint operators.…
We analyze the properties of degree-preserving Markov chains based on elementary edge switchings in undirected and directed graphs. We give exact yet simple formulas for the mobility of a graph (the number of possible moves) in terms of its…
We describe a general approach to the theory of self consistent transfer operators. These operators have been introduced as tools for the study of the statistical properties of a large number of all to all interacting dynamical systems…
We consider a random walk on the first quadrant of the square lattice, whose increment law is, roughly speaking, homogeneous along a finite number of half-lines near each of the two boundaries, and hence essentially specified by…