相关论文: Wiener-Hopf Factorization for Time-Inhomogeneous M…

We consider Markov chains with random transition probabilities which, moreover, fluctuate randomly with time. We describe such a system by a product of stochastic matrices, $U(t)=M_t\cdots M_1$, with the factors $M_i$ drawn independently…

We consider moments of the return times (or first hitting times) in a discrete time discrete space Markov chain. It is classical that the finiteness of the first moment of a return time of one state implies the finiteness of the first…

According to the Wiener-Hopf factorization, the characteristic function $\varphi$ of any probability distribution $\mu$ on $\mathbb{R}$ can be decomposed in a unique way as…

Markov chain Monte Carlo algorithms play a key role in the Bayesian approach to phylogenetic inference. In this paper, we present the first theoretical work analyzing the rate of convergence of several Markov chains widely used in…

The Turing-Hopf type spatiotemporal patterns in a diffusive Holling-Tanner model with discrete time delay is considered. A global Turing bifurcation theorem for $\tau=0$ and a local Turing bifurcation theorem for $\tau>0$ are given by the…

In this paper, we discuss integer-valued autoregressive time series (INAR), Hawkes point processes, and their interrelationship. Besides presenting structural analogies, we derive a convergence theorem. More specifically, we generalize the…

The embedding problem of Markov transition matrices into continuous-time Markov semigroups is a classic problem that regained a lot of impetus and activities in recent years. We consider it here for the following generalisation of the…

Labeled continuous-time Markov chains (CTMCs) describe processes subject to random timing and partial observability. In applications such as runtime monitoring, we must incorporate past observations. The timing of these observations matters…

A general theory is developed to study individual based models which are discrete in time. We begin by constructing a Markov chain model that converges to a one-dimensional map in the infinite population limit. Stochastic fluctuations are…

Let $\{W_t\}_{t=1}^{\infty}$ be a finite state stationary Markov chain, and suppose that $f$ is a real-valued function on the state space. If $f$ is bounded, then Gillman's expander Chernoff bound (1993) provides concentration estimates for…

We study a time-non-homogeneous Markov process which arose from free probability, and which also appeared in the study of stochastic processes with linear regressions and quadratic conditional variances. Our main result is the explicit…

We provide a characterisation of the continuous-time Markov models where the Markov matrices from the model can be parameterised directly in terms of the associated rate matrices (generators). That is, each Markov matrix can be expressed as…

In this work, we consider a finite-state inhomogeneous-time Markov chain whose probabilities of transition from one state to another tend to decrease over time. This can be seen as a cooling of the dynamics of an underlying Markov chain. We…

Markov chains for probability distributions related to matrix product states and 1D Hamiltonians are introduced. With appropriate 'inverse temperature' schedules, these chains can be combined into a random approximation scheme for ground…

We prove existence and uniqueness of solutions to Fokker--Planck equations associated to Markov operators multiplicatively perturbed by degenerate time-inhomogeneous coefficients. Precise conditions on the time-inhomogeneous coefficients…

Let us consider a homogeneous Markov chain with discrete time and with a finite set of states $E_0,\ldots,E_n$ such that the state $E_0$ is absorbing, states $E_1,\ldots,E_n$ are nonrecurrent. The goal of this work is to study frequencies…

We study the problem of invariance of indices of thematic factorizations. Such factorizations were introduced in [PY1] for studying superoptimal approximation by bounded analytic matrix functions. As shown in [PY1], the indices may depend…

Markov chains are a convenient means of generating realizations of networks, since they require little more than a procedure for rewiring edges. If a rewiring procedure exists for generating new graphs with specified statistical properties,…

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 paper presents a unifying theory of Linear second order systems that allows time-varying and time invariant systems to be treated in the same way for the first time. In the process, a transformation is given that diagonalizes an…