Next Issue
Volume 28, September
Previous Issue
Volume 28, July
 
 
entropy-logo

Journal Browser

Journal Browser

Entropy, Volume 28, Issue 8 (August 2026) – 109 articles

Cover Story (view full-size image): Modern machine learning looks like a rival to Bayesian inference. This paper argues that it is an implementation of it. Conformal prediction, autoregressive language models, prior-data fitted networks and score-based diffusion each constructs, calibrates or samples one object: the one-step-ahead density p(yn+1|y1:n). Breiman's two cultures subsequently dissolve. One route marginalizes a posterior, the other evaluates a map learned once by simulation, and de Finetti's theorem identifies the two. Amortization is the bargain, measure transport the mechanism, relative entropy the currency, and Generative Bayesian Computation the connective spine. A single Rosetta table grades every equivalence as exact, asymptotic or approximate, and marks where the framework stops: prediction is not attribution. View this paper
  • Issues are regarded as officially published after their release is announced to the table of contents alert mailing list.
  • You may sign up for e-mail alerts to receive table of contents of newly released issues.
  • PDF is the official format for papers published in both, html and pdf forms. To view the papers in pdf format, click on the "PDF Full-text" link, and use the free Adobe Reader to open them.
Order results
Result details
Section
Select all
Export citation of selected articles as:
18 pages, 849 KB  
Article
Distributed Kalman Filter with Maximum Correlation Entropy Criterion and Consensus Weighted Term Fusion
by Xiaoliang Feng, Zhouliner Gao and Teng Liu
Entropy 2026, 28(8), 941; https://doi.org/10.3390/e28080941 - 21 Aug 2026
Viewed by 280
Abstract
Distributed maximum correntropy Kalman filters improve robustness to non-Gaussian noise, but existing variants generally introduce consensus through average or weighted fusion without explicitly separating the innovation residual from the state-disagreement residual in a dimensionally consistent objective. This paper proposes a Distributed Maximum Correntropy [...] Read more.
Distributed maximum correntropy Kalman filters improve robustness to non-Gaussian noise, but existing variants generally introduce consensus through average or weighted fusion without explicitly separating the innovation residual from the state-disagreement residual in a dimensionally consistent objective. This paper proposes a Distributed Maximum Correntropy Kalman Filter with Innovation and Consensus Weighting Terms (DMCKF-IW-CWT). The innovation and consensus residuals are normalized separately and mapped by Gaussian kernels, after which the resulting information matrices are incorporated into a fixed-point local update. Posterior covariance intersection (CI) is then used to fuse neighboring estimates without requiring the unavailable cross-covariances. A sufficient contraction condition is given for the fixed-point iteration. In a five-node benchmark with 500 independent Monte Carlo runs and 1000 sampling steps, the proposed method obtains overall, transient, and steady-state MAEs of 0.172210, 0.188271, and 0.168195, respectively, corresponding to reductions of 0.254%, 0.526%, and 0.178% relative to DMCKF-W; the paired 95% confidence intervals of all three differences remain below zero. The consensus RMS is further reduced by 5.371%. Additional tests involving five noise families, packet loss and communication noise, a four-state nonlinear model, and systems with up to eight states and twenty nodes confirm the numerical convergence and extensibility of the framework. Full article
(This article belongs to the Section Information Theory, Probability and Statistics)
Show Figures

Figure 1

65 pages, 729 KB  
Article
Pseudo-Additive Tsallis Entropy and Non-Factorizing Joint Statistics in Product Sheffer Stroke Basic Algebras
by Ibrahim Senturk, Metin Bilge and Tahsin Oner
Entropy 2026, 28(8), 940; https://doi.org/10.3390/e28080940 - 21 Aug 2026
Viewed by 191
Abstract
This paper addresses the problem of formulating generalized, non-extensive information-theoretic measures on finite non-distributive algebraic structures equipped with Riečan states, with particular emphasis on product Sheffer stroke basic algebras. Our approach formalizes finite summations, admissible partitions, refinement relations, and Sheffer stroke joint refinement [...] Read more.
This paper addresses the problem of formulating generalized, non-extensive information-theoretic measures on finite non-distributive algebraic structures equipped with Riečan states, with particular emphasis on product Sheffer stroke basic algebras. Our approach formalizes finite summations, admissible partitions, refinement relations, and Sheffer stroke joint refinement candidates by using the primitive Sheffer stroke operation, with partition and marginalization properties imposed under the stated product and admissibility assumptions. By leveraging the state-theoretic properties of Riečan states, we construct baseline Shannon and logical entropies alongside algorithmic procedures for their computational evaluation. As the main result, we introduce and analytically characterize a parametric Tsallis entropy functional over these basic algebras. We prove its fundamental properties, including bounding inequalities, state concavity, monotonicity under refinement, subadditivity (for α>1), conditional chain-type identities under the relevant joint refinement marginalization assumptions, and exact analytical convergence to the classical Shannon limit as the entropic index α1. Furthermore, under a state-dependent statistical independence condition, we show that the joint Tsallis entropy satisfies a pseudo-additive relation. By defining the Tsallis mutual information and the associated pseudo-additive residual, we isolate the deviation of a joint Sheffer stroke refinement from the factorized model determined by its marginal Riečan-state distributions. This residual is intended as a state-dependent algebraic indicator of deviations from the factorized Tsallis pseudo-additive model; it is not claimed to be an operational contextuality witness, a contextuality inequality, an entanglement measure, or a physical implementation criterion. Full article
(This article belongs to the Special Issue Uncertainty and Fuzziness: Analysis and Applications)
Show Figures

Figure 1

38 pages, 1394 KB  
Article
A Correlation-Decoupled Interval Belief Rule Base for Interpretable Cross-Condition Bearing Fault Diagnosis
by Xingchi Yan, Yan Yu and Ning Li
Entropy 2026, 28(8), 939; https://doi.org/10.3390/e28080939 - 21 Aug 2026
Viewed by 197
Abstract
Cross-condition bearing fault diagnosis requires models that remain reliable under load-induced distribution shifts while providing transparent and traceable reasoning. Conventional belief rule bases (BRBs) may repeatedly use correlated vibration evidence during inference, and their Cartesian-product rule construction can rapidly increase rule-base complexity. This [...] Read more.
Cross-condition bearing fault diagnosis requires models that remain reliable under load-induced distribution shifts while providing transparent and traceable reasoning. Conventional belief rule bases (BRBs) may repeatedly use correlated vibration evidence during inference, and their Cartesian-product rule construction can rapidly increase rule-base complexity. This study proposes a correlation-decoupled interval belief rule base (CD-IBRB) for cross-condition bearing fault diagnosis. Seven diagnostically relevant time-domain features are selected using XGBoost and transformed into a less-correlated feature space through a Kendall-rank-correlation-guided matrix estimated exclusively from the source training data. Attribute-wise referential points and intervals are then constructed from the transformed training attributes, allowing the rule base to grow additively rather than combinatorially. Initial belief distributions are obtained from interval-level class distributions. The projection covariance matrix adaptation evolution strategy (P-CMA-ES) jointly optimizes the belief degrees, rule reliabilities, and rule weights, while evidential reasoning aggregates the activated interval rules to produce the final diagnostic result. In the primary cross-load bearing experiment, CD-IBRB achieved an accuracy of 0.9702 and a macro-averaged F1 score of 0.9703. It outperformed the strongest BRB variant and data-driven baseline by 7.70 and 6.10 percentage points in accuracy, respectively. Ablation experiments confirmed that removing parameter optimization or attribute decoupling reduced accuracy to 0.9053 and 0.9303, respectively. Additional cross-load and noise-injection experiments further demonstrated the stability of CD-IBRB under load shifts and input disturbances. Across five public multiclass datasets, CD-IBRB achieved a mean accuracy of 0.9004 and consistently outperformed the compared BRB variants. These results demonstrate that CD-IBRB provides a compact, uncertainty-aware, and traceable framework for cross-condition bearing fault diagnosis. Full article
Show Figures

