Subcritical random hypergraphs, high-order components, and hypertrees

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Abstract

One of the central topics in the theory of random graphs deals with the phase transition in the order of the largest components. In the binomial random graph G(n, p), the threshold for the appearance of the unique largest component (also known as the giant component) is p g = n 1 . More precisely, when p changes from (1 − ε)p g (subcritical case) to p g and then to (1 + ε)p g (supercritical case) for ε > 0, with high probability the order of the largest component increases smoothly from O(ε 2 log(ε 3 n)) to Θ(n 2 / 3 ) and then to (1 ± o(1))2εn. Furthermore, in the supercritical case, with high probability the largest components except the giant component are trees of order O(ε 2 log(ε 3 n)), exhibiting a structural symmetry between the subcritical random graph and the graph obtained from the supercritical random graph by deleting its giant component. As a natural generalisation of random graphs and connectedness, we consider the binomial random kuniform hypergraph H k (n, p) (where each k-tuple of vertices is present as a hyperedge with probability p independently) and the following notion of high-order connectedness. Given an integer 1 ≤ j ≤ k − 1, two sets of j vertices are called j-connected if there is a walk of hyperedges between them such that any two consecutive hyperedges intersect in at least j vertices. A j-connected component is a maximal collection of pairwise j-connected j-tuples of vertices. Recently, the threshold for the appearance of the giant j-connected component in H k (n, p) and its order were determined. In this article, we take a closer look at the subcritical random hypergraph. We determine the structure and size (i.e. number of hyperedges) of the largest j-connected components, with the help of a certain class of “hypertrees” and related objects. In our proofs, we combine various probabilistic and enumerative techniques, such as generating functions and couplings with branching processes. Our study will pave the way to establishing a symmetry between the subcritical random hypergraph and the hypergraph obtained from the supercritical random hypergraph by deleting its giant j-connected component.

Original languageEnglish
Title of host publication16th Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2019
EditorsJ. Ian Munro, Marni Michna
Pages111-118
Number of pages8
ISBN (Electronic)9781510879942
Publication statusPublished - 2019
EventAnalytic Algorithmics and Combinatorics - Westin San Diego, San Diego, United States
Duration: 6 Jan 20197 Jan 2019

Conference

ConferenceAnalytic Algorithmics and Combinatorics
Abbreviated titleANALCO19
CountryUnited States
CitySan Diego
Period6/01/197/01/19

Fingerprint

Hypertree
Order Component
Hypergraph
Random Graphs
Giant Component
Connected Components
Higher Order
Connectedness
Symmetry
Phase transitions
Branching process
Intersect
Walk
Generating Function
Consecutive
Pairwise
Phase Transition
Integer
Graph in graph theory

ASJC Scopus subject areas

  • Applied Mathematics
  • Materials Chemistry
  • Discrete Mathematics and Combinatorics

Fields of Expertise

  • Information, Communication & Computing

Cite this

Cooley, O. J. N., Fang, W., Del Giudice, N., & Kang, M. (2019). Subcritical random hypergraphs, high-order components, and hypertrees. In J. I. Munro, & M. Michna (Eds.), 16th Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2019 (pp. 111-118)

Subcritical random hypergraphs, high-order components, and hypertrees. / Cooley, Oliver Josef Nikolaus; Fang, Wenjie; Del Giudice, Nicola; Kang, Mihyun.

16th Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2019. ed. / J. Ian Munro; Marni Michna. 2019. p. 111-118.

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Cooley, OJN, Fang, W, Del Giudice, N & Kang, M 2019, Subcritical random hypergraphs, high-order components, and hypertrees. in JI Munro & M Michna (eds), 16th Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2019. pp. 111-118, Analytic Algorithmics and Combinatorics, San Diego, United States, 6/01/19.
Cooley OJN, Fang W, Del Giudice N, Kang M. Subcritical random hypergraphs, high-order components, and hypertrees. In Munro JI, Michna M, editors, 16th Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2019. 2019. p. 111-118
Cooley, Oliver Josef Nikolaus ; Fang, Wenjie ; Del Giudice, Nicola ; Kang, Mihyun. / Subcritical random hypergraphs, high-order components, and hypertrees. 16th Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2019. editor / J. Ian Munro ; Marni Michna. 2019. pp. 111-118
@inproceedings{47975971536b4758b4888cec9e9ee276,
title = "Subcritical random hypergraphs, high-order components, and hypertrees",
abstract = "One of the central topics in the theory of random graphs deals with the phase transition in the order of the largest components. In the binomial random graph G(n, p), the threshold for the appearance of the unique largest component (also known as the giant component) is p g = n − 1 . More precisely, when p changes from (1 − ε)p g (subcritical case) to p g and then to (1 + ε)p g (supercritical case) for ε > 0, with high probability the order of the largest component increases smoothly from O(ε − 2 log(ε 3 n)) to Θ(n 2 / 3 ) and then to (1 ± o(1))2εn. Furthermore, in the supercritical case, with high probability the largest components except the giant component are trees of order O(ε − 2 log(ε 3 n)), exhibiting a structural symmetry between the subcritical random graph and the graph obtained from the supercritical random graph by deleting its giant component. As a natural generalisation of random graphs and connectedness, we consider the binomial random kuniform hypergraph H k (n, p) (where each k-tuple of vertices is present as a hyperedge with probability p independently) and the following notion of high-order connectedness. Given an integer 1 ≤ j ≤ k − 1, two sets of j vertices are called j-connected if there is a walk of hyperedges between them such that any two consecutive hyperedges intersect in at least j vertices. A j-connected component is a maximal collection of pairwise j-connected j-tuples of vertices. Recently, the threshold for the appearance of the giant j-connected component in H k (n, p) and its order were determined. In this article, we take a closer look at the subcritical random hypergraph. We determine the structure and size (i.e. number of hyperedges) of the largest j-connected components, with the help of a certain class of “hypertrees” and related objects. In our proofs, we combine various probabilistic and enumerative techniques, such as generating functions and couplings with branching processes. Our study will pave the way to establishing a symmetry between the subcritical random hypergraph and the hypergraph obtained from the supercritical random hypergraph by deleting its giant j-connected component.",
author = "Cooley, {Oliver Josef Nikolaus} and Wenjie Fang and {Del Giudice}, Nicola and Mihyun Kang",
year = "2019",
language = "English",
pages = "111--118",
editor = "Munro, {J. Ian} and Marni Michna",
booktitle = "16th Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2019",

}

