The vertex degree distribution of random intersection graphs

descriptionPublicationkeyboard_double_arrow_right Article 11 Mar 2004 English Publisher:WileyJournal:Random Structures & Algorithms, volume 24, pages 249-258 (issn: 1042-9832, eissn: 1098-2418,

Copyright policy )

Authors: Dudley Stark;

doi: 10.1002/rsa.20005

The vertex degree distribution of random intersection graphs

- Summary
- Subjects
- Metrics

Abstract

AbstractRandom intersection graphs are a model of random graphs in which each vertex is assigned a subset of a set of objects independently and two vertices are adjacent if their assigned subsets are not disjoint. The number of vertices is denoted by n and the number of objects is supposed to be ⌊nα⌋ for some α > 0. We determine the distribution of the degree of a typical vertex and show that it changes sharply between α > 1, α = 1, and α > 1. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004

Related Organizations

University of London
United Kingdom

Keywords

Random graphs (graph-theoretic aspects), random graphs

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	56
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%