3 papers
cs.SI2018
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…
cs.SI2017
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…
cs.DL2013
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…