The degree sequence of a scale-free random graph process
From MaRDI portal
A graph process is specified such that vertices are added to a graph one at a time and joined to a fixed number \(m\) of earlier vertices, selected with probabilities proportional to their degrees. It is shown that the proportion of vertices having degree \(d\) is asymptotically given by \(m(m+1)/3\) divided by \({d+m+2)\choose 3}\).
Recommendations
Cites work
- Emergence of Scaling in Random Networks
- scientific article; zbMATH DE number 4053643 (Why is no real title available?)
- scientific article; zbMATH DE number 1180773 (Why is no real title available?)
- On the structure of random plane‐oriented recursive trees and their branches
- Probability Inequalities for Sums of Bounded Random Variables
- Random Graphs
- The diameter of a scale-free random graph
- The strong convergence of maximal degrees in uniform random recursive trees and dags
- Weighted sums of certain dependent random variables
Cited in
(only showing first 100 items - show all)- The degree sequences of an asymmetrical growing network
- The degree distribution of random \(k\)-trees
- On a random graph evolving by degrees
- Vertex-degree sequences in complex networks: new characteristics and applications
- Scale-free behavior of networks with the copresence of preferential and uniform attachment rules
- The robot crawler graph process
- Game theoretical modelling of a dynamically evolving network. I: General target sequences
- The degree analysis of an inhomogeneous growing network with two types of vertices
- A population evolution model and its applications to random networks
- Change point detection in network models: preferential attachment and long range dependence
- Law of large numbers for the largest component in a hyperbolic model of complex networks
- Model of a random geometric graph with attachment to the coverage area
- Degree distribution of a scale-free random graph model
- Popularity based random graph models leading to a scale-free degree sequence
- An algorithm generating random graphs with power law degree distributions
- Random networks with sublinear preferential attachment: the giant component
- Large deviations for the degree structure in preferential attachment schemes
- Degree asymptotics with rates for preferential attachment random graphs
- On a preferential attachment and generalized Pólya's urn model
- Visualizing bivariate long-tailed data
- Total variation error bounds for geometric approximation
- Coevolution of multi-game resolves social dilemma in network population
- Metric dimension of critical Galton-Watson trees and linear preferential attachment trees
- Preferential attachment with location-based choice: degree distribution in the noncondensation phase
- A phase transition for preferential attachment models with additive fitness
- Percolation of new products
- A random graph of moderate density
- Barabasi-Albert trees are hypoenergetic
- Dynamical models for random simplicial complexes
- \(\gamma\)-variable first-order logic of uniform attachment random graphs
- On dynamic random graphs with degree homogenization via anti-preferential attachment probabilities
- Correlated randomly growing graphs
- Condensation phenomena in preferential attachment trees with neighbourhood influence
- Random processes with high variance produce scale free networks
- Influence of the seed in affine preferential attachment trees
- On the continuous-time limit of the Barabási-Albert random graph
- A study on scale free social network evolution model with degree exponent \(<2\)
- Global dynamics of an epidemic model with incomplete recovery in a complex network
- On nodes of small degrees and degree profile in preferential dynamic attachment circuits
- On the independence number and the chromatic number of generalized preferential attachment models
- Barabási-Albert random graph with multiple type edges and perturbation
- Optimally connected hybrid complex networks with windmill graphs backbone
- Preferential attachment random graphs with edge-step functions
- Exponential-family models of random graphs: inference in finite, super and infinite population scenarios
- Interplay between epidemic spread and information diffusion on two-layered networks with partial mapping
- Fragility of nonconvergence in preferential attachment graphs with three types
- Social network formation and strategic interaction in large networks
- Preferential attachment without vertex growth: emergence of the giant component
- On the convergence of probabilities of first-order sentences for recursive random graph models
- MSO 0-1 law for recursive random trees
- A tolerance-based heuristic approach for the weighted independent set problem
- Scale-free property for degrees and weights in a preferential attachment random graph model
- The age-dependent random connection model
- Structural sparsity of complex networks: bounded expansion in random models and real-world graphs
- Studies on generalized Yule models
- Local and global degree profiles of randomly grown self-similar hooking networks under uniform and preferential attachment
- Taylor's power law for the \(N\)-stars network evolution model
- Degree distribution of shortest path trees and bias of network sampling algorithms
- Power laws for family sizes in a duplication model
- Exact solutions of a generalized weighted scale free network
- On a uniformly random chord diagram and its intersection graph
- Synchronization in random networks with given expected degree sequences
- On certain connectivity properties of the internet topology
- Reconstruction of Kauffman networks applying trees
- A new class of scale free random graphs
- A web model with power law exponents less than 2
- On the mean distance in scale free graphs
- Convergence properties of the degree distribution of some growing network models
- Scale-free property for degrees and weights in an \(N\)-interactions random graph model
- An extended scale-free network evolution model based on star-like coupling motif embedding
- Upperbounds on the probability of finding marked connected components using quantum walks
- Scalable generation of scale-free graphs
- Transition of the degree sequence in the random graph model of Cooper, Frieze, and Vera
- Random graphs associated to some discrete and continuous time preferential attachment models
- Power laws in preferential attachment graphs and Stein's method for the negative binomial distribution
- Social networks spread rumors in sublogarithmic time
- The degree sequences of Buckley-Osthus scale-free graphs
- Nongrowing preferential attachment random graphs
- Degree sequence of a scale-free random graph
- Graphs with asymptotically invariant degree sequences under restriction
- Evolution of the Media Web
- Asymptotic properties of a random graph with duplications
- An estimate of the probability of localisation of the diameter of a random scale-free graph
- SIS epidemic propagation on hypergraphs
- How to distribute antidote to control epidemics
- Minimum vertex cover in generalized random graphs with power law degree distribution
- Random networks with preferential growth and vertex death
- Random multitrees
- Limit theorems for the weights and the degrees in an N-interactions random graph model
- Robustness of power-law networks: its assessment and optimization
- Sublinear but never superlinear preferential attachment by local network growth
- scientific article; zbMATH DE number 7232749 (Why is no real title available?)
- Width of a scale-free tree
- Birds of a feather or opposites attract -- effects in network modelling
- Typical distances in a geometric model for complex networks
- On the degree sequence of an evolving random graph process and its critical phenomenon
- Distribution of Vertex Degree in Web-Graphs
- The degree sequences and spectra of scale-free random graphs
- On the asymptotic behaviour of random recursive trees in random environments
- The web graph as an equilibrium
This page was built for publication: The degree sequence of a scale-free random graph process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2725033)
