Search arXivSearch

arXiv subjects

Benjamin Jones

Publications and source records attributed to Benjamin Jones.

At least 19 recordsLinked to original sources

PSLL: Persistent Sheaf Laplacian Learning for Protein-Ligand Binding Affinity Prediction

Accurate prediction of protein-ligand binding affinity remains a central challenge in computational drug discovery due to the complex interplay among molecular geometry, physicochemical interactions, and atom-specific charge information. In this work, we introduce a Persistent Sheaf Laplacian learning (PSLL) framework for protein-ligand binding affinity prediction. The proposed approach constructs multiscale topological representations from three-dimensional protein-ligand complexes by incorporating atomic partial charges into sheaf restriction maps over Vietoris-Rips and alpha complex filtrations. To capture chemically diverse protein-ligand interactions, we introduce element-specific and category-specific atom-pair representations within the PSLL framework. Harmonic and non-harmonic spectra extracted from the resulting persistent sheaf Laplacians are used as molecular descriptors. To complement the PSLL-derived molecular representation, we incorporate transformer-based protein embeddings and SMILES-derived ligand descriptors for binding affinity prediction. The scoring power of the proposed multiscale PSLL model is validated against existing state-of-the-art methods on three widely used PDBbind benchmark datasets, including PDBbind-v2007, PDBbind-v2013, and PDBbind-v2016. The computational results indicate that the proposed PSLL model achieves strong predictive performance across benchmark datasets, highlighting its potential as an interpretable and mathematically grounded framework with promising generalizability for molecular machine learning and drug discovery.

q-bio.BM

Inertial focusing of neutrally buoyant spherical particle in shallow microchannels

This study investigates the lift force acting on a finite-size, neutrally buoyant spherical particle suspended in a liquid while flowing through a shallow channel at low Reynolds numbers. Using an immersed boundary method, we calculate the lift force for particle radius-to-channel height ratios spanning \(0.03 \leq a/H \leq 0.35\) in 2D planar Poiseuille flows. We propose an explicit formula that accurately predicts the lift force for particles as large as \(a/H = 0.35\) and remains valid for particle Reynolds number \(Re_p \leq 1\), despite a reduction in near-wall lift force at higher \(Re_p\). The influence of slip boundary conditions is also explored, demonstrating that increased slip length reduces near-wall lift force and shifts the particle equilibrium position closer to the wall. Predictions of the particle trajectory from the derived model are in good agreement to the published experimental data. These findings offer a practical framework for estimating the migration of large particles in microfluidic devices.(This article has been accepted for publication in Physics of Fluids. After publication, it will be available via the AIP Publishing website.)

physics.flu-dyn

$C^*$-correspondences for ordinal graphs

We introduce a family of $C^*$-correspondences $X_\alpha$ naturally associated to every ordinal graph $\Lambda$. When $\Lambda$ is a directed graph, $X_0$ is isomorphic to the usual $C^*$-correspondence associated to a graph. We show that ordinal graphs satisfying a weak assumption have the property that the $C^*$-algebra of $\Lambda_{\alpha + 1}$ is isomorphic to the Cuntz-Pimsner algebra of $X_\alpha$. As a consequence, the $C^*$-algebra of $\Lambda$ may be constructed starting from $c_0(\Lambda_0)$ by iteratively applying the Cuntz-Pimsner construction and inductive limits. We apply this result to strengthen the author's previous Cuntz-Krieger uniqueness theorem.

math.OA

Comparing Two Notions of Coaction Invariance of Ideals in $\mathrm{C}^*$-Algebras

Given a coaction $\delta$ of a locally compact group $G$ on a $\mathrm{C}^*$-algebra $A$, we study the relationship between two different forms of coaction invariance of ideals of $A$ and the ideals of the corresponding crossed product $\mathrm{C}^*$-algebra $A \rtimes_{\delta} G$. In particular, we characterize when these two notions of invariance are equivalent.

math.OA

Asymmetrically Weighted Dowker Persistence and Applications in Dynamical Systems

By their nature it is difficult to differentiate chaotic dynamical systems through measurement. In recent years, work has begun on using methods of Topological Data Analysis (TDA) to qualitatively type dynamical data by approximating the topology of the underlying attracting set. This comes with the additional challenges of high dimensionality incurring computational complexity along with the lack of directional information encoded in the approximated topology. Due to the latter fact, standard methods of TDA for this high dimensional dynamical data do not differentiate between periodic cycles and non-periodic cycles in the attractor. We present a framework to address both of these challenges. We begin by binning the dynamical data, and capturing the sequential information in the form of a coarse-grained weighted and directed network. We then calculate the persistent Dowker homology of the asymmetric network, encoding spatial and temporal information. Analytically, we highlight the differences in periodic and non-periodic cycles by providing a full characterization of their one-dimensional Dowker persistences. We prove how the homologies of graph wedge sums can be described in terms of the wedge component homologies. Finally, we generalize our characterization to cactus graphs with arbitrary edge weights and orientations. Our analytical results give insight into how our method captures temporal information in its asymmetry, producing a persistence framework robust to noise and sensitive to dynamical structure.

