output
20032025
most citedComputing Bayes factors to measure evidence from experiments: An extension of the BIC approximation

36 citations

16 papers

cs.CY2025★ 5 cited

Toxicity in Online Platforms and AI Systems: A Survey of Needs, Challenges, Mitigations, and Future Directions

Smita Khapre, Melkamu Abay Mersha, Hassan Shakil +2

The evolution of digital communication systems and the designs of online platforms have inadvertently facilitated the subconscious propagation of toxic behavior. Giving rise to rea…

astro-ph.EP2025

Analytical transit light curves for arbitrary power-law limb darkening: a unified framework

Farrukh A. Chishtie, Mohammad I. Saeed, Shaukat N. Goderya

We present a unified analytical framework for computing exoplanet transit light curves under arbitrary real power-law limb darkening , , eliminating the two-deca…

math.CO2023

The zero forcing numbers and propagation times of gear graphs and helm graphs

Sara Anderton, Rilee Burden, McKenzie Fontenot +8

Zero forcing is a dynamic coloring process on graphs. Initially, each vertex of a graph is assigned a color of either blue or white, and then a process begins by which blue vertice…

cs.NI2022★ 5 cited

F-802.11P: A Fuzzy Enhancement for ieee 802.11P in Vehicle-TO-Everything Communications

Hamdy A. M. Sayedahmed, Emadeldin M. Elgamal, Hesham A. Hefny

Vehicle-to-Everything communications (V2X) are becoming increasingly popular as a solution for safer roads and better traffic management. One of the essential protocols in V2X is t…

stat.CO2020★ 7 cited

The Pearson Bayes factor: An analytic formula for computing evidential value from minimal summary statistics

Thomas J. Faulkenberry

In Bayesian hypothesis testing, evidence for a statistical model is quantified by the Bayes factor, which represents the relative likelihood of observed data under that model compa…

math.OC2019

N-body Approach to the Traveling Salesman Problem (TSP)

Johnny Seay, Edwin Gonzalez, Stephen Lowe +2

In the Traveling Salesman Problem (TSP), a list of cities and the distances between them are given. The goal is to find the shortest possible route that visits each city exactly on…