相关论文: Markov chains arising from biased random derangeme…
The successive discrete structures generated by a sequential algorithm from random input constitute a Markov chain that may exhibit long term dependence on its first few input values. Using examples from random graph theory and search…
We present a mechanism for the emergence of strange attractors (observable chaos) in a two-parameter periodically-perturbed family of differential equations on the plane. The two parameters are independent and act on different ways in the…
We analyse extreme event statistics of experimentally realized Markov chains with various drifts. Our Markov chains are individual trajectories of a single atom diffusing in a one dimensional periodic potential. Based on more than 500…
A new family of tree-structured Markov random fields for a vector of discrete counting random variables is introduced. According to the characteristics of the family, the marginal distributions of the Markov random fields are all Poisson…
In this article, we study a model of random permutations, which we call random standardized permutations, based on a sequence of i.i.d. random variables. This model generalizes others, such as the riffle-shuffle and the major-index-biased…
We study decomposable combinatorial labeled structures in the exp-log class, specifically, two examples of type a=1 and two examples of type a=1/2. Our approach is to establish how well existing theory matches experimental data. For…
We investigate recurrence and transience of Branching Markov Chains (BMC) in discrete time. Branching Markov Chains are clouds of particles which move (according to an irreducible underlying Markov Chain) and produce offspring…
We describe a new construction of a family of measures on a group with the same Poisson boundary. Our approach is based on applying Markov stopping times to an extension of the original random walk.
We analyze the properties of degree-preserving Markov chains based on elementary edge switchings in undirected and directed graphs. We give exact yet simple formulas for the mobility of a graph (the number of possible moves) in terms of its…
We analyze the convergence rates for a family of auto-regressive Markov chains $(X^{(n)}_k)_{k\geq 0}$ on $\mathbb R^d$, where at each step a randomly chosen coordinate is replaced by a noisy damped weighted average of the others. The…
Let $A$ be a transition probability kernel on a finite state space $\Delta^o =\{1, \ldots , d\}$ such that $A(x,y)>0$ for all $x,y \in \Delta^o$. Consider a reinforced chain given as a sequence $\{X_n, \; n \in \mathbb{N}_0\}$ of…
Consider n unit intervals, say [1,2], [3,4], ..., [2n-1,2n]. Identify their endpoints in pairs at random, with all (2n-1)!! = (2n-1) (2n-3) ... 3 1 pairings being equally likely. The result is a collection of cycles of various lengths, and…
We establish existence of controlled Markov chain of mean-field type with unbounded jump intensities by means of a fixed point argument using the Wasserstein distance. Using a Markov chain entropic backward SDE approach, we further suggest…
We consider a Markov chain $\{X_n\}_{n=0}^\8$ on $\R^d$ defined by the stochastic recursion $X_{n}=M_n X_{n-1}+Q_n$, where $(Q_n,M_n)$ are i.i.d. random variables taking values in the affine group $H=\R^d\rtimes {\rm GL}(\R^d)$. Assume that…
For i.i.d. random vectors $(M_{1},Q_{1}),(M_{2},Q_{2}),\ldots$ such that $M>0$ a.s., $Q\geq 0$ a.s. and $\mathbb{P}(Q=0)<1$, the random difference equation $X_{n}=M_{n}X_{n-1}+Q_{n}$, $n=1,2,\ldots$, is studied in the critical case when the…
We consider irreversible Markov chains on finite commutative rings randomly generated using both addition and multiplication. We restrict ourselves to the case where the addition is uniformly random and multiplication is arbitrary. We first…
Conditions on the generator of a Markov process to control the fluctuations of its bridges are found. In particular, continuous time random walks on graphs and gradient diffusions are considered. Under these conditions, a concentration of…
The Kingman coalescent is a fundamental process in population genetics modelling the ancestry of a sample of individuals backwards in time. In this paper, in a large-sample-size regime, we study asymptotic properties of the coalescent under…
Let $\xi$ n , n $\in$ N be a sequence of i.i.d. random variables with values in Z. The associated random walk on Z is S(n) = $\xi$ 1 + $\times$ $\times$ $\times$ + $\xi$ n+1 and the corresponding "reflected walk" on N 0 is the Markov chain…
A notion of entangled Markov chain was introduced by Accardi and Fidaleo in the context of quantum random walk. They proved that, in the finite dimensional case, the corresponding states have vanishing entropy density, but they did not…