Related papers: Extended Void Merging Tree Algorithm for Self-Simi…
A rotor configuration on a graph contains in every vertex an infinite ordered sequence of rotors, each is pointing to a neighbor of the vertex. After sampling a configuration according to some probability measure, a rotor walk is a…
We study a simple swarming model on a two-dimensional lattice where the self-propelled particles exhibit a tendency to align ferromagnetically. Volume exclusion effects are present: particles can only hop to a neighboring node if the node…
Planning the motion path for a tightly coupled dual-arm space manipulator under closed-chain constraints is a fundamental yet challenging problem in on-orbit assembly of large-scale space structures. The closed-chain constraints…
We study the trajectory of a simple random walk on a d-regular graph with d>2 and locally tree-like structure as the number n of vertices grows. Examples of such graphs include random d-regular graphs and large girth expanders. For these…
We outline a possible theoretical framework for the quantitative modeling of networked embodied cognitive systems. We notice that: 1) information self structuring through sensory-motor coordination does not deterministically occur in Rn…
Scientific studies in many areas of biology routinely employ evolutionary analyses based on the probabilistic inference of phylogenetic trees from molecular sequence data. Evolutionary processes that act at the molecular level are highly…
In this paper, a similarity-driven cluster merging method is proposed for unsuper-vised fuzzy clustering. The cluster merging method is used to resolve the problem of cluster validation. Starting with an overspecified number of clusters in…
We confront two integrability criteria for rational mappings. The first is the singularity confinement based on the requirement that every singularity, spontaneously appearing during the iteration of a mapping, disappear after some steps.…
Introgression is an evolutionary process in which genes or other types of genetic material are introduced into a genome. It is an important evolutionary process that can, for example, play a fundamental role in speciation. Recently the…
While generic competitive systems exhibit mixtures of hierarchy and cycles, real-world systems are predominantly hierarchical. We demonstrate and extend a mechanism for hierarchy; systems with similar agents approach perfect hierarchy in…
We present an algorithm to extend subhalo merger trees in a low-resolution dark-matter-only simulation by conditionally matching them to those in a high-resolution simulation. The algorithm is general and can be applied to simulation data…
We model the formation and evolution of galaxy clusters in the framework of an extended dark matter halo merger-tree algorithm that includes baryons and incorporates basic physical considerations. Our modified treatment is employed to…
Tree embedding has been a fundamental method in algorithm design with wide applications. We focus on the efficiency of building tree embedding in various computational settings under high-dimensional Euclidean $\mathbb{R}^d$. We devise a…
The goal of this article is to contribute towards the conceptual and quantitative understanding of the evolutionary benefits for (microbial) populations to maintain a seed bank (consisting of dormant individuals) when facing fluctuating…
We derive a self-duality relation for a one-dimensional model of branching and annihilating random walkers with an even number of offsprings. With the duality relation and by deriving exact results in some limiting cases involving fast…
We study the evolution of a random walker on a conservative dynamic random environment composed of independent particles performing simple symmetric random walks, generalizing results of [16] to higher dimensions and more general transition…
Tip-driven growth processes underlie the development of many plants. To date, tip-driven growth processes have been modelled as an elongating path or series of segments without taking into account lateral expansion during elongation.…
In this chapter we review some examples, methods, and recent results involving comparison of clustering properties of point processes. Our approach is founded on some basic observations allowing us to consider void probabilities and moment…
L\'evy walks are found in the migratory behaviour patterns of various organisms, and the reason for this phenomenon has been much discussed. We use simulations to demonstrate that learning causes the changes in confidence level during…
In the field of swarm robotics, one of the most studied problem is Gathering. It asks for a distributed algorithm that brings the robots to a common location, not known in advance. We consider the case of robots constrained to move along…