Resource location based on precomputed partial random walks in dynamic networks

The problem of finding a resource residing in a network node (the \emph{resource location problem}) is a challenge in complex networks due to aspects as network size, unknown network topology, and network dynamics. The problem is especially difficult if no requirements on the resource placement strategy or the network structure are to be imposed, assuming of course that keeping centralized resource information is not feasible or appropriate. Under these conditions, random algorithms are useful to search the network. A possible strategy for static networks, proposed in previous work, uses short random walks precomputed at each network node as partial walks to construct longer random walks with associated resource information. In this work, we adapt the previous mechanisms to dynamic networks, where resource instances may appear in, and disappear from, network nodes, and the nodes themselves may leave and join the network, resembling realistic scenarios. We analyze the resulting resource location mechanisms, providing expressions that accurately predict average search lengths, which are validated using simulation experiments. Reduction of average search lengths compared to simple random walk searches are found to be very large, even in the face of high network volatility. We also study the cost of the mechanisms, focusing on the overhead implied by the periodic recomputation of partial walks to refresh the information on resources, concluding that the proposed mechanisms behave efficiently and robustly in dynamic networks.Comment: 39 pages, 25 figure

Geometric control of particle manipulation in a two-dimensional fluid

Manipulation of particles suspended in fluids is crucial for many applications, such as precision machining, chemical processes, bio-engineering, and self-feeding of microorganisms. In this paper, we study the problem of particle manipulation by cyclic fluid boundary excitations from a geometric-control viewpoint. We focus on the simplified problem of manipulating a single particle by generating controlled cyclic motion of a circular rigid body in a two-dimensional perfect fluid. We show that the drift in the particle location after one cyclic motion of the body can be interpreted as the geometric phase of a connection induced by the system's hydrodynamics. We then formulate the problem as a control system, and derive a geometric criterion for its nonlinear controllability. Moreover, by exploiting the geometric structure of the system, we explicitly construct a feedback-based gait that results in attraction of the particle towards the rigid body. We argue that our gait is robust and model-independent, and demonstrate it in both perfect fluid and Stokes fluid

VADER: A Flexible, Robust, Open-Source Code for Simulating Viscous Thin Accretion Disks

The evolution of thin axisymmetric viscous accretion disks is a classic problem in astrophysics. While models based on this simplified geometry provide only approximations to the true processes of instability-driven mass and angular momentum transport, their simplicity makes them invaluable tools for both semi-analytic modeling and simulations of long-term evolution where two- or three-dimensional calculations are too computationally costly. Despite the utility of these models, the only publicly-available frameworks for simulating them are rather specialized and non-general. Here we describe a highly flexible, general numerical method for simulating viscous thin disks with arbitrary rotation curves, viscosities, boundary conditions, grid spacings, equations of state, and rates of gain or loss of mass (e.g., through winds) and energy (e.g., through radiation). Our method is based on a conservative, finite-volume, second-order accurate discretization of the equations, which we solve using an unconditionally-stable implicit scheme. We implement Anderson acceleration to speed convergence of the scheme, and show that this leads to factor of $\sim 5$ speed gains over non-accelerated methods in realistic problems, though the amount of speedup is highly problem-dependent. We have implemented our method in the new code Viscous Accretion Disk Evolution Resource (VADER), which is freely available for download from https://bitbucket.org/krumholz/vader/ under the terms of the GNU General Public License.Comment: 58 pages, 13 figures, accepted to Astronomy & Computing; this version includes more discussion, but no other changes; code is available for download from https://bitbucket.org/krumholz/vader