Results 41 to 50 of about 7,886 (170)
SIS epidemic propagation on hypergraphs [PDF]
, 2015 Mathematical modeling of epidemic propagation on networks is extended to hypergraphs in order to account for both the community structure and the nonlinear dependence of the infection pressure on the number of infected neighbours.
Bodó, Ágnes +2 more
core +2 more sources
Approximate counting of regular hypergraphs [PDF]
Information Processing Letters, 2013 In this paper we asymptotically count d-regular k-uniform hypergraphs on n vertices, provided k is fixed and d=d(n)=o(n1/2). In doing so, we extend to hypergraphs a switching technique of McKay and Wormald.
Dudek, Andrzej +3 more
openaire +2 more sources
Hypergraph regularity and random sampling
Random Structures & Algorithms, 2023 AbstractSuppose that a ‐uniform hypergraph satisfies a certain regularity instance (that is, there is a partition of given by the hypergraph regularity lemma into a bounded number of quasirandom subhypergraphs of prescribed densities). We prove that with high probability a large enough uniform random sample of the vertex set of also admits the same ...
Joos, Felix +3 more
openaire +3 more sources
Hypergraph limits: A regularity approach [PDF]
Random Structures & Algorithms, 2014 A sequence of $k$-uniform hypergraphs $H_1, H_2, \dots$ is convergent if the sequence of homomorphism densities $t(F, H_1), t(F, H_2), \dots$ converges for every $k$-uniform hypergraph $F$. For graphs, Lov sz and Szegedy showed that every convergent sequence has a limit in the form of a symmetric measurable function $W \colon [0,1]^2 \to [0,1]$.
openaire +4 more sources
On the spectrum of hypergraphs
, 2016 Here we study the spectral properties of an underlying weighted graph of a non-uniform hypergraph by introducing different connectivity matrices, such as adjacency, Laplacian and normalized Laplacian matrices. We show that different structural properties
Chris Ritchie (1952305) +4 more
core +3 more sources
3D-Via Driven Partitioning for 3D VLSI Integrated Circuits
CLEI Electronic Journal, 2010 A 3D circuit is the stacking of regular 2D circuits. The advances on the fabrication and packaging technologies allowed interconnecting stacked 2D circuits by using 3D vias.
Sandro Sawicki +3 more
doaj +1 more source
Embeddings and Ramsey numbers of sparse k-uniform hypergraphs
, 2008 Chvatal, Roedl, Szemeredi and Trotter proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. In previous work, we proved the same result for 3-uniform hypergraphs. Here we extend this result to k-uniform hypergraphs,
Cooley, Oliver +3 more
core +2 more sources
An Algebraic Hypergraph Regularity Lemma
, 2022 54 pages.
Chevalier, Alexis, Levi, Elad
openaire +2 more sources
On a generalisation of Mantel's theorem to uniformly dense hypergraphs
, 2017 For a $k$-uniform hypergraph $F$ let $\textrm{ex}(n,F)$ be the maximum number of edges of a $k$-uniform $n$-vertex hypergraph $H$ which contains no copy of $F$.
Reiher, Christian +2 more
core +1 more source
Constructing regular self-complementary uniform hypergraphs [PDF]
Journal of Combinatorial Designs, 2011 Summary: We examine the possible orders of t-subset-regular self-complementary \(k\)-uniform hypergraphs, which form examples of large sets of two isomorphic \(t\)-designs. We reformulate Khosrovshahi and Tayfeh -- Rezaie's necessary conditions on the order of these structures in terms of the binary representation of the rank \(k\), and these ...
openaire +2 more sources