Module-1 Lecture-2
Module-1 Lecture-2
Lecture - 2
Dr. Jagadeesh M S
Introduction
• Electronic sources for network analysis: Electronic discussion networks, Blogs and
online communities, Web based networks Applications of Social Network Analysis.
10 Most Popular Websites
Google
Alexa traffic Linking root Display
Site Domain rank domains Network Ad Type Ranking measures
(May 2013) (May 2013) Planner
(July 2011) Alexa traffic rank
Alexa Internet ranks websites based on a combined
facebook.co Social measure of page views and unique site users.
Facebook 1 8,190,877 1
m Networking Alexa creates a list of "top websites" based on this data
time-averaged over three month periods.
Google google.com 2 4,533,883 NA
Search
http://www.wikipedia.org
More simply put:
“Social media
is people having
conversation
online.”
The conversations are powered by
…
• Blogs
• Micro Blogs
• Online Chat
• RSS
• Video Sharing Sites
• Photo Sharing Sites
…
“WHY SHOULD
I CARE?”
Reason #1
SOCIAL-NETWORKING
SITES
ARE THE MOST
POPULAR SITES.
BECAUSE 3 OUT OF 4 AMERICANS USE SOCIAL
TECHNOLOGY
Forrester, The Growth of Social Technology Adoption, 2008
BECAUSE 2/3 of THE GLOBAL INTERNET
POPULATION VISIT SOCIAL NETWORKS
Nielsen, Global Faces & Networked
Places, 2009
Reason #2
78%
OF PEOPLE TRUST THE
RECOMMENDATIONS OF OTHER
CONSUMERS.
NIELSEN “TRUST IN ADVERTISING” REPORT, OCTOBER 2007
Reason #3
C B Z
R Y
A
D E
S T
What is a Network?
• Network = graph
• Informally a graph is a set of nodes joined by a set of
lines or arrows.
1 1 2 3
2 3
4 5 6 4 5 6
Graph-based representations
Representing a problem as a graph can provide a different point of
view
Representing a problem as a graph can make a problem much
simpler
More accurately, it can provide the appropriate tools for
solving the problem
What is network theory?
• Vertex
• Basic Element
• Drawn as a node or a dot.
• Vertex set of G is usually denoted by V(G), or V
• Edge
• A set of two elements
• Drawn as a line connecting two vertices, called end vertices,
or endpoints.
• The edge set of G is usually denoted by E(G), or E.
Example
• V:={1,2,3,4,5,6}
• E:={{1,2},{1,5},{2,3},{2,5},{3,4},{4,5},{4,6}}
Simple Graphs
loop
multiple arc
arc node
Weighted graphs
• is a graph for which each edge has an associated weight, usually given by a
weight function w: E R.
1.2 2
1 2 3 1 2 3
.2
.5 1.5 5 3
.3 1
4 5 6 4 5 6
.5
Structures and structural metrics
• a graph is connected if
• you can get from any node to any other by following a sequence of edges OR
• any two nodes are connected by a path.
1. Density refers to the "connections" between participants. Density is defined as the number of connections a participant
has, divided by the total possible connections a participant could have. For example, if there are 20 people
participating, each person could potentially connect to 19 other people. A density of 100% (19/19) is the greatest
density in the system. A density of 5% indicates there is only 1 of 19 possible connections.
2. Centrality focuses on the behavior of individual participants within a network. It measures the extent to which an
individual interacts with other individuals in the network. The more an individual connects to others in a network,
the greater their centrality in the network. [
In-degree and out-degree variables are related to centrality.
3. In-degree centrality concentrates on a specific individual as the point of focus; centrality of all other individuals is
based on their relation to the focal point of the "in-degree" individual.
4. Out-degree is a measure of centrality that still focuses on a single individual, but the analytic is concerned with
the out- going interactions of the individual; the measure of out-degree centrality is how many times
the focus point individual interacts with others.
5. A sociogram is a visualization with defined boundaries of connections in the network. For example, a sociogram which
shows out-degree centrality points for Participant A would illustrate all outgoing connections Participant A
made in the studied network.