Related papers: Transit Functions and Clustering Systems
Collective tunneling is a ubiquitous phenomenon in finite-size spin clusters that shows up in systems as diverse as molecular magnets or spin clusters adsorbed at surfaces. The problem we explore is to understand how small flipping terms…
The analysis of the presence of substructures in 16 well-sampled clusters of galaxies suggests a stimulating hypothesis: Clusters could be classified as unimodal or bimodal, on the basis of to the sub-clump distribution in the {\em 3-D}…
Percolation has long served as a model for diverse phenomena and systems. The percolation transition, that is, the formation of a giant cluster on a macroscopic scale, is known as one of the most robust continuous transitions. Recently,…
Taking matrix as a synonym for a numerical function on the Cartesian product of two (in general, infinite) sets, a simple purely algebraic "reciprocity property" says that the set of rows spans a finite-dim space iff the set of columns does…
Critical phase transitions have proven to be a powerful concept to capture the phenomenology of many systems, including deeply non-equilibrium ones like living systems. The study of these phase transitions has overwhelmingly relied on…
Clustering consists of partitioning data objects into subsets called clusters according to some similarity criteria. This paper addresses a generalization called quasi-clustering that allows overlapping of clusters, and which we link to…
We present molecular dynamics (MD) simulations results for dense fluids of ultrasoft, fully-penetrable particles. These are a binary mixture and a polydisperse system of particles interacting via the generalized exponential model, which is…
Systems driven out of equilibrium can often exhibit behaviour not seen in systems in thermal equilibrium- for example phase transitions in one-dimensional systems. In this talk I will review several `condensation' transitions that occur…
Clustering is a concept used in a huge variety of applications. We review a conceptually very simple algorithm for hierarchical clustering called in the following the {\it mutual information clustering} (MIC) algorithm. It uses mutual…
In this paper, we recall various features of non equilibrium granular systems. Clusters with specific properties are found depending on the packing density, going from loose (a granular gas) to sintered (though brittle) polycrystalline…
Bikesharing schemes are transportation systems that not only provide an efficient mode of transportation in congested urban areas, but also improve last-mile connectivity with public transportation and local accessibility. Bikesharing…
On the transversals of a subgroup of a group, using the binary operation of the group, structural mappings are defined. Based on these mappings, the notion of the hypergroup over the group is introduced, which generalizes the notion of the…
The notion of ordinal concavity of utility functions has recently been considered by Hafalir, Kojima, Yenmez, and Yokote in economics while there exist earlier related works in discrete optimization and operations research. In the present…
We analyze the process of informational exchange through complex networks by measuring network efficiencies. Aiming to study non-clustered systems, we propose a modification of this measure on the local level. We apply this method to an…
Process of quantum tunneling of particles in various physical systems can be effectively controlled even by a weak and slow varying in time electromagnetic signal if to adapt specially its shape to a particular system. During an…
This article describes recent work on the topic of specifying properties of transition systems. By giving a suitably abstract description of transition systems as coalgebras, it is possible to derive logics for capturing properties of these…
Clustering is the propensity of nodes that share a common neighbour to be connected. It is ubiquitous in many networks but poses many modelling challenges. Clustering typically manifests itself by a higher than expected frequency of…
``Quasi-elliptic'' functions can be given a ring structure in two different ways, using either ordinary multiplication, or convolution. The map between the corresponding standard bases is calculated. A related structure has appeared…
Many networked systems are governed by non-pairwise interactions between nodes. The resulting higher-order interaction structure can then be encoded by means of a hypernetwork. In this paper we consider dynamical systems on hypernetworks by…
Functional digraphs are unlabelled finite digraphs where each vertex has exactly one out-neighbor. They are isomorphic classes of finite discrete-time dynamical systems. Endowed with the direct sum and product, functional digraphs form a…