相关论文: Asymptotic behaviour of random Markov chains with …
We prove the existence and uniqueness of tempered random attractors for stochastic Reaction-Diffusion equations on unbounded domains with multiplicative noise and deterministic non-autonomous forcing. We establish the periodicity of the…
Differentially positive systems are systems whose linearization along trajectories is positive. Under mild assumptions, their solutions asymptotically converge to a one-dimensional attractor, which must be a limit cycle in the absence of…
We prove that two natural Markov chains on the set of monotone paths in a strip mix slowly. To do so, we make novel use of the theory of non-positively curved (CAT(0)) cubical complexes to detect small bottlenecks in many graphs of…
Given a non-negative Jacobi matrix describing higher order recurrence relations for multiple orthogonal polynomials of type~II and corresponding linear forms of type I, a general strategy for constructing a pair of stochastic matrices, dual…
We develop a new and general method to prove the the existence of the random attractor (strong attractor) for the primitive equations (PEs) of large-scale ocean and atmosphere dynamics under $non$-$periodic$ boundary conditions and driven…
A nonlinear Markov chain is a discrete time stochastic process whose transitions depend on both the current state and the current distribution of the process. The nonlinear Markov chain over a infinite state space can be identified by a…
The local Markov condition for a DAG to be an independence map of a probability distribution is well known. For DAGs with latent variables, represented as bi-directed edges in the graph, the local Markov property may invoke exponential…
We extend Andersson-Madigan-Perlman chain graphs by (i) relaxing the semidirected acyclity constraint so that only directed cycles are forbidden, and (ii) allowing up to two edges between any pair of nodes. We introduce global, and ordered…
A piecewise-deterministic Markov process, specified by random jumps and switching semi-flows, as well as the associated Markov chain given by its post-jump locations, are investigated in this paper. The existence of an exponentially…
Expanding upon the rich history of algebraic techniques in probability, we show the existence of and construct a Markov chain using the Hopf square map on a quantum group that is both non-commutative and non-cocommutative. This extends the…
We consider an autonomous system constructed as modification of the logistic differential equation with delay that generates successive trains of oscillations with phases evolving according to chaotic maps. The system contains two feedback…
Switches are operations which make local changes to the edges of a graph, usually with the aim of preserving the vertex degrees. We study a restricted set of switches, called triangle switches. Each triangle switch creates or deletes at…
Markov chains arising from random iteration of functions $S_{\theta}:X\to X$, $\theta \in \Theta$, where $X$ is a Polish space and $\Theta$ is arbitrary set of indices are considerd. At $x\in X$, $\theta$ is sampled from distribution…
We consider random walks on dynamical networks where edges appear and disappear during finite time intervals. The process is grounded on three independent stochastic processes determining the walker's waiting-time, the up-time and down-time…
We study a discrete-time Markov process on triangular arrays of matrices of size $d\geq 1$, driven by inverse Wishart random matrices. The components of the right edge evolve as multiplicative random walks on positive definite matrices with…
A multidimensional chaos is generated by a special initial value problem for the non-autonomous impulsive differential equation. The existence of a chaotic attractor is shown, where density of periodic solutions, sensitivity of solutions…
Random walks are a fundamental model in applied mathematics and are a common example of a Markov chain. The limiting stationary distribution of the Markov chain represents the fraction of the time spent in each state during the stochastic…
We study a random walk on the subgroup of lower triangular matrices of SL$_2$, with i.i.d. increments. We prove that the process of the lower corner of the random walk satisfies a Rogers-Pitman criterion to be a Markov chain if and only if…
We prove that the probability substitution matrices obtained from a continuous-time Markov chain form a multiplicatively closed set if and only if the rate matrices associated to the chain form a linear space spanning a Lie algebra. The key…
In this work, we characterise the statistics of Markov chains by constructing an associated sequence of periodic differential operators. Studying the density of states of these operators reveals the absolutely continuous invariant measure…