The degree of a typical vertex in generalized random intersection graph models

Discrete Mathematics

Volumn 306, Issue 18, 2006, Pages 2152-2165

  Jaworski, Jerzy ^a   Karoński, Michał ^a   Stark, Dudley ^b  

^a ADAM MICKIEWICZ UNIVERSITY   (Poland)

^b QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Random graphs; Random intersection graphs

Indexed keywords

BOUNDARY CONDITIONS; DATA REDUCTION; MATHEMATICAL MODELS; RANDOM PROCESSES; SET THEORY;

PASSIVE INTERSECTION GRAPHS; RANDOM GRAPHS; RANDOM INTERSECTION GRAPHS; VERTEX DEGREE;

GRAPH THEORY;

EID: 33747794115     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2006.05.013     Document Type: Article

References (5)

1. Fill J.A., Scheinerman E.R., and Singer-Cohen K.B. Random intersection graphs when m = ω (n): an equivalence theorem relating the evolution of the G (n, m, p) and G (n, p) models. Random Structures Algorithms 16 (2000) 156-176
2. Godehardt E., and Jaworski J. Two models of random intersection graphs for classification. In: Schwaiger M., and Opitz O. (Eds). Exploratory Data Analysis in Empirical Research. Proceedings of the 25th Annual Conference of the Gesellschaft für Klassifikation e.V., University of Munich, March 14-16, 2001, Springer, Berlin, Heidelberg, New York (2002) 67-81
3. Karoński M., Scheinerman E.R., and Singer-Cohen K.B. On random intersection graphs: the subgraph problem. Combin. Probab. Comput. 8 (1999) 131-159
4. K.B. Singer, Random intersection graphs, Dissertation, Johns Hopkins University, 1995.
5. Stark D. The vertex degree distribution of random intersection graphs. Random Structures Algorithms 24 (2004) 249-258