Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · cond-mat/0403193

Clustering analysis of the ground-state structure of the vertex-cover problem

Wolfgang Barthel·Alexander K. Hartmann
View original source ↗Read source document ↗Export metadata ↓

Abstract

Vertex cover is one of the classical NP-complete problems in theoretical computer science. A vertex cover of a graph is a subset of vertices such that for each edge at least one of the two endpoints is contained in the subset. When studied on Erdos-Renyi random graphs (with connectivity c) one observes a threshold behavior: In the thermodynamic limit the size of the minimal vertex cover is independent of the specific graph. Recent analytical studies show that on the phase boundary, for small connectivities c<e, the system is replica symmetric, while for larger connectivities replica symmetry breaking occurs. This change coincides with a change of the typical running time of algorithms from polynomial to exponential. To understand the reasons for this behavior and to compare with the analytical results, we numerically analyze the structure of the solution landscape. For this purpose, we have also developed an algorithm, which allows the calculation of the backbone, without the need to enumerate all solutions. We study exact solutions found with a Branch-and-Bound algorithm as well as configurations obtained via a Monte Carlo simulation. We analyze the cluster structure of the solution landscape by direct clustering of the states, by analyzing the eigenvalue spectrum of correlation matrices and by using a hierarchical clustering method. All results are compatible with a change at c=e. For small connectivities, the solutions are collected in a finite small number of clusters, while the number of cluster diverges slowly with system size for larger connectivities and replica symmetry breaking, but not 1-RSB, occurs.

Explore related subjects

cond-mat.dis-nn

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Wolfgang Barthel, Alexander K. Hartmann. 2004-07-15. Clustering analysis of the ground-state structure of the vertex-cover problem. https://doi.org/10.1103/physreve.70.066120

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Irrationality Measure Controls Long-Wavelength Charge Fluctuations in Quasiperiodic Systems

Quasiperiodic order is characterized by irrational frequencies whose rational approximability known as irrationality measure defines distinct arithmetic classes. We establish that this arithmetic classification has direct physical consequences for long-wavelength charge fluctuations. In translation-covariant quasiperiodic systems, the infrared scaling of charge fluctuation is governed by the interplay between the irrationality exponent of irrational frequency and the large-harmonic decay of the hull charge profile: the latter determines the available charge weight, while the former controls how efficiently that weight is transferred to the infrared. Consequently, all algebraic irrational frequencies share the same arithmetic scaling, whereas exceptionally well-approximable transcendental frequencies can exhibit strongly enhanced infrared fluctuation scaling. We further prove that occupied states separated from the Fermi level by a gap stable throughout the hull contribute only an analytic infrared background, leaving the nontrivial scaling to near-Fermi states. Our results extend to general translation-covariant multi-frequency quasiperiodic systems.

cond-mat.dis-nn↗
arXiv2026

Curvature-Induced Geometric Universality in Non-Hermitian Anderson Transitions

In Euclidean space, universality classes of Anderson transitions are primarily determined by symmetry and spatial dimensionality. Here, we present evidence for a geometry-controlled universality class of non-Hermitian Anderson transitions on hyperbolic-like lattices. In this setting, critical behavior is influenced by the large-scale hyperbolic geometry, characterized by negative curvature, exponential volume growth, and a non-Euclidean notion of spatial scaling. Finite-size scaling of participation ratios across several distinct \( \{p,q\} \) tilings reveals one-parameter scaling collapses with a common critical exponent \( \nu\simeq1 \) within numerical accuracy. A complementary phenomenological coarse-grained Landau-Ginzburg analysis shows how exponential correlation-volume growth suppresses critical fluctuations, offering a rationale for the observed mean-field-like scaling. Our results suggest that spatial curvature can act as an additional organizing principle for Anderson-transition universality beyond the conventional dimensionality- and symmetry-based classification.

cond-mat.dis-nn↗
arXiv2026

Finite-rank multiplicative perturbations of rotationally invariant non-Hermitian random matrices

We study finite-rank multiplicative deformations of rotationally invariant non-Hermitian random matrices. More precisely, we consider models of the form $\mathbf{A}(\mathbf{I}+\mathbf{T})$, where $\mathbf{A}$ is a large rotationally invariant non-Hermitian random matrix, $\mathbf{T}$ is a finite-rank normal perturbation, and $\mathbf{I}$ denotes the identity matrix. We characterize the emergence of outlier eigenvalues, their fluctuations, and the associated eigenvector overlaps. Our results provide a multiplicative non-Hermitian counterpart to the classical Baik--Ben Arous--P\'ech\'e framework.

cond-mat.dis-nn↗