English
Related papers

Related papers: The peeling process on random planar maps coupled …

200 papers

Given $n>0$, let $S\subset [0,1]^2$ be a set of $n$ points, chosen uniformly at random. Let $R\cup B$ be a random partition, or coloring, of $S$ in which each point of $S$ is included in $R$ uniformly at random with probability $1/2$.…

Computational Geometry · Computer Science 2025-04-02 Josué Corujo , Paul Horn , Pablo Pérez-Lantero

It is shown explicitly how self-similar graphs can be obtained as `blow-up' constructions of finite cell graphs $\hat C$. This yields a larger family of graphs than the graphs obtained by discretising continuous self-similar fractals. For a…

Combinatorics · Mathematics 2007-05-23 Bernhard Krön , Elmar Teufl

We study the quenched invariance principle for random conductance models with long range jumps on $\Z^d$, where the transition probability from $x$ to $y$ is, on average, comparable to $|x-y|^{-(d+\alpha)}$ with $\alpha\in (0,2)$ but is…

Probability · Mathematics 2020-05-01 Xin Chen , Takashi Kumagai , Jian Wang

In this article it is shown that the Brownian motion on the continuum random tree is the scaling limit of the simple random walks on any family of discrete $n$-vertex ordered graph trees whose search-depth functions converge to the Brownian…

Probability · Mathematics 2012-10-24 David Croydon

Renyi's "thinning" operation on a discrete random variable is a natural discrete analog of the scaling operation for continuous random variables. The properties of thinning are investigated in an information-theoretic context, especially in…

Information Theory · Computer Science 2010-08-17 Peter Harremoes , Oliver Johnson , Ioannis Kontoyiannis

We consider an ensemble of $N$ discrete nonintersecting paths starting from equidistant points and ending at consecutive integers. Our first result is an explicit formula for the correlation kernel that allows us to analyze the process as…

Probability · Mathematics 2012-03-29 Jonathan Breuer , Maurice Duits

* ACTIVATED RANDOM WALK MODEL * This is a conservative particle system on the lattice, with a Markovian continuous-time evolution. Active particles perform random walks without interaction, and they may as well change their state to…

Probability · Mathematics 2011-03-15 Leonardo T. Rolla

The paper is concerned with the equilibrium distribution $\Pi_n$ of the $n$-th element in a sequence of continuous-time density dependent Markov processes on the integers. Under a $(2+\a)$-th moment condition on the jump distributions, we…

Probability · Mathematics 2009-02-06 Sanda N. Socoll , A. D. Barbour

We study two random processes on an $n$-vertex graph inspired by the internal diffusion limited aggregation (IDLA) model. In both processes $n$ particles start from an arbitrary but fixed origin. Each particle performs a simple random walk…

Discrete Mathematics · Computer Science 2019-11-27 Nicolas Rivera , Alexandre Stauffer , Thomas Sauerwald , John Sylvester

Recent fluctuation identities for $\alpha$-stable L\'evy processes have decomposed paths using generalised spherical polar coordinates revealing an underlying Markov Additive Process (MAP) for which a more advanced form of excursion theory…

Probability · Mathematics 2024-07-31 Andreas E. Kyprianou , Sonny Medina , Juan Carlos Pardo

The treatment of two-dimensional random walks in the quarter plane leads to Markov processes which involve semi-infinite matrices having Toeplitz or block Toeplitz structure plus a low-rank correction. Finding the steady state probability…

Numerical Analysis · Mathematics 2021-01-25 Dario A. Bini , Stefano Massei , Beatrice Meini , Leonardo Robol

We introduce a new self-interacting random walk on the integers in a dynamic random environment and show that it converges to a pure diffusion in the scaling limit. We also find a lower bound on the diffusion coefficient in some special…

Probability · Mathematics 2007-05-23 Majid Hosseini , Krishnamurthi Ravishankar

We study discrete-time stochastic processes $(X_t)$ on $[0,\infty)$ with asymptotically zero mean drifts. Specifically, we consider the critical (Lamperti-type) situation in which the mean drift at $x$ is about $c/x$. Our focus is the…

Probability · Mathematics 2013-02-27 Ostap Hryniv , Mikhail V. Menshikov , Andrew R. Wade

We study a configuration model on bipartite planar maps in which, given $n$ even integers, one samples a planar map with $n$ faces uniformly at random with these face degrees. We prove that when suitably rescaled, such maps always admit…

Probability · Mathematics 2022-05-12 Cyril Marzouk

Consider a critical Erd\"os-R\'enyi random graph: $n$ is the number of vertices, each one of the $\binom{n}{2}$ possible edges is kept in the graph independently from the others with probability $n^{-1}+\lambda n^{-4/3}$, $\lambda$ being a…

Probability · Mathematics 2020-02-06 Raphaël Rossignol

In this paper, we are interested in the asymptotic behaviour of the sequence of processes $(W_n(s,t))_{s,t\in[0,1]}$ with \begin{equation*} W_n(s,t):=\sum_{k=1}^{\lfloor nt\rfloor}\big(1_{\{\xi_{S_k}\leq s\}}-s\big) \end{equation*} where…

Probability · Mathematics 2019-12-17 Nadine Guillotin-Plantard , Francoise Pene , Martin Wendler

We study a variant of the down-up and up-down walks over an $n$-partite simplicial complex, which we call expanderized higher order random walks -- where the sequence of updated coordinates correspond to the sequence of vertices visited by…

Data Structures and Algorithms · Computer Science 2024-06-04 Vedat Levi Alev , Shravas Rao

Randomly scaled scale-decorated Poisson point process is introduced recently in Bhattacharya et al. [2017] where it appeared as weak limit of a sequence of point processes in the context of branching random walk. In this article, we obtain…

Probability · Mathematics 2018-02-20 Ayan Bhattacharya

The talk presented at ICMP 97 focused on the scaling limits of critical percolation models, and some other systems whose salient features can be described by collections of random lines. In the scaling limit we keep track of features seen…

Mathematical Physics · Physics 2007-05-23 Michael Aizenman

Pareto hull peeling is a discrete algorithm, generalizing convex hull peeling, for sorting points in Euclidean space. We prove that Pareto peeling of a random point set in two dimensions has a scaling limit described by a first-order…

Probability · Mathematics 2023-05-31 Ahmed Bou-Rabee , Peter S. Morfe