English
Related papers

Related papers: The compositional construction of Markov processes…

200 papers

The bijection between composition structures and random closed subsets of the unit interval implies that the composition structures associated with $S \cap [0,1]$ for a self-similar random set $S\subset {\mathbb R}_+$ are those which are…

Probability · Mathematics 2007-05-23 Alexander Gnedin , Jim Pitman

We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems. We focus on qualitative properties for MDPs that can express that desired behaviors of the system arise almost-surely (with probability 1) or…

Logic in Computer Science · Computer Science 2014-05-06 Krishnendu Chatterjee , Martin Chmelik , Przemyslaw Daca

We propose the concept of a system algebra with a parallel composition operation and an interface connection operation, and formalize composition-order invariance, which postulates that the order of composing and connecting systems is…

Other Computer Science · Computer Science 2018-09-25 Christian Matt , Ueli Maurer , Christopher Portmann , Renato Renner , Björn Tackmann

The notion of a successful coupling of Markov processes, based on the idea that both components of the coupled system ``intersect'' in finite time with probability one, is extended to cover situations when the coupling is unnecessarily…

Probability · Mathematics 2007-05-23 Michael Blank , Sergey Pirogov

Virtually all questions that one can ask about the behavioral and structural complexity of a stochastic process reduce to a linear algebraic framing of a time evolution governed by an appropriate hidden-Markov process generator. Each type…

Chaotic Dynamics · Physics 2018-04-18 Paul M. Riechers , James P. Crutchfield

We review recent progress in potential theory of second-order elliptic operators and on the metastable behavior of Markov processes.

Probability · Mathematics 2017-12-12 C. Landim

The main goal of the paper is to develop an estimate for the conditional probability function of random stationary ergodic symbolic sequences with elements belonging to a finite alphabet. We elaborate a decomposition procedure for the…

Data Analysis, Statistics and Probability · Physics 2017-08-09 S. S. Melnik , O. V. Usatenko

We introduce and study a family of Markov processes on partitions. The processes preserve the so-called z-measures on partitions previously studied in connection with harmonic analysis on the infinite symmetric group. We show that the…

Mathematical Physics · Physics 2007-05-23 Alexei Borodin , Grigori Olshanski

An extension of the conditional expectations (those under a given subalgebra of events and not the simple ones under a single event) from the classical to the quantum case is presented. In the classical case, the conditional expectations…

Mathematical Physics · Physics 2010-01-22 Gerd Niestegge

In this paper, we introduce a time-continuous production model that enables random machine failures, where the failure probability depends historically on the production itself. This bidirectional relationship between historical failure…

Probability · Mathematics 2019-12-13 Stephan Knapp , Simone Göttlich

A simple model of the new notion of "Markov up" processes is proposed; its positive recurrence and ergodic properties are shown under the appropriate conditions.

Probability · Mathematics 2023-01-02 Alexander Veretennikov , Maria Veretennikova

Consider an N-dimensional Markov chain obtained from N one-dimensional random walks by Doob h-transform with the q-Vandermonde determinant. We prove that as N becomes large, these Markov chains converge to an infinite-dimensional Feller…

Probability · Mathematics 2014-10-03 Alexei Borodin , Vadim Gorin

We present a numerical method to compute expectations of functionals of a piecewise-deterministic Markov process. We discuss time dependent functionals as well as deterministic time horizon problems. Our approach is based on the…

Probability · Mathematics 2012-01-31 Adrien Brandejsky , Benoîte de Saporta , François Dufour

Semi-Markov processes are Markovian processes in which the firing time of the transitions is modelled by probabilistic distributions over positive reals interpreted as the probability of firing a transition at a certain moment in time. In…

Formal Languages and Automata Theory · Computer Science 2017-12-04 Mathias Ruggaard Pedersen , Nathanaël Fijalkow , Giorgio Bacci , Kim Guldstrand Larsen , Radu Mardare

We construct a Markov process model to describe the evolution of labor division and its dynamical behavior is investigated by numerical simulations in detail. We have shown that under the mechanism of increasing returns, the division of…

Adaptation and Self-Organizing Systems · Physics 2007-05-23 Lei Chai , Dahui Wang , Jiawei Chen , Zengru Di

For a broad class of point processes, including determinantal point processes, we construct associated marked and conditional ensembles, which allow to study a random configuration in the point process, based on information about a randomly…

Probability · Mathematics 2022-11-01 Tom Claeys , Gabriel Glesner

We characterise amenability of a countable group in terms of the spectral radius of the Perron-Frobenius operator associated to a group extension of a countable Markov shift and a H\"older continuous potential. This extends a result of Day…

Dynamical Systems · Mathematics 2015-11-12 Johannes Jaerisch

We complete the picture how the asymptotic behavior of a dynamical system is reflected by properties of the associated Perron-Frobenius operator. Our main result states that strong convergence of the powers of the Perron-Frobenius operator…

Dynamical Systems · Mathematics 2017-03-30 Moritz Gerlach

Consider a one-sided Markov additive process with an upper and a lower barrier, where each can be either reflecting or terminating. For both defective and non-defective processes and all possible scenarios we identify the corresponding…

Probability · Mathematics 2013-09-20 Jevgenijs Ivanovs

Probabilistic automata constitute a versatile and elegant model for concurrent probabilistic systems. They are equipped with a compositional theory supporting abstraction, enabled by weak probabilistic bisimulation serving as the reference…

Formal Languages and Automata Theory · Computer Science 2015-07-01 Andrea Turrini , Holger Hermanns