Fitness model (network theory)

Last updated

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. Fitter nodes attract more links at the expense of less fit nodes.

Contents

It has been used to model the network structure of the World Wide Web.

Description of the model

The model is based on the idea of fitness, an inherent competitive factor that nodes may have, capable of affecting the network's evolution. According to this idea, the nodes' intrinsic ability to attract links in the network varies from node to node, the most efficient (or "fit") being able to gather more edges in the expense of others. In that sense, not all nodes are identical to each other, and they claim their degree increase according to the fitness they possess every time. The fitness factors of all the nodes composing the network may form a distribution ρ(η) characteristic of the system been studied.

Ginestra Bianconi and Albert-László Barabási [1] proposed a new model called Bianconi-Barabási model, a variant to the Barabási-Albert model (BA model), where the probability for a node to connect to another one is supplied with a term expressing the fitness of the node involved. The fitness parameter is time-independent and is multiplicative to the probability.

Fitness model where fitnesses are not coupled to preferential attachment has been introduced by Caldarelli et al. [2] Here a link is created between two vertices with a probability given by a linking function of the fitnesses of the vertices involved. The degree of a vertex i is given by: [3]

If is an invertible and increasing function of , then the probability distribution is given by

As a result if the fitnesses are distributed as a power law, then also the node degree does.

Less intuitively with a fast decaying probability distribution as together with a linking function of the kind

with a constant and the Heavyside function, we also obtain scale-free networks.

Such model has been successfully applied to describe trade between nations by using GDP as fitness for the various nodes and a linking function of the kind; [4] [5]

Fitness model and the evolution of the Web

The fitness model has been used to model the network structure of the World Wide Web. In a PNAS article, [6] Kong et al. extended the fitness model to include random node deletion, a common phenomena in the Web. When the deletion rate of the web pages are accounted for, they found that the overall fitness distribution is exponential. Nonetheless, even this small variance in the fitness is amplified through the preferential attachment mechanism, leading to a heavy-tailed distribution of incoming links on the Web.

See also

Related Research Articles

<span class="mw-page-title-main">Scale-free network</span> Network whose degree distribution follows a power law

A scale-free network is a network whose degree distribution follows a power law, at least asymptotically. That is, the fraction P(k) of nodes in the network having k connections to other nodes goes for large values of k as

<span class="mw-page-title-main">Complex network</span> Network with non-trivial topological features

In the context of network theory, a complex network is a graph (network) with non-trivial topological features—features that do not occur in simple networks such as lattices or random graphs but often occur in networks representing real systems. The study of complex networks is a young and active area of scientific research inspired largely by empirical findings of real-world networks such as computer networks, biological networks, technological networks, brain networks, climate networks and social networks.

<span class="mw-page-title-main">Degree distribution</span>

In the study of graphs and networks, the degree of a node in a network is the number of connections it has to other nodes and the degree distribution is the probability distribution of these degrees over the whole network.

<span class="mw-page-title-main">Barabási–Albert model</span> Scale-free network generation algorithm

The Barabási–Albert (BA) model is an algorithm for generating random scale-free networks using a preferential attachment mechanism. Several natural and human-made systems, including the Internet, the World Wide Web, citation networks, and some social networks are thought to be approximately scale-free and certainly contain few nodes with unusually high degree as compared to the other nodes of the network. The BA model tries to explain the existence of such nodes in real networks. The algorithm is named for its inventors Albert-László Barabási and Réka Albert.

<span class="mw-page-title-main">Watts–Strogatz model</span> Method of generating random small-world graphs

The Watts–Strogatz model is a random graph generation model that produces graphs with small-world properties, including short average path lengths and high clustering. It was proposed by Duncan J. Watts and Steven Strogatz in their article published in 1998 in the Nature scientific journal. The model also became known as the (Watts) beta model after Watts used to formulate it in his popular science book Six Degrees.

In applied probability theory, the Simon model is a class of stochastic models that results in a power-law distribution function. It was proposed by Herbert A. Simon to account for the wide range of empirical distributions following a power-law. It models the dynamics of a system of elements with associated counters. In this model the dynamics of the system is based on constant growth via addition of new elements as well as incrementing the counters at a rate proportional to their current values.

<span class="mw-page-title-main">Reciprocity (network science)</span>

In network science, reciprocity is a measure of the likelihood of vertices in a directed network to be mutually linked. Like the clustering coefficient, scale-free degree distribution, or community structure, reciprocity is a quantitative measure used to study complex networks.

<span class="mw-page-title-main">Assortativity</span> Tendency for similar nodes to be connected

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.

<span class="mw-page-title-main">Random geometric graph</span> In graph theory, the mathematically simplest spatial network

In graph theory, a random geometric graph (RGG) is the mathematically simplest spatial network, namely an undirected graph constructed by randomly placing N nodes in some metric space and connecting two nodes by a link if and only if their distance is in a given range, e.g. smaller than a certain neighborhood radius, r.

<span class="mw-page-title-main">Network science</span> Academic field

Network science is an academic field which studies complex networks such as telecommunication networks, computer networks, biological networks, cognitive and semantic networks, and social networks, considering distinct elements or actors represented by nodes and the connections between the elements or actors as links. The field draws on theories and methods including graph theory from mathematics, statistical mechanics from physics, data mining and information visualization from computer science, inferential modeling from statistics, and social structure from sociology. The United States National Research Council defines network science as "the study of network representations of physical, biological, and social phenomena leading to predictive models of these phenomena."

<span class="mw-page-title-main">Evolving network</span>