Figure 1

21 pages, 6389 KB  
Article
Fixed-Candidate Reliability Auditing for Closed-Set Binary Function Retrieval Under Known-Source Cross-Compilation Protocols
by Yiming An, Yanshu Yu, Weidong Li and Orest Kochan
Entropy 2026, 28(8), 938; https://doi.org/10.3390/e28080938 - 21 Aug 2026
Viewed by 305
Abstract
Binary code similarity detection (BCSD) ranks candidates but does not quantify the reliability of an already selected Top-1 match. We study this post-retrieval problem in a known-source, closed-set protocol: the target Top-1 is frozen before same-source cross-compilation views are queried, so auxiliary evidence [...] Read more.
Binary code similarity detection (BCSD) ranks candidates but does not quantify the reliability of an already selected Top-1 match. We study this post-retrieval problem in a known-source, closed-set protocol: the target Top-1 is frozen before same-source cross-compilation views are queried, so auxiliary evidence audits cannot replace it. A frozen 34-variable map feeds a low-capacity logistic model with project-grouped cross-fitting, Platt calibration, and training-side threshold selection. On 413 families from 16 projects, cross-view evidence improved discrimination over target score/margin features. GCC-O0 was a dominant-anchor regime: Full showed no statistically resolved ROC-AUC gain over Primary-anchor, whereas Clang-O0 benefited from complementary non-primary evidence. On 240 project-identity-disjoint families from 55 projects, the design-locked structural branch accepted 75/240 GCC and 99/240 Clang candidates (31.3%/41.3% coverage) with no observed family-level errors. Correspondence mismatch reduced discrimination toward chance. Corrected TF-IDF remained supportive because correction followed label access. The contribution of this paper is a versioned candidate-preserving audit interface with explicit evidence and deployment boundaries, but not a universal retrieval improvement or distribution-free guarantee. Full article
(This article belongs to the Section Information Theory, Probability and Statistics)
Show Figures

Figure 1

26 pages, 4577 KB  
Article
Structural Evolution and Cascading Propagation of Supply Risk in the Global Nickel Industry Chain: A Multilayer Network Approach
by Yi Liang, Xiaoduo Wang, Han Liu and Hao Wang
Entropy 2026, 28(8), 937; https://doi.org/10.3390/e28080937 - 21 Aug 2026
Viewed by 267
Abstract
Geopolitical conflicts, resource-protection policies, and unexpected disruptions have heightened supply-security concerns across the global nickel industry chain. This study constructs a multilayer trade network based on complex network theory to characterize structural evolution across the upstream, midstream, and downstream segments and applies a [...] Read more.
Geopolitical conflicts, resource-protection policies, and unexpected disruptions have heightened supply-security concerns across the global nickel industry chain. This study constructs a multilayer trade network based on complex network theory to characterize structural evolution across the upstream, midstream, and downstream segments and applies a cascading-failure model to simulate the propagation of supply risks. There are four main findings: (1) The global nickel trade network exhibits pronounced layer heterogeneity, with the midstream layer acting as the principal amplifier of cascading failure risks. (2) Nodes with high centrality and broad cross-layer participation largely coincide with the countries that generate the largest systemic risks. (3) A small group of countries controls most trade flows and dominates risk transmission. (4) The center of systemic risk is shifting from traditional industrial and trading economies toward resource suppliers and countries that integrate resource extraction with processing. These findings support a risk-governance strategy based on diversified supply sources, dynamic monitoring of critical nodes, improved resilience in midstream smelting and refining, strategic resource stockpiling, and the circular utilization of nickel resources. Full article
(This article belongs to the Special Issue Analysis of Critical Behavior in Complex Systems)
Show Figures

Figure 1

14 pages, 901 KB  
Article
Directed Interband Response at Null Biorthogonal Quantum-Geometric Components
by Xinyi Xie, Jia-Ning Zhu and Bo Wan
Entropy 2026, 28(8), 936; https://doi.org/10.3390/e28080936 - 21 Aug 2026
Viewed by 301
Abstract
Biorthogonal quantum geometry is often read through scalar tensor components. In non-Hermitian bands, however, the biorthogonal contraction can lose the ordering of the left-right interband matrix elements from which a scalar component is formed. We study this information loss for spectrally separated, diagonalizable [...] Read more.
Biorthogonal quantum geometry is often read through scalar tensor components. In non-Hermitian bands, however, the biorthogonal contraction can lose the ordering of the left-right interband matrix elements from which a scalar component is formed. We study this information loss for spectrally separated, diagonalizable two-band Bloch Hamiltonians. For a specified control parameter, the Hamiltonian variation defines a local response vertex. In the instantaneous biorthogonal eigenbasis, the interband part of this vertex is completely specified by two ordered matrix elements, whereas the corresponding equal-parameter scalar QGT component retains only their product. This separation leads to a local classification of interband vertices into no-interband, Hermitian-locked, generic complex-transverse, and complex-null cases. On a complex-null branch, the scalar component can vanish even though one ordered interband matrix element remains nonzero. We identify this as a local chiral-vertex mechanism in a vertex-resolved geometric response kernel, distinct from generic non-Hermiticity or exceptional-point proximity. Nonreciprocal SSH, a two-dimensional complex-spin–orbit lattice, and a kz-only chiral ladder stack realize the same mechanism in one, two, and three dimensions, while diagonal and gain–loss-like vertices provide nonselective comparisons. Full article
Show Figures

Figure 1

21 pages, 6760 KB  
Article
An Evaluation Method for Influential Nodes Based on Multi-Attribute Neighbor Contributions in Complex Networks
by Na Zhao, Chao Dai, Guolin Yang, Ting Luo, Nifei Xiong and Jian Wang
Entropy 2026, 28(8), 935; https://doi.org/10.3390/e28080935 - 21 Aug 2026
Viewed by 278
Abstract
Accurately identifying influential nodes is essential for analyzing network structures and optimizing information propagation. Existing methods predominantly rely on single indicators such as degree, H-index, or k-shell, inherently limiting their ability to capture a node’s true influence. Recent hybrid centrality approaches attempt to [...] Read more.
Accurately identifying influential nodes is essential for analyzing network structures and optimizing information propagation. Existing methods predominantly rely on single indicators such as degree, H-index, or k-shell, inherently limiting their ability to capture a node’s true influence. Recent hybrid centrality approaches attempt to address this by combining multiple local and global attributes; however, they typically integrate features through simple weighting or superposition, failing to characterize the intrinsic synergy among structural properties. Furthermore, they often quantify neighbor contributions too coarsely, overlook the regulatory role of edge strength, and some suffer from high computational complexity, limiting scalability. To overcome these deficiencies, we propose WKDH, a novel influential node identification method based on multi-attribute neighbor contributions. WKDH fuses local structural attributes (degree and H-index) with global structural attributes (k-shell) via a multiplicative weighted synergy model, simultaneously capturing local connection “quantity,” local connection “quality,” and global core-layer position. By transforming neighbors’ comprehensive characteristics into regulated contribution degrees, WKDH mitigates excessive self-attribute interference and accurately reflects the actual propagation potential of edges. Notably, the method achieves linear computational complexity of O(m). Experimental results on nine real-world and six artificial networks demonstrate that WKDH outperforms nine established indicators in terms of node influence ranking, identification of high-influence nodes, and measuring propagation capability. Moreover, WKDH exhibits strong universality across diverse network structures, as it operates without parameter tuning. Full article
Show Figures

Figure 1

