arXiv subjects

David K. Arrowsmith

Publications and source records attributed to David K. Arrowsmith.

3 recordsLinked to original sources

arXiv2015

The Bogdanov Map: Bifurcations, Mode Locking, and Chaos in a Dissipative System

We investigate the bifurcations and basins of attraction in the Bogdanov map, a planar quadratic map which is conjugate to the Hénon area-preserving map in its conservative limit. It undergoes a Hopf bifurcation as dissipation is added, and exhibits the panoply of mode locking, Arnold tongues, and chaos as an invariant circle grows out, finally to be destroyed in the homoclinic tangency of the manifolds of a remote saddle point. The Bogdanov map is the Euler map of a two-dimensional system of ordinary differential equations first considered by Bogdanov and Arnold in their study of the versal unfolding of the double-zero-eigenvalue singularity, and equivalently of a vector field invariant under rotation of the plane by an angle $2π$. It is a useful system in which to observe the effect of dissipative perturbations on Hamiltonian structure. In addition, we argue that the Bogdanov map provides a good approximation to the dynamics of the Poincaré maps of periodically forced oscillators.

chao-dyn↗

arXiv2013

Resilience of natural gas networks during conflicts, crises and disruptions

Human conflict, geopolitical crises, terrorist attacks, and natural disasters can turn large parts of energy distribution networks offline. Europe's current gas supply network is largely dependent on deliveries from Russia and North Africa, creating vulnerabililties to social and political instabilities. During crises, less delivery may mean greater congestion, as the pipeline network is used in ways it has not been designed for. Given the importance of the security of natural gas supply, we develop a model to handle network congestion on various geographical scales. We offer a resilient response strategy to energy shortages and quantify its effectiveness for a variety of relevant scenarios. In essence, Europe's gas supply can be made robust even to major supply disruptions, if a fair distribution strategy is applied.

physics.soc-ph↗

arXiv2012

Fair sharing of resources in a supply network with constraints

This paper investigates the effect of network topology on the fair allocation of network resources among a set of agents, an all-important issue for the efficiency of transportation networks all around us. We analyse a generic mechanism that distributes network capacity fairly among existing flow demands. The problem can be solved by semi-analytical methods on a nearest neighbour graph with one source and sink pair, when transport occurs over shortest paths. For this setup, we uncover a broad range of patterns of intersecting shortest paths as a function of the distance between the source and the sink. When the number of intersections is the maximum and the distance between the source and the sink is large, we find that a fair allocation implies a decrease of at least 50% from the maximum throughput. We also find that the histogram of the flow allocations assigned to the agents decays as a power-law with exponent -1. Our semi-analytical framework suggests possible explanations for the well-known reduction of the throughput in fair allocations. It also suggests that the combination of network topology and routing rules can lead to highly uneven (but fair) distributions of resources, a remark of caution to network designers.

physics.soc-ph↗