Hostname: page-component-76fb5796d-dfsvx Total loading time: 0 Render date: 2024-04-26T09:32:59.321Z Has data issue: false hasContentIssue false

Aggregation under local reinforcement: From lattice to continuum

Published online by Cambridge University Press:  04 March 2005

DIRK HORSTMANN
Affiliation:
Mathematisches Institut der Universität zu Köln, Weyertal 86-90, D-50923 Köln, Germany e-mail dhorst@mi.uni-koeln.de
KEVIN J. PAINTER
Affiliation:
Department of Mathematics, Heriot-Watt University, Riccarton, Edinburgh EH14 4AS, Scotland e-mail painter@ma.hw.ac.uk
HANS G. OTHMER
Affiliation:
School of Mathematics, University of Minnesota, Vincent Hall 207a, 206 Church St. S.E., Minneapolis, MN 55455 USA e-mail othmer@math.umn.edu

Abstract

Movement of biological organisms is frequently initiated in response to a diffusible or otherwise transported signal, and in its simplest form this movement can be described by a diffusion equation with an advection term. In systems in which the signal is localized in space the question arises as to whether aggregation of a population of indirectly-interacting organisms, or localization of a single organism, is possible under suitable hypotheses on the transition rules and the production of a control species that modulates the transition rates. It has been shown [25] that continuum approximations of reinforced random walks show aggregation and even blowup, but the connections between solutions of the continuum equations and of the master equation for the corresponding lattice walk were not studied. Using variational techniques and the existence of a Lyapunov functional, we study these connections here for certain simplified versions of the model studied earlier. This is done by relating knowledge about the shape of the minimizers of a variational problem to the asymptotic spatial structure of the solution.

Type
Papers
Copyright
2004 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)