We study the simple evolutionary process in which we repeatedly find the least fit agent in a population of agents and give it a new fitness which is chosen independently at random from a specified distribution. We show that many of the average properties of this process can be calculated...

Phage display, SELEX and other methods of combinatorial chemistry have become very popular means of finding ligands with high affinities to given targets. Despite their success, they suffer from numerous sources of error and bias, such as very low initial concentrations of species, non-specific...

Technological change at the firm level has commonly been modeled as random sampling from a fixed distribution o f possibilities. Such models, however, typically ignore empirically important aspects of the firm's search process, notably the observation that the present state of the firm guides...

Army ant colonies display complex foraging raid patterns involving thousands of individuals communicating through chemical trails. In this paper we explore, by means of a simple search algorithm, the properties of these trails in order to test the hypothesis that their structure reflects an...

Self-organizing maps (SOM) are unsupervised, competitive neural networks used to project high-dimensional data onto a low-dimensial space. In this article we show how SOM can be sued to draw graphs in the plane. The SOM-based approach to graph drawing, which belongs to the general class of...