Erdos-Renyi random graph (Poisson random graphs or Bernoulli graphs)
•Examples (Price 1965 for modeling citations):
–Citations: new citations of a paper are proportional to the number it already has
- very rich mathematical theory: many properties are exactly solvable
- Degree distribution is Poisson since the presence and absence of edges is independent
- Pros (Simple and tractable model, Phase transitions, Giant component)
- Cons (Degree distribution, No community structure, No degree correlations)
- Extensions (Configuration model)
Exponential random graphs (p*) modeli
- Exponential random graph model defines a probability distribution over graphs; includes Erdos-Renyi as a special case;
- No analytical solutions for the model, but can use simulation to sample the graphs (Define local moves on a graph--Addition/removal of edges,Movement of edges,Edge swaps);
- Parameter estimation (maximum likelihood);
- Problem (Can’t solve for transitivity --produces cliques; Used to analyze small networks)
Small world model
- Used for modeling network transitivity;
- Many networks assume some kind of geographical proximity; S
- small-world model ( Start with a low-dimensional regular lattice; Rewire-- Add/remove edges to create shortcuts to join remote parts of the lattice, for each edge with prob p move the other end to a random vertex); Rewiring allows to interpolate between regular lattice and random graph;
- No power-law degree distribution;
Models of evolution
Preferential attachment
- Models the growth of the network
- Preferential attachment (Price 1965, Albert & Barabasi 1999): Add a new node, create M out-links; probability of linking a node K is proportional to its degree
- Based on Herbert Simon’s result--Power-laws arise from “Rich get richer” (cumulative advantage)
- Examples (Price 1965 for modeling citations): Citations: new citations of a paper are proportional to the number it already has
- Examples (Price 1965 for modeling citations):
–Citations: new citations of a paper are proportional to the number it already has
Edge copying model
Community Guided Attachment
Forest Fire model
Models for realistic network generation
Kronecker graphs
