Barabasi's Experiment Start with small number of vertices: m O At each time step, add new vertex with m(<=m O ) edges that link new vertex to m previous vertices Probability  that a new vertex will be connected to vertex i depends on connectivity k i of that vertex  k i ) = k i /  j k j (Preferential attachment) Demo in Matlab
{}