# Unit 11

## Connecting with Networks

Network Graph

Connections can be physical, as with bridges, or immaterial, as with friendships. Both types of connections can be understood using the same mathematical framework called network theory, or graph theory, which is a way to abstract and quantify the notion of connectivity. This unit looks at how this branch of mathematics provides insights into extremely complicated networks such as ecosystems.

## Unit Goals

• Networks can be represented by graphs, which can be analyzed mathematically.
• A graph is a set of elements along with another set that defines how the elements are connected.
• The degree of a node is how many connections it has.
• A path is a sequence of edges connecting two nodes.
• A connected component of a graph is a maximal collection of nodes and edges that are mutually connected.
• Random graphs can undergo "connectivity avalanches" during construction.
• Distance on a graph is a measure of the fewest number of edges needed to travel between two given nodes.
• The clustering coefficient is a measure of how many of a node's neighbors are connected to each other (e.g., the fraction of a given individual’s friends who are also friends with each other).
• Small-world networks have higher-than-expected clustering coefficients and short mean distances.
• Scale-free networks follow a power law when describing the distribution of degrees.

# Video Transcript

Virtually everything we experience — in nature as well as human activity — involves a series of connections that link one thing to another. Networks, you might say, make the world go 'round.

# Textbook

Mathematicians view networks as fundamental objects of study. Networks, as a whole, exhibit behavior that is very difficult, if not impossible, to understand by studying the elements individually.

# Interactive

This interactive is a concept-building exercise, which explores at the characteristics of networks and allows you to build networks that meet specific criteria.

© Annenberg Foundation 2017. All rights reserved. Legal Policy