中文
相关论文

相关论文: On classifying processes

200 篇论文

A class of nonlinear ARCH processes is introduced and studied. The existence of a strictly stationary and $\beta$-mixing solution is established under a mild assumption on the density of the underlying independent process. We give…

概率论 · 数学 2007-05-23 Youssef Sa\"{ı}di , Jean-Michel Zako\"{ı}an

The class of nonlinear Markov processes is characterized by the dependence of the current state of the process on its current distribution in addition to the dependence on the previous state. Due to this feature, these processes are…

概率论 · 数学 2022-12-27 Aleksandr Shchegolev

We examine reaction networks (CRNs) through their associated continuous-time Markov processes. Studying the dynamics of such networks is in general hard, both analytically and by simulation. In particular, stationary distributions of…

概率论 · 数学 2022-03-28 Linard Hoessly

We study various classes of random processes defined on the regular tree $T_d$ that are invariant under the automorphism group of $T_d$. Most important ones are factor of i.i.d. processes (randomized local algorithms), branching Markov…

概率论 · 数学 2015-07-28 Ágnes Backhausz , Balázs Szegedy

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.

概率论 · 数学 2023-01-02 Alexander Veretennikov , Maria Veretennikova

This paper is a survey of various proofs of the so called {\em fundamental theorem of Markov chains}: every ergodic Markov chain has a unique positive stationary distribution and the chain attains this distribution in the limit independent…

概率论 · 数学 2022-04-05 Somenath Biswas

Given a strongly stationary Markov chain and a finite set of stopping rules, we prove the existence of a polynomial algorithm which projects the Markov chain onto a minimal Markov chain without redundant information. Markov complexity is…

概率论 · 数学 2007-05-23 Giacomo Aletti

We present an algorithm that can efficiently compute a broad class of inferences for discrete-time imprecise Markov chains, a generalised type of Markov chains that allows one to take into account partially specified probabilities and other…

概率论 · 数学 2019-07-02 Natan T'Joens , Thomas Krak , Jasper De Bock , Gert de Cooman

We analyse the structure of imprecise Markov chains and study their convergence by means of accessibility relations. We first identify the sets of states, so-called minimal permanent classes, that are the minimal sets capable of containing…

概率论 · 数学 2016-09-20 Damjan Skulj

We deal with the monadic (second-order) theory of order. We prove all known results in a unified way, show a general way of reduction, prove more results and show the limitation on extending them. We prove (CH) that the monadic theory of…

逻辑 · 数学 2023-05-02 Saharon Shelah

In the paper we consider some piecewise deterministic Markov process whose continuous component evolves according to semiflows, which are switched at the jump times of a Poisson process. The associated Markov chain describes the states of…

We consider a large family of discrete and continuous time controlled Markov processes and study an ergodic risk-sensitive minimization problem. Under a blanket stability assumption, we provide a complete analysis to this problem. In…

最优化与控制 · 数学 2022-07-18 Anup Biswas , Somnath Pradhan

We show that a stationary IDp process (i.e., an infinitely divisible stationary process without Gaussian part) can be written as the independent sum of four stationary IDp processes, each of them belonging to a different class characterized…

概率论 · 数学 2011-11-10 Emmanuel Roy

We consider random processes that are history-dependent, in the sense that the distribution of the next step of the process at any time depends upon the entire past history of the process. In general, therefore, the Markov property cannot…

概率论 · 数学 2019-11-19 Peter Clifford , David Stirzaker

The extremes of a univariate Markov chain with regulary varying stationary marginal distribution and asymptotically linear behavior are known to exhibit a multiplicative random walk structure called the tail chain. In this paper, we extend…

概率论 · 数学 2014-02-04 Anja Janßen , Johan Segers

This paper presents a comprehensive review of stochastic processes, with a particular focus on Markov chains and jump processes. The main results related to queuing systems are analyzed. Additionally, conditions that ensure the stability,…

概率论 · 数学 2025-07-30 Carlos E. Martínez-Rodríguez

We define a class of sequences ${a_n}$ by $a_1=a$ and $a_{n+1}=P(a_n)$, where $P(x)$ is a polynomial with real coefficients. We then find out for which values $a$ and for which polynomials $P(x)$ these sequences will be constant after a…

综合数学 · 数学 2009-09-09 Florentin Smarandache

We classify the matrices M which correspond to finite categories

范畴论 · 数学 2010-07-20 Samer Allouch

Let $(U_n(t))_{t\in\R^d}$ be the empirical process associated to an $\R^d$-valued stationary process $(X_i)_{i\ge 0}$. We give general conditions, which only involve processes $(f(X_i))_{i\ge 0}$ for a restricted class of functions $f$,…

概率论 · 数学 2012-10-02 Olivier Durieu , Marco Tusche

Continuous-time Markov chains on non-negative integers can be used for modeling biological systems, population dynamics, and queueing models. Qualitative behaviors of birth-and-death models, typical examples of such one-dimensional…

概率论 · 数学 2025-10-24 Minjun Kim , Seokhwan Moon , Jinsu Kim