Random Geometric Graphs
|
|
- Aldous Bennett
- 5 years ago
- Views:
Transcription
1 Random Geometric Graphs Mathew D. Penrose University of Bath, UK Networks: stochastic models for populations and epidemics ICMS, Edinburgh September
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: if λ > λ c then n 1 L 1 (G n,λ ) if λ < λ c then (log n) 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(log n) 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,λ ) n exp( πλ) so if we fix t and take λ(n) = (log n + 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) = (log n + 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) = (log n + 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) ] (log n + 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 log n 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). It has recently been established (Balogh, Bollobas, Walters, Krivelevich, Müller 2009) that lim P[ρ n(ham) = ρ n (N <2 = 0)] = 1. n 14
15 SMALL SUBGRAPHS Let Γ be a fixed connected graph of order k. Assume Γ is feasible, i.e. P[G k,λ Γ] > 0 for some λ. Let J Γ (G n,λ ) be the number of components isomorphic to Γ. Let H Γ (G n,λ ) be the number of induced subgraphs isomomorphic to Γ (e.g. number of triangles). As n with λ fixed, n 1 J Γ (G n,λ ) p Γ, n 1 H Γ (G n,λ ) µ Γ a.s. where p Γ (λ) and µ Γ (λ) are given by formulae similar to p n (λ). In terms of G 0 λ (the Poisson Gilbert graph), p Γ is the probability 0 is in a component isomorphic to Γ, and µ Γ is the expected number of induced Γ-subgraphs incident to 0. cf. random simplicial complexes 15
16 CLT AND LLT FOR SMALL SUBGRAPHS. There are constants σ(γ, λ) and τ(γ, λ) (this time we have integral formulae) such that as n, P [ HΓ (G n,λ ) EH Γ (G n,λ ) n ] t Φ σ (t). { ( )} z sup n 1/2 EHΓ (G n,λ ) P[H Γ (G n,λ ) = z] ϕ σ 0, z Z n and P [ JΓ (G n,λ ) EJ Γ (G n,λ ) n ] t Φ τ (t), { ( )} z sup n 1/2 EHΓ (G n,λ ) P[H Γ (G n,λ ) = z] ϕ τ 0. z Z n 16
17 POISSON LIMITS. Consider G(n, r n ) with n k r d(k 1) n c. (Equivalent to G n,λn with λ n n 1/(k 1) ). Then ( ) n EH Γ (G(n, r n )) rn d(k 1) µ Γ (1) c k In fact, for n large both H Γ (G(n, r n )) and J Γ (G(n, r n )) are approximately Poisson (c ). Now suppose n 3 r 2d n c and let N 2 be the number of vertices of degree 2. Then N 2 is approximately compound Poisson. Reason: N 2 = N + 3N, and N and N converge to independent Poissons. 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 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. 19
20 LARGE-k ASYMPTOTICS FOR p k (λ) Suppose λ < λ c. Then there exists ζ(λ) > 0 such that ( ζ(λ) = lim n 1 log p 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 log q n /(n 1) inf n 1 ( log q n /(n 1)) := ζ as n. That ζ(λ) > 0 is a deeper result. 20
21 LARGE-k ASYMPTOTICS: THE SUPERCRITICAL CASE Suppose λ > λ c. Then lim sup n lim inf n ( ) n (d 1)/d log p n (λ) ( n (d 1)/d log p 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. 21
22 HIGH DIMENSIONAL ASYMPTOTICS (Penrose 1996) Let θ d denote the volume of the unit ball in R d. Suppose λ = λ(d) is chosen so that λ(d)θ d = µ (this is the expected degree of the origin 0 in G 0 λ ). Asymptotically as d with µ fixed, the structure of C 0 converges to that of a branching process (Z 0, Z 1,...) with Poisson (µ) offspring distribution (Z 0 = 1, Z n is nth generation size). So (Penrose 1996): p k (λ(d)) p k (µ) := P[ n=0 Z n = k]; p (λ(d)) ψ(µ) := P [ n=0 Z n = ]; θ d λ c (d) 1. 22
23 DETAILS OF THE BRANCHING PROCESS THEORY: p k (µ) = P[ Z n = k] = n=0 kk 2 (k 1)! µk 1 e kµ. t = 1 ψ(µ) is the smallest positive solution to t = exp(µ(t 1)). In particular, ψ(µ) = 0, if µ 1 ψ(µ) > 0, if µ > 1 23
24 OTHER MODELS OF CONTINUUM PERCOLATION The Boolean model. Let Ξ be the union of balls of random radius centred at the points of P λ (with some specified radius distribution). Look at the connected components of Ξ. The random connection model. Given P λ, let each pair (x, y) of points of P λ be connected with probability f( x y ) with f some specified function satisfying R d f( x )dx < Both of these are generalizations of the model we have been considering. 24
25 Nearest-neighbour percolation. Fix k N. Join each point of P λ by an undirected edge to its k nearest neighbours in P λ. Look at components of resulting graph. Lilypond model. At time zero, start growing a ball of unit rate outwards from each point of P λ, stopping as soon as it hits another ball. This yields a maximal system of non-overlapping balls on P. Voronoi cell percolation. Let each vertex of P λ be coloured red (with probability p), otherwise blue. Look at connectivity properties of the union of red Voronoi cells. 25
26 HIGH-INTENSITY ASYMPTOTICS Let θ denote the volume of the unit ball in R d. As λ, p (λ) 1 and in fact (Penrose 1991) 1 p (λ) p 1 (λ) = exp( λθ) This says that for large λ, given the unlikely event that the component of Gλ 0 containing 0 is finite, it is likely to consist of an isolated vertex. Also, for k 1, log p k+1 (λ) = λθ + (d 1)k log λ k + O(1) as λ with k fixed (Alexander 1991). 26
27 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. 27
Random graphs: Random geometric graphs
Random graphs: Random geometric graphs Mathew Penrose (University of Bath) Oberwolfach workshop Stochastic analysis for Poisson point processes February 2013 athew Penrose (Bath), Oberwolfach February
More informationRandom Geometric Graphs
Random Geometric Graphs Mathew D. Penrose University of Bath, UK SAMBa Symposium (Talk 2) University of Bath November 2014 1 MODELS of RANDOM GRAPHS Erdos-Renyi G(n, p): start with the complete n-graph,
More informationPhase Transitions in Combinatorial Structures
Phase Transitions in Combinatorial Structures Geometric Random Graphs Dr. Béla Bollobás University of Memphis 1 Subcontractors and Collaborators Subcontractors -None Collaborators Paul Balister József
More informationLilypad Percolation. Enrique Treviño. April 25, 2010
Lilypad Percolation Enrique Treviño April 25, 2010 Abstract Let r be a nonnegative real number. Attach a disc of radius r to infinitely many random points (including the origin). Lilypad percolation asks
More informationA simple branching process approach to the phase transition in G n,p
A simple branching process approach to the phase transition in G n,p Béla Bollobás Department of Pure Mathematics and Mathematical Statistics Wilberforce Road, Cambridge CB3 0WB, UK b.bollobas@dpmms.cam.ac.uk
More informationNote on the structure of Kruskal s Algorithm
Note on the structure of Kruskal s Algorithm Nicolas Broutin Luc Devroye Erin McLeish November 15, 2007 Abstract We study the merging process when Kruskal s algorithm is run with random graphs as inputs.
More informationPercolation in the Secrecy Graph
Percolation in the Secrecy Graph Amites Sarkar Martin Haenggi August 13, 2012 Abstract The secrecy graph is a random geometric graph which is intended to model the connectivity of wireless networks under
More informationRandom Geometric Graphs.
Random Geometric Graphs. Josep Díaz Random Geometric Graphs Random Euclidean Graphs, Random Proximity Graphs, Random Geometric Graphs. Random Euclidean Graphs Choose a sequence V = {x i } n i=1 of independent
More informationSusceptible-Infective-Removed Epidemics and Erdős-Rényi random
Susceptible-Infective-Removed Epidemics and Erdős-Rényi random graphs MSR-Inria Joint Centre October 13, 2015 SIR epidemics: the Reed-Frost model Individuals i [n] when infected, attempt to infect all
More informationThe Geometry of Random Right-angled Coxeter Groups
The Geometry of Random Right-angled Coxeter Groups Tim Susse University of Nebraska - Lincoln May 14, 2015 Joint work with Jason Behrstock, Victor Falgas-Ravry and Mark Hagen Tim Susse (UNL) Random RACGs
More informationAdventures in random graphs: Models, structures and algorithms
BCAM January 2011 1 Adventures in random graphs: Models, structures and algorithms Armand M. Makowski ECE & ISR/HyNet University of Maryland at College Park armand@isr.umd.edu BCAM January 2011 2 Complex
More informationLecture 06 01/31/ Proofs for emergence of giant component
M375T/M396C: Topics in Complex Networks Spring 2013 Lecture 06 01/31/13 Lecturer: Ravi Srinivasan Scribe: Tianran Geng 6.1 Proofs for emergence of giant component We now sketch the main ideas underlying
More informationSpectra of adjacency matrices of random geometric graphs
Spectra of adjacency matrices of random geometric graphs Paul Blackwell, Mark Edmondson-Jones and Jonathan Jordan University of Sheffield 22nd December 2006 Abstract We investigate the spectral properties
More informationA = A U. U [n] P(A U ). n 1. 2 k(n k). k. k=1
Lecture I jacques@ucsd.edu Notation: Throughout, P denotes probability and E denotes expectation. Denote (X) (r) = X(X 1)... (X r + 1) and let G n,p denote the Erdős-Rényi model of random graphs. 10 Random
More informationCycle lengths in sparse graphs
Cycle lengths in sparse graphs Benny Sudakov Jacques Verstraëte Abstract Let C(G) denote the set of lengths of cycles in a graph G. In the first part of this paper, we study the minimum possible value
More informationLIMIT THEORY FOR PLANAR GILBERT TESSELLATIONS
PROBABILITY AND MATHEMATICAL STATISTICS Vol. 31, Fasc. 1 (2011), pp. 149 160 LIMIT THEORY FOR PLANAR GILBERT TESSELLATIONS BY TOMASZ S C H R E I B E R (TORUŃ) AND NATALIA S O JA (TORUŃ) Abstract. A Gilbert
More informationContinuum percolation with holes
Continuum percolation with holes A. Sarkar a,, M. Haenggi b a Western Washington University, Bellingham WA 98225, USA b University of Notre Dame, Notre Dame IN 46556, USA Abstract We analyze a mathematical
More informationSharp threshold functions for random intersection graphs via a coupling method.
Sharp threshold functions for random intersection graphs via a coupling method. Katarzyna Rybarczyk Faculty of Mathematics and Computer Science, Adam Mickiewicz University, 60 769 Poznań, Poland kryba@amu.edu.pl
More information6.207/14.15: Networks Lecture 3: Erdös-Renyi graphs and Branching processes
6.207/14.15: Networks Lecture 3: Erdös-Renyi graphs and Branching processes Daron Acemoglu and Asu Ozdaglar MIT September 16, 2009 1 Outline Erdös-Renyi random graph model Branching processes Phase transitions
More informationTopics in Stochastic Geometry. Lecture 4 The Boolean model
Institut für Stochastik Karlsruher Institut für Technologie Topics in Stochastic Geometry Lecture 4 The Boolean model Lectures presented at the Department of Mathematical Sciences University of Bath May
More informationarxiv: v2 [math.pr] 26 Jun 2017
Existence of an unbounded vacant set for subcritical continuum percolation arxiv:1706.03053v2 math.pr 26 Jun 2017 Daniel Ahlberg, Vincent Tassion and Augusto Teixeira Abstract We consider the Poisson Boolean
More informationErdős-Renyi random graphs basics
Erdős-Renyi random graphs basics Nathanaël Berestycki U.B.C. - class on percolation We take n vertices and a number p = p(n) with < p < 1. Let G(n, p(n)) be the graph such that there is an edge between
More informationScaling limits for random trees and graphs
YEP VII Probability, random trees and algorithms 8th-12th March 2010 Scaling limits for random trees and graphs Christina Goldschmidt INTRODUCTION A taste of what s to come We start with perhaps the simplest
More informationIndependent Transversals in r-partite Graphs
Independent Transversals in r-partite Graphs Raphael Yuster Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel Abstract Let G(r, n) denote
More informationThe expansion of random regular graphs
The expansion of random regular graphs David Ellis Introduction Our aim is now to show that for any d 3, almost all d-regular graphs on {1, 2,..., n} have edge-expansion ratio at least c d d (if nd is
More informationInduced subgraphs with many repeated degrees
Induced subgraphs with many repeated degrees Yair Caro Raphael Yuster arxiv:1811.071v1 [math.co] 17 Nov 018 Abstract Erdős, Fajtlowicz and Staton asked for the least integer f(k such that every graph with
More informationThe giant component in a random subgraph of a given graph
The giant component in a random subgraph of a given graph Fan Chung, Paul Horn, and Linyuan Lu 2 University of California, San Diego 2 University of South Carolina Abstract We consider a random subgraph
More informationMixing time and diameter in random graphs
October 5, 2009 Based on joint works with: Asaf Nachmias, and Jian Ding, Eyal Lubetzky and Jeong-Han Kim. Background The mixing time of the lazy random walk on a graph G is T mix (G) = T mix (G, 1/4) =
More informationThe diameter and mixing time of critical random graphs.
The diameter and mixing time of critical random graphs. March 14, 2007 Joint work with: Asaf Nachmias. Background The Erdos and Rényi random graph G(n, p) is obtained from the complete graph on n vertices
More informationPercolation and limit theory for the Poisson lilypond model
Percolation and limit theory for the Poisson lilypond model Günter Last and Mathew D. Penrose July 21, 2010 Abstract The lilypond model on a point process in d-space is a growth-maximal system of nonoverlapping
More informationPacking and decomposition of graphs with trees
Packing and decomposition of graphs with trees Raphael Yuster Department of Mathematics University of Haifa-ORANIM Tivon 36006, Israel. e-mail: raphy@math.tau.ac.il Abstract Let H be a tree on h 2 vertices.
More informationGaussian Limits for Random Measures in Geometric Probability
Gaussian Limits for Random Measures in Geometric Probability Yu. Baryshnikov and J. E. Yukich 1 May 19, 2004 bstract We establish Gaussian limits for measures induced by binomial and Poisson point processes
More informationn! (k 1)!(n k)! = F (X) U(0, 1). (x, y) = n(n 1) ( F (y) F (x) ) n 2
Order statistics Ex. 4.1 (*. Let independent variables X 1,..., X n have U(0, 1 distribution. Show that for every x (0, 1, we have P ( X (1 < x 1 and P ( X (n > x 1 as n. Ex. 4.2 (**. By using induction
More informationNote on Vertex-Disjoint Cycles
Note on Vertex-Disjoint Cycles Jacques Verstraëte Department of Pure Mathematics and Mathematical Statistics Centre for Mathematical Sciences Wilberforce Road, Cambridge CB3 OWB England. November 999.
More informationShortest Paths in Random Intersection Graphs
Shortest Paths in Random Intersection Graphs Gesine Reinert Department of Statistics University of Oxford reinert@stats.ox.ac.uk September 14 th, 2011 1 / 29 Outline Bipartite graphs and random intersection
More informationNotes 6 : First and second moment methods
Notes 6 : First and second moment methods Math 733-734: Theory of Probability Lecturer: Sebastien Roch References: [Roc, Sections 2.1-2.3]. Recall: THM 6.1 (Markov s inequality) Let X be a non-negative
More informationThe greedy independent set in a random graph with given degr
The greedy independent set in a random graph with given degrees 1 2 School of Mathematical Sciences Queen Mary University of London e-mail: m.luczak@qmul.ac.uk January 2016 Monash University 1 Joint work
More informationGround states for exponential random graphs
Ground states for exponential random graphs Mei Yin Department of Mathematics, University of Denver March 5, 2018 We propose a perturbative method to estimate the normalization constant in exponential
More informationRandom Graphs. 7.1 Introduction
7 Random Graphs 7.1 Introduction The theory of random graphs began in the late 1950s with the seminal paper by Erdös and Rényi [?]. In contrast to percolation theory, which emerged from efforts to model
More informationMarkov Chains CK eqns Classes Hitting times Rec./trans. Strong Markov Stat. distr. Reversibility * Markov Chains
Markov Chains A random process X is a family {X t : t T } of random variables indexed by some set T. When T = {0, 1, 2,... } one speaks about a discrete-time process, for T = R or T = [0, ) one has a continuous-time
More informationIndependence and chromatic number (and random k-sat): Sparse Case. Dimitris Achlioptas Microsoft
Independence and chromatic number (and random k-sat): Sparse Case Dimitris Achlioptas Microsoft Random graphs W.h.p.: with probability that tends to 1 as n. Hamiltonian cycle Let τ 2 be the moment all
More informationANATOMY OF THE GIANT COMPONENT: THE STRICTLY SUPERCRITICAL REGIME
ANATOMY OF THE GIANT COMPONENT: THE STRICTLY SUPERCRITICAL REGIME JIAN DING, EYAL LUBETZKY AND YUVAL PERES Abstract. In a recent work of the authors and Kim, we derived a complete description of the largest
More informationThe large deviation principle for the Erdős-Rényi random graph
The large deviation principle for the Erdős-Rényi random graph (Courant Institute, NYU) joint work with S. R. S. Varadhan Main objective: how to count graphs with a given property Only consider finite
More informationIntroduction to Complexity Theory
Introduction to Complexity Theory Read K & S Chapter 6. Most computational problems you will face your life are solvable (decidable). We have yet to address whether a problem is easy or hard. Complexity
More informationConnectivity of random k-nearest neighbour graphs
Connectivity of random k-nearest neighbour graphs Paul Balister Béla Bollobás Amites Sarkar Mark Walters October 25, 2006 Abstract Let P be a Poisson process of intensity one in a square S n of area n.
More information1 Mechanistic and generative models of network structure
1 Mechanistic and generative models of network structure There are many models of network structure, and these largely can be divided into two classes: mechanistic models and generative or probabilistic
More informationPERCOLATION IN SELFISH SOCIAL NETWORKS
PERCOLATION IN SELFISH SOCIAL NETWORKS Charles Bordenave UC Berkeley joint work with David Aldous (UC Berkeley) PARADIGM OF SOCIAL NETWORKS OBJECTIVE - Understand better the dynamics of social behaviors
More informationThe concentration of the chromatic number of random graphs
The concentration of the chromatic number of random graphs Noga Alon Michael Krivelevich Abstract We prove that for every constant δ > 0 the chromatic number of the random graph G(n, p) with p = n 1/2
More informationThe range of tree-indexed random walk
The range of tree-indexed random walk Jean-François Le Gall, Shen Lin Institut universitaire de France et Université Paris-Sud Orsay Erdös Centennial Conference July 2013 Jean-François Le Gall (Université
More informationGaussian Limits for Random Measures in Geometric Probability
Gaussian Limits for Random Measures in Geometric Probability Yu. Baryshnikov and J. E. Yukich 1 September 22, 2004 bstract We establish Gaussian limits for measures induced by binomial and Poisson point
More informationRandom subgraphs of finite graphs: III. The phase transition for the n-cube
Random subgraphs of finite graphs: III. The phase transition for the n-cube Christian Borgs Jennifer T. Chayes Remco van der Hofstad Gordon Slade Joel Spencer September 14, 004 Abstract We study random
More informationEquitable coloring of random graphs
Michael Krivelevich 1, Balázs Patkós 2 1 Tel Aviv University, Tel Aviv, Israel 2 Central European University, Budapest, Hungary Phenomena in High Dimensions, Samos 2007 A set of vertices U V (G) is said
More informationRandom Graphs. EECS 126 (UC Berkeley) Spring 2019
Random Graphs EECS 126 (UC Bereley) Spring 2019 1 Introduction In this note, we will briefly introduce the subject of random graphs, also nown as Erdös-Rényi random graphs. Given a positive integer n and
More informationA New Random Graph Model with Self-Optimizing Nodes: Connectivity and Diameter
A New Random Graph Model with Self-Optimizing Nodes: Connectivity and Diameter Richard J. La and Maya Kabkab Abstract We introduce a new random graph model. In our model, n, n 2, vertices choose a subset
More informationLecture 7: The Subgraph Isomorphism Problem
CSC2429, MAT1304: Circuit Complexity October 25, 2016 Lecture 7: The Subgraph Isomorphism Problem Instructor: Benjamin Rossman 1 The Problem SUB(G) Convention 1 (Graphs). Graphs are finite simple graphs
More informationLecture 4: Phase Transition in Random Graphs
Lecture 4: Phase Transition in Random Graphs Radu Balan February 21, 2017 Distributions Today we discuss about phase transition in random graphs. Recall on the Erdöd-Rényi class G n,p of random graphs,
More informationarxiv: v1 [math.pr] 24 Sep 2009
A NOTE ABOUT CRITICAL PERCOLATION ON FINITE GRAPHS GADY KOZMA AND ASAF NACHMIAS arxiv:0909.4351v1 [math.pr] 24 Sep 2009 Abstract. In this note we study the the geometry of the largest component C 1 of
More informationForcing unbalanced complete bipartite minors
Forcing unbalanced complete bipartite minors Daniela Kühn Deryk Osthus Abstract Myers conjectured that for every integer s there exists a positive constant C such that for all integers t every graph of
More informationAustin Mohr Math 704 Homework 6
Austin Mohr Math 704 Homework 6 Problem 1 Integrability of f on R does not necessarily imply the convergence of f(x) to 0 as x. a. There exists a positive continuous function f on R so that f is integrable
More informationR. Lachieze-Rey Recent Berry-Esseen bounds obtained with Stein s method andgeorgia PoincareTech. inequalities, 1 / with 29 G.
Recent Berry-Esseen bounds obtained with Stein s method and Poincare inequalities, with Geometric applications Raphaël Lachièze-Rey, Univ. Paris 5 René Descartes, Georgia Tech. R. Lachieze-Rey Recent Berry-Esseen
More informationDisjoint Subgraphs in Sparse Graphs 1
Disjoint Subgraphs in Sparse Graphs 1 Jacques Verstraëte Department of Pure Mathematics and Mathematical Statistics Centre for Mathematical Sciences Wilberforce Road Cambridge CB3 OWB, UK jbav2@dpmms.cam.ac.uk
More informationRANDOM WALKS AND PERCOLATION IN A HIERARCHICAL LATTICE
RANDOM WALKS AND PERCOLATION IN A HIERARCHICAL LATTICE Luis Gorostiza Departamento de Matemáticas, CINVESTAV October 2017 Luis GorostizaDepartamento de Matemáticas, RANDOM CINVESTAV WALKS Febrero AND 2017
More informationEötvös Loránd University, Budapest. 13 May 2005
A NEW CLASS OF SCALE FREE RANDOM GRAPHS Zsolt Katona and Tamás F Móri Eötvös Loránd University, Budapest 13 May 005 Consider the following modification of the Barabási Albert random graph At every step
More informationSubhypergraph counts in extremal and random hypergraphs and the fractional q-independence
Subhypergraph counts in extremal and random hypergraphs and the fractional q-independence Andrzej Dudek adudek@emory.edu Andrzej Ruciński rucinski@amu.edu.pl June 21, 2008 Joanna Polcyn joaska@amu.edu.pl
More information6 Markov Chain Monte Carlo (MCMC)
6 Markov Chain Monte Carlo (MCMC) The underlying idea in MCMC is to replace the iid samples of basic MC methods, with dependent samples from an ergodic Markov chain, whose limiting (stationary) distribution
More informationThe Secrecy Graph and Some of its Properties
The Secrecy Graph and Some of its Properties Martin Haenggi Department of Electrical Engineering University of Notre Dame Notre Dame, IN 46556, USA E-mail: mhaenggi@nd.edu Abstract A new random geometric
More informationComponent structure of the vacant set induced by a random walk on a random graph. Colin Cooper (KCL) Alan Frieze (CMU)
Component structure of the vacant set induced by a random walk on a random graph Colin Cooper (KCL) Alan Frieze (CMU) Vacant set definition and results Introduction: random walks and cover time G n,p vacant
More informationOn the Optimum Asymptotic Multiuser Efficiency of Randomly Spread CDMA
On the Optimum Asymptotic Multiuser Efficiency of Randomly Spread CDMA Ralf R. Müller Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU) Lehrstuhl für Digitale Übertragung 13 December 2014 1. Introduction
More informationApplications of the Lopsided Lovász Local Lemma Regarding Hypergraphs
Regarding Hypergraphs Ph.D. Dissertation Defense April 15, 2013 Overview The Local Lemmata 2-Coloring Hypergraphs with the Original Local Lemma Counting Derangements with the Lopsided Local Lemma Lopsided
More informationarxiv: v5 [math.pr] 5 Nov 2015
Shortest Path through Random Points Sung Jin Hwang Steven B. Damelin Alfred O. Hero III arxiv:1202.0045v5 [math.pr] 5 Nov 2015 University of Michigan Mathematical Reviews Abstract Let M, g 1 ) be a complete
More informationInfinite geodesics in hyperbolic random triangulations
Infinite geodesics in hyperbolic random triangulations Thomas Budzinski April 20, 2018 Abstract We study the structure of infinite geodesics in the Planar Stochastic Hyperbolic Triangulations T λ introduced
More informationPercolation in General Graphs
Percolation in General Graphs Fan Chung Paul Horn Linyuan Lu Abstract We consider a random subgraph G p of a host graph G formed by retaining each edge of G with probability p. We address the question
More informationHard-Core Model on Random Graphs
Hard-Core Model on Random Graphs Antar Bandyopadhyay Theoretical Statistics and Mathematics Unit Seminar Theoretical Statistics and Mathematics Unit Indian Statistical Institute, New Delhi Centre New Delhi,
More informationPhase Transitions in Random Discrete Structures
Institut für Optimierung und Diskrete Mathematik Phase Transition in Thermodynamics The phase transition deals with a sudden change in the properties of an asymptotically large structure by altering critical
More informationarxiv:math/ v1 [math.pr] 10 Nov 2006
A near neighbour continuum percolation model arxiv:math/0611315v1 [math.pr] 10 Nov 2006 Alexis Gillett and Misja Nuyens Vrije Universiteit Amsterdam April 16, 2017 Abstract We introduce a continuum percolation
More informationInduced subgraphs of Ramsey graphs with many distinct degrees
Induced subgraphs of Ramsey graphs with many distinct degrees Boris Bukh Benny Sudakov Abstract An induced subgraph is called homogeneous if it is either a clique or an independent set. Let hom(g) denote
More informationThe tail does not determine the size of the giant
The tail does not determine the size of the giant arxiv:1710.01208v2 [math.pr] 20 Jun 2018 Maria Deijfen Sebastian Rosengren Pieter Trapman June 2018 Abstract The size of the giant component in the configuration
More informationColoring Geographical Threshold Graphs
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 12:3, 2010, 103 114 Coloring Geographical Threshold Graphs Milan Bradonjić 1 and Tobias Müller 2 and Allon G. Percus 3S 1 Theoretical Division,
More informationCluster Identification in Nearest-Neighbor Graphs
Cluster Identification in Nearest-Neighbor Graphs Markus Maier, Matthias Hein, and Ulrike von Luxburg Max Planck Institute for Biological Cybernetics, Tübingen, Germany first.last@tuebingen.mpg.de Abstract.
More informationEfficient routing in Poisson small-world networks
Efficient routing in Poisson small-world networks M. Draief and A. Ganesh Abstract In recent work, Jon Kleinberg considered a small-world network model consisting of a d-dimensional lattice augmented with
More informationThe typical structure of graphs without given excluded subgraphs + related results
The typical structure of graphs without given excluded subgraphs + related results Noga Alon József Balogh Béla Bollobás Jane Butterfield Robert Morris Dhruv Mubayi Wojciech Samotij Miklós Simonovits.
More informationCENTRAL LIMIT THEOREMS FOR SOME GRAPHS IN COMPUTATIONAL GEOMETRY. By Mathew D. Penrose and J. E. Yukich 1 University of Durham and Lehigh University
The Annals of Applied Probability 2001, Vol. 11, No. 4, 1005 1041 CENTRAL LIMIT THEOREMS FOR SOME GRAPHS IN COMPUTATIONAL GEOMETRY By Mathew D. Penrose and J. E. Yukich 1 University of Durham and Lehigh
More informationCritical percolation on networks with given degrees. Souvik Dhara
Critical percolation on networks with given degrees Souvik Dhara Microsoft Research and MIT Mathematics Montréal Summer Workshop: Challenges in Probability and Mathematical Physics June 9, 2018 1 Remco
More informationOn Random Points in the Unit Disk
On Random Points in the Unit Disk Robert B. Ellis Illinois Institute of Technology, Chicago, Illinois rellis@math.iit.edu Xingde Jia Texas State University-San Marcos, San Marcos, Texas jia@txstate.edu
More informationSolution Set for Homework #1
CS 683 Spring 07 Learning, Games, and Electronic Markets Solution Set for Homework #1 1. Suppose x and y are real numbers and x > y. Prove that e x > ex e y x y > e y. Solution: Let f(s = e s. By the mean
More informationGibbs point processes with geometrical interactions. Models for strongly structured patterns
Gibbs point processes with geometrical interactions. Models for strongly structured patterns David Dereudre, Laboratoire Paul Painlevé, Lille (joint work with R. Drouilhet and H.-O. Georgii) 8th September
More informationRandom Graphs. Research Statement Daniel Poole Autumn 2015
I am interested in the interactions of probability and analysis with combinatorics and discrete structures. These interactions arise naturally when trying to find structure and information in large growing
More informationAlmost giant clusters for percolation on large trees
for percolation on large trees Institut für Mathematik Universität Zürich Erdős-Rényi random graph model in supercritical regime G n = complete graph with n vertices Bond percolation with parameter p(n)
More informationSpectral asymptotics for stable trees and the critical random graph
Spectral asymptotics for stable trees and the critical random graph EPSRC SYMPOSIUM WORKSHOP DISORDERED MEDIA UNIVERSITY OF WARWICK, 5-9 SEPTEMBER 2011 David Croydon (University of Warwick) Based on joint
More informationLecture 5: January 30
CS71 Randomness & Computation Spring 018 Instructor: Alistair Sinclair Lecture 5: January 30 Disclaimer: These notes have not been subjected to the usual scrutiny accorded to formal publications. They
More informationRandom Lifts of Graphs
27th Brazilian Math Colloquium, July 09 Plan of this talk A brief introduction to the probabilistic method. A quick review of expander graphs and their spectrum. Lifts, random lifts and their properties.
More informationRandom measures, intersections, and applications
Random measures, intersections, and applications Ville Suomala joint work with Pablo Shmerkin University of Oulu, Finland Workshop on fractals, The Hebrew University of Jerusalem June 12th 2014 Motivation
More informationarxiv:math/ v1 [math.co] 17 Apr 2002
arxiv:math/0204222v1 [math.co] 17 Apr 2002 On Arithmetic Progressions of Cycle Lengths in Graphs Jacques Verstraëte Department of Pure Mathematics and Mathematical Statistics Centre for Mathematical Sciences
More informationAcyclic subgraphs with high chromatic number
Acyclic subgraphs with high chromatic number Safwat Nassar Raphael Yuster Abstract For an oriented graph G, let f(g) denote the maximum chromatic number of an acyclic subgraph of G. Let f(n) be the smallest
More informationNormal Approximation in Geometric Probability
arxiv:math/0409088v1 [math.pr] 6 Sep 2004 Normal Approximation in Geometric Probability Mathew D. Penrose 1 and J. E. Yukich 2 University of Bath and Lehigh University February 1, 2008 Abstract We use
More informationOpen problems from Random walks on graphs and potential theory
Open problems from Random walks on graphs and potential theory edited by John Sylvester University of Warwick, 18-22 May 2015 Abstract The following open problems were posed by attendees (or non attendees
More information3-Coloring of Random Graphs
3-Coloring of Random Graphs Josep Díaz 1 UPC 1 Research partially supported by the Future and Emerging Technologies programme of the EU under contract 001907 (DELIS) Coloring problems. Given a graph G
More informationCourse Notes. Part IV. Probabilistic Combinatorics. Algorithms
Course Notes Part IV Probabilistic Combinatorics and Algorithms J. A. Verstraete Department of Mathematics University of California San Diego 9500 Gilman Drive La Jolla California 92037-0112 jacques@ucsd.edu
More informationSmall subgraphs of random regular graphs
Discrete Mathematics 307 (2007 1961 1967 Note Small subgraphs of random regular graphs Jeong Han Kim a,b, Benny Sudakov c,1,vanvu d,2 a Theory Group, Microsoft Research, Redmond, WA 98052, USA b Department
More informationTHE SECOND LARGEST COMPONENT IN THE SUPERCRITICAL 2D HAMMING GRAPH
THE SECOND LARGEST COMPONENT IN THE SUPERCRITICAL 2D HAMMING GRAPH REMCO VAN DER HOFSTAD, MALWINA J. LUCZAK, AND JOEL SPENCER Abstract. The 2-dimensional Hamming graph H(2, n consists of the n 2 vertices
More information