Random

Graphs
 Random Network Model
Significance of Modeling hypothetical creation of a
simple
representation of a
complex network
Model enables to derive properties
used to predict outcomes under certain constraints
appropriate analysis of proposed model
establish correctness in representation of real world
network
Erdo Renyi -Random Graph
ER-Graphs models
huge number of nodes in network
large complex network with dense link formation
dynamism in network Dr. Adwitiya
2
Sinha
 Random Network Model
contd.
Model Assumptions
Initially, there are disconnected nodes in network
Eventually, an undirected network is formed with nodes
connecting independently in a random manner
Each node has attempts to get edges
Each attempt is considered a success with probability
The binomial distribution gives probability that a node
possess degree

Dr. Adwitiya
3
Sinha
 Random Network Model
contd.
The parameter is probability that may be :
outcome of a distribution function

flipping of an unbiased coin to decide for

potentiality of an edge
threshold function : total outcomes , an edge is

created and vice versa

Approximation for largely dense network
Large and small , the above degree distribution in

binomial formulation can be approximated with

Poisson distribution as:

Dr. Adwitiya
4
Sinha
 Random Network Model
contd.
The random graph with degrees Poisson distributed is
well known as :
- Poisson random network
Bollobs network configuration, having expected
degree
In - random graph :
Giant Component - largest component
Encompasses a significant portion of network
An important property of :
Occupies a finite fraction
Finiteness property holds even if the network tends
to grow infinitely

Dr. Adwitiya
5
Sinha
 Degree Distribution
The degree distribution exhibits global pattern of network
well-connected nodes are referred as hubs of information

geodesic measures how evenly network is distributed

For a network with large number of nodes

Assumption : Links are dense enough such that network is

assumed to be connected
for
where degree of node
Theorem : Average Path Length and Diameter are

approximately proportional to

Dr. Adwitiya
6
Sinha
 Degree Distribution
The degree distribution exhibits global pattern of network
well-connected nodes are referred as hubs of information

geodesic measures how evenly network is distributed

For a network with large number of nodes

Assumption : Links are dense enough such that network is

assumed to be connected
for
where degree of node
Theorem : Average Path Length and Diameter are

approximately proportional to

Dr. Adwitiya
7
Sinha
 Isolation Probability
For a large connected network modeled in form of -graph :

Thresholdabove which each nodes are expected to have
links
Beyond threshold the possibility of having disconnected
components eventually vanishes
Essential Condition :
For densely connected - random graph, Average degree
becomes :

Probability of some node being isolated probability that it

has no links
Assumption : Links are created independent of each other
Dr. Adwitiya
8
Sinha
 Isolation Probability
For a large connected network modeled in form of -graph :

Thresholdabove which each nodes are expected to have
links
Beyond threshold the possibility of having disconnected
components eventually vanishes
Essential Condition :
For densely connected - random graph, Average degree
becomes :

Probability of some node being isolated probability that it

has no links
Assumption : Links are created independent of each other
Dr. Adwitiya
9
Sinha
 Isolation Probability
contd.
Now, denotes the probability of presence of any link
probability of absence of any link would be given by
Equating equations (2) & (3) :

Probability for a node to be isolated (i.e. not connected)
from rest of the nodes in the network:

Dr. Adwitiya
10
Sinha
 Isolation Probability
contd.
Now, denotes the probability of presence of any link
probability of absence of any link would be given by
Equating equations (2) & (3) :

Probability for a node to be isolated (i.e. not connected)
from rest of the nodes in the network:

Dr. Adwitiya
11
Sinha
 Isolation Probability
contd.
Now, denotes the probability of presence of any link
probability of absence of any link would be given by
Equating equations (2) & (3) :

Probability for a node to be isolated (i.e. not connected)
from rest of the nodes in the network:

Dr. Adwitiya
12
Sinha
 Isolation Probability
contd.
The isolation probability approaches to :

Further, expected number of isolated network can be
derived as :

It can be clearly interpreted from the above equation that :
tends to infinity, the expected number of isolated

nodes tends to zero

It provides an instance of extremely well connected

network
As , average number of isolated nodes increases

infinitely

Dr. Adwitiya
13
Sinha
 Isolation Probability
contd.
The isolation probability approaches to :

Further, expected number of isolated network can be
derived as :

It can be clearly interpreted from the above equation that :
tends to infinity, the expected number of isolated

nodes tends to zero

It provides an instance of extremely well connected

network
As , average number of isolated nodes increases

infinitely

Dr. Adwitiya
14
Sinha
 Isolation Probability
contd.
The isolation probability approaches to :

Further, expected number of isolated network can be
derived as :

It can be clearly interpreted from the above equation that :
tends to infinity, the expected number of isolated

nodes tends to zero

It provides an instance of extremely well connected

network
As , average number of isolated nodes increases

infinitely

Dr. Adwitiya
15
Sinha
 Giant
Component
Assume fraction nodes in the largest component
Considering node at random
chance that it is in giant component is
Chance that node is outside GC
chance that all of its neighbours are outside GC

Probability that a node is outside of GC is

Probability that all of its neighbours are outside GC is
Let is the chance that node has neighbours, then :
Equation (9) becomes :

Equating equation (8) & (10) : node degree

Dr. Adwitiya
16
Sinha
 Giant
Component
Assume fraction nodes in the largest component
Considering node at random
chance that it is in giant component is
Chance that node is outside GC
chance that all of its neighbours are outside GC

Probability that a node is outside of GC is

Probability that all of its neighbours are outside GC is
Let is the chance that node has neighbours, then :
Equation (9) becomes :

Equating equation (8) & (10) : node degree

Dr. Adwitiya
17
Sinha
 Giant
Component
Assume fraction nodes in the largest component
Considering node at random
chance that it is in giant component is
Chance that node is outside GC
chance that all of its neighbours are outside GC

Probability that a node is outside of GC is

Probability that all of its neighbours are outside GC is
Let is the chance that node has neighbours, then :
Equation (9) becomes :

Equating equation (8) & (10) : node degree

Dr. Adwitiya
18
Sinha
 Giant Component contd.

Since dealing with Erdos-Renyi Poisson Distributed, degree

distribution is expressed as :

where, Average Degree

Plugging value of from (12) in equation :

Dr. Adwitiya
19
Sinha
 Giant Component contd.

Since dealing with Erdos-Renyi Poisson Distributed, degree

distribution is expressed as :

where, Average Degree

Plugging value of from (12) in equation :

Dr. Adwitiya
20
Sinha
 Giant Component contd.

Since dealing with Erdos-Renyi Poisson Distributed, degree

distribution is expressed as :

where, Average Degree

Plugging value of from (12) in equation :

Dr. Adwitiya
21
Sinha
 Giant Component contd.

Applying Taylor Series approximation to

equation (14) :

Taking log on both

sides :

Interpretation
:
Probability of being in the
giant component increases
with

Dr. Adwitiya
22
Sinha
 Giant Component contd.

Applying Taylor Series approximation to

equation (14) :

Taking log on both

sides :

Interpretation
:
Probability of being in the
giant component increases
with

Dr. Adwitiya
23
Sinha
 Giant Component contd.

Applying Taylor Series approximation to

equation (14) :

Taking log on both

sides :

Interpretation
:
Probability of being in the
giant component increases
with

Dr. Adwitiya
24
Sinha