A Tractable Complex Network Model based on the Stochastic Mean-field Model of Distance
From MaRDI portal
Publication:3370773
zbMATH Open1080.05532arXivcond-mat/0304701MaRDI QIDQ3370773FDOQ3370773
Authors: David Aldous
Publication date: 8 February 2006
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.
Full work available at URL: https://arxiv.org/abs/cond-mat/0304701
Recommendations
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)
Cited In (6)
- A coarse graining algorithm based on \(m\)-order degree in complex network
- Small-world graphs: characterization and alternative constructions
- About thinning invariant partition structures
- Heterogeneous network with distance dependent connectivity
- A stochastic complex network model
- A conversation with David J. Aldous
This page was built for publication: A Tractable Complex Network Model based on the Stochastic Mean-field Model of Distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3370773)