Exhibition Gallery

This image shows network graphs with different structured randomness generated by three algorithms (from left to right): Watts-Strogatz small world, Barabási–Albert preferential attachment, and random geometric graph. Each algorithm approximates the statistical properties of real-world social networks in some way. There are 496 nodes in each network. Node size is proportional to the extent to which a node is on the shortest path between other nodes. Color indicates degree (number of edges per node), with redder nodes having a higher degree. Graphs generated in R using the igraph package.

Network Triptych

Mark Thornton ’11

Ph.D. Candidate in the Department of Psychology at Harvard University

This image shows network graphs with different structured randomness generated by three algorithms (from left to right): Watts-Strogatz small world, Barabási–Albert preferential attachment, and random geometric graph. Each algorithm approximates the statistical properties of real-world social networks in some way. There are 496 nodes in each network. Node size is proportional to the extent to which a node is on the shortest path between other nodes. Color indicates degree (number of edges per node), with redder nodes having a higher degree. Graphs generated in R using the igraph package.