Topological Data Analysis and Graph-Theoretic Approaches for Tennis Match Prediction

• URL: http://arxiv.org/abs/2607.23509v1
• Date: Sun, 26 Jul 2026 07:18:43 GMT
• Title: Topological Data Analysis and Graph-Theoretic Approaches for Tennis Match Prediction
• Abstract summary: We present two approaches for predicting tennis match outcomes using topological data analysis and graph theory.<n>The first method applies lower-star filtration to player competitive networks, extracting topological features through persistent homology.<n>The second method uses a modified Katz similarity index with temporal edge weighting, achieving 62.48% accuracy on held-out test data.
• Score: 67.45502291821956
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present two approaches for predicting tennis match outcomes using topological data analysis and graph theory on ATP singles matches from 2000-2025. The first method applies lower-star filtration to player competitive networks, extracting topological features through persistent homology using four summary methods (VAB, HNAV, HWNAV, OW-HNPV) combined with Modified Band Depth analysis. Algorithmic optimizations including ego graph approximations and triangle elimination enable analysis of about 66k matches. Our Random Forest model achieves 66.2% accuracy (AUC = 0.719) using topological, graph-theoretic, and ranking features. Feature importance analysis reveals that rankings contribute 36.3%, centralities 25.5%, and TDA features 24.0%, with topological features providing complementary signal. When rankings are unavailable, the topology-only model maintains 63.56% accuracy, demonstrating that network-derived features alone capture meaningful competitive structure. The second method uses a modified Katz similarity index with temporal edge weighting, achieving 62.48% accuracy on held-out test data. This work represents the first application of lower-star filtration to tennis prediction, provides systematic comparison of four topological summary methods in sports analytics, and demonstrates that TDA can achieve above-chance prediction using network topology alone while providing additional value when combined with traditional features.

Related papers

• Scaling Closed-Loop Feature Channel Configuration with LLMs [48.83701310501069]
  The analysis covers 2000 generated candidates from 8 complete cycles, yielding 462 verified CIFAR-100 evaluations after task and metadata filtering.<n>The best model reaches 0.3676 with 11.8M parameters, compared with an early high-performing model at 0.3144 with 166.5M parameters.<n>Non-power-of-two channel widths occur in 41.8% of verified candidates, and the strongest models share structured channelallocation patterns.
  arXiv  Detail & Related papers  (2026-07-07T22:31:53Z)
• Hierarchical Attention-based Graph Neural Network with Relevance-driven Pruning [0.0]
  Graph Neural Networks (GNNs) excel at relational reasoning but face two persistent challenges: the lack of interpretable attribution for heterogeneous node types, and the computational overhead of message passing over large, noisy graphs.<n>We propose the Hierarchical Attention-based Heterogeneous GNN (HA-HeteroGNN), a framework that addresses both issues through a unied explainability-to-pruning pipeline.<n>A two-tier attention mechanism separates sensor-level and context-level gradient across 16 node types and 18 edge types, producing per-node relevance scores via an attention-based GNN Explainer without requiring
  arXiv  Detail & Related papers  (2026-05-10T04:05:36Z)
• A Comprehensive Forecasting-Based Framework for Time Series Anomaly Detection: Benchmarking on the Numenta Anomaly Benchmark (NAB) [0.0]
  Time series anomaly detection is critical for modern digital infrastructures.<n>We present a forecasting-based framework unifying classical methods with deep learning architectures.<n>We conduct the first complete evaluation on the Numenta Anomaly Benchmark.
  arXiv  Detail & Related papers  (2025-10-13T08:31:42Z)
• Improving Remote Sensing Classification using Topological Data Analysis and Convolutional Neural Networks [0.0]
  We propose a TDA feature engineering pipeline and a simple method to integrate topological features with deep learning models on remote sensing classification.<n>Our method improves the performance of a ResNet18 model on the EuroSAT dataset by 1.44% achieving 99.33% accuracy.<n>This is the first application of TDA features in satellite scene classification with deep learning.
  arXiv  Detail & Related papers  (2025-07-14T15:22:29Z)
• Context Pooling: Query-specific Graph Pooling for Generic Inductive Link Prediction in Knowledge Graphs [55.918039693545616]
  We introduce a novel method, named Context Pooling, to enhance GNN-based models' efficacy for link predictions in Knowledge Graphs.<n>Our method is generic and assessed by being applied to two state-of-the-art (SOTA) models on three public transductive and inductive datasets.
  arXiv  Detail & Related papers  (2025-07-10T09:54:37Z)
• On Discprecncies between Perturbation Evaluations of Graph Neural Network Attributions [49.8110352174327]
  We assess attribution methods from a perspective not previously explored in the graph domain: retraining. The core idea is to retrain the network on important (or not important) relationships as identified by the attributions. We run our analysis on four state-of-the-art GNN attribution methods and five synthetic and real-world graph classification datasets.
  arXiv  Detail & Related papers  (2024-01-01T02:03:35Z)
• Revisiting Link Prediction: A Data Perspective [59.296773787387224]
  Link prediction, a fundamental task on graphs, has proven indispensable in various applications, e.g., friend recommendation, protein analysis, and drug interaction prediction. Evidence in existing literature underscores the absence of a universally best algorithm suitable for all datasets. We recognize three fundamental factors critical to link prediction: local structural proximity, global structural proximity, and feature proximity.
  arXiv  Detail & Related papers  (2023-10-01T21:09:59Z)
• Optimal Propagation for Graph Neural Networks [51.08426265813481]
  We propose a bi-level optimization approach for learning the optimal graph structure. We also explore a low-rank approximation model for further reducing the time complexity.
  arXiv  Detail & Related papers  (2022-05-06T03:37:00Z)
• Baseline Pruning-Based Approach to Trojan Detection in Neural Networks [3.6187615899782415]
  This paper addresses the problem of detecting trojans in neural networks (NNs) by analyzing systematically pruned NN models. Our pruning-based approach consists of three main steps. First, detect any deviations from the reference look-up tables of model file sizes and model graphs. Next, measure the accuracy of a set of systematically pruned NN models following multiple pruning schemas. Finally, classify a NN model as clean or poisoned by applying a mapping between accuracy measurements and NN model labels.
  arXiv  Detail & Related papers  (2021-01-22T23:10:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.