Tootfinder

On Algorithmic Robustness of Corrupted Markov Chains
Jason Gaitonde, Elchanan Mossel
https://arxiv.org/abs/2507.15176 https://arxiv.o…

On Algorithmic Robustness of Corrupted Markov Chains
We study the algorithmic robustness of general finite Markov chains in terms of their stationary distributions to general, adversarial corruptions of the transition matrix. We show that for Markov chains admitting a spectral gap, variants of the \emph{PageRank} chain are robust in the sense that, given an \emph{arbitrary} corruption of the edges emanating from an $ε$-measure of the nodes, the PageRank distribution of the corrupted chain will be $\mathsf{poly}(\varepsilon)$ close in total varia…

qa_user: User interactions on Q&A websites (2016)
Networks of interactions among users from four online Q&A sites: Stack Overflow, Math Overflow, Super User, and Ask Ubuntu. A directed edge (i,j) indicates a user i responded to user j's post. Edges are timestamped. For each Q&A site, four differently defined networks are provided, based on the definition of an edge: (i) a user answered a question, (ii) a user commented on a question, (iii) a user commented on an answer…

The space of multifurcating ranked tree shapes: enumeration, lattice structure, and Markov chains
Julie Zhang, Noah A. Rosenberg, Julia A. Palacios
https://arxiv.org/abs/2506.10856

The space of multifurcating ranked tree shapes: enumeration, lattice structure, and Markov chains
Coalescent models of bifurcating genealogies are used to infer evolutionary parameters from molecular data. However, there are many situations where bifurcating genealogies do not accurately reflect the true underlying ancestral history of samples, and a multifurcating genealogy is required. The space of multifurcating genealogical trees, where nodes can have more than two descendants, is largely underexplored in the setting of coalescent inference. In this paper, we examine the space of rooted…