math.AT

A High-Scale Assessment of Social Media and Mainstream Media in Scientific Communication

Communication of scientific knowledge beyond the walls of science is key to science's societal impact. Media channels play sizable roles in disseminating new scientific ideas about human health, economic welfare, and government policy as well as responses to emergent challenges such as climate change. Indeed, effectively communicating science to the public helps inform society's decisions on scientific and technological policies, the value of science, and investment in research. At the same time, the rise of social media has greatly changed communication systems, which may substantially affect the public's interface with science. Examining 20.9 million scientific publications, we compare research coverage in social media and mainstream media in a broad corpus of scientific work. We find substantial shifts in the scale, impact, and heterogeneity of scientific coverage. First, social media significantly alters what science is, and is not, covered. Whereas mainstream media accentuates eminence in the coverage of science and focuses on specific fields, social media more evenly sample research according to field, institutional rank, journal, and demography, increasing the scale of scientific ideas covered relative to mainstream outlets more than eightfold. Second, despite concerns about the quality of science represented in social media, we find that social media typically covers scientific works that are impactful and novel within science. Third, scientists on social media, as experts in their domains, tend to surface high-impact research in their own fields while sampling widely across research institutions. Contrary to prevalent observations about social media, these findings reveal that social media expands and diversifies science reporting by highlighting high-impact research and bringing a broader array of scholars, institutions and scientific concepts into public view.

physics.soc-ph

Meta-analysis and Topological Perturbation in Interactomic Network for Anti-opioid Addiction Drug Repurposing

The ongoing opioid crisis highlights the urgent need for novel therapeutic strategies that can be rapidly deployed. This study presents a novel approach to identify potential repurposable drugs for the treatment of opioid addiction, aiming to bridge the gap between transcriptomic data analysis and drug discovery. Speciffcally, we perform a meta-analysis of seven transcriptomic datasets related to opioid addiction by differential gene expression (DGE) analysis, and propose a novel multiscale topological differentiation to identify key genes from a protein-protein interaction (PPI) network derived from DEGs. This method uses persistent Laplacians to accurately single out important nodes within the PPI network through a multiscale manner to ensure high reliability. Subsequent functional validation by pathway enrichment and rigorous data curation yield 1,865 high-conffdence targets implicated in opioid addiction, which are cross-referenced with DrugBank to compile a repurposing candidate list. To evaluate drug-target interactions, we construct predictive models utilizing two natural language processing-derived molecular embeddings and a conventional molecular ffngerprint. Based on these models, we prioritize compounds with favorable binding afffnity proffles, and select candidates that are further assessed through molecular docking simulations to elucidate their receptor-level interactions. Additionally, pharmacokinetic and toxicological evaluations are performed via ADMET (absorption, distribution, metabolism, excretion, and toxicity) proffling, providing a multidimensional assessment of druggability and safety. This study offers a generalizable approach for drug repurposing in other complex diseases beyond opioid addiction. Keywords: Opioid addiction; Interactomic network; Topological perturbation; Differentially expressed gene; Drug repurposin

q-bio.MN

MetaGen: A DSL, Database, and Benchmark for VLM-Assisted Metamaterial Generation

Metamaterials are micro-architected structures whose geometry imparts highly tunable-often counter-intuitive-bulk properties. Yet their design is difficult because of geometric complexity and a non-trivial mapping from architecture to behaviour. We address these challenges with three complementary contributions. (i) MetaDSL: a compact, semantically rich domain-specific language that captures diverse metamaterial designs in a form that is both human-readable and machine-parsable. (ii) MetaDB: a curated repository of more than 150,000 parameterized MetaDSL programs together with their derivatives-three-dimensional geometry, multi-view renderings, and simulated elastic properties. (iii) MetaBench: benchmark suites that test three core capabilities of vision-language metamaterial assistants-structure reconstruction, property-driven inverse design, and performance prediction. We establish baselines by fine-tuning state-of-the-art vision-language models and deploy an omni-model within an interactive, CAD-like interface. Case studies show that our framework provides a strong first step toward integrated design and understanding of structure-representation-property relationships.

