A Spatial Preferential Attachment Model with Local Clustering

DOI10.1007/978-3-319-03536-9_2zbMath1342.05141OpenAlexW1503879265MaRDI QIDQ2938010

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

zbMATH Keywords

degree distributionpower lawclustering coefficientpreferential attachmentscale-free networkgeometric random graphBarabasi-Albert modeldynamical random graphedge length distribution

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Vertex degrees (05C07) Internet topics (68M11)

Related Items (10)

Clustering Properties of Spatial Preferential Attachment Model ⋮ Clustering Coefficient of a Preferred Attachment Affiliation Network ⋮ Extremal linkage networks ⋮ A random graph model for clustering graphs ⋮ Geometric inhomogeneous random graphs ⋮ Clustering coefficient of a spatial preferential attachment model ⋮ Weighted distances in scale-free configuration models ⋮ Distances and large deviations in the spatial preferential attachment model ⋮ Greedy routing and the algorithmic small-world phenomenon ⋮ Sampling Geometric Inhomogeneous Random Graphs in Linear Time

This page was built for publication: A Spatial Preferential Attachment Model with Local Clustering