Feller property of the multiplicative coalescent with linear deletion

@article{Rth2019FellerPO,
  title={Feller property of the multiplicative coalescent with linear deletion},
  author={Bal{\'a}zs R{\'a}th},
  journal={Bernoulli},
  year={2019}
}
  • B. Ráth
  • Published 30 September 2016
  • Mathematics
  • Bernoulli
We modify the definition of Aldous' multiplicative coalescent process and introduce the multiplicative coalescent with linear deletion (MCLD). A state of this process is a square-summable decreasing sequence of cluster sizes. Pairs of clusters merge with a rate equal to the product of their sizes and clusters are deleted with a rate linearly proportional to their size. We prove that the MCLD is a Feller process. This result is a key ingredient in the description of scaling limits of the… Expand
1 Citations

Figures from this paper

Rigid representations of the multiplicative coalescent with linear deletion
We introduce the multiplicative coalescent with linear deletion, a continuous-time Markov process describing the evolution of a collection of blocks. Any two blocks of sizes $x$ and $y$ merge at rateExpand

References

SHOWING 1-10 OF 23 REFERENCES
Rigid representations of the multiplicative coalescent with linear deletion
We introduce the multiplicative coalescent with linear deletion, a continuous-time Markov process describing the evolution of a collection of blocks. Any two blocks of sizes $x$ and $y$ merge at rateExpand
The Entrance Boundary of the Multiplicative Coalescent
The multiplicative coalescent $X(t)$ is a $l^2$-valued Markov process representing coalescence of clusters of mass, where each pair of clusters merges at rate proportional to product of masses. FromExpand
Brownian excursions, critical random graphs and the multiplicative coalescent
Let (B t (s), 0 ≤ s < ∞) be reflecting inhomogeneous Brownian motion with drift t - s at time s, started with B t (0) = 0. Consider the random graph script G sign(n, n -1 + tn -4/3 ), whose largestExpand
Novel scaling limits for critical inhomogeneous random graphs
We flnd scaling limits for the sizes of the largest components at criticality for the rank-1 inho- mogeneous random graphs with power-law degrees with exponent ?. We investigate the case where ? 2Expand
Two-dimensional volume-frozen percolation: exceptional scales
We study a percolation model on the square lattice, where clusters "freeze" (stop growing) as soon as their volume (i.e. the number of sites they contain) gets larger than N, the parameter of theExpand
The percolation process on a tree where infinite clusters are frozen
  • D. Aldous
  • Mathematics
  • Mathematical Proceedings of the Cambridge Philosophical Society
  • 2000
Modify the usual percolation process on the infinite binary tree by forbidding infinite clusters to grow further. The ultimate configuration will consist of both infinite and finite clusters. We giveExpand
Two-dimensional volume-frozen percolation: deconcentration and prevalence of mesoscopic clusters
Frozen percolation on the binary tree was introduced by Aldous around fifteen years ago, inspired by sol-gel transitions. We investigate a version of the model on the triangular lattice, whereExpand
Mean Field Frozen Percolation
We define a modification of the Erdős-Rényi random graph process which can be regarded as the mean field frozen percolation process. We describe the behavior of the process using differentialExpand
A percolation process on the square lattice where large finite clusters are frozen
TLDR
The modified process on the square lattice, where clusters freeze as soon as they have diameter larger than or equal to N, the parameter of the model, is investigated, to investigate if the N- parameter model shows some ‘anomalous’ behaviour as N →∞. Expand
The continuum limit of critical random graphs
We consider the Erdős–Rényi random graph G(n, p) inside the critical window, that is when p = 1/n + λn−4/3, for some fixed $${\lambda \in \mathbb{R}}$$ . We prove that the sequence of connectedExpand
...
1
2
3
...