Results 31 to 40 of about 1,186 (159)
Perspectives of Earth and Space Scientists, Volume 6, Issue 1, December 2025.Abstract Although the concept of thermodynamic entropy due to Clausius dates back to the early 1850s, the mathematical theory of informational entropy was not developed until the pioneering work of Shannon in 1948, the development of principle of maximum entropy (POME) and theorem of concentration by Jaynes in 1957, principle of minimum cross entropy ...
Vijay P. Singh
wiley +1 more source
Communications on Pure and Applied Mathematics, Volume 78, Issue 10, Page 2001-2118, October 2025.Abstract We analyse and clarify the finite‐size scaling of the weakly‐coupled hierarchical n$n$‐component |φ|4$|\varphi |^4$ model for all integers n≥1$n \ge 1$ in all dimensions d≥4$d\ge 4$, for both free and periodic boundary conditions. For d>4$d>4$, we prove that for a volume of size Rd$R^{d}$ with periodic boundary conditions the infinite‐volume ...
Emmanuel Michta +2 more
wiley +1 more source
Federated Learning With Differential Privacy Based on Summary Statistics
Engineering Reports, Volume 7, Issue 10, October 2025.As society progresses, the significance of data becomes increasingly prominent, and simultaneously, the privacy preserving of data is gaining more attention. We apply the Functional mechanism to federated learning and extend their method to (ϵ,δ)$$ \left(\epsilon, \delta \right) $$‐DP by adding Gaussian noise to the coefficient vector of polynomial ...
Peng Zhang, Pingqing Liu
wiley +1 more source
On Nonlinear Compression Costs: When Shannon Meets Rényi
IEEE AccessIn compression problems, the minimum average codeword length is achieved by Shannon entropy, and efficient coding schemes such as Arithmetic Coding (AC) achieve optimal compression.
Andrea Somazzi +2 more
doaj +1 more source
Quantum Circuit Design using a Progressive Widening Enhanced Monte Carlo Tree Search
Advanced Quantum Technologies, Volume 8, Issue 10, October 2025.This article proposes the Progressive Widening enhanced Monte Carlo Tree Search (PWMCTS) to design parameterized quantum circuits. It improves the efficiency of the previous MCTS‐based techniques in terms of number of quantum circuit evaluation, number of gates and CNOT count.
Vincenzo Lipardi +3 more
wiley +1 more source
Out-of-time ordered correlators, complexity, and entropy in bipartite systems
Physical Review Research, 2019 There is a remarkable interest in the study of out-of-time ordered correlators (OTOCs) that goes from many-body theory and high-energy physics to quantum chaos.
Pablo D. Bergamasco +2 more
doaj +1 more source
Central Limit Theorems for global and local empirical measures of diffusions on Erdős-Rényi graphs [PDF]
, 2023 Fabio Coppini +2 more
openalex +1 more source
Tight bounds for intersection‐reverse sequences, edge‐ordered graphs, and applications
Journal of the London Mathematical Society, Volume 112, Issue 4, October 2025.Abstract In 2006, Marcus and Tardos proved that if A1,⋯,An$A^1,\dots,A^n$ are cyclic orders on some subsets of a set of n$n$ symbols such that the common elements of any two distinct orders Ai$A^i$ and Aj$A^j$ appear in reversed cyclic order in Ai$A^i$ and Aj$A^j$, then ∑i|Ai|=O(n3/2logn)$\sum _{i} |A^i|=O(n^{3/2}\log n)$.
Barnabás Janzer +3 more
wiley +1 more source
Physical Review ResearchWe simulate quench dynamics of the Su-Schrieffer-Heeger (SSH) chain on IBM quantum computers, calculating the Rényi entanglement entropy, the twist order parameter, and the Berry phase.
Huai-Chun Chang +2 more
doaj +1 more source
Mathematika, Volume 71, Issue 4, October 2025.Abstract Motivated by general probability theory, we say that the set S$S$ in Rd$\mathbb {R}^d$ is antipodal of rank k$k$, if for any k+1$k+1$ elements q1,…qk+1∈S$q_1,\ldots q_{k+1}\in S$, there is an affine map from convS$\mathrm{conv}\!\left(S\right)$ to the k$k$‐dimensional simplex Δk$\Delta _k$ that maps q1,…qk+1$q_1,\ldots q_{k+1}$ bijectively ...
Márton Naszódi +2 more
wiley +1 more source