相关论文: Random walks on the BMW monoid: an algebraic appro…

The ordinary (or classical) Birman-Wenzl-Murakami algebras were initially conceived as an algebraic framework for the Kauffman link invariant. They also appear as centralizer algebras for representations of quantum universal enveloping…

The cyclotomic Birman-Murakami-Wenzl (or BMW) algebras B_n^k, introduced by R. Haring-Oldenburg, are extensions of the cyclotomic Hecke algebras of Ariki-Koike, in the same way as the BMW algebras are extensions of the Hecke algebras of…

We classify the Markov traces factoring through the Birman-Wenzl-Murakami (BMW) algebras. For this purpose, we define a common `cover' for the two variations of the BMW-algebra originating from the quantum orthogonal/symplectic duality,…

Different models of random walks on the dual graphs of compact urban structures are considered. Analysis of access times between streets helps to detect the city modularity. The statistical mechanics approach to the ensembles of lazy random…

In this article, we develop a theory for understanding the traces left by a random walk in the vicinity of a randomly chosen reference vertex. The analysis is related to interlacements but goes beyond previous research by showing weak limit…

----- Please see the pdf file for the actual abstract and important remarks, which could not be put here due to the arXiv length restrictions. ----- This thesis presents a study of the cyclotomic BMW (Birman-Murakami-Wenzl) algebras,…

Novel Markov Chain Monte Carlo (MCMC) methods have enabled the generation of large ensembles of redistricting plans through graph partitioning. However, existing algorithms such as Reversible Recombination (RevReCom) and Metropolized Forest…

We show how a Monte Carlo method for generating self-avoiding walks on lattice geometries which employs a binary-tree data structure can be adapted for hard-sphere polymers with continuous degrees of freedom. Data suggests that the time per…

Random Walk is a basic algorithm to explore the structure of networks, which can be used in many tasks, such as local community detection and network embedding. Existing random walk methods are based on single networks that contain limited…

The involution walk is the random walk on $S_n$ generated by involutions with a binomially distributed with parameter $1-p$ number of $2$-cycles. This is a parallelization of the transposition walk. The involution walk is shown in this…

Consider a one dimensional simple random walk $X=(X_n)_{n\geq0}$. We form a new simple symmetric random walk $Y=(Y_n)_{n\geq0}$ by taking sums of products of the increments of $X$ and study the two-dimensional walk…

For $\lambda>0$, we define a $\lambda$-damped random walk to be a random walk that is started from a random vertex of a graph and stopped at each step with probability $\frac{\lambda}{1+\lambda}$, otherwise continued with probability…

Random walk centrality is a fundamental metric in graph mining for quantifying node importance and influence, defined as the weighted average of hitting times to a node from all other nodes. Despite its ability to capture rich graph…

Cubical complexes are metric spaces constructed by gluing together unit cubes in an analogous way to the construction of simplicial complexes. We construct Brownian motion on such spaces, define random walks, and prove that the transition…

We propose local-biased random walks on general networks where a Markovian walker can choose between different types of biases in each node to define transitions to its neighbors depending on their degrees. For this ergodic dynamics, we…

We consider random walks in which the walk originates in one set of nodes and then continues until it reaches one or more nodes in a target set. The time required for the walk to reach the target set is of interest in understanding the…

Random walk kernels have been introduced in seminal work on graph learning and were later largely superseded by kernels based on the Weisfeiler-Leman test for graph isomorphism. We give a unified view on both classes of graph kernels. We…

We study the properties of discrete-time random walks on networks formed by randomly interconnected cliques, namely, random networks of cliques. Our purpose is to derive the parameters that define the network structure -- specifically, the…

The random walk Metropolis (RWM) is one of the most common Markov chain Monte Carlo algorithms in practical use today. Its theoretical properties have been extensively explored for certain classes of target, and a number of results with…

We construct a new inductive basis of the Birman-Murakami-Wenzl algebra. Using it, we provide a new proof of the existence of the Markov trace on the BMW algebras affording the two-variable Kauffman polynomial. We prove also that all the…