SNE: Signed Network Embedding

Several network embedding models have been developed for unsigned networks. However, these models based on skip-gram cannot be applied to signed networks because they can only deal with one type of link. In this paper, we present our signed network embedding model called SNE. Our SNE adopts the log-bilinear model, uses node representations of all nodes along a given path, and further incorporates two signed-type vectors to capture the positive or negative relationship of each edge along the path. We conduct two experiments, node classification and link prediction, on both directed and undirected signed networks and compare with four baselines including a matrix factorization method and three state-of-the-art unsigned network embedding models. The experimental results demonstrate the effectiveness of our signed network embedding.Comment: To appear in PAKDD 201

Complex-valued information entropy measure for networks with directed links (digraphs). Application to citations by community agents with opposite opinions

The notion of complex-valued information entropy measure is presented. It applies in particular to directed networks (digraphs). The corresponding statistical physics notions are outlined. The studied network, serving as a case study, in view of illustrating the discussion, concerns citations by agents belonging to two distinct communities which have markedly different opinions: the Neocreationist and Intelligent Design Proponents, on one hand, and the Darwinian Evolution Defenders, on the other hand. The whole, intra- and inter-community adjacency matrices, resulting from quotations of published work by the community agents, are elaborated and eigenvalues calculated. Since eigenvalues can be complex numbers, the information entropy may become also complex-valued. It is calculated for the illustrating case. The role of the imaginary part finiteness is discussed in particular and given some physical sense interpretation through local interaction range consideration. It is concluded that such generalizations are not only interesting and necessary for discussing directed networks, but also may give new insight into conceptual ideas about directed or other networks. Notes on extending the above to Tsallis entropy measure are found in an Appendix.Comment: 26 pages, 5 figures, 4 Tables, 72 refs.; submitted to EPJ

Clustering and Community Detection in Directed Networks: A Survey

Networks (or graphs) appear as dominant structures in diverse domains, including sociology, biology, neuroscience and computer science. In most of the aforementioned cases graphs are directed - in the sense that there is directionality on the edges, making the semantics of the edges non symmetric. An interesting feature that real networks present is the clustering or community structure property, under which the graph topology is organized into modules commonly called communities or clusters. The essence here is that nodes of the same community are highly similar while on the contrary, nodes across communities present low similarity. Revealing the underlying community structure of directed complex networks has become a crucial and interdisciplinary topic with a plethora of applications. Therefore, naturally there is a recent wealth of research production in the area of mining directed graphs - with clustering being the primary method and tool for community detection and evaluation. The goal of this paper is to offer an in-depth review of the methods presented so far for clustering directed networks along with the relevant necessary methodological background and also related applications. The survey commences by offering a concise review of the fundamental concepts and methodological base on which graph clustering algorithms capitalize on. Then we present the relevant work along two orthogonal classifications. The first one is mostly concerned with the methodological principles of the clustering algorithms, while the second one approaches the methods from the viewpoint regarding the properties of a good cluster in a directed network. Further, we present methods and metrics for evaluating graph clustering results, demonstrate interesting application domains and provide promising future research directions.Comment: 86 pages, 17 figures. Physics Reports Journal (To Appear

From Network Structure to Dynamics and Back Again: Relating dynamical stability and connection topology in biological complex systems

The recent discovery of universal principles underlying many complex networks occurring across a wide range of length scales in the biological world has spurred physicists in trying to understand such features using techniques from statistical physics and non-linear dynamics. In this paper, we look at a few examples of biological networks to see how similar questions can come up in very different contexts. We review some of our recent work that looks at how network structure (e.g., its connection topology) can dictate the nature of its dynamics, and conversely, how dynamical considerations constrain the network structure. We also see how networks occurring in nature can evolve to modular configurations as a result of simultaneously trying to satisfy multiple structural and dynamical constraints. The resulting optimal networks possess hubs and have heterogeneous degree distribution similar to those seen in biological systems.Comment: 15 pages, 6 figures, to appear in Proceedings of "Dynamics On and Of Complex Networks", ECSS'07 Satellite Workshop, Dresden, Oct 1-5, 200