Results 31 to 40 of about 296,906 (157)
The α → 1 limit of the sharp quantum Rényi divergence [PDF]
Fawzi and Fawzi [Quantum 5, 387 (2021)] recently defined the sharp Rényi divergence, Dα#, for α ∈ (1, ∞), as an additional quantum Rényi divergence with nice mathematical properties and applications in quantum channel discrimination and quantum ...
core +2 more sources
Analytical Prediction of Critical Transitions in Oscillator Networks With Non‐Local Links
An analytical framework reveals how global coupling, second‐harmonic strength, noise, and network structure govern oscillator‐based Ising dynamics. Spectral reduction predicts stability boundaries, while Fokker–Planck analysis captures one‐ to two‐cluster transitions and identifies conditions favoring low‐energy configurations.
Qiang Li +5 more
wiley +1 more source
NOTE: to view these items please visit http://dynkincollection.library.cornell.eduInterview conducted by Eugene Dynkin with Alfréd Rényi in 1967 in Moscow ...
Rényi, Alfréd
core +4 more sources
Exact Values and Bounds on Covering Schemes of Strength Two
ABSTRACT In this work, we investigate covering schemes of strength 2 over finite abelian groups, establishing new lower and upper bounds and evaluating new exact values. A main result is a new general lower bound that improves the trivial one and achieves optimality for the binary case. We also develop a recursive relation based on subsets of the group
André G. Castoldi +4 more
wiley +1 more source
Central limit theorem for Rényi divergence of infinite order [PDF]
Bobkov SG, Götze F. Central limit theorem for Rényi divergence of infinite order. Annals of Probability. 2025;53(2):453-477.For normalized sumsZnof i.i.d.
Bobkov, Sergey G., Götze, Friedrich
core +3 more sources
Holographic second laws of black hole thermodynamics
Recently, it has been shown that for out-of-equilibrium systems, there are additional constraints on thermodynamical evolution besides the ordinary second law.
Alice Bernamonti +3 more
doaj +1 more source
On Odd Covers of Cliques and Disjoint Unions
ABSTRACT Babai and Frankl posed the “odd cover problem” of finding the minimum cardinality of a collection of complete bipartite graphs such that every edge of the complete graph of order n $n$ is covered an odd number of times. In a previous paper with O'Neill, some of the authors proved that this value is always ⌈ n / 2 ⌉ $\lceil n/2\rceil $ or ⌈ n /
Calum Buchanan +7 more
wiley +1 more source
Interdiction Models and Heuristics for Graph Propagation
ABSTRACT Given a graph G=(V,E)$$ G=\left(V,E\right) $$ and a set S⊂V$$ S\subset V $$ of activated/infected nodes, we consider the problem of determining the set of c$$ c $$ nodes that minimizes the network propagation on the subgraph that results from the removal of those c$$ c $$ nodes. To measure network propagation, we assume that a node i$$ i $$ is
Agostinho Agra, José Maria Samuco
wiley +1 more source
Arimoto Channel Coding Converse and Rényi Divergence [PDF]
—Arimoto [1] proved a non-asymptotic upper bound on the probability of successful decoding achievable by any code on a given discrete memoryless channel.
Sergio Verdú, Yury Polyanskiy
core
The application of multisource information fusion in real-world scenarios is an emerging practice because it effectively uses consistent and complementary data to optimize decision-making.
Xiao, F +8 more
core +1 more source

