English
Related papers

Related papers: On the extendibility of partially and Markov excha…

200 papers

Some characterizations of mixed renewal processes in terms of exchangeability and of different types of disintegrations are given. As a consequence, an existence result for mixed renewal processes, providing also a new construction for…

Probability · Mathematics 2014-07-01 D. P. Lyberopoulos , N. D. Macheras

We consider processes which are functions of finite-state Markov chains. It is well known that such processes are rarely Markov. However, such processes are often regular in the following sense: the distant past values of the process have…

Probability · Mathematics 2021-01-05 Steven Berghout , Evgeny Verbitskiy

We present a detailed proof of the Dovbysh-Sudakov representation for symmetric positive definite weakly exchangeable infinite random arrays, called Gram-de Finetti matrices, which is based on the representation result of Aldous and Hoover…

Probability · Mathematics 2010-08-20 Dmitry Panchenko

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

A sequence of real numbers (x_n) is Benford if the significands, i.e. the fraction parts in the floating-point representation of (x_n) are distributed logarithmically. Similarly, a discrete-time irreducible and aperiodic finite-state Markov…

Probability · Mathematics 2010-03-05 Bahar Kaynar , Arno Berger , Theodore P. Hill , Ad Ridder

We consider random arrays indexed by the leaves of an infinitary rooted tree of finite depth, with the distribution invariant under the rearrangements that preserve the tree structure. We call such arrays hierarchically exchangeable and…

Probability · Mathematics 2014-08-05 Tim Austin , Dmitry Panchenko

There are some positively divisible non-Markovian processes whose transition matrices satisfy the Chapman-Kolmogorov equation. These processes should also satisfy the Kolmogorov consistency conditions, an essential requirement for a process…

Probability · Mathematics 2024-01-24 Bilal Canturk , Heinz-Peter Breuer

We consider evaluation of proper posterior distributions obtained from improper prior distributions. Our context is estimating a bounded function $\phi$ of a parameter when the loss is quadratic. If the posterior mean of $\phi$ is…

Statistics Theory · Mathematics 2008-11-10 Morris L. Eaton , James P. Hobert , Galin L. Jones , Wen-Lin Lai

We prove that a wide class of models of Markov neighbor-dependent substitution processes on the integer line is solvable. This class contains some models of nucleotide substitutions recently introduced and studied empirically by molecular…

Probability · Mathematics 2007-05-23 Jean Bérard , Jean-Baptiste Gouéré , Didier Piau

Empirical processes for stationary, causal sequences are considered. We establish empirical central limit theorems for classes of indicators of left half lines, absolutely continuous functions and piecewise differentiable functions. Sample…

Statistics Theory · Mathematics 2007-06-13 Wei Biao Wu

In this paper, a fourth moment bound for partial sums of functional of strongly ergodic Markov chain is established. This type of inequality plays an important role in the study of empirical process invariance principle. This one is…

Probability · Mathematics 2008-10-16 Olivier Durieu

In this paper we study time-inhomogeneous affine processes beyond the common assumption of stochastic continuity. In this setting times of jumps can be both inaccessible and predictable. To this end we develop a general theory of finite…

Probability · Mathematics 2018-12-21 Martin Keller-Ressel , Thorsten Schmidt , Robert Wardenga

We establish a new Bernstein-type deviation inequality for general (non-reversible) discrete-time Markov chains via an elementary approach. More robust than existing works in the literature, our result only requires the Markov chain to…

Probability · Mathematics 2025-10-07 De Huang , Xiangyuan Li

For a class of irreducible Markov chains with an infinitely countable set of states, we establish a new verifiable necessary and sufficient condition for recurrence and transience. We show that if one of the basic assumptions is not…

Probability · Mathematics 2024-10-08 Vyacheslav M. Abramov

We give a set of equivalent conditions for a potential on a Countable Markov Shift to have strong positive recurrence, which is also equivalent to having exponential decay of correlations. A key ingredient of our proofs is quantifying how…

Dynamical Systems · Mathematics 2024-11-28 Mike Todd , Boyuan Zhao

In this study, a new extension of the Markov Renewal theory is introduced by allowing time to evolve in multiple dimensions. The resulting chains are referred to as multi-time Markov Renewal chains and since this extension is new, the state…

Probability · Mathematics 2025-08-21 Leonidas Kordalis , Samis Trevezas

Consider longitudinal networks whose edges turn on and off according to a discrete-time Markov chain with exponential-family transition probabilities. We characterize when their joint distributions are also exponential families with the…

Methodology · Statistics 2024-03-12 William K. Schwartz , Sonja Petrović , Hemanshu Kaul

We consider forkable regular expressions, which enrich regular expressions with a fork operator, to establish a formal basis for static and dynamic analysis of the communication behavior of concurrent programs. We define a novel…

Formal Languages and Automata Theory · Computer Science 2015-12-09 Martin Sulzmann , Peter Thiemann

In this paper we extend the predicate logic introduced in [Beauquier et al. 2002] in order to deal with Semi-Markov Processes. We prove that with respect to qualitative probabilistic properties, model checking is decidable for this logic…

Logic in Computer Science · Computer Science 2007-05-23 Ruggero Lanotte , Daniele Beauquier

We consider a model for which every site of $\mathbb{N}$ is assigned a fitness in $[0,1]$. At every discrete time all the sites are updated and each site samples a uniform on $[0,1]$, independently of everything else. At every discrete time…

Probability · Mathematics 2022-06-29 Iddo Ben-Ari , Rinaldo B. Schinazi