English

Convergence of the Non-Uniform Physarum Dynamics

Data Structures and Algorithms 2020-03-02 v2

Abstract

Let cZ>0mc \in \mathbb{Z}^m_{> 0}, AZn×mA \in \mathbb{Z}^{n\times m}, and bZnb \in \mathbb{Z}^n. We show under fairly general conditions that the non-uniform Physarum dynamics x˙e=ae(x,t)(qexe) \dot{x}_e = a_e(x,t) \left(|q_e| - x_e\right) converges to the optimum solution xx^* of the weighted basis pursuit problem minimize cTxc^T x subject to Af=bA f = b and fx|f| \le x. Here, ff and xx are mm-vectors of real variables, qq minimizes the energy e(ce/xe)qe2\sum_e (c_e/x_e) q_e^2 subject to the constraints Aq=bA q = b and supp(q)supp(x)\mathrm{supp}(q) \subseteq \mathrm{supp}(x), and ae(x,t)>0a_e(x,t) > 0 is the reactivity of edge ee to the difference qexe|q_e| - x_e at time tt and in state xx. Previously convergence was only shown for the uniform case ae(x,t)=1a_e(x,t) = 1 for all ee, xx, and tt. We also show convergence for the dynamics x˙e=xe(ge(qexe)1), \dot{x}_e = x_e \cdot \left( g_e \left(\frac{|q_e|}{x_e}\right) - 1\right), where geg_e is an increasing differentiable function with ge(1)=1g_e(1) = 1. Previously convergence was only shown for the special case of the shortest path problem on a graph consisting of two nodes connected by parallel edges.

Keywords

Cite

@article{arxiv.1901.07231,
  title  = {Convergence of the Non-Uniform Physarum Dynamics},
  author = {Andreas Karrenbauer and Pavel Kolev and Kurt Mehlhorn},
  journal= {arXiv preprint arXiv:1901.07231},
  year   = {2020}
}

Comments

to appear in Theoretical Computer Science C