COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Optimization and Incentives Seminar > Convolution tail equivalent distributions: basic properties

## Convolution tail equivalent distributions: basic propertiesAdd to your list(s) Download to your calendar using vCal - Prof Dmitri Korshunov, (Novosibirsk)
- Friday 27 February 2009, 14:00-15:00
- MR12, CMS, Wilberforce Road, Cambridge, CB3 0WB.
If you have a question about this talk, please contact Neil Walton. The talk discusses the tail behaviour of 2-fold convolutions $\overline{F \star F}$ of right-unbounded distributions and to the tail behaviour of the distribution of the random sum $S_\tau$. We start with the description of all possible values of the limit of the ratio $\overline{F \star F}(x)/\overline F(x)$ as $x\to\infty$. This problem is closely related to the problem of the lower limit of this ratio and goes back to W. Rudin. The second part of the talk is devoted to conditions under which $P(S_\tau>x)\sim E\tau \overline F(x)$ as $x\to\infty$. We also consider applications of results obtained to random walks, compound Poisson distributions, infinitely divisible laws, and branching processes. This talk is part of the Optimization and Incentives Seminar series. ## This talk is included in these lists:- All CMS events
- All Talks (aka the CURE list)
- CMS Events
- Cambridge talks
- DPMMS Lists
- DPMMS info aggregator
- DPMMS lists
- Economics and Computer Science Talks
- Hanchen DaDaDash
- Interested Talks
- MR12, CMS, Wilberforce Road, Cambridge, CB3 0WB
- Optimization and Incentives Seminar
- School of Physical Sciences
- Statistical Laboratory info aggregator
- Trust & Technology Initiative - interesting events
- bld31
Note that ex-directory lists are not shown. |
## Other listsAnglia Ruskin University - Community Engagement Slavonic Studies Graduate Research Forum Mathworks## Other talksSynthesising Molecular Function: Shape Matters Hypergraph Saturation Irregularities How could education systems research prompt a change to how DFIS works on education First order rigidity of higher rank arithmetic lattices (note the nonstandard day) |