English
Related papers

Related papers: Fluid Limits of Pure Jump Markov Processes: a Prac…

200 papers

In this paper we discuss weak convergence of continuous-time Markov chains to a non-symmetric pure jump process. We approach this problem using Dirichlet forms as well as semimartingales. As an application, we discuss how to approximate a…

Probability · Mathematics 2016-11-23 Ante Mimica , Nikola Sandrić , René L. Schilling

Markov chain Monte Carlo methods are central in computational statistics, and typically rely on detailed balance to ensure invariance with respect to a target distribution. Although straightforward to construct by Metropolization, this can…

Statistics Theory · Mathematics 2025-11-14 Erik Jansson , Moritz Schauer , Ruben Seyer , Akash Sharma

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…

Networking and Internet Architecture · Computer Science 2011-06-22 Yang Zhang , Edwin K. P. Chong , Jan Hannig , Donald Estep

The study of time-inhomogeneous Markov jump processes is a traditional topic within probability theory that has recently attracted substantial attention in various applications. However, their flexibility also incurs a substantial…

Probability · Mathematics 2023-11-03 Martin Bladt , Oscar Peralta

We consider the Markov chain approximations for singular stable-like processes. First we obtain properties of some Markov chains. Then we construct the approximating Markov chains and give a necessary condition for weak convergence of these…

Probability · Mathematics 2012-10-11 Fangjun Xu

In this paper we give general criteria on tightness and weak convergence of discrete Markov chains to symmetric jump processes on metric measure spaces under mild conditions. As an application, we investigate discrete approximation for a…

Probability · Mathematics 2010-09-01 Zhen-Qing Chen , Panki Kim , Takashi Kumagai

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…

Probability · Mathematics 2008-04-23 R. W. R. Darling , J. R. Norris

The aim of this article is to prove that diffusion processes in $\mathbb{R}^d$ with a drift can be approximated by suitable Markov chains on $n^{-1}\mathbb{Z}^d$. Moreover, we investigate sufficient conditions on the conductances which…

Probability · Mathematics 2022-05-03 Marvin Weidner

Markov jump processes are continuous-time stochastic processes with a wide range of applications in both natural and social sciences. Despite their widespread use, inference in these models is highly non-trivial and typically proceeds via…

Machine Learning · Computer Science 2023-06-01 Patrick Seifner , Ramses J. Sanchez

Scaled type Markov renewal processes generalize classical renewal processes: renewal times come from a one parameter family of probability laws and the sequence of the parameters is the trajectory of an ergodic Markov chain. Our primary…

Probability · Mathematics 2015-03-17 Zsolt Pajor-Gyulai , Domokos Szász

Markov chain approximations of symmetric jump processes are investigated. Tightness results and a central limit theorem are established. Moreover, given the generator of a symmetric jump process with state space $\mathbbm{R}^d$ the…

Probability · Mathematics 2007-05-23 R. Husseini , M. Kassmann

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…

Computation · Statistics 2017-02-08 Vassilios Stathopoulos , Mark A. Girolami

We construct a non-decreasing pure jump Markov process, whose jump measure heavily depends on the values taken by the process. We determine the singularity spectrum of this process, which turns out to be random and to depend locally on the…

Probability · Mathematics 2009-07-02 Julien Barral , Nicolas Fournier , Stephane Jaffard , Stephane Seuret

Stochastic gradient methods are the workhorse (algorithms) of large-scale optimization problems in machine learning, signal processing, and other computational sciences and engineering. This paper studies Markov chain gradient descent, a…

Optimization and Control · Mathematics 2018-09-13 Tao Sun , Yuejiao Sun , Wotao Yin

In the context of nonparametric Bayesian estimation a Markov chain Monte Carlo algorithm is devised and implemented to sample from the posterior distribution of the drift function of a continuously or discretely observed one-dimensional…

Computation · Statistics 2017-06-08 Frank van der Meulen , Moritz Schauer , Harry van Zanten

Ordinary differential equations obtained as limits of Markov processes appear in many settings. They may arise by scaling large systems, or by averaging rapidly fluctuating systems, or in systems involving multiple time-scales, by a…

Probability · Mathematics 2014-03-24 Hye-Won Kang , Thomas G. Kurtz , Lea Popovic

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…

Strongly Correlated Electrons · Physics 2014-05-14 S. Iblisdir

We consider sequences $(X_t^N)_{t\geq0}$ of Markov processes in two dimensions whose fluid limit is a stable solution of an ordinary differential equation of the form $\dot{x}_t=b(x_t)$, where $b(x)={\pmatrix{-\mu 0 0 \lambda}}x+\tau(x)$…

Probability · Mathematics 2011-11-10 Amanda G. Turner

The concepts of probability, statistics and stochastic theory are being successfully used in structural engineering. Markov Chain modelling is a simple stochastic process model that has found its application in both describing stochastic…

Applications · Statistics 2007-08-14 K. Balaji Rao

Markov chains are convenient means of generating realizations of networks with a given (joint or otherwise) degree distribution, since they simply require a procedure for rewiring edges. The major challenge is to find the right number of…

Social and Information Networks · Computer Science 2012-11-01 J. Ray , A. Pinar , C. Seshadhri
‹ Prev 1 2 3 10 Next ›