相关论文: Finding large balanced subgraphs in signed network…

Signed Graph Neural Networks (SGNNs) have recently gained attention as an effective tool for several learning tasks on signed networks, i.e., graphs where edges have an associated polarity. One of these tasks is to predict the polarity of…

Signed graphs are well-suited for modeling social networks as they capture both positive and negative relationships. Signed graph neural networks (SGNNs) are commonly employed to predict link signs (i.e., positive and negative) in such…

There is a long-standing belief that in social networks with simultaneous friendly/hostile interactions (signed networks) there is a general tendency to a global balance. Balance represents a state of the network with lack of contentious…

Deep graph neural networks (GNNs) often suffer from oversmoothing, where node representations become overly homogeneous with increasing depth. While techniques like normalization, residual connections, and edge dropout have been proposed to…

Signed graphs serve as fundamental data structures for representing positive and negative relationships in social networks, with signed graph neural networks (SGNNs) emerging as the primary tool for their analysis. Our investigation reveals…

Signed graph clustering is a critical technique for discovering community structures in graphs that exhibit both positive and negative relationships. We have identified two significant challenges in this domain: i) existing signed spectral…

We consider graphs without loops or parallel edges in which every edge is assigned + or -. Such a signed graph is balanced if its vertex set can be partitioned into parts $V_1$ and $V_2$ such that all edges between vertices in the same part…

Signed networks contain both positive and negative kinds of interactions like friendship and enmity. The task of node classification in non-signed graphs has proven to be beneficial in many real world applications, yet extensions to signed…

According to the structural balance theory, a signed graph is considered structurally balanced when it can be partitioned into a number of modules such that positive and negative edges are respectively located inside and between the…

Social networks and interactions in social media involve both positive and negative relationships. Signed graphs capture both types of relationships: positive edges correspond to pairs of "friends", and negative edges to pairs of "foes".…

A graph is a split graph if its vertex set can be partitioned into a clique and a stable set. A split graph is unbalanced if there exist two such partitions that are distinct. Cheng, Collins and Trenk (2016), discovered the following…

The problem of representing nodes in a signed network as low-dimensional vectors, known as signed network embedding (SNE), has garnered considerable attention in recent years. While several SNE methods based on graph convolutional networks…

Motivated by performance optimization of large-scale graph processing systems that distribute the graph across multiple machines, we consider the balanced graph partitioning problem. Compared to the previous work, we study the…

A signed graph has edge weights drawn from the set $\{+1,-1\}$, and is termed sign-balanced if it is equivalent to an unsigned graph under the operation of sign switching; otherwise it is called sign-unbalanced. A nut graph has a one…

One of the major challenges in applications related to social networks, computational biology, collaboration networks etc., is to efficiently search for similar patterns in their underlying graphs. These graphs are typically noisy and…

Studying significant network patterns, known as graphlets (or motifs), has been a popular approach to understand the underlying organizing principles of complex networks. Statistical significance is routinely assessed by comparing to null…

In complex networks, especially social networks, networks could be divided into disjoint partitions that the ratio between the number of internal edges (the edges between the vertices within same partition) to the number of outer edges…

The Maximum Balanced Subgraph Problem (MBSP) is the problem of finding a subgraph of a signed graph that is balanced and maximizes the cardinality of its vertex set. We are interested in the exact solution of the problem: an improved…

In order to study real-world systems, many applied works model them through signed graphs, i.e. graphs whose edges are labeled as either positive or negative. Such a graph is considered as structurally balanced when it can be partitioned…

Signed networks appear naturally in contexts where conflict or animosity is apparent. In this book chapter we review some of the literature on signed networks, especially in the context of partitioning. Most of the work is founded in what…