相关论文: Virtual Markov chains
We study the approximation of a (finite) continuous-time Markov chain by a Markov chain on a reduced state space, and we provide formal error bounds for the approximated transient distributions in the Wasserstein distance. These bounds…
Analyses of serially-sampled data often begin with the assumption that the observations represent discrete samples from a latent continuous-time stochastic process. The continuous-time Markov chain (CTMC) is one such generative model whose…
The virtual braid group $VB_n$, the virtual twin group $VT_n$ and the virtual triplet group $VL_n$ are extensions of the symmetric group $S_n$, which are motivated by the Alexander-Markov correspondence for virtual knot theories. The…
Two natural generalizations of knot theory are the study of spatially embedded graphs, and Kauffman's theory of virtual knots. In this paper we combine these approaches to begin the study of virtual spatial graphs.
We construct an infinite commutative lattice of groups whose dual spaces give Kauffman finite-type invariants of long virtual knots. The lattice is based "horizontally" upon the Polyak algebra and extended "vertically" using Manturov's…
In a quantum Markov chain, the temporal succession of states is modeled by the repeated action of a "bistochastic quantum operation" on the density matrix of a quantum system. Based on this conceptual framework, we derive some new results…
A sequence of real numbers (x_n) is Benford if the significands, i.e. the fraction parts in the floating-point representation of (x_n) are distributed logarithmically. Similarly, a discrete-time irreducible and aperiodic finite-state Markov…
We characterize the virtual link invariants that can be described as partition function of a real-valued R-matrix, by being weakly reflection positive. Weak reflection positivity is defined in terms of joining virtual link diagrams, which…
We introduce a Markov chain model of concurrent quantum programs. This model is a quantum generalization of Hart, Sharir and Pnueli's probabilistic concurrent programs. Some characterizations of the reachable space, uniformly repeatedly…
In this brief note, we find formulas for the distribution and the transition probability matrices of a stochastic process described as a time-reversion in a finite time window of a Markov chain, with cluster observation of the Markov state…
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…
Labelled Markov chains (LMCs) are widely used in probabilistic verification, speech recognition, computational biology, and many other fields. Checking two LMCs for equivalence is a classical problem subject to extensive studies, while the…
This paper presents a novel theoretical Monte Carlo Markov chain procedure in the framework of graphs. It specifically deals with the construction of a Markov chain whose empirical distribution converges to a given reference one. The Markov…
A notion of entangled Markov chain was introduced by Accardi and Fidaleo in the context of quantum random walk. They proved that, in the finite dimensional case, the corresponding states have vanishing entropy density, but they did not…
We compute many dimensions of spaces of finite type invariants of virtual knots (of several kinds) and the dimensions of the corresponding spaces of "weight systems", finding everything to be in agreement with the conjecture that "every…
We use techniques from Gromov-Witten theory to construct new invariants of matroids taking value in the Chow groups of spaces of rational curves in the permutohedral toric variety. When the matroid is realizable by a complex hyperplane…
Virtual singular braids are generalizations of singular braids and virtual braids. We define the virtual singular braid monoid via generators and relations, and prove Alexander- and Markov-type theorems for virtual singular links. We also…
We introduce a general class of distances (metrics) between Markov chains, which are based on linear behaviour. This class encompasses distances given topologically (such as the total variation distance or trace distance) as well as by…
In our works with Stoimenow, Vdovina and with Byberi, we introduced the virtual canonical genus $g_{vc}(K)$ and the virtual bridge number $vb(K)$ invariants of virtual knots. One can see from the definitions that for an classical knot $K$…
Reversible Markov chains play a central role in stochastic modelling and in algorithms such as Markov chain Monte Carlo (MCMC). Motivated by the fundamental importance of reversibility in classical settings, this paper develops a…