English

Construction and convergence results for stable webs

Probability 2021-06-08 v1

Abstract

We introduce a new metric for collections of aged paths and a robust set of criteria for compactness for a set of collection of aged paths in the topology corresponding to this metric. We show that the distribution of stable webs (1<α21< \alpha \leq 2) made up of collections of stable paths is tight in this topology. We then show the weak convergence of appropriately normalized systems of coalescing random walks in the domain of attraction of stable laws for 1<α21 < \alpha \leq 2 under this metric to the corresponding stable web. We obtain some path results in the brownian case.

Keywords

Cite

@article{arxiv.2106.02944,
  title  = {Construction and convergence results for stable webs},
  author = {Thomas Mountford and Krishnamurthi Ravishankar},
  journal= {arXiv preprint arXiv:2106.02944},
  year   = {2021}
}

Comments

25 pages

R2 v1 2026-06-24T02:52:18.018Z