arXiv subjects

Haijun Zhou

Publications and source records attributed to Haijun Zhou.

At least 19 recordsLinked to original sources

arXiv2026

Momentum-Space-Engineered Spatial Photonic Ising Machine for Long-Range Interactions

Long-range Ising models (LRIMs) with dense nonlocal and competing interactions are central to statistical physics, quantum simulation, and complex networks. Although the spatial photonic Ising machine (SPIM) exploits intrinsic optical parallelism for Ising computation, its ability to faithfully encode dense long-range couplings and capture the resulting thermodynamic signatures remains underexplored. Here, we present a momentum-space-engineered SPIM framework that maps prescribed long-range coupling kernels onto momentum-space masks for parallel Hamiltonian evaluation. Based on a high-fidelity optical field propagation model, the annealing dynamics of LRIMs with power-law and Ruderman-Kittel-Kasuya-Yosida (RKKY) interactions are systematically investigated. For the power-law model, we investigate the modulation of the estimated critical temperature by the decay exponent {\sigma} and coupling cutoff radius R. For the RKKY model, we reproduce diverse ordered states induced by complex competing long-range interactions. A proof-of-principle experiment demonstrates the physical feasibility of our approach. This framework broadens the class of many-body systems accessible to the SPIM platform.

quant-ph↗

arXiv2026

Efficient coding under constraint drives neural systems towards criticality and sloppiness

It is widely accepted that the brain operates near a critical state, characterized by neural avalanches that follow power-law distributions. However, the functional rationale for why neural systems attain criticality remains unclear. Here, we present a theoretical framework that links efficient coding to criticality in neural populations. Using a Gaussian population coding model, we demonstrate that maximizing Fisher information under resource constraints naturally leads to the emergence of soft modes and diverging correlation lengths, which are hallmarks of criticality. By introducing spatial structure, we unify two distinct perspectives of criticality: statistical criticality with diverging correlation lengths and dynamical criticality with critical slowing down as well as bifurcation. Furthermore, this framework provides a natural explanation for the sloppiness observed in neural systems. Numerical simulations confirm that optimization results in power-law response, providing a mechanistic link between efficient coding, sloppiness and the critical brain hypothesis.

q-bio.NC↗

arXiv2026

Coarse Graining Reveals a Fluctuation-theorem-like Asymmetry in Financial Markets

Fluctuation theorems show how coarse graining transforms microscopic symmetry into observable irreversibility. Here we ask whether an analogous symmetrybased diagnostic can be constructed for financial markets. At the microscopic level, each transaction pairs a buyer and a seller, whereas trading decisions are typically made from coarse-grained price histories. Using symmetric takeprofit and stop-loss rules, we compare the holding-time distributions of long and short trading ensembles generated from the same price series. Across equityindices, individual stocks and cryptocurrencies, the log-ratio of the two distributions shows a robust crossover. It remains nearly constant at short durations but becomes linear in the tail, implying an exponential directional asymmetry. The tail slope defines an effective market temperature, an operational measure of fluctuation intensity on the chosen observation scale. A Bachelier first-passage benchmark captures the exponential tails but not the asymmetry, because long and short positions share the same leading decay rate. By contrast, short-time correlations between overlapping positions provide a minimal mechanism for the asymmetry by generating direction-dependent subleading relaxation spectra in a coarse-grained Markov description. Together, these results establish a fluctuation-theorem-like diagnostic of irreversibility in financial markets and, more broadly, in complex systems accessible only through coarse-grained observables.

cond-mat.stat-mech↗

arXiv2022

An adaptive shortest-solution guided decimation approach to sparse high-dimensional linear regression

High-dimensional linear regression model is the most popular statistical model for high-dimensional data, but it is quite a challenging task to achieve a sparse set of regression coefficients. In this paper, we propose a simple heuristic algorithm to construct sparse high-dimensional linear regression models, which is adapted from the shortest solution-guided decimation algorithm and is referred to as ASSD. This algorithm constructs the support of regression coefficients under the guidance of the least-squares solution of the recursively decimated linear equations, and it applies an early-stopping criterion and a second-stage thresholding procedure to refine this support. Our extensive numerical results demonstrate that ASSD outperforms LASSO, vector approximate message passing, and two other representative greedy algorithms in solution accuracy and robustness. ASSD is especially suitable for linear regression problems with highly correlated measurement matrices encountered in real-world applications.