cs.CV

PETLS: PErsistent Topological Laplacian Software

Persistent topological Laplacians are operators that provide persistent Betti numbers and additional multiscale geometric information through the eigenvalues of the persistent topological Laplacian matrix. We introduce a framework and novel algorithm to aid in the computation of persistent topological Laplacians. We implement existing and new persistent Laplacian algorithms in an efficient and flexible C++ library with Python bindings, titled PETLS: PErsistent Topological Laplacian Software. As part of this library, we interface with several complexes commonly used in topological data analysis (TDA), such as simplicial, alpha, directed flag, Dowker, and cellular Sheaf. Because increased efficiency broadens the set of computationally feasible applications, we provide recommendations on how to use algorithms and complexes for data analysis in machine learning.

math.AT

View2CAD: Reconstructing View-Centric CAD Models from Single RGB-D Scans

Parametric CAD models, represented as Boundary Representations (B-reps), are foundational to modern design and manufacturing workflows, offering the precision and topological breakdown required for downstream tasks such as analysis, editing, and fabrication. However, B-Reps are often inaccessible due to conversion to more standardized, less expressive geometry formats. Existing methods to recover B-Reps from measured data require complete, noise-free 3D data, which are laborious to obtain. We alleviate this difficulty by enabling the precise reconstruction of CAD shapes from a single RGB-D image. We propose a method that addresses the challenge of reconstructing only the observed geometry from a single view. To allow for these partial observations, and to avoid hallucinating incorrect geometry, we introduce a novel view-centric B-rep (VB-Rep) representation, which incorporates structures to handle visibility limits and encode geometric uncertainty. We combine panoptic image segmentation with iterative geometric optimization to refine and improve the reconstruction process. Our results demonstrate high-quality reconstruction on synthetic and real RGB-D data, showing that our method can bridge the reality gap.

cs.GR

Principal Actions on Topological Quivers and Associated Operator Dynamics

We study topological quivers $Q$ admitting a free and proper action by a locally compact group $G$ together with their associated $C^*$-algebras. On the topological side, we provide a complete classification of topological quivers which admit such actions in terms of $G$-bundles over the vertex orbit space and an appropriate isomorphism of bundles over the edge orbits. Following the work by Deaconu, Kumjian, and Quigg on topological graphs, we construct an isomorphism between $C^*(Q/G)$ and Rieffel's fixed-point algebra $C^*(Q)^\alpha$, which is known to be Morita equivalent to $C^*(Q)\rtimes_rG$. Unlike the work with topological graphs, we use previously developed functoriality techniques to identify the isomorphism. We also examine many concrete examples of such group actions, including some exclusive to topological quivers, and the associated Morita equivalences.

math.OA

A Khovanov Laplacian and Khovanov Dirac for Knots and Links

Khovanov homology has been the subject of much study in knot theory and low dimensional topology since 2000. This work introduces a Khovanov Laplacian and a Khovanov Dirac to study knot and link diagrams. The harmonic spectrum of the Khovanov Laplacian or the Khovanov Dirac retains the topological invariants of Khovanov homology, while their non-harmonic spectra reveal additional information that is distinct from Khovanov homology.

math.GT

Persistent Directed Flag Laplacian (PDFL)-Based Machine Learning for Protein-Ligand Binding Affinity Prediction

Directionality in molecular and biomolecular networks plays a significant role in the accurate represention of the complex, dynamic, and asymmetrical nature of interactions present in protein-ligand binding, signal transduction, and biological pathways. Most traditional techniques of topological data analysis (TDA), such as persistent homology (PH) and persistent Laplacian (PL), overlook this aspect in their standard form. To address this, we present the persistent directed flag Laplacian (PDFL), which incorporates directed flag complexes to account for edges with directionality originated from polarization, gene regulation, heterogeneous interactions, etc. This study marks the first application of the PDFL, providing an in-depth analysis of spectral graph theory combined with machine learning. Besides its superior accuracy and reliability, the PDFL model offers simplicity by requiring only raw inputs without complex data processing. We validated our multi-kernel PDFL model for its scoring power against other state-of-art methods on three popular benchmarks, namely PDBbind v2007, v2013, and v2016. Computational results indicate that the proposed PDFL model outperforms competitors in protein-ligand binding affinity predictions, indicating that PDFL is a promising tool for protein engineering, drug discovery, and general applications in science and engineering.

q-bio.BM

Ordinal graphs and their $\mathrm{C}^*$-algebras

