Results 231 to 240 of about 91,090 (271)
Some of the next articles are maybe not open access.

Completely monotonic functions

Integral Transforms and Special Functions, 2001
In this expository article we survey some properties of completely monotonic functions and give various examples, including some famous special functions. Such function are useful, for example, in probability theory. It is known, [1, p.450], for example, that a function w is the Laplace transform of an infinitely divisible probability distribution on ...
K.S. Miller, S.G. Samko
openaire   +1 more source

Completely Monotonic Fredholm Determinants

2020
A functionf(x) is called completely monotonic if (−1)mf(m)(x) > 0. In random matrix theory when the associated orthogonal polynomials have Freud weights, it is known that the expectation of having m eigenvalues of a random Hermitian matrix in an interval is a multiple of (−1)m times the m-th derivative of a Fredholm determinant at λ = 1.
Mourad E. H. Ismail, Ruiming Zhang
openaire   +1 more source

Complete monotonicity and diesel fuel spray

The Mathematical Intelligencer, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Grinshpan, Arcadii Z.   +2 more
openaire   +1 more source

DYNAMIC ACTIONS ON MONOTONE COMPLETE FACTORS

The Quarterly Journal of Mathematics, 1993
Recall that for \(A\) a unital, monotone complete \(C^*\)-algebra, \(G_ 1\) and \(G_ 2\) countably infinite groups, and \(\alpha_ 1\), \(\alpha_ 2\) actions of \(G_ 1\) and \(G_ 2\), respectively, as \(*\)-automorphisms of \(A\), the actions \(\alpha_ 1\) and \(\alpha_ 2\) are called weakly equivalent if there exists an isomorphism of the monotone ...
Saitô, Kazuyuki, Wright, J. D. Maitland
openaire   +2 more sources

Monotone Completions of the Fermion Algebra

The Quarterly Journal of Mathematics, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Saitô, Kazuyuki, Wright, J. D. Maitland
openaire   +2 more sources

Completely monotone functions on lie semigroups

Ukrainian Mathematical Journal, 2000
A totally monotone function on a semigroup \(S\) was defined by \textit{A. Devinatz} and \textit{A. E. Nussbaum} [Duke Math. J. 28, 221-237 (1961; Zbl 0118.11201)] as a function satisfying certain difference inequalities. The author shows that the latter are equivalent to some differential inequalities if \(S\) is a Lie semigroup.
openaire   +2 more sources

Generalized Gamma convolutions and complete monotonicity

Probability Theory and Related Fields, 1990
Let \({\mathcal C}\) be the class of pdf's f on (0,\(\infty)\) such that, for each \(u>0\), f(uv)f(u/v) is completely monotone as a function of \(w=v+v^{-1}\). This class includes many familiar pdf's and is closed with respect to multiplication and division of independent rv's.
openaire   +2 more sources

Fusing Complete Monotonic Decision Trees

IEEE Transactions on Knowledge and Data Engineering, 2017
Monotonic classification is a kind of classification task in which a monotonicity constraint exist between features and class, i.e., if sample $x_i$ has a higher value in each feature than sample $x_j$ , it should be assigned to a class with a higher level than the level of $x_j$ 's class.
Hang Xu, Wenjian Wang, Yuhua Qian
openaire   +1 more source

A Property of completely monotonic functions

Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics, 1987
AbstractA non-negative function f(t), t > 0, is said to be completely monotonic if its derivatives satisfy (-1)n fn (t) ≥ 0 for all t and n = 1, 2, …, For such a function, either f(t + δ) / f(t) is strictly increasing in t for each δ > 0, or f(t) = ce-dt for some constants c and d, and for all t. An application of this result is given.
openaire   +2 more sources

Differential Approximation of Completely Monotonic Functions

SIAM Journal on Numerical Analysis, 1981
The various differential approximation schemes for producing an exponential sum approximation to a given function F are placed within a common mathematical framework, and localization theorems are established in the important case where F is completely monotonic. The replacement of the least squares minimization by a Galerkin orthogonalization leads to
openaire   +1 more source

Home - About - Disclaimer - Privacy