Aric Hagberg

A Principal Component Analysis of 39 Scientific Impact Measures

Background The impact of scientific publications has traditionally been expressed in terms of citation counts. However, scientific activity has moved online over the past decade. To better capture scientific impact in the digital era, a variety of new impact measures has been proposed on the basis of social network analysis and usage log data. Here we investigate how these new measures relate to each other, and how accurately and completely they express scientific impact. Methodology We performed a principal component analysis of the rankings produced by 39 existing and proposed measures of scholarly impact that were calculated on the basis of both citation and usage log data. Conclusions Our results indicate that the notion of scientific impact is a multi-dimensional construct that can not be adequately measured by any single indicator, although some measures are more suitable than others. The commonly used citation Impact Factor is not positioned at the core of this construct, but at its periphery, and should thus be used with caution.

Clickstream data yields high-resolution maps of science

Background Intricate maps of science have been created from citation data to visualize the structure of scientific activity. However, most scientific publications are now accessed online. Scholarly web portals record detailed log data at a scale that exceeds the number of all existing citations combined. Such log data is recorded immediately upon publication and keeps track of the sequences of user requests (clickstreams) that are issued by a variety of users across many different domains. Given these advantages of log datasets over citation data, we investigate whether they can produce high-resolution, more current maps of science. Methodology Over the course of 2007 and 2008, we collected nearly 1 billion user interactions recorded by the scholarly web portals of some of the most significant publishers, aggregators and institutional consortia. The resulting reference data set covers a significant part of world-wide use of scholarly web portals in 2006, and provides a balanced coverage of the humanities, social sciences, and natural sciences. A journal clickstream model, i.e. a first-order Markov chain, was extracted from the sequences of user interactions in the logs. The clickstream model was validated by comparing it to the Getty Research Institutes Architecture and Art Thesaurus. The resulting model was visualized as a journal network that outlines the relationships between various scientific domains and clarifies the connection of the social sciences and humanities to the natural sciences. Conclusions Maps of science resulting from large-scale clickstream data provide a detailed, contemporary view of scientific activity and correct the underrepresentation of the social sciences and humanities that is commonly found in citation data.

Separating the wheat from the chaff: practical anomaly detection schemes in ecological applications of distributed sensor networks

We develop a practical, distributed algorithm to detect events, identify measurement errors, and infer missing readings in ecological applications of wireless sensor networks. To address issues of non-stationarity in environmental data streams, each sensor-processor learns statistical distributions of differences between its readings and those of its neighbors, as well as between its current and previous measurements. Scalar physical quantities such as air temperature, soil moisture, and light flux naturally display a large degree of spatiotemporal coherence, which gives a spectrum of fluctuations between adjacent or consecutive measurements with small variances. This feature permits stable estimation over a small state space. The resulting probability distributions of differences, estimated online in real time, are then used in statistical significance tests to identify rare events. Utilizing the spatio-temporal distributed nature of the measurements across the network, these events are classified as single mode failures - usually corresponding to measurement errors at a single sensor - or common mode events. The event structure also allows the network to automatically attribute potential measurement errors to specific sensors and to correct them in real time via a combination of current measurements at neighboring nodes and the statistics of differences between them. Compared to methods that use Bayesian classification of raw data streams at each sensor, this algorithm is more storage-efficient, learns faster, and is more robust in the face of non-stationary phenomena. Field results from a wireless sensor network (Sensor Web) deployed at Sevilleta National Wildlife Refuge are presented.

Complex patterns in reaction-diffusion systems: A tale of two front instabilities.

Two front instabilities in a reaction-diffusion system are shown to lead to the formation of complex patterns. The first is an instability to transverse modulations that drives the formation of labyrinthine patterns. The second is a nonequilibrium Ising-Bloch (NIB) bifurcation that renders a stationary planar front unstable and gives rise to a pair of counterpropagating fronts. Near the NIB bifurcation the relation of the front velocity to curvature is highly nonlinear and transitions between counterpropagating fronts become feasible. Nonuniformly curved fronts may undergo local front transitions that nucleate spiral-vortex pairs. These nucleation events provide the ingredient needed to initiate spot splitting and spiral turbulence. Similar spatiotemporal processes have been observed recently in the ferrocyanide-iodate-sulfite reaction.

