pith. sign in

arxiv: cond-mat/0107419 · v3 · submitted 2001-07-19 · ❄️ cond-mat.stat-mech · cond-mat.soft

Deterministic Scale-Free Networks

classification ❄️ cond-mat.stat-mech cond-mat.soft
keywords networksscale-freedeterministicmodelabundantappearcellchemical
0
0 comments X
read the original abstract

Scale-free networks are abundant in nature and society, describing such diverse systems as the world wide web, the web of human sexual contacts, or the chemical network of a cell. All models used to generate a scale-free topology are stochastic, that is they create networks in which the nodes appear to be randomly connected to each other. Here we propose a simple model that generates scale-free networks in a deterministic fashion. We solve exactly the model, showing that the tail of the degree distribution follows a power law.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.