<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://en.formulasearchengine.com/index.php?action=history&amp;feed=atom&amp;title=Complex_polygon</id>
	<title>Complex polygon - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://en.formulasearchengine.com/index.php?action=history&amp;feed=atom&amp;title=Complex_polygon"/>
	<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/index.php?title=Complex_polygon&amp;action=history"/>
	<updated>2026-04-17T01:31:15Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.0-wmf.28</generator>
	<entry>
		<id>https://en.formulasearchengine.com/index.php?title=Complex_polygon&amp;diff=236219&amp;oldid=prev</id>
		<title>en&gt;Steelpillow: Undid revision 614519301 by 208.50.124.65 (talk) The Lemone hexagon has one non-complex solution</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/index.php?title=Complex_polygon&amp;diff=236219&amp;oldid=prev"/>
		<updated>2014-06-26T16:30:16Z</updated>

		<summary type="html">&lt;p&gt;Undid revision 614519301 by &lt;a href=&quot;/wiki/Special:Contributions/208.50.124.65&quot; title=&quot;Special:Contributions/208.50.124.65&quot;&gt;208.50.124.65&lt;/a&gt; (&lt;a href=&quot;/index.php?title=User_talk:208.50.124.65&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;User talk:208.50.124.65 (page does not exist)&quot;&gt;talk&lt;/a&gt;) The Lemone hexagon has one non-complex solution&lt;/p&gt;
&lt;a href=&quot;https://en.formulasearchengine.com/index.php?title=Complex_polygon&amp;amp;diff=236219&amp;amp;oldid=7495&quot;&gt;Show changes&lt;/a&gt;</summary>
		<author><name>en&gt;Steelpillow</name></author>
	</entry>
	<entry>
		<id>https://en.formulasearchengine.com/index.php?title=Complex_polygon&amp;diff=7495&amp;oldid=prev</id>
		<title>en&gt;Decora: /* See also */</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/index.php?title=Complex_polygon&amp;diff=7495&amp;oldid=prev"/>
		<updated>2012-01-29T18:55:01Z</updated>

		<summary type="html">&lt;p&gt;&lt;span class=&quot;autocomment&quot;&gt;See also&lt;/span&gt;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;{{Unreferenced|date=December 2009}}&lt;br /&gt;
