相关论文: Cluster Model of Decagonal Tilings

Penrose tilings form lattices, exhibiting 5-fold symmetry and isotropic elasticity, with inhomogeneous coordination much like that of the force networks in jammed systems. Under periodic boundary conditions, their average coordination is…

A general construction principle of inflation rules for decagonal quasiperiodic tilings is proposed. The prototiles are confined to be polygons with unit edges. An inflation rule for a tiling is the combination of an expansion and a…

This article presents an algebraic topology perspective on the problem of finding a complete coverage probability of a one dimensional domain $X$ by a random covering, and develops techniques applicable to the problem beyond the one…

The community structure of complex networks reveals both their organization and hidden relationships among their constituents. Most community detection methods currently available are not deterministic, and their results typically depend on…

Tethering methods allow us to perform Monte Carlo simulations in ensembles with conserved quantities. Specifically, one couples a reservoir to the physical magnitude of interest, and studies the statistical ensemble where the total…

Standard statistical mechanical or condensed matter arguments tell us that bulk properties of a physical system do not depend too much on boundary conditions. Random tilings of large regions provide counterexamples to such intuition, as…

We construct model sets arising from cut and project schemes in Euclidean spaces whose associated Delone dynamical systems have positive toplogical entropy. The construction works both with windows that are proper and with windows that have…

A Gelfand-Tsetlin scheme of depth N is a triangular array with m integers at level m, m=1,...,N, subject to certain interlacing constraints. We study the ensemble of uniformly random Gelfand-Tsetlin schemes with arbitrary fixed N-th row. We…

We describe and experimentally evaluate a method for automatically clustering words according to their distribution in particular syntactic contexts. Deterministic annealing is used to find lowest distortion sets of clusters. As the…

The viscous flow of polymer chains in dense melts is dominated by topological constraints whenever the single chain contour length, N, becomes larger than the characteristic scale Ne, defining comprehensively the macroscopic rheological…

The combined processes of anodization and electrodeposition lead to highly ordered arrays of cylindrical nanowires. This template-based self-assembly fabrication method yields nanowires embedded in alumina. Commonly, chemical etching is…

In this paper, we employ Molecular Dynamics computer simulations to study and compare the statics and dynamics of linear and circular (ring) polymer chains in entangled solutions of different densities. While we confirm that linear chain…

Within the framework of hierarchical clustering we show that a simple Press-Schechter-like approximation, based on spherical dynamics, provides a good estimate of the evolution of the density field in the quasi-linear regime up to $\Sigma…

The clusters of a distribution are often defined by the connected components of a density level set. However, this definition depends on the user-specified level. We address this issue by proposing a simple, generic algorithm, which uses an…

Classical Landau theory considers structural phase transitions and crystallization as a condensation of several critical density waves whose wave vectors are symmetrically equivalent. Analyzing the simplest nonequilibrium Landau potentials…

Minimization of the (regularized) entropy of classification probabilities is a versatile class of discriminative clustering methods. The classification probabilities are usually defined through the use of some classical losses from…

We present an algorithm for Monte Carlo simulations of a nearest-neighbor spin ice model based on its cluster representation. To assess its performance, we estimate a relaxation time, and find that, in contrast to the Metropolis algorithm,…

We present a new method to derive exact cumulant expressions of any order of von Neumann entropy over Hilbert-Schmidt ensemble. The new method uncovers hidden cumulant structures that decouple each cumulant in a summation-free manner into…

Clustering analysis identifies samples as groups based on either their mutual closeness or homogeneity. In order to detect clusters in arbitrary shapes, a novel and generic solution based on boundary erosion is proposed. The clusters are…

Influence of surrounding matter on the properties of clusters is considered by an approach combining the methods of statistical and quantum mechanics. A cluster is treated as a bound N-particle system and surrounding matter as thermostat.…