惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

MyScale Blog
MyScale Blog
Apple Machine Learning Research
Apple Machine Learning Research
H
Help Net Security
雷峰网
雷峰网
V
Visual Studio Blog
G
Google Developers Blog
Microsoft Azure Blog
Microsoft Azure Blog
Hugging Face - Blog
Hugging Face - Blog
爱范儿
爱范儿
IT之家
IT之家
Engineering at Meta
Engineering at Meta
Microsoft Security Blog
Microsoft Security Blog
aimingoo的专栏
aimingoo的专栏
大猫的无限游戏
大猫的无限游戏
M
MIT News - Artificial intelligence
月光博客
月光博客
A
About on SuperTechFans
B
Blog RSS Feed
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
The GitHub Blog
The GitHub Blog
N
Netflix TechBlog - Medium
J
Java Code Geeks
云风的 BLOG
云风的 BLOG
Blog — PlanetScale
Blog — PlanetScale

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Forman--Ricci Curvature on Contact-Sequence Temporal Netw...
Taiki Yamada · 2026-05-15 · via math.CO updates on arXiv.org

Temporal networks -- sequences of time-stamped contacts among nodes -- constitute the finest-grained representation of dynamic interaction data; however, geometric and topological analyses of such networks have remained largely confined to time-aggregated or snapshot-based approximations. Such reductions destroy the temporal ordering and interevent statistics essential for understanding spreading dynamics, synchronization, and information flow. This study proposes a geometric framework that lifts a contact-sequence temporal network into a genuine simplicial complex through a prism construction adapted from algebraic topology. On this spatiotemporal prism complex, we develop the Forman--Ricci curvature in its original CW-complex form and contrast it with an augmented variant widely used in network science. We prove that the two variants coincide under uniform weights, derive a closed-form expression for their pointwise discrepancy in the general case, and identify the precise conditions under which they diverge -- conditions generically satisfied in temporal networks because temporal edges carry interval-dependent weights. Numerical experiments on three synthetic contact-network models (Erd\H os--Rényi, activity-driven, and bursty) and on the SocioPatterns Hypertext 2009 face-to-face contact dataset quantitatively confirm the theoretical predictions: the two Forman variants disagree on $56$--$67\%$ of the $1$-simplices -- predominantly the temporal and diagonal simplices -- while remaining strongly correlated according to the Pearson coefficient. The proposed framework provides a principled, parameter-free method for assigning discrete Ricci curvature to each contact event, thereby opening a new geometric avenue for temporal data analysis.