Albert-László Barabási
Robert Gray Dodge Professor of Network Science at Northeastern University; discovered scale-free networks and, with Reka Albert, proposed the Barabasi-Albert model.
Albert-László Barabási did not write this page. What is this?
It collects the places they publish and what they have said there, each linked to the source. They have no account here. Is this you? Claim it, correct it, or ask us to remove it from ppll.
Where they publish
Beliefs
Korrents What they believe 4 beliefs — each backed by an exact quote.
Each is a — compiled by korrents.com, not by them: the one-line wordings are korrents', the quotes are theirs.
Recent
Systems as different as a genome and the web are best described as networks with complex topology rather than as ordered or random structures.
Systems as diverse as genetic networks or the world wide web are best described as networks with complex topology.
Barabasi & Albert, "Emergence of scaling in random networks" (arXiv) Said 21 Oct 1999
Large real-world networks share one property: the number of connections per node follows a scale-free power law.
A common property of many large networks is that the vertex connectivities follow a scale-free power-law distribution.
Barabasi & Albert, "Emergence of scaling in random networks" (arXiv) Said 21 Oct 1999
Scale-free structure follows from just two mechanisms: networks keep adding nodes, and new nodes attach preferentially to well-connected ones.
This feature is found to be a consequence of the two generic mechanisms that networks expand continuously by the addition of new vertices, and new vertices attach preferentially to already well connected sites.
Barabasi & Albert, "Emergence of scaling in random networks" (arXiv) Said 21 Oct 1999
Show 1 more
Because two generic mechanisms reproduce the observed distributions, large networks are governed by self-organizing rules that do not depend on what the network is made of.
A model based on these two ingredients reproduces the observed stationary scale-free distributions, indicating that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
Barabasi & Albert, "Emergence of scaling in random networks" (arXiv) Said 21 Oct 1999
Beliefs others hold too
Systems as different as a genome and the web are best described as networks with complex topology rather than as ordered or random structures. 2 hold this
Systems as diverse as genetic networks or the world wide web are best described as networks with complex topology.
Barabasi & Albert, "Emergence of scaling in random networks" (arXiv) Said 21 Oct 1999
Large real-world networks share one property: the number of connections per node follows a scale-free power law. 2 hold this
A common property of many large networks is that the vertex connectivities follow a scale-free power-law distribution.
Barabasi & Albert, "Emergence of scaling in random networks" (arXiv) Said 21 Oct 1999
Scale-free structure follows from just two mechanisms: networks keep adding nodes, and new nodes attach preferentially to well-connected ones. 2 hold this
This feature is found to be a consequence of the two generic mechanisms that networks expand continuously by the addition of new vertices, and new vertices attach preferentially to already well connected sites.
Barabasi & Albert, "Emergence of scaling in random networks" (arXiv) Said 21 Oct 1999
What is a korrent?
A korrent is a belief a person has stated in their own words: one sentence stating the claim, backed by a quote and a source, kept at korrents.com.
Under a name here, the quoted block is what they actually said. The korrent beneath it is the claim those words support, in korrents' wording — tap it to see the record, its source, and who else holds it.
Nobody here wrote their own korrents. They are compiled from public statements, and a person can change their mind, which is recorded too.