@article{Dorogovtsev2002PseudofractalSW,
title={Pseudofractal scale-free web.},
author={Sergey N. Dorogovtsev and Alexander V. Goltsev and Jose F. F. Mendes},
journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
year={2002},
volume={65 6 Pt 2},
pages={066122}
}

We find that scale-free random networks are excellently modeled by simple deterministic graphs. Our graph has a discrete degree distribution (degree is the number of connections of a vertex), which is characterized by a power law with exponent gamma=1+ln 3/ln 2. Properties of this compact structure are surprisingly close to those of growing random scale-free networks with gamma in the most interesting region, between 2 and 3. We succeed to find exactly and numerically with high precision all… CONTINUE READING