A Geometric Preferential Attachment Model of Networks II
From MaRDI portal
Publication:5458299
DOI10.1007/978-3-540-77004-6_4zbMath1137.68014OpenAlexW4252484501MaRDI QIDQ5458299
Abraham D. Flaxman, Juan Carlos Vera, Alan M. Frieze
Publication date: 11 April 2008
Published in: Algorithms and Models for the Web-Graph (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.im/1243430569
Random graphs (graph-theoretic aspects) (05C80) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items
The Small Community Phenomenon in Networks: Models, Algorithms and Applications, On the mixing time of geographical threshold graphs, A Spatial Web Graph Model with Local Influence Regions, SIR epidemics on a scale-free spatial nested modular network, The age-dependent random connection model, Spatial preferential attachment networks: power laws and clustering coefficients
Cites Work
- Eigenvalues of random power law graphs
- Popularity based random graph models leading to a scale-free degree sequence
- The diameter of a scale-free random graph
- On certain connectivity properties of the internet topology
- The degree sequence of a scale-free random graph process
- Emergence of Scaling in Random Networks
- A random graph model for massive graphs
- ON A CLASS OF SKEW DISTRIBUTION FUNCTIONS
- Random Geometric Graphs
- Coupling Scale-Free and Classical Random Graphs
- A Brief History of Generative Models for Power Law and Lognormal Distributions
- Random Deletion in a Scale-Free Random Graph Process
- A general model of web graphs
- Algorithms and Models for the Web-Graph
- Spectra of random graphs with given expected degrees
- Automata, Languages and Programming
- Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
- Expansion and Lack Thereof in Randomly Perturbed Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
