Limit theorems for the weights and the degrees in an N-interactions random graph model

DOI10.1515/MATH-2016-0039zbMATH Open1346.05269arXiv1405.1267OpenAlexW2469310956MaRDI QIDQ317897FDOQ317897

István Fazekas, Bettina Porvázsnyik

Publication date: 4 October 2016

Published in: Open Mathematics (Search for Journal in Brave)

Abstract: A random graph evolution based on the interactions of N vertices is studied. During the evolution both the preferential attachment method and the uniform choice of vertices are allowed. The weight of a vertex means the number of its interactions. The asymptotic behaviour of the weight and the degree of a fixed vertex, moreover the limit of the maximal weight and the maximal degree are described. The proofs are based on martingale methods.

Full work available at URL: https://arxiv.org/abs/1405.1267

zbMATH Keywords

power lawrandom graphpreferential attachmentscale-free random graphsubmartingale

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Emergence of Scaling in Random Networks
• Probability Inequalities for Sums of Bounded Random Variables
• Scale-free property for degrees and weights in a preferential attachment random graph model
• Scale-free property for degrees and weights in an \(N\)-interactions random graph model
• The degree sequence of a scale-free random graph process
• A random graph model based on 3-interactions
• Weights and degrees in a random graph model based on 3-interactions
• The Maximum Degree of the Barabási–Albert Random Tree
• A general model of web graphs
• Generalized Preferential Attachment: Tunable Power-Law Degree Distribution and Clustering Coefficient
• Degree distribution nearby the origin of a preferential attachment graph
• A new class of scale free random graphs
• An estimate for the number of edges between vertices of gives degrees in random graphs in the Bollobás-Riordan model
• Weights of cliques in a random graph model based on three-interactions
• On the degree evolution of a fixed vertex in some growing networks
• Limit distribution of degrees in random family trees
• On a 2-parameter class of scale free random graphs

Cited In (6)

• A population evolution model and its applications to random networks
• Tight fluctuations of weight-distances in random graphs with infinite-variance degrees
• Taylor's power law for the \(N\)-stars network evolution model
• Title not available (Why is that?)
• TheN-star network evolution model
• A continuous-time N -interaction random graph model

This page was built for publication: Limit theorems for the weights and the degrees in an \(N\)-interactions random graph model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q317897)