<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://en.formulasearchengine.com/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=88.78.0.0%2F16</id>
	<title>formulasearchengine - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://en.formulasearchengine.com/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=88.78.0.0%2F16"/>
	<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/wiki/Special:Contributions/88.78.0.0/16"/>
	<updated>2026-08-15T07:34:45Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.47.0-wmf.7</generator>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=Odd%E2%80%93even_sort&amp;diff=16906</id>
		<title>Odd–even sort</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Odd%E2%80%93even_sort&amp;diff=16906"/>
		<updated>2014-01-19T17:11:23Z</updated>

		<summary type="html">&lt;p&gt;88.78.14.27: /* Proof of Correctness */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;In [[extremal graph theory]], the &#039;&#039;&#039;Erdős–Stone theorem&#039;&#039;&#039; is an [[asymptotic]] result generalising [[Turán&#039;s theorem]] to bound the number of edges in an &#039;&#039;H&#039;&#039;-free graph for a non-complete graph &#039;&#039;H&#039;&#039;. It is named after [[Paul Erdős]] and [[Arthur Stone (mathematician)|Arthur Stone]], who proved it in 1946,&amp;lt;ref&amp;gt;{{cite journal |last=Erdős |first=P. |authorlink=Paul Erdős |coauthors=[[Arthur Stone (mathematician)|Stone, A. H.]] |year=1946 |title=On the structure of linear graphs |journal=[[Bulletin of the American Mathematical Society]] |volume=52  |pages=1087–1091 |doi=10.1090/S0002-9904-1946-08715-7 |issue=12}}&amp;lt;/ref&amp;gt;   and it has been described as the “fundamental theorem of extremal graph theory”.&amp;lt;ref&amp;gt;{{cite book |last=Bollobás |first=Béla |authorlink=Béla Bollobás |title=Modern Graph Theory |year=1998 |publisher=[[Springer-Verlag]] |location=New York |isbn=0-387-98491-7 |pages=120}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Extremal functions of Turán graphs==&lt;br /&gt;
