Random Geometric Graphs

Transcription

1 Random Geometric Graphs Mathew D. Penrose University of Bath, UK SAMBa Symposium (Talk 2) University of Bath November

2 MODELS of RANDOM GRAPHS Erdos-Renyi G(n, p): start with the complete n-graph, retain each edge with probability p (independently). Random geometric graph G(n, r). Place n points uniformly at random in [0,1] 2. Connect any two points distance at most r apart. Consider n large and p or r small. Expected degree of a typical vertex is approximately: np for G(n, p) nπr 2 for G(n,r) Often we choose p = p n or r = r n to make this expected degree Θ(1). In this case G(n,r n ) resembles the following infinite system: 2

3 CONTINUUM PERCOLATION (see Meester and Roy 1996) Let P λ be a homogeneous Poisson point process in R d with intensity λ, i.e. P λ (A) Poisson(λ A ) and P λ (A i ) are independent variables for A 1,A 2,... disjoint. Gilbert Graph. Form a graph G λ := G(P λ ) on P λ by connecting two Poisson points x,y iff x y 1. Form graph G 0 λ := G(P λ {0}) similarly on P λ {0}. Let p k (λ) be the prob. that the component of Gλ 0 vertices (also depends on d). containing 0 has k p (λ) := 1 k=0 p k(λ) be the prob. that this component is infinite. 3

4 RANDOM GEOMETRIC GRAPHS (rescaled) (Penrose 2003) Let U 1,...,U n be independently uniformly randomly scattered in a cube of volume n/λ in d-space. Form a graph G n,λ on {1,2,...,n} by i j iff U i U j 1 Define C i to be the order of the component of G n,λ containing i. It can be shown that n 1 n i=1 1{ C i = k} P p k (λ) as n, i.e. for large n, [ ] n P n 1 1{ C i = k} p k (λ) 1 i=1 That is, the proportionate number of vertices of G n,λ lying in components of order k, converges to p k (λ) in probability. 4

5 A FORMULA FOR p k (λ). p k+1 (λ) = (k +1)λ k (R d ) k h(x 1,...,x k ) exp( λa(0,x 1,...,x k ))dx 1...dx k where h(x 1,...,x k ) is 1 if G({0,x 1,...,x k }) is connected and 0 x 1 x k lexicographically, otherwise zero; and A(0,x 1,...,x k ) is the volume of the union of 1-balls centred at 0,x 1,...,x k. Not tractable for large k. 5

6 THE PHASE TRANSITION If p (λ) = 0, then G λ has no infinite component, almost surely. If p (λ) > 0, then G λ has a unique infinite component, almost surely. Also, p (λ) is nondecreasing in λ. Fundamental theorem: If d 2 then λ c (d) := sup{λ : p (λ) = 0} (0, ). If d = 1 then λ c (d) =. From now on, assume d 2. The value of λ c (d) is not known. 6

7 LARGE COMPONENTS FOR THE RGG Consider again the random geometric graph G n,λ (on n uniform random points in a cube of volume n/λ in d-space) Let L 1 (G n,λ ) be the size of the largest component, and L 2 (G n,λ ) the size of the second largest component ( size measured by number of vertices). As n with λ fixed (and ζ(λ) as on P16 below): if λ > λ c then n 1 L 1 (G n,λ ) if λ < λ c then (logn) 1 L 1 (G n,λ ) P p (λ) > 0 P 1/ζ(λ) and for the Poissonized RGG G Nn,λ (N n Poisson (n)), L 2 (G Nn,λ) = O(logn) d/(d 1) in probability if λ > λ c 7

8 CENTRAL AND LOCAL LIMIT THEOREMS. Let K(G n,λ ) be the number of components of G n,λ. As n with λ fixed, [ ] K(Gn,λ ) EK(G n,λ ) t P t Φ σ (t) := ϕ σ (x)dx n where ϕ σ (x) := (2πσ 2 ) 1/2 e x2 /(2σ 2) (normal pdf); and if λ > λ c, [ ] L1 (G n,λ ) EL 1 (G n,λ ) P t Φ τ (t). n sup z Z Here σ and τ are positive constants, dependent on λ. Also, { ( )} z n 1/2 EK(Gn,λ )) P[K(G n,λ ) = z] ϕ σ 0. n 8

9 ISOLATED VERTICES. Suppose d = 2. Let N 0 (G n,λ ) be the number of isolated vertices. The expected number of isolated vertices satisfies EN 0 (G n,λ ) nexp( πλ) so if we fix t and take λ(n) = (logn+t)/π, then as n, EN 0 (G n,λ(n) ) e t. Also, N 0 is approximately Poisson distributed so P[N 0 (G n,λ(n) ) = 0] exp( e t ). 9

