Results 11 to 20 of about 70,457 (210)
Unifying Sparsest Cut, Cluster Deletion, and Modularity Clustering Objectives with Correlation Clustering [PDF]
Graph clustering, or community detection, is the task of identifying groups of closely related objects in a large network. In this paper we introduce a new community-detection framework called LambdaCC that is based on a specially weighted version of ...
Gleich, David +2 more
core +2 more sources
Partial containment control over signed graphs [PDF]
In this paper, we deal with the containment control problem in presence of antagonistic interactions. In particular, we focus on the cases in which it is not possible to contain the entire network due to a constrained number of control signals.
DeLellis, Pietro +3 more
core +2 more sources
TwitterMancer: predicting interactions on Twitter accurately [PDF]
This paper investigates the interplay between different types of user interactions on Twitter, with respect to predicting missing or unseen interactions.
Byers, John W. +3 more
core +1 more source
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs [PDF]
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolation lemma as described in (Mulmuley et al.
Datta, Samir +2 more
core +7 more sources
Simplicial and Cellular Trees [PDF]
Much information about a graph can be obtained by studying its spanning trees. On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension.
Duval, Art M. +2 more
core +2 more sources
Relevance of Negative Links in Graph Partitioning: A Case Study Using Votes From the European Parliament [PDF]
In this paper, we want to study the informative value of negative links in signed complex networks. For this purpose, we extract and analyze a collection of signed networks representing voting sessions of the European Parliament (EP).
Figueiredo, Rosa +3 more
core +3 more sources
Enabling Social Applications via Decentralized Social Data Management [PDF]
An unprecedented information wealth produced by online social networks, further augmented by location/collocation data, is currently fragmented across different proprietary services. Combined, it can accurately represent the social world and enable novel
Blackburn, Jeremy +3 more
core +1 more source
Laplacian matrices of weighted digraphs represented as quantum states
Representing graphs as quantum states is becoming an increasingly important approach to study entanglement of mixed states, alternate to the standard linear algebraic density matrix-based approach of study.
Adhikari, Bibhas +3 more
core +1 more source
Entropy-based randomisation of rating networks [PDF]
In the last years, due to the great diffusion of e-commerce, online rating platforms quickly became a common tool for purchase recommendations. However, instruments for their analysis did not evolve at the same speed.
Becatti, Carolina +2 more
core +2 more sources
Unsigned state models for the Jones polynomial
It is well a known and fundamental result that the Jones polynomial can be expressed as Potts and vertex partition functions of signed plane graphs. Here we consider constructions of the Jones polynomial as state models of unsigned graphs and show that ...
B. Bollobás +21 more
core +1 more source