26 pages, 4633 KB  
Article
Event-Triggered Prescribed Performance Control for Maglev Systems Subject to Multiple Constraints
by Chenglong Zhu, Xiaolong Chen, Xinming Guo and Wei Sun
Entropy 2026, 28(8), 934; https://doi.org/10.3390/e28080934 - 20 Aug 2026
Viewed by 193
Abstract
Maglev trains are susceptible to various types of operational challenges, including track irregularities, load variations, and actuator faults. It is evident that these factors can compromise suspension performance and even pose a serious risk to operational safety. This paper proposes a prescribed performance [...] Read more.
Maglev trains are susceptible to various types of operational challenges, including track irregularities, load variations, and actuator faults. It is evident that these factors can compromise suspension performance and even pose a serious risk to operational safety. This paper proposes a prescribed performance event-triggered fault-tolerant control method for the electromagnetic suspension system of a maglev train subject to multiple constraints. A projection-based adaptive extended state observer is designed to estimate the unknown gain caused by actuator faults and load variations, as well as the external disturbance. In light of the disparity in upper and lower safety margins inherent to the suspension gap error, arising from track irregularities, an asymmetric prescribed performance function and an error transformation are devised to ensure that the gap tracking error perpetually complies with the asymmetric prescribed performance constraint. In addressing the issue of rapid variations in the suspension gap, the vertical velocity is also constrained through the implementation of prescribed performance, resulting in a joint constraint framework that encompasses both the gap tracking error and the vertical motion. A dynamic event-triggered mechanism has been incorporated into the backstepping design with a view to reducing unnecessary control updates under limited communication resources, while Zeno behavior has been excluded from the closed-loop system. Within this framework, a dynamic gain adjustment mechanism with an explicitly bounded rate of variation is further developed to achieve smoother gain adaptation. The uniform ultimate boundedness of all closed-loop signals is demonstrated through Lyapunov stability analysis under the prescribed multiple constraints. The efficacy of the proposed method is demonstrated through comparative simulation results. Full article
(This article belongs to the Special Issue Information Theory in Control Systems, 3rd Edition)
Show Figures

Figure 1

42 pages, 4656 KB  
Article
Parameter-Independent Feature Ranking with Volume-Integrated Sharma–Mittal Entropy: Kernel-Based Estimation, Theoretical Properties and Empirical Validation
by Nida Oruç Ünal, Muzaffer Göztaş and Doğan Yıldız
Entropy 2026, 28(8), 933; https://doi.org/10.3390/e28080933 - 20 Aug 2026
Viewed by 216
Abstract
Feature selection is a critical step in regression problems where a large number of continuous explanatory variables explain the same target through different dependency structures. Classical filters may remain sensitive to a single form of dependence, a single scale, or a specific discretization [...] Read more.
Feature selection is a critical step in regression problems where a large number of continuous explanatory variables explain the same target through different dependency structures. Classical filters may remain sensitive to a single form of dependence, a single scale, or a specific discretization scheme; generalized entropy measures, on the other hand, typically require the parameters to be fixed at a single point. This study proposes a framework that evaluates the Sharma–Mittal entropy volumetrically across a two-dimensional parameter region rather than for a single parameter pair. For the continuous target and explanatory variables, the marginal, joint, and conditional densities are obtained using a Gaussian kernel density estimation; the conditional entropy and information gain surfaces are integrated across the region Ω = [0.05, 0.95]2 in the α-β plane to define three indices: PICSME, which measures the conditional uncertainty volume; PIGSME, which measures the gain volume; and NIGSME, which is the ratio of this gain to the total entropy volume of the target. The method is supported by bandwidth consistency and the renormalization of conditional densities; thus, the issue of negative gain that can occur in the continuous variables is resolved, yielding positive and interpretable scores across all six datasets. It is formally demonstrated that the fact that the three indices produce the same ranking is not an empirical observation but rather the result of a monotonicity relationship valid under a fixed target entropy volume. The method is compared with Pearson and Spearman correlations, the Shannon information gain, mutual information, and random forest variable importance across six regression datasets (Airfoil Self-Noise, AirQualityUCI, BodyFat, Meteorology, Concrete, and WineQualityWhite) that differ in their sample size, dimensions, and application domain. The evaluation is not limited to ranking consistency; the out-of-sample prediction performance is measured using least-squares models on the top-k subsets, with rankings calculated from the training partition. The findings show that NIGSME exhibits a performance comparable to that of built-in filters, outperforms them on the Concrete and Meteorology datasets, and never ranks as the weakest method on any dataset. The results demonstrate that volumetric entropy metrics defined across the entire parameter space provide a feature-ranking tool that is independent of parameter selection for continuous variables. Full article
(This article belongs to the Special Issue Insight into Entropy)
Show Figures

Figure 1

39 pages, 497 KB  
Article
Invariant Boltzmann-Shannon Entropy for Black-Holes: A Manifestly-Covariant Canonical Quantum-Gravity Approach
by Claudio Cremaschini, Ramesh Radhakrishnan and Gerald Cleaver
Entropy 2026, 28(8), 932; https://doi.org/10.3390/e28080932 - 20 Aug 2026
Viewed by 520
Abstract
A novel theoretical study of Boltzmann-Shannon entropy arising in information-statistic theory applied to black-hole physics is proposed. The invariant setting implemented is represented by the manifestly-covariant quantum-gravity theory expressed in canonical Hamiltonian form. In such a framework the appropriate statistical interpretation relies on [...] Read more.
A novel theoretical study of Boltzmann-Shannon entropy arising in information-statistic theory applied to black-hole physics is proposed. The invariant setting implemented is represented by the manifestly-covariant quantum-gravity theory expressed in canonical Hamiltonian form. In such a framework the appropriate statistical interpretation relies on the configuration-space quantum expectation value of physical observables over the 4 scalar quantum-gravity probability density function (PDF). A representation for the black-hole Boltzmann-Shannon entropy is obtained for a Gaussian PDF profile and by establishing simultaneously a relationship between the black-hole invariant energy-content and the mean value of the quantum-gravity nonlinear Bohm potential. This yields a non-trivial functional dependence of the Boltzmann-Shannon entropy on the black-hole surface area, to be interpreted as a quantum statistical entropy counting black-hole bulk quantum-gravity states. The mathematical setting is shown to preserve manifest covariance and be self-contained within quantum-gravity realm. Comparisons with literature treatments dealing with thermodynamic or kinetic-statistical entropies that lead to the Bekenstein-Hawking black-hole surface entropy linear relation or its proposed quantum modifications are discussed. Full article
(This article belongs to the Special Issue Hamiltonian Dynamics in Fundamental Physics)
12 pages, 1625 KB  
Article
Geometric Phase-Induced Stückelberg Interference in an Optical Lattice Clock
by Wei-Xin Liu, Zhan-Peng Lu and Tao Wang
Entropy 2026, 28(8), 931; https://doi.org/10.3390/e28080931 - 20 Aug 2026
Viewed by 234
Abstract
We theoretically investigate geometric Stückelberg interferometry in a doubly driven optical lattice clock (OLC). By tuning the relative phase between the two driving fields, we control the relative sign of the effective coupling strengths at the avoided crossings. Within the adiabatic-impulse model, we [...] Read more.
We theoretically investigate geometric Stückelberg interferometry in a doubly driven optical lattice clock (OLC). By tuning the relative phase between the two driving fields, we control the relative sign of the effective coupling strengths at the avoided crossings. Within the adiabatic-impulse model, we analyze the time evolution of the two-level system, where nonadiabatic transitions occur only near the crossing points and adiabatic evolution takes place between them. We show that, besides the usual dynamical phase and the Stokes phase, a gauge-invariant noncyclic geometric phase contributes to the final transition probability. This geometric contribution yields a stable π-phase shift in the Stückelberg interference fringes. Moreover, we demonstrate that, under realistic experimental conditions, this geometric Stückelberg interferometer remains insensitive to inhomogeneities in atom-light coupling arising from the finite temperature of the atomic ensemble. Our results provide a general framework for engineering and detecting geometric phases on the OLC platform. Full article
(This article belongs to the Section Multidisciplinary Applications)
Show Figures

Figure 1

