Related papers: A Generalization of Markov Numbers
Poissonian ensembles of Markov loops on a finite graph define a random graph process in which the addition of a loop can merge more than two connected components. We study Markov loops on the complete graph derived from a simple random walk…
We introduce a superanalogue of the classical Markov equation. This equation characterizes the ``shadow Markov numbers'' recently considered by one of us. We show that this equation is characterized by invariance by cluster algebra…
We apply recent bounds of the author (math.PR/0609224) for generalized Smirnov statistics to the distribution of integers whose prime factors satisfy certain systems of inequalities.
We show that the stationary distribution of a finite Markov chain can be expressed as the sum of certain normal distributions. These normal distributions are associated to planar graphs consisting of a straight line with attached loops. The…
The Chernoff bound is one of the most widely used tools in theoretical computer science. It's rare to find a randomized algorithm that doesn't employ a Chernoff bound in its analysis. The standard proofs of Chernoff bounds are beautiful but…
This book objective is to develop an algebraization of graph grammars. Equivalently, we study graph dynamics. From the point of view of a computer scientist, graph grammars are a natural generalization of Chomsky grammars for which a purely…
A new notion of typicality for arbitrary probability measures on standard Borel spaces is proposed, which encompasses the classical notions of weak and strong typicality as special cases. Useful lemmas about strong typical sets, including…
In this note, we consider general growth-fragmentation equations from a probabilistic point of view. Using Foster-Lyapunov techniques, we study the recurrence of the associated Markov process depending on the growth and fragmentation rates.…
We consider generic i.e., forming an everywhere dense massive subset classes of Markov operators in the space $L^2(X,\mu)$ with a finite continuous measure. Since there is a canonical correspondence that associates with each Markov operator…
We use recent results on algorithms for Markov decision problems to show that a canonical form for a generalized P-matrix can be computed, in some important cases, by a strongly polynomial algorithm.
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.
In this paper we look at which Alexander and Markov theories can be defined for generalized knot theories
We discuss the nature of structure-preserving maps of varies function algebras. In particular, we identify isomorphisms between special Colombeau algebras on manifolds with invertible manifold-valued generalized functions in the case of…
We propose new Markov Chain Monte Carlo algorithms to sample probability distributions on submanifolds, which generalize previous methods by allowing the use of set-valued maps in the proposal step of the MCMC algorithms. The motivation for…
In the present paper we find a simple algorithm for counting Jacobian group of the generalized Petersen graph GP(n,k). Also, we obtain a closed formula for the number of spanning trees of this graph in terms of Chebyshev polynomials.
We axiomatize and generalize Markov's approach to the continuity problem for Type 1 computable functions, i.e. the problem of finding sufficient conditions on a computable topological space to obtain a theorem of the form "computable…
The present work deals with the mathematical investigation of some generalizations of the Sz\'{a}sz operators. In this work, the multiple Sheffer polynomials are introduced. The generalization of Sz\'{a}sz operators involving multiple…
We define generalized cluster states based on finite group algebras in analogy to the generalization of the toric code to the Kitaev quantum double models. We do this by showing a general correspondence between systems with CSS structure…
The analysis of many problems of interest associated with Markov chains, e.g. stationary distributions, moments of first passage time distributions and moments of occupation time random variables, involves the solution of a system of linear…
Order-preserving couplings are elegant tools for obtaining robust estimates of the time-dependent and stationary distributions of Markov processes that are too complex to be analyzed exactly. The starting point of this paper is to study…