Zobrazeno 1 - 10
of 6 244
pro vyhledávání: '"uniform hypergraph"'
Autor:
Zhao, Ning1,2 (AUTHOR) 1997004@qhmu.edu.cn, Zhao, Haixing1 (AUTHOR) hxzhao@qhnu.edu.cn, Li, Yinkui2 (AUTHOR)
Publikováno v:
Mathematics (2227-7390). Feb2024, Vol. 12 Issue 4, p515. 11p.
We investigate the behaviour of $r$-neighbourhood bootstrap percolation on the binomial $k$-uniform random hypergraph $H_k(n,p)$ for given integers $k\geq 2$ and $r\geq 2$. In $r$-neighbourhood bootstrap percolation, infection spreads through the hyp
Externí odkaz:
http://arxiv.org/abs/2403.12775
Autor:
Li, Runze, Miklos, Istvan
A $3$-uniform hypergraph is a generalization of simple graphs where each hyperedge is a subset of vertices of size $3$. The degree of a vertex in a hypergraph is the number of hyperedges incident with it. The degree sequence of a hypergraph is the se
Externí odkaz:
http://arxiv.org/abs/2312.00555
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
The game of \emph{Cops and Robber} is usually played on a graph, where a group of cops attempt to catch a robber moving along the edges of the graph. The \emph{cop number} of a graph is the minimum number of cops required to win the game. An importan
Externí odkaz:
http://arxiv.org/abs/2307.15512
Autor:
Dumitriu, Ioana, Wang, Haixiao
Consider the community detection problem in random hypergraphs under the non-uniform hypergraph stochastic block model (HSBM), where each hyperedge appears independently with some given probability depending only on the labels of its vertices. We est
Externí odkaz:
http://arxiv.org/abs/2304.13139
Autor:
Wang, Haixiao
Consider the unsupervised classification problem in random hypergraphs under the non-uniform \emph{Hypergraph Stochastic Block Model} (HSBM) with two equal-sized communities ($n/2$), where each edge appears independently with some probability dependi
Externí odkaz:
http://arxiv.org/abs/2306.06845
The Wiener index of a (hyper)graph is calculated by summing up the distances between all pairs of vertices. We determine the maximum possible Wiener index of a connected $n$-vertex $k$-uniform hypergraph and characterize for every~$n$ all hypergraphs
Externí odkaz:
http://arxiv.org/abs/2302.08686
An $r$-uniform hypergraphic sequence (i.e., $r$-graphic sequence) $d=(d_1, d_2,\cdots,d_n)$ is said to be forcibly $k$-edge-connected if every realization of $d$ is $k$-edge-connected. In this paper, we obtain a strongest sufficient degree condition
Externí odkaz:
http://arxiv.org/abs/2212.09014
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.