A new class of scale free random graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3538599 (Why is no real title available?)
- A general model of web graphs
- An approximation theorem for the Poisson binomial distribution
- Emergence of Scaling in Random Networks
- The Maximum Degree of the Barabási–Albert Random Tree
- The degree sequence of a scale-free random graph process
Cited in
(20)- A preferential attachment model with random initial degrees
- Relations between scaling exponents in unimodular random graphs
- Asymptotic degree distribution in preferential attachment graph models with multiple type edges
- The degree sequence of a scale-free random graph process
- Giant descendant trees, matchings, and independent sets in age-biased attachment graphs
- On Bollobás‐Riordan random pairing model of preferential attachment graph
- A random graph of moderate density
- Scale-free graphs with many edges
- Branching structure and maximum degree of an evolving random tree
- Structural properties of the scale-free Barabasi-Albert graph
- Limit theorems for the weights and the degrees in an \(N\)-interactions random graph model
- The diameter of a scale-free random graph
- On a 2-parameter class of scale free random graphs
- Unimodular lattice triangulations as small-world and scale-free random graphs
- Large deviations for the leaves in some random trees
- From heavy-tailed Boolean models to scale-free Gilbert graphs
- Connectedness strength of two vertices in an uncertain graph
- Coupling Scale-Free and Classical Random Graphs
- On the continuous-time limit of the Barabási-Albert random graph
- The clustering coefficient of a scale-free random graph
This page was built for publication: A new class of scale free random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2507701)