English
Related papers

Related papers: Cluster Approximation for the Contact Process

200 papers

A method has been found to analyze Edwards' granular contact force probability functional for a special case. As a result, the granular contact force probability density functions are obtained from first principles for this case. The…

Statistical Mechanics · Physics 2009-11-10 Philip Metzger

We review the methods based on expectation value coupled cluster formalism - a common framework for the derivation of properties: the ground-state average value of an observable, cumulants of the second-order reduced density matrices,…

Chemical Physics · Physics 2021-11-15 Aleksandra M. Tucholska , Robert Moszynski

A quantum field theoretic formulation of the dynamics of the Contact Process on a regular graph of degree z is introduced. A perturbative calculation in powers of 1/z of the effective potential for the density of particles phi(t) and an…

Statistical Mechanics · Physics 2016-08-16 Christophe Deroulers , Rémi Monasson

We study nonequilibrium phase transitions of reaction-diffusion systems defined on randomly diluted lattices, focusing on the transition across the lattice percolation threshold. To develop a theory for this transition, we combine classical…

Statistical Mechanics · Physics 2009-04-27 Man Young Lee , Thomas Vojta

The idea underlying the modal formulation of density-based clustering is to associate groups with the regions around the modes of the probability density function underlying the data. This correspondence between clusters and dense regions…

Social and Information Networks · Computer Science 2021-01-22 Giovanna Menardi , Domenico De Stefano

This paper introduces a novel approach of clustering, which is based on group consensus of dynamic linear high-order multi-agent systems. The graph topology is associated with a selected multi-agent system, with each agent corresponding to…

Systems and Control · Computer Science 2017-06-13 Ning Cai , Chen Diao , M. Junaid Khan

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…

Computer Vision and Pattern Recognition · Computer Science 2018-04-16 Cheng-Hao Deng , Wan-Lei Zhao

We calculated some of the critical exponents of the directed percolation universality class through exact numerical diagonalisations of the master operator of the one-dimensional basic contact process. Perusal of the power method together…

Statistical Mechanics · Physics 2011-05-24 J. Ricardo G. de Mendonça

We prove clustering estimates for the truncated correlations, i.e., cumulants of an unbounded spin system on the lattice. We provide a unified treatment, based on cluster expansion techniques, of four different regimes: large mass, small…

Mathematical Physics · Physics 2015-05-13 Abdelmalek Abdesselam , Aldo Procacci , Benedetto Scoppola

The nucleation and growth of clusters in a progressively cooled vapor is studied. The chemical-potential of the vapor increases, resulting in a rapidly increasing nucleation rate. The growth of the newly created clusters depletes monomers,…

Materials Science · Physics 2008-10-21 Yossi Farjoun

The primary goal in cluster analysis is to discover natural groupings of objects. The field of cluster analysis is crowded with diverse methods that make special assumptions about data and address different scientific aims. Despite its…

Genomics · Quantitative Biology 2018-06-07 Gary K. Chen , Eric Chi , John Ranola , Kenneth Lange

A widely used approach to clustering a single data stream is the two-phased approach in which the online phase creates and maintains micro-clusters while the off-line phase generates the macro-clustering from the micro-clusters. We use this…

Databases · Computer Science 2012-09-20 Dang-Hoan Tran

We characterize the statistics of nearest-neighbor and contact distance distributions for Thomas cluster process (TCP), which is a special case of Poisson cluster process. In particular, we derive the cumulative distribution function (CDF)…

Information Theory · Computer Science 2016-09-27 Mehrnaz Afshang , Chiranjib Saha , Harpreet S. Dhillon

The phase transition of the even offspringed branching and annihilating random walk is studied by N-cluster mean-field approximations on one-dimensional lattices. By allowing to reach zero branching rate a phase transition can be seen for…

Statistical Mechanics · Physics 2009-11-11 Geza Odor , Attila Szolnoki

In this note we consider non-stationary cluster point processes and we derive their conditional intensity, i.e. the intensity of the process given the locations of one or more events of the process. We then provide some approximations of…

Statistics Theory · Mathematics 2021-12-02 Edith Gabriel , Joël Chadoeuf

Non-equilibrium cluster-cluster aggregation of particles diffusing in or at the cell membrane has been hypothesized to lead to domains of finite size in different biological contexts such as lipid rafts, cell adhesion complexes, or…

Soft Condensed Matter · Physics 2023-08-30 Renaud Baillou , Jonas Ranft

The coherent potential approximation, CPA, is a useful tool to treat systems with disorder. Cluster theories have been proposed to go beyond the translation invariant single-site CPA approximation and include some short range correlations.…

Condensed Matter · Physics 2009-10-31 C. I. Ventura , R. A. Barrio , .

A method, called the adaptive cluster approximation (ACA), for single-impurity Anderson models is proposed. It is based on reduced density-matrix functional theory, where the one-particle reduced density matrix is used as the basic…

Strongly Correlated Electrons · Physics 2018-06-22 Robert Schade , Peter E. Blöchl

For ordinary (independent) percolation on a large class of lattices it is well known that below the critical percolation parameter $p_c$ the cluster size distribution has exponential decay and that power-law behavior of this distribution…

Probability · Mathematics 2011-01-10 J. van den Berg

Clustering is an unsupervised learning technique that is useful when working with a large volume of unlabeled data. Complex dynamical systems in real life often entail data streaming from a large number of sources. Although it is desirable…

Machine Learning · Computer Science 2021-05-20 Sin Yong Tan , Homagni Saha , Margarite Jacoby , Gregor P. Henze , Soumik Sarkar