Network theory

theoretical concept in sociology

empirical rule that the value of a telecommunications network is proportional to the square of its number of users

Scheduling algorithm in project management

statistical tool, used in project management

problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized

study of graphs as a representation of relations between discrete objects

network with non-trivial topological features

academic field

number defined from a node-link network quantifying how likely it is that two neighbors of a randomly chosen node will be adjacent

the problem of finding a simple path of maximum length in a given graph

theorem characterizing graph connectivity by disjoint paths

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 influential person(s) in a social network, key infrastructure nodes in the Internet or urban networks, super-spreaders of disease, and brain networks. Centrality concepts were first developed in social network analysis, and many of the terms used to measure centrality reflect their sociological origin. Over time, the concept has expanded substantially, leading to the development of hundreds of distin

probability distribution of degrees of a node over the whole network

thumb|300px|right|Example of Gephi network visualizationGephi ( ) is an open-source network analysis and visualization software package written in Java on the NetBeans platform.

Value of a network is 2^n. Based on expoentual increase in sub groups formable

arbiter on a node in packet switching communication network

communication subsystem on an integrated circuit

network measure

measure of network community structure

problem of maximizing the weight of the minimum-weight edge in the path between two vertices

computing device or component designed to receive signals from other components

Assortativity, or assortative mixing, is a preference for a network's nodes to attach to others that are similar in some way. Though the specific measure of similarity may vary, network theorists often examine assortativity in terms of a node's degree. The addition of this characteristic to network models more closely approximates the behaviors of many real world networks.

A gap between two individuals who have complementary sources to information

investigative data-analysis technique