Related papers: Transit Functions and Clustering Systems
Window functions describe, as a function of orbital period, the probability that an existing planetary transit is detectable in one's data for a given observing strategy. We show the dependence of this probability upon several strategy and…
Even though clustering trajectory data attracted considerable attention in the last few years, most of prior work assumed that moving objects can move freely in an euclidean space and did not consider the eventual presence of an underlying…
For a commutative non-autonomous dynamical system we show that topological transitivity of the non-autonomous system induced on probability measures (hyperspaces) is equivalent to the weak mixing of the induced systems. Several counter…
This paper considers metric spaces where distances between a pair of nodes are represented by distance intervals. The goal is to study methods for the determination of hierarchical clusters, i.e., a family of nested partitions indexed by a…
Behavior of hysteretic trajectories for cyclical input is investigated as a function of the internal structure of a system modeled by the classical random network of binary spins. Different regimes of hysteretic behavior are discovered for…
Let $V$ be a finite nonempty set. A transit function is a map $R:V\times V\rightarrow 2^V$ such that $R(u,u)=\{u\}$, $R(u,v)=R(v,u)$ and $u\in R(u,v)$ hold for every $u,v\in V$. A set $K\subseteq V$ is $R$-convex if $R(u,v)\subset K$ for…
We generalize the notion of a crossed module of groups to that of a crossed module of racks. We investigate the relation to categorified racks, namely strict 2-racks, and trunk-like objects in the category of racks, generalizing the…
Complex systems are successfully reduced to interacting elements via the network concept. Transport plays a key role in the survival of networks. For example the specialized signaling cascades of cellular networks filter noise and…
An important problem in the theory of cluster algebras is to compute the fundamental group of the exchange graph. A non-trivial closed loop in the exchange graph, for example, generates a non-trivial identity for the classical and quantum…
The article addresses some open questions about the relations between the topological weak mixing property and the transitivity of the map $f\times f^2 \times...\times f^m$, where $f\colon X\ra X$ is a topological dynamical system on a…
Rewriting systems are often defined as binary relations over a given set of objects. This simple definition is used to describe various properties of rewriting such as termination, confluence, normal forms etc. In this paper, we introduce a…
We consider characterisations of unitary dilations and approximations of irreversible classical dynamical systems on a Hilbert space. In the commutative case, building on the work in [9], one can express well known approximants (e.g. Hille-…
We investigate task clustering for deep-learning based multi-task and few-shot learning in a many-task setting. We propose a new method to measure task similarities with cross-task transfer performance matrix for the deep learning scenario.…
We use path-integrals to derive a general expression for the semiclassical approximation to the partition function of a one-dimensional quantum-mechanical system. Our expression depends solely on ordinary integrals which involve the…
Many seemingly disparate Markov chains are unified when viewed as random walks on the set of chambers of a hyperplane arrangement. These include the Tsetlin library of theoretical computer science and various shuffling schemes. If only…
We use path-integrals to derive a general expression for the semiclassical approximation to the partition function of a one-dimensional quantum-mechanical system. Our expression depends solely on ordinary integrals which involve the…
Submodular functions are discrete functions that model laws of diminishing returns and enjoy numerous algorithmic applications. They have been used in many areas, including combinatorial optimization, machine learning, and economics. In…
Submodular Functions are a special class of set functions, which generalize several information-theoretic quantities such as entropy and mutual information [1]. Submodular functions have subgradients and subdifferentials [2] and admit…
Functional data clustering is concerned with grouping functions that share similar structure, yet most existing methods implicitly operate on sampled grids, causing cluster assignments to depend on resolution, sampling density, or…
We consider extensions of the notion of topological transitivity for a dynamical system $(X,f)$. In addition to chain transitivity, we define strong chain transitivity and vague transitivity. Associated with each there is a notion of…