25 pages, 1147 KB  
Article
KEMFF: A Knowledge-Enhanced and Multidimensional Feature Fusion Model for Aspect-Based Sentiment Analysis
by Shuangshuang Yang, Peilun Liu and Wenlong Zhu
Entropy 2026, 28(8), 930; https://doi.org/10.3390/e28080930 - 19 Aug 2026
Viewed by 199
Abstract
Aspect-based Sentiment Analysis (ABSA) is a fine-grained sentiment classification task that aims to predict the sentiment polarity associated with aspect terms in sentences. Traditional methods based on syntactic and semantic dependency trees are insufficient for capturing contextual sentence features. To address this, we [...] Read more.
Aspect-based Sentiment Analysis (ABSA) is a fine-grained sentiment classification task that aims to predict the sentiment polarity associated with aspect terms in sentences. Traditional methods based on syntactic and semantic dependency trees are insufficient for capturing contextual sentence features. To address this, we propose a Knowledge-Enhanced and Multidimensional Feature Fusion (KEMFF) model for ABSA, which captures sentiment feature representations across multiple dimensions, including syntax, semantics, and knowledge. First, the pre-trained model RoBERTa is used to obtain embeddings of sentences and aspect terms. Then, a syntactic dependency parser and a graph convolutional network are utilized to learn syntactic features. Meanwhile, an Abstract Meaning Representation (AMR)-based parser is employed to construct semantic relations, and axial attention is used to aggregate incoming and outgoing semantic dependencies. Furthermore, external knowledge is embedded, and an attention mechanism is employed to obtain aspect-specific knowledge representations, thereby complementing syntactic and semantic representations with external lexical knowledge. Finally, multidimensional features are fused and passed to a softmax classifier for predicting sentiment polarities. Unlike previous models that mainly focus on either syntax–semantic fusion or knowledge-enhanced graph propagation, KEMFF explicitly models syntax, semantics, and lexical knowledge in three parallel branches and aligns them into a unified aspect-level representation. Experiments on Laptop14, Restaurant14, and Twitter datasets show that KEMFF achieves the best performance among the compared baselines on Laptop14 and Restaurant14, and it obtains competitive results on Twitter. Full article
(This article belongs to the Section Multidisciplinary Applications)
Show Figures

Figure 1

16 pages, 332 KB  
Article
BATS Code Decoding Method Based on Left-Nullspace-Guided Rank-Completion Feedback
by Juan Yang, Jingjing Lu, Jianbo Ji and Tao Wang
Entropy 2026, 28(8), 929; https://doi.org/10.3390/e28080929 - 19 Aug 2026
Viewed by 227
Abstract
BP decoding of BATS codes may stop when no residual batch satisfies the full-row-rank condition. To resume BP decoding, this paper proposes an Important-Packet-Guided Left-Nullspace Rank-Completion (LNRC) method. LNRC first identifies the unrecovered source packet that connects to the largest number of undecoded [...] Read more.
BP decoding of BATS codes may stop when no residual batch satisfies the full-row-rank condition. To resume BP decoding, this paper proposes an Important-Packet-Guided Left-Nullspace Rank-Completion (LNRC) method. LNRC first identifies the unrecovered source packet that connects to the largest number of undecoded batches, denotes it as the Important Packet, and uses it as a guidance packet to locate the undecoded batches containing it as repair candidates. For a selected batch with rank deficit one, the destination computes a nonzero left-null vector and selects a local repair coordinate that provides the missing independent direction. The destination sends the corresponding global source-packet index and finite-field coefficient through a reliable reverse feedback-control link, and the source returns the scaled repair packet through a reliable forward repair-data link. The associated completion column increases the target residual transfer-matrix rank by one and makes the batch BP-decodable. Thus, LNRC exploits the column-space structure of the target undecoded batch to select the repair coordinate, rather than selecting the Important Packet solely by the number of connected undecoded batches. Under equal encoding redundancy, simulations show that LNRC achieves a lower packet error rate (PER) compared with conventional Important Packet feedback, with average relative PER reductions of approximately 0.40–12.17% across the evaluated settings. Full article
(This article belongs to the Special Issue Information Theory for Future Communication Systems)
Show Figures

Figure 1

29 pages, 8782 KB  
Review
Hamiltonian Dynamics and Fundamental Phenomena in Biophysics: A Review
by Matteo Gori, Roberto Franzosi, Giulio Pettini and Marco Pettini
Entropy 2026, 28(8), 928; https://doi.org/10.3390/e28080928 - 19 Aug 2026
Viewed by 261
Abstract
We review a theoretical and experimental programme with the aim of understanding two intimately related fundamental phenomena in biophysics: (i) the classical analogue of Fröhlich phonon condensation in macromolecules driven out of thermal equilibrium and (ii) the consequent activation of long-range resonant electrodynamic [...] Read more.
We review a theoretical and experimental programme with the aim of understanding two intimately related fundamental phenomena in biophysics: (i) the classical analogue of Fröhlich phonon condensation in macromolecules driven out of thermal equilibrium and (ii) the consequent activation of long-range resonant electrodynamic intermolecular forces. Both phenomena are underpinned by explicit Hamiltonian models. The first is derived by applying the time-dependent variational principle (TDVP) to the quantum Wu–Austin model, producing a fully classical Hamiltonian in action-angle variables whose nonlinear rate equations exhibit a nonequilibrium phase transition: the channelling of supplied energy into the lowest-frequency collective mode. The second is grounded in a classical electrodynamic Hamiltonian for two coupled oscillating dipoles whose normal-mode structure predicts long-range (∼1/r3) resonant interactions, absent at thermal equilibrium but activated by out-of-equilibrium collective oscillations. We also discuss a complementary Hamiltonian approach that connects Fröhlich’s rate equations directly to Hamilton’s equations of motion, clarifying the role of bath-mediated nonlinear coupling and the conditions for strong condensation at room temperature. In addition, the TDVP is applied to a Davydov–Holstein–Fröhlich Hamiltonian describing electron–phonon motion along the backbone of a specific DNA sequence and its cognate restriction enzyme, EcoRI: the time-domain Fourier cross-spectrum of the resulting electron currents exhibits a sharp co-resonance peak for the canonical recognition sequence that disappears upon randomisation, providing a sequence-specific electrodynamic signature of DNA–protein recognition. Experimental evidence from THz near-field spectroscopy, fluorescence correlation spectroscopy, and direct observation of protein clustering is reviewed in relation to these theoretical predictions. The results establish a coherent physical picture suggesting that metabolic energy supply can play a role in driving macromolecules into coherently oscillating states that activate selective, distance-reaching electrodynamic forces capable of contributing to the organisation of biochemical reactions in living matter. Full article
(This article belongs to the Special Issue Hamiltonian Dynamics in Fundamental Physics)
Show Figures

Figure 1

34 pages, 6509 KB  
Article
Objective Multi-Metric Fusion for Critical Node Identification via CRITIC and Global–Local Context Modeling
by Pengcheng Cai, Canjv Lu, Ying Huang and Yi Xie
Entropy 2026, 28(8), 927; https://doi.org/10.3390/e28080927 - 18 Aug 2026
Viewed by 292
Abstract
Accurately identifying critical nodes in complex networks and applying targeted protection strategies significantly enhances network security. Traditional importance metrics rely on a single topological feature and cannot fully capture node influence. Existing multi-attribute fusion methods integrate multiple structural sources but typically use fixed [...] Read more.
Accurately identifying critical nodes in complex networks and applying targeted protection strategies significantly enhances network security. Traditional importance metrics rely on a single topological feature and cannot fully capture node influence. Existing multi-attribute fusion methods integrate multiple structural sources but typically use fixed weights or predefined rules, failing to adaptively adjust attribute contributions based on local and global network characteristics, which limits their generalization across diverse networks. To address this, we propose the CRITIC-based Objective Weighting and Multi-Metric Fusion Method (COWMF). COWMF first builds a Graph Attention Network with Virtual Global–Local Integration (GAT-VGL), taking four low-complexity topological metrics, degree centrality (DC), H-index, degree and neighborhood information centrality (DNC), and k-shell, as input. Through a learnable attention mechanism, GAT-VGL adaptively aggregates multi-hop neighborhood information and explicitly incorporates global structural information via a virtual node to achieve whole-graph topological awareness, generating a global influence score with good discriminative power and high computational efficiency. This score is then integrated with DC and DNC into an improved CRITIC-based objective weighting fusion scheme, enabling adaptive synergy among local connectivity, semi-local radiation, and global structure. Experiments on six real-world networks of varying types and scales show that COWMF demonstrates relatively stable and competitive performance in both simulated attack and susceptible-infected-recovered (SIR) spreading simulations, two complementary experiments, demonstrating satisfactory disruptive capability and propagation influence. Its importance scores exhibit high monotonicity across all networks, with good discriminative power. Full article
(This article belongs to the Section Complexity)
Show Figures

