Sökning: "Dmitrii Silvestrov"
Visar resultat 1 - 5 av 15 avhandlingar innehållade orden Dmitrii Silvestrov.
1. Perturbed Markov Chains with Damping Component and Information Networks
Sammanfattning : This thesis brings together three thematic topics, PageRank of evolving tree graphs, stopping criteria for ranks and perturbed Markov chains with damping component. The commonality in these topics is their focus on ranking problems in information networks. LÄS MER
2. Analytical and Iterative Methods of Computing PageRank of Networks
Sammanfattning : This thesis is about variants of PageRank, methods of PageRank computation and perturbation analysis of a PageRank vector as a stationary distribution of a kind of perturbed Markov chain model. Chapter 2 of this thesis gives closed form formulae for ordinary and lazy PageRanks for some specific simple line graphs. LÄS MER
3. Weak Convergence of First-Rare-Event Times for Semi-Markov Processes
Sammanfattning : I denna avhandling studerar vi nödvändiga och tillräckliga villkor för svag konvergens av första-sällan-händelsetider för semi-Markovska processer.I introduktionen ger vi nödvändiga grundläggande definitioner och beskrivningar av modeller som betraktas i avhandlingen, samt ger några exempel på situationer i vilka metoder av första-sällan-händelsetider kan vara lämpliga att använda. LÄS MER
4. Catastrophe, Ruin and Death - Some Perspectives on Insurance Mathematics
Sammanfattning : This thesis gives some perspectives on insurance mathematics related to life insurance and / or reinsurance. Catastrophes and large accidents resulting in many lost lives are unfortunatley known to happen over and over again. LÄS MER
5. On the optimal stopping time of learning
Sammanfattning : The goal of this thesis is to study the economics of computational learning. Attention is also paid to applications of computational learning models, especially Valiant's so-called `probably approximately correctly' (PAC) learning model, in econometric situations. LÄS MER