arxiv: 2604.25948 · v1 · submitted 2026-04-17 · 🧮 math.CO · math.AC· physics.data-an

Recognition: unknown

Causal Edge Rees Algebras for Spatiotemporal Graphs

Marcilio Ferreira dos Santos , Cleiton de Lima Ricardo

Authors on Pith no claims yet

Pith reviewed 2026-05-10 07:32 UTC · model grok-4.3

classification 🧮 math.CO math.ACphysics.data-an

keywords causal graphsRees algebrasedge idealstemporal graphsspatiotemporal systemsbridge modulesconnected componentsdynamic networks

0 comments

The pith

A Rees algebra built from causal edge ideals in a temporal filtration encodes the full history of component mergers in spatiotemporal graphs.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper constructs an algebraic object that tracks how connectivity changes in graphs whose edges appear according to causal order rather than geometric distance. It associates a sequence of edge ideals to the filtration steps and forms their Rees algebra, a single graded ring that stores every past and present interaction. Successive quotients of the filtration produce modules whose dimensions count exactly how many new connections fuse previously separate components at each moment. This yields temporal bridge modules and a theorem that reads the size of those modules as the precise drop in the number of connected components. A reader would care because the construction supplies an exact algebraic count of which causal events are responsible for merging clusters, applicable to any process whose interactions carry an intrinsic before-after order.

Core claim

Given a causal spatiotemporal graph and its induced temporal filtration, the associated sequence of edge ideals generates a Rees algebra whose graded pieces record the entire connectivity evolution; the successive quotients of the filtration are modules that detect the birth of new structural links, and the dimension of the temporal bridge modules equals the reduction in the number of connected components across time steps, as stated by the bridge detection theorem.

What carries the argument

The Causal Edge Rees Algebra (CERA), the Rees algebra of the edge ideals arising from the causal temporal filtration, which packages the complete sequence of connectivity changes into one graded algebraic object.

If this is right

The dimension of each temporal bridge module gives the exact number of connected-component reductions at that filtration step.
Edges that generate nonzero classes in the bridge modules are the critical causal links responsible for fusions.
The same algebraic construction applies to any filtration defined by causal precedence, independent of geometric or distance-based assumptions.
The graded structure of the Rees algebra supplies a single object from which both instantaneous topology and its temporal coalescence history can be read off.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

Computing these module dimensions on real temporal data sets could yield an efficient algebraic test for influential events that merge clusters.
The approach might be extended to weighted or directed causal graphs by replacing edge ideals with more general monomial or binomial ideals.
It offers a purely algebraic counterpart to persistent homology that replaces distance filtrations with causal orderings, potentially allowing direct comparison on the same data.

Load-bearing premise

That the causal constraints produce a filtration whose successive quotients have dimensions that exactly equal the number of component mergers at each step.

What would settle it

Construct a small causal graph with one edge addition that merges exactly two components and compute the corresponding quotient module; if its dimension is not equal to one, the bridge detection theorem fails.

Figures

Figures reproduced from arXiv: 2604.25948 by Cleiton de Lima Ricardo, Marcilio Ferreira dos Santos.

