Double preferential scale-free network models
From MaRDI portal
Recommendations
Cited in
(11)- Scale-free networks via attaching to random neighbors
- A class of vertex-edge-growth small-world network models having scale-free, self-similar and hierarchical characters
- Uniform preferential selection model for generating scale-free networks
- Distributed network generation based on preferential attachment in ABS
- Hamiltonian dynamics of preferential attachment
- Modeling interacting dynamic networks: II. Systematic study of the statistical properties of cross-links between two networks with preferred degrees
- MODELING OF CYCLIC TOPOLOGY IN SCALE-FREE NETWORKS
- Growth and preferential attachment in scale-free networks
- One scale-free network model based on two different preferential attachment probabilities
- Random continuous model of scale-free networks
- A preferential attachment model with Poisson growth for scale-free networks
This page was built for publication: Double preferential scale-free network models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5367639)