Figure 1

29 pages, 27707 KB  
Article
Topology-Evolving Image Encryption Algorithm Utilizing 2D Rosenbrock–Schwefel Hyperchaotic Map
by Wenjun Song, Hao Shen, Xuncai Zhang and Chengye Zou
Entropy 2026, 28(8), 926; https://doi.org/10.3390/e28080926 - 18 Aug 2026
Viewed by 197
Abstract
Traditional image encryption methods based on static permutation and diffusion are vulnerable to structural cryptanalysis and often exhibit limited robustness under imperfect communication conditions. To address these issues, this paper proposes a robust topology-evolving image encryption algorithm driven by complex hyperchaotic dynamics for [...] Read more.
Traditional image encryption methods based on static permutation and diffusion are vulnerable to structural cryptanalysis and often exhibit limited robustness under imperfect communication conditions. To address these issues, this paper proposes a robust topology-evolving image encryption algorithm driven by complex hyperchaotic dynamics for secure visual data transmission. First, a two-dimensional Rosenbrock–Schwefel hyperchaotic map is constructed to generate high-quality pseudorandom sequences for both permutation and diffusion. Based on this map, a bidirectional oscillatory spatial permutation mechanism governed by a dynamic linked-list topology is developed. Unlike fixed-path permutation strategies, the proposed topology continuously evolves with the system state during image traversal, thereby increasing nonlinear path complexity and improving resistance to structural attacks. Furthermore, a plaintext-dependent adaptive diffusion mechanism is designed to enhance sensitivity to plaintext variations and produce a strong global avalanche effect. Experimental results demonstrate that the proposed algorithm achieves favorable encryption performance, with an information entropy of up to 7.9994, a Number of Pixels Change Rate (NPCR) of 99.6076%, and a Unified Average Changing Intensity (UACI) of 33.4683%. In addition, the algorithm maintains good recovery performance under cropping attacks and noise interference, indicating its robustness and applicability for secure image transmission in complex communication environments. Full article
Show Figures

Figure 1

24 pages, 986 KB  
Article
Comparison of D-Wave Quantum Annealing and Gibbs Monte Carlo for Sampling from a Probability Distribution of a Restricted Boltzmann Machine
by Abdelmoula El-Yazizi and Yaroslav Koshka
Entropy 2026, 28(8), 925; https://doi.org/10.3390/e28080925 - 18 Aug 2026
Viewed by 298
Abstract
A local-valley (LV)-centered approach to assessing the quality of sampling from Restricted Boltzmann Machines (RBMs) was applied to the latest generation of the D-Wave quantum annealer. D-Wave and Gibbs samples from a classically trained RBM were obtained at conditions relevant to contrastive-divergence-based RBM [...] Read more.
A local-valley (LV)-centered approach to assessing the quality of sampling from Restricted Boltzmann Machines (RBMs) was applied to the latest generation of the D-Wave quantum annealer. D-Wave and Gibbs samples from a classically trained RBM were obtained at conditions relevant to contrastive-divergence-based RBM learning. The samples were compared for the number of LVs to which they belonged and the energy of the corresponding local minima. No significant (desirable) increase in the number of the LVs has been achieved by decreasing the D-Wave annealing time. At any training epoch, the states sampled by the D-Wave belonged to a somewhat higher number of LVs than in the Gibbs sampling. However, many of those LVs found by the two techniques differed. For high-probability sampled states, the two techniques were (unfavorably) less complementary and more overlapping. Nevertheless, many potentially “important” local minima, i.e., those having intermediate, even if not high, probability values, were found by only one of the two sampling techniques while missed by the other. The two techniques overlapped less at later than earlier training epochs, which is precisely the stage of the training when modest improvements to the sampling quality could make meaningful differences for the RBM trainability. The results of this work may explain the failure of previous investigations to achieve substantial (or any) improvement when using D-Wave-based sampling. However, the results reveal some potential for improvement, e.g., using a combined classical–quantum approach. Full article
(This article belongs to the Section Quantum Information)
Show Figures

Figure 1

40 pages, 4927 KB  
Article
Federated Quantum Machine Learning over Satellite Networks: Toward Scalable Distributed Quantum Classification
by Juan Carlos Boschero, Rares Adrian Oancea, Luca Mazzarella, Hugo Doeleman and Simon Cramer
Entropy 2026, 28(8), 924; https://doi.org/10.3390/e28080924 - 18 Aug 2026
Viewed by 507
Abstract
Federated learning enables multiple organizations to collaboratively analyze data while retaining local control over their datasets, making it attractive for applications such as healthcare. Distributed quantum computing provides a natural framework for such workflows, allowing geographically separated quantum processors to execute joint computations [...] Read more.
Federated learning enables multiple organizations to collaboratively analyze data while retaining local control over their datasets, making it attractive for applications such as healthcare. Distributed quantum computing provides a natural framework for such workflows, allowing geographically separated quantum processors to execute joint computations using shared entanglement while preserving data privacy. In this work, we investigate the feasibility of satellite-enabled distributed quantum computing for federated quantum learning. As a representative application, we consider a distributed distance-based quantum classifier in which multiple parties contribute local data through quantum operations. To support this application, we develop a hybrid space-ground quantum network architecture in which satellites distribute entanglement between distant ground stations. The communication layer is combined with a noise-aware neutral-atom processor model, enabling a system-level analysis that captures both network and hardware constraints. Simulation results across varying network sizes, feature dimensions, and coherence regimes show that classifier performance is jointly determined by communication resources, processor noise, and data representation. In low-coherence regimes, decoherence destroys the classifier’s discriminative signal, whereas high-coherence regimes reveal limitations arising from feature-space conditioning and feature redundancy. These results demonstrate that satellite quantum networks could support distributed quantum learning over long distances, while highlighting the importance of coherence time, entanglement-distribution performance, and learning-aware data encoding for future large-scale deployments. Full article
(This article belongs to the Special Issue Space Quantum Communication)
Show Figures

Figure 1

20 pages, 2208 KB  
Article
Coulomb Interaction-Controlled Coherence and Entanglement in a Double Quantum Dot Thermoelectric Engine
by Rongqian Wang, Le Wang, Zelin Kong, Xiaoping Ma, Yuxin Xu, Ziming Wang, Jia Tan, Xiang Hao and Jincheng Lu
Entropy 2026, 28(8), 923; https://doi.org/10.3390/e28080923 - 18 Aug 2026
Viewed by 237
Abstract
We study the thermoelectric performance and stationary quantum correlations of a coherent double quantum dot heat engine driven solely by two conventional electronic reservoirs. The role of coherence is isolated by comparing the fully coherent dynamics with those under an energy-conserving pure dephasing [...] Read more.
We study the thermoelectric performance and stationary quantum correlations of a coherent double quantum dot heat engine driven solely by two conventional electronic reservoirs. The role of coherence is isolated by comparing the fully coherent dynamics with those under an energy-conserving pure dephasing channel that does not alter the system energy. Reducing the dephasing strength enhances the particle current, heat current, output power, and thermodynamic efficiency over a broad voltage range. After optimizing the electrochemical load and the dot energy levels, we find that coherence primarily amplifies the attainable power and efficiency without significantly relocating the optimal operating region. Although appreciable interdot coherence already exists at moderate Coulomb interaction, stationary entanglement emerges only when Coulomb blockade sufficiently suppresses the mixed-state contribution from the empty and doubly occupied states. We further construct a transport-based lower bound on the concurrence, providing an experimentally accessible entanglement witness that avoids full state tomography. These findings establish a clear hierarchy among energy filtering, quantum coherence, and Coulomb blockade in a minimal quantum thermoelectric device. Full article
(This article belongs to the Section Quantum Information)
Show Figures

