Related papers: Cluster formation in mesoscopic systems
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of…
Numerical simulations and observations show that galaxies are not uniformly distributed. In cosmology, the largest known structures in the universe are galaxy filaments formed from the hierarchical clustering of galaxies due to…
Visualizing data through Czekanowski's diagram has as its aim the illustration of the relationships between objects. Often, obvious clusters of observations are directly visible. However, it is not straightforward to precisely delineate…
The core structure of galaxy clusters is fundamentally important. Even though self-gravitating systems have no stable equilibrium state due to their negative heat capacity, numerical simulations find density profiles which are universal in…
A new approach to clustering, based on the physical properties of inhomogeneous coupled chaotic maps, is presented. A chaotic map is assigned to each data-point and short range couplings are introduced. The stationary regime of the system…
Galaxy clusters exhibit a rich morphology during the early and intermediate stages of mass assembly, especially beyond their boundary. A classification scheme based on shapefinders deduced from the Minkowski functionals is examined to fully…
We study gravitational clustering of mass points in three dimensions with random initial positions and periodic boundary conditions (no expansion) by numerical simulations. Correlation properties are well defined in the system and a sort of…
The behaviour and functioning of a variety of complex physical and biological systems depend on the spatial organisation of their constituent units, and on the presence and formation of clusters of functionally similar or related…
We give a presentation of a finite crystallographic reflection group in terms of an arbitrary seed in the corresponding cluster algebra of finite type and interpret the presentation in terms of companion bases in the associated root system.
A general dynamical cluster identification framework including both modeling and computation is developed. The earthquake declustering problem is studied to demonstrate how this framework applies. A stochastic model is proposed for…
Graph-based clustering methods have demonstrated the effectiveness in various applications. Generally, existing graph-based clustering methods first construct a graph to represent the input data and then partition it to generate the…
It appears that the dynamical status of clusters and groups of galaxies is related to the large-scale structure of the Universe. A few interesting trends have been established: (1) The Cluster Substructure - Alignment Connection, by which…
The paper tackles the problem of clustering multiple networks, directed or not, that do not share the same set of vertices, into groups of networks with similar topology. A statistical model-based approach based on a finite mixture of…
Hierarchical clustering is a common algorithm in data analysis. It is unique among many clustering algorithms in that it draws dendrograms based on the distance of data under a certain metric, and group them. It is widely used in all areas…
There are at least 2 distinct mechanisms for the formation of young massive clusters (YMC), all of which require galactic-scale processes. One operates in harrassed fragile galaxies, in the dense cores of low mass galaxies, at the ends of…
The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…
We present a structural clustering algorithm for large-scale datasets of small labeled graphs, utilizing a frequent subgraph sampling strategy. A set of representatives provides an intuitive description of each cluster, supports the…
Clustering mechanisms are essential in certain multiuser networks for achieving efficient resource utilization. This lecture note presents the theory of coalition formation as a useful tool for distributed clustering problems. We reveal the…
In a Newtonian system with localized interactions the whole set of particles is naturally decomposed into dynamical clusters, defined as finite groups of particles having an influence on each other's trajectory during a given interval of…
We review progress in numerical simulations of star cluster formation. These simulations involve the bottom-up assembly of clusters through hierarchical mergers, which produces a fractal stellar distribution at young (~0.5 Myr) ages. The…