TY - GEN

T1 - Subcritical random hypergraphs, high-order components, and hypertrees

AU - Cooley, Oliver Josef Nikolaus

AU - Fang, Wenjie

AU - Del Giudice, Nicola

AU - Kang, Mihyun

PY - 2019

Y1 - 2019

N2 - One of the central topics in the theory of random graphs deals with the phase transition in the order of the largest components. In the binomial random graph G(n, p), the threshold for the appearance of the unique largest component (also known as the giant component) is p g = n − 1 . More precisely, when p changes from (1 − ε)p g (subcritical case) to p g and then to (1 + ε)p g (supercritical case) for ε > 0, with high probability the order of the largest component increases smoothly from O(ε − 2 log(ε 3 n)) to Θ(n 2 / 3 ) and then to (1 ± o(1))2εn. Furthermore, in the supercritical case, with high probability the largest components except the giant component are trees of order O(ε − 2 log(ε 3 n)), exhibiting a structural symmetry between the subcritical random graph and the graph obtained from the supercritical random graph by deleting its giant component. As a natural generalisation of random graphs and connectedness, we consider the binomial random kuniform hypergraph H k (n, p) (where each k-tuple of vertices is present as a hyperedge with probability p independently) and the following notion of high-order connectedness. Given an integer 1 ≤ j ≤ k − 1, two sets of j vertices are called j-connected if there is a walk of hyperedges between them such that any two consecutive hyperedges intersect in at least j vertices. A j-connected component is a maximal collection of pairwise j-connected j-tuples of vertices. Recently, the threshold for the appearance of the giant j-connected component in H k (n, p) and its order were determined. In this article, we take a closer look at the subcritical random hypergraph. We determine the structure and size (i.e. number of hyperedges) of the largest j-connected components, with the help of a certain class of “hypertrees” and related objects. In our proofs, we combine various probabilistic and enumerative techniques, such as generating functions and couplings with branching processes. Our study will pave the way to establishing a symmetry between the subcritical random hypergraph and the hypergraph obtained from the supercritical random hypergraph by deleting its giant j-connected component.

AB - One of the central topics in the theory of random graphs deals with the phase transition in the order of the largest components. In the binomial random graph G(n, p), the threshold for the appearance of the unique largest component (also known as the giant component) is p g = n − 1 . More precisely, when p changes from (1 − ε)p g (subcritical case) to p g and then to (1 + ε)p g (supercritical case) for ε > 0, with high probability the order of the largest component increases smoothly from O(ε − 2 log(ε 3 n)) to Θ(n 2 / 3 ) and then to (1 ± o(1))2εn. Furthermore, in the supercritical case, with high probability the largest components except the giant component are trees of order O(ε − 2 log(ε 3 n)), exhibiting a structural symmetry between the subcritical random graph and the graph obtained from the supercritical random graph by deleting its giant component. As a natural generalisation of random graphs and connectedness, we consider the binomial random kuniform hypergraph H k (n, p) (where each k-tuple of vertices is present as a hyperedge with probability p independently) and the following notion of high-order connectedness. Given an integer 1 ≤ j ≤ k − 1, two sets of j vertices are called j-connected if there is a walk of hyperedges between them such that any two consecutive hyperedges intersect in at least j vertices. A j-connected component is a maximal collection of pairwise j-connected j-tuples of vertices. Recently, the threshold for the appearance of the giant j-connected component in H k (n, p) and its order were determined. In this article, we take a closer look at the subcritical random hypergraph. We determine the structure and size (i.e. number of hyperedges) of the largest j-connected components, with the help of a certain class of “hypertrees” and related objects. In our proofs, we combine various probabilistic and enumerative techniques, such as generating functions and couplings with branching processes. Our study will pave the way to establishing a symmetry between the subcritical random hypergraph and the hypergraph obtained from the supercritical random hypergraph by deleting its giant j-connected component.

UR - http://www.scopus.com/inward/record.url?scp=85065577305&partnerID=8YFLogxK

M3 - Conference contribution

SP - 111

EP - 118

BT - 16th Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2019

A2 - Munro, J. Ian

A2 - Michna, Marni

ER -