Figure 1

34 pages, 21458 KB  
Article
Adaptive Flight Maneuver Boundary Localization via Spectral Entropy-Weighted Multi-Channel Spectrogram Fusion
by Shansong Song, Wei Han, Bing Wan, Xiangyi Liu, Xichao Su, Chao Li and Yunyang Cao
Entropy 2026, 28(8), 922; https://doi.org/10.3390/e28080922 - 17 Aug 2026
Viewed by 184
Abstract
To address ambiguous maneuver boundaries, background interference, and uneven multi-sensor quality in long-duration flight parameter recordings, this paper proposes an adaptive flight maneuver boundary localization algorithm that integrates spectral entropy-weighted multi-channel spectrogram fusion with attitude-constrained structural correction. Multi-channel Short-Time Fourier Transform (STFT) spectrograms [...] Read more.
To address ambiguous maneuver boundaries, background interference, and uneven multi-sensor quality in long-duration flight parameter recordings, this paper proposes an adaptive flight maneuver boundary localization algorithm that integrates spectral entropy-weighted multi-channel spectrogram fusion with attitude-constrained structural correction. Multi-channel Short-Time Fourier Transform (STFT) spectrograms are first constructed from flight parameter time series. Spectral entropy (SE) is introduced to quantify the uncertainty of each channel’s time–frequency energy distribution and is combined with the maneuver activation ratio (MAR) and the linear contrast ratio (LCR) to form objective credibility weights, thereby suppressing channels dominated by aerodynamic turbulence and high frequency structural vibration. Normal overload soft gating and logarithmic noise floor subtraction are then applied to obtain an enhanced fused spectrogram, from which candidate intervals are extracted by low band energy thresholding. Finally, roll and pitch angle steady-state priors refine the event structure through local boundary refinement, cross-segment expansion/chain merging, and semantic post-processing, recovering continuous maneuvers fragmented by instantaneous energy valleys. On the held-out test sorties (SE_018–SE_020; 61 annotated intervals), the proposed algorithm achieves Precision, Recall, and F1-scores of 0.967. On the full primary corpus of 20 sorties (461 intervals), used for ablation and sensitivity analyses, the corresponding figures are Precision 0.934, Recall 0.959, and F1 0.946, with start and end boundary mean absolute errors of 1.484 s and 1.471 s. Under the same IoU protocol, consistent superiority is observed against learning-based baselines, and an independent external set of 10 sorties yields F1 = 0.938. The results indicate that entropy-constrained multi-sensor time–frequency fusion mainly improves maneuver/background separability, whereas attitude-constrained structural correction restores the integrity of long continuous maneuvers. Full article
(This article belongs to the Section Signal and Data Analysis)
Show Figures

Figure 1

37 pages, 780 KB  
Article
Optimal Chemotherapy Scheduling for Chronic Lymphocytic Leukemia Under Immune and Allergy Constraints
by Rawan Abdullah, Andrei Halanay and Lara Abou Orm
Entropy 2026, 28(8), 921; https://doi.org/10.3390/e28080921 - 17 Aug 2026
Viewed by 239
Abstract
We study an optimal control framework for chemotherapy administration in patients with chronic lymphocytic leukemia (CLL) while accounting for immune regulation and treatment-induced allergic reactions. The analysis is based on a previously developed nonlinear delay differential equation model describing the interactions between leukemic [...] Read more.
We study an optimal control framework for chemotherapy administration in patients with chronic lymphocytic leukemia (CLL) while accounting for immune regulation and treatment-induced allergic reactions. The analysis is based on a previously developed nonlinear delay differential equation model describing the interactions between leukemic cells, immune populations, antigen-presenting cells, and cytokine dynamics, with three distinct biological delays. The chemotherapy infusion rate is introduced as a time-dependent control variable and optimized to reduce leukemic burden, shift the helper T-cell balance toward a Th1-dominant configuration associated with lower hypersensitivity risk, and preserve immune competence. Existence of an optimal control is established for arbitrary delays and horizon, without the commensurability hypothesis required by reductions in delay systems to higher-dimensional delay-free ones; the argument uses only that the control enters the dynamics affinely and the running cost concavely. Necessary optimality conditions are derived via Pontryagin’s Maximum Principle for systems with delays, and the resulting eleven-dimensional adjoint system, which carries advanced arguments generated by the three delays, is written out explicitly. A contraction estimate for the associated sweep operator yields both uniqueness of the optimal control on a short horizon and geometric convergence of the numerical scheme. The optimality system is solved by a forward–backward sweep adapted to the delayed setting, with documented convergence and grid independence and sensitivity analysis over kinetic parameters, delays, initial conditions and objective weights. The optimized schedule is compared not only with the untreated case and a low constant dose, but also with a constant infusion delivering the same cumulative exposure, so that the reported benefit is attributable to the temporal distribution of the dose rather than to its total amount. At equal exposure, the optimal schedule reaches each therapeutic milestone earlier—Th1 dominance 0.9 days sooner and a 90% leukemic reduction 1.6 days sooner—and attains a terminal leukemic burden lower by a factor of 2.25; a constant infusion of the same total dose reaches a comparable configuration later. The benefit of adaptive scheduling in this model is therefore principally one of rate of response at fixed drug exposure. We emphasize that the absolute Th2 population is not reduced by treatment; the reduction in hypersensitivity risk arises from the resulting Th1-dominant relative balance rather than from direct Th2 suppression. To characterize the therapeutic outcome in information-theoretic terms, we describe the two competing goals as distributional balances: an allergy axis, given by the Th1/Th2/Treg distribution, and a leukemia axis, given by the immune/leukemic distribution, each measured by its Shannon entropy and its Kullback–Leibler divergence to a healthy reference profile. These quantities are used in two roles. As diagnostics, they are evaluated along the computed trajectories, and the ordering of dosing strategies is shown to be robust across twenty alternative reference profiles. As an objective, the combined divergence is then taken as the running cost of a second optimal control problem; because it depends on the leukemic population only through a normalized fraction, it prescribes a markedly gentler schedule that administers 37% of the drug and still achieves a 93% leukemic reduction, against 98% for the population-based formulation. These results suggest that adaptive, immune-aware chemotherapy scheduling may accelerate disease control at fixed drug exposure, and that information-theoretic objectives offer a scale-free alternative formulation of the therapeutic goal. Full article
(This article belongs to the Special Issue Information Theory in Control Systems, 3rd Edition)
Show Figures

Figure 1

14 pages, 1971 KB  
Article
XGBoost Classification of Epileptic EEG Using Nonlinear Dynamical Features and SHAP
by Xiaojie Lu, Hui Lou, Xiaoyang Jin and Bianmei Zhang
Entropy 2026, 28(8), 920; https://doi.org/10.3390/e28080920 - 17 Aug 2026
Viewed by 237
Abstract
To evaluate whether nonlinear descriptors of electroencephalogram (EEG) signals support interpretable XGBoost classification and to determine how analysis window duration affects performance. A secondary analysis of the public Bonn EEG dataset was performed. Nine nonlinear features were extracted from non-overlapping 1, 5, 10, [...] Read more.
To evaluate whether nonlinear descriptors of electroencephalogram (EEG) signals support interpretable XGBoost classification and to determine how analysis window duration affects performance. A secondary analysis of the public Bonn EEG dataset was performed. Nine nonlinear features were extracted from non-overlapping 1, 5, 10, and 20 s windows after an original-recording-level train/validation/test split, and a multiclass XGBoost model was interpreted with class-specific SHAP values. The model achieved 93.3% overall accuracy; the class-specific AUC values were 0.978 for Z/O, 0.978 for N/F, and 0.984 for S. Across the four fixed-split duration conditions, the 1 s condition had the lowest descriptive performance, whereas the 5, 10, and 20 s conditions were broadly comparable; no uniquely optimal duration was established. The nonlinear-feature/XGBoost framework provides interpretable benchmark segment classification evidence. Because EEG is modeled as a stochastic process and the dataset is small and heterogeneous, the SHAP attributions do not establish physiological causality or clinical diagnostic validity. Full article
(This article belongs to the Special Issue Computational Intelligence and Biomedical Signal Processing)
Show Figures

