Concepts inCoordinated consensus in dynamic networks
Dynamic network analysis
Dynamic network analysis (DNA) is an emergent scientific field that brings together traditional social network analysis (SNA), link analysis (LA) and multi-agent systems (MAS) within network science and network theory. There are two aspects of this field. The first is the statistical analysis of DNA data. The second is the utilization of simulation to address issues of network dynamics.
more from Wikipedia
Consensus decision-making
Consensus decision-making is a group decision making process that seeks the consent, not necessarily the agreement of participants and the resolution of objections. Consensus is defined by Merriam-Webster as, first, general agreement, and second, group solidarity of belief or sentiment. It has its origin in a Latin word meaning literally feel together. It is used to describe both the decision and the process of reaching a decision.
more from Wikipedia
Distance (graph theory)
In the mathematical field of graph theory, the distance between two vertices in a graph is the number of edges in a shortest path connecting them. This is also known as the geodesic distance because it is the length of the graph geodesic between those two vertices. If there is no path connecting the two vertices, i.e. , if they belong to different connected components, then conventionally the distance is defined as infinite.
more from Wikipedia
Consensus (computer science)
A fundamental problem in distributed computing is to achieve overall system reliability in the presence of a number of faulty processes. This often requires processes to agree on some data value that is needed during computation. Examples of applications of consensus include whether to commit a transaction to a database, agreeing on the identity of a leader, state machine replication, and atomic broadcasts.
more from Wikipedia
Network topology
Network topology is the layout pattern of interconnections of the various elements of a computer or biological network. Network topologies may be physical or logical. Physical topology refers to the physical design of a network including the devices, location and cable installation. Logical topology refers to how data is actually transferred in a network as opposed to its physical design. In general physical topology relates to a core network whereas logical topology relates to basic network.
more from Wikipedia
Upper and lower bounds
In mathematics, especially in order theory, an upper bound of a subset S of some partially ordered set (P, ¿) is an element of P which is greater than or equal to every element of S. The term lower bound is defined dually as an element of P which is less than or equal to every element of S. A set with an upper bound is said to be bounded from above by that bound, a set with a lower bound is said to be bounded from below by that bound.
more from Wikipedia
Maxima and minima
In mathematics, the maximum and minimum of a function, known collectively as extrema, are the largest and smallest value that the function takes at a point either within a given neighborhood (local or relative extremum) or on the function domain in its entirety (global or absolute extremum). More generally, the maximum and minimum of a set (as defined in set theory) are the greatest and least element in the set.
more from Wikipedia
Graph (mathematics)
In mathematics, a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected objects are represented by mathematical abstractions called vertices, and the links that connect some pairs of vertices are called edges. Typically, a graph is depicted in diagrammatic form as a set of dots for the vertices, joined by lines or curves for the edges. Graphs are one of the objects of study in discrete mathematics.
more from Wikipedia