Gradual regime shifts in spatially extended ecosystems

Ecosystem regime shifts are regarded as abrupt global transitions from one stable state to an alternative stable state, induced by slow environmental changes or by global disturbances. Spatially extended ecosystems, however, can also respond to local disturbances by the formation of small domains of the alternative state. Such a response can lead to gradual regime shifts involving front propagation and the coalescence of alternative-state domains. When one of the states is spatially patterned, a multitude of intermediate stable states appears, giving rise to step-like gradual shifts with extended pauses at these states. Using a minimal model, we study gradual state transitions and show that they precede abrupt transitions. We propose indicators to probe gradual regime shifts, and suggest that a combination of abrupt-shift indicators and gradual-shift indicators might be needed to unambiguously identify regime shifts. Our results are particularly relevant to desertification in drylands where transitions to bare soil take place from spotted vegetation, and the degradation process appears to involve step-like events of local vegetation mortality caused by repeated droughts.

Rewiring networks for synchronization.

We study the synchronization of identical oscillators diffusively coupled through a network and examine how adding, removing, and moving single edges affects the ability of the network to synchronize. We present algorithms which use methods based on node degrees and based on spectral properties of the network Laplacian for choosing edges that most impact synchronization. We show that rewiring based on the network Laplacian eigenvectors is more effective at enabling synchronization than methods based on node degree for many standard network models. We find an algebraic relationship between the eigenstructure before and after adding an edge and describe an efficient algorithm for computing Laplacian eigenvalues and eigenvectors that uses the network or its complement depending on which is more sparse.

Efficient generation of networks with given expected degrees

We present an efficient algorithm to generate random graphs with a given sequence of expected degrees. Existing algorithms run in O(N2) time where N is the number of nodes. We prove that our algorithm runs in O(N +M) expected time where M is the expected number of edges. If the expected degrees are chosen from a distribution with finite mean, this is O(N) as N → ∞.

The Structure of Geographical Threshold Graphs

We analyze the structure of random graphs generated by the geographical threshold model. The model is a generalization of random geometric graphs. Nodes are distributed in space, and edges are assigned according to a threshold function involving the distance between nodes as well as randomly chosen node weights. We show how the degree distribution, percolation and connectivity transitions, clustering coefficient, and diameter relate to the threshold value and weight distribution. We give bounds on the threshold value guaranteeing the presence or absence of a giant component, connectivity and disconnectivity of the graph, and small diameter. Finally, we consider the clustering coefficient for nodes with a given degree l, finding that its scaling is very close to 1/l when the node weights are exponentially distributed.

Development of Standing-Wave Labyrinthine Patterns ∗

Experiments on a quasi-two-dimensional Belousov-Zhabotinsky (BZ) reaction-diffusion system, pe- riodically forced at approximately twice its natural frequency, exhibit resonant labyrinthine patterns that develop through two distinct mechanisms. In both cases, large amplitude labyrinthine patterns f orm that consist ofinterpenetrating fingers off requency-locked regions differing in phase by π. Analysis of a forced complex Ginzburg-Landau equation captures both mechanisms observed for the f ormation ofthe labyrinths in the BZ experiments: a transverse instability off ront structures and a nucleation of stripes from unlocked oscillations. The labyrinths are found in the experiments and in the model at a similar location in the forcing amplitude and frequency parameter plane.

Component Evolution in General Random Intersection Graphs

Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sensor networks. RIGs can be interpreted as a model for large randomly formed non-metric data sets. We analyze the component evolution in general RIGs, giving conditions on the existence and uniqueness of the giant component. Our techniques generalize existing methods for analysis of component evolution: we analyze survival and extinction properties of a dependent, inhomogeneous Galton-Watson branching process on general RIGs. Our analysis relies on bounding the branching processes and inherits the fundamental concepts of the study of component evolution in Erdős-Renyi graphs. The major challenge comes from the underlying structure of RIGs, which involves both a set of nodes and a set of attributes, with different probabilities associated with each attribute.