Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the upper critical dimension of the KPZ universality class: KPZ and related equations on a fully connected graph

Published 2 Mar 2026 in cond-mat.stat-mech and math-ph | (2603.02000v1)

Abstract: We investigate the infinite-dimensional limit of nonequilibrium surface growth by numerically integrating stochastic growth equations on a fully connected graph. In particular, we study the Edwards-Wilkinson (EW), Kardar-Parisi-Zhang (KPZ), and tensionless KPZ (TKPZ) equations. Using a network discretization adapted to the all-to-all interaction topology, we analyze the global roughness, height-fluctuation statistics, time power spectra, and two-time correlations. For the EW equation, we obtain an exact expression for the roughness that matches the numerical simulations and shows that the interface becomes flat as N→∞N \to \infty. We also compute analytically the time power spectrum, show that height fluctuations are Gaussian, and derive an explicit expression for the two-time height autocorrelation function, indicating that the aging behavior is trivial. For the KPZ equation, finite-size and strong-coupling effects can cause deviations from EW behavior at moderate system sizes NN, often accompanied by numerical instabilities; however, these differences disappear as NN increases. In the large-NN limit, KPZ dynamics converges to EW behavior, as the four observables analyzed exhibit identical scaling properties. Overall, our results indicate that on a fully connected graph the KPZ nonlinearity is irrelevant as N→∞N\to\infty, leading to EW-like dynamics with asymptotically flat interfaces. These findings are interpreted in the context of the upper critical dimension of the KPZ universality class.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.