相关论文: Cluster Model of Decagonal Tilings

We describe Generalized Hermitian matrices ensemble sometimes called Chiral ensemble. We give global asymptotic of the density of eigenvalues or the statistical density. We will calculate a Laplace transform of such a density for finite…

Both biological and artificial self-assembly processes can take place by a range of different schemes, from the successive addition of identical building blocks, to hierarchical sequences of intermediates, all the way to the fully…

We use two high resolution CDM simulations to show that (i) when clusters of galaxies form the infall pattern of matter is not random but shows clear features which are correlated in time; (ii) in addition, the infall patterns are…

This paper characterizes hierarchical clustering methods that abide by two previously introduced axioms -- thus, denominated admissible methods -- and proposes tractable algorithms for their implementation. We leverage the fact that, for…

We investigate the structure of a dilute mixture of amphiphilic dimers and spherical particles, a model relevant to the problem of encapsulating globular "guest" molecules in a dispersion. Dimers and spheres are taken to be hard particles,…

Clustering aims to divide a set of points into groups. The current paradigm assumes that the grouping is well-defined (unique) given the probability model from which the data is drawn. Yet, recent experiments have uncovered several…

Our problem of interest is to cluster vertices of a graph by identifying underlying community structure. Among various vertex clustering approaches, spectral clustering is one of the most popular methods because it is easy to implement…

Generative approaches to clustering provide information on geometric properties of clusters, whereas discriminative approaches provide boundaries between clusters. Ideas from both approaches are incorporated to present a fully unsupervised,…

We investigate the eigenvalues statistics of ensembles of normal random matrices when their order N tends to infinite. In the model the eigenvalues have uniform density within a region determined by a simple analytic polynomial curve. We…

It is shown that tiling in icosahedral quasicrystals can also be properly described by cyclic twinning at the unit cell level. The twinning operation is applied on the primitive prolate golden rhombohedra, which can be considered a result…

We present a detailed description of the generalized geometric cluster algorithm for the efficient simulation of continuum fluids. The connection with well-known cluster algorithms for lattice spin models is discussed, and an explicit full…

In a recent paper, the authors proposed a general methodology for probabilistic learning on manifolds. The method was used to generate numerical samples that are statistically consistent with an existing dataset construed as a realization…

The structure of a polystyrene matrix filled with tightly cross-linked polystyrene nanoparticles, forming an athermal nanocomposite system, is investigated by means of a Monte Carlo sampling formalism. The polymer chains are represented as…

We propose a cluster simulation algorithm for statistical ensembles with fixed order parameter. We use the tethered ensemble, which features Helmholtz's effective potential rather than Gibbs's free energy, and in which canonical averages…

In this paper, we present a local information theoretic approach to explicitly learn probabilistic clustering of a discrete random variable. Our formulation yields a convex maximization problem for which it is NP-hard to find the global…

Estimating the density of states of systems with rugged free energy landscapes is a notoriously difficult task of the utmost importance in many areas of physics ranging from spin glasses to biopolymers. Density of states estimation has also…

We count the asymptotic number of triangles in uniform random graphs where the degree distribution follows a power law with degree exponent $\tau\in(2,3)$. We also analyze the local clustering coefficient $c(k)$, the probability that two…

Using high precision Monte Carlo simulations and a mean-field theory, we explore coarsening phenomena in a simple driven diffusive system. The model is reminiscent of vehicular traffic on a two-lane ring road. At sufficiently high density,…

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…

Using the maximum entropy method, we derive the "adaptive cluster expansion" (ACE), which can be trained to estimate probability density functions in high dimensional spaces. The main advantage of ACE over other Bayesian networks is its…