Evolving networks are networks that change as a function of time. They are a natural extension of network science since almost all real world networks evolve over time, either by adding or removing nodes or links over time. Often all of these processes occur simultaneously, such as in social networks where people make and lose friends over time, thereby creating and destroying edges, and some people become part of new social networks or leave their networks, changing the nodes in the network. Evolving network concepts build on established network theory and are now being introduced into studying networks in many diverse fields.

<span class="mw-page-title-main">Hierarchical network model</span>

Hierarchical network models are iterative algorithms for creating networks which are able to reproduce the unique properties of the scale-free topology and the high clustering of the nodes at the same time. These characteristics are widely observed in nature, from biology to language to some social networks.

<span class="mw-page-title-main">Hyperbolic geometric graph</span>

A hyperbolic geometric graph (HGG) or hyperbolic geometric network (HGN) is a special type of spatial network where (1) latent coordinates of nodes are sprinkled according to a probability density function into a hyperbolic space of constant negative curvature and (2) an edge between two nodes is present if they are close according to a function of the metric (typically either a Heaviside step function resulting in deterministic connections between vertices closer than a certain threshold distance, or a decaying function of hyperbolic distance yielding the connection probability). A HGG generalizes a random geometric graph (RGG) whose embedding space is Euclidean.

Robustness, the ability to withstand failures and perturbations, is a critical attribute of many complex systems including complex networks.

<span class="mw-page-title-main">Bianconi–Barabási model</span>

The Bianconi–Barabási model is a model in network science that explains the growth of complex evolving networks. This model can explain that nodes with different characteristics acquire links at different rates. It predicts that a node's growth depends on its fitness and can calculate the degree distribution. The Bianconi–Barabási model is named after its inventors Ginestra Bianconi and Albert-László Barabási. This model is a variant of the Barabási–Albert model. The model can be mapped to a Bose gas and this mapping can predict a topological phase transition between a "rich-get-richer" phase and a "winner-takes-all" phase.

In a scale-free network the degree distribution follows a power law function. In some empirical examples this power-law fits the degree distribution well only in the high degree region, however for small degree nodes the empirical degree-distribution deviates from it. See for example the network of scientific citations. This deviation of the observed degree-distribution from the theoretical prediction at the low-degree region is often referred as low-degree saturation.

The initial attractiveness is a possible extension of the Barabási–Albert model. The Barabási–Albert model generates scale-free networks where the degree distribution can be described by a pure power law. However, the degree distribution of most real life networks cannot be described by a power law solely. The most common discrepancies regarding the degree distribution found in real networks are the high degree cut-off and the low degree cut-off. The inclusion of initial attractiveness in the Barabási–Albert model addresses the low-degree cut-off phenomenon.

Maximal entropy random walk (MERW) is a popular type of biased random walk on a graph, in which transition probabilities are chosen accordingly to the principle of maximum entropy, which says that the probability distribution which best represents the current state of knowledge is the one with largest entropy. While standard random walk chooses for every vertex uniform probability distribution among its outgoing edges, locally maximizing entropy rate, MERW maximizes it globally by assuming uniform probability distribution among all paths in a given graph.

A set of networks that satisfies given structural characteristics can be treated as a network ensemble. Brought up by Ginestra Bianconi in 2007, the entropy of a network ensemble measures the level of the order or uncertainty of a network ensemble.

In network science, the network entropy is a disorder measure derived from information theory to describe the level of randomness and the amount of information encoded in a graph. It is a relevant metric to quantitatively characterize real complex networks and can also be used to quantify network complexity

References

  1. Bianconi G, Barabási AL (May 2001). "Competition and multiscaling in evolving networks" (PDF). Europhysics Letters. 54 (4): 436–442. arXiv: cond-mat/0011029 . Bibcode:2001EL.....54..436B. doi:10.1209/epl/i2001-00260-6. Archived (PDF) from the original on 2017-08-09. Retrieved 2019-12-10.
  2. Caldarelli G, Capocci A, De Los Rios P, Muñoz MA (December 2002). "Scale-free networks from varying vertex intrinsic fitness" (PDF). Physical Review Letters. 89 (25): 258702. Bibcode:2002PhRvL..89y8702C. doi:10.1103/PhysRevLett.89.258702. PMID   12484927. Archived (PDF) from the original on 2023-02-04. Retrieved 2019-12-10.
  3. Servedio VD, Caldarelli G, Buttà P (November 2004). "Vertex intrinsic fitness: how to produce arbitrary scale-free networks". Physical Review E. 70 (5 Pt 2): 056126. arXiv: cond-mat/0309659 . Bibcode:2004PhRvE..70e6126S. doi:10.1103/PhysRevE.70.056126. PMID   15600711. S2CID   14349707.
  4. Garlaschelli D, Loffredo MI (October 2004). "Fitness-dependent topological properties of the world trade web". Physical Review Letters. 93 (18): 188701. arXiv: cond-mat/0403051 . Bibcode:2004PhRvL..93r8701G. doi:10.1103/PhysRevLett.93.188701. PMID   15525215. S2CID   16367275.
  5. Cimini G, Squartini T, Garlaschelli D, Gabrielli A (October 2015). "Systemic Risk Analysis on Reconstructed Economic and Financial Networks". Scientific Reports. 5: 15758. arXiv: 1411.7613 . Bibcode:2015NatSR...515758C. doi:10.1038/srep15758. PMC   4623768 . PMID   26507849.
  6. Kong JS, Sarshar N, Roychowdhury VP (September 2008). "Experience versus talent shapes the structure of the Web". Proceedings of the National Academy of Sciences of the United States of America. 105 (37): 13724–9. doi: 10.1073/pnas.0805921105 . PMC   2544521 . PMID   18779560.