Figure 1

24 pages, 2361 KB  
Article
Information Bottleneck for Communication-Efficient Multi-Agent Reinforcement Learning in UAV Swarms
by Zheng Yang, Guohao Li and Yali Xue
Entropy 2026, 28(8), 919; https://doi.org/10.3390/e28080919 - 17 Aug 2026
Viewed by 303
Abstract
Multi-agent reinforcement learning has emerged as a promising paradigm for cooperative unmanned aerial vehicle (UAV) swarm coordination. However, existing communication-aware MARL methods primarily focus on communication topology, message routing, and message aggregation, while the information content of the exchanged messages is often only [...] Read more.
Multi-agent reinforcement learning has emerged as a promising paradigm for cooperative unmanned aerial vehicle (UAV) swarm coordination. However, existing communication-aware MARL methods primarily focus on communication topology, message routing, and message aggregation, while the information content of the exchanged messages is often only implicitly controlled. In realistic UAV networks, inter-agent communication is constrained by limited bandwidth, communication range, energy consumption, and packet loss. It is therefore desirable for each UAV to transmit compact and task-relevant information rather than dense and redundant latent features. In this paper, we propose IB-CEMARL, an information-bottleneck-guided, communication-efficient multi-agent reinforcement learning framework for UAV swarms. We formulate inter-UAV communication as a minimal sufficient message-learning problem in which each UAV encodes its local observation into a stochastic bottleneck message before exchanging information with its neighbors. Cauchy–Schwarz divergence-based quadratic mutual information is adopted as a unified dependence measure to jointly regularize message compression, preserve decision-relevant information, and reduce statistical redundancy among neighboring UAV messages. Extensive experiments demonstrate that IB-CEMARL achieves superior cooperative performance, reduced message redundancy, and stronger robustness compared with representative communication-aware MARL baselines. In particular, IB-CEMARL improves the average return by 4.9% and reduces inter-message dependence by 29.0% compared with the KL-IB-MARL baseline while maintaining efficient communication under constrained bandwidth settings. Full article
(This article belongs to the Special Issue The Information Bottleneck Method: Theory and Applications)
Show Figures

Figure 1

29 pages, 1670 KB  
Article
A Novel Evidence-Based Framework for Picture Fuzzy Sets: Theory and Applications of Belief and Plausibility
by Rashid Hussain, Zahid Hussain, Mehboob Ali and Małgorzata Przybyła-Kasperek
Entropy 2026, 28(8), 918; https://doi.org/10.3390/e28080918 - 16 Aug 2026
Viewed by 653
Abstract
Picture Fuzzy Sets (PiFSs) have appeared as an effective tool to tackle ambiguity in decision-making and offer greater flexibility than traditional extensions of Fuzzy Sets (FSs). Under the framework of evidence theory (ET), the concepts of belief and plausibility significantly boost the representative [...] Read more.
Picture Fuzzy Sets (PiFSs) have appeared as an effective tool to tackle ambiguity in decision-making and offer greater flexibility than traditional extensions of Fuzzy Sets (FSs). Under the framework of evidence theory (ET), the concepts of belief and plausibility significantly boost the representative capacity of PiFSs, which enables the management of uncertain and ambiguous data. We constructed both distance and similarity measures specifically for Belief and Plausible Picture Fuzzy Sets (BP-PiFSs). The constructed measures detect the differences and connections between BP-PiFSs and addressed the key shortcomings in current methodologies. They are mathematically validated and applied to real-world scenarios, such as fault detection in complex systems and antenna design optimization, where managing uncertainty is critical. A modified decision-making method, Belief and Plausible SMART (BP-SMART), extends the classical SMART approach to more effectively handle multi-criteria decision-making (MCDM) in uncertain environments. Numerical evaluations across pattern recognition, clustering, fault detection, and MCDM demonstrates the effectiveness and robustness of the suggested framework, contributing significantly to both the theoretical and practical development of fuzzy set theory. Full article
(This article belongs to the Special Issue Entropy Method for Decision Making with Uncertainty, 2nd Edition)
Show Figures

Figure 1

14 pages, 2175 KB  
Article
Stern Zero-Knowledge Identification Protocol Based on Lee Distance
by Bing Liu, Xun Su, Binghong Yan and Anqi Liu
Entropy 2026, 28(8), 917; https://doi.org/10.3390/e28080917 - 15 Aug 2026
Viewed by 263
Abstract
Post-quantum cryptography has gained urgent attention as quantum computing poses fundamental threats to traditional public-key cryptosystems. Code-based cryptography stands out as a robust post-quantum candidate, but most existing schemes are built on Hamming distance, whereas Lee distance provides a more natural error model [...] Read more.
Post-quantum cryptography has gained urgent attention as quantum computing poses fundamental threats to traditional public-key cryptosystems. Code-based cryptography stands out as a robust post-quantum candidate, but most existing schemes are built on Hamming distance, whereas Lee distance provides a more natural error model for specific communication channels like phase-modulation channels. This paper presents the Lee–Stern zero-knowledge identification protocol, which extends the classic Stern protocol from the binary Hamming metric to the Lee metric over arbitrary prime fields. We adopt the state-of-the-art LMMT-ISD attack framework to conduct rigorous security re-evaluation and derive necessary parameter bounds for standard post-quantum security levels. Extensive experiments analyze how code length and prime modulus affect the protocol’s overheads, showing that the proposed scheme achieves equivalent security with notably shorter code length and smaller public key size than the original binary Stern protocol. Full article
Show Figures

Figure 1

27 pages, 3351 KB  
Article
Benchmarking Quantum Solvers in Noisy Digital Simulations for Financial Portfolio Optimization
by Ruizhe Shen, Zichang Hao and Ching Hua Lee
Entropy 2026, 28(8), 916; https://doi.org/10.3390/e28080916 - 14 Aug 2026
Viewed by 261
Abstract
In this work, we benchmark two prominent quantum algorithms: Quantum Imaginary-Time Evolution (QITE) and the Quantum Approximate Optimization Algorithm (QAOA) for obtaining the ground state of Ising-type Hamiltonians. Specifically, we apply them to the Markowitz portfolio optimization problem in quantitative finance, on both [...] Read more.
In this work, we benchmark two prominent quantum algorithms: Quantum Imaginary-Time Evolution (QITE) and the Quantum Approximate Optimization Algorithm (QAOA) for obtaining the ground state of Ising-type Hamiltonians. Specifically, we apply them to the Markowitz portfolio optimization problem in quantitative finance, on both digital quantum computers and local quantum simulators with controllable two-qubit errors (noise). In noiseless settings, we find that QAOA achieves excellent convergence to the optimal results. Under noisy conditions, the QITE method exhibits greater robustness and stability, though it incurs substantially more classical numerical cost. In contrast, we demonstrate that QAOA offers better scalability and can still yield robust results if the noise can be effectively mitigated. Our findings provide valuable insights into the trade-offs between scalability and noise tolerance and demonstrate the practical potential of quantum algorithms for solving real-world optimization problems on near-term quantum devices. Full article
(This article belongs to the Special Issue Quantum Computing in the NISQ Era, Second Edition)
Show Figures

Figure 1

