Tim Conrad
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Tim Conrad has a total of 166 co-authors. Here are the top co-authors by number of shared publications:
- Patrick Erich Obermeier
Abteilung für Infektionskrankheiten Vaccine Safety Initiative, Berlin
10 shared publications - Barbara Rath
Vaccine Safety Initiative, 10437 Berlin, Germany
9 shared publications - Alexander Benedikt Leichtle
Multidisciplinary Center for Infectious Diseases, University of Bern, Bern, Switzerland; Institute for Laboratory Medicine and Microbiology, University Hospital Augsburg, Augsburg, Germany; Cantonal Hospital Baden, Baden, Switzerland
6 shared publications - Christof Schütte
Zuse Institute Berlin, 14195 Berlin, Germany
6 shared publications Christian Hoppe
Department of Pediatrics, Charité University Medical Center Berlin, Berlin, Germany
5 shared publicationsFranziska Tief
Department of Pediatrics, Charité University Medical Center Berlin, Berlin, Germany
5 shared publications
Latest Publications
- Open Access
- 11 November 2026
- Published by Elsevier in Journal of Web Semantics
- Vol. 92
Can LLMs enable natural language querying of knowledge graphs? A multi-model evaluation of explanation and generation with interactive refinement
- 11 November 2026
- Published by Elsevier in Journal of Web Semantics
- Vol. 92
Open AccessCan LLMs enable natural language querying of knowledge graphs? A multi-model evaluation of explanation and generation with interactive refinement
- Open Access
- 16 October 2026
- Published by IOP Publishing in Journal of Physics: Complexity
- Vol. 7 (4) , 045008
Spectral clustering of time-evolving networks using spatio-temporal random walks
Temporal (or time-evolving) networks provide a natural framework for modeling complex systems with time-dependent interactions, where understanding the evolution of community structures is a central challenge. While random walk-based approaches to community detection in static networks are well established through the spectral analysis of associated transfer operators, extending these ideas to temporal networks is nontrivial due to the inherent time-dependence of the underlying dynamics. In this work, we develop a general framework for community detection in temporal networks that is based on multi-view canonical correlation analysis . We show that the proposed formulation admits a spectral characterization via a time-reversible random walk on an augmented space–time network, providing a clear dynamical interpretation of temporal communities as metastable structures of the process. Furthermore, we analyze key spectral properties of the resulting transfer operators and the interplay between spatial and temporal effects, which allows us to distinguish between structural features and artifacts induced by the snapshot coupling. Finally, we derive a reduced-order model, which preserves the essential spectral properties while significantly improving computational efficiency. We show that the proposed approach effectively detects communities in temporal networks and captures their evolution.
- 16 October 2026
- Published by IOP Publishing in Journal of Physics: Complexity
- Vol. 7 (4) , 045008
Open AccessSpectral clustering of time-evolving networks using spatio-temporal random walks
Temporal (or time-evolving) networks provide a natural framework for modeling complex systems with time-dependent interactions, where understanding the evolution of community structures is a central challenge. While random walk-based approaches to community detection in static networks are well established through the spectral analysis of associated transfer operators, extending these ideas to temporal networks is nontrivial due to the inherent time-dependence of the underlying dynamics. In this work, we develop a general framework for community detection in temporal networks that is based on multi-view canonical correlation analysis . We show that the proposed formulation admits a spectral characterization via a time-reversible random walk on an augmented space–time network, providing a clear dynamical interpretation of temporal communities as metastable structures of the process. Furthermore, we analyze key spectral properties of the resulting transfer operators and the interplay between spatial and temporal effects, which allows us to distinguish between structural features and artifacts induced by the snapshot coupling. Finally, we derive a reduced-order model, which preserves the essential spectral properties while significantly improving computational efficiency. We show that the proposed approach effectively detects communities in temporal networks and captures their evolution.
- Open Access
- 3 October 2026
- Published by Elsevier in Biomedical Signal Processing and Control
- Vol. 130
A reproducible benchmark for ECG-to-text report generation: Leakage-safe evaluation, performance floors, and stress testing
- 3 October 2026
- Published by Elsevier in Biomedical Signal Processing and Control
- Vol. 130
Open AccessA reproducible benchmark for ECG-to-text report generation: Leakage-safe evaluation, performance floors, and stress testing
- Open Access
- 2 July 2026
- Published by Elsevier in Applied Mathematical Modelling
- Vol. 162
A hybrid ABM-PDE framework for real-world infectious disease simulations
- 2 July 2026
- Published by Elsevier in Applied Mathematical Modelling
- Vol. 162
Open AccessA hybrid ABM-PDE framework for real-world infectious disease simulations
- Open Access
A Human-in-the-Loop, LLM-Centered Architecture for Knowledge-Graph Question Answering
Large Language Models (LLMs) excel at language understanding but remain limited in knowledge-intensive domains due to hallucinations, outdated information, and limited explainability. Text-based retrieval-augmented generation (RAG) helps ground model outputs in external sources but struggles with multi-hop reasoning. Knowledge Graphs (KGs), in contrast, support precise, explainable querying, yet require a knowledge of query languages. This work introduces an interactive framework in which LLMs generate and explain Cypher graph queries and users iteratively refine them through natural language. Applied to real-world KGs, the framework improves accessibility to complex datasets while preserving factual accuracy and semantic rigor and provides insight into how model performance varies across domains. Our core quantitative evaluation is a 90-query benchmark on a synthetic movie KG that measures query explanation quality and fault detection across multiple LLMs, complemented by two smaller real-life query-generation experiments on a Hyena KG and the MaRDI (Mathematical Research Data Initiative) KG.
Open AccessA Human-in-the-Loop, LLM-Centered Architecture for Knowledge-Graph Question Answering
Large Language Models (LLMs) excel at language understanding but remain limited in knowledge-intensive domains due to hallucinations, outdated information, and limited explainability. Text-based retrieval-augmented generation (RAG) helps ground model outputs in external sources but struggles with multi-hop reasoning. Knowledge Graphs (KGs), in contrast, support precise, explainable querying, yet require a knowledge of query languages. This work introduces an interactive framework in which LLMs generate and explain Cypher graph queries and users iteratively refine them through natural language. Applied to real-world KGs, the framework improves accessibility to complex datasets while preserving factual accuracy and semantic rigor and provides insight into how model performance varies across domains. Our core quantitative evaluation is a 90-query benchmark on a synthetic movie KG that measures query explanation quality and fault detection across multiple LLMs, complemented by two smaller real-life query-generation experiments on a Hyena KG and the MaRDI (Mathematical Research Data Initiative) KG.
- 1 January 2026
- Published by Journal of Artificial Societies and Social Simulation in Journal of Artificial Societies and Social Simulation
- Vol. 29 (4)
Vahana.Jl: A Framework (Not Only) for Large-Scale Agent-Based Models
- 1 January 2026
- Published by Journal of Artificial Societies and Social Simulation in Journal of Artificial Societies and Social Simulation
- Vol. 29 (4)
Vahana.Jl: A Framework (Not Only) for Large-Scale Agent-Based Models
- Open Access
- 9 December 2025
- Published by MDPI AG in BioMedInformatics
- Vol. 5 (4) , 70
Combining LLMs and Knowledge Graphs to Reduce Hallucinations in Biomedical Question Answering
Advancements in natural language processing (NLP), particularly Large Language Models (LLMs), have greatly improved how we access knowledge. However, in critical domains like biomedicine, challenges like hallucinations—where language models generate information not grounded in data—can lead to dangerous misinformation. This paper presents a hybrid approach that combines LLMs with Knowledge Graphs (KGs) to improve the accuracy and reliability of question-answering systems in the biomedical field. Our method, implemented using the LangChain framework, includes a query-checking algorithm that checks and, where possible, corrects LLM-generated Cypher queries, which are then executed on the Knowledge Graph, grounding answers in the KG and reducing hallucinations in the evaluated cases. We evaluated several LLMs, including several GPT models and Llama 3.3:70b, on a custom benchmark dataset of 50 biomedical questions. GPT-4 Turbo achieved 90% query accuracy, outperforming most other models. We also evaluated prompt engineering, but found little statistically significant improvement compared to the standard prompt, except for Llama 3:70b, which improved with few-shot prompting. To enhance usability, we developed a web-based interface that allows users to input natural language queries, view generated and corrected Cypher queries, and inspect results for accuracy. This framework improves reliability and accessibility by accepting natural language questions and returning verifiable answers directly from the knowledge graph, enabling inspection and reproducibility. The source code for generating the results of this paper and for the user-interface can be found in our Git repository: https://git.zib.de/lpusch/cyphergenkg-gui, accessed on 1 November 2025.
- 9 December 2025
- Published by MDPI AG in BioMedInformatics
- Vol. 5 (4) , 70
Open AccessCombining LLMs and Knowledge Graphs to Reduce Hallucinations in Biomedical Question Answering
Advancements in natural language processing (NLP), particularly Large Language Models (LLMs), have greatly improved how we access knowledge. However, in critical domains like biomedicine, challenges like hallucinations—where language models generate information not grounded in data—can lead to dangerous misinformation. This paper presents a hybrid approach that combines LLMs with Knowledge Graphs (KGs) to improve the accuracy and reliability of question-answering systems in the biomedical field. Our method, implemented using the LangChain framework, includes a query-checking algorithm that checks and, where possible, corrects LLM-generated Cypher queries, which are then executed on the Knowledge Graph, grounding answers in the KG and reducing hallucinations in the evaluated cases. We evaluated several LLMs, including several GPT models and Llama 3.3:70b, on a custom benchmark dataset of 50 biomedical questions. GPT-4 Turbo achieved 90% query accuracy, outperforming most other models. We also evaluated prompt engineering, but found little statistically significant improvement compared to the standard prompt, except for Llama 3:70b, which improved with few-shot prompting. To enhance usability, we developed a web-based interface that allows users to input natural language queries, view generated and corrected Cypher queries, and inspect results for accuracy. This framework improves reliability and accessibility by accepting natural language questions and returning verifiable answers directly from the knowledge graph, enabling inspection and reproducibility. The source code for generating the results of this paper and for the user-interface can be found in our Git repository: https://git.zib.de/lpusch/cyphergenkg-gui, accessed on 1 November 2025.
- 20 October 2025
- Published by Springer Nature
- p. 290-299
Tree Inference with Varifold Distances
- Open Access
- 31 July 2025
- Published by Elsevier in Computers in Biology and Medicine
- Vol. 196 (Pt B) , 110809
Self-supervised pre-training with joint-embedding predictive architecture boosts ECG classification performance
- 31 July 2025
- Published by Elsevier in Computers in Biology and Medicine
- Vol. 196 (Pt B) , 110809
Open AccessSelf-supervised pre-training with joint-embedding predictive architecture boosts ECG classification performance
- Open Access
Tree inference with varifold distances
In this paper, we consider a tree inference problem motivated by the critical problem in single-cell genomics of reconstructing dynamic cellular processes from sequencing data. In particular, given a population of cells sampled from such a process, we are interested in the problem of ordering the cells according to their progression in the process. This is known as trajectory inference. If the process is differentiation, this amounts to reconstructing the corresponding differentiation tree. One way of doing this in practice is to estimate the shortest-path distance between nodes based on cell similarities observed in sequencing data. Recent sequencing techniques make it possible to measure two types of data: gene expression levels, and RNA velocity, a vector that predicts changes in gene expression. The data then consist of a discrete vector field on a (subset of a) Euclidean space of dimension equal to the number of genes under consideration. By integrating this velocity field, we trace the evolution of gene expression levels in each single cell from some initial stage to its current stage. Eventually, we assume that we have a faithful embedding of the differentiation tree in a Euclidean space, but which we only observe through the curves representing the paths from the root to the nodes. Using varifold distances between such curves, we define a similarity measure between nodes which we prove approximates the shortest-path distance in a tree that is isomorphic to the target tree.
Open AccessTree inference with varifold distances
In this paper, we consider a tree inference problem motivated by the critical problem in single-cell genomics of reconstructing dynamic cellular processes from sequencing data. In particular, given a population of cells sampled from such a process, we are interested in the problem of ordering the cells according to their progression in the process. This is known as trajectory inference. If the process is differentiation, this amounts to reconstructing the corresponding differentiation tree. One way of doing this in practice is to estimate the shortest-path distance between nodes based on cell similarities observed in sequencing data. Recent sequencing techniques make it possible to measure two types of data: gene expression levels, and RNA velocity, a vector that predicts changes in gene expression. The data then consist of a discrete vector field on a (subset of a) Euclidean space of dimension equal to the number of genes under consideration. By integrating this velocity field, we trace the evolution of gene expression levels in each single cell from some initial stage to its current stage. Eventually, we assume that we have a faithful embedding of the differentiation tree in a Euclidean space, but which we only observe through the curves representing the paths from the root to the nodes. Using varifold distances between such curves, we define a similarity measure between nodes which we prove approximates the shortest-path distance in a tree that is isomorphic to the target tree.