stringtranslate.com

Logarithmically concave function

In convex analysis, a non-negative function f : RnR+ is logarithmically concave (or log-concave for short) if its domain is a convex set, and if it satisfies the inequality

for all x,y ∈ dom f and 0 < θ < 1. If f is strictly positive, this is equivalent to saying that the logarithm of the function, log ∘ f, is concave; that is,

for all x,y ∈ dom f and 0 < θ < 1.

Examples of log-concave functions are the 0-1 indicator functions of convex sets (which requires the more flexible definition), and the Gaussian function.

Similarly, a function is log-convex if it satisfies the reverse inequality

for all x,y ∈ dom f and 0 < θ < 1.

Properties

,[1]
i.e.
is
negative semi-definite. For functions of one variable, this condition simplifies to

Operations preserving log-concavity

is concave, and hence also f g is log-concave.
is log-concave (see Prékopa–Leindler inequality).
is log-concave.

Log-concave distributions

Log-concave distributions are necessary for a number of algorithms, e.g. adaptive rejection sampling. Every distribution with log-concave density is a maximum entropy probability distribution with specified mean μ and Deviation risk measure D.[2] As it happens, many common probability distributions are log-concave. Some examples:[3]

Note that all of the parameter restrictions have the same basic source: The exponent of non-negative quantity must be non-negative in order for the function to be log-concave.

The following distributions are non-log-concave for all parameters:

Note that the cumulative distribution function (CDF) of all log-concave distributions is also log-concave. However, some non-log-concave distributions also have log-concave CDF's:

The following are among the properties of log-concave distributions:

which is decreasing as it is the derivative of a concave function.

See also

Notes

  1. ^ a b Boyd, Stephen; Vandenberghe, Lieven (2004). "Log-concave and log-convex functions". Convex Optimization. Cambridge University Press. pp. 104–108. ISBN 0-521-83378-7.
  2. ^ Grechuk, Bogdan; Molyboha, Anton; Zabarankin, Michael (May 2009). "Maximum Entropy Principle with General Deviation Measures" (PDF). Mathematics of Operations Research. 34 (2): 445–467. doi:10.1287/moor.1090.0377.
  3. ^ a b See Bagnoli, Mark; Bergstrom, Ted (2005). "Log-Concave Probability and Its Applications" (PDF). Economic Theory. 26 (2): 445–469. doi:10.1007/s00199-004-0514-4. S2CID 1046688.
  4. ^ a b Prékopa, András (1971). "Logarithmic concave measures with application to stochastic programming" (PDF). Acta Scientiarum Mathematicarum. 32 (3–4): 301–316.

References