11 research outputs found

    Spatial flocking: Control by speed, distance, noise and delay

    Get PDF
    Fish, birds, insects and robots frequently swim or fly in groups. During their 3 dimensional collective motion, these agents do not stop, they avoid collisions by strong short-range repulsion, and achieve group cohesion by weak long-range attraction. In a minimal model that is isotropic, and continuous in both space and time, we demonstrate that (i) adjusting speed to a preferred value, combined with (ii) radial repulsion and an (iii) effective long-range attraction are sufficient for the stable ordering of autonomously moving agents in space. Our results imply that beyond these three rules ordering in space requires no further rules, for example, explicit velocity alignment, anisotropy of the interactions or the frequent reversal of the direction of motion, friction, elastic interactions, sticky surfaces, a viscous medium, or vertical separation that prefers interactions within horizontal layers. Noise and delays are inherent to the communication and decisions of all moving agents. Thus, next we investigate their effects on ordering in the model. First, we find that the amount of noise necessary for preventing the ordering of agents is not sufficient for destroying order. In other words, for realistic noise amplitudes the transition between order and disorder is rapid. Second, we demonstrate that ordering is more sensitive to displacements caused by delayed interactions than to uncorrelated noise (random errors). Third, we find that with changing interaction delays the ordered state disappears at roughly the same rate, whereas it emerges with different rates. In summary, we find that the model discussed here is simple enough to allow a fair understanding of the modeled phenomena, yet sufficiently detailed for the description and management of large flocks with noisy and delayed interactions. Our code is available at http://github.com/fij/flocComment: 12 pages, 7 figure

    Scientometrics: Untangling the topics

    Get PDF
    Measuring science is based on comparing articles to similar others. However, keyword-based groups of thematically similar articles are dominantly small. These small sizes keep the statistical errors of comparisons high. With the growing availability of bibliographic data such statistical errors can be reduced by merging methods of thematic grouping, citation networks and keyword co-usage.Comment: 2 pages, 2 figure

    Fundamental statistical features and self-similar properties of tagged networks

    Get PDF
    We investigate the fundamental statistical features of tagged (or annotated) networks having a rich variety of attributes associated with their nodes. Tags (attributes, annotations, properties, features, etc.) provide essential information about the entity represented by a given node, thus, taking them into account represents a significant step towards a more complete description of the structure of large complex systems. Our main goal here is to uncover the relations between the statistical properties of the node tags and those of the graph topology. In order to better characterise the networks with tagged nodes, we introduce a number of new notions, including tag-assortativity (relating link probability to node similarity), and new quantities, such as node uniqueness (measuring how rarely the tags of a node occur in the network) and tag-assortativity exponent. We apply our approach to three large networks representing very different domains of complex systems. A number of the tag related quantities display analogous behaviour (e.g., the networks we studied are tag-assortative, indicating possible universal aspects of tags versus topology), while some other features, such as the distribution of the node uniqueness, show variability from network to network allowing for pin-pointing large scale specific features of real-world complex networks. We also find that for each network the topology and the tag distribution are scale invariant, and this self-similar property of the networks can be well characterised by the tag-assortativity exponent, which is specific to each system
    corecore