相关论文: Correction. Perfect simulation for a class of posi…

Bayesian analysis for Markov jump processes is a non-trivial and challenging problem. Although exact inference is theoretically possible, it is computationally demanding thus its applicability is limited to a small class of problems. In…

We establish general theorems quantifying the notion of recurrence --- through an estimation of the moments of passage times --- for irreducible continuous-time Markov chains on countably infinite state spaces. Sharp conditions of…

An error in the paper [J. Math. Phys. 43, 6343 (2002); math-ph/0207009] is corrected. Further explanation is given.

Errors in the published version of the paper are corrected, and new figures are provided.

Orey (1962) proved that for an irreducible, aperiodic, and recurrent Markov chain with transition operator $P$, the sequence $P^n (\mu - \nu)$ converges to zero in total variation for any two probability measures $\mu$ and $\nu$. In other…

We show that very clear answers to the queries raised by D. Chen and R. Ni in their Comment on our recent paper [A. Zaccone, Phys. Rev. Lett. 128, 028002 (2022)] can be found in our original paper already. The paper [A. Zaccone, Phys. Rev.…

A new object of the probability theory, the two-sided chain of symbols (introduced in Ref. arXiv:physics/0306170) is used to study isotropy properties of binary multi-step Markov chains with the long-range correlations. Established…

Consider a Markov chain defined on a finite state space, X, that leaves invariant the uniform distribution on X, and whose transition probabilities are integer multiples of 1/Q, for some integer Q. I show how a simulation of n transitions…

Choosing a uniformly sampled simple directed graph realization of a degree sequence has many applications, in particular in social networks where self-loops are commonly not allowed. It has been shown in the past that one can perform a…

The random numbers driving Markov chain Monte Carlo (MCMC) simulation are usually modeled as independent U(0,1) random variables. Tribble [Markov chain Monte Carlo algorithms using completely uniformly distributed driving sequences (2007)…

Using the renewal approach we prove exponential inequalities for additive functionals and empirical processes of ergodic Markov chains, thus obtaining counterparts of inequalities for sums of independent random variables. The inequalities…

This survey consists of a detailed proof of Markov's Theorem based on Joan Birman's book "Braids, Links, and Mapping Class Groups" and Carlo Petronio's classes. It was part of an exam project in A.Y. 2016/2017 for the course Knot Theory.

We consider continuous--time Markov kinetics with a finite number of states and a given positive equilibrium distribution P*. For an arbitrary probability distribution $P$ we study the possible right hand sides, dP/dt, of the Kolmogorov…

We study some fundamental properties of real rectifiable currents and give a generalization of King's theorem in characterizing currents defined by positive real holomorphic chains. Our proof uses Siu's semicontinuity theorem and largely…

We propose a discrete time discrete space Markov chain approximation with a Brownian bridge correction for computing curvilinear boundary crossing probabilities of a general diffusion process on a finite time interval. For broad classes of…

In this paper we prove a sharp quantitative version of the Kendall's Theorem. The Kendal Theorem states that under some mild conditions imposed on a probability distribution on positive integers (i.e. probabilistic sequence) one can prove…

The switch Markov chain has been extensively studied as the most natural Markov Chain Monte Carlo approach for sampling graphs with prescribed degree sequences. We use comparison arguments with other, less natural but simpler to analyze,…

Given a sequence of i.i.d. random functions $\Psi_{n}:\mathbb{R}\to\mathbb{R}$, $n\in\mathbb{N}$, we consider the iterated function system and Markov chain which is recursively defined by $X_{0}^{x}:=x$ and…

We show that the minimax sample complexity for estimating the pseudo-spectral gap $\gamma_{\mathsf{ps}}$ of an ergodic Markov chain in constant multiplicative error is of the order of $$\tilde{\Theta}\left( \frac{1}{\gamma_{\mathsf{ps}}…

A novel procedure is described for accelerating the convergence of Markov chain Monte Carlo computations. The algorithm uses an adaptive bootstrap technique to generate candidate steps in the Markov Chain. It is efficient for symmetric,…