89 citations · 149 across the 8 of their papers we have counts for
8 papers
Communities as Well Separated Subgraphs With Cohesive Cores: Identification of Core-Periphery Structures in Link Communities
Frank Havemann, Jochen Gläser, Michael Heinz
Communities in networks are commonly considered as highly cohesive subgraphs which are well separated from the rest of the network. However, cohesion and separation often cannot be…
Memetic search for overlapping topics based on a local evaluation of link communities
Frank Havemann, Jochen Gläser, Michael Heinz
In spite of recent advances in field delineation methods, bibliometricians still don't know the extent to which their topic detection algorithms reconstruct `ground truths', i.e. t…
Detecting Overlapping Link Communities by Finding Local Minima of a Cost Function with a Memetic Algorithm. Part 1: Problem and Method
Frank Havemann, Jochen Gläser, Michael Heinz
We propose an algorithm for detecting communities of links in networks which uses local information, is based on a new evaluation function, and allows for pervasive overlaps of com…
Estimating Thematic Similarity of Scholarly Papers with Their Resistance Distance in an Electric Network Model
Frank Havemann, Michael Heinz, Jochen Gläser +1
We calculate resistance distances between papers in a nearly bipartite citation network of 492 papers and the sources cited by them. We validate that this is a realistic measure of…
Evaluating Overlapping Communities with the Conductance of their Boundary Nodes
Frank Havemann, Jochen Gläser, Michael Heinz +1
Usually the boundary of a community in a network is drawn between nodes and thus crosses its outgoing links. If we construct overlapping communities by applying the link-clustering…
Identifying Overlapping and Hierarchical Thematic Structures in Networks of Scholarly Papers: A Comparison of Three Approaches
Frank Havemann, Jochen Gläser, Michael Heinz +1
We implemented three recently proposed approaches to the identification of overlapping and hierarchical substructures in graphs and applied the corresponding algorithms to a networ…
Identification of overlapping communities and their hierarchy by locally calculating community-changing resolution levels
Frank Havemann, Michael Heinz, Alexander Struck +1
We propose a new local, deterministic and parameter-free algorithm that detects fuzzy and crisp overlapping communities in a weighted network and simultaneously reveals their hiera…
Identification of Overlapping Communities by Locally Calculating Community-Changing Resolution Levels
Frank Havemann, Michael Heinz, Alexander Struck +1
An algorithm for the detection of overlapping natural communities in networks was proposed by Lancichinetti, Fortunato, and Kertesz (LFK) last year. The LFK algorithm constructs na…