Abuzzahab, Omar

Email Address
ORCID
Disciplines
Research Projects
Organizational Units
Position
Introduction
Research Interests

Filters

1
1
20131
1
1
Reset filters

Settings

Search Results

Now showing 1 - 1 of 1
  • Publication
    The 2-Core of a Random Inhomogeneous Hypergraph
    (2013-01-01) Abuzzahab, Omar
    The k-core of a hypergraph is the unique subgraph where all vertices have degree at least k and which is the maximal induced subgraph with this property. We study the 2-core of a random hypergraph by probabilistic analysis of the following edge removal rule: remove any vertices with degree less than 2, and remove all hyperedges incident to these vertices. This process terminates with the 2-core. The hypergraph model studied is an inhomogeneous model --- where the expected degrees are not identical. The main result we prove is that as the number of vertices n tends to infinity, the number of hyperedges R in the 2-core obeys a limit law: R/n converges in probability to a non-random constant.