相关论文: Allowed patterns of symmetric tent maps via commut…
This paper presents the Maximal Compatibility Matching (MCM) framework, a novel assignment strategy for ride-hailing systems that explicitly incorporates passenger comfort into the matching process. Traditional assignment methods prioritize…
Stochastic dynamical systems consisting of non-invertible continuous maps on an interval are studied. It is proved that if they satisfy the recently introduced so-called $\mu$-injectivity and some mild assumptions, then proximality,…
Let $X_1,X_2, \ldots$ be independent and identically distributed random elements taking values in a separable Hilbert space $\mathbb{H}$. With applications for functional data in mind, $\mathbb{H}$ may be regarded as a space of…
We consider some random iterated function systems on the interval and show that the invariant measure has density in $\mathcal{C}^\infty$. To prove this we use some techniques for contractions in cone metrics, applied to the transfer…
Understanding human mobility is essential for applications ranging from urban planning to public health. Traditional mobility models such as flow networks and colocation matrices capture only pairwise interactions between discrete…
Complex networks refer to large-scale graphs with nontrivial connection patterns. The salient and interesting features that the complex network study offer in comparison to graph theory are the emphasis on the dynamical properties of the…
This paper considers transfer functions in consensus systems where agents have identical SISO dynamics of arbitrary order. The interconnecting structure is a directed graph. The transfer functions for various inputs and outputs are…
In unknown cluttered environments with densely stacked objects, the free-motion space is extremely barren, posing significant challenges to motion planners. Collision-free planning methods often suffer from catastrophic failures due to…
Symmetric tensor operations arise in a wide variety of computations. However, the benefits of exploiting symmetry in order to reduce storage and computation is in conflict with a desire to simplify memory access patterns. In this paper, we…
Tent map is a discrete-time piecewise-affine I/O characteristic curve, which is used for chaos-based applications, such as true random number generation. However, tent map suffers from the inability to maintain the output state confined to…
In the first half of the paper, some recent advances in coupled dynamical systems, in particular, a globally coupled map are surveyed. First, dominance of Milnor attractors in partially ordered phase is demonstrated. Second, chaotic…
We investigate the hypercyclic properties of commutator maps acting on separable ideals of operators. As the main result we prove the commutator map induced by scalar multiples of the backward shift operator fails to be hypercyclic on the…
The purpose of this paper is to study the limiting distribution of special {\it additive functionals} on random planar maps, namely the number of occurrences of a given {\it pattern}. The main result is a central limit theorem for these…
We investigate the problems related to the Collatz map $T$ from the point of view of functional analysis. We associate with $T$ certain linear operator $\mathcal{T}$ and show that cycles and (hypothetical) diverging trajectory (generated by…
We extend the notion of an enumeration scheme developed by Zeilberger and Vatter to the case of vincular patterns (also called "generalized patterns" or "dashed patterns"). In particular we provide an algorithm which takes in as input a set…
We investigate iterated function systems (IFS) that randomly alternate between two non-identical one-dimensional maps. Our primary focus is on finite invariant sets exhibiting ``toss-and-catch'' dynamics, in which trajectories alternate…
We study independent and identically distributed random iterations of continuous maps defined on a connected closed subset $S$ of the Euclidean space $\mathbb{R}^{k}$. We assume the maps are monotone (with respect to a suitable partial…
Takens' Embedding Theorem asserts that when the states of a hidden dynamical system are confined to a low-dimensional attractor, complete information about the states can be preserved in the observed time-series output through the delay…
This paper introduces the induced matching distance, a novel topological metric designed to compare discrete structures represented by a symmetric non-negative function. We apply this notion to analyze agent trajectories over time. We use…
We develop a theory of the domain patterns in systems with competing short-range attractive interactions and long range repulsive Coulomb interactions. We take an energetic approach, in which patterns are considered as critical points of a…