Related papers: The two-nest ants process on triangle-series-paral…
Lattice animals provide a discretized model for the theta transition displayed by branched polymers in solvent. Exact graph enumeration studies have given some indications that the phase diagram of such lattice animals may contain two…
We consider the averaging process on a graph, that is the evolution of a mass distribution undergoing repeated averages along the edges of the graph at the arrival times of independent Poisson processes. We establish cutoff phenomena for…
Finding the most powerful node in a dynamic random network, the largest set in a partition-valued stochastic process, or the largest family in an evolving population at a given time, can be a very difficult problem. This is particularly the…
We present a model of ant traffic considering individual ants as self-propelled particles undergoing single file motion on a one-dimensional trail. Recent experiments on unidirectional ant traffic in well-formed natural trails showed that…
Beyond unicellular and multicellular organisms, there is a third type of structural complexity in living animals: that of the mechanical self-assembly of groups of distinct multicellular organisms into dynamical, functional structures. One…
We describe an new algorithm for visualizing an alignment of biological sequences according to a probabilistic model of evolution. The resulting data array is readily interpreted by the human eye and amenable to digital image techniques. We…
In this paper, we consider the problem of finding a minimum common partition of two strings. The problem has its application in genome comparison. As it is an NP-hard, discrete combinatorial optimization problem, we employ a metaheuristic…
Many organisms exhibit branching morphologies that twist around each other and become entangled. Entanglement occurs when different objects interlock, creating complex and often irreversible configurations. This physical phenomenon is…
The idea of sensitivity in ant colony systems has been exploited in hybrid ant-based models with promising results for many combinatorial optimization problems. Heterogeneity is induced in the ant population by endowing individual ants with…
The paper presents an exponential pheromone deposition rule to modify the basic ant system algorithm which employs constant deposition rule. A stability analysis using differential equation is carried out to find out the values of…
Fire ants use their claws to grip diverse surfaces, including each other. As a result of their mutual adhesion and large numbers, ant colonies flow like inanimate fluids. In this sequence of films, we demonstrate how ants behave similarly…
This work shows potentials for rapid self-organisation of sensor networks where nodes collaborate to relay messages to a common data collecting unit (sink node). The study problem is, in the sense of graph theory, to find a shortest path…
Graph matching, also known as network alignment, refers to finding a bijection between the vertex sets of two given graphs so as to maximally align their edges. This fundamental computational problem arises frequently in multiple fields…
A team of identical and oblivious ant-like agents - a(ge)nts - leaving pheromone traces, are programmed to jointly patrol an area modeled as a graph. They perform this task using simple local interactions, while also achieving the important…
Understanding how and how far information, behaviors, or pathogens spread in social networks is an important problem, having implications for both predicting the size of epidemics, as well as for planning effective interventions. There are,…
Protein can be represented by amino acid interaction network. This network is a graph whose vertices are the proteins amino acids and whose edges are the interactions between them. This interaction network is the first step of proteins…
We report experimental results on unidirectional traffic-like collective movement of ants on trails. Our work is primarily motivated by fundamental questions on the collective spatio-temporal organization in systems of interacting motile…
Recent breakthroughs in Artificial Intelligence have shown that the combination of tree-based planning with deep learning can lead to superior performance. We present Adaptive Entropy Tree Search (ANTS) - a novel algorithm combining…
We use an artificial neural network to analyze asymmetric noisy random telegraph signals (RTSs), and extract underlying transition rates. We demonstrate that a long short-term memory neural network can vastly outperform conventional…
We propose a simple and natural approximation algorithm for the problem of finding a 2-edge-connected spanning subgraph of minimum total edge cost in a graph. The algorithm maintains a spanning forest starting with an empty edge set. In…