A spatial preferential attachment model with local clustering
DOI10.1007/978-3-319-03536-9_2zbMATH Open1342.05141OpenAlexW1503879265MaRDI QIDQ2938010FDOQ2938010
Authors: Emmanuel Jacob, Peter Mörters
Publication date: 13 January 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://opus.bath.ac.uk/44991/1/LNCS_SPA_Revision.pdf
Recommendations
- Spatial preferential attachment networks: power laws and clustering coefficients
- Clustering Properties of Spatial Preferential Attachment Model
- Clustering coefficient of a spatial preferential attachment model
- The age-dependent random connection model
- Local clustering coefficient of spatial preferential attachment model
power lawclustering coefficientpreferential attachmentdegree distributionscale-free networkgeometric random graphBarabasi-Albert modeldynamical random graphedge length distribution
Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex degrees (05C07) Internet topics (68M11)
Cited In (19)
- Coexistence in preferential attachment networks
- Robustness of spatial preferential attachment networks
- Clustering coefficient of a spatial preferential attachment model
- Clustering coefficient of a preferred attachment affiliation network
- Weighted distances in scale-free configuration models
- The age-dependent random connection model
- A random graph model for clustering graphs
- Local clustering coefficient of spatial preferential attachment model
- Emergence of the giant component in preferential-attachment growing networks
- Extremal linkage networks
- Distances and large deviations in the spatial preferential attachment model
- Geometric inhomogeneous random graphs
- Random networks with concave preferential attachment rule
- Robustness of scale-free spatial networks
- Spatial preferential attachment networks: power laws and clustering coefficients
- Sampling geometric inhomogeneous random graphs in linear time
- Some Typical Properties of the Spatial Preferred Attachment Model
- Greedy routing and the algorithmic small-world phenomenon
- Clustering Properties of Spatial Preferential Attachment Model
This page was built for publication: A spatial preferential attachment model with local clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938010)