Asymptotic normality of in- and out-degree counts in a preferential attachment model

From MaRDI portal
(Redirected from Publication:4976517)



Abstract: Preferential attachment in a directed scale-free graph is widely used to model the evolution of social networks. Statistical analyses of social networks often relies on node based data rather than conventional repeated sampling. For our directed edge model with preferential attachment, we prove asymptotic normality of node counts based on a martingale construction and a martingale central limit theorem. This helps justify estimation methods based on the statistics of node counts which have specified in-degree and out-degree.












This page was built for publication: Asymptotic normality of in- and out-degree counts in a preferential attachment model

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