Related papers: Burau representation and random walk on string lin…

We introduce natural language processing into the study of knot theory, as made natural by the braid word representation of knots. We study the UNKNOT problem of determining whether or not a given knot is the unknot. After describing an…

In the present paper we study structural aspects of certain quotients of braid groups and virtual braid groups. In particular, we construct and study linear representations $B_n\to {\rm GL}_{n(n-1)/2}\left(\mathbb{Z}[t^{\pm1}]\right)$,…

We show that the transience or recurrence of a random walk in certain random environments on an arbitrary infinite locally finite tree is determined by the branching number of the tree, which is a measure of the average number of branches…

In this paper we show how generalized quaternions, including 2X2 matrices, can be used to find solutions of a non-commuting equation intimately connected with braid groups. These solutions can then be used to find polynomial invariants of…

We systematically investigate the problem of representing Markov chains by families of random maps, and which regularity of these maps can be achieved depending on the properties of the probability measures. Our key idea is to use…

The problem of predicting links in large networks is an important task in a variety of practical applications, including social sciences, biology and computer security. In this paper, statistical techniques for link prediction based on the…

In the present paper we give a new method for converting virtual knots and links to virtual braids. Indeed the braiding method given in this paper is quite general, and applies to all the categories in which braiding can be accomplished. We…

We introduce "book links" as a generalization of braids in open book decompositions; this new class of objects includes both braids and plats as special cases. We then prove a version of Markov's theorem in this general setting by extending…

Let $m_{ij}$ be the mean first passage time from state $i$ to state $j$ in an $n$-state ergodic homogeneous Markov chain with transition matrix $T$. Let $G$ be the weighted digraph without loops whose vertex set coincides with the set of…

Due to wide applications in diverse fields, random walks subject to stochastic resetting have attracted considerable attention in the last decade. In this paper, we study discrete-time random walks on complex network with multiple resetting…

Contrary to the theory of Markov processes, no general theory exists for the so called nonlinear Markov processes. We study an example of "nonlinear Markov process" related to classical probability theory, merely to random walks. This model…

We develop a calculus of surgery data, called bridged links, which involves besides links also pairs of balls that describe one-handle attachements. As opposed to the usual link calculi of Kirby and others this description uses only…

Random walks play an important role in probing the structure of complex networks. On traditional networks, they can be used to extract community structure, understand node centrality, perform link prediction, or capture the similarity…

This paper introduces the concept of random context representations for the transition probabilities of a finite-alphabet stochastic process. Processes with these representations generalize context tree processes (a.k.a. variable length…

We give a new proof of Markov's classical theorem relating any two closed braid representations of the same knot or link. The proof is based upon ideas in a forthcoming paper by the authors, "Stabilization in the braid groups". The new…

A new extension of the sub-fractional Brownian motion, and thus of the Brownian motion, is introduced. It is a linear combination of a finite number of sub-fractional Brownian motions, that we have chosen to call the mixed sub-fractional…

The time process of transport on randomly evolving trees is investigated. By introducing the notions of living and dead nodes a model of random tree evolution is constructed which describes the spreading in time of objects corresponding to…

Random walks are a fundamental model in applied mathematics and are a common example of a Markov chain. The limiting stationary distribution of the Markov chain represents the fraction of the time spent in each state during the stochastic…

Invariant theory is concerned with functions that do not change under the action of a given group. Here we communicate an approach based on tensor networks to represent polynomial local unitary invariants of quantum states. This graphical…

We give three different criteria for transience of a Branching Markov Chain. These conditions enable us to give a classification of Branching Random Walks in Random Environment (BRWRE) on Cayley Graphs in recurrence and transience. This…