Preferred Attachment in Affiliation Networks

Vertices of an affiliation network are linked to attributes and two vertices are declared adjacent whenever they share a common attribute. For example, two customers of an internet shop (or video-sharing website) are called adjacent if they have purchased (or downloaded) the same or similar items. Assuming that each newly arrived customer is linked preferentially to already popular items we obtain a preferred attachment affiliation network that evolves in time. We show that the fraction of customers having \(i\) neighbours scales as \(i^{-2-\alpha }\ln i\) for large \(i\) . Here \(\alpha >0\) is the ratio between the two intensities: intensity of the flow of customers and that of the newly arriving items.     

A random intersection digraph: Indegree and outdegree distributions

Let S(1),…,S(n),T(1),…,T(n) be random subsets of the set [m]={1,…,m}. We consider the random digraph D on the vertex set [n] defined as follows: the arc i→j is present in D whenever S(i)∩T(j)≠0?. Assuming that the pairs of sets (S(i),T(i)), 1≤i≤n, are independent and identically distributed, we study the in- and outdegree distributions of a typical vertex of D as n,m→∞.