Related papers: Burau representation and random walk on string lin…
Let {X_n,n\geq0} be a Markov chain on a general state space X with transition probability P and stationary probability \pi. Suppose an additive component S_n takes values in the real line R and is adjoined to the chain such that…
Several state-of-the-art neural graph embedding methods are based on short random walks (stochastic processes) because of their ease of computation, simplicity in capturing complex local graph properties, scalability, and interpretibility.…
This work deals with the stationary analysis of two-dimensional partially homogeneous nearest-neighbour random walks. Such type of random walks in the quarter plane are characterized by the fact that the one-step transition probabilities…
A new model that maps a quantum random walk described by a Hadamard operator to a particular case of a random walk is presented. The model is represented by a Markov chain with a stochastic matrix, i.e., all the transition rates are…
Twisted knot theory, introduced by M.O. Bourgoin, is a generalization of virtual knot theory. It naturally yields the notion of a twisted braid, which is closely related to the notion of a virtual braid due to Kauffman. In this paper, we…
We define the probability structure of a continuous-time time-homogeneous Markov jump process, on a finite graph, that represents the continuous-time counterpart of the so-called Ruelle-Bowen discrete-time random walk. It constitutes the…
This work presents an approach towards the representation theory of the braid groups $B_n$. We focus on finite-dimensional representations over the field of Laurent series which can be obtained from representations of infinitesimal braids,…
We present an elementary introduction to one of the most important today knot theory approaches, which gives rise to a representation for a class of knot polynomials in terms of quantum groups. Historically, the approach was at the same…
This work deals with the stationary analysis of two-dimensional partially homogeneous nearest-neighbour random walks. Such type of random walks are characterized by the fact that the one-step transition probabilities are functions of the…
Continuous-time Bayesian networks is a natural structured representation language for multicomponent stochastic processes that evolve continuously over time. Despite the compact representation, inference in such models is intractable even…
We derive a probabilistic representation for the Fourier symbols of the generators of some stable processes.
In operator algebra, the linearization trick is a technique that reduces the study of a non-commutative polynomial evaluated at elements of an algebra A to the study of a polynomial of degree one, evaluated on the enlarged algebra A x M r…
We propose a family of new representations of the braid groups on surfaces that extend linear representations of the braid groups on a disc such as the Burau representation and the Lawrence-Krammer-Bigelow representation.
The necklace braid group $\mathcal{NB}_n$ is the motion group of the $n+1$ component necklace link $\mathcal{L}_n$ in Euclidean $\mathbb{R}^3$. Here $\mathcal{L}_n$ consists of $n$ pairwise unlinked Euclidean circles each linked to an…
We consider Markov chains on partially ordered sets that generalize the success-runs and remaining life chains in reliability theory. We find conditions for recurrence and transience and give simple expressions for the invariant…
We give a method to produce faithful representations of the groups $G(n,m)=\langle X, Y \ \vert \ X^m = Y^n \rangle$ in $\mathrm{GL}_2(\mathbb{C}[t^{\pm 1}, q^{\pm 1}])$. These groups are Garside groups and the Garside normal forms of…
Necessary and sufficient conditions for a Markov chain to be ergodic are that the chain is irreducible and aperiodic. This result is manifest in the case of random walks on finite groups by a statement about the support of the driving…
We study the twirling semigroups of (super)operators, namely, certain quantum dynamical semigroups that are associated, in a natural way, with the pairs formed by a projective representation of a locally compact group and a convolution…
In this paper, we present a numerical framework for constructing bounds on stationary performance measures of random walks in the positive orthant using the Markov reward approach. These bounds are established in terms of stationary…
In the eighties, A. Connes and E. J. Woods made a connection between hyperfinite von Neumann algebras and Poisson boundaries of time dependent random walks. The present paper explains this connection and gives a detailed proof of two…