cs.LG↗

arXiv2012

Long Range Frustrations in a Spin Glass Model of the Vertex Cover Problem

In a spin glass system on a random graph, some vertices have their spins changing among different configurations of a ground--state domain. Long range frustrations may exist among these unfrozen vertices in the sense that certain combinations of spin values for these vertices may never appear in any configuration of this domain. We present a mean field theory to tackle such long range frustrations and apply it to the NP-hard minimum vertex cover (hard-core gas condensation) problem. Our analytical results on the ground-state energy density and on the fraction of frozen vertices are in good agreement with known numerical and mathematical results.

cond-mat.dis-nn↗

arXiv2012

Region graph partition function expansion and approximate free energy landscapes: Theory and some numerical results

Graphical models for finite-dimensional spin glasses and real-world combinatorial optimization and satisfaction problems usually have an abundant number of short loops. The cluster variation method and its extension, the region graph method, are theoretical approaches for treating the complicated short-loop-induced local correlations. For graphical models represented by non-redundant or redundant region graphs, approximate free energy landscapes are constructed in this paper through the mathematical framework of region graph partition function expansion. Several free energy functionals are obtained, each of which use a set of probability distribution functions or functionals as order parameters. These probability distribution function/functionals are required to satisfy the region graph belief-propagation equation or the region graph survey-propagation equation to ensure vanishing correction contributions of region subgraphs with dangling edges. As a simple application of the general theory, we perform region graph belief-propagation simulations on the square-lattice ferromagnetic Ising model and the Edwards-Anderson model. Considerable improvements over the conventional Bethe-Peierls approximation are achieved. Collective domains of different sizes in the disordered and frustrated square lattice are identified by the message-passing procedure. Such collective domains and the frustrations among them are responsible for the low-temperature glass-like dynamical behaviors of the system.

cond-mat.dis-nn↗

arXiv2012

Core percolation on complex networks

As a fundamental structural transition in complex networks, core percolation is related to a wide range of important problems. Yet, previous theoretical studies of core percolation have been focusing on the classical Erdős-Rényi random networks with Poisson degree distribution, which are quite unlike many real-world networks with scale-free or fat-tailed degree distributions. Here we show that core percolation can be analytically studied for complex networks with arbitrary degree distributions. We derive the condition for core percolation and find that purely scale-free networks have no core for any degree exponents. We show that for undirected networks if core percolation occurs then it is always continuous while for directed networks it becomes discontinuous when the in- and out-degree distributions are different. We also apply our theory to real-world directed networks and find, surprisingly, that they often have much larger core sizes as compared to random models. These findings would help us better understand the interesting interplay between the structural and dynamical properties of complex networks.

cond-mat.stat-mech↗

arXiv2012

Counting solutions from finite samplings

We formulate the solution counting problem within the framework of inverse Ising problem and use fast belief propagation equations to estimate the entropy whose value provides an estimate on the true one. We test this idea on both diluted models (random 2-SAT and 3-SAT problems) and fully-connected model (binary perceptron), and show that when the constraint density is small, this estimate can be very close to the true value. The information stored by the salamander retina under the natural movie stimuli can also be estimated and our result is consistent with that obtained by Monte Carlo method. Of particular significance is sizes of other metastable states for this real neuronal network are predicted.

cond-mat.stat-mech↗

arXiv2011

Partition Function Expansion on Region-Graphs and Message-Passing Equations

