Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2506.04808

Temporal passing network in basketball: the effect of time pressure on the dynamics of team organization at micro and meso levels

Quentin Bourgeais·Rodolphe Charrier·Eric Sanlaville·Ludovic Seifert
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this study, basketball teams are conceptualized as complex adaptive systems to examine their (re)organizational processes in response the time remaining to shoot. Using temporal passing networks to model team behavior, the focus is on the dynamics of the temporal patterns of interaction between players. Several metrics grounded in social network analysis are calculated at different level to assess the dynamics of the patterns used by teams and of the individual roles within those patterns. The results reveal a 3-phase dynamic, differentiated by more or less complex and diversified patterns, and by more or less specialized or flexible roles. Additionally, time-dependent features of the different tactical playing positions are identified, some of which linked to team performance. The findings are intended to explain how basketball teams adapt their organization to cope with time pressure, offering potential insights for other type of teams facing similar constraints. Moreover, this work provides a useful framework for a multilevel understanding of how constraints shape team adaptations dynamically, making it applicable to a wide range of team settings.

Explore related subjects

cs.DM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Quentin Bourgeais, Rodolphe Charrier, Eric Sanlaville, Ludovic Seifert. 2025-06-05. Temporal passing network in basketball: the effect of time pressure on the dynamics of team organization at micro and meso levels. https://arxiv.org/abs/2506.04808

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

KEEP EXPLORING

Related papers

arXiv2026

Factorisability of Low Dimensional Non-Negative Integer Matrices

We consider the problem of determining if a given two-dimensional nonnegative integer matrix $M$ is the product of two such matrices, excluding trivial units. A matrix $M$ with no such factorisation is called prime and therefore belongs to the minimal (infinite rank) generator of $2 \times 2$ matrices over the natural numbers, otherwise it is called composite. We also consider the problem of finding a (non-unique) factorisation of a composite matrix. Our results have applications in computational group theory and the theory of codes, where such matrices are called incidence matrices. We analyse the complexity of primality and finding a factorisation for a composite matrix, providing a first efficient algorithm.

cs.DM↗
arXiv2026

The parameterised complexity of generalised temporal domination on temporal graphs with modular structure

Inspired by the static problem $(α,β)$-Dominating Set, we propose a general temporal domination problem, called $(α,β)$-Temporal Dominating Set ($(α,β)$-TDS). We show that this problem encompasses Temporal Dominating Set, and additionally provides first temporal extensions of problems such as $k$-Dominating Set and $α$-Dominating Set. In this paper, we study the parameterised complexity of $(α,β)$-TDS with respect to temporal neighbourhood diversity (TND), temporal modular-width (TMW), and temporal cliquewidth (TCW). We obtain fixed parameter tractability results for all values of $α$ and $β$ with respect to TND; W[1]-hardness with respect to TMW and TCW whenever $β$ is in the problem input, or whenever $α\in (0,1)$ and $β$ is a fixed constant; and para-NP-hardness with respect to TCW when $α= 0$ and $β= 1$, or $α= 1$ and $β= 0$.

cs.DM↗