Related papers: Markov chain aggregation and its application to ru…
Big networks express various large-scale networks in many practical areas such as computer networks, internet of things, cloud computation, manufacturing systems, transportation networks, and healthcare systems. This paper analyzes such big…
This paper analyses of a stochastic model of a chemical reaction network with three types of chemical species ${\cal R}$, ${\cal M}$ and ${\cal U}$ that interact to transform a flow of external resources, the chemical species ${\cal Q}$, to…
In this paper we investigate the continuum limits of a class of Markov chains. The investigation of such limits is motivated by the desire to model very large networks. We show that under some conditions, a sequence of Markov chains…
Approximate Bayesian Computation is widely used to infer the parameters of discrete-state continuous-time Markov networks. In this work, we focus on models that are governed by the Chemical Master Equation (the CME). Whilst originally…
Machine learning algorithms have been applied to predict agent behaviors in real-world dynamic systems, such as advertiser behaviors in sponsored search and worker behaviors in crowdsourcing. The behavior data in these systems are generated…
The problem of efficiently sampling from a set of(undirected) graphs with a given degree sequence has many applications. One approach to this problem uses a simple Markov chain, which we call the switch chain, to perform the sampling. The…
Kingman's coalescent is a widely used process to model sample genealogies in population genetics. Recently there have been studies on the inference of quantities related to the genealogy of additional individuals given a known sample. This…
Imprecise continuous-time Markov chains are a robust type of continuous-time Markov chains that allow for partially specified time-dependent parameters. Computing inferences for them requires the solution of a non-linear differential…
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…
We formulate some simple conditions under which a Markov chain may be approximated by the solution to a differential equation, with quantifiable error probabilities. The role of a choice of coordinate functions for the Markov chain is…
The Markov Chain Monte Carlo method is the dominant paradigm for posterior computation in Bayesian analysis. It is common to control computation time by making approximations to the Markov transition kernel. Comparatively little attention…
Graph association rule mining is a data mining technique used for discovering regularities in graph data. In this study, we propose a novel concept, {\it path association rule mining}, to discover the correlations of path patterns that…
Structure-based coarse graining of molecular systems offers a systematic route to reproduce the many-body potential of mean force. Unfortunately, common strategies are inherently limited by the molecular mechanics force field employed.…
In this paper we study various properties of finite stochastic systems or hidden Markov chains as they are alternatively called. We discuss their construction following different approaches and we also derive recursive filtering formulas…
We consider a strictly substochastic matrix or an stochastic matrix with absorbing states. By using quasi-stationary distributions one shows there is a canonical associated stationary Markov chain. Based upon $2-$stringing representation of…
Empirical likelihood is a powerful semi-parametric method increasingly investigated in the literature. However, most authors essentially focus on an i.i.d. setting. In the case of dependent data, the classical empirical likelihood method…
We develop a practical approach to establish the stability, that is, the recurrence in a given set, of a large class of controlled Markov chains. These processes arise in various areas of applied science and encompass important numerical…
A function on the state space of a Markov chain is a "lumping" if observing only the function values gives a Markov chain. We give very general conditions for lumpings of a large class of algebraically-defined Markov chains, which include…
Aggregation processes with an arbitrary number of conserved quantities are investigated. On the mean-field level, an exact solution for the size distribution is obtained. The asymptotic form of this solution exhibits nontrivial ``double''…
Molecular dynamics (MD) simulations can model the interactions between macromolecules with high spatiotemporal resolution but at a high computational cost. By combining high-throughput MD with Markov state models (MSMs), it is now possible…