L2- SNA

NODES, EDGES AND NETWORK MEASURES

8/7/2024 SOCIAL NETWORK ANALYSIS

 Basics of network Structure Ways of representing directed
graph
Types of graph

Examples
 Undirected networks:
coauthorship network, actor network, Facebook friendship
network
 Directed networks:
URLs on the www, phone calls, Retweet network

8/7/2024 SOCIAL NETWORK ANALYSIS

8/7/2024 SOCIAL NETWORK ANALYSIS
Types of Graph Weighted vs Unweighted

Simple vs Multigraph: loops or multiedges

8/7/2024 SOCIAL NETWORK ANALYSIS

Representing Networks
Adjacency List
An adjacency list, also called an edge list, is one of the most basic and frequently used representations of
a network. Each edge in the network is indicated by listing the pair of nodes that are connected.

8/7/2024 SOCIAL NETWORK ANALYSIS

Representing Networks
Adjacency Matrix

8/7/2024 SOCIAL NETWORK ANALYSIS

 Basic network structure and properties
• Subnetworks
• Singletons, Dyad, triad
• Cliques
• Clusters
• Egocentric networks
• Paths & Connectedness
• Bridges and hubs
8/7/2024 SOCIAL NETWORK ANALYSIS
 When we are considering a subset of the nodes
and edges in a graph,It is called a subnetwork.
Some of the simplest subnetworks are singletons. These
are nodes that have no edges.
We also are interested in small groups of nodes. When
looking at two nodes and their relationship, it is called a
dyad,and a group of three nodes is called a triad.
Figure2.6 shows a connected dyad between B and C,
and a fully connected triad between D,E, and F.
However, we could consider the relationship between A
and B. Eventhough they are not connected, that pair of
nodes could also be called a dyad.

8/7/2024 SOCIAL NETWORK ANALYSIS

 Clique
 A group of people who are all strongly connected and tend to talk mostly to one another.
 For a graph or subgraph to be a clique, every node must be connected to every other.

8/7/2024 SOCIAL NETWORK ANALYSIS

8/7/2024 SOCIAL NETWORK ANALYSIS
Egocentric Networks
One of the most important types of subgraphs considered is the egocentric network. This is a network we
pull out by selecting a node and all of its connections.

Examples of a 1.0, 1.5, and 2.0 network. In an unweighted undirected network, the 1.0 network is simply the
list of a person's friends. The 1.5 network includes the connections between these people, and the 2.0 network
includes their other friends

8/7/2024 SOCIAL NETWORK ANALYSIS

 Egocentric networks
1-Degree egocentric network, only shows us the nodes D is connected to. More frequently, we
want to know about the connections between D’s neighbors.
If we want to see only D’s neighbors and their connections, it is called a 1.5-degree egocentric
network. we are not going two full steps away from D in the network. We are going only one step, but
then looking at the connections between those nodes. Often, the central node and its edges are
excluded and only the node’s neighbors and there connections are considered, which helps to make
the graph more readable.
2-degree egocentric network, includes all of D’s neighbors, their connections to one another,
and all of their neighbors.
Egocentric networks are used to understand nodes and their role in the network.
Egocentric networks are an important tool for network analysis

8/7/2024 SOCIAL NETWORK ANALYSIS

8/7/2024 SOCIAL NETWORK ANALYSIS
 Paths and connectedness
•A path is a walk without passing through the same link more than once (e.g. 1, 2, 5, 4, 3).
•The connections between nodes and measures of their closeness are important network characteristics
A path is a series of nodes that can be traversed following edges between them .
To determine the length of a path, we count the number of edges in it. The path from M to C (Fig.2.7) has a length of 4.
Shortest paths -an important measure in network analysis and are sometimes called geodesic distances.

8/7/2024 SOCIAL NETWORK ANALYSIS

Connectedness
Paths are used to determine a graph property called connectedness.
Two nodes are connected if there is a path between them in the network.
Any path will work and need not be direct edge.
Two nodes in a graph are called connected if there is a path between them in the network.

8/7/2024 SOCIAL NETWORK ANALYSIS

 Connected Component or Component
If a graph is not connected,it may have subgraphs that are connected. These are called connected components.
For example, Figure 2.6 includes a three-node connected component,a two-node connected component, and a
singleton.

Singleton,2-node connected component and 3-node

component

8/7/2024 SOCIAL NETWORK ANALYSIS

Strongly Connected and Weakly Connected
W.r.to directed graphs

 A directed graph is strongly connected

if there is a path from any node to each other
node, and vice versa.

8/7/2024 SOCIAL NETWORK ANALYSIS

 Bridges and Hubs
1. Two basic concepts that we can use to identify particularly important edges and nodes.
2. The first is a bridge- bridge is an edge that connects two otherwise separate groups of nodes
in the network.
3. Formally, a bridge is an edge that, if removed, will increase the number of connected
components in a graph. Fig. 2.7 - the edge between nodes P and F is a bridge.
4. Hubs are important nodes rather than edges. but the term is used to refer to the most
connected nodes in the network. Fig. 2.7 - node P would be a hub because it has many
connections to other nodes.

8/7/2024 SOCIAL NETWORK ANALYSIS

Bridges and Hub

8/7/2024 SOCIAL NETWORK ANALYSIS

 Clique Vs Clusters

For a graph or subgraph to be a clique, every node must be connected to every other.
Clusters : a group of nodes that have many connections between them, but may not a
clique because every node is not connected to every other.

8/7/2024 SOCIAL NETWORK ANALYSIS

8/7/2024 SOCIAL NETWORK ANALYSIS
 Exercise :1

8/7/2024 SOCIAL NETWORK ANALYSIS

 Exercise :2

A)How many singletons are there in the network? List

them.
B) What is the largest connected component?
C) Are there any bridges in the network? If so, where are
they?
D)Create an adjacency list for the network.
E)Create an adjacency matrix for the network.

8/7/2024 SOCIAL NETWORK ANALYSIS

Exercise 3
1.Identify and draw the 1 degree,1.5 degree and 2 degree egocentric networks with respect to node
H in the subnetwork given below.
2.Identify the bridge and hub(most connected node), Clique in the given subnetwork.
3. write down adjacency list and adjacency matrix for this graph.

8/7/2024 SOCIAL NETWORK ANALYSIS

Exercise 4

1.Are there any hubs or bridges in the fig. ? If

yes specify.
2. Is there a singleton?
3. Do you find any Clique in the network? if yes,
mention all of them and identify the largest
clique
4. Draw the 1,1.5, 2-degree egocentric network
for the graph(Consider nodes “F”, “E”, “O”, “C”,
“H” and “K” )
5. Are they strongly connected? (Y/N)

8/7/2024 SOCIAL NETWORK ANALYSIS

 Exercise 5 –
Facebook-Friends Graph

1. Draw the 1,1.5, 2-degree egocentric

network for the graph (Consider all nodes)
2.Are there any hubs or bridges in the fig. ?
If yes specify.
3. Is there a singleton?
4. Do you find any Clique in the network? if
yes, mention all of them and identify the
largest clique.

8/7/2024 SOCIAL NETWORK ANALYSIS