
Abstract Heat transport exhibits distinct regimes ranging from ballistic propagation to diffusive relaxation, traditionally described by disparate theoretical frameworks. Here, we introduce a unified first-order operator formulation in which temperature and heat flux are treated as a coupled state vector, yielding a physically constrained first-order operator representation of heat transport. The resulting generator is intrinsically non-Hermitian and gives rise to a spectral structure governed by an exceptional point that separates overdamped diffusion from underdamped wave-like propagation. In this framework, Fourier’s law emerges as a singular limit of a hyperbolic dissipative system, while the Cattaneo equation arises naturally as the minimal representative hydrodynamic closure of kinetic theory. We show that the exceptional point induces nonanalytic spectral transitions, nonmodal transient dynamics, and a breakdown of conventional modal decomposition. The theory further generalizes to anisotropic media, where direction-dependent exceptional surfaces enable intrinsic steering of heat flow. Rather than introducing a new transport equation, the present work provides an operator-theoretic reformulation of the classical Maxwell–Cattaneo dynamics, showing that its non-normal generator naturally admits an exceptional-point interpretation.
Abstract Although belief propagation is a useful inference tool in several network-based contexts given its speed, its precision deteriorates when encountering loops. Generalized belief propagation (GBP) was introduced around two decades ago to mitigate this issue. However, it did not become widely used since it did not provide an explicit algorithm applicable to any network. This only changed recently, with the introduction of the first explicit and general version of GBP for networks, the Cantwell–Newman (CN)-method, which remained until now the only algorithm with such properties. Here, we provide a family of algorithms with these characteristics. We begin by considering the case where the network only has short loops. In this scenario, we improve on the CN-method by developing a algorithm with optimal time complexity, the NIB-method. We then consider networks that also have long loops. In this context, we show that the NIB-method provides advantages compared to the CN-method: it is faster for the networks where the CN-method is expected to work well, and it is applicable to more networks, i.e. highly dense networks. In general, both the CN-method and the family algorithms introduced here become non-equivalent approximations, and they can provide different levels of accuracy when applied to the same network, as we show numerically using two artificial networks. This discrepancy can have important practical implications, as we discuss in the context of decoding and error correction.
Structured environments organize active-particle currents by coupling propulsion and orientational dynamics to geometry. Translationally periodic ratchets can produce a rotation-frequency-dependent drift across equivalent unit cells, but the locked position remains spatially degenerate. In this paper, we show that a radially periodic landscape removes this degeneracy through self-referential feedback that weakens with orbital radius. Trajectories initialized within finite capture basins converge to preferred phase-locked radii, and the resulting locked orbits exhibit a chirality-odd transverse mobility under a weak radial force. Depinned trajectories instead organize into near-integer winding branches whose normalized mean drift approaches the associated branch label. The second harmonic of the radial potential reshapes the radial barriers and changes which branches are reached from a prescribed initial state. Near a locking boundary, an effective angular potential describes noise-activated phase slips and their first-passage statistics. The full radial dynamics shows how repeated slips accumulate into radial spreading. With short-range repulsion, the radial-well structure remains visible as the particles redistribute outward. Together, these results establish a geometric route for organizing frequency-dependent transport in patterned, substrate-confined active matter and may guide the design of chiral microrobotic and granular-roller systems.
Accurate prediction of pedestrian flow at critical subway nodes (e.g. gates, escalators, staircases) prone to bottlenecks is fundamental to assessing collective dynamics (e.g. crowd crush risk). However, large peak and off-peak contrasts, spatial interdependencies, and heterogeneous node capacities undermine the predictive performance of single-expert models. To address such complexity, we propose a hybrid sequence- and graph-based Mixture of Experts approach, ResGAT-BX, comprising i) a Graph Attention Network to model spatial dependencies and ii) Bidirectional GRU and extended long short-term memory experts to capture temporal variability, thereby improving adaptability across conditions. Using ResGAT-BX predictions, we quantify node-level risk via crowd-gathering density, duration, and throughput fluctuation amplitude. Experiments on a real-world Qingdao subway dataset demonstrate i) ResGAT-BX's robustness via parameter-sensitivity analyses and ii) ResGAT-BX's consistently superior performance over state-of-the-art baselines for both direct flow volume prediction and derived crowd crush risk anticipation across multiple metrics and regimes, including peak surges and off-peak fluctuations. The dataset used in this study has been publicly released on GitHub: https://github.com/niupeng111/Node-Pedestrian-Flow-Dataset.