Related papers: A simple rank-based Markov chain with self-organiz…
Markov chains are convenient means of generating realizations of networks with a given (joint or otherwise) degree distribution, since they simply require a procedure for rewiring edges. The major challenge is to find the right number of…
Consider the random set composed of particles initially distributed on Zd, d >= 2, according to a Poisson point process of intensity u > 0 and moving as independent simple symmetric random walks, the trap particles. We are interested in the…
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.
We consider the stochastic ranking process with space-time dependent unbounded jump rates for the particles. We prove that the joint empirical distribution of jump rate and scaled position converges almost surely to a deterministic…
We develop an Ornstein--Zernike theory for the two-dimensional random-cluster model with $1 \leq q <4$ that also applies in its near-critical regime. In particular, we prove an asymptotic formula for the two-point function which holds…
Mahlmann and Schindelhauer (2005) defined a Markov chain which they called $k$-Flipper, and showed that it is irreducible on the set of all connected regular graphs of a given degree (at least 3). We study the 1-Flipper chain, which we call…
We study a discrete-time Markov process $X_n\in\mathbb{R}^d$, for which the distribution of the future increments depends only on the relative ranking of its components (descending order by value). We endow the process with a…
We consider a reflected process in the positive orthant driven by an exogenous jump process. For a given input process, we show that there exists a unique minimal strong solution to the given particle system up until a certain maximal…
We introduce the minimal maximally predictive models ({\epsilon}-machines) of processes generated by certain hidden semi-Markov models. Their causal states are either hybrid discrete-continuous or continuous random variables and…
Consider the continuous-time Markov Branching Process. In critical case we consider a situation when the generating function of intensity of transformation of particles has the infinite second moment, but its tail regularly varies in sense…
We considered a stochastic version of the Bak-Sneppen model (SBSM) of ecological evolution where the the number $M$ of sites mutated in a mutation event is restricted to only two. Here the mutation zone consists of only one site and this…
We consider a particle in the harmonic approximation coupled linearly to an environment. modeled by an infinite set of harmonic oscillators. The system (particle--environment) is considered in a cavity at thermal equilibrium. We employ the…
We investigate a class of models related to the Bak-Sneppen model, initially proposed to study evolution. The BS model is extremely simple and yet captures some forms of "complex behavior" such as self-organized criticality that is often…
We have investigated the essential ingredients allowing a system to show Self Organized Criticality (SOC) in its collective behavior. Using the Bak-Sneppen model of biological evolution as our paradigm, we show that the random microscopic…
We derive explicit upper bounds for the $\bar{d}$-distance between a chain of infinite order and its canonical $k$-steps Markov approximation. Our proof is entirely constructive and involves a "coupling from the past" argument. The new…
We consider the Markov chain approximations for singular stable-like processes. First we obtain properties of some Markov chains. Then we construct the approximating Markov chains and give a necessary condition for weak convergence of these…
In the dynamics of a rotation of the unit circle by an irrational angle $\alpha\in(0,1)$, we study the evolution of partitions whose atoms are finite unions of left-closed right-open intervals with endpoints lying on the past trajectory of…
We construct discrete time Markov chains that preserve the class of Schur processes on partitions and signatures. One application is a simple exact sampling algorithm for q^{volume}-distributed skew plane partitions with an arbitrary back…
In this paper we focus on the problem of the degree sequence for the following random graph process. At any time-step $t$, one of the following three substeps is executed: with probability $\alpha_1$, a new vertex $x_t$ and $m$ edges…
Consider a finite system of Brownian particles on the real line. Each particle has drift and diffusion coefficients depending on its current rank relative to other particles, as in Karatzas, Pal and Shkolnikov (2012). We prove some…