Hostname: page-component-55f67697df-gmt7q Total loading time: 0 Render date: 2025-05-15T06:22:20.821Z Has data issue: false hasContentIssue false
- English
- Français
Article contents
The Vertex Degree Distribution of Passive Random Intersection Graph Models
Published online by Cambridge University Press: 01 July 2008
- JERZY JAWORSKI
- Affiliation:Faculty of Mathematics and Computer Science, Adam Mickiewicz University, ul. Umultowska 87, 61-614 Poznań, Poland (e-mail: jaworski@amu.edu.pl)
- DUDLEY STARK
- Affiliation:School of Mathematical Sciences, Queen Mary, University of London, London E1 4NS, UK (e-mail: D.S.Stark@maths.qmul.ac.uk)
Abstract
In a random passive intersection graph model the edges of the graph are decided by taking the union of a fixed number of cliques of random size. We give conditions for a random passive intersection graph model to have a limiting vertex degree distribution, in particular to have a Poisson limiting vertex degree distribution. We give related conditions which, in addition to implying a limiting vertex degree distribution, imply convergence of expectation.
- Type
- Paper
- Information
- Copyright
- Copyright © Cambridge University Press 2008
Access options
Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)Article purchase
Temporarily unavailable
References
[1]Fill,J. A.,Scheinerman,E. R. andSinger-Cohen,K. B. (2000)Random intersection graphs whenm = ω(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models.Random Struct. Alg.16156–176.3.0.CO;2-H>CrossRefGoogle Scholar
[2]Godehardt,E. andJaworski,J. (2002) Two models of random intersection graphs for classification. InExploratory Data Analysis in Empirical Research: Proc. 25th Annual Conference of the Gesellschaft für Klassifikation e.V., University of Munich, March 14–16, 2001 (Schwaiger,M. andOpitz,O., eds),Springer, pp.67–81.Google Scholar
[3]Jaworski,J.,Karoński,M. andStark,D. (2006)The degree of a typical vertex in generalized random intersection graph models.Discrete Math.306/182152–2165.CrossRefGoogle Scholar
[4]Karoński,M.,Scheinerman,E. R. andSinger-Cohen,K. B. (1999)On random intersection graphs: The subgraph problem.Combin. Probab. Comput.8131–159.CrossRefGoogle Scholar
[6]Singer,K. B. (1995) Random intersection graphs. Dissertation, Johns Hopkins University.Google Scholar
[7]Stark,D. (2004)The vertex degree distribution of random intersection graphs.Random Struct. Alg.24249–258.CrossRefGoogle Scholar