**Figure 2.** Figure 2: Graph G2: addition of a temporal bridge connecting the components. Topological behavior. β0(G ∗ 1 ) = 2, β0(G ∗ 2 ) = 1. Hence, dimk(B2) = 1. This is the simplest instance of a merging event. 5.2. Example II: Cycle formation without merging Consider E1 = {(1, 2), (2, 3),(3, 4)}, E2 = {(1, 2), (2, 3),(3, 4), (4, 1)}. Topological behavior. β0(G ∗ 1 ) = β0(G ∗ 2 ) = 1. Thus, dimk(B2) = 0. 1 2 3 4 [PITH_FULL_… view at source ↗

**Figure 3.** Figure 3: Graph G1: a connected acyclic graph. 1 2 3 4 [PITH_FULL_IMAGE:figures/full_fig_p009_3.png] view at source ↗

**Figure 1.** Figure 1: Graph G1: two disconnected components. Algebraic structure. We have: I1 = ⟨x1 x2, x3 x4⟩, I2 = ⟨x1 x2, x3 x4, x2 x3⟩. Thus, I2/I1 is generated by the class of x2 x3. 1 2 3 4 [PITH_FULL_IMAGE:figures/full_fig_p009_1.png] view at source ↗

**Figure 5.** Figure 5: Graph G1: three disconnected components. 1 2 3 4 5 6 [PITH_FULL_IMAGE:figures/full_fig_p010_5.png] view at source ↗

**Figure 8.** Figure 8: Graph at time t2: formation of a second disconnected cluster. Evolution of connectivity. The sequence of graphs illustrates the progressive growth of spatial clusters under causal constraints. Initially, local connections give rise to small connected components ( [PITH_FULL_IMAGE:figures/full_fig_p010_8.png] view at source ↗

**Figure 9.** Figure 9: Graph at time t3: addition of a temporal bridge connecting the two clusters [PITH_FULL_IMAGE:figures/full_fig_p011_9.png] view at source ↗

**Figure 10.** Figure 10: Graph at time t4: fully connected structure after successive merging events. This classification separates topological transitions from purely internal structural changes. 5.7. Role of CERA The algebra CERA(G) encodes the full evolution of connectivity along the filtration, while the associated graded components In/In−1 record all newly introduced edges at each level. Within this structure, the modules Bn… view at source ↗

read the original abstract

Understanding the evolution of connectivity in spatiotemporal systems requires mathematical frameworks capable of encoding not only instantaneous interactions but also their cumulative causal structure. In this work, we introduce the \emph{Causal Edge Rees Algebra} (CERA), a new algebraic construction associated with causal spatiotemporal graphs. Given a temporal filtration induced by causal constraints, we associate a sequence of edge ideals whose Rees algebra encodes the full history of connectivity evolution in a single graded object. This construction establishes a bridge between dynamic graph topology and commutative algebra. In particular, we show that successive quotients of the filtration capture the emergence of new structural connections, allowing the identification of critical edges responsible for the fusion of previously disconnected components. This leads to the definition of temporal bridge modules and to a bridge detection theorem, which relates the dimension of these modules to the reduction in the number of connected components over time. Unlike existing algebraic approaches in topological data analysis, which are primarily based on geometric filtrations, the proposed framework is driven by intrinsic causal constraints. As a result, the CERA captures not only topological features but also their temporal organization and mechanisms of coalescence. The theory provides a new algebraic perspective on causal network dynamics, connecting edge ideals, Rees algebras, and temporal graphs. Beyond its theoretical significance, the framework opens new directions for the analysis of spatiotemporal systems, including epidemic networks, transport systems, and information propagation processes.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

CERA sets up a new Rees algebra construction on causal edge filtrations but the bridge detection theorem probably fails to isolate actual mergers from redundant edges.

read the letter

The paper introduces the Causal Edge Rees Algebra for spatiotemporal graphs. It starts with a temporal filtration coming from causal constraints, builds the corresponding edge ideals, and packages them into a single Rees algebra that is meant to hold the full record of connectivity changes. From the successive quotients it defines temporal bridge modules and states a theorem that their dimensions equal the reduction in connected components at each step. That combination of causal filtrations with Rees algebras on edge ideals has not appeared before in this form, and the abstract positions it clearly against geometric filtrations from topological data analysis. The framing for applications in epidemic or transport networks is straightforward and does not overreach. The central claim, however, rests on shaky ground. The dimension of the quotient module is the number of new generators added to the ideal at that time step. In any graph a single time step can add both merging edges and redundant ones that stay inside a component. The abstract gives no indication that the module construction uses saturation, colon ideals, or any other device to discard the non-merging generators. Without a proof or even a small concrete example the equality between algebraic dimension and topological mergers does not follow. The paper is aimed at commutative algebraists who already know edge ideals and Rees algebras and are curious about dynamic graphs. A serious referee could check whether the authors can repair or restrict the theorem once the details are written out. I would send it to review rather than desk reject.

Referee Report

2 major / 2 minor

Summary. The paper introduces the Causal Edge Rees Algebra (CERA) for spatiotemporal graphs. Given a temporal filtration induced by causal constraints, it associates a sequence of edge ideals whose Rees algebra encodes the full history of connectivity evolution. The work defines temporal bridge modules from successive quotients of this filtration and states a bridge detection theorem relating the dimension of these modules to the reduction in the number of connected components over time. The framework is presented as a causal-algebraic alternative to geometric filtrations used in topological data analysis.

Significance. If the construction is made rigorous and the bridge detection theorem holds, the work would supply a new commutative-algebraic tool for tracking causal connectivity changes in dynamic networks. It distinguishes itself by using intrinsic causal constraints rather than geometric ones, potentially aiding analysis of epidemic networks, transport systems, and information propagation. The parameter-free character of the core objects (no fitted parameters or ad-hoc choices) would be a strength if the claims are verified.

major comments (2)

[Bridge detection theorem] Bridge detection theorem: The theorem claims that the dimension of the temporal bridge modules equals the reduction in the number of connected components. The construction forms a chain of edge ideals I_t from the causal filtration, takes the Rees algebra, and extracts successive quotients (presumably M_t = I_{t+1}/I_t or a derived module). These quotients are k-vector spaces spanned by the new monomial generators added at step t. In a graph, however, a single time step can add both merging edges (reducing component count) and redundant edges (within components or forming cycles), so dim M_t equals the number of new generators while the topological reduction is strictly smaller. The manuscript must specify how the causal constraints or the precise definition of the temporal bridge modules (e.g., via saturation, colon ideals, or selection of minimal generators) automatically excludes non-
[Abstract and introduction] The abstract asserts the existence of the CERA construction and the bridge detection theorem but provides neither explicit definitions of the temporal bridge modules nor a proof of the claimed dimension equality. Without these, the central claim cannot be verified.

minor comments (2)

The notation for the temporal filtration, the sequence of edge ideals I_t, and the precise algebraic definition of the Rees algebra object should be given explicitly with equations.
The distinction between the proposed causal filtration and standard geometric filtrations in TDA is asserted but not illustrated with a concrete small example.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for identifying points where greater precision and explicitness are needed. We have revised the paper to supply the missing details on the definition of the temporal bridge modules and to include a complete proof of the bridge detection theorem.

read point-by-point responses

Referee: [Bridge detection theorem] Bridge detection theorem: The theorem claims that the dimension of the temporal bridge modules equals the reduction in the number of connected components. The construction forms a chain of edge ideals I_t from the causal filtration, takes the Rees algebra, and extracts successive quotients (presumably M_t = I_{t+1}/I_t or a derived module). These quotients are k-vector spaces spanned by the new monomial generators added at step t. In a graph, however, a single time step can add both merging edges (reducing component count) and redundant edges (within components or forming cycles), so dim M_t equals the number of new generators while the topological reduction is strictly smaller. The manuscript must specify how the causal constraints or the precise definition of the temporal bridge modules (e.g., via saturation, colon ideals, or selection of minimal generators)

Authors: We agree that a naive quotient of successive edge ideals would count all new generators, including redundant ones. In the revised manuscript we have made the definition of the temporal bridge modules precise: they are obtained as the quotient (I_{t+1} : J_t) / I_t, where J_t is the ideal generated by all variables corresponding to edges internal to the components present at time t. This saturation step automatically discards generators that lie inside existing components. The causal filtration further restricts the admissible edges, and we prove in the new Lemma 3.4 that the resulting module dimension equals exactly the number of component mergers. An illustrative example has been added to Section 3 to demonstrate the exclusion of cycle-forming edges. revision: yes
Referee: [Abstract and introduction] The abstract asserts the existence of the CERA construction and the bridge detection theorem but provides neither explicit definitions of the temporal bridge modules nor a proof of the claimed dimension equality. Without these, the central claim cannot be verified.

Authors: The abstract is intended only as a high-level overview. We acknowledge, however, that the introduction and main body must contain the explicit definitions and proof for the claims to be verifiable. In the revision we have expanded the introduction to state the precise definition of the temporal bridge modules (via the saturation construction above) and have moved the full proof of the bridge detection theorem to a dedicated subsection in Section 4, where the equality between module dimension and component reduction is established step by step. revision: yes

Circularity Check

0 steps flagged

No circularity detected; new algebraic objects and theorem are definitional extensions

full rationale

The paper defines the Causal Edge Rees Algebra by associating a Rees algebra to a causal temporal filtration on edge ideals of a spatiotemporal graph, then extracts successive quotients to define temporal bridge modules and states a bridge detection theorem relating module dimension to component reduction. No quoted equations, definitions, or self-citations reduce the theorem to a tautology, fitted input, or imported uniqueness result; the construction applies standard commutative algebra tools to a novel causal setting without self-referential assumptions or renaming of known results. The framework remains self-contained as an original extension rather than a circular reduction of its own inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 2 invented entities

The central claim rests on newly introduced definitions and a claimed theorem built from standard commutative algebra; no data-fitted parameters are present because the work is purely theoretical.

axioms (1)

standard math Rees algebras and edge ideals satisfy the standard properties and exact sequences of commutative algebra
The CERA is constructed by associating edge ideals to a causal filtration and taking their Rees algebra.

invented entities (2)

Causal Edge Rees Algebra (CERA) no independent evidence
purpose: To serve as a single graded algebraic object encoding the full history of connectivity evolution under causal constraints
Newly defined construction that associates a sequence of edge ideals to the temporal filtration.
temporal bridge modules no independent evidence
purpose: To capture critical edges responsible for the fusion of previously disconnected components
Defined via successive quotients of the filtration in the CERA.

pith-pipeline@v0.9.0 · 5546 in / 1428 out tokens · 43601 ms · 2026-05-10T07:32:07.538631+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

28 extracted references · 2 canonical work pages · 1 internal anchor

[1]

Newman, M. E. J.Networks: An Introduction. Ox- ford University Press, 2010

2010
[2]

Temporal networks

Holme, P.; Saramäki, J. Temporal networks. Physics Reports, 519(3), 97–125, 2012

2012
[3]

Time-varying graphs and dynamic net- works.International Journal of Parallel, Emer- gent and Distributed Systems, 27(5), 387–408, 2012

Casteigts, A.; Flocchini, P.; Quattrociocchi, W.; Santoro, N. Time-varying graphs and dynamic net- works.International Journal of Parallel, Emer- gent and Distributed Systems, 27(5), 387–408, 2012

2012
[4]

arXiv preprint arXiv:2504.09174, 2025

Hu, C.; Wang, Y .; Xia, K.; Ye, K.; Zhang, Y .Commutative Algebra-Enhanced Topological Data Analysis. arXiv preprint arXiv:2504.09174, 2025

work page arXiv 2025
[5]

Collections, 59(2), 2026

Wei, G.-W.Commutative Algebra Meets Data Sci- ence: A New Paradigm in Mathematical Artificial Intelligence. Collections, 59(2), 2026

2026
[7]

H.Monomial Algebras

Villarreal, R. H.Monomial Algebras. Marcel Dekker, 2001

2001
[8]

Graduate Texts in Mathematics, Springer, 2011

Herzog, J.; Hibi, T.Monomial Ideals. Graduate Texts in Mathematics, Springer, 2011

2011
[9]

V .; Villarreal, R

Simis, A.; Vasconcelos, W. V .; Villarreal, R. H. On the ideal theory of graphs.Journal of Algebra, 167, 389–416, 1994

1994
[10]

V .Arithmetic of Blowup Alge- bras

Vasconcelos, W. V .Arithmetic of Blowup Alge- bras. London Mathematical Society Lecture Note Series, Cambridge University Press, 1994

1994
[11]

Cambridge University Press, 2006

Huneke, C.; Swanson, I.Integral Closure of Ide- als, Rings, and Modules. Cambridge University Press, 2006

2006
[12]

Springer, 1995

Eisenbud, D.Commutative Algebra with a View Toward Algebraic Geometry. Springer, 1995

1995
[13]

Graduate Texts in Mathematics, Springer, 2005

Miller, E.; Sturmfels, B.Combinatorial Commu- tative Algebra. Graduate Texts in Mathematics, Springer, 2005

2005
[14]

P.Combinatorics and Commutative Al- gebra

Stanley, R. P.Combinatorics and Commutative Al- gebra. 2nd Edition, Birkhäuser, 1996

1996
[15]

5th Edition, Springer, 2017

Diestel, R.Graph Theory. 5th Edition, Springer, 2017

2017
[16]

B.Introduction to Graph Theory

West, D. B.Introduction to Graph Theory. Pren- tice Hall, 2001

2001
[17]

Topological methods

Björner, A. Topological methods. In:Handbook of Combinatorics, Elsevier, 1995

1995
[18]

Springer, 1977

Hartshorne, R.Algebraic Geometry. Springer, 1977

1977
[19]

Cambridge University Press, 2006

Assem, I.; Simson, D.; Skowro ´nski, A.Elements of the Representation Theory of Associative Alge- bras. Cambridge University Press, 2006. 13

2006
[20]

Unzerlegbare Darstellungen I

Gabriel, P. Unzerlegbare Darstellungen I. Manuscripta Mathematica, 6, 71–103, 1972

1972
[21]

Cambridge University Press, 1998

Bruns, W.; Herzog, J.Cohen–Macaulay Rings. Cambridge University Press, 1998

1998
[22]

Villarreal, R. H. Cohen–Macaulay graphs. Manuscripta Mathematica, 66, 277–293, 1990

1990
[23]

Herzog, J.; Hibi, T.; Trung, N. V . Symbolic pow- ers of monomial ideals and vertex cover algebras. Advances in Mathematics, 210, 304–322, 2007

2007
[24]

T.; Van Tuyl, A

Francisco, C.; Hà, H. T.; Van Tuyl, A. Color- ings of hypergraphs, perfect graphs, and associ- ated primes of powers of monomial ideals.Journal of Algebra, 331, 224–242, 2013

2013
[25]

P.Enumerative Combinatorics, Volume

Stanley, R. P.Enumerative Combinatorics, Volume
[26]

Cambridge University Press, 1997

1997
[27]

Scale-dependent Temporal Signatures of Arboviral Transmission in Urban Environments

Santos, M. F.; Ricardo, C. L. Scale-dependent temporal signatures of arboviral transmis- sion in urban environments.arXiv preprint, arXiv:2604.11818, 2026

work page internal anchor Pith review Pith/arXiv arXiv 2026
[28]

Springer, 2nd edition, 1998

Mac Lane, S.Categories for the Working Mathe- matician. Springer, 2nd edition, 1998

1998
[29]

Oxford University Press, 2010

Awodey, S.Category Theory. Oxford University Press, 2010. 14

2010