Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0801.1646

Particle-hole symmetry and the dirty boson problem

Peter B. Weichman·Ranjan Mukhopadhyay
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the role of particle-hole symmetry on the universality class of various quantum phase transitions corresponding to the onset of superfluidity at zero temperature of bosons in a quenched random medium. The functional integral formulation of this problem in d spatial dimensions yields a (d+1)-dimensional classical XY-model with extended disorder--the so-called random rod problem. Particle-hole symmetry may then be broken by adding nonzero site energies. We may distinguish three cases: (i) exact particle-hole symmetry, in which the site energies all vanish, (ii) statistical particle-hole symmetry in which the site energy distribution is symmetric about zero, vanishing on average, and (iii) complete absence of particle-hole symmetry in which the distribution is generic. We explore in each case the nature of the excitations in the non-superfluid Mott insulating and Bose glass phases. We find that the Bose glass compressibility, which has the interpretation of a temporal spin stiffness or superfluid density, is positive in cases (ii) and (iii), but that it vanishes with an essential singularity as full particle-hole symmetry is restored. We then focus on the critical point and discuss the relevance of type (ii) particle-hole symmetry breaking perturbations to the random rod critical behavior. We argue that a perturbation of type (iii) is irrelevant to the resulting type (ii) critical behavior: the statistical symmetry is restored on large scales close to the critical point, and case (ii) therefore describes the dirty boson fixed point. To study higher dimensions we attempt, with partial success, to generalize the Dorogovtsev-Cardy-Boyanovsky double epsilon expansion technique to this problem. The qualitative renormalization group flow picture this technique provides is quite compelling.

Explore related subjects

cond-mat.dis-nncond-mat.stat-mech

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Peter B. Weichman, Ranjan Mukhopadhyay. 2008-01-10. Particle-hole symmetry and the dirty boson problem. https://doi.org/10.1103/physrevb.77.214516

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

KEEP EXPLORING

Related papers

arXiv2026

The critical slowing down in training diffusion models

Computational sampling has been central to the sciences since the mid-20th century. While machine-learning-based approaches have recently enabled major advances, their behavior remains poorly understood, with limited theoretical control over when and why they succeed. Here we provide such insight for diffusion models---a class of generative schemes highly effective in practice---by analyzing their application to the $O(n)$ model of statistical field theory in the Gaussian limit $n \to \infty$. In this analytically tractable setting, we show that training a score model with a one-layer network architecture matching the exact solution exhibits a form of critical slowing down in parameter learning. This slowing down also impacts the generation process, indicating that the well-known difficulties of sampling near criticality persist even for learned generative models. To overcome this bottleneck, we consider the power of architectural depth. We find that using a two-layer architecture drastically reduces the critical slowing down, with the training time scaling logarithmically rather than quadratically with system size. Using a Fourier implementation of the architecture, we further show that this acceleration in training time can be achieved without drastically increasing operational complexity. Taken together, these results demonstrate that diffusion models can overcome the critical slowing down through appropriate architectural design, and establish a controlled framework for understanding and improving learned sampling methods in statistical physics and beyond.

cond-mat.dis-nn↗
arXiv2026

Switching diffusivity selects Pareto tail exponent in random growth with redistribution

Random multiplicative growth with redistribution generates stationary Pareto wealth tails in the Bouchaud-Mézard model, but assumes a fixed multiplicative noise intensity. This is restrictive for physical and financial growth processes, where volatility (diffusivity) is often fluctuating. We replace the constant noise intensity by a switching diffusivity and ask how these fluctuations select the Pareto stationary tail. For a geometric Brownian motion with switching diffusivity, the long-time Gaussian limit holds when the redraw law has finite mean and variance. The asymptotic variance retains a contribution from diffusivity persistence. With redistribution and a general redraw law, the stationary large-wealth problem is characterized by a spectral condition for admissible algebraic modes. For a two-state diffusivity, an exact tail analysis gives a Pareto exponent interpolating between the high-diffusivity slow-refresh limit and the mean-diffusivity fast-refresh Bouchaud-Mézard limit.

cond-mat.dis-nn↗
arXiv2026

Extreme-Scale Ising Machines with Cluster Mean-Field Theory

Scaling analog and digital Ising machines to larger problems requires overcoming finite device capacity and the cost of communication between devices. We present cluster mean-field theory (CMFT), a framework that partitions a large interaction graph into clusters sized to fit available hardware. Each cluster performs local updates independently, while interactions across cluster boundaries enter through periodically updated effective biases computed from boundary-spin averages. To reduce the error introduced by fixed cluster boundaries, we introduce dynamic partitioning, which cycles through multiple partitions so that interactions approximated by mean fields at one stage can act through instantaneous spins at another. On three-dimensional spin glasses and planted Pegasus instances, dynamic CMFT exhibits power-law decay of residual energy over sweep budgets. This shows that solution quality continues to improve with computational effort despite the mean-field approximation. An automated graph partitioner combined with a weighted recovery ratio provides a practical heuristic for selecting partition combinations on graphs without natural cut directions. We demonstrate CMFT on four GPUs with approximately four million p-bits, reaching comparable energy densities up to 15 times faster than a single-GPU implementation of the full graph. By coupling locally evolving clusters through programmable effective biases, CMFT provides a route to extreme-scale Ising machines on both analog and digital hardware.

cond-mat.dis-nn↗