Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T18:05:25.725Z Has data issue: false hasContentIssue false

Ultra-small scale-free geometric networks

Published online by Cambridge University Press:  14 July 2016

J. E. Yukich*
Affiliation:
Lehigh University
*
∗ Postal address: Department of Mathematics, Lehigh University, Bethlehem, PA 18015, USA. Email address: joseph.yukich@lehigh.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We consider a family of long-range percolation models (G p )p>0 on ℤd that allow dependence between edges and have the following connectivity properties for p ∈ (1/d, ∞): (i) the degree distribution of vertices in G p has a power-law distribution; (ii) the graph distance between points x and y is bounded by a multiple of logpd logpd |x - y | with probability 1 - o(1); and (iii) an adversary can delete a relatively small number of nodes from G p (ℤd ∩ [0, n]d ), resulting in two large, disconnected subgraphs.

Information

Type
Research Article
Copyright
© Applied Probability Trust 2006