The extremal function ex(&#039;&#039;n&#039;&#039;;&amp;amp;nbsp;&#039;&#039;H&#039;&#039;) is defined to be the maximum number of edges in a graph of order &#039;&#039;n&#039;&#039; not containing a subgraph isomorphic to &#039;&#039;H&#039;&#039;.  Turán&#039;s theorem says that ex(&#039;&#039;n&#039;&#039;;&amp;amp;nbsp;&#039;&#039;K&#039;&#039;&amp;lt;sub&amp;gt;&#039;&#039;r&#039;&#039;&amp;lt;/sub&amp;gt;)&amp;amp;nbsp;=&amp;amp;nbsp;&#039;&#039;t&#039;&#039;&amp;lt;sub&amp;gt;&#039;&#039;r&#039;&#039;&amp;amp;nbsp;&amp;amp;minus;&amp;amp;nbsp;1&amp;lt;/sub&amp;gt;(&#039;&#039;n&#039;&#039;), the order of the [[Turán graph]], and that the Turán graph is the unique extremal graph.  The Erdős–Stone theorem extends this to graphs not containing &#039;&#039;K&#039;&#039;&amp;lt;sub&amp;gt;&#039;&#039;r&#039;&#039;&amp;lt;/sub&amp;gt;(&#039;&#039;t&#039;&#039;), the complete &#039;&#039;r&#039;&#039;-partite graph with &#039;&#039;t&#039;&#039; vertices in each class (equivalently the [[Turán graph]] &#039;&#039;T&#039;&#039;(&#039;&#039;rt&#039;&#039;,&#039;&#039;r&#039;&#039;)):&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\mbox{ex}(n; K_r(t)) = \left( \frac{r-2}{r-1} + o(1) \right){n\choose2}.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Extremal functions of arbitrary non-bipartite graphs==&lt;br /&gt;
If &#039;&#039;H&#039;&#039; is an arbitrary graph whose [[chromatic number]] is &#039;&#039;r&#039;&#039;&amp;amp;nbsp;&amp;gt;&amp;amp;nbsp;2, then &#039;&#039;H&#039;&#039; is contained in &#039;&#039;K&#039;&#039;&amp;lt;sub&amp;gt;&#039;&#039;r&#039;&#039;&amp;lt;/sub&amp;gt;(&#039;&#039;t&#039;&#039;) whenever &#039;&#039;t&#039;&#039; is at least as large as the largest color class in an &#039;&#039;r&#039;&#039;-coloring of &#039;&#039;H&#039;&#039;, but it is not contained in the Turán graph &#039;&#039;T&#039;&#039;(&#039;&#039;n&#039;&#039;,&#039;&#039;r&#039;&#039;&amp;amp;nbsp;&amp;amp;minus;&amp;amp;nbsp;1) (because every subgraph of this Turán graph may be colored with ,&#039;&#039;r&#039;&#039;&amp;amp;nbsp;&amp;amp;minus;&amp;amp;nbsp;1 colors).&lt;br /&gt;
It follows that the extremal function for &#039;&#039;H&#039;&#039; is at least as large as the number of edges in &#039;&#039;T&#039;&#039;(&#039;&#039;n&#039;&#039;,&#039;&#039;r&#039;&#039;&amp;amp;nbsp;&amp;amp;minus;&amp;amp;nbsp;1), and at most equal to the extremal function for &#039;&#039;K&#039;&#039;&amp;lt;sub&amp;gt;&#039;&#039;r&#039;&#039;&amp;lt;/sub&amp;gt;(&#039;&#039;t&#039;&#039;); that is,&lt;br /&gt;
:&amp;lt;math&amp;gt;\mbox{ex}(n; H) = \left( \frac{r-2}{r-1} + o(1) \right){n\choose2}.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
For [[bipartite graph]]s &#039;&#039;H&#039;&#039;, however, the theorem does not give a tight bound on the extremal function. It is known that, when &#039;&#039;H&#039;&#039; is bipartite, ex(&#039;&#039;n&#039;&#039;;&amp;amp;nbsp;&#039;&#039;H&#039;&#039;)&amp;amp;nbsp;=&amp;amp;nbsp;&#039;&#039;o&#039;&#039;(&#039;&#039;n&#039;&#039;&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt;), and for general bipartite graphs little more is known. See [[Zarankiewicz problem]] for more on the extremal functions of bipartite graphs.&lt;br /&gt;
&lt;br /&gt;
==Quantitative results==&lt;br /&gt;
&lt;br /&gt;
Several versions of the theorem have been proved that more precisely characterise the relation of &#039;&#039;n&#039;&#039;, &#039;&#039;r&#039;&#039;, &#039;&#039;t&#039;&#039; and the [[Little-o notation|&#039;&#039;o&#039;&#039;(1)]] term.  Define the notation&amp;lt;ref&amp;gt;{{cite book |last=Bollobás |first=Béla |authorlink=Béla Bollobás |editor= [[Ronald Graham|R. L. Graham]], M. Grötschel and [[László Lovász|L. Lovász]] (eds.) |title=Handbook of combinatorics |year=1995 |publisher=[[Elsevier]] |isbn=0-444-88002-X |pages=1244 |chapter=Extremal graph theory}}&amp;lt;/ref&amp;gt; &#039;&#039;s&#039;&#039;&amp;lt;sub&amp;gt;&#039;&#039;r&#039;&#039;,&amp;amp;epsilon;&amp;lt;/sub&amp;gt;(&#039;&#039;n&#039;&#039;) (for 0&amp;amp;nbsp;&amp;lt;&amp;amp;nbsp;&amp;amp;epsilon;&amp;amp;nbsp;&amp;lt;&amp;amp;nbsp;1/(2(&#039;&#039;r&#039;&#039;&amp;amp;nbsp;&amp;amp;minus;&amp;amp;nbsp;1))) to be the greatest &#039;&#039;t&#039;&#039; such that every graph of order &#039;&#039;n&#039;&#039; and size&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\left( \frac{r-2}{2(r-1)} + \varepsilon \right)n^2&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
contains a &#039;&#039;K&#039;&#039;&amp;lt;sub&amp;gt;&#039;&#039;r&#039;&#039;&amp;lt;/sub&amp;gt;(&#039;&#039;t&#039;&#039;).&lt;br /&gt;
&lt;br /&gt;
Erdős and Stone proved that&lt;br /&gt;
:&amp;lt;math&amp;gt;s_{r,\varepsilon}(n) \geq \left(\underbrace{\log\cdots\log}_{r-1} n\right)^{1/2}&amp;lt;/math&amp;gt;&lt;br /&gt;
for &#039;&#039;n&#039;&#039; sufficiently large.  The correct order of &#039;&#039;s&#039;&#039;&amp;lt;sub&amp;gt;&#039;&#039;r&#039;&#039;,&amp;amp;epsilon;&amp;lt;/sub&amp;gt;(&#039;&#039;n&#039;&#039;) in terms of &#039;&#039;n&#039;&#039; was found by Bollobás and Erdős:&amp;lt;ref&amp;gt;{{cite journal |last=Bollobás |first=B. |authorlink=Béla Bollobás |coauthors=[[Paul Erdős|Erdős, P.]] |year=1973 |title=On the structure of edge graphs |journal=[[Bulletin of the London Mathematical Society]] |volume=5 |pages=317–321 |doi=10.1112/blms/5.3.317 |issue=3}}&amp;lt;/ref&amp;gt; for any given &#039;&#039;r&#039;&#039; and &amp;amp;epsilon; there are constants &#039;&#039;c&#039;&#039;&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;(&#039;&#039;r&#039;&#039;,&amp;amp;nbsp;&amp;amp;epsilon;) and &#039;&#039;c&#039;&#039;&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;(&#039;&#039;r&#039;&#039;,&amp;amp;nbsp;&amp;amp;epsilon;) such that &#039;&#039;c&#039;&#039;&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;(&#039;&#039;r&#039;&#039;,&amp;amp;nbsp;&amp;amp;epsilon;)&amp;amp;nbsp;log&amp;amp;nbsp;&#039;&#039;n&#039;&#039;&amp;amp;nbsp;&amp;amp;lt;&amp;amp;nbsp;&#039;&#039;s&#039;&#039;&amp;lt;sub&amp;gt;&#039;&#039;r&#039;&#039;,&amp;amp;epsilon;&amp;lt;/sub&amp;gt;(&#039;&#039;n&#039;&#039;)&amp;amp;nbsp;&amp;amp;lt;&amp;amp;nbsp;&#039;&#039;c&#039;&#039;&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;(&#039;&#039;r&#039;&#039;,&amp;amp;nbsp;&amp;amp;epsilon;)&amp;amp;nbsp;log&amp;amp;nbsp;&#039;&#039;n&#039;&#039;.  Chvátal and Szemerédi&amp;lt;ref&amp;gt;{{cite journal |last=Chvátal |first=V. |authorlink=Václav Chvátal |coauthors=[[Endre Szemerédi|Szemerédi, E.]] |year=1981 |title=On the Erdős-Stone theorem |journal=[[Journal of the London Mathematical Society]] |volume=23 |issue=2 |pages=207–214 |doi=10.1112/jlms/s2-23.2.207}}&amp;lt;/ref&amp;gt; then determined the nature of the dependence on &#039;&#039;r&#039;&#039; and &amp;amp;epsilon;, up to a constant:&lt;br /&gt;
:&amp;lt;math&amp;gt;\frac{1}{500\log(1/\varepsilon)}\log n &amp;lt; s_{r,\varepsilon}(n) &amp;lt; \frac{5}{\log(1/\varepsilon)}\log n&amp;lt;/math&amp;gt; for sufficiently large &#039;&#039;n&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
==Notes==&lt;br /&gt;
{{reflist}}&lt;br /&gt;
&lt;br /&gt;
{{DEFAULTSORT:Erdos-Stone theorem}}&lt;br /&gt;
[[Category:Extremal graph theory]]&lt;br /&gt;
[[Category:Theorems in graph theory]]&lt;br /&gt;
[[Category:Paul Erdős]]&lt;/div&gt;</summary>
		<author><name>88.78.14.27</name></author>
	</entry>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=Forward_price&amp;diff=8612</id>
		<title>Forward price</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Forward_price&amp;diff=8612"/>
		<updated>2013-07-08T15:41:33Z</updated>

		<summary type="html">&lt;p&gt;88.78.142.150: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Probability distribution&lt;br /&gt;
  | type       = density&lt;br /&gt;
  | notation   = &amp;lt;math&amp;gt;\textrm{GEV}(\mu,\,\sigma,\,\xi)&amp;lt;/math&amp;gt;&lt;br /&gt;
  | parameters = &#039;&#039;μ&#039;&#039; ∈ &#039;&#039;&#039;R&#039;&#039;&#039; — [[location parameter|location]],&amp;lt;br/&amp;gt; &#039;&#039;σ&#039;&#039; &amp;gt; 0 — [[scale parameter|scale]],&amp;lt;br/&amp;gt; &#039;&#039;ξ&#039;&#039; ∈ &#039;&#039;&#039;R&#039;&#039;&#039; — [[shape parameter|shape]].&lt;br /&gt;
  | support    = &#039;&#039;x&#039;&#039; ∈ [&amp;amp;thinsp;&#039;&#039;μ&#039;&#039; − &#039;&#039;σ&amp;amp;thinsp;/&amp;amp;thinsp;ξ&#039;&#039;, +∞) &amp;amp;nbsp; when &#039;&#039;ξ&#039;&#039; &amp;gt; 0,&amp;lt;br/&amp;gt;&#039;&#039;x&#039;&#039; ∈ (−∞, +∞) &amp;amp;nbsp; when &#039;&#039;ξ&#039;&#039; = 0,&amp;lt;br/&amp;gt;&#039;&#039;x&#039;&#039; ∈ (−∞, &#039;&#039;μ&#039;&#039; − &#039;&#039;σ&amp;amp;thinsp;/&amp;amp;thinsp;ξ&#039;&#039;&amp;amp;thinsp;] &amp;amp;nbsp; when &#039;&#039;ξ&#039;&#039; &amp;lt; 0.&lt;br /&gt;
  | pdf        = &amp;lt;math&amp;gt;\frac{1}{\sigma}\,t(x)^{\xi+1}e^{-t(x)},&amp;lt;/math&amp;gt; &amp;amp;nbsp; where &amp;lt;math&amp;gt;t(x) = \begin{cases}\big(1+(\tfrac{x-\mu}{\sigma})\xi\big)^{-1/\xi} &amp;amp; \textrm{if}\ \xi\neq0 \\ e^{-(x-\mu)/\sigma} &amp;amp; \textrm{if}\ \xi=0\end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
  | cdf        = &amp;lt;math&amp;gt;e^{-t(x)},\,&amp;lt;/math&amp;gt; &amp;amp;nbsp; for &#039;&#039;x&#039;&#039; ∈ support&lt;br /&gt;
  | mean       = &amp;lt;math&amp;gt;\begin{cases}\mu + \sigma\frac{\Gamma(1-\xi)-1}{\xi} &amp;amp; \text{if}\ \xi\neq 0,\xi&amp;lt;1,\\ \mu + \sigma\,\gamma &amp;amp; \text{if}\ \xi=0,\\ \infty &amp;amp; \text{if}\ \xi\geq 1,\end{cases}&amp;lt;/math&amp;gt; where &amp;lt;math&amp;gt;\gamma&amp;lt;/math&amp;gt; is [[Euler’s constant]].&lt;br /&gt;
  | median     = &amp;lt;math&amp;gt;\begin{cases}\mu + \sigma \frac{(\ln2)^{-\xi}-1}{\xi} &amp;amp; \text{if}\ \xi\neq0,\\ \mu - \sigma \ln\ln2 &amp;amp; \text{if}\ \xi=0.\end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
  | mode       = &amp;lt;math&amp;gt;\begin{cases}\mu + \sigma \frac{(1+\xi)^{-\xi}-1}{\xi} &amp;amp; \text{if}\ \xi\neq0,\\ \mu &amp;amp; \text{if}\ \xi=0.\end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
  | variance   = &amp;lt;math&amp;gt;\begin{cases}\sigma^2\,(g_2-g_1^2)/\xi^2 &amp;amp; \text{if}\ \xi\neq0,\xi&amp;lt;\frac12,\\ \sigma^2\,\frac{\pi^2}{6} &amp;amp; \text{if}\ \xi=0, \\ \infty &amp;amp; \text{if}\ \xi\geq\frac12,\end{cases}&amp;lt;/math&amp;gt;&amp;lt;br/&amp;gt; where &#039;&#039;g&amp;lt;sub&amp;gt;k&amp;lt;/sub&amp;gt;&#039;&#039; = [[gamma function|Γ]](1 − &#039;&#039;kξ&#039;&#039;).&lt;br /&gt;
  | skewness   = &amp;lt;math&amp;gt;\begin{cases}\frac{g_3-3g_1g_2+2g_1^3}{(g_2-g_1^2)^{3/2}} &amp;amp; \text{if}\ \xi\neq0,\\ \frac{12 \sqrt{6} \zeta(3)}{\pi^3} &amp;amp; \text{if}\ \xi=0.\end{cases}&amp;lt;/math&amp;gt; &amp;lt;br&amp;gt; where &amp;lt;math&amp;gt;\zeta(x)&amp;lt;/math&amp;gt; is [[Riemann zeta function]]&lt;br /&gt;
  | g_k        = &amp;lt;math&amp;gt;g_k=\Gamma(1-k\xi)&amp;lt;/math&amp;gt;&lt;br /&gt;
  | kurtosis   = &amp;lt;math&amp;gt;\begin{cases}\frac{g_4-4g_1g_3+6g_2g_1^2-3g_1^4}{(g_2-g_1^2)^{2}}-3  &amp;amp; \text{if}\ \xi\neq0,\\ \frac{12}{5} &amp;amp; \text{if}\ \xi=0.\end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
  | entropy    = &amp;lt;math&amp;gt;\log(\sigma)\,+\,\gamma\xi\,+\,(\gamma+1)&amp;lt;/math&amp;gt;&lt;br /&gt;
  | mgf        = &amp;lt;ref name=R1/&amp;gt;&lt;br /&gt;
  | char       =&amp;lt;ref name=R1/&amp;gt;|&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
In [[probability theory]] and [[statistics]], the &#039;&#039;&#039;generalized extreme value&#039;&#039;&#039; (&#039;&#039;&#039;GEV&#039;&#039;&#039;) &#039;&#039;&#039;distribution&#039;&#039;&#039; is a family of continuous [[probability distribution]]s developed within [[extreme value theory]] to combine the [[Gumbel distribution|Gumbel]], [[Fréchet distribution|Fréchet]] and [[Weibull distribution|Weibull]] families also known as type I, II and III extreme value distributions. By the [[Fisher–Tippett–Gnedenko theorem|extreme value theorem]] the GEV distribution is the only possible limit distribution of properly normalized maxima of a sequence of independent and identically distributed random variables. Note that a limit distribution need not exist: this requires regularity conditions on the tail of the distribution.  Despite this, the GEV distribution is often used as an approximation to model the maxima of long (finite) sequences of random variables.&lt;br /&gt;
&lt;br /&gt;
In some fields of application the generalized extreme value distribution is known as the &#039;&#039;&#039;Fisher–Tippett distribution&#039;&#039;&#039;, named after [[R. A. Fisher]] and [[L. H. C. Tippett]] who recognised three function forms outlined below. However usage of this name is sometimes restricted to mean the special case of the [[Gumbel distribution]].&lt;br /&gt;
&lt;br /&gt;
==Specification==&lt;br /&gt;
The generalized extreme value distribution has cumulative distribution function&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;F(x;\mu,\sigma,\xi) = \exp\left\{-\left[1+\xi\left(\frac{x-\mu}{\sigma}\right)\right]^{-1/\xi}\right\}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
for &amp;lt;math&amp;gt;1+\xi(x-\mu)/\sigma&amp;gt;0&amp;lt;/math&amp;gt;, where &amp;lt;math&amp;gt;\mu\in\mathbb R&amp;lt;/math&amp;gt; is the location parameter, &amp;lt;math&amp;gt;\sigma&amp;gt;0&amp;lt;/math&amp;gt; the scale parameter and &amp;lt;math&amp;gt;\xi\in\mathbb R&amp;lt;/math&amp;gt; the shape parameter. Thus for &amp;lt;math&amp;gt;\xi&amp;gt;0&amp;lt;/math&amp;gt;, the expression just given for the cumulative distribution function is valid for &amp;lt;math&amp;gt;x &amp;gt; \mu-\sigma/\xi&amp;lt;/math&amp;gt;, while for &amp;lt;math&amp;gt;\xi&amp;lt;0&amp;lt;/math&amp;gt; it is valid for &amp;lt;math&amp;gt;x &amp;lt; \mu+ \sigma/(-\xi)&amp;lt;/math&amp;gt;. In the first case, at the lower end-point it equals 0; in the second case, at the upper end-point, it equals 1. For &amp;lt;math&amp;gt;\xi = 0&amp;lt;/math&amp;gt; the expression just given for the cumulative distribution function is formally undefined and is replaced by the result obtained by taking the limit as &amp;lt;math&amp;gt;\xi\to 0&amp;lt;/math&amp;gt; &lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;F(x;\mu,\sigma,0) = \exp\left\{-\exp \left(-\frac{x-\mu}{\sigma}\right)\right\}&amp;lt;/math&amp;gt;,&lt;br /&gt;
&lt;br /&gt;
without any restriction on &#039;&#039;x&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
The density function is, consequently,&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;f(x;\mu,\sigma,\xi) = \frac{1}{\sigma}\left[1+\xi\left(\frac{x-\mu}{\sigma}\right)\right]^{(-1/\xi)-1} &amp;lt;/math&amp;gt;&amp;lt;math&amp;gt;\exp\left\{-\left[1+\xi\left(\frac{x-\mu}{\sigma}\right)\right]^{-1/\xi}\right\}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
again, for &amp;lt;math&amp;gt;x &amp;gt; \mu-\sigma/\xi&amp;lt;/math&amp;gt; in the case &amp;lt;math&amp;gt;\xi&amp;gt;0&amp;lt;/math&amp;gt;, and for &amp;lt;math&amp;gt;x &amp;lt; \mu+\sigma/(-\xi)&amp;lt;/math&amp;gt; in the case &amp;lt;math&amp;gt;\xi&amp;lt;0&amp;lt;/math&amp;gt;. The density is zero outside of the relevant range. In the case &amp;lt;math&amp;gt;\xi=0&amp;lt;/math&amp;gt; the density is positive on the whole real line and equal to&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;f(x;\mu,\sigma,\xi) = \frac{1}{\sigma}\exp\left[-\left(\frac{x-\mu}{\sigma}\right)\right] &amp;lt;/math&amp;gt;&amp;lt;math&amp;gt;\exp\left\{-\exp\left[\left(-\frac{x-\mu}{\sigma}\right)\right]\right\}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
[[Image:GevDensity.svg||Example of density functions for distributions of the GEV family.]]&lt;br /&gt;
&lt;br /&gt;
==Summary statistics==&lt;br /&gt;
Some simple statistics of the distribution are:{{Citation needed|date=May 2011}}&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\operatorname{E}(X) = \mu-\frac{\sigma}{\xi}+\frac{\sigma}{\xi}g_1 ,&amp;lt;/math&amp;gt;&lt;br /&gt;
:&amp;lt;math&amp;gt;\operatorname{Var}(X) = \frac{\sigma^2}{\xi^2}(g_2-g_1^2) ,&amp;lt;/math&amp;gt;&lt;br /&gt;
:&amp;lt;math&amp;gt;\operatorname{Mode}(X) = \mu+\frac{\sigma}{\xi}[(1+\xi)^{-\xi}-1] .&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The [[skewness]] is for ξ&amp;gt;0&lt;br /&gt;
:&amp;lt;math&amp;gt;\operatorname{skewness}(X) = \frac{g_3-3g_1g_2+2g_1^3}{(g_2-g_1^2)^{3/2}} &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
For ξ&amp;lt;0, the sign of the numerator is reversed. &lt;br /&gt;
&lt;br /&gt;
The excess [[kurtosis]] is:&lt;br /&gt;
:&amp;lt;math&amp;gt;\operatorname{kurtosis\ excess}(X) = \frac{g_4-4g_1g_3+6g_2g_1^2-3g_1^4}{(g_2-g_1^2)^{2}}-3 . &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;g_k=\Gamma(1-k\xi)&amp;lt;/math&amp;gt;, k=1,2,3,4, and &amp;lt;math&amp;gt;\Gamma(t)&amp;lt;/math&amp;gt; is the [[gamma function]].&lt;br /&gt;
&amp;lt;!-- Unsourced image removed: [[Image:gevDensity.jpeg||Example of density functions for distributions of the GEV family.]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Link to Fréchet, Weibull and Gumbel families==&lt;br /&gt;
The shape parameter &amp;lt;math&amp;gt;\xi&amp;lt;/math&amp;gt; governs the tail behaviour of the distribution. The sub-families defined by &amp;lt;math&amp;gt;\xi= 0&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;\xi&amp;gt;0&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;\xi&amp;lt;0&amp;lt;/math&amp;gt; correspond, respectively, to the Gumbel, Fréchet and Weibull families, whose cumulative distribution functions are displayed below.&lt;br /&gt;
* [[Gumbel distribution|Gumbel]] or type I extreme value distribution (&amp;lt;math&amp;gt;\xi=0&amp;lt;/math&amp;gt;)&lt;br /&gt;
:&amp;lt;math&amp;gt; F(x;\mu,\sigma,0)=e^{-e^{-(x-\mu)/\sigma}}\;\;\; \text{for} \;\; x\in\mathbb R.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* [[Fréchet distribution|Fréchet]] or type II extreme value distribution, if &amp;lt;math&amp;gt;\xi=\alpha^{-1}&amp;gt;0&amp;lt;/math&amp;gt;&lt;br /&gt;
:&amp;lt;math&amp;gt; F(x;\mu,\sigma,\xi)=\begin{cases} 0 &amp;amp; x\leq \mu \\ e^{-((x-\mu)/\sigma)^{-\alpha}} &amp;amp; x&amp;gt;\mu. \end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* Reversed [[Weibull distribution|Weibull]] or type III extreme value distribution, if &amp;lt;math&amp;gt;\xi=-\alpha^{-1}&amp;lt;0&amp;lt;/math&amp;gt;&lt;br /&gt;
:&amp;lt;math&amp;gt; F(x;\mu,\sigma,\xi)=\begin{cases} e^{-(-(x-\mu)/\sigma)^{\alpha}} &amp;amp; x&amp;lt;\mu \\ 1 &amp;amp; x\geq \mu \end{cases}&amp;lt;/math&amp;gt; &lt;br /&gt;
where &amp;lt;math&amp;gt;\sigma&amp;gt;0&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Remark I: The theory here relates to maxima and the distribution being discussed is an extreme value distribution for maxima. A generalised extreme value distribution for minima can be obtained, for example by substituting (&amp;amp;minus;&#039;&#039;x&#039;&#039;) for &#039;&#039;x&#039;&#039; in the distribution function, and subtracting from one: this yields a separate family of distributions.&lt;br /&gt;
&lt;br /&gt;
Remark II: The ordinary Weibull distribution arises in reliability applications and is obtained from the distribution here by using the variable &amp;lt;math&amp;gt; t = \mu - x &amp;lt;/math&amp;gt;, which gives a strictly positive support - in contrast to the use in the extreme value theory here. This arises because the Weibull distribution is used in cases that deal with the minimum rather than the maximum. The distribution here has an addition parameter compared to the usual form of the Weibull distribution and, in addition, is reversed so that the distribution has an upper bound rather than a lower bound. Importantly, in applications of the GEV, the upper bound is unknown and so must be estimated while when applying the Weibull distribution the lower bound is known to be zero.&lt;br /&gt;
&lt;br /&gt;
Remark III: Note the differences in the ranges of interest for the three extreme value distributions: [[Gumbel distribution|Gumbel]] is unlimited, [[Fréchet distribution|Fréchet]] has a lower limit, while the reversed [[Weibull distribution|Weibull]] has an upper limit.&lt;br /&gt;
&lt;br /&gt;
One can link the type I to types II and III the following way: if the cumulative distribution function of some random variable &amp;lt;math&amp;gt;X&amp;lt;/math&amp;gt; is of type II, and with the positive numbers as support, i.e. &amp;lt;math&amp;gt;F(x; 0, \sigma, \alpha)&amp;lt;/math&amp;gt;, then the cumulative distribution function of &amp;lt;math&amp;gt;\ln X&amp;lt;/math&amp;gt; is of type I, namely &amp;lt;math&amp;gt;F(x; \ln \sigma, 1/\alpha, 0)&amp;lt;/math&amp;gt;. Similarly, if the cumulative distribution function of &amp;lt;math&amp;gt;X&amp;lt;/math&amp;gt; is of type III, and with the negative numbers as support, i.e. &amp;lt;math&amp;gt;F(x; 0, \sigma, -\alpha)&amp;lt;/math&amp;gt;, then the cumulative distribution function of &amp;lt;math&amp;gt;\ln (-X)&amp;lt;/math&amp;gt; is of type I, namely &amp;lt;math&amp;gt;F(x; -\ln \sigma, 1/\alpha, 0)&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
==Link to logit models (logistic regression)==&lt;br /&gt;
[[Multinomial logit]] models, and certain other types of [[logistic regression]], can be phrased as [[latent variable]] models with [[error variable]]s distributed as [[Gumbel distribution]]s (type I generalized extreme value distributions).  This phrasing is common in the theory of [[discrete choice]] models, which include [[logit model]]s, [[probit model]]s, and various extensions of them, and derives from the fact that the difference of two type-I GEV-distributed variables follows a [[logistic distribution]], of which the [[logit function]] is the [[quantile function]].  The type-I GEV distribution thus plays the same role in these logit models as the [[normal distribution]] does in the corresponding probit models.&lt;br /&gt;
&lt;br /&gt;
==Properties==&lt;br /&gt;
The [[cumulative distribution function]] of the generalized extreme value distribution solves the [[stability postulate]] equation.{{Citation needed|date=May 2011}} The generalized extreme value distribution is a special case of a max-stable distribution, and is a transformation of a min-stable distribution.&lt;br /&gt;
&lt;br /&gt;
==Related distributions==&lt;br /&gt;
* If &amp;lt;math&amp;gt;X \sim \textrm{GEV}(\mu,\,\sigma,\,0)&amp;lt;/math&amp;gt; then &amp;lt;math&amp;gt;mX+b \sim \textrm{GEV}(m\mu+b,\,m\sigma,\,0)&amp;lt;/math&amp;gt;&lt;br /&gt;
* If &amp;lt;math&amp;gt;X \sim \textrm{Gumbel}(\mu,\,\sigma)&amp;lt;/math&amp;gt; ([[Gumbel distribution]]) then &amp;lt;math&amp;gt;X \sim \textrm{GEV}(\mu,\,\sigma,\,0)&amp;lt;/math&amp;gt;&lt;br /&gt;
* If &amp;lt;math&amp;gt;X \sim \textrm{Weibull}(\sigma,\,\mu)&amp;lt;/math&amp;gt; ([[Weibull distribution]]) then &amp;lt;math&amp;gt;\mu\left(1-\sigma\mathrm{log}{\tfrac{X}{\sigma}}\right) \sim \textrm{GEV}(\mu,\,\sigma,\,0)&amp;lt;/math&amp;gt;&lt;br /&gt;
* If &amp;lt;math&amp;gt;X \sim \textrm{GEV}(\mu,\,\sigma,\,0)&amp;lt;/math&amp;gt; then &amp;lt;math&amp;gt;\sigma \exp (-\tfrac{X-\mu}{\mu \sigma} ) \sim \textrm{Weibull}(\sigma,\,\mu)&amp;lt;/math&amp;gt; ([[Weibull distribution]]){{Citation needed|date=May 2011}}&lt;br /&gt;
* If &amp;lt;math&amp;gt;X \sim \textrm{Exponential}(1)\,&amp;lt;/math&amp;gt; ([[Exponential distribution]]) then &amp;lt;math&amp;gt;\mu - \sigma \log{X} \sim \textrm{GEV}(\mu,\,\sigma,\,0)&amp;lt;/math&amp;gt;{{Citation needed|date=May 2011}}&lt;br /&gt;
* If &amp;lt;math&amp;gt;X \sim \mathrm{GEV}(\alpha,\beta,0)\,&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;Y \sim \mathrm{GEV}(\alpha,\beta,0)\,&amp;lt;/math&amp;gt; then &amp;lt;math&amp;gt;X-Y \sim \mathrm{Logistic}(0,\beta) \,&amp;lt;/math&amp;gt; ([[Logistic distribution]])&lt;br /&gt;
* If &amp;lt;math&amp;gt;X \sim \mathrm{GEV}(\alpha,\beta,0)\,&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;Y \sim \mathrm{GEV}(\alpha,\beta,0)\,&amp;lt;/math&amp;gt; then &amp;lt;math&amp;gt;X+Y \sim \mathrm{Logistic}(2 \alpha,\beta) \,&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==See also==&lt;br /&gt;
*[[Fisher–Tippett–Gnedenko theorem]]&lt;br /&gt;
*[[Generalized Pareto distribution]]&lt;br /&gt;
&lt;br /&gt;
{{More footnotes|date=May 2011}}&lt;br /&gt;
&lt;br /&gt;
==Notes==&lt;br /&gt;
{{reflist|refs=&lt;br /&gt;
&amp;lt;ref name=R1&amp;gt;Muraleedharan. G, C. Guedes Soares and Cláudia Lucas (2011). &amp;quot;Characteristic and Moment Generating Functions of Generalised Extreme Value Distribution (GEV)&amp;quot;. In Linda. L. Wright (Ed.), &#039;&#039;Sea Level Rise, Coastal Engineering, Shorelines and Tides&#039;&#039;, Chapter-14, pp. 269–276. Nova Science Publishers. ISBN 978-1-61728-655-1&amp;lt;/ref&amp;gt;}}&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
* {{cite book |last1=Embrechts |first1=Paul |last2=Klüppelberg |first2=Claudia |last3=Mikosch |first3=Thomas |title=Modelling extremal events for insurance and finance |year=1997 |location=Berlin |publisher=Springer Verlag |url=http://books.google.com/books?id=BXOI2pICfJUC}}&lt;br /&gt;
* {{cite book | author=Leadbetter, M.R., Lindgren, G. and Rootzén, H. | title=Extremes and related properties of random sequences and processes | publisher=Springer-Verlag | year=1983 | isbn = 0-387-90731-9 }}&lt;br /&gt;
* {{cite book | author=Resnick, S.I. | title=Extreme values, regular variation and point processes | publisher=Springer-Verlag | year=1987 | isbn = 0-387-96481-9 }}&lt;br /&gt;
* {{cite book | author=Coles, Stuart | title=An Introduction to Statistical Modeling of Extreme Values, | url = http://books.google.com/books?id=2nugUEaKqFEC&amp;amp;lpg=PP1&amp;amp;pg=PP1#v=onepage&amp;amp;q=&amp;amp;f=false | publisher=Springer-Verlag | year=2001 | isbn = 1-85233-459-2 }}&lt;br /&gt;
&lt;br /&gt;
{{ProbDistributions|continuous-variable}}&lt;br /&gt;
&lt;br /&gt;
[[Category:Continuous distributions]]&lt;br /&gt;
[[Category:Extreme value data]]&lt;br /&gt;
[[Category:Probability distributions]]&lt;/div&gt;</summary>
		<author><name>88.78.142.150</name></author>
	</entry>
</feed>