Complete realization of energy landscapes and non-equilibrium trapping dynamics in small spin glass and optimization problems.

Energy landscapes are high-dimensional surfaces underlie all physical systems, which determine crucially the energetic and behavioral dependence of the systems on variable configurations, but are difficult to be analyzed due to their high-dimensional nature. Here we introduce an approach to reveal for the complete energy landscapes of spin glasses and Boolean satisfiability problems with a small system size, and unravels their non-equilibrium dynamics at an arbitrary temperature for an arbitrarily long time. Remarkably, our results show that it can be less likely for the system to attain ground states when temperature decreases, due to trapping in individual local minima, which ceases at a different time, leading to multiple abrupt jumps in the ground-state probability.

Understanding the stochastic dynamics of sequential decision-making processes: A path-integral analysis of multi-armed bandits.

The multi-armed bandit (MAB) model is one of the most classical models to study decision-making in an uncertain environment. In this model, a player chooses one of K possible arms of a bandit machine to play at each time step, where the corresponding arm returns a random reward to the player, potentially from a specific unknown distribution. The target of the player is to collect as many rewards as possible during the process.

A high-frequency mobility big-data reveals how COVID-19 spread across professions, locations and age groups.

As infected and vaccinated population increases, some countries decided not to impose non-pharmaceutical intervention measures anymore and to coexist with COVID-19. However, we do not have a comprehensive understanding of its consequence, especially for China where most population has not been infected and most Omicron transmissions are silent. This paper aims to reveal the complete silent transmission dynamics of COVID-19 by agent-based simulations overlaying a big data of more than 0.

Bilevel optimization in flow networks: A message-passing approach.

Optimizing embedded systems, where the optimization of one depends on the state of another, is a formidable computational and algorithmic challenge, that is ubiquitous in real world systems. We study flow networks, where bilevel optimization is relevant to traffic planning, network control, and design, and where flows are governed by an optimization requirement subject to the network parameters. We employ message passing algorithms in flow networks with sparsely coupled structures to adapt network parameters that govern the network flows, in order to optimize a global objective.

Scalable node-disjoint and edge-disjoint multiwavelength routing.

Probabilistic message-passing algorithms are developed for routing transmissions in multiwavelength optical communication networks, under node- and edge-disjoint routing constraints and for various objective functions. Global routing optimization is a hard computational task on its own but is made much more difficult under the node- and edge-disjoint constraints and in the presence of multiple wavelengths, a problem which dominates routing efficiency in real optical communication networks that carry most of the world's internet traffic. The scalable principled method we have developed is exact on trees but provides good approximate solutions on locally treelike graphs.

Optimally coordinated traffic diversion by statistical physics.

Road accidents or maintenance often lead to the blockage of roads, causing severe traffic congestion. Diverted routes after road blockage are often decided individually and have no coordination. Here, we employ the cavity approach in statistical physics to obtain both analytical results and optimization algorithms to optimally divert and coordinate individual vehicle routes after road blockage.

Futility of being selfish in optimized traffic.

Optimizing traffic flow is essential for easing congestion. However, even when globally optimal, coordinated, and individualized routes are provided, users may choose alternative routes which offer lower individual costs. By analyzing the impact of selfish route choices on performance using the cavity method, we find that a small ratio of selfish route choices improves the global performance of uncoordinated transportation networks but degrades the efficiency of optimized systems.

Global benefit of randomness in individual routing on transportation networks.

By introducing a simple model based on two-dimensional cellular automata, we reveal the relationship between the routing strategies of individual vehicles and the global behavior of transportation networks. Specifically, we characterize the routing strategies by a single parameter called path-greediness, which corresponds to the tendency for individuals to travel via a shortest path to the destination. Remarkably, we found that the effective dimension of the system is reduced when the congested states emerge.

Coordinating dynamical routes with statistical physics on space-time networks.

Coordination of dynamical routes can alleviate traffic congestion and is essential for the coming era of autonomous self-driving cars. However, dynamical route coordination is difficult and many existing routing protocols are either static or without intervehicle coordination. In this paper, we first apply the cavity approach in statistical physics to derive the theoretical behavior and an optimization algorithm for dynamical route coordination, but they become computationally intractable as the number of time segments increases.

Entropy Inflection and Invisible Low-Energy States: Defensive Alliance Example.

Lower temperature leads to a higher probability of visiting low-energy states. This intuitive belief underlies most physics-inspired strategies for addressing hard optimization problems. For instance, the popular simulated annealing (SA) dynamics is expected to approach a ground state if the temperature is lowered appropriately.

Slow spin dynamics and self-sustained clusters in sparsely connected systems.

To identify emerging microscopic structures in low-temperature spin glasses, we study self-sustained clusters (SSC) in spin models defined on sparse random graphs. A message-passing algorithm is developed to determine the probability of individual spins to belong to SSC. We then compare the predicted SSC associations with the dynamical properties of spins obtained from numerical simulations and show that SSC association identifies individual slow-evolving spins.

