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 ...
Research Assistant
AI chat, annotations, notes & similar papers
No comments yet
Be the first to share your thoughts!