Related papers: Markov's Theorem
Markov chain models are used in various fields, such behavioral sciences or econometrics. Although the goodness of fit of the model is usually assessed by large sample approximation, it is desirable to use conditional tests if the sample…
This book provides a gentle introduction to the study of arithmetic subgroups of semisimple Lie groups. This means that the goal is to understand the group SL(n,Z) and certain of its subgroups. Among the major results discussed in the later…
The theory of ``Markov-up'' processes is being developed. This is a new class of stochastic processes with ``partial'' markovian features; it could also be called ``one-sided Markov''. Such a behavior may be found in the real world and in…
Recently, a plethora of multivariable knot polynomials were introduced by Kashaev and one of the authors, by applying the Reshetikhin-Turaev functor to rigid $R$-matrices that come from braided Hopf algebras with automorphisms. We study the…
The goal of these lectures is to survey some of the recent progress on the description of large-scale structure of random trees. We use the framework of Markov-Branching sequences of trees and discuss several applications.
This supplementary material includes three parts: some preliminary results, four examples, an experiment, three new algorithms, and all proofs of the results in the paper "Reversible MCMC on Markov equivalence classes of sparse directed…
In this article we show how Gr\"un's results in group theory can be used for studying the structure of class groups in normal extensions.
In this paper we introduce generalised Markov numbers and extend the classical Markov theory for the discrete Markov spectrum to the case of generalised Markov numbers. In particular we show recursive properties for these numbers and find…
From the perspective of probability, the stability of growing network is studied in the present paper. Using the DMS model as an example, we establish a relation between the growing network and Markov process. Based on the concept and…
In a previous work [11], the author considered a representation of the braid group \rho: B_n\to GL_m(\Bbb Z[q^{\pm 1},t^{\pm 1}]) (m=n(n-1)/2), and proved it to be faithful for n=4. Bigelow [3] then proved the same representation to be…
We review the recent approach to Markov chains using the Karnofksy-Rhodes and McCammond expansions in semigroup theory by the authors and illustrate them by two examples.
The Law of the Iterated Logarithm for some Markov operators, which converge exponentially to the invariant measure, is established. The operators correspond to iterated function systems which, for example, may be used to generalize the cell…
In this paper we define a monoid of pseudo braids and prove that this monoid is isomorphic to a singular braid monoid. We also prove an analogue of Markov's theorem for pseudo braids.
This article contains a complete proof of Gabrielov's rank Theorem, a fundamental result in the study of analytic map germs. Inspired by the works of Gabrielov and Tougeron, we develop formal-geometric techniques which clarify the difficult…
We use an example to provide evidence for the statement: the Vassiliev-Kontsevich invariants $k_n$ of a knot (or braid) $k$ can be redefined so that $k = \sum_0^\infty k_n$. This constructs a knot from its Vassiliev-Kontsevich invariants,…
In this paper, we develop the theory of contractive Markov systems initiated in \cite{Wer1}. We construct a coding map for such systems and investigate some of its properties.
For $N\in\mathbb{N}$, let $\pi_N$ be the law of the number of fixed points of a random permutation of $\{1, 2, ..., N\}$. Let $\mathcal{P}$ be a Poisson law of parameter 1.A classical result shows that $\pi_N$ converges to $\mathcal{P}$ for…
V.V. Sharko in his papers and books has investigated functions on manifolds and cobordism. Braids intimately connect with functions on manifolds. These connections are represented by mapping class groups of corresponding discs, by…
We prove an ergodic theorem for Markov chains indexed by the Ulam-Harris-Neveu tree over large subsets with arbitrary shape under two assumptions: with high probability, two vertices in the large subset are far from each other and have…
In this paper, we generalize the \textit{Clock Theorem} of Formal Knot Theory to knotoids in $S^2$. The clock theorem implies that clock states of a knotoid diagram form a lattice under transpositions. These states form the basis of many…