SettingsNetwork theory
Agent Network Topology
Agent network topologies not only take agent distribution into consideration, but also consider agent mobility and intelligence in a network.
Agent network topologies not only take agent distribution into consideration, but also consider agent mobility and intelligence in a network.
Alpha centrality
In graph theory and social network analysis, alpha centrality is a measure of centrality of nodes within a graph.
In graph theory and social network analysis, alpha centrality is a measure of centrality of nodes within a graph.
Average path length
Average path length is a concept in network topology that is defined as the average number of steps along the shortest paths for all possible pairs of network nodes.
Average path length is a concept in network topology that is defined as the average number of steps along the shortest paths for all possible pairs of network nodes.
Betweenness Centrality
Betweenness Centrality is a measure of a node's centrality in a network equal to the number of shortest paths from all vertices to all others that pass through that node.
Betweenness Centrality is a measure of a node's centrality in a network equal to the number of shortest paths from all vertices to all others that pass through that node.
Betweenness centrality
Betweenness centrality is a measure of a node's centrality in a network equal to the number of shortest paths from all vertices to all others that pass through that node.
Betweenness centrality is a measure of a node's centrality in a network equal to the number of shortest paths from all vertices to all others that pass through that node.
Bose-Einstein condensation (network theory)
Bose–Einstein condensation in networks is a phase transition observed in complex networks that can be described with the same mathematical model as that explaining Bose–Einstein condensation in ...
Bose–Einstein condensation in networks is a phase transition observed in complex networks that can be described with the same mathematical model as that explaining Bose–Einstein condensation in ...
Bose–Einstein condensation: a network theory approach
Bose–Einstein condensation in networks is a phase transition observed in complex networks that can be described with the same mathematical model as that explaining Bose–Einstein condensation in ...
Bose–Einstein condensation in networks is a phase transition observed in complex networks that can be described with the same mathematical model as that explaining Bose–Einstein condensation in ...
Centrality
Within the scope of graph theory and network analysis, there are various types of measures of the centrality of a vertex within a graph that determine the relative importance of a vertex within ...
Within the scope of graph theory and network analysis, there are various types of measures of the centrality of a vertex within a graph that determine the relative importance of a vertex within ...
Clustering coefficient
In graph theory, a clustering coefficient is a measure of degree to which nodes in a graph tend to cluster together.
In graph theory, a clustering coefficient is a measure of degree to which nodes in a graph tend to cluster together.
Complex network
In the context of network theory, a complex network is a graph with non-trivial topological features—features that do not occur in simple networks such as lattices or random graphs but oft...
In the context of network theory, a complex network is a graph with non-trivial topological features—features that do not occur in simple networks such as lattices or random graphs but oft...
Complex network zeta function
Here we describe the definition based on the complex network zeta function.
Here we describe the definition based on the complex network zeta function.
Consensus dynamics
Consensus dynamics or agreement dynamics is an area of research lying at the intersection of systems theory and graph theory.
Consensus dynamics or agreement dynamics is an area of research lying at the intersection of systems theory and graph theory.
Contraction hierarchies
In applied mathematics, the method of contraction hierarchies is a technique to simplify shortest-path routing by first creating precomputed "contracted" versions of the connection graph.
In applied mathematics, the method of contraction hierarchies is a technique to simplify shortest-path routing by first creating precomputed "contracted" versions of the connection graph.
Critical path method
The critical path method is an algorithm for scheduling a set of project activities.
The critical path method is an algorithm for scheduling a set of project activities.
Exponential random graph model
The exponential random graph model is a model in complex networks theory.
The exponential random graph model is a model in complex networks theory.
Exponential random graph models
Exponential random graph models (ERGMs) are a family of statistical models for analyzing data about social and other networks.
Exponential random graph models (ERGMs) are a family of statistical models for analyzing data about social and other networks.
Fitness model (network theory)
In complex network theory, the fitness model is a model of the evolution of a network: how the links between nodes change over time depends on the fitness of nodes.
In complex network theory, the fitness model is a model of the evolution of a network: how the links between nodes change over time depends on the fitness of nodes.
Gephi
Gephi is an open-source network analysis and visualization software package written in Java on the Netbeans platform.
Gephi is an open-source network analysis and visualization software package written in Java on the Netbeans platform.
Global shipping network
The Global shipping network is the worldwide network of maritime traffic.
The Global shipping network is the worldwide network of maritime traffic.
Linear scheduling method
Linear Scheduling Method (LSM) is a graphical scheduling method focusing on continuous resource utilization in repetitive activities.
Linear Scheduling Method (LSM) is a graphical scheduling method focusing on continuous resource utilization in repetitive activities.
Link Analysis
In network theory, link analysis is a data-analysis technique used to evaluate relationships between nodes.
In network theory, link analysis is a data-analysis technique used to evaluate relationships between nodes.
Link analysis
In network theory, link analysis is a data-analysis technique used to evaluate relationships between nodes.
In network theory, link analysis is a data-analysis technique used to evaluate relationships between nodes.
Liquid schedule
In networking and in graph theory, a liquid schedule is a method for scheduling the transfers of a traffic so as to attain the liquid throughput of the network.
In networking and in graph theory, a liquid schedule is a method for scheduling the transfers of a traffic so as to attain the liquid throughput of the network.
Longest path problem
In the mathematical discipline of graph theory, the longest path problem is the problem of finding a simple path of maximum length in a given graph.
In the mathematical discipline of graph theory, the longest path problem is the problem of finding a simple path of maximum length in a given graph.
Menger's theorem
In the mathematical discipline of graph theory and related areas, Menger's theorem is a basic result about connectivity in finite undirected graphs.
In the mathematical discipline of graph theory and related areas, Menger's theorem is a basic result about connectivity in finite undirected graphs.
Modularity (networks)
Modularity is a benefit function used in the analysis of networks or graphs such as computer networks or social networks.
Modularity is a benefit function used in the analysis of networks or graphs such as computer networks or social networks.
Network controllability
Network Controllability concerns the controllability a network.
Network Controllability concerns the controllability a network.
Network Description Language
Network Description Language (NDL) is a tool to reduce the complexity as networks evolve into the future.
Network Description Language (NDL) is a tool to reduce the complexity as networks evolve into the future.
Network science
Network science is an interdisciplinary academic field which studies complex networks such as engineered networks, information networks, biological networks, cognitive and semantic networks, and...
Network science is an interdisciplinary academic field which studies complex networks such as engineered networks, information networks, biological networks, cognitive and semantic networks, and...
Network Science CTA
The Network Science Collaborative Technology Alliance (NS CTA) is a collaborative research alliance funded by the US Army Research Laboratory (ARL) and focused on fundamental research on the cri...
The Network Science Collaborative Technology Alliance (NS CTA) is a collaborative research alliance funded by the US Army Research Laboratory (ARL) and focused on fundamental research on the cri...
Network theory
Network theory is an area of computer science and network science and part of graph theory.
Network theory is an area of computer science and network science and part of graph theory.
Network Theory in Risk Assessment
A network is an abstract structure capturing only the basics of connection patterns and little else.
A network is an abstract structure capturing only the basics of connection patterns and little else.
Program Evaluation and Review Technique
The Program (or Project) Evaluation and Review Technique, commonly abbreviated PERT, is a statistical tool, used in project management, that is designed to analyze and represen...
The Program (or Project) Evaluation and Review Technique, commonly abbreviated PERT, is a statistical tool, used in project management, that is designed to analyze and represen...
Sequence step algorithm
A sequence step algorithm (SQS-AL) is an algorithm implemented in a discrete event simulation system to maximize resource utilization.
A sequence step algorithm (SQS-AL) is an algorithm implemented in a discrete event simulation system to maximize resource utilization.
Shortest path problem
In graph theory, the shortest path problem is the problem of finding a path between two vertices in a graph such that the sum of the weights of its constituent edges is minimized.
In graph theory, the shortest path problem is the problem of finding a path between two vertices in a graph such that the sum of the weights of its constituent edges is minimized.
Small world routing
In network theory, small world routing refers to routing methods for small-world networks.
In network theory, small world routing refers to routing methods for small-world networks.
Social network
A social network is a social structure made up of a set of actors (such as individuals or organizations) and the dyadic ties between these actors.
A social network is a social structure made up of a set of actors (such as individuals or organizations) and the dyadic ties between these actors.
Surprise (networks)
Surprise is a measure of community structure in complex networks.
Surprise is a measure of community structure in complex networks.
Weighted network
A weighted network is a network where the ties among nodes have weights assigned to them.
A weighted network is a network where the ties among nodes have weights assigned to them.
Widest path problem
In graph algorithms, the widest path problem, also known as the bottleneck shortest path problem or the maximum capacity path problem, is the problem of finding a path between two de...
In graph algorithms, the widest path problem, also known as the bottleneck shortest path problem or the maximum capacity path problem, is the problem of finding a path between two de...