Related papers: Markov's Theorem
In this paper, we state and prove precise theorems on the classification of the category of (braided) categorical groups and their (braided) monoidal functors, and some applications obtained from the basic studies on monoidal functors…
A new approach is developed for evaluating the convergence rate for nonlinear Markov chains (MC) based on the recently developed spectral radius technique of markovian coupling for linear MC and the idea of small nonlinear perturbations of…
This article is a tutorial on Markov chain Monte Carlo simulations and their statistical analysis. The theoretical concepts are illustrated through many numerical assignments from the author's book on the subject. Computer code (in Fortran)…
It has been conjectured that the algebraic crossing number of a link is uniquely determined in minimal braid representation. This conjecture is true for many classes of knots and links. The Morton-Franks-Williams inequality gives a lower…
The invariant measure is a fundamental object in the theory of Markov processes. In finite dimensions a Markov process is defined by transition rates of the corresponding stochastic matrix. The Markov tree theorem provides an explicit…
The paper extends Birkhoff's theorem on doubly stochastic matrices to some countable families of discrete probability spaces with nonempty intersections. We join every two elements lying in the same probability space by an edge and…
In this paper we indicate one method of construction of linear representations of groups and algebras with translation invariant (except, maybe , finite number) defining relationships. As an illustration of this method, we give one approach…
This is a survey on permutation classes for the upcoming book Handbook of Enumerative Combinatorics.
We study the problem of learning the Markov order in categorical sequences that represent paths in a network, i.e. sequences of variable lengths where transitions between states are constrained to a known graph. Such data pose challenges…
This paper is devoted to the proof of a structural theorem, concerning certain homomorphic images of Artin braid group on $n$ strands in finite symmetric groups. It is shown that any one of these permutation groups is an extension of the…
We propose a method for learning Markov network structures for continuous data without invoking any assumptions about the distribution of the variables. The method makes use of previous work on a non-parametric estimator for mutual…
This is the second of three papers about the Compression Theorem. We give proofs of Gromov's theorem on directed embeddings [M Gromov, Partial differential relations, Springer--Verlag (1986); 2.4.5 C'] and of the Normal Deformation Theorem…
In this short note we provide an alternative proof of a theorem of Kapovich and Millson about the Malcev completion of an arbitrary Artin group, and determine the Malcev completion of the braid group of an irreducible finite complex…
We present a short proof of the following Pontryagin theorem, whose original proof was complicated and has never been published in details: {\bf Theorem.} Let $M$ be a connected oriented closed smooth 3-manifold. Let $L_1(M)$ be the set of…
In earlier work we introduced the graph bracket polynomial of graphs with marked vertices, motivated by the fact that the Kauffman bracket of a link diagram D is determined by a looped, marked version of the interlacement graph associated…
Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.
The purpose of this note is to prove a conjecture of Shvartsman relating a complex projective reflection group with the quotient of a suitable complex braid group by its center. Shvartsman originally proved this result in the case of real…
We introduce partial Markov categories. In the same way that Markov categories encode stochastic processes, partial Markov categories encode stochastic processes with constraints, observations and updates. In particular, we prove a…
In recent work discussing model choice for continuous-time Markov chains, we have argued that it is important that the Markov matrices that define the model are closed under matrix multiplication (Sumner 2012a, 2012b). The primary…
The classical Thistlethwaite theorem for links can be phrased as asserting that the Kauffman bracket of a link can be obtained from an evaluation of the Bollob\'as-Riordan polynomial of a ribbon graph associated to one of the link's…