Stack Exchange Network

Stack Exchange network consists of 175 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange

Questions tagged [probability-theory]

Use this tag only if your question is about the modern theoretical footing for probability, for example probability spaces, random variables, law of large numbers, and central limit theorems. Use [tag:probability] instead for specific problems and explicit computations. Use [tag:probability-distributions] for specific distribution functions, and consider [tag:stochastic-processes] when appropriate.

7
votes
0answers
122 views
+300

If $X\sim \mathrm{lognormal}$ then $Y:=(X-d|x\geq d)$ has approximately a Generalized Pareto distribution.

Let $X$ be a random variable with lognormal distribution. Show that when sufficiently large then $Y:=(X-d|x\geq d)$ is approximately a random variable with generalized Pareto distribution. Hint: Use ...
7
votes
1answer
166 views
+100

If $X^{(n)},X$ are càdlàg and $X^{(n)}\to X$ in distribution, do the corresponding transition semigroups strongly converge?

Let $\left(\kappa^{(n)}_t\right)_{t\ge0}$ and $(\kappa_t)_{t\ge0}$ be Markov semigroups on $(\mathbb R,\mathcal B(\mathbb R))$ for $n\in\mathbb N$ $(T_n(t))_{t\ge0}$ and $(T(t))_{t\ge0}$ be strongly ...
1
vote
1answer
35 views
+100

Best way to visualize queueing theory for a Lecture on Markov Chains

Let the Markov Chain $X:=(X_{n})_{n \in \mathbb N_{0}}$ denote, for every $X_{n}$, the number of people waiting in a line at time $n$. Now note that $X$ is a Markov Chain living on $\mathbb Z_{+}$. ...
2
votes
0answers
41 views
+50

How can we proof this implication in Corollary 4.8.7 in the book of Ethier and Kurtz?

I'm trying to understand the proof of the implication "(g) $\Rightarrow$ (f)" in Corollary 8.7 of Chapter 4 in the book Markov Processes: Characterization and Convergence by Stewart N. Ethier, Thomas ...