Related papers: A modelling and computational study of the frustra…
This paper proposes a novel signed $\beta$-model for directed signed network, which is frequently encountered in application domains but largely neglected in literature. The proposed signed $\beta$-model decomposes a directed signed network…
Frustration, or the competition between interacting components of a network, is often responsible for the complexity of many body systems, from social and neural networks to protein folding and magnetism. In quantum magnetic systems,…
According to the so-called strong version of structural balance theory, actors in signed social networks avoid establishing triads with an odd number of negative links. Generalising, the weak version of balance theory allows for nodes to be…
A signed graph $(G,\Sigma)$ is a graph $G$ together with a set $\Sigma \subseteq E(G)$ of negative edges. A circuit is positive if the product of the signs of its edges is positive. A signed graph $(G,\Sigma)$ is balanced if all its…
Geometrically frustrated assemblies where building blocks misfit have been shown to generate intriguing phenomena from self-limited growth, fiber formation, to structural complexity. We introduce a graph theory formulation of geometrically…
A framework for studying the behavior of a classically frustrated signed network in the process of random rewiring is developed. We describe jump probabilities for change in frustration and formulate a theoretical estimate in terms of the…
Signed networks provide a principled framework for representing systems in which interactions are not merely present or absent but qualitatively distinct: friendly or antagonistic, supportive or conflicting, excitatory or inhibitory. This…
This study introduces GCO-HPIF, a general machine-learning-based framework to predict and explain the computational hardness of combinatorial optimization problems that can be represented on graphs. The framework consists of two stages. In…
This paper explores whether graph embedding methods can be used as a tool for analysing the robustness of power-grids within the framework of network science. The paper focuses on the strain elevation tension spring embedding (SETSe)…
Complex systems can be effectively modeled via graphs that encode networked interactions, where relations between entities or nodes are often quantified by signed edge weights, e.g., promotion/inhibition in gene regulatory networks, or…
Graph connectivity is a fundamental combinatorial optimization problem that arises in many practical applications, where usually a spanning subgraph of a network is used for its operation. However, in the real world, links may fail…
Graph pattern matching, which aims to discover structural patterns in graphs, is considered one of the most fundamental graph mining problems in many real applications. Despite previous efforts, existing systems face two main challenges.…
Graph neural networks (GNNs) have emerged as a powerful approach for solving many network mining tasks. However, learning on large graphs remains a challenge - many recently proposed scalable GNN approaches rely on an expensive…
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…
Geometric frustration leads to complex phases of matter with exotic properties. Antiferromagnets on triangular lattices and square ice are two simple models of geometrical frustration. We map their highly degenerated ground-state phase…
In matrix factorization, available graph side-information may not be well suited for the matrix completion problem, having edges that disagree with the latent-feature relations learnt from the incomplete data matrix. We show that removing…
Network reliability measures the probability that a target node is reachable from a source node in an uncertain graph, i.e., a graph where every edge is associated with a probability of existence. In this paper, we investigate the novel and…
After a short introduction on frustrated spin systems, we study in this chapter several two-dimensional frustrated Ising spin systems which can be exactly solved by using vertex models. We show that these systems contain most of the…
Signed link prediction in graphs is an important problem that has applications in diverse domains. It is a binary classification problem that predicts whether an edge between a pair of nodes is positive or negative. Existing approaches for…
We study the fault-tolerance of networks from both the structural and computational point of view using the minimum leaf number of the corresponding graph $G$, i.e. the minimum number of leaves of the spanning trees of $G$, and its…