Related papers: Markovian loop clusters on graphs
We study the random loop model with crosses and bars on sparse random graphs. Our main objective is to prove the existence of macroscopic loops, in the sense that a loop visits a positive proportion of the vertices. We develop a…
We define a Markov process in a forward population model with backward genealogy given by the $\Lambda$-coalescent. This Markov process, called the fixation line, is related to the block counting process through its hitting times. Two…
In this note, we give an original convergence result for products of independent random elements of motion group. Then we consider dynamic random walks which are inhomogeneous Markov chains whose transition probability of each step is, in…
We revisit the discrete additive and multiplicative coalescents, starting with $n$ particles with unit mass. These cases are known to be related to some "combinatorial coalescent processes": a time reversal of a fragmentation of Cayley…
A Poisson line process is a random set of straight lines contained in the plane, as the image of the map $(x,v)\mapsto (x+vt)_{t\in\mathbb{R}}$, for each point $(x,v)$ of a Poisson process in the space-velocity plane. By associating a step…
Two classes of interacting particle systems on $\mathbb{Z}$ are shown to be Pfaffian point processes at fixed times, and for all deterministic initial conditions. The first comprises coalescing and branching random walks, the second…
In this paper, we make a few random explorations that relate directly to the items mentioned in the title. We define transient chains and recurrent chains with "killing", the Green's function, the Laplacian operator, and harmonic functions.…
We propose a phenomenon of discrete-time quantum walks on graphs called the pulsation, which is a generalization of a phenomenon in the quantum searches. This phenomenon is discussed on a composite graph formed by two connected graphs…
We introduce a variant of the Erd\"os--R\'enyi random graph where the number of vertices is random and follows a Poisson law. A very simple Markov property of the model entails that the Lukasiewicz exploration is made of…
Percolation theory can be used to describe the structural properties of complex networks using the generating function formulation. This mapping assumes that the network is locally tree-like and does not contain short-range loops between…
Order-preserving couplings are elegant tools for obtaining robust estimates of the time-dependent and stationary distributions of Markov processes that are too complex to be analyzed exactly. The starting point of this paper is to study…
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…
We consider the moving particle process in Rd which is defined in the following way. There are two independent sequences (Tk) and (dk) of random variables. The variables Tk are non negative and form an increasing sequence, while variables…
In this paper we study the Poisson Hypothesis, which is a device to analyze approximately the behavior of large queueing networks. We prove it in some simple limiting cases. We show in particular that the corresponding dynamical system,…
In complex systems, events occur at irregular intervals that inherently encode the underlying dynamics of the system. Analyzing the temporal clustering of these events reveals critical insights into the non-random patterns and the temporal…
We consider an array of units each of which can be in one of three states. Unidirectional transitions between these states are governed by Markovian rate processes.The interactions between units occur through a dependence of the transition…
We consider a general honest homogeneous continuous-time Markov process with restarts. The process is forced to restart from a given distribution at time moments generated by an independent Poisson process. The motivation to study such…
We introduce a family of Markov processes on set partitions with a bounded number of blocks, called Lipschitz partition processes. We construct these processes explicitly by a Poisson point process on the space of Lipschitz continuous maps…
The method of 'coupling from the past' permits exact sampling from the invariant distribution of a Markov chain on a finite state space. The coupling is successful whenever the stochastic dynamics are such that there is coalescence of all…
We postulate the existence of a natural Poissonian marking of the double (touching) points of SLE(6) and hence of the related continuum nonsimple loop process that describes macroscopic cluster boundaries in 2D critical percolation. We…