11 August 2006 in Journal of Statistical Physics
1 April 2009 in Probability in the Engineering and Informational Sciences
A random intersection graph is constructed by assigning independently to each vertex a subset of a given set and drawing an edge between two vertices if and only if their respective subsets intersect. In this article a model is developed in which each vertex is given a random weight and vertices with larger weights are more likely to be assigned large subsets. The distribution of the degree of a given vertex is characterized and is shown to depend on the weight of the vertex. In particular, if the weight distribution is a power law, the degree distribution will be as well. Furthermore, an asymptotic expression for the clustering in the graph is derived. By tuning the parameters of the model, it is possible to generate a graph with arbitrary clustering, expected degree, and—in the power-law case—tail exponent.
1 July 2011 in Mathematical Biosciences
23 September 2011 in Journal of Statistical Physics
7 April 2006 in Combinatorics, Probability and Computing
The two-type Richardson model describes the growth of two competing infections on is irrelevant in deciding whether or not the event of mutual unbounded growth for the two infection types has positive probability.
1 April 2012 in Arkiv för Matematik
Project Euclid - mathematics and statistics online