A &amp;#039;&amp;#039;&amp;#039;compound Poisson process&amp;#039;&amp;#039;&amp;#039; is a continuous-time (random) [[stochastic process]] with jumps. The jumps arrive randomly according to a [[Poisson process]] and the size of the jumps is also random, with a specified probability distribution. A compound Poisson process, parameterised by a rate &amp;lt;math&amp;gt;\lambda &amp;gt; 0&amp;lt;/math&amp;gt; and jump size distribution &amp;#039;&amp;#039;G&amp;#039;&amp;#039;, is a process &amp;lt;math&amp;gt;\{\,Y(t) : t \geq 0 \,\}&amp;lt;/math&amp;gt; given by&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;Y(t) = \sum_{i=1}^{N(t)} D_i&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where, &amp;lt;math&amp;gt; \{\,N(t) : t \geq 0\,\}&amp;lt;/math&amp;gt; is a [[Poisson process]] with rate &amp;lt;math&amp;gt;\lambda&amp;lt;/math&amp;gt;, and &amp;lt;math&amp;gt; \{\,D_i : i \geq 1\,\}&amp;lt;/math&amp;gt; are independent and identically distributed random variables, with distribution function &amp;#039;&amp;#039;G&amp;#039;&amp;#039;, which are also independent of &amp;lt;math&amp;gt; \{\,N(t) : t \geq 0\,\}.\,&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
When &amp;lt;math&amp;gt; D_i &amp;lt;/math&amp;gt; are non-negative integer-valued random variable, then this compound Poisson process is named stuttering Poisson process which has the feature that two or more events occur in a very short time .&lt;br /&gt;
&lt;br /&gt;
==Properties of the compound Poisson process==&lt;br /&gt;
Using [[law of total expectation|conditional expectation]], the [[expected value]] of a compound Poisson process can be calculated using a result known as [[Wald&amp;#039;s equation]] as:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\,E(Y(t)) = E(E(Y(t)|N(t))) = E(N(t)E(D)) = E(N(t))E(D) = \lambda t E(D).&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Making similar use of the [[law of total variance]], the [[variance]] can be calculated as: &lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\begin{align}&lt;br /&gt;
\operatorname{var}(Y(t)) &amp;amp;= E(\operatorname{var}(Y(t)|N(t))) + \operatorname{var}(E(Y(t)|N(t))) \\&lt;br /&gt;
&amp;amp;= E(N(t)\operatorname{var}(D)) + \operatorname{var}(N(t)E(D)) \\&lt;br /&gt;
&amp;amp;= \operatorname{var}(D)E(N(t)) + E(D)^2 \operatorname{var}(N(t)) \\&lt;br /&gt;
&amp;amp;= \operatorname{var}(D)\lambda t + E(D)^2\lambda t \\&lt;br /&gt;
&amp;amp;= \lambda t(\operatorname{var}(D) + E(D)^2) \\&lt;br /&gt;
&amp;amp;= \lambda t E(D^2).&lt;br /&gt;
\end{align}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Lastly, using the [[law of total probability]], the [[moment generating function]] can be given as follows:&lt;br /&gt;
 &lt;br /&gt;
:&amp;lt;math&amp;gt;\,\Pr(Y(t)=i) = \sum_{n} \Pr(Y(t)=i|N(t)=n)\Pr(N(t)=n) &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\begin{align}&lt;br /&gt;
E(e^{sY}) &amp;amp; = \sum_i e^{si} \Pr(Y(t)=i) \\&lt;br /&gt;
&amp;amp; = \sum_i e^{si} \sum_{n} \Pr(Y(t)=i|N(t)=n)\Pr(N(t)=n) \\&lt;br /&gt;
&amp;amp; = \sum_n \Pr(N(t)=n) \sum_i e^{si} \Pr(Y(t)=i|N(t)=n) \\&lt;br /&gt;
&amp;amp; = \sum_n \Pr(N(t)=n) \sum_i e^{si}\Pr(D_1 + D_2 + \cdots + D_n=i) \\&lt;br /&gt;
&amp;amp; = \sum_n \Pr(N(t)=n) M_D(s)^n \\&lt;br /&gt;
&amp;amp; = \sum_n \Pr(N(t)=n) e^{n\ln(M_D(s))} \\&lt;br /&gt;
&amp;amp; = M_{N(t)}(\ln(M_D(s)) \\&lt;br /&gt;
&amp;amp; = e^{\lambda t \left ( M_D(s) - 1\right ) }.&lt;br /&gt;
\end{align}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Exponentiation of measures==&lt;br /&gt;
Let &amp;#039;&amp;#039;N&amp;#039;&amp;#039;, &amp;#039;&amp;#039;Y&amp;#039;&amp;#039;, and &amp;#039;&amp;#039;D&amp;#039;&amp;#039; be as above.  Let &amp;#039;&amp;#039;μ&amp;#039;&amp;#039; be the probability measure according to which &amp;#039;&amp;#039;D&amp;#039;&amp;#039; is distributed, i.e.&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\mu(A) = \Pr(D \in A).\,&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Let &amp;#039;&amp;#039;δ&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;0&amp;lt;/sub&amp;gt; be the trivial probability distribution putting all of the mass at zero.  Then the [[probability distribution]] of &amp;#039;&amp;#039;Y&amp;#039;&amp;#039;(&amp;#039;&amp;#039;t&amp;#039;&amp;#039;) is the measure&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\exp(\lambda t(\mu - \delta_0))\,&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where the exponential exp(&amp;#039;&amp;#039;ν&amp;#039;&amp;#039;) of a finite measure &amp;#039;&amp;#039;ν&amp;#039;&amp;#039; on [[Borel set|Borel subsets]] of the [[real number|real line]] is defined by&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\exp(\nu) = \sum_{n=0}^\infty {\nu^{*n} \over n!}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
and&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt; \nu^{*n} = \underbrace{\nu * \cdots *\nu}_{n \text{ factors}}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
is a [[convolution]] of measures, and the series converges [[convergence of random variables|weakly]].&lt;br /&gt;
&lt;br /&gt;
==Fitting a compound Poisson process==&lt;br /&gt;
&lt;br /&gt;
The parameters for independent observations of a compound Poisson process can be chosen using a [[maximum likelihood estimator]] using Simar&amp;#039;s algorithm,&amp;lt;ref&amp;gt;{{cite doi|10.1214/aos/1176343651}}&amp;lt;/ref&amp;gt; which has been shown to converge.&amp;lt;ref&amp;gt;{{cite doi|10.1214/aos/1176345890}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==See also==&lt;br /&gt;
* [[Poisson process]]&lt;br /&gt;
* [[Poisson distribution]]&lt;br /&gt;
* [[Non-homogeneous Poisson process]]&lt;br /&gt;
* [[Fractional Poisson process]]&lt;br /&gt;
* [[Campbell&amp;#039;s formula]] for the [[moment generating function]] of a compound Poisson process&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
{{reflist}}&lt;br /&gt;
&lt;br /&gt;
{{Stochastic processes}}&lt;br /&gt;
&lt;br /&gt;
{{DEFAULTSORT:Compound Poisson Process}}&lt;br /&gt;
[[Category:Poisson processes]]&lt;br /&gt;
&lt;br /&gt;
[[de:Poisson-Prozess#Zusammengesetzte_Poisson-Prozesse]]&lt;/div&gt;</summary>
		<author><name>en&gt;Decora</name></author>
	</entry>
</feed>