The document defines network topology and graph types like directed, weighted, nodes and links. It discusses basic concepts like degree, adjacency matrix, degree distribution, clustering coefficient and distance for unweighted undirected networks. It also covers connectivity, robustness and properties of regular networks like complete, star-shaped and ring networks.
The document defines network topology and graph types like directed, weighted, nodes and links. It discusses basic concepts like degree, adjacency matrix, degree distribution, clustering coefficient and distance for unweighted undirected networks. It also covers connectivity, robustness and properties of regular networks like complete, star-shaped and ring networks.
The document defines network topology and graph types like directed, weighted, nodes and links. It discusses basic concepts like degree, adjacency matrix, degree distribution, clustering coefficient and distance for unweighted undirected networks. It also covers connectivity, robustness and properties of regular networks like complete, star-shaped and ring networks.
The document defines network topology and graph types like directed, weighted, nodes and links. It discusses basic concepts like degree, adjacency matrix, degree distribution, clustering coefficient and distance for unweighted undirected networks. It also covers connectivity, robustness and properties of regular networks like complete, star-shaped and ring networks.
Network Definition A graph G(N, L) (network topology) specifies how nodes are interconnected or related to other nodes by links.
Graph Type directed? weighted? types of nodes and links? EXAMPLE: Trees, Rings, Complete Graph
Basic Concepts of an undirected/unweighted network
for simple graphs that are unweighted, undirected and without self-loops and no multiple links
Degree & Adjacency matrix
Degree of node i : number of neighbors of node i
Degree of network: < k >=average of the degrees of all nodes
Bounds: Adjacency matrix A of a network:
if node i and j are neighbors else
Degree of node i : ; Symmetric
Degree Distribution P(k)
P(k) = probability that a randomly selected node has exactly k edges
Clustering Coefficient C
Clustering coefficient of node n :
: the edges can exist at most among the neighbors of node i
: the actual number of edges
Clustering coefficient of network C= average of the Clustering Coefficient of all nodes
Distance
Distance d(n,m) between two nodes n and m = the number of links along the shortest path connecting them Diameter of a network=
Average Distance L
Average distance L = average over all d(n,m)
Betweenness
Betweenness 𝐵 𝑙 of a link 𝑙: the number of shortest paths between all possible node pairs in 𝐺 that traverse the link Betweenness of a graph G: Connectivity
Robustness
Basic Properties of Regular Networks
Complete Networks
Degree distribution: Dirac delta function
C=1 L=1
Star-shaped networks
L=2-N/2 (N>3) C=0
Ring-shaped networks (K-nearest-neighbor)
L≈N/2K C=3(K-2)/4(K-1)≈3/4
DAY 03 Random Graph Theory : Erdös –Rényi model Definition
N nodes, each pair of nodes are connected with probability p
Properies
Average Degree: Clustering Coefficient: Average Path Length: Degree Distribution: Binomial -> Poisson
