The Paired Swap Permutation Test is an exact non-parametric procedure that compares explanatory power of two dependent predictors via symmetric within-subject swapping for categorical data and ECDF mapping for continuous data.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Completes the proof of Brannan's conjecture |A_n(α,β,ω)| ≤ A_n(α,β,1) for odd n by using compound Laplace integrals, Meijer G approximations near ω=-1, and numerical verification for α,β in (0,1] and n≥5.
MaRDI Open Interfaces supplies common interfaces for nonlinear optimization solvers, shown via an application to physics-informed neural network training on the viscous Burgers' equation.
citing papers explorer
-
Exact Comparison of Explanatory Strength of Two Dependent Predictors
The Paired Swap Permutation Test is an exact non-parametric procedure that compares explanatory power of two dependent predictors via symmetric within-subject swapping for categorical data and ECDF mapping for continuous data.
-
The general Brannan coefficient conjecture II: Meijer-function approximations
Completes the proof of Brannan's conjecture |A_n(α,β,ω)| ≤ A_n(α,β,1) for odd n by using compound Laplace integrals, Meijer G approximations near ω=-1, and numerical verification for α,β in (0,1] and n≥5.
-
Software package MaRDI Open Interfaces for improved interoperability in numerical optimization
MaRDI Open Interfaces supplies common interfaces for nonlinear optimization solvers, shown via an application to physics-informed neural network training on the viscous Burgers' equation.