Results 31 to 40 of about 1,861,121 (138)
Parquet approximation for the 4x4 Hubbard cluster [PDF]
We present a numerical solution of the parquet approximation, a conserving diagrammatic approach which is self-consistent at both the single-particle and the two-particle levels.
Scalettar, R. T. +10 more
core +1 more source
Approximating Clustering Coefficient and Transitivity
Summary: Since its introduction in the year 1998 by Watts and Strogatz, the clustering coefficient has become a frequently used tool for analyzing graphs. In 2002 the transitivity was proposed by Newman, Watts and Strogatz as an alternative to the clustering coefficient. As many networks considered in complex systems are huge, the efficient computation
Thomas Schank, Dorothea Wagner
openaire +2 more sources
Statistics for approximate gene clusters [PDF]
Genes occurring co-localized in multiple genomes can be strong indicators for either functional constraints on the genome organization or remnant ancestral gene order. The computational detection of these patterns, which are usually referred to as gene clusters, has become increasingly sensitive over the past decade.
Katharina Jahn 0001 +3 more
openaire +4 more sources
Towards analytical approaches to the dynamical-cluster approximation [PDF]
I introduce several simplified schemes for the approximation of the self-consistency condition of the dynamical cluster approximation. The applicability of the schemes is tested numerically using the fluctuation-exchange approximation as a cluster solver
Hague, J. P.
core +1 more source
New cluster approximation for Ising systems
A new cluster approximation based on the effective field theory for Ising systems is presented. The application of the presented method to the most basic model, namely the spin-1/2 Ising model has been carried out. Obtained critical temperatures for spin-
AKINCI, ÜMİT, Ümit Akıncı
core +1 more source
A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem [PDF]
We give the first 2-approximation algorithm for the cluster vertex deletion problem. This is tight, since approximating the problem within any constant factor smaller than 2 is UGC-hard.
Huynh T. +11 more
core +1 more source
Online Hierarchical Clustering Approximations
17 pages, 3 ...
Aditya Krishna Menon +5 more
openaire +2 more sources
Graph clustering by congruency approximation
The authors consider the general problem of graph clustering. Graph clustering manipulates the graph‐based data structure and the entries of the solution vectors are only allowed to take non‐negative discrete values. Finding the optimal solution is NP‐hard, so relaxations are usually considered.
Weiya Ren, Guohui Li, Dan Tu
openaire +2 more sources
This is the first part of a paper that deals with error estimates for the Rayleigh–Ritz approximations to the spectrum and invariant subspaces of a bounded Hermitian operator in a Hilbert or Euclidean space.
Ovtchinnikov, E.
core +1 more source
Dynamical Cluster Approximation
The dynamical cluster approximation (DCA) is a method which systematically incorporates nonlocal corrections to the dynamical mean-field approximation. Here we present a pedagogical discussion of the DCA by describing it as a Φ-derivable coarse-graining ...
E. Khatami +17 more
core +1 more source

