Tootfinder

This https://arxiv.org/abs/2406.19157 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_sta…

How to build your latent Markov model -- the role of time and space
Statistical models that involve latent Markovian state processes have become immensely popular tools for analysing time series and other sequential data. However, the plethora of model formulations, the inconsistent use of terminology, and the various inferential approaches and software packages can be overwhelming to practitioners, especially when they are new to this area. With this review-like paper, we thus aim to provide guidance for both statisticians and practitioners working with latent…

Encouraging Students' Responsible Use of GenAI in Software Engineering Education: A Causal Model and Two Institutional Applications
Vahid Garousi, Zafar Jafarov, Aytan Movsumova, Atif Namazov, Huseyn Mirzayev
https://arxiv.org/abs/2506.00682

Encouraging Students' Responsible Use of GenAI in Software Engineering Education: A Causal Model and Two Institutional Applications
Context: As generative AI (GenAI) tools such as ChatGPT and GitHub Copilot become pervasive in education, concerns are rising about students using them to complete rather than learn from coursework-risking overreliance, reduced critical thinking, and long-term skill deficits. Objective: This paper proposes and empirically applies a causal model to help educators scaffold responsible GenAI use in Software Engineering (SE) education. The model identifies how professor actions, student factors, …

On a Variation of Gambler's Ruin Problem
Zhiyi Chi, Vladimir Pozdnyakov
https://arxiv.org/abs/2506.00990 https://arxiv.org/pdf/25…

On a Variation of Gambler's Ruin Problem
Assume that letters (from a finite alphabet) in a text form a Markov chain. We track two distinct words, $U$ and $D$. A gambler gains 1 point for each occurrence of $U$ (including overlapping occurrences) and loses 1 point for each occurrence of $D$ (also including overlapping occurrences). We determine the probability of gaining $A$ points before losing $B$ points, where $A$ and $B$ are integers. Additionally, we find the expected waiting time until one of the two events -- gaining $A$ points …