arXiv Analytics

Sign in

arXiv:1401.0409 [math.PR]AbstractReferencesReviewsResources

Inhomogeneous Long-Range Percolation for Real-Life Network Modeling

Rajat Subhra Hazra, Mario V. Wüthrich

Published 2014-01-02, updated 2014-09-26Version 2

The study of random graphs has become very popular for real-life network modeling such as social networks or financial networks. Inhomogeneous long-range percolation (or scale-free percolation) on the lattice $\mathbb Z^d$, $d\ge1$, is a particular attractive example of a random graph model because it fulfills several stylized facts of real-life networks. For this model various geometric properties such as the percolation behavior, the degree distribution and graph distances have been analyzed. In the present paper we complement the picture about graph distances. Moreover, we prove continuity of the percolation probability in the phase transition point.

Comments: 19 pages, new version. Substantially modified version
Categories: math.PR
Related articles: Most relevant | Search more
arXiv:1206.1956 [math.PR] (Published 2012-06-09)
On the Continuity of SLE(κ) in κ
arXiv:math/0603223 [math.PR] (Published 2006-03-09)
Continuity for self-destructive percolation in the plane
arXiv:1806.05702 [math.PR] (Published 2018-06-14)
On (signed) Takagi-Landsberg functions: $p^{\text{th}}$ variation, maximum, and modulus of continuity