Introduction to Random Graphs Flashcards
graph
pair of vertex set and edge set
complete graph
n vertices and all possible edges
subgraph
subset of vertices and subset of edges
G(n,p) Erdos-Renyi random graph
random spanning subgraph of Kn
P(E(G(n,p))=s)=p^s(1-p)^{{n choose 2} - s}
connected
there is a path between any pair of vertices
//one component
cycle
sequence of distinct vertices and there is edge v_n to v_1
occurs with high probability
lim P(A_n) =1 as n tends to infinity
neighbour
(v,w) in E
edges in complete
n choose 2
spanning subgraph
V’=V
tree
connected graph with no cycles
component
maximal connected subgraph
Cayley’s formula/number of trees on n vertices
n^{n-2}
a_n=o(b_n)
a_n/b_n tends to 0 as n tends to infinity
a_n=O(b_n)
there exists C such that a_n =< Cb_n for all n
a_n ~ b_n
lim (a_n/b_n)=1
a_n«b_n
a_n=o(b_n)
a_n»b_n
b_n=o(a_n)
a_n=Θ(b_n)
a_n=O(b_n) and b_n=O(a_n)
union bound
P(unions)<=sum of Ps
expectation
sum of xP(X=x)
Var(X)
E(X^2)-E(X)^2
covariance
E(XY)-E(X)E(Y)
markov’s inequality
nonnegative RV, t>0
P[X>=t]<=E[X]/t
tends to x in probability
for all ε |X_n-x|<ε with high probability//
lim P[|X_n-x|>=ε]=0
branching process with offspring distribution q
sequence of RVs taking values in NN_0 representing the sizes of successive generations when each individual independently has k offspring with probability q_k
total size
sum of Zs
survives
if T = inf
extinction occurs
T<inf