Logo Logo
Hilfe
Hilfe
Switch Language to English

Hao, Nannan und Heydenreich, Markus (2022): Graph distances in scale-free percolation: the logarithmic case. In: Journal of Applied Probability, Bd. 60, Nr. 1: S. 295-313

Volltext auf 'Open Access LMU' nicht verfügbar.

Abstract

Scale-free percolation is a stochastic model for complex networks. In this spatial random graph model, vertices x, y is an element of Z(d) are linked by an edge with probability depending on independent and identically distributed vertex weights and the Euclidean distance vertical bar x - y vertical bar. Depending on the various parameters involved, we get a rich phase diagram. We study graph distance and compare it to the Euclidean distance of the vertices. Our main attention is on a regime where graph distances are (poly-)logarithmic in the Euclidean distance. We obtain improved bounds on the logarithmic exponents. In the light tail regime, the correct exponent is identified.

Dokument bearbeiten Dokument bearbeiten