Title: SNA

Number of edges, average degree

Adjacency Matrix

Degrees of an Adjacency Matrix

Complete graph (edges, density)

Average distance and diameter

Cycle and eulerian path

Connectivity

Out- and In-Components

Unimodal vs Multimodal networks

Bipartite graphs

Degree Centrality

Eigenvector Centrality

Closeness Centrality

Betweenness Centrality

Link Analysis Using Hubs and Authorities

Page Rank

Cliques

K-Core

K-Components

Triadic Closure

Local Clustering Coefficient

Global Clustering Coefficient

Reciprocity

Strong and Weak Ties

Bridges, Local Bridges

Strong Triadic Closure Property

Local Bridges and Weak Ties

Neighbourhood Overlap

Girvan-Newman Algorithm

Modularity

Modularity Maximisation

Six Signatures of Relational Analytics

Homophily, Measuring Homphily

Selection and Social Influence

Affiliation Networks

Balance Property, Structure of Balanced Networks

Balance Theorem

Weakly Balanced Networks

Degree Distribution and Sequence

Power Law Distribution

Rich-Get-Richer Models

Distribution of other Centrality Measures

Random Graphs G(n, m)

Random Graphs G(n, p)

Small-World Model (or Watts-Strogatz Model)

Barabási-Albert Model

Processes on Networks (general)

Cascades and Clusters