Abstract
For a general random intersection graph, we show an approximation of the vertex degree distribution by a Poisson mixture.
Similar content being viewed by others
References
B. Bollobás, S. Janson, and O. Riordan, The phase transition in inhomogeneous random graphs, Random Struct. Algorith., 31:3–122, 2007.
M. Deijfen and W. Kets, Random intersection graphs with tunable degree distribution and clustering, Discussion paper No. 2007-08, Tilburg University, 2007.
E. Godehardt and J. Jaworski, Two models of random intersection graphs for classification, in Studies in Classification, Data Analysis and Knowledge Organization, Springer, Berlin-Heidelberg-New York, 2003, pp. 67–81.
J. Jaworski, M. Karoński, and D. Stark, The degree of a typical vertex in generalized random intersection graph models, Discr. Math., 306:2152–2165, 2006.
M. Karoński, E.R. Scheinerman, and K.B. Singer-Cohen, On random intersection graphs: The subgraph problem, Combin., Probab. Comput., 8:131–159, 1999.
K.B. Singer-Cohen, Random Intersection Graphs, PhD thesis, Department of Mathematical Sciences, The Johns Hopkins University, 1995.
A.V. Skorokhod, Studies in the Theory of Random Processes, Addison-Wesley, Reading, Mass., 1965.
D. Stark, The vertex degree distribution of random intersection graphs, Random Struct. Algorith., 24:249–258, 2004.
Author information
Authors and Affiliations
Corresponding author
Additional information
Research supported by Lithuanian State Science and Studies Foundation Grant T-07149.
Rights and permissions
About this article
Cite this article
Bloznelis, M. Degree distribution of a typical vertex in a general random intersection graph. Lith Math J 48, 38–45 (2008). https://doi.org/10.1007/s10986-008-0004-7
Received:
Issue Date:
DOI: https://doi.org/10.1007/s10986-008-0004-7