Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 310 for “"Hypergraph"”.
-
Hypergraph neural networks
… representations that model them explicitly. Hypergraphs provide a natural generalization by allowing relations of arbitrary arity as a first-class component of the representation. Building on this representational motivation, this thesis studies learning problems on hypergraph-structured …
-
Community detection in censored hypergraph
… detection problem in censored m-uniform hypergraphs. Firstly, utilizing an information-theoretic approach, we obtain a threshold that enables the exact recovery of the community structure. Then, we proposed a two-stage polynomial-time algorithm, which encompasses a spectral algorithm …
-
On Some Hypergraph Coloring Algorithms
… containing no copies of the Fano plane as a subhypergraph. Since the Fano plane is not bipartite, it holds that B_n ⊆ F_n, which Person and Schacht proved is nearly an equality (in a sense made precise later). They also established an algorithm which properly and minimally colors a given H ∈ F_n …
-
Hypergraph Turán Problems for Daisies
… century, the extremal properties of graphs (or hypergraphs) avoiding a fixed subgraph (or subhypergraph) have been extensively studied, up to the present day. This is the field of so-called ‘Turan problems’; it has had much impact on other areas of Mathematics, such as number theory and …
-
ALGORITHM FOR ENUMERATING HYPERGRAPH TRANSVERSALS
This paper introduces the hypergraph transversal problem along with thefollowing iterative solutions: naive, branch and bound, and dynamic exponentialtime (NC-D). Odometers are introduced along with the functions that manipulatethem. The traditional definitions of hyperedge, hypergraph, etc., are …
-
Formal group laws and hypergraph colorings
… group laws and chromatic symmetric functions of hypergraphs, two seemingly unrelated topics in the theory of symmetric functions. A formal group law is a symmetric function of the form $f(f^{-1}(x_1) + f^{-1}(x_2) + \cdots)$ for a formal power series $f(x) \in \mathbb{Q}[[x]]$. A …
-
Diversity embeddings and the hypergraph sparsest cut
… Tupper showed that this approach extends to the hypergraph setting by formulating a linear program whose solutions are diversities which are rounded via diversity embeddings into 𝓵1 [31]. Diversities are a generalization of metric spaces in which the nonnegative function is defined on all subsets …
-
Hypergraph modeling for saliency detection and beyond.
… analysis. In this work, we model an image as a hypergraph that utilizes a set of hyperedges to capture the contextual properties of image pixels or regions. As a result, the problem of salient object detection becomes one of finding salient vertices and hyperedges in the hypergraph. The main …
-
Quantum Query Complexity of Hypergraph Search Problems
… to detecting certain properties of higher rank hypergraphs and ask whether these techniques are still available. In this thesis, we will see that when the rank increase, complexity bounds still holds for some problems, although less effectively. For some other problems, their nontrivial …
-
On the Characteristic Polynomial of a Hypergraph
… adjacency characteristic polynomial of a uniform hypergraph. Computing the aforementioned polynomial is intractable, in general; however, we present two mechanisms for computing partial information about the spectrum of a hypergraph as well as a methodology (and in particular, an algo- rithm) for …
-
A Hypergraph Regularity Method for Linear Hypergraphs
… Theory and Theoretical Computer Science. Strong hypergraph extensions of graph regularity techniques were recently given by Nagle, Rödl, Schacht and Skokan, by W.T. Gowers, and subsequently, by T. Tao. These extensions have yielded quite a few non-trivial applications to Extremal Hypergraph …
-
Hypergraph-Based Interconnection Networks for Large Multicomputers
… that a new class of regular low-dimensional hypergraph networks, the distributed crossbar switch hypermesh (DCSH), represents a promising alternative high-performance interconnection network for future large multicomputers to graph networks such as meshes, tori, and binary n-cubes, which have …
-
Phylogenetic decisiveness and no-rainbow hypergraph coloring
… Here we relate the decisiveness problem to a hypergraph coloring problem. We use this connection to (1) show that the decisiveness problem is co-NP complete, (2) obtain lower bounds on the amount of coverage needed to achieve decisiveness, (3) devise an exact algorithm for decisiveness, (4) …
-
Temporal hypergraph modeling via inter-geometrical learning
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2024-09-16 without embargo terms
-
An effective algorithm for multiway hypergraph partitioning
The problem of hypergraph partitioning has been around for more than a quarter of a century. Its early applications were centered on VLSI circuit design. In recent years, the application of hypergraph partitioning has been extended into the areas including data classifications, efficient storage of …
-
Towards scalable hypergraph processing algorithms and their applications
… relations are expressed more naturally as hypergraphs. While hypergraphs are a generalization of graphs, state-of-the-art graph techniques are not adequate for solving large hypergraph tasks accurately in a reasonable time. Moreover, the field of hypergraph processing, such as learning and …
-
Data mining techniques for graph and hypergraph analysis
… belong to multiple groups simultaneously. The hypergraph structure has been extensively considered to model such higher-order relationships, wherein hyperedges can connect an arbitrary number of nodes. This thesis focuses on developing scalable and interpretable data mining algorithms for graph …
-
Hypergraph Analytics: Modeling Higher-Order Structures And Probabilities
… involve all members of a set, hyperedges in a Hypergraph are more natural representations. Hypergraphs are less known graph-theoretic structure as compared to graphs. Because of this popularity graphs have been employed prolifically to model data of all kinds. Little attention is given to the …
-
The 2-Core of a Random Inhomogeneous Hypergraph
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 …
Page 1 of 16