Related papers: Spiders' webs in the punctured plane
Synthetic bio-molecular spiders with "legs" made of single-stranded segments of DNA can move on a surface covered by single-stranded segments of DNA called substrates when the substrate DNA is complementary to the leg DNA. If the motion of…
Spider walks are systems of interacting particles. The particles move independently as long as their movement do not violate some given rules describing the relative position of the particles; moves that violate the rules are not realized.…
Since Darwin, species trees have been used as a simplified description of the relationships which summarize the complicated network $N$ of reality. Recent evidence of hybridization and lateral gene transfer, however, suggest that there are…
We propose a model of an adaptive network of spiking neurons that gives rise to a hypernetwork of its dynamic states at the upper level of description. Left to itself, the network exhibits a sequence of transient clustering which relates to…
Observations reveal that on large scales the universe is spanned by a percolating network of superclusters interspersed with large and almost empty regions -- voids. This thesis reports the construction of a sophisticated computational…
In a landscape composed of N randomly distributed sites in Euclidean space, a walker (``tourist'') goes to the nearest one that has not been visited in the last \tau steps. This procedure leads to trajectories composed of a transient part…
This article explores the topology of Pseudo-B\"ottcher totally invariant connected components of the wandering set in dynamical systems generated by on-invertible inner (open surjective isolated) mappings of compact surfaces. We describe…
Given an entire transcendental function f with a non-completely invariant Baker domain, we define a Baker lamination on geodesics to study the divergence and convergence of a pinching process of curves in U. If the boundary of some curve in…
The maximum rectilinear crossing number of a graph $G$ is the maximum number of crossings in a good straight-line drawing of $G$ in the plane. In a good drawing any two edges intersect in at most one point (counting endpoints), no three…
Let G be a simple algebraic group. Labelled trivalent graphs called webs can be used to product invariants in tensor products of minuscule representations. For each web, we construct a configuration space of points in the affine…
We prove the existence of a transcendental entire function whose Julia set is a "bouquet of pseudo-arcs". More precisely, the union of the Julia set with infinity is an uncountable union of pseudo-arcs, which are pairwise disjoint except at…
Providing the neurobiological basis of information processing in higher animals, spiking neural networks must be able to learn a variety of complicated computations, including the generation of appropriate, possibly delayed reactions to…
Molecular spiders are synthetic bio-molecular systems which have "legs" made of short single-stranded segments of DNA. Spiders move on a surface covered with single-stranded DNA segments complementary to legs. Different mappings are…
We uncover the very rich graph topology of generic bounded non-Hermitian spectra, distinct from the topology of conventional band invariants and complex spectral winding. The graph configuration of complex spectra are characterized by the…
For connected reductive linear algebraic structure groups it is proven that every web is holonomically isolated. The possible tuples of parallel transports in a web form a Lie subgroup of the corresponding power of the structure group. This…
The topology of any complex system is key to understanding its structure and function. Fundamentally, algebraic topology guarantees that any system represented by a network can be understood through its closed paths. The length of each path…
We consider the spherical model on a spider-web graph. This graph is effectively infinite-dimensional, similar to the Bethe lattice, but has loops. We show that these lead to non-trivial corrections to the simple mean-field behavior. We…
Motivated by [G. Cannizzaro, M. Hairer, Comm. Pure Applied Math., '22], we provide a construction of the Brownian Web (see [T\'oth B., Werner W., Probab. Theory Related Fields, '98] and [L. R. G. Fontes, M. Isopi, C. M. Newman, and K.…
Flip graphs of non-crossing configurations in the plane are widely studied objects, e.g., flip graph of triangulations, spanning trees, Hamiltonian cycles, and perfect matchings. Typically, it is an easy exercise to prove connectivity of a…
Let $S$ be a point set in the plane, $\mathcal{P}(S)$ and $\mathcal{C}(S)$ sets of all plane spanning paths and caterpillars on $S$. We study reconfiguration operations on $\mathcal{P}(S)$ and $\mathcal{C}(S)$. In particular, we prove that…