Bibliographic record
Abstract
Stochastic processes are used to model quantities that exhibit random fluctuations over time, such as stock prices, temperatures, wind speeds, etc. Lévy processes make up a popular class of models due to their theoretical properties and applications in e.g. finance and physics.<br/>From a theoretical point of view these processes evolve in continuous time but in practice only a finite number of observations are available. Understanding the implications of this discretization is essential and in many cases it requires knowledge of the local properties of the process. The first paper in this dissertation is concerned with a specific discretization scheme for positive self-similar Markov processes. To describe this we rely on knowledge about small-time fluctuations of Lévy processes. In another paper we examine the local properties of diffusions. At a fixed time point such a process behaves locally as a scaled Brownian motion and we prove a similar result for the small-time fluctuations at the supremum. The theory which describes a univariate Lévy process before and after its supremum is well-known and relies on the notion of a Lévy process conditioned to stay positive or negative. In a third paper we extend this to the multivariate setting, constructing the law of a Lévy process conditioned to stay in a half-space. This is related to splitting the process at its directional supremum and we further conjecture how it can be used to describe the local behavior of the process when it is farthest from the origin.<br/>One of the big challenges in modern statistics is dealing with high-dimensional data. Classical models are faced with an increased risk of overfitting, large computational cost and low interpretability. The concept of sparsity addresses these issues by taking advantage of lower-dimensional structures in the data. The use of graphical models is one way of promoting sparsity and has recently been introduced in multivariate extreme value theory. The final paper in this dissertation introduces graphical models in the context of Lévy processes. To do this we exploit a subtle connection to extremes.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".