We introduce a class of left cancellative categories we call ordinal graphs for which there is a functor $d:\Lambda\rightarrow\mathrm{Ord}$ by which morphisms of $\Lambda$ factor. We use generators and relations to study the Cuntz-Krieger algebra $\mathcal{O}\left(\Lambda\right)$ defined by Spielberg. In particular, we construct a $\mathrm{C}^{*}$-correspondence $X_{\alpha}$ for each $\alpha\in\mathrm{Ord}$ in order to apply Ery\"uzl\"u and Tomforde's condition (S) and prove a Cuntz-Krieger uniqueness theorem for ordinal graphs.

math.OA

Drug Resistance Predictions Based on a Directed Flag Transformer

The continuous evolution of the SARS-CoV-2 virus poses a significant challenge to global public health. Of particular concern is the potential resistance to the widely prescribed drug PAXLOVID, of which the main ingredient nirmatrelvir inhibits the viral main protease (Mpro). Here, we developed CAPTURE (direCted flAg laPlacian Transformer for drUg Resistance prEdictions) to analyze the effects of Mpro mutations on nirmatrelvir-Mpro binding affinities and identify potential drug-resistant mutations. CAPTURE combines a comprehensive mutation analysis with a resistance prediction module based on DFFormer-seq, which is a novel ensemble model that leverages a new Directed Flag Transformer and sequence embeddings from the protein and small-molecule-large-language models. Our analysis of the evolution of Mpro mutations revealed a progressive increase in mutation frequencies for residues near the binding site between May and December 2022, suggesting that the widespread use of PAXLOVID created a selective pressure that accelerated the evolution of drug-resistant variants. Applied to mutations at the nirmatrelvir-Mpro binding site, CAPTURE identified several potential resistance mutations, including H172Y and F140L, which have been experimentally confirmed, as well as five other mutations that await experimental verification. CAPTURE evaluation in a limited experimental data set on Mpro mutants gives a recall of 57\% and a precision of 71\% for predicting potential drug-resistant mutations. Our work establishes a powerful new framework for predicting drug-resistant mutations and real-time viral surveillance. The insights also guide the rational design of more resilient next-generation therapeutics.

q-bio.QM

FabHacks: Transform Everyday Objects into Functional Fixtures

Storage, organizing, and decorating are an important part of home design. While one can buy commercial items for many of these tasks, this can be costly, and re-use is more sustainable. An alternative is a "home hack", a functional assembly that can be constructed from existing household items. However, coming up with such hacks requires combining objects to make a physically valid design, which might be difficult to test if they are large, require nailing or screwing something to the wall, or the designer has mobility limitations. In this work, we present a design and visualization system for creating workable functional assemblies, FabHacks, which is based on a solver-aided domain-specific language (S-DSL) FabHaL. By analyzing existing home hacks shared online, we create a design abstraction for connecting household items using predefined types of connections. We provide a UI for FabHaL that can be used to design assemblies that fulfill a given specification. Our system leverages a physics-based solver that takes an assembly design and finds its expected physical configuration. Our validation includes a user study showing that users can create assemblies successfully using our UI and explore a range of designs.

cs.GR

Persistent Directed Flag Laplacian

Topological data analysis (TDA) has had enormous success in science and engineering in the past decade. Persistent topological Laplacians (PTLs) overcome some limitations of persistent homology, a key technique in TDA, and provide substantial insight to the behavior of various geometric and topological objects. This work extends PTLs to directed flag complexes, which are an exciting generalization to flag complexes, also known as clique complexes, that arise naturally in many situations. We introduce the directed flag Laplacian and show that the proposed persistent directed flag Laplacian (PDFL) is a distinct way of analyzing these flag complexes. Example calculations are provided to demonstrate the potential of the proposed PDFL in real world applications.

math.AT

DISCO: An optical instrument to calibrate neutrino detection in complex media

We present a conceptual design of a high-performance camera system with applications to neutrino detectors, deep sea exploration, and glaciology. The design combines ultra-sensitive cameras with a number of well-calibrated light sources enclosed in a pressure vessel. The instrument will be capable of withstanding extreme environments such as those encountered in Antarctica or the deep ocean, and be deployable as a standalone system that can be retrieved for deep-sea exploration or glaciology. The camera system is designed to be replicated and deployed in multiple detectors, requiring only modest modifications from one detector to another. The instrument combines a number of capabilities essential for neutrino detector calibrations, including characterization of the scattering and absorption properties of the optical medium, measurement of geometries via photogrammetry, and detector surveillance. The ability to deploy the instrument at different detector sites also offers opportunities for cross-calibration efforts. We present the conceptual design of the instrument and describe plans to produce a prototype.

astro-ph.IM