once we know a nwork is connected, we can ask how tightly it is connected. we measure this in terms of the diameter of the network. say we have airline that not only serves birmingham, houston, denver, and boise, but also albuquerque, kansas city, memphis, and new orleans. let's call these cities our nodes. remember, we can't get directly om birmingham to boise, but we can make some connections to get there. so let's call the flight paths our edges. the fewest number of edges needed to get between two cities is called the "distance." so the distance between birmingham and boise is 2. we can now measure the diameter of the network, which is the greatest dtance between any two nodes. it's the greatest number of flights that you mt take to get from one place to another. since memphis only connects to birmingham, the diameter of this flight network is 3. a diamet of 3 means no more than two transfers. when edges go away, connectivity generally decreases. these statistics get at the large-scale structure of the network, but what about small-scale properties, the