English
Related papers

Related papers: Coexistence of competing first passage percolation…

200 papers

We consider a model of long-range first-passage percolation on the $d$ dimensional square lattice $Z^d$ in which any two distinct vertices $x, y \in Z^d$ are connected by an edge having exponentially distributed passage time with mean…

Probability · Mathematics 2015-03-04 Shirshendu Chatterjee , Partha S. Dey

One model of real-life spreading processes is First Passage Percolation (also called SI model) on random graphs. Social interactions often follow bursty patterns, which are usually modelled with i.i.d.~heavy-tailed passage times on edges.…

Probability · Mathematics 2018-12-05 Alexey Medvedev , Gábor Pete

We introduce a new model of correlated randomly growing graphs and study the fundamental questions of detecting correlation and estimating aspects of the correlated structure. The model is simple and starts with any model of randomly…

Probability · Mathematics 2020-04-29 Miklos Z. Racz , Anirudh Sridhar

We define a graph process $\mathcal{G}(p,q)$ based on a discrete branching process with deletions and mergers, which is inspired by the 4-cycle structure of both the hypercube $Q_d$ and the lattice $\mathbb{Z}^d$ for large $d$. Individuals…

Probability · Mathematics 2021-04-12 Laura Eslava , Sarah Penington , Fiona Skerman

We study a random growth model on $\R^d$ introduced by Deijfen. This is a continuous first-passage percolation model. The growth occurs by means of spherical outbursts with random radii in the infected region. We aim at finding conditions…

Probability · Mathematics 2007-07-11 Jean-Baptiste Gouere , Regine Marchand

We study competition between two growth models with long-range correlations on the torus $\mathbb T_n^d$ of size $n$ in dimension $d$. We append the edge set of the torus $\mathbb T_n^d$ by including all non-nearest-neighbour edges, and…

Probability · Mathematics 2025-10-20 Bas Lodewijks , Neeladri Maitra

We propose a simple model of columnar growth through {\it diffusion limited aggregation} (DLA). Consider a graph $G_N\times\N$, where the basis has $N$ vertices $G_N:=\{1,\dots,N\}$, and two vertices $(x,h)$ and $(x',h')$ are adjacent if…

Probability · Mathematics 2015-11-24 A. Asselah , E. Cirillo , E. Scoppola , B. Scoppola

For first passage percolation (FPP) on integer lattice with i.i.d. passage time distributions, in order to show existence of semi-infinite geodesics along a fixed direction, one requires unproven assumptions on the limiting shape. We…

Probability · Mathematics 2017-07-12 Kumarjit Saha

We introduce a cluster growth process that provides a clear connection between equilibrium statistical mechanics and an explosive percolation model similar to the one recently proposed by Achlioptas et al. [Science 323, 1453 (2009)]. We…

Statistical Mechanics · Physics 2015-05-14 A. A. Moreira , E. A. Oliveira , S. D. S. Reis , H. J. Herrmann , J. S. Andrade

We study a competition model on $\mathbb{Z}^d$ where the two infections are driven by supercritical Bernoulli percolations with distinct parameters $p$ and $q$. We prove that, for any $q$, there exist at most countably many values of…

Probability · Mathematics 2016-08-16 Olivier Garet , Régine Marchand

A simple but powerful network model with $n$ nodes and $m$ partly overlapping layers is generated as an overlay of independent random graphs $G_1,\dots,G_m$ with variable sizes and densities. The model is parameterised by a joint…

Probability · Mathematics 2020-11-04 Mindaugas Bloznelis , Lasse Leskelä

We consider a model of first passage percolation (FPP) where the nearest-neighbor edges of the standard two-dimensional Euclidean lattice are equipped with random variables. These variables are i.i.d.\, nonnegative, continuous, and have a…

Probability · Mathematics 2021-05-06 Ujan Gangopadhyay

We study several fundamental properties of a class of stochastic processes called spatial Lambda-coalescents. In these models, a number of particles perform independent random walks on some underlying graph G. In addition, particles on the…

Probability · Mathematics 2010-01-21 Omer Angel , Nathanael Berestycki , Vlada Limic

A competition process on $\mathbb{Z}^d$ is considered, where two species compete to color the sites. The entities are driven by branching random walks. Specifically red (blue) particles reproduce in discrete time and place offspring…

Probability · Mathematics 2022-03-29 Maria Deijfen , Timo Vilkas

We study the competition interface between two growing clusters in a growth model associated to last-passage percolation. When the initial unoccupied set is approximately a cone, we show that this interface has an asymptotic direction with…

Probability · Mathematics 2009-09-29 Pablo A. Ferrari , James B. Martin , Leandro P. R. Pimentel

Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging…

Probability · Mathematics 2020-03-16 Laurent Ménard , Arvind Singh

We consider Bernoulli first-passage percolation on the $d$-dimensional hypercubic lattice with $d \geq 2$. The passage time of edge $e$ is $0$ with probability $p$ and $1$ with probability $1-p$, independently of each other. Let $p_c$ be…

Probability · Mathematics 2022-05-31 Naoki Kubota , Masato Takei

This thesis investigates critical phenomena and equilibrium states in various stochastic models through three interconnected studies. In the first chapter, we analyze the Activated Random Walk model on a one-dimensional ring in the…

Probability · Mathematics 2024-12-24 Célio Terra

We consider the statistical properties of arrival times and balls on first-passage percolation (FPP) $2D$ square lattices with strong disorder in the link-times. A previous work showed a crossover in the weak disorder regime, between…

We provide sufficient conditions for a regular graph $G$ of growing degree $d$, guaranteeing a phase transition in its random subgraph $G_p$ similar to that of $G(n,p)$ when $p\cdot d\approx 1$. These conditions capture several well-studied…

Combinatorics · Mathematics 2025-11-17 Sahar Diskin , Michael Krivelevich