Ultra-small scale-free geometric networks
Keyword(s):
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 log pd log pd | 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.
2006 ◽
Vol 43
(3)
◽
pp. 665-677
◽
Keyword(s):
Keyword(s):
2013 ◽
Vol 753-755
◽
pp. 2959-2962
Keyword(s):
2020 ◽
Vol 499
(1)
◽
pp. 1385-1394
Keyword(s):
Keyword(s):
2012 ◽
Vol 229-231
◽
pp. 1854-1857
Keyword(s):
2007 ◽
Vol 17
(07)
◽
pp. 2419-2434
◽
2009 ◽
Vol 9
(14)
◽
pp. 4537-4544
◽
Keyword(s):
2007 ◽
Vol 17
(07)
◽
pp. 2447-2452
◽
Keyword(s):