Category: Network analysis

Eigenvector centrality
In graph theory, eigenvector centrality (also called eigencentrality or prestige score) is a measure of the influence of a node in a network. Relative scores are assigned to all nodes in the network b
Network Science Based Basketball Analytics
Network Science based basketball analytics comprise a various recent attempts to apply the perspective of networks to the analysis of basketball.
Graphical Evaluation and Review Technique
Graphical Evaluation and Review Technique, commonly known as GERT, is a network analysis technique used in project management that allows probabilistic treatment both network logic and estimation of a
Structural cohesion
In sociology, structural cohesion is the conception of a useful formal definition and measure of cohesion in social groups. It is defined as the minimal number of actors in a social network that need
Hierarchical clustering of networks
Hierarchical clustering is one method for finding community structures in a network. The technique arranges the network into a hierarchy of groups according to a specified weight function. The data ca
Lattice network
A symmetrical lattice is a two-port electrical wave filter in which diagonally-crossed shunt elements are present – a configuration which sets it apart from ladder networks. The component arrangement
Automatic clustering algorithms
Automatic clustering algorithms are algorithms that can perform clustering without prior knowledge of data sets. In contrast with other cluster analysis techniques, automatic clustering algorithms can
Girvan–Newman algorithm
The Girvan–Newman algorithm (named after Michelle Girvan and Mark Newman) is a hierarchical method used to detect communities in complex systems.
Hierarchical clustering
In data mining and statistics, hierarchical clustering (also called hierarchical cluster analysis or HCA) is a method of cluster analysis that seeks to build a hierarchy of clusters. Strategies for hi
Centrality
In graph theory and network analysis, indicators of centrality assign numbers or rankings to nodes within a graph corresponding to their network position. Applications include identifying the most inf
Pajek
No description available.
Clique percolation method
The clique percolation method is a popular approach for analyzing the overlapping community structure of networks. The term network community (also called a module, cluster or cohesive group)has no wi
Event chain methodology
Event chain methodology is a network analysis technique that is focused on identifying and managing events and relationship between them (event chains) that affect project schedules. It is an uncertai
Node influence metric
In graph theory and network analysis, node influence metrics are measures that rank or quantify the influence of every node (also called vertex) within a graph. They are related to centrality indices.
Clustering coefficient
In graph theory, a clustering coefficient is a measure of the degree to which nodes in a graph tend to cluster together. Evidence suggests that in most real-world networks, and in particular social ne
Event chain diagram
Event chain diagrams are visualizations that show the relationships between events and tasks and how the events affect each other. Event chain diagrams are introduced as a part of event chain methodol
Closeness centrality
In a connected graph, closeness centrality (or closeness) of a node is a measure of centrality in a network, calculated as the reciprocal of the sum of the length of the shortest paths between the nod
Dependency network
The dependency network approach provides a system level analysis of the activity and topology of directed networks. The approach extracts causal topological relations between the network's nodes (when
Lattice delay network
Lattice delay networks are an important subgroup of lattice networks. They are all-pass filters, so they have a flat amplitude response, but a phase response which varies linearly (or almost linearly)
Hierarchical closeness
Hierarchical closeness (HC) is a structural centrality measure used in network theory or graph theory. It is extended from closeness centrality to rank how centrally located a node is in a directed ne
Individual mobility
Individual human mobility is the study that describes how individual humans move within a network or system. The concept has been studied in a number of fields originating in the study of demographics