Home / Blog / Data Science Digital Book / Network Analysis
Network Analysis
Meet the Author : Mr. Bharani Kumar
Bharani Kumar Depuru is a well known IT personality from Hyderabad. He is the Founder and Director of Innodatatics Pvt Ltd and 360DigiTMG. Bharani Kumar is an IIT and ISB alumni with more than 17 years of experience, he held prominent positions in the IT elites like HSBC, ITC Infotech, Infosys, and Deloitte. He is a prevalent IT consultant specializing in Industrial Revolution 4.0 implementation, Data Analytics practice setup, Artificial Intelligence, Big Data Analytics, Industrial IoT, Business Intelligence and Business Management. Bharani Kumar is also the chief trainer at 360DigiTMG with more than Ten years of experience and has been making the IT transition journey easy for his students. 360DigiTMG is at the forefront of delivering quality education, thereby bridging the gap between academia and industry.
Table of Content
A distinct sort of data, known as network data or graph data, necessitates a different kind of analysis.
Key components of a Graph or Network are Vertices /
Nodes and Edges / Links
Adjacency Matrix. is a representation of a network. It should be noted that the adjacency matrix for an undirected graph is symmetric.
There are two types of links or edges between nodes: unidirectional and bidirectional.
Node Properties:
Degree Centrality = Number of direct ties with other nodes
In-Degree = Number of Incoming connections
Out-Degree = Number of Outgoing connections
Degree centrality is a local measure and hence we should look at other measures.
Closeness Centrality is how close the node is to other nodes in the network
Closeness Centrality = 1/(sum of distances to all other nodes)
When a comparison of two networks arise then normalized closeness should be considered
Normalized Closeness = (Total number of nodes - 1) * Closeness
A node's or an edge's betweenness centrality can be determined.
How frequently a node or edge is on the shortest path between pairs is known as betweenness centrality.
We utilise normalised Betweenness to compare two networks.
Instead than merely counting the number of connections you have, eigenvector centrality counts the quality of your connections.
- Nodes which are connected to high scoring nodes contribute more to the score of that nodes which are connected to low scoring nodes.
- Eigenvector is calculated from eigenvectors of adjacency matrix.
- X corresponding to the highest Eigenvalue is the vector that consists of the Eigenvector centralities of the nodes.
- Diffusion Centrality is a measure on how likely is a person, who receives the information, going to diffuse the information further.
Edge / Link Properties
There is no set rule for establishing edge or link attributes; they are instead defined depending on domain expertise.
The average cluster coefficient of the network's nodes is the Cluster coefficient of the network.
Data Science Training Institutes in Other Locations
Navigate to Address
360DigiTMG - Data Science, Data Scientist Course Training in Bangalore
No 23, 2nd Floor, 9th Main Rd, 22nd Cross Rd, 7th Sector, HSR Layout, Bengaluru, Karnataka 560102
1800-212-654-321
