Preferred attachment in affiliation networks

From MaRDI portal
(Redirected from Publication:743425)



Abstract: In an affiliation network vertices are linked to attributes and two vertices are declared adjacent whenever they share a common attribute. For example, two customers of an internet shop are called adjacent if they have purchased the same or similar items. Assuming that each newly arrived customer is linked preferentially to already popular items we obtain a preferred attachment model of an evolving affiliation network. We show that the network has a scale-free property and establish the asymptotic degree distribution.


The authors study preferred attachment in growing affiliation networks, where vertices are linked to items independently at random, and the probability of an edge between the new vertex and an item \(w\) is proportional to the number of vertices already linked to \(w\). The asymptotic degree distribution of the evolving network is identified. It is shown that the fraction of vertices having degree \(i\) scales as \(i^{-2-\alpha}\ln i\) for large \(i\), where \(\alpha\) is a model parameter involving the intensity of the flow of customers (vertices) and the intensity of the newly arriving items.











This page was built for publication: Preferred attachment in affiliation networks

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