33 pages, 2609 KB  
Article
Information Loss in Scalar Monetary Aggregation: A Tensorial Langevin Framework for Financial Shock Propagation and Policy Targeting
by M. Rodrigo Pinheiro and Mario J. Pinheiro
Entropy 2026, 28(8), 915; https://doi.org/10.3390/e28080915 - 14 Aug 2026
Viewed by 252
Abstract
We develop a tensor-based dynamical framework for monetary flows in multi-sector, multi-agent economies and quantify the information destroyed when the monetary state is reduced to a scalar aggregate. The state is a third-order tensor encoding capital flows across sectors, agent classes, and time; [...] Read more.
We develop a tensor-based dynamical framework for monetary flows in multi-sector, multi-agent economies and quantify the information destroyed when the monetary state is reduced to a scalar aggregate. The state is a third-order tensor encoding capital flows across sectors, agent classes, and time; deviations from equilibrium obey a tensor-indexed Langevin (multivariate Ornstein–Uhlenbeck) equation with a coupling operator and channel-specific friction rates. Using standard Lyapunov theory, we assemble a stability and convergence framework for the induced vectorized system, with a bound stated so as to remain valid for the non-normal system matrices generated by asymmetric economic coupling, and characterize the stochastically forced case in the mean-square sense. Shannon entropy, Kullback–Leibler divergence, and sector–agent mutual information measure the structural information discarded by scalar aggregation. We then study a stylized, heuristically calibrated 3×3 economy subject to a shock inspired by the 2007–2009 crisis; we emphasize at the outset that the figures reported below are properties of that calibration and are not empirical estimates. In this scenario Finance absorbs an 18.9% peak capital loss while Manufacturing and Services suffer 5.8% and 3.9% secondary drops, against an aggregate contraction of only 8.6%; the Kullback–Leibler divergence of the sector–agent flow distribution recovers systematically later than the aggregate signal, a lag that is positive in 96.6% of a 1000-draw Monte Carlo ensemble, although its magnitude is calibration-dependent. Under a symmetric exit rule, a deficit-targeted stimulus restores equilibrium substantially faster than a share-weighted uniform stimulus in 100% of the ensemble while spending strictly less—its realized expenditure saturates below the uniform budget because it self-terminates as deficits close—and attains integrated disequilibrium within 18% of the exact linear-quadratic optimum at equal control effort while requiring no knowledge of the system matrix. The ordinal conclusions—aggregation masks the epicenter, structure lags the aggregate, and deficit targeting dominates uniformity—are robust across a wide neighborhood of the calibration, and identify the disaggregated state as the object that stabilization policy needs and that scalar aggregation destroys. Full article
(This article belongs to the Section Multidisciplinary Applications)
Show Figures

Figure 1

35 pages, 491 KB  
Article
Entropic Dynamics of Jump-Diffusion Option Pricing
by Mohammad Abedi
Entropy 2026, 28(8), 914; https://doi.org/10.3390/e28080914 - 14 Aug 2026
Viewed by 393
Abstract
The standard models of stock-price dynamics and option valuation rest on stochastic processes postulated at the outset; here, we lay down an entropic-inference framework that derives these processes rather than assuming them, by making explicit the information each one encodes. A symmetry comes [...] Read more.
The standard models of stock-price dynamics and option valuation rest on stochastic processes postulated at the outset; here, we lay down an entropic-inference framework that derives these processes rather than assuming them, by making explicit the information each one encodes. A symmetry comes first: markets reward returns rather than price levels, which selects the logarithm of price as the dynamical variable. The price then evolves through two channels, a continuous one carrying the constraints of continuity and directionality, and a jump channel carrying the arrival rate and the first two moments of the jump size. Because these constraints act on disjoint parts of the microstate, the channels factorize as a theorem, and the dynamics is the Merton jump-diffusion, with Geometric Brownian Motion as its no-jump limit; the log-price density obeys a Kolmogorov–Feller equation, of which the Fokker–Planck equation is the no-jump limit. The same principle, now imposing no-arbitrage through the mean log-return, selects the Esscher transform from among the many martingale measures an incomplete market admits, here derived rather than borrowed; the premium then satisfies Merton’s partial integro-differential equation, and the risk-neutral mixture of lognormals generates the implied-volatility smile, the Black–Scholes results returning when jumps vanish. What changes from one model to the next is never the inference but the information supplied to it. Full article
Show Figures

Figure 1

24 pages, 7352 KB  
Article
More Links but Fewer Effective Routes: Entropy and Resilience in Global Lithium, Cobalt and Nickel Trade Networks
by Guoxu Liu, Dong Mu, Tianyu Li, Mingqian Sun and Liu Chen
Entropy 2026, 28(8), 913; https://doi.org/10.3390/e28080913 - 14 Aug 2026
Viewed by 299
Abstract
Counts of trade links are often used as evidence of diversification, yet they say little about how value is distributed across those links. Using bilateral flows for selected lithium, cobalt and nickel products among 72 economies from 2010 to 2024, we built directed, [...] Read more.
Counts of trade links are often used as evidence of diversification, yet they say little about how value is distributed across those links. Using bilateral flows for selected lithium, cobalt and nickel products among 72 economies from 2010 to 2024, we built directed, value-weighted networks and examined them with multiscale entropy measures, lagged formation models and disruption tests. Here, entropy is used in the information-theoretic sense to measure how evenly trade value, network weight or motif participation is distributed across routes and structural modes; for route-value entropy, exp(H) is the effective number of equally weighted routes. The number of lithium links increased from 180 to 290, but its entropy-effective route count declined from 38.68 to 12.75. Nickel displayed a similar divergence, falling from 118.84 to 21.81 effective routes as links increased, whereas cobalt moved in the opposite direction. Across layer-years, flow entropy was associated with the share of trade retained under targeted attack (ρ = 0.754; Holm-adjusted p = 0.001). Binary dependence between lithium and nickel rose over time, although their weighted divergence was still 0.907 in 2024. In the China-removal experiment at the largest capacity margin, 95.7% of nodes survived but only 33.8% of trade value remained. For these product baskets, a larger network therefore need not be a more diversified one, and preserved connectivity can coexist with substantial economic loss. Full article
Show Figures

Figure 1

21 pages, 2249 KB  
Article
A Dual-Channel Architecture Based on GCN and HGCN for Dynamic Link Prediction
by Bing Wu, Sheng Zhang, Jiangnan Zhou, Mengen Xu, Qiuming Wang, Yirong Zeng, Ka Sun and Fenglian Yuan
Entropy 2026, 28(8), 912; https://doi.org/10.3390/e28080912 - 14 Aug 2026
Viewed by 286
Abstract
Dynamic link prediction, which aims to infer future edges from historical network structures, is a fundamental task in dynamic network analysis. Traditional models fail to capture high-order information, while existing methods neglect the distinct temporal evolution patterns between low-order and high-order structures, thereby [...] Read more.
Dynamic link prediction, which aims to infer future edges from historical network structures, is a fundamental task in dynamic network analysis. Traditional models fail to capture high-order information, while existing methods neglect the distinct temporal evolution patterns between low-order and high-order structures, thereby limiting prediction accuracy. To address these issues, we propose DC-GHCN, a dynamic link prediction model based on a dual-channel architecture that integrates Graph Convolutional Network (GCN) and Hypergraph Convolutional Network (HGCN). Firstly, we extract closed motifs from dynamic network snapshots to construct an initial hypergraph, then refine it via nested motif pruning and node weight compensation strategies. Secondly, we design a dual-channel architecture: the GCN channel learns low-order structural features, while the HGCN channel learns high-order structural features. Furthermore, two independent Gated Recurrent Units (GRUs) separately model the temporal evolution of the two channels. Finally, the model employs a gating mechanism to adaptively fuse the dual-channel node representations for link prediction. Experiments on five real-world dynamic network datasets demonstrate that DC-GHCN outperforms baseline models, validating the effectiveness of the proposed model in dynamic link prediction. Full article
(This article belongs to the Special Issue Higher-Order Interactions and Their Relevance to Real Networks)
Show Figures

Figure 1

Previous Issue
Back to TopTop