Abstract
AbstractIn the last 20 years network science has become an independent scientific field. We argue that by building network models network scientists are able to tame the vagueness of propositions about complex systems and networks, that is, to make these propositions precise. This makes it possible to study important vague properties such as modularity, near-decomposability, scale-freeness or being a small world. Using an epistemic model of network science, we systematically analyse the specific nature of network models and the logic behind the taming mechanism.
Publisher
Springer Science and Business Media LLC
Subject
General Social Sciences,Philosophy
Reference64 articles.
1. Albert, R., Jeong, H., & Barabási, A.-L. (2000). Error and attack tolerance of complex networks. Nature, 406, 378–382.
2. Barabási, A.-L., & Albert, R. (1999). Emergence of scaling in random networks. Science, 286, 509–512.
3. Barabási, A.-L. (2002). Linked: The new science of networks. New York: Perseus Books Group.
4. Barabási, A.-L.(2016). Network Science. Cambridge University Press.
5. Benjamini, I., Kozma, G., & Wormald, N. (2014). The mixing time of the giant component of a random graph. Random Structures Algorithms, 45(3), 383–407.