Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.29766

Bayesian Comparison of Covid Origins Hypotheses

Michael B. Weissman
View original source ↗Read source document ↗Export metadata ↓

Abstract

Applying standard Bayesian methods to the most reliably known unclassified facts about the Covid epidemic allows crude estimation of the odds for research-related vs. purely zoonotic origins. Here a broadly inclusive zoonotic hypothesis is compared with a rather specific subset of the research-related hypothesis defined by known prior work and grant proposals. The important observations are the type of virus, the city of the first outbreak, the lack of known prior hosts, the anomalous early pattern of evolution, and two specific features of the viral sequence. The resulting odds strongly favor research. The odds remain fairly strong under inclusion of uncertainties in prior odds.

Explore related subjects

q-bio.PEstat.AP

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michael B. Weissman. 2026-10-21. Bayesian Comparison of Covid Origins Hypotheses. https://arxiv.org/abs/2610.29766

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Structural properties of distance-bounded phylogenetic reconciliation

Phylogenetic reconciliation seeks to explain host-symbiont co-evolution by mapping parasite trees onto host trees through events such as cospeciation, duplication, host switching, and loss. Finding an optimal reconciliation that ensures time-consistency is computationally hard when timing information is incomplete, and the complexity remains open when host switches are restricted by a fixed maximum distance $d$. While the case $d = 2$ is known to be polynomial, larger values are unresolved. In this paper, we study the cases $d = 3$ and $d = 4$. We show that although arbitrarily large cycles may occur, it suffices to check only bounded-size cycles (we provide a complete list), provided the reconciliation satisfies acyclicity (i.e., time-consistency) in a stronger sense, which we call strong acyclicity. Strong acyclicity is associated with incorporating discrete time slices into the model.

q-bio.PE↗
arXiv2026

Report the tolerance, not the count: exact phylogenetic distance deconvolution with incomplete references

Phylogenetic distance deconvolution represents mixture-to-reference distances by weighted sources placed on a reference tree. We study the minimum number of strictly interior sources that explains a distance profile, and what incomplete references cost. On a positive-rational reduced tree we give an exact algorithm with 2^O(K) poly(B) bit complexity for a free positive mean pendant and any nonempty set of observed leaves. With arbitrary missing references and a prescribed pendant the problem is W[1]-hard in the source budget K, even on positive binary trees supplied with a strict explanation using at most K+1 sources. We then use the algorithm as an instrument. Removing references can only lower the minimum source count, never raise it. The direction is a theorem at every error tolerance and held without exception in 23,545 draws, so which references are missing matters more than how many. Two adversarially chosen references suffice, at the median, to destroy uniqueness of the minimum explanation, and that number does not grow with panel size (Spearman 0.203, p = 0.15, over 20 to 353 references) where random loss scales linearly. Discarding 7,931 of 10,575 references from a real 16S panel at random costs 1.8% of the tolerance at which one source suffices. Discarding comparably many as whole clades costs 90%. That tolerance needs neither ground truth nor an error model, which makes the model measurable on real data. Published distance estimates exceed it in 296 of 296 cases. The mixture inferred by the published heuristic reproduces real observations better than the configuration that generated them in 282 of 296. The phenomenon is not unobservable in practice. It is unobservable through a point estimate of the count. Methods for this problem should report the tolerance at which an explanation of a given size exists.

q-bio.PE↗
arXiv2026

From Turing Patterns to Spike Self-Replication and Nucleation in a Growing-Domain Tulip Breaking Virus Model

A recently proposed reaction-diffusion model for the tulip breaking virus (TBV) has been shown to generate striped pigmentation patterns on growing tulip petals. In this paper, we investigate the formation of localized spike patterns in this model in the asymptotic limit of small viral diffusivity. It is known that two distinct bifurcation mechanisms can occur which generate new spikes as the domain half-length $L$ slowly increases: spike self-replication and spike nucleation. Self-replication occurs through a saddle-node bifurcation of the inner spike core problem, whereas nucleation is associated with a fold of the nonlinear outer problem. Using matched asymptotic expansions, we derive critical conditions for these mechanisms and construct phase diagrams that predict which mechanism occurs first as $L$ increases, or whether nucleation is absent. We further combine these results with a Turing instability analysis of the homogeneous steady state to obtain a phase diagram of pattern-forming mechanisms. An interesting finding is that, for the TBV model, the Turing-unstable region lies entirely within the parameter regime where spike nucleation is possible. These results provide further insight into the mechanisms underlying the formation and evolution of pigmentation patterns in virus-infected tulips.

q-bio.PE↗