English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Let $X_n, n \ge 0$ be a Markov chain with finite state space $M$. If $x,y \inM$ such that $x$ is transient we have $P^y(X_n = x) \to 0$ for $n \to \infty$,and under mild aperiodicity conditions this convergence is monotone in that forsome $N$ we have $\forall n \ge N: P^y(X_n = x)$ $\ge P^y(X_{n+1} = x)$. We usebounds on the rate of convergence of the Markov chain to its quasi-stationarydistribution to obtain explicit bounds on $N$. We then apply this result toBernoulli percolation with parameter $p$ on the cylinder graph $C_k \times Z$.Utilizing a Markov chain describing infection patterns layer per layer, we thusshow the following uniform result on the monotonicity of connectionprobabilities: $\forall k \ge 3\, \forall n \ge 500k^6 2^k \,\forall p \in(0,1) \, \forall m \in C_k\!\!:$ $P_p((0,0) \leftrightarrow (m,n)) \geP_p((0,0) \leftrightarrow (m,n+1))$. In general these kind of monotonicityproperties of connection probabilities are difficult to establish and there areonly few pertaining results.

Monotonicity of Markov chain transition probabilities via quasi-stationarity -- an application to Bernoulli percolation on $C_k \times Z$