Related papers: Organization of parameter space for simple circle …
A linkage is a finite graph with lengths assigned to each edge. A planar realization is a map to the plane which preserves edge lengths. It can be thought of as a mechanical device formed from stiff rods and rotating joints. We look at the…
We consider the complexification of the Henon family of quadratic diffeomorphisms of the plane, and the region of parameter space corresponding to complex horseshoes. We discuss some conjectures about the global topology of the complex…
We describe a linear-time algorithm that finds a planar drawing of every graph of a simple line or pseudoline arrangement within a grid of area O(n^{7/6}). No known input causes our algorithm to use area \Omega(n^{1+\epsilon}) for any…
A map of a set to itself admits a representation by a graph with vertices being the elements of the set and an edge between every vertex and its image. Communities defined as the maximal connected components are uni-cyclic. The…
To comprehend the hierarchical organization of large integrated systems, we introduce the hierarchical map equation, which reveals multilevel structures in networks. In this information-theoretic approach, we exploit the duality between…
Network coherence generally refers to the emergence of simple aggregated dynamical behaviours, despite heterogeneity in the dynamics of the subsystems that constitute the network. In this paper, we develop a general frequency domain…
A family of maps or flows depending on a parameter $\nu$ which varies in an interval, spans a certain property if along the interval this property depends continuously on the parameter and achieves some asymptotic values along it. We…
This paper defines a new sequence of finite dimensional algebras as quotients of the group algebras of the braid groups. This sequence depends on three homogeneous parameters and has a one-parameter family of Markov traces, and so gives a…
Let $G$ be a graph and $f: G\rightarrow G$ be a continuous map. We establish a structure theorem which describes the structures of the set $R(f)-\overline{P(f)}$, where $R(f)$ and $P(f)$ are the recurrent point set and the periodic point…
A criterion on the asymptotic stability of fractional-order systems with incomensurate orders is proposed in this paper. Existing methods always assume order parameters be rational numbers or the ratios of any two orders be rational…
Topological phases, such as Chern insulators, are defined in terms of additive indices that are stable against the addition of trivial degrees of freedom. Such topology presents an obstruction to any Wannier representation, namely, the…
Stationarity is a cornerstone property that facilitates the analysis and processing of random signals in the time domain. Although time-varying signals are abundant in nature, in many practical scenarios the information of interest resides…
In this paper we introduce an interlacing condition on the elements of a family of operators that allows us to gather together a number of results on fixed points and common fixed points for single and families of mappings defined on metric…
We consider limit probabilities of first order properties in random graphs with a given degree sequence. Under mild conditions on the degree sequence, we show that the closure set of limit probabilities is a finite union of closed…
Several data-driven approaches based on information theory have been proposed for analyzing high-order interactions involving three or more components of a network system. Most of these methods are defined only in the time domain and rely…
We study natural one-parameter families of antiholomorphic correspondences arising from univalent restrictions of Shabat polynomials, indexed by rooted dessin d'enfants. We prove that the parameter spaces are topological quadrilaterals,…
This paper discusses and summarizes some results on complex variables that are very useful in fractional-order systems analysis and design, specifically when the system is analyzed in the frequency domain. The author hopes that this…
Many real networks in nature and society share two generic properties: they are scale-free and they display a high degree of clustering. We show that these two features are the consequence of a hierarchical organization, implying that small…
We introduce a new perspective on a procedure for generating pseudo-Anosov homemorphisms from postcritically finite interval maps. The central idea is the realization of a tree structure on one such family of pseudo-Anosovs: individual…
Factor models are widely used to reduce dimensionality in modeling high-dimensional data. However, there remains a need for models that can be reliably fit in modest sample sizes and are identifiable, interpretable, and flexible. To address…