Related Research Articles
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
Self-organized criticality (SOC) is a property of dynamical systems that have a critical point as an attractor. Their macroscopic behavior thus displays the spatial or temporal scale-invariance characteristic of the critical point of a phase transition, but without the need to tune control parameters to a precise value, because the system, effectively, tunes itself as it evolves towards criticality.
A small-world network is a graph characterized by a high clustering coefficient and low distances. On an example of social network, high clustering implies the high probability that two friends of one person are friends themselves. The low distances, on the other hand, mean that there is a short chain of social connections between any two people. Specifically, a small-world network is defined to be a network where the typical distance L between two randomly chosen nodes grows proportionally to the logarithm of the number of nodes N in the network, that is:
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.
In physics, the Tsallis entropy is a generalization of the standard Boltzmann–Gibbs entropy. It is proportional to the expectation of the q-logarithm of a distirbution.
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.
In the study of complex networks, a network is said to have community structure if the nodes of the network can be easily grouped into sets of nodes such that each set of nodes is densely connected internally. In the particular case of non-overlapping community finding, this implies that the network divides naturally into groups of nodes with dense connections internally and sparser connections between groups. But overlapping communities are also allowed. The more general definition is based on the principle that pairs of nodes are more likely to be connected if they are both members of the same community(ies), and less likely to be connected if they do not share communities. A related but different problem is community search, where the goal is to find a community that a certain vertex belongs to.
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.
Mixing patterns refer to systematic tendencies of one type of nodes in a network to connect to another type. For instance, nodes might tend to link to others that are very similar or very different. This feature is common in many social networks, although it also appears sometimes in non-social networks. Mixing patterns are closely related to assortativity; however, for the purposes of this article, the term is used to refer to assortative or disassortative mixing based on real-world factors, either topological or sociological.
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.
The percolation threshold is a mathematical concept in percolation theory that describes the formation of long-range connectivity in random systems. Below the threshold a giant connected component does not exist; while above it, there exists a giant component of the order of system size. In engineering and coffee making, percolation represents the flow of fluids through porous media, but in the mathematics and physics worlds it generally refers to simplified lattice models of random systems or networks (graphs), and the nature of the connectivity in them. The percolation threshold is the critical value of the occupation probability p, or more generally a critical surface for a group of parameters p1, p2, ..., such that infinite connectivity (percolation) first occurs.
Mark Newman is an English–American physicist and Anatol Rapoport Distinguished University Professor of Physics at the University of Michigan, as well as an external faculty member of the Santa Fe Institute. He is known for his fundamental contributions to the fields of complex networks and complex systems, for which he was awarded the 2014 Lagrange Prize.
The clique percolation method is a popular approach for analyzing the overlapping community structure of networks. The term network community has no widely accepted unique definition and it is usually defined as a group of nodes that are more densely connected to each other than to other nodes in the network. There are numerous alternative methods for detecting communities in networks, for example, the Girvan–Newman algorithm, hierarchical clustering and modularity maximization.
Dante R. Chialvo is a professor at Universidad Nacional de San Martin. Together with Per Bak, they put forward concrete models considering the brain as a critical system. Initial contributions focussed on mathematical ideas of how learning could benefit from criticality. Further work provided experimental evidence for this conjecture both at large and small scale. He was named Fulbright Scholar in 2005 and elected as a Fellow of the American Physical Society in 2007 and as Member of the Academia de Ciencias de America Latina in 2022.
Maya Paczuski is the head and founder of the Complexity Science Group at the University of Calgary. She is a well-cited physicist whose work spans self-organized criticality, avalanche dynamics, earthquake, and complex networks. She was born in Israel in 1963, but grew up in the United States. Maya Paczuski received a B.S. and M.S. in Electrical Engineering and Computer Science from M.I.T. in 1986 and then went on to study with Mehran Kardar, earning her Ph.D in Condensed matter physics from the same institute.
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.
Phase separation is the creation of two distinct phases from a single homogeneous mixture. The most common type of phase separation is between two immiscible liquids, such as oil and water. This type of phase separation is known as liquid-liquid equilibrium. Colloids are formed by phase separation, though not all phase separations forms colloids - for example oil and water can form separated layers under gravity rather than remaining as microscopic droplets in suspension.
Antonio Helio de Castro Neto is a Brazilian-born physicist. He is the founder and director of the Centre for Advanced 2D Materials at the National University of Singapore. He is a condensed matter theorist known for his work in the theory of metals, magnets, superconductors, graphene and two-dimensional materials. He is a distinguished professor in the Departments of Materials Science Engineering, and Physics and a professor at the Department of Electrical and Computer Engineering. He was elected as a fellow of the American Physical Society in 2003. In 2011 he was elected as a fellow of the American Association for the Advancement of Science.
Christopher John Pethick is a British theoretical physicist, specializing in many-body theory, ultra-cold atomic gases, and the physics of neutron stars and stellar collapse.
Dov I. Levine is an American-Israeli physicist, known for his research on quasicrystals, soft condensed matter physics, and statistical mechanics out of equilibrium.
References
- ↑ M. E. J. Newman (2003). "Mixing patterns in networks". Physical Review E. 67 (2): 026126. arXiv: cond-mat/0209450 . Bibcode:2003PhRvE..67b6126N. doi:10.1103/PhysRevE.67.026126. PMID 12636767. S2CID 15186389.
- ↑ M. McPherson; L. Smith-Lovin & J. M. Cook (2001). "Birds of a feather: Homophily in social networks". Annual Review of Sociology. 27: 415–444. doi:10.1146/annurev.soc.27.1.415. S2CID 2341021.
- ↑ S. Maslov & K. Sneppen (2002). "Specificity and stability in topology of protein networks". Science. 296 (5569): 910–913. arXiv: cond-mat/0205380 . Bibcode:2002Sci...296..910M. doi:10.1126/science.1065103. PMID 11988575. S2CID 2096348.
- ↑ R. Pastor-Satorras; A. Vázquez & A. Vespignani (2001). "Dynamical and correlation properties of the Internet". Physical Review Letters. 87 (25): 258701. arXiv: cond-mat/0105161 . Bibcode:2001PhRvL..87y8701P. doi:10.1103/PhysRevLett.87.258701. PMID 11736611. S2CID 6232586.
- ↑ von Csefalvay, Chris (2023), "Simple compartmental models" , Computational Modeling of Infectious Disease, Elsevier, pp. 19–91, doi:10.1016/b978-0-32-395389-4.00011-6, ISBN 978-0-323-95389-4 , retrieved 2023-03-03
- ↑ M. E. J. Newman (2002). "Assortative mixing in networks". Physical Review Letters. 89 (20): 208701. arXiv: cond-mat/0205405 . Bibcode:2002PhRvL..89t8701N. doi:10.1103/PhysRevLett.89.208701. PMID 12443515. S2CID 1574486.
- ↑ S. Johnson; J.J. Torres; J. Marro & M.A. Muñoz (2010). "Entropic origin of disassortativity in complex networks". Physical Review Letters. 104 (10): 108702. arXiv: 1002.3286 . Bibcode:2010PhRvL.104j8702J. doi:10.1103/PhysRevLett.104.108702. PMID 20366458. S2CID 32880913.
- ↑ G. Bagler & S. Sinha (2007). "Assortative mixing in protein contact networks and protein folding kinetics". Bioinformatics. 23 (14): 1760–7. arXiv: 0711.2723 . doi:10.1093/bioinformatics/btm257. PMID 17519248.
- ↑ A. V. Goltsev; S. N. Dorogovtsev & J.F.F. Mendes (2008). "Percolation on correlated networks". Physical Review E. 78 (5): 051105. arXiv: 0810.1742 . Bibcode:2008PhRvE..78e1105G. doi:10.1103/PhysRevE.78.051105. PMID 19113093. S2CID 76949.
 | This graph theory-related article is a stub. You can help Wikipedia by expanding it. |
 | This sociology-related article is a stub. You can help Wikipedia by expanding it. |