Scribd
Upload
2 views

b3

The document outlines conventions and notations used in mathematical relations and graph theory, including definitions of asymptotic notations and graph properties. It also describes various random graph models and probability distributions relevant to the study of graphs. Additionally, it acknowledges contributors and provides a structured approach to the content of the book.

Uploaded by

vsftharegister
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

b3

The document outlines conventions and notations used in mathematical relations and graph theory, including definitions of asymptotic notations and graph properties. It also describes various random graph models and probability distributions relevant to the study of graphs. Additionally, it acknowledges contributors and provides a structured approach to the content of the book.

Uploaded by

vsftharegister
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Contents ix

Mike Molloy, Tobias Müller, Rajko Nenadov, Wesley Pegden, Huy Pham, Boris
Pittel, Dan Poole, Pawel Prałat, Oliver Riordan, Andrzej Ruciński, Katarzyna Ry-
barczyk, Wojtek Samotij, Yilun Shang, Matas Šilekis, Greg Sorkin, Joel Spencer,
Sam Spiro, Dudley Stark, Angelika Steger, Prasad Tetali, Andrew Thomason, Lin-
nus Wästlund, Nick Wormald, Stephen Young.
Thanks also to Béla Bollobás for his advice on the structure of the book.

Conventions/Notation
Often in what follows, we will give an expression for a large positive integer. It
might not be obvious that the expression is actually an integer. In which case, the
reader can rest assured that he/she can round up or down and obtained any required
property. We avoid this rounding for convenience and for notational purposes.
In addition we list the following notation:
Mathematical Relations

• f (x) = O(g(x)): | f (x)| ≤ K|g(x)| for some constant K > 0 and all x ∈ R.

• f (x) = Θ(g(x)): f (n) = O(g(x)) and g(x) = O( f (x)).

• f (x) = ω(g(x)) if g(x) = o( f (x)).

• f (x) = Ω(g(x)) if f (x) ≥ cg(x) for some positive constant c.0 and all x ∈ R.

• f (x) = o(g(x)) as x → a: f (x)/g(x) → 0 as x → a.

• A  B: A/B → 0 as n → ∞.

• A  B: A/B → ∞ as n → ∞.

• A ≈ B: A/B → 1 as some parameter converges to 0 or ∞ or another limit.

• A . B or B & A if A ≤ (1 + o(1))B.

• [n]: This is {1, 2, . . . , n}. In general, if a < b are positive integers, then
[a, b] = {a, a + 1, . . . , b}.

• If S is a set and k is a non-negative integer then Sk denotes the set of k-




element subsets of S. In particular, [n]



k dnotes the set of k-sets of {1, 2, . . . , n}.
S Sk S
Furthermore, ≤k = j=0 j .

Graph Notation
x Contents

• G = (V, E): V = V (G) is the vertex set and E = E(G) is the edge set.
• e(G) = |E(G)| and for S ⊆ V we have eG (S) = | {e ∈ E : e ⊆ S} |.
• For S, T ⊆ V, S ∩ T = 0/ we have eG (S : T ) = {e = {x, y} ∈ E : x ∈ S, y ∈ T }.
• N(S) = NG (S) = {w ∈
/ S : ∃v ∈ S such that {v, w} ∈ E} and dG (S) = |NG (S)|
for S ⊆ V (G).
• NG (S, X) = NG (S) ∩ X for X, S ⊆ V .
• degS (x) = | {y ∈ S : {x, y} ∈ E} | for x ∈ V, S ⊆ V and deg(v) = degV (v).
• For sets X,Y ⊆ V (G) we let NG (X,Y ) = {y ∈ Y : ∃x ∈ X, {x, y} ∈ E(G)}
and eG (X,Y ) = |NG (X,Y )|.
• For a graph H, aut(H) denotes the number of automorphisms of H.
• dist(v, w) denotes the graph distance between vertices v, w.
• The co-degree of vertices v, w of graph G is NG (v) ∩ NG (w).
Random Graph Models
• [n]: The set {1, 2, . . . , n}.
• Gn,m : The family of all labeled graphs with vertex set V = [n] = {1, 2, . . . , n}
and exactly m edges.
• Gn,m :A random graph chosen uniformly at random from Gn,m .
• En,m = E(Gn,m ).
• Gn,p : A random graph on vertex set [n] where each possible edge occurs
independently with probability p.
• En,p = E(Gn,p ).
≥k : G
• Gδn,m n,m , conditioned on having minimum degree at least k.

• Gn,n,p : A random bipartite graph with vertex set consisting of two disjoint
copies of [n] where each of the n2 possible edges occurs independently with
probability p.
• Gn,r : A random r-regular graph on vertex set [n].
• Gn,d : The set of graphs with vertex set [n] and degree sequence
d = (d1 , d2 , . . . , dn ).
Contents xi

• Gn,d : A random graph chosen uniformly at random from Gn,d .

• Hn,m;k : A random k-uniform hypergraph on vertex set [n] and m edges of


size k.

• Hn,p;k : A random k-uniform hypergraph on vertex set [n] where each of the
n
k possibles edge occurs independently with probability p.

• ~Gk−out : A random digraph on vertex set [n] where each v ∈ [n] indepen-
dently chooses k random out-neighbors.

• Gk−out : The graph obtained from ~Gk−out by ignoring orientation and coa-
lescing multiple edges.

Probability

• P(A): The probability of event A.

• E Z: The expected value of random variable Z.

• h(Z): The entropy of random variable Z.

• Po(λ ): A random variable with the Poisson distribution with mean λ .

• N(0, 1): A random variable with the normal distribution, mean 0 and vari-
ance 1.

• Bin(n, p): A random variable with the binomial distribution with parameters
n, the number of trials and p, the probability of success.

• EXP(λ ): A random variable with the exponential distribution, mean λ i.e.


P(EXP(λ ) ≥ x) = e−λ x . We sometimes say rate 1/λ in place of mean λ .

• w.h.p.: A sequence of events An , n = 1, 2, . . . , is said to occur with high


probability (w.h.p.) if limn→∞ P(An ) = 1.
d d
• →: We write Xn → X to say that a random variable Xn converges in distribu-
d
tion to a random variable X, as n → ∞. Occasionally we write Xn → N(0, 1)
d
(resp. Xn → Po(λ )) to mean that X has the corresponding normal (resp.
Poisson) distribution.
xii Contents
Part I

Basic Models

You might also like