Disordered and frustrated graphical systems are ubiquitous in physics, biology, and information science. For models on complete graphs or random graphs, deep understanding has been achieved through the mean-field replica and cavity methods. But finite-dimensional `real' systems persist to be very challenging because of the abundance of short loops and strong local correlations. A statistical mechanics theory is constructed in this paper for finite-dimensional models based on the mathematical framework of partition function expansion and the concept of region-graphs. Rigorous expressions for the free energy and grand free energy are derived. Message-passing equations on the region-graph, such as belief-propagation and survey-propagation, are also derived rigorously.

cond-mat.stat-mech↗

arXiv2011

Partition function loop series for a general graphical model: free energy corrections and message-passing equations

A loop series expansion for the partition function of a general statistical model on a graph is carried out. If the auxiliary probability distributions of the expansion are chosen to be a fixed point of the belief-propagation equation, the first term of the loop series gives the Bethe-Peierls free energy functional at the replica-symmetric level of the mean-field spin glass theory, and corrections are contributed only by subgraphs that are free of dangling edges. This result generalize the early work of Chertkov and Chernyak on binary statistical models. If the belief-propagation equation has multiple fixed points, a loop series expansion is performed for the grand partition function. The first term of this series gives the Bethe-Peierls free energy functional at the first-step replica-symmetry-breaking (RSB) level of the mean-field spin-glass theory, and corrections again come only from subgraphs that are free of dangling edges, provided that the auxiliary probability distributions of the expansion are chosen to be a fixed point of the survey-propagation equation. The same loop series expansion can be performed for higher-level partition functions, obtaining the higher-level RSB Bethe-Peierls free energy functionals (and the correction terms) and message-passing equations without using the Bethe-Peierls approximation.

cond-mat.stat-mech↗

arXiv2011

Combined local search strategy for learning in networks of binary synapses

Learning in networks of binary synapses is known to be an NP-complete problem. A combined stochastic local search strategy in the synaptic weight space is constructed to further improve the learning performance of a single random walker. We apply two correlated random walkers guided by their Hamming distance and associated energy costs (the number of unlearned patterns) to learn a same large set of patterns. Each walker first learns a small part of the whole pattern set (partially different for both walkers but with the same amount of patterns) and then both walkers explore their respective weight spaces cooperatively to find a solution to classify the whole pattern set correctly. The desired solutions locate at the common parts of weight spaces explored by these two walkers. The efficiency of this combined strategy is supported by our extensive numerical simulations and the typical Hamming distance as well as energy cost is estimated by an annealed computation.

cond-mat.dis-nn↗

arXiv2011

Approaching the ground states of the random maximum two-satisfiability problem by a greedy single-spin flipping process

In this brief report we explore the energy landscapes of two spin glass models using a greedy single-spin flipping process, {\tt Gmax}. The ground-state energy density of the random maximum two-satisfiability problem is efficiently approached by {\tt Gmax}. The achieved energy density $e(t)$ decreases with the evolution time $t$ as $e(t)-e(\infty)=h (\log_{10} t)^{-z}$ with a small prefactor $h$ and a scaling coefficient $z > 1$, indicating an energy landscape with deep and rugged funnel-shape regions. For the $\pm J$ Viana-Bray spin glass model, however, the greedy single-spin dynamics quickly gets trapped to a local minimal region of the energy landscape.

cond-mat.dis-nn↗

arXiv2010

Ground-state configuration space heterogeneity of random finite-connectivity spin glasses and random constraint satisfaction problems

We demonstrate through two case studies, one on the p-spin interaction model and the other on the random K-satisfiability problem, that a heterogeneity transition occurs to the ground-state configuration space of a random finite-connectivity spin glass system at certain critical value of the constraint density. At the transition point, exponentially many configuration communities emerge from the ground-state configuration space, making the entropy density s(q) of configuration-pairs a non-concave function of configuration-pair overlap q. Each configuration community is a collection of relatively similar configurations and it forms a stable thermodynamic phase in the presence of a suitable external field. We calculate s(q) by the replica-symmetric and the first-step replica-symmetry-broken cavity methods, and show by simulations that the configuration space heterogeneity leads to dynamical heterogeneity of particle diffusion processes because of the entropic trapping effect of configuration communities. This work clarifies the fine structure of the ground-state configuration space of random spin glass models, it also sheds light on the glassy behavior of hard-sphere colloidal systems at relatively high particle volume fraction.

cond-mat.dis-nn↗

arXiv2010

Solution space heterogeneity of the random K-satisfiability problem: Theory and simulations

The random K-satisfiability (K-SAT) problem is an important problem for studying typical-case complexity of NP-complete combinatorial satisfaction; it is also a representative model of finite-connectivity spin-glasses. In this paper we review our recent efforts on the solution space fine structures of the random K-SAT problem. A heterogeneity transition is predicted to occur in the solution space as the constraint density alpha reaches a critical value alpha_cm. This transition marks the emergency of exponentially many solution communities in the solution space. After the heterogeneity transition the solution space is still ergodic until alpha reaches a larger threshold value alpha_d, at which the solution communities disconnect from each other to become different solution clusters (ergodicity-breaking). The existence of solution communities in the solution space is confirmed by numerical simulations of solution space random walking, and the effect of solution space heterogeneity on a stochastic local search algorithm SEQSAT, which performs a random walk of single-spin flips, is investigated. The relevance of this work to glassy dynamics studies is briefly mentioned.

cond-mat.dis-nn↗

arXiv2010

Criticality and Heterogeneity in the Solution Space of Random Constraint Satisfaction Problems

Random constraint satisfaction problems are interesting model systems for spin-glasses and glassy dynamics studies. As the constraint density of such a system reaches certain threshold value, its solution space may split into extremely many clusters. In this paper we argue that this ergodicity-breaking transition is preceded by a homogeneity-breaking transition. For random K-SAT and K-XORSAT, we show that many solution communities start to form in the solution space as the constraint density reaches a critical value alpha_cm, with each community containing a set of solutions that are more similar with each other than with the outsider solutions. At alpha_cm the solution space is in a critical state. The connection of these results to the onset of dynamical heterogeneity in lattice glass models is discussed.

cond-mat.dis-nn↗

arXiv2010

Learning by random walks in the weight space of the Ising perceptron

Several variants of a stochastic local search process for constructing the synaptic weights of an Ising perceptron are studied. In this process, binary patterns are sequentially presented to the Ising perceptron and are then learned as the synaptic weight configuration is modified through a chain of single- or double-weight flips within the compatible weight configuration space of the earlier learned patterns. This process is able to reach a storage capacity of $α\approx 0.63$ for pattern length N = 101 and $α\approx 0.41$ for N = 1001. If in addition a relearning process is exploited, the learning performance is further improved to a storage capacity of $α\approx 0.80$ for N = 101 and $α\approx 0.42$ for N=1001. We found that, for a given learning task, the solutions constructed by the random walk learning process are separated by a typical Hamming distance, which decreases with the constraint density $α$ of the learning task; at a fixed value of $α$, the width of the Hamming distance distributions decreases with $N$.

cond-mat.dis-nn↗

arXiv2009

Glassy Behavior and Jamming of a Random Walk Process for Sequentially Satisfying a Constraint Satisfaction Formula

Random $K$-satisfiability ($K$-SAT) is a model system for studying typical-case complexity of combinatorial optimization. Recent theoretical and simulation work revealed that the solution space of a random $K$-SAT formula has very rich structures, including the emergence of solution communities within single solution clusters. In this paper we investigate the influence of the solution space landscape to a simple stochastic local search process {\tt SEQSAT}, which satisfies a $K$-SAT formula in a sequential manner. Before satisfying each newly added clause, {\tt SEQSAT} walk randomly by single-spin flips in a solution cluster of the old subformula. This search process is efficient when the constraint density $α$ of the satisfied subformula is less than certain value $α_{cm}$; however it slows down considerably as $α> α_{cm}$ and finally reaches a jammed state at $α\approx α_{j}$. The glassy dynamical behavior of {\tt SEQSAT} for $α\geq α_{cm}$ probably is due to the entropic trapping of various communities in the solution cluster of the satisfied subformula. For random 3-SAT, the jamming transition point $α_j$ is larger than the solution space clustering transition point $α_d$, and its value can be predicted by a long-range frustration mean-field theory. For random $K$-SAT with $K\geq 4$, however, our simulation results indicate that $α_j = α_d$. The relevance of this work for understanding the dynamic properties of glassy systems is also discussed.

cond-mat.dis-nn↗

arXiv2009

Communities of solutions in single solution clusters of a random K-Satisfiability formula

The solution space of a K-satisfiability (K-SAT) formula is a collection of solution clusters, each of which contains all the solutions that are mutually reachable through a sequence of single-spin flips. Knowledge of the statistical property of solution clusters is valuable for a complete understanding of the solution space structure and the computational complexity of the random K-SAT problem. This paper explores single solution clusters of random 3- and 4-SAT formulas through unbiased and biased random walk processes and the replica-symmetric cavity method of statistical physics. We find that the giant connected component of the solution space has already formed many different communities when the constraint density of the formula is still lower than the solution space clustering transition point. Solutions of the same community are more similar with each other and more densely connected with each other than with the other solutions. The entropy density of a solution community is calculated using belief propagation and is found to be different for different communities of the same cluster. When the constraint density is beyond the clustering transition point, the same behavior is observed for the solution clusters reached by several stochastic search algorithms. Taking together, the results of this work suggests a refined picture on the evolution of the solution space structure of the random K-SAT problem; they may also be helpful for designing new heuristic algorithms.

cond-mat.dis-nn↗