Limiting distribution of short cycles in inhomogeneous random uniform hypergraph

被引：0

作者：

Yuan, Mingao ^{[1
]}

机构：

[1] North Dakota State Univ, Dept Stat, Fargo, ND 58102 USA

来源：

STATISTICS & PROBABILITY LETTERS | 2021年 / 175卷

关键词：

Loose cycle; Limiting distribution; Inhomogeneous uniform hypergraph; LOOSE HAMILTON CYCLES; 3-UNIFORM HYPERGRAPHS; SUBGRAPHS;

D O I：

10.1016/j.spl.2021.109116

中图分类号：

O21 [概率论与数理统计]; C8 [统计学];

学科分类号：

020208 ; 070103 ; 0714 ;

摘要：

In random graph theory, one of the classical topics is to understand the asymptotic properties of the number of subgraphs. In this paper, we study the limiting distribution of the number of loose 2-cycles in inhomogeneous 3-uniform hypergraph. Specifically, we prove that if the hypergraph is relatively sparse, the centered and scaled number of the loose 2-cycles converges in law to the standard normal distribution. (C) 2021 Elsevier B.V. All rights reserved.

引用

页数：8

共 28 条

[1]

Agarwal S., 2006, P 23 INT C MACHINE L, P17

[2]

Angelini MC, 2015, ANN ALLERTON CONF, P66, DOI 10.1109/ALLERTON.2015.7446987

[3] SPECTRA, EUCLIDEAN REPRESENTATIONS AND CLUSTERINGS OF HYPERGRAPHS [J].

BOLLA, M .

DISCRETE MATHEMATICS, 1993, 117 (1-3) :19-39

[4]

BOLLOBAS B, 1976, MATH PROC CAMBRIDGE, V80, P419, DOI 10.1017/S0305004100053056

[5] The phase transition in inhomogeneous random graphs [J].

Bollobas, Bela ;

Janson, Svante ;

Riordan, Oliver .

RANDOM STRUCTURES & ALGORITHMS, 2007, 31 (01) :3-122

[6] Efficient High Order Matching [J].

Chertok, Michael ;

Keller, Yosi .

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2010, 32 (12) :2205-2215

[7]

Dudek A, 2018, ELECTRON J COMB, V25

[8]

Erdos P., 1960, B INT STATIST INST, V5, P17

[9]

Estrada E., 2005, COMPLEX NETWORKS HYP

[10] On 3-uniform hypergraphs without a cycle of a given length [J].

Furedi, Zoltan ;

Ozkahya, Lale .

DISCRETE APPLIED MATHEMATICS, 2017, 216 :582-588

← 1 2 3 →