Order Parameter Equations for Front Transitions: Nonuniformly Curved Fronts

Kinematic equations for the motion of slowly propagating, weakly curved fronts in bistable media are derived. The equations generalize earlier derivations where algebraic relations between the normal front velocity and its curvature are assumed. Such relations do not capture the dynamics near nonequilibrium Ising-Bloch (NIB) bifurcations, where transitions between counterpropagating Bloch fronts may spontaneously occur. The kinematic equations consist of coupled integro-differential equations for the front curvature and the front velocity, the order parameter associated with the NIB bifurcation. They capture the NIB bifurcation, the instabilities of Ising and Bloch fronts to transverse perturbations, the core structure of a spiral wave, and the dynamic process of spiral wave nucleation.Comment: 20 pages. Aric Hagberg: http://cnls.lanl.gov/~aric; Ehud Meron:http://www.bgu.ac.il/BIDR/research/staff/meron.htm

Optimal Interdiction of Unreactive Markovian Evaders

The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdiction, the task of the interdictor is to find a set of edges in a weighted network such that the removal of those edges would maximally increase the cost to an evader of traveling on a path through the network. Our work is motivated by cases in which the evader has incomplete information about the network or lacks planning time or computational power, e.g. when authorities set up roadblocks to catch bank robbers, the criminals do not know all the roadblock locations or the best path to use for their escape. We introduce a model of network interdiction in which the motion of one or more evaders is described by Markov processes and the evaders are assumed not to react to interdiction decisions. The interdiction objective is to find an edge set of size B, that maximizes the probability of capturing the evaders. We prove that similar to the standard least-cost formulation for deterministic motion this interdiction problem is also NP-hard. But unlike that problem our interdiction problem is submodular and the optimal solution can be approximated within 1-1/e using a greedy algorithm. Additionally, we exploit submodularity through a priority evaluation strategy that eliminates the linear complexity scaling in the number of network edges and speeds up the solution by orders of magnitude. Taken together the results bring closer the goal of finding realistic solutions to the interdiction problem on global-scale networks.Comment: Accepted at the Sixth International Conference on integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2009

Kinematic Equations for Front Motion and Spiral-Wave Nucleation

We present a new set of kinematic equations for front motion in bistable media. The equations extend earlier kinematic approaches by coupling the front curvature with the order parameter associated with a parity breaking front bifurcation. In addition to naturally describing the core region of rotating spiral waves the equations can be be used to study the nucleation of spiral-wave pairs along uniformly propagating fronts. The analysis of spiral-wave nucleation reduces to the simpler problem of droplet, or domain, nucleation in one space dimension.Comment: 8 pages. Aric Hagberg: http://cnls.lanl.gov/~aric; Ehud Meron: http://www.bgu.ac.il/BIDR/research/staff/meron.htm

Crossing Patterns in Nonplanar Road Networks

We define the crossing graph of a given embedded graph (such as a road network) to be a graph with a vertex for each edge of the embedding, with two crossing graph vertices adjacent when the corresponding two edges of the embedding cross each other. In this paper, we study the sparsity properties of crossing graphs of real-world road networks. We show that, in large road networks (the Urban Road Network Dataset), the crossing graphs have connected components that are primarily trees, and that the remaining non-tree components are typically sparse (technically, that they have bounded degeneracy). We prove theoretically that when an embedded graph has a sparse crossing graph, it has other desirable properties that lead to fast algorithms for shortest paths and other algorithms important in geographic information systems. Notably, these graphs have polynomial expansion, meaning that they and all their subgraphs have small separators.Comment: 9 pages, 4 figures. To appear at the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems(ACM SIGSPATIAL 2017