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 6 of 6 for “"Hyperedge"”.

  1. Multimodal Networks in Biology

    … V is a set of vertices, E is a set of modal hyperedges, and M is a set of modes. A modal hyperedge e=(T,H,A,m) in E is an ordered 4-tuple, in which T,H,A are subsets of V and m is an element of M. The sets T, H, and A are the tail, head, and associate of e, while m is its mode. In the context …

    vt Repository record for Multimodal Networks in Biology (opens in a new tab)

  2. Learning on Inhomogeneous Hypergraphs

    … where the notion of an edge is generalized to a hyperedge that can connect more than two vertices. Traditional hypergraph models treat all the vertices in a hyperedge equally while in practice these vertices might contribute differently to the hyperedge. To deal with such cases, edge-dependent …

    rice Repository record for Learning on Inhomogeneous Hypergraphs (opens in a new tab)

  3. Graph connectivity and vector degree in motif-based graphs

    … with novel representations, like motif-edge or hyperedge. By replacing standard edges with motif-edges, the graph succeeds in describing the higher-order complex networks. However, a problem of connectivity in motif-based graphs also arises because generated motif-based graphs can be …

    uiuc Repository record for Graph connectivity and vector degree in motif-based graphs (opens in a new tab)

  4. Analyzing Networks with Hypergraphs: Detection, Classification, and Prediction

    … accounts are nodes and their interactions form hyperedges, capturing the intricate relationships between users. 2) Developing HyperSMOTE to generate synthetic bot accounts within the hypergraph, ensuring a balanced training dataset while preserving the hypergraph's structure and semantics. 3) …

    vt Repository record for Analyzing Networks with Hypergraphs: Detection, Classification, and Prediction (opens in a new tab)

  5. Using hypergraph theory to model coexistence management and coordinated spectrum allocation for heterogeneous wireless networks operating in shared spectrum

    … generalisation of an undirected graph in which a hyperedge can connect more than two entities. Therefore, this thesis investigates the use of hypergraph theory to model the RF environment and the spectrum allocation scheme.The hypergraph model was applied to an algorithm for spectrum sharing among …

    strathclyde Repository record for Using hypergraph theory to model coexistence management and coordinated spectrum allocation for heterogeneous wireless networks operating in shared spectrum (opens in a new tab)

  6. Unstable Communities in Network Ensembles

    Ensembles of graphs arise naturally in many applications, for example, the temporal evolution of social contacts or computer communications, tissue-specific protein interaction networks, annual citation or co-authorship networks in a field, or a family of high-likelihood Bayesian networks inferred …

    vt Repository record for Unstable Communities in Network Ensembles (opens in a new tab)