Faster access than browser!
63 relations: Albert-László Barabási, Alireza Mashaghi, Asymptote, Autonomous system (Internet), Barabási–Albert model, Béla Bollobás, Bianconi–Barabási model, Bose–Einstein condensation (network theory), Clustering coefficient, Complete graph, Complex network, Computer network, Connectedness, Data link layer, Degree (graph theory), Degree distribution, Derek J. de Solla Price, Dunbar's number, Erdős number, Erdős–Rényi model, Fault tolerance, Fitness model (network theory), Heavy-tailed distribution, Hierarchical network model, Internet, José Fernando Ferreira Mendes, Lattice graph, Mediation-driven attachment model, Network layer, Network security, Network theory, Node (networking), Non-linear preferential attachment, Normal distribution, Pareto distribution, Paul Erdős, Percolation theory, Power law, Preferential attachment, Probability density function, Protein–protein interaction, Random graph, Scale invariance, Scale-free ideal gas, Scale-free network, Science (journal), Self-similarity, Semantic network, Shlomo Havlin, Sidney Redner, ..., Six Degrees of Kevin Bacon, Six degrees of separation, Small-world experiment, Small-world network, Social network, Spatial network, The rich get richer and the poor get poorer, Traceroute, University of Notre Dame, Von Neumann universe, Webgraph, Weighted planar stochastic lattice, World Wide Web. Expand index (13 more) »
Albert-László Barabási
Albert-László Barabási (born March 30, 1967) is a Romanian-born Hungarian-American physicist, best known for his work in the research of network theory.
New!!: Scale-free network and Albert-László Barabási · See more »
Alireza Mashaghi
Alireza Mashaghi is a biophysicist and medical scientist at Leiden University and Harvard Medical School.
New!!: Scale-free network and Alireza Mashaghi · See more »
Asymptote
In analytic geometry, an asymptote of a curve is a line such that the distance between the curve and the line approaches zero as one or both of the x or y coordinates tends to infinity.
New!!: Scale-free network and Asymptote · See more »
Autonomous system (Internet)
Within the Internet, an autonomous system (AS) is a collection of connected Internet Protocol (IP) routing prefixes under the control of one or more network operators on behalf of a single administrative entity or domain that presents a common, clearly defined routing policy to the Internet.
New!!: Scale-free network and Autonomous system (Internet) · See more »
Barabási–Albert model
The Barabási–Albert (BA) model is an algorithm for generating random scale-free networks using a preferential attachment mechanism.
New!!: Scale-free network and Barabási–Albert model · See more »
Béla Bollobás
Béla Bollobás FRS (born 3 August 1943) is a Hungarian-born British mathematician who has worked in various areas of mathematics, including functional analysis, combinatorics, graph theory, and percolation.
New!!: Scale-free network and Béla Bollobás · See more »
Bianconi–Barabási model
The Bianconi–Barabási model is a model in network science that explains the growth of complex evolving networks.
New!!: Scale-free network and Bianconi–Barabási model · See more »
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 physics.
New!!: Scale-free network and Bose–Einstein condensation (network theory) · See more »
Clustering coefficient
In graph theory, a clustering coefficient is a measure of the degree to which nodes in a graph tend to cluster together.
New!!: Scale-free network and Clustering coefficient · See more »
Complete graph
No description.
New!!: Scale-free network and Complete graph · See more »
Complex network
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 graphs modelling of real systems.
New!!: Scale-free network and Complex network · See more »
Computer network
A computer network, or data network, is a digital telecommunications network which allows nodes to share resources.
New!!: Scale-free network and Computer network · See more »
Connectedness
In mathematics, connectedness is used to refer to various properties meaning, in some sense, "all one piece".
New!!: Scale-free network and Connectedness · See more »
Data link layer
The data link layer, or layer 2, is the second layer of the seven-layer OSI model of computer networking.
New!!: Scale-free network and Data link layer · See more »
Degree (graph theory)
In graph theory, the degree (or valency) of a vertex of a graph is the number of edges incident to the vertex, with loops counted twice.
New!!: Scale-free network and Degree (graph theory) · See more »
Degree distribution
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.
New!!: Scale-free network and Degree distribution · See more »
Derek J. de Solla Price
Derek John de Solla Price (22 January 1922 – 3 September 1983) was a physicist, historian of science, and information scientist, credited as the father of scientometrics.
New!!: Scale-free network and Derek J. de Solla Price · See more »
Dunbar's number
Dunbar's number is a suggested cognitive limit to the number of people with whom one can maintain stable social relationships—relationships in which an individual knows who each person is and how each person relates to every other person.
New!!: Scale-free network and Dunbar's number · See more »
Erdős number
The Erdős number describes the "collaborative distance" between mathematician and another person, as measured by authorship of mathematical papers.
New!!: Scale-free network and Erdős number · See more »
Erdős–Rényi model
In the mathematical field of graph theory, the Erdős–Rényi model is either of two closely related models for generating random graphs.
New!!: Scale-free network and Erdős–Rényi model · See more »
Fault tolerance
Fault tolerance is the property that enables a system to continue operating properly in the event of the failure (or one or more faults within) some of its components.
New!!: Scale-free network and Fault tolerance · See more »
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.
New!!: Scale-free network and Fitness model (network theory) · See more »
Heavy-tailed distribution
In probability theory, heavy-tailed distributions are probability distributions whose tails are not exponentially bounded: that is, they have heavier tails than the exponential distribution.
New!!: Scale-free network and Heavy-tailed distribution · See more »
Hierarchical network model
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.
New!!: Scale-free network and Hierarchical network model · See more »
Internet
The Internet is the global system of interconnected computer networks that use the Internet protocol suite (TCP/IP) to link devices worldwide.
New!!: Scale-free network and Internet · See more »
José Fernando Ferreira Mendes
José F.F. Mendes (born in Porto on June 22, 1962) is a Portuguese physicist (statistical physics) and professor of physics, best known for his work and contributions to the field of network theory.
New!!: Scale-free network and José Fernando Ferreira Mendes · See more »
Lattice graph
A lattice graph, mesh graph, or grid graph, is a graph whose drawing, embedded in some Euclidean space Rn, forms a regular tiling.
New!!: Scale-free network and Lattice graph · See more »
Mediation-driven attachment model
In the scale-free network theory (mathematical theory of networks or graph theory), a mediation-driven attachment (MDA) model appears to embody a preferential attachment rule tacitly rather than explicitly.
New!!: Scale-free network and Mediation-driven attachment model · See more »
Network layer
In the seven-layer OSI model of computer networking, the network layer is layer 3.
New!!: Scale-free network and Network layer · See more »
Network security
Network security consists of the policies and practices adopted to prevent and monitor unauthorized access, misuse, modification, or denial of a computer network and network-accessible resources.
New!!: Scale-free network and Network security · See more »
Network theory
Network theory is the study of graphs as a representation of either symmetric relations or asymmetric relations between discrete objects.
New!!: Scale-free network and Network theory · See more »
Node (networking)
In telecommunications networks, a node (Latin nodus, ‘knot’) is either a redistribution point or a communication endpoint.
New!!: Scale-free network and Node (networking) · See more »
Non-linear preferential attachment
In network science, preferential attachment means that nodes of a network tend to connect to those nodes which have more links.
New!!: Scale-free network and Non-linear preferential attachment · See more »
Normal distribution
In probability theory, the normal (or Gaussian or Gauss or Laplace–Gauss) distribution is a very common continuous probability distribution.
New!!: Scale-free network and Normal distribution · See more »
Pareto distribution
No description.
New!!: Scale-free network and Pareto distribution · See more »
Paul Erdős
Paul Erdős (Erdős Pál; 26 March 1913 – 20 September 1996) was a Hungarian mathematician.
New!!: Scale-free network and Paul Erdős · See more »
Percolation theory
In statistical physics and mathematics, percolation theory describes the behaviour of connected clusters in a random graph.
New!!: Scale-free network and Percolation theory · See more »
Power law
In statistics, a power law is a functional relationship between two quantities, where a relative change in one quantity results in a proportional relative change in the other quantity, independent of the initial size of those quantities: one quantity varies as a power of another.
New!!: Scale-free network and Power law · See more »
Preferential attachment
A preferential attachment process is any of a class of processes in which some quantity, typically some form of wealth or credit, is distributed among a number of individuals or objects according to how much they already have, so that those who are already wealthy receive more than those who are not.
New!!: Scale-free network and Preferential attachment · See more »
Probability density function
In probability theory, a probability density function (PDF), or density of a continuous random variable, is a function, whose value at any given sample (or point) in the sample space (the set of possible values taken by the random variable) can be interpreted as providing a relative likelihood that the value of the random variable would equal that sample.
New!!: Scale-free network and Probability density function · See more »
Protein–protein interaction
Protein–protein interactions (PPIs) are the physical contacts of high specificity established between two or more protein molecules as a result of biochemical events steered by electrostatic forces including the hydrophobic effect.
New!!: Scale-free network and Protein–protein interaction · See more »
Random graph
In mathematics, random graph is the general term to refer to probability distributions over graphs.
New!!: Scale-free network and Random graph · See more »
Scale invariance
In physics, mathematics, statistics, and economics, scale invariance is a feature of objects or laws that do not change if scales of length, energy, or other variables, are multiplied by a common factor, thus represent a universality.
New!!: Scale-free network and Scale invariance · See more »
Scale-free ideal gas
The scale-free ideal gas (SFIG) is a physical model assuming a collection of non-interacting elements with an stochastic proportional growth.
New!!: Scale-free network and Scale-free ideal gas · See more »
Scale-free network
A scale-free network is a network whose degree distribution follows a power law, at least asymptotically.
New!!: Scale-free network and Scale-free network · See more »
Science (journal)
Science, also widely referred to as Science Magazine, is the peer-reviewed academic journal of the American Association for the Advancement of Science (AAAS) and one of the world's top academic journals.
New!!: Scale-free network and Science (journal) · See more »
Self-similarity
In mathematics, a self-similar object is exactly or approximately similar to a part of itself (i.e. the whole has the same shape as one or more of the parts).
New!!: Scale-free network and Self-similarity · See more »
Semantic network
A semantic network, or frame network is a knowledge base that represents semantic relations between concepts in a network.
New!!: Scale-free network and Semantic network · See more »
Shlomo Havlin
Shlomo Havlin (born July 21, 1942) is a Professor in the Department of Physics at Bar-Ilan University, Ramat-Gan, Israel.
New!!: Scale-free network and Shlomo Havlin · See more »
Sidney Redner
Sidney Redner (born 1951) is a Canadian-born physicist, professor, and a resident faculty member at the Santa Fe Institute.
New!!: Scale-free network and Sidney Redner · See more »
Six Degrees of Kevin Bacon
Six Degrees of Kevin Bacon is a parlor game based on the "six degrees of separation" concept, which posits that any two people on Earth are six or fewer acquaintance links apart.
New!!: Scale-free network and Six Degrees of Kevin Bacon · See more »
Six degrees of separation
Six degrees of separation is the idea that all living things and everything else in the world are Six or fewer steps away from each other so that a chain of "a friend of a friend" statements can be made to connect any two people in a maximum of Six steps.
New!!: Scale-free network and Six degrees of separation · See more »
Small-world experiment
The small-world experiment comprised several experiments conducted by Stanley Milgram and other researchers examining the average path length for social networks of people in the United States.
New!!: Scale-free network and Small-world experiment · See more »
Small-world network
A small-world network is a type of mathematical graph in which most nodes are not neighbors of one another, but the neighbors of any given node are likely to be neighbors of each other and most nodes can be reached from every other node by a small number of hops or steps.
New!!: Scale-free network and Small-world network · See more »
Social network
A social network is a social structure made up of a set of social actors (such as individuals or organizations), sets of dyadic ties, and other social interactions between actors.
New!!: Scale-free network and Social network · See more »
Spatial network
A spatial network (sometimes also geometric graph) is a graph in which the vertices or edges are spatial elements associated with geometric objects, i.e. the nodes are located in a space equipped with a certain metric.
New!!: Scale-free network and Spatial network · See more »
The rich get richer and the poor get poorer
"The rich get richer and the poor get poorer" is a catchphrase and aphorism sometimes evoked, with variations in wording, when discussing economic inequality.
New!!: Scale-free network and The rich get richer and the poor get poorer · See more »
Traceroute
In computing, traceroute is a computer network diagnostic tool for displaying the route (path) and measuring transit delays of packets across an Internet Protocol (IP) network.
New!!: Scale-free network and Traceroute · See more »
University of Notre Dame
The University of Notre Dame du Lac (or simply Notre Dame or ND) is a private, non-profit Catholic research university in the community of Notre Dame, Indiana, near the city of South Bend, in the United States.
New!!: Scale-free network and University of Notre Dame · See more »
Von Neumann universe
In set theory and related branches of mathematics, the von Neumann universe, or von Neumann hierarchy of sets, denoted V, is the class of hereditary well-founded sets.
New!!: Scale-free network and Von Neumann universe · See more »
Webgraph
The webgraph describes the directed links between pages of the World Wide Web.
New!!: Scale-free network and Webgraph · See more »
Weighted planar stochastic lattice
Starting with a square, say of unit area, and dividing randomly at each step only one block, after picking it preferentially with respect to ares, into four smaller blocks creates weighted planar stochastic lattice (WPSL).
New!!: Scale-free network and Weighted planar stochastic lattice · See more »
World Wide Web
The World Wide Web (abbreviated WWW or the Web) is an information space where documents and other web resources are identified by Uniform Resource Locators (URLs), interlinked by hypertext links, and accessible via the Internet.
New!!: Scale-free network and World Wide Web · See more »
Redirects here:
Generalized Scale-Free Models, Generalized scale-free model, Scale free graph, Scale free network, Scale-Free Ideal Network, Scale-Free Ideal Network (SFIN), Scale-Free Network, Scale-Free Networks, Scale-free graph, Scale-free ideal network, Scale-free networks.
References
[1] https://en.wikipedia.org/wiki/Scale-free_network
