On a 2-parameter class of scale free random graphs

DOI10.1007/S10474-006-0511-0MaRDI QIDQ879217zbMATH OpenOpenAlexFDO

Authors Tamás F. Móri

Publication date 8 May 2007

Published in Acta Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10474-006-0511-0

zbMATH Keywords

degree distributionmartingalesmaximum degreescale free graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Martingales with discrete parameter (60G42)

Review text

A process of evolving random graphs is considered where vertices are added one by one, and edges connecting the new vertex to the old ones are drawn independently, each with probability depending linearly on the degree of the endpoint. In the paper the asymptotic degree distribution and the order of the maximum degree is determined.

Recommendations

• A new class of scale free random graphs
• On the structure of classes of random graphs
• Coupling Scale-Free and Classical Random Graphs
• 2-universality in randomly perturbed graphs
• scientific article; zbMATH DE number 845673
• Random graphs: models and asymptotic characteristics
• On the spread of random graphs
• The degree sequences and spectra of scale-free random graphs
• Constructions and properties of a class of random scale-free networks
• Universality of Random Graphs for Graphs of Maximum Degree Two

Cites work

• A general model of web graphs
• A new class of scale free random graphs
• An approximation theorem for the Poisson binomial distribution
• Emergence of Scaling in Random Networks
• scientific article; zbMATH DE number 3538599 (Why is no real title available?)
• scientific article; zbMATH DE number 605729 (Why is no real title available?)
• On random trees
• The Maximum Degree of the Barabási–Albert Random Tree

Cited in

(8)

• A new class of scale free random graphs
• The degree sequence of a scale-free random graph process
• Further properties of a random graph with duplications and deletions
• Limit theorems for the weights and the degrees in an N-interactions random graph model
• On the degree sequence of an evolving random graph process and its critical phenomenon
• An evolving random network and its asymptotic structure
• An enumeration approach to network evolution
• Preferred attachment in affiliation networks

This page was built for publication: On a 2-parameter 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 Q879217)