Background and aims Since its emergence in the mid‐20th century, invasion biology has matured into a productive research field addressing questions of fundamental and applied importance. Not only has the number of empirical studies increased through time, but also has the number of competing, overlapping and, in some cases, contradictory hypotheses about biological invasions. To make these contradictions and redundancies explicit, and to gain insight into the field’s current theoretical structure, we developed and applied a Delphi approach to create a consensus network of 39 existing invasion hypotheses. Results The resulting network was analysed with a link‐clustering algorithm that revealed five concept clusters (resource availability, biotic interaction, propagule, trait and Darwin’s clusters) representing complementary areas in the theory of invasion biology. The network also displays hypotheses that link two or more clusters, called connecting hypotheses , which are important in determining network structure. The network indicates hypotheses that are logically linked either positively (77 connections of support) or negatively (that is, they contradict each other; 6 connections). Significance The network visually synthesizes how invasion biology’s predominant hypotheses are conceptually related to each other, and thus, reveals an emergent structure – a conceptual map – that can serve as a navigation tool for scholars, practitioners and students, both inside and outside of the field of invasion biology, and guide the development of a more coherent foundation of theory. Additionally, the outlined approach can be more widely applied to create a conceptual map for the larger fields of ecology and biogeography.

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 hierarchy. Using a local fitness function, the algorithm greedily expands natural communities of seeds until the whole graph is covered. The hierarchy of communities is obtained analytically by calculating resolution levels at which communities grow rather than numerically by testing different resolution levels. This analytic procedure is not only more exact than its numerical alternatives such as LFM and GCE but also much faster. Critical resolution levels can be identified by searching for intervals in which large changes of the resolution do not lead to growth of communities. We tested our algorithm on benchmark graphs and on a network of 492 papers in information science. Combined with a specific post-processing, the algorithm gives much more precise results on LFR benchmarks with high overlap compared to other algorithms and performs very similar to GCE. PACS numbers: 89.75.Hc, 02.10.Ox, 89.75.Fb Submitted to: J. Stat. Mech. arXiv:1012.1269v1 [physics.data-an] 6 Dec 2010 ‡ Some of the results presented were also shown on a poster with the title A local algorithm to get overlapping communities at all resolution levels in one run at ASONAM conference, Odense, Denmark, August 2010 [8].

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. thematic structures in the scientific literature. In this paper, we demonstrate a new approach to the delineation of thematic structures that attempts to match the algorithm to theoretically derived and empirically observed properties all thematic structures have in common. We cluster citation links rather than publication nodes, use predominantly local information and search for communities of links starting from seed subgraphs in order to allow for pervasive overlaps of topics. We evaluate sets of links with a new cost function and assume that local minima in the cost landscape correspond to link communities. Because this cost landscape has many local minima we define a valid community as the community with the lowest minimum within a certain range. Since finding all valid communities is impossible for large networks, we designed a memetic algorithm that combines probabilistic evolutionary strategies with deterministic local searches. We apply our approach to a

Invasion biology has been quickly expanding in the last decades so that it is now metaphorically flooded with publications, concepts, and hypotheses. Among experts, there is no clear consensus about the relationships between invasion concepts, and almost no one seems to have a good overview of the literature anymore. Similar observations can be made for other research fields. Science needs new navigation tools so that researchers within and outside of a research field as well as science journalists, students, teachers, practitioners, policy-makers, and others interested in the field can more easily understand its key ideas. Such navigation tools could, for example, be maps of the major concepts and hypotheses of a research field. Applying a bibliometric method, we created such maps for invasion biology. We analysed research papers of the last two decades citing at least two of 35 common invasion hypotheses. Co-citation analysis yields four distinct clusters of hypotheses. These clusters can describe the main directions in invasion biology and explain basic driving forces behind biological invasions. The method we outline here for invasion biology can be easily applied for other research fields.

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 maximized at the same time, which is why a compromise is sought by some methods. When a compromise is not suitable for the problem to be solved it might be advantageous to separate the two criteria. In this paper, we explore such an approach by defining communities as well separated subgraphs which can have one or more cohesive cores surrounded by peripheries. We apply this idea to link communities and present an algorithm for constructing hierarchical core-periphery structures in link communities and first test results.

; Stanley et al., 1996). With such an approach, they examined the growth dynamics of firms, of national economies, and of university research fundings and paper output. We investigated the scaling properties of journal output and impact according to the Journal Citation Reports (JCR; ISI, Philadelphia, PA) and find distributions of paper output and of citations near to lognormality. Growth rate distributions are near to Laplace "tents," however with a better fit to Subbotin distributions. The width of fluctuations decays with size according to a power law. The form of growth rate distributions seems not to depend on journal size, and conditional probability densities of the growth rates can thus be scaled onto one graph. To some extent even quantitatively, all our results are in agreement with the observations of Stanley and others. Further on, a Matthew effect of journal citations is confirmed. If journals "behave" like business firms, a better understanding of Bradford's Law as a result of competition among publishing houses, journals, and topics suggests itself.

Background: The hypothesis that distance matters but that in recent years geographical proximity has become less important for research collaboration was tested. We have chosen a sample-authors at German immunological institutes-that is relatively homogeneous with regard to research field, language and culture, which beside distance are other possible factors influencing the willingness to co-operate. We analyse yearly distributions of co-authorship links between institutes and compare them with the yearly distributions of distances of all institutes producing papers in journals indexed in the Science Citation Index, editions 1992 till 2002. We weight both types of distributions properly with paper numbers.

The aim of this paper is to introduce and assess three algorithms for the identification of overlapping thematic structures in networks of papers. We implemented three recently proposed approaches to the identification of overlapping and hierarchical substructures in graphs and applied the corresponding algorithms to a network of 492 information-science papers coupled via their cited sources. The thematic substructures obtained and overlaps produced by the three hierarchical cluster algorithms were compared to a content-based categorisation, which we based on the interpretation of titles, abstracts, and keywords. We defined sets of papers dealing with three topics located on different levels of aggregation: h-index, webometrics, and bibliometrics. We identified these topics with branches in the dendrograms produced by the three cluster algorithms and compared the overlapping topics they detected with one another and with the three predefined paper sets. We discuss the advantages and drawbacks of applying the three approaches to paper networks in research fields.