Results 41 to 50 of about 328,047 (99)
Soft‐Clipping Autoregressive Models for Ordinal Time Series
ABSTRACT The linear autoregressive models are among the most popular models in the practice of time series analysis, which constitutes an incentive to adapt them to ordinal time series as well. Our starting point for modeling ordinal time series data is the latent variable approach to define a generalized linear model.
Christian H. Weiß, Osama Swidan
wiley +1 more source
A Theorem on Preference Aggregation [PDF]
I present a general theorem on preference aggregation. This theorem implies, as corollaries, Arrow's Impossibility Theorem, Wilson's extension of Arrow's to non-Paretian aggregation rules, the Gibbard-Satterthwaite Theorem and Sen's result on the ...
Salvador Barberà
core
Abstract The OCP plasma model which has been the favourite plasma model of Gabor Kalman is simple but on the other side connected with some principal difficulties, and gave rise to some controversies. We discuss here the three main problems of Coulomb systems, the limit cases of the parameter ξ∼e2/ℏT$$ \xi \sim \left({e}^2/\mathrm{\hslash}\sqrt{T ...
Werner Ebeling
wiley +1 more source
A Unifying Impossibility Theorem [PDF]
This paper considers social choice correspondences assigning a choice set to each non-empty subset of social alternatives. We impose three requirements on these correspondences: unanimity, independence of preferences over infeasible alternatives and ...
Shino Takayama, Priscilla Man
core
Mathematical Modelling of Tumour Treatment With Chemotherapy
In this study, a cancer disease model incorporating dynamics between immune cells and tumour cells, as well as competition between tumour cells and normal cells, was formulated in an attempt to understand the interaction dynamics that govern the complex interplay within the tumour microenvironment.
F. S. Nyaweni, W. Mbava, Yeou Jiann Lim
wiley +1 more source
Dilworth's Theorem Revisited, an Algorithmic Proof [PDF]
Dilworth's theorem establishes a link between a minimal path cover and a maximal antichain in a digraph.A new proof for Dilworth's theorem is given. Moreover an algorithm to find both the path cover and the antichain, as considered in the theorem, is ...
Potharst, R., Pijls, W.H.L.M.
core
A discrete mean value of the Riemann zeta function
Abstract In this work, we estimate the sum ∑0<ℑ(ρ)⩽Tζ(ρ+α)X(ρ)Y(1−ρ)$$\begin{align*} \sum _{0 < \Im (\rho) \leqslant T} \zeta (\rho +\alpha)X(\rho) Y(1\!-\! \rho) \end{align*}$$over the nontrivial zeros ρ$\rho$ of the Riemann zeta function where α$\alpha$ is a complex number with α≪1/logT$\alpha \ll 1/\log T$ and X(·)$X(\cdot)$ and Y(·)$Y(\cdot)$ are ...
Kübra Benli, Ertan Elma, Nathan Ng
wiley +1 more source
All electromagnetic scattering bodies are matrix-valued oscillators. [PDF]
Zhang L, Monticone F, Miller OD.
europepmc +1 more source
A family of quasi-1D Schrödinger operators is investigated through scattering theory. The continuous spectrum of these operators exhibits changes of multiplicity, and some of these operators possess resonances at thresholds.
Parra, D. +3 more
core +1 more source
A proof of the four-colour theorem
The four-colour problem remained unsolved for more than a hundred years has played a role of the utmost importance in the development of graph theory. The four-colour theorem was confirmed in 1976, which is not completely satisfied due to: i) part of the
Xing, Jing Tang
core +1 more source

