diff --git a/network_analysis.ipynb b/network_analysis.ipynb
index 18f4e51..4294e6c 100644
--- a/network_analysis.ipynb
+++ b/network_analysis.ipynb
@@ -109,7 +109,7 @@
     "\n",
     "Below are four different representations of a network. Those four different network representations refer to the same set of nodes and the same set of edges connecting those nodes. \n",
     "\n",
-    "In the network, each person is a _node_. For example, Nancy is a node (ID 3) connected to three other nodes: Emma (ID 2), John (ID 4), and Emily (ID 5). Those three people are _neighbors_ of Nancy. In network terms, Nancy has a _degree_ of three. Similarly, Sophie has two neighbors (i.e., nodes to which Sophie is connected) so we say she has a degree of two.\n",
+    "In the network, each person is a _node_. For example, Nancy is a node (ID 1) connected to three other nodes: Emma (ID 2), John (ID 4), and Emily (ID 5). Those three people are _neighbors_ of Nancy. In network terms, Nancy has a _degree_ of three. Similarly, Sophie has two neighbors (i.e., nodes to which Sophie is connected) so we say she has a degree of two.\n",
     "\n",
     "This is an example of a simple network. Simple networks are characterised as:\n",
     "* Undirected — edges between each pair of nodes have no direction such that if an edge from node A to node B is present, the edge from B to A is also present. By contrast, in directed networks, edges point to only one direction.\n",