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 30 for “"Signed Graph"”.

  1. Signed Graph Representation Learning

    This thesis considers the research on signed graph representation learning in different aspects. Signed graphs model complex relations using both positive and negative edges and signed graph neural networks (SGNNs) are powerful tools to analyze signed graphs. Our thesis mainly involves the research …

    auckland-ms Repository record for Signed Graph Representation Learning (opens in a new tab)

  2. Signed Graph-Based Recommendation Systems

    … on user behavior and historical information. A graph-based recommendation system with user ratings on items can be represented as a bipartite graph, with nodes corresponding to users and items, and edges corresponding to ratings. Item-based recommendation systems use item-item similarity to …

    queens Repository record for Signed Graph-Based Recommendation Systems (opens in a new tab)

  3. Flows on Signed Graphs

    … focuses on integer flow problems within specific signed graphs. The theory of integer flows, which serves as a dual problem to vertex coloring of planar graphs, was initially introduced by Tutte as a tool related to the Four-Color Theorem. This theory has been extended to signed graphs. In 1983, …

    wvu Repository record for Flows on Signed Graphs (opens in a new tab)

  4. A Generalization to Signed Graphs of a Theorem of Sergey Norin and Robin Thomas

    … the minimal non-planar extensions of a signed graph. We consider the following question: Given a subdivision of a planar signed graph (G, Σ), what are the minimal structures that can be added to the subdivision to make it non-planar? Sergey Norin and Robin Thomas answered this question …

    waterloo Repository record for A Generalization to Signed Graphs of a Theorem of Sergey Norin and Robin Thomas (opens in a new tab)

  5. On Excluded Minors for Even Cut Matroids

    … minor minimal non even cut matroids. Given any signed graph we can associate an even cut matroid. However, given an even cut matroid, there are in general, several signed graphs which represent that matroid. This is in contrast to, for instance graphic (or cographic) matroids, where all graphs …

    waterloo Repository record for On Excluded Minors for Even Cut Matroids (opens in a new tab)

  6. Extensions of Signed Graphs

    Given a signed graph (G, Σ) with an embedding on a surface S, we are interested in "extending" (G, Σ) by adding edges and splitting vertices, such that the resulting graph has no embedding on S. We show (assuming 3-connectivity for (G, Σ)) that there are a small number of minimal extensions of (G, …

    waterloo Repository record for Extensions of Signed Graphs (opens in a new tab)

  7. The Cycling Property for the Clutter of Odd st-Walks

    … We prove that the clutter of odd st- walks of a signed graph is cycling if and only if it does not contain as a minor the clutter of odd circuits of K5 nor the clutter of lines of the Fano matroid. Corollaries of this result include, of many, the characterization for weakly bipartite signed …

    waterloo Repository record for The Cycling Property for the Clutter of Odd st-Walks (opens in a new tab)

  8. Scalable and Robust Solutions for NP-Hard Problems in Large Signed Networks

    Signed graphs provide a robust framework for modeling complex relationships and interdependencies among entities. Negative edges in these graphs offer deeper insights into social dynamics and nuanced interactions. A highly efficient method for discovering the fundamental cycle basis in signed …

    texas-state Repository record for Scalable and Robust Solutions for NP-Hard Problems in Large Signed Networks (opens in a new tab)

  9. Dimer models for knot polynomials

    … all perfect matchings on a (bipartite) weighted signed graph, where the product of the signed weights of each perfect matching is summed to obtain an invariant. In this paper, the construction of such a graph from a knot diagram is given to obtain the Alexander polynomial. This is further …

    lsu-thes Repository record for Dimer models for knot polynomials (opens in a new tab)

  10. Identification of Dichotomous Communities in Signed Graphs Using Coherence-Based Metrics

    … extend a system of coherence-based metrics on signed graphs. We apply these metrics to the problems of community identification, error correction, and analysis of anomalous real-world data. We begin by exploring the distribution of "nearby" balanced states of signed balanced graphs and …

    texas-state Repository record for Identification of Dichotomous Communities in Signed Graphs Using Coherence-Based Metrics (opens in a new tab)

  11. Chip-Firing on Signed Graphs

    Graphical chip-firing is a process where ‘chips’ are exchanged between vertices of a graph, the dynamics of which are governed by the graph Laplacian. Chip-firing is a well-developed field with applications to physics, computer science, and many areas of mathematics. Guzmán and Klivans introduced a …

    texas-state Repository record for Chip-Firing on Signed Graphs (opens in a new tab)

  12. Representations of even-cycle and even-cut matroids

    … with problems which are related to their graphical representations. Even-cycle and even-cut matroids can be represented as signed graphs and grafts, respectively. A signed graph is a pair $(G,\Sigma)$ where $G$ is a graph and $\Sigma$ is a subset of edges of $G$. A cycle $C$ of $G$ is a …

    waterloo Repository record for Representations of even-cycle and even-cut matroids (opens in a new tab)

  13. Characterizations of Some Combinatorial Geometries

    … is isomorphic to the contraction G/y. Given a signed graph, we define a corresponding signed—graphic geometry. We give a characterization of supersolvable signed graphs. Finally, we give the following characterization of non—splitting supersolvable signed-graphic geometries : If a non-splitting …

    unt Repository record for Characterizations of Some Combinatorial Geometries (opens in a new tab)

  14. Stability thresholds for signed Laplacians on locally-connected networks

    … bifurcations of the dynamical systems defined on graphs, and we use signed graph Laplacians as our tool. In chapter 1, we give the formal definition of the Laplacian matrix for a graph, and point out several references on it. In chapter 2, we give the main result from one of the references, along …

    uiuc Repository record for Stability thresholds for signed Laplacians on locally-connected networks (opens in a new tab)

  15. Normal Domains Arising from Graph Theory

    … that assigns an edge in a mixed directed signed graph to each monomial of the ring. We then use this relationship to provide a combinatorial characterization of the normality of R, and, when R is not normal, we use the combinatorial characterization to compute the normalization of R. Using …

    clemson Repository record for Normal Domains Arising from Graph Theory (opens in a new tab)

  16. Statistical analysis for modeling dyadic interactions using machine learning methods

    … for several motivating applications, including signed link prediction, signed graph clustering, and dyadic rank aggregation. We then further move from an application-specific aspect to a general modeling aspect, where we aim to jointly exploit prior knowledge, problem structure and side …

    texas Repository record for Statistical analysis for modeling dyadic interactions using machine learning methods (opens in a new tab)

  17. The Linkage Problem for Group-labelled Graphs

    … thesis aims to extend some of the results of the Graph Minors Project of Robertson and Seymour to "group-labelled graphs". Let $\Gamma$ be a group. A $\Gamma$-labelled graph is an oriented graph with its edges labelled from $\Gamma$, and is thus a generalization of a signed graph. Our primary …

    waterloo Repository record for The Linkage Problem for Group-labelled Graphs (opens in a new tab)

  18. Even Cycle and Even Cut Matroids

    … even cut matroids. They are a generalization of graphic and cographic matroids respectively. We focus on two main problems for these classes of matroids. We first consider the Isomorphism Problem, that is the relation between two representations of the same matroid. A representation of an even …

    waterloo Repository record for Even Cycle and Even Cut Matroids (opens in a new tab)

  19. Signal processing on graphs : community detection and graph learning for multilayer networks

    Community detection and graph learning are two important problems in graph analysis. The former problem deals with topological analysis of graphs to identify their mesoscale organization; while graph learning aims to infer the interactions between nodes of a graph from data when the graph topology …

    msu Repository record for Signal processing on graphs : community detection and graph learning for multilayer networks (opens in a new tab)

  20. Algorithmic Tools for Network Analysis

    … of the sandpile instance on various classes of graphs, solving the \textit{sandpile prediction} problem on: (1) general graphs, with further analyses on regular graphs, expander graphs, and hypercubes. (2) trees and paths, surpassing previous methods in time complexity. To analyze the structure …

    waterloo Repository record for Algorithmic Tools for Network Analysis (opens in a new tab)

Page 1 of 2