10 CONNECTIVITY. Note G n,λ is connected iff K(G n,λ ) = 1. Clearly P[K(G n,λ ) = 1] P[N 0 (G n,λ(n) ) = 0]. Again taking λ(n) = (logn+t)/π with t fixed, it turns out (Penrose 1997) that lim P[K(G n,λ(n)) = 1] = lim P[N 0(G n,λ(n) ) = 0] = exp( e t ) n n or in other words, lim (P[K(G n,λ(n)) > 1] P[N 0 (G n,λ(n) ) > 0]) = 0. n 10

11 THE CONNECTIVITY THRESHOLD Let V 1,...,V n be independently uniformly randomly scattered in [0,1] d. Form a graph G r n on {1,2,...,n} by i j iff V i V j r. Given the values of V 1,...,V n, define the connectivity threshold ρ n (K = 1), and the no-isolated-vertex threshold ρ n (N 0 = 0), by ρ n (K = 1) = min{r : K(G r n) = 1}; ρ n (N 0 = 0) = min{r : N 0 (G r n) = 1}. The preceding result can be interpreted as giving the limiting distributions of these thresholds (suitably scaled and centred) as n : they have the same limiting behaviour. 11

12 Taking λ(n) = (logn+t)/π with t fixed, we have so the earlier result λ(n)/n P[K(G n,λ(n) ) = 1] = P[K(Gn ) = 1] [ = P ρ n (K = 1) ] (logn+t)/(πn) lim P[K(G n,λ(n)) = 1] = lim P[N 0(G n,λ(n) ) = 0] = exp( e t ) n n implies lim P[nπ(ρ n(k = 1)) 2 logn t] = exp(e t ) n and likewise for ρ n (N 0 ) = 0. In fact we have a stronger result: lim P[ρ n(k = 1) = ρ n (N 0 = 0)] = 1. n 12

13 MULTIPLE CONNECTIVITY. Given k N, a graph is k-connected if for any two distinct vertices there are k disjoint paths connecting them. Let ρ n,k be the smallest r such that G r n is k-connected. Let ρ n (N <k = 0) be the smallest r such that G r n has no vertex of degree less than k (a random variable determined by V 1,...,V n ). Then lim P[ρ n,k = ρ n (N <k = 0)] = 1. n The limit distribution of ρ n (N <k = 0) can be determined via Poisson approximation, as with ρ n (N 0 = 0). 13

14 HAMILTONIAN PATHS Let ρ n (Ham) be the smallest r such that G r n has a Hamiltonian path (i.e. a self-avoiding tour through all the vertices). Clearly ρ n (Ham) ρ n (N <2 = 0). In fact (Balogh, Bollobas, Walters, Krivelevich, Müller 2009), lim P[ρ n(ham) = ρ n (N <2 = 0)] = 1. n 14

15 CONTINUITY OF p (λ) Clearly p (λ) = 0 for λ < λ c Also p (λ) is increasing in λ on λ > λ c. Less trivially, it is known that p (λ) is continuous in λ on λ (λ c, ) and is right continuous at λ = λ c, i.e. p (λ c ) = lim λ λc p (λ). So p ( ) is continuous on (0, ) iff p (λ c ) = 0. This is known to hold for d = 2 (Alexander 1996) and for large d (Tanemura 1996). It is conjectured to hold for all d. 15

16 LARGE-k ASYMPTOTICS FOR p k (λ) Suppose λ < λ c. Then there exists ζ(λ) > 0 such that ( ζ(λ) = lim n 1 logp n (λ) ) n or more informally, p n (λ) (e ζ(λ) ) n. Proof uses subadditivity. With x n 1 := (x 1,...,x n ), recall p n+1 (λ) = (n+1)λ n h(x n 1)e λa(0,xn 1 ) dx n 1. Setting q n := p n+1 /(n+1), can show q n q m q n+m 1, so logq n /(n 1) inf n 1 ( logq n /(n 1)) := ζ as n. That ζ(λ) > 0 is a deeper result. 16

17 LARGE-k ASYMPTOTICS: THE SUPERCRITICAL CASE Suppose λ > λ c. Then lim sup n lim inf n ( ) n (d 1)/d logp n (λ) ( n (d 1)/d logp n (λ) ) < 0 > Loosely speaking, this says that in the supercritical case p n (λ) decays exponentially in n 1 1/d, whereas in the subcritical case it decays exponentially in n. 17

18 OTHER PROPERTIES OF RGGS Asymptotic behaviour of other quantities arising from of random geometric graph have been considered, including The largest and smallest degree. The clique and chromatic number. In some cases, non-uniform distributions of the vertices V 1,...,V n have been considered. 18

19 References [1] Bollobás, B. and Riordan, O. (2006) Percolation. Cambridge University Press. [2] Franceschetti, M. and Meester, R. (2008) Random Networks in Communiction. Cambridge University Press. [3] Meester, R. and Roy, R. (1996) Continuum Percolation. Cambridge University Press. [4] Penrose, M.D. (2003). Random Geometric Graphs. Oxford University Press. 19