The degree sequences of an asymmetrical growing network
From MaRDI portal
(Redirected from Publication:1004254)
Recommendations
- A preferential attachment model with random initial degrees
- Degree distribution nearby the origin of a preferential attachment graph
- scientific article; zbMATH DE number 5732563
- Asymptotic degree distribution in a homogeneous evolving network model
- An evolving random network and its asymptotic structure
Cites work
- Collective dynamics of `small-world' networks
- Complex graphs and networks
- Concentration of vertex degrees in a scale‐free random graph process
- Connected components in random graphs with given expected degree sequences
- Emergence of Scaling in Random Networks
- Paths in graphs
- Random networking: between order and chaos
- The average distances in random graphs with given expected degrees
- The degree sequence of a scale-free random graph process
- The Volume of the Giant Component of a Random Graph with Given Expected Degrees
- Universality for the distance in finite variance random graphs
Cited in
(7)- Vertex-degree sequences in complex networks: new characteristics and applications
- The degree analysis of an inhomogeneous growing network with two types of vertices
- A simple asymmetric evolving random network
- A new structure entropy of complex networks based on nonextensive statistical mechanics and similarity of nodes
- Asymptotic degree distribution in a homogeneous evolving network model
- Asymptotic behavior of connecting-nearest-neighbor models for growing networks
- A web model with power law exponents less than 2
This page was built for publication: The degree sequences of an asymmetrical growing network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1004254)
