pith. sign in

arxiv: cond-mat/0304701 · v2 · pith:Q2SG42N3new · submitted 2003-04-30 · ❄️ cond-mat.dis-nn · cond-mat.stat-mech· math.PR

A Tractable Complex Network Model based on the Stochastic Mean-field Model of Distance

classification ❄️ cond-mat.dis-nn cond-mat.stat-mechmath.PR
keywords modelmodelsclusteringcomplexdegreedistancefeaturesmean-field
0
0 comments X
read the original abstract

Much recent research activity has been devoted to empirical study and theoretical models of complex networks (random graphs) with three qualitative features: power-law degree distribution, local clustering of edges, and small diameter. We point out a new (in this context) platform for such models -- the stochastic mean-field model of distance -- and within this platform study a simple two-parameter proportional attachment model. The model is mathematicallly natural, permits a wide variety of explicit calculations, has the desired three qualitative features, and fits the complete range of degree scaling exponents and clustering parameters; in these respects it compares favorably to existing models.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.