NetworkX is a Python language package for exploration and analysis of networks and network algorithms. The core package provides data structures for representing many types of networks, or graphs, including simple graphs, directed graphs, and graphs with parallel edges and self-loops. The nodes in NetworkX graphs can be any (hashable) Python object and edges can contain arbitrary data; this flexibility makes NetworkX ideal for representing networks found in many different scientific fields. In addition to the basic data structures many graph algorithms are implemented for calculating network properties and structure measures: shortest paths, betweenness centrality, clustering, and degree distribution and many more. NetworkX can read and write various graph formats for easy exchange with existing data, and provides generators for many classic graphs and popular graph models, such as the Erdos-Renyi, Small World, and Barabasi-Albert models. The ease-of-use and flexibility of the Python programming language together with connection to the SciPy tools make NetworkX a powerful tool for scientific computations. We discuss some of our recent work studying synchronization of coupled oscillators to demonstrate how NetworkX enables research in the field of computational networks.
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.
By Allon G. Percus, Milan Bradonjić & 1 more. We analyze the structure of random graphs generated by the geographical threshold model. The model is a generalization of random geometric...
We use the Swift-Hohenberg model and normal-form equations to study wave-number locking in two-dimensional systems as a result of one-dimensional spatially periodic weak forcing. The freedom of the system to respond in a direction transverse to the forcing leads to wave-number locking in a wide range of forcing wave-numbers, even for weak forcing, unlike the locking in a set of narrow Arnold tongues in one-dimensional systems. Multi-stability ranges of stripe, rectangular, and oblique patterns produce a variety of resonant patterns. The results shed new light on rehabilitation practices of banded vegetation in drylands.
Shortest path network interdiction is a combinatorial optimization problem on an activity network arising in a number of important security-related applications. It is classically formulated as a bilevel maximin problem representing an "interdictor" and an "evader". The evader tries to move from a source node to the target node along a path of the least cost while the interdictor attempts to frustrate this motion by cutting edges or nodes. The interdiction objective is to find the optimal set of edges to cut given that there is a finite interdiction budget and the interdictor must move first. We reformulate the interdiction problem for stochastic evaders by introducing a model in which the evader follows a Markovian random walk guided by the least-cost path to the target. This model can represent incomplete knowledge about the evader, and the resulting model is a nonlinear 0-1 optimization problem. We then introduce an optimization heuristic based on betweenness centrality that can rapidly find high-quality interdiction solutions by providing a global view of the network.