Evolving power grids with self-organized intermittent strain releases: An analogy with sandpile models and earthquakes.

The stability of powergrid is crucial since its disruption affects systems ranging from street lightings to hospital life-support systems. While short-term dynamics of single-event cascading failures have been extensively studied, less is understood on the long-term evolution and self-organization of powergrids. In this paper, we introduce a simple model of evolving powergrid and establish its connection with the sandpile model and earthquakes, i.

Predicting the future trend of popularity by network diffusion.

Conventional approaches to predict the future popularity of products are mainly based on extrapolation of their current popularity, which overlooks the hidden microscopic information under the macroscopic trend. Here, we study diffusion processes on consumer-product and citation networks to exploit the hidden microscopic information and connect consumers to their potential purchase, publications to their potential citers to obtain a prediction for future item popularity. By using the data obtained from the largest online retailers including Netflix and Amazon as well as the American Physical Society citation networks, we found that our method outperforms the accurate short-term extrapolation and identifies the potentially popular items long before they become prominent.

Recovery of infrastructure networks after localised attacks.

The stability of infrastructure network is always a critical issue studied by researchers in different fields. A lot of works have been devoted to reveal the robustness of the infrastructure networks against random and malicious attacks. However, real attack scenarios such as earthquakes and typhoons are instead localised attacks which are investigated only recently.

Empirical Studies on the Network of Social Groups: The Case of Tencent QQ.

Background: Participation in social groups are important but the collective behaviors of human as a group are difficult to analyze due to the difficulties to quantify ordinary social relation, group membership, and to collect a comprehensive dataset. Such difficulties can be circumvented by analyzing online social networks.

Methodology/principal Findings: In this paper, we analyze a comprehensive dataset released from Tencent QQ, an instant messenger with the highest market share in China.

Coverage versus supply cost in facility location: physics of frustrated spin systems.

A comprehensive coverage is crucial for communication, supply, and transportation networks, yet it is limited by the requirement of extensive infrastructure and heavy energy consumption. Here, we draw an analogy between spins in antiferromagnet and outlets in supply networks, and apply techniques from the studies of disordered systems to elucidate the effects of balancing the coverage and supply costs on the network behavior. A readily applicable, coverage optimization algorithm is derived.

Self-sustained clusters and ergodicity breaking in spin models.

Self-sustained spin clusters are analytically linked to ergodicity breaking in fully connected Ising and Sherrington-Kirkpatick (SK) models, relating the less understood spin space to the well understood state space. This correspondence is established through the absence of clusters in the paramagnetic phase, the presence of one dominant cluster in the Ising ferromagnet, and the formation of nontrivial clusters in SK spin glass. Yet unobserved phenomena are also revealed such as a first order phase transition in cluster sizes in the SK ferromagnet.

From the physics of interacting polymers to optimizing routes on the London Underground.

Optimizing paths on networks is crucial for many applications, ranging from subway traffic to Internet communication. Because global path optimization that takes account of all path choices simultaneously is computationally hard, most existing routing algorithms optimize paths individually, thus providing suboptimal solutions. We use the physics of interacting polymers and disordered systems to analyze macroscopic properties of generic path optimization problems and derive a simple, principled, generic, and distributed routing algorithm capable of considering all individual path choices simultaneously.

Competition for shortest paths on sparse graphs.

Optimal paths connecting randomly selected network nodes and fixed routers are studied analytically in the presence of a nonlinear overlap cost that penalizes congestion. Routing becomes more difficult as the number of selected nodes increases and exhibits ergodicity breaking in the case of multiple routers. The ground state of such systems reveals nonmonotonic complex behaviors in average path length and algorithmic convergence, depending on the network topology, and densities of communicating nodes and routers.

Self-organization in social tagging systems.

Individuals often imitate each other to fall into the typical group, leading to a self-organized state of typical behaviors in a community. In this paper, we model self-organization in social tagging systems and illustrate the underlying interaction and dynamics. Specifically, we introduce a model in which individuals adjust their own tagging tendency to imitate the average tagging tendency.

Leaders in social networks, the Delicious case.

Finding pertinent information is not limited to search engines. Online communities can amplify the influence of a small number of power users for the benefit of all other users. Users' information foraging in depth and breadth can be greatly enhanced by choosing suitable leaders.

Enhancing synchronization by directionality in complex networks.

We propose a method called the residual edge-betweenness gradient (REBG) to enhance the synchronizability of networks by assigning the link direction while keeping the topology and link weights unchanged. Direction assignment has been shown to improve the synchronizability of undirected networks in general, but we find that in some cases incommunicable components emerge and networks fail to synchronize. We show that the REBG method improves the residual degree gradient (RDG) method by effectively avoiding the synchronization failure.