arXiv:2603. 08311v2 Announce Type: replace-cross Abstract: We study identifiability in continuous-time linear stationary stochastic differential equations with a known causal structure.
arXiv:2606. 28228v1 Announce Type: new Abstract: Causal representation learning for time series has developed strong identifiability results in discrete-time latent causal models, but identifiability in continuous-time latent stochastic differential equation (SDE) models remains largely open.
arXiv:2603.24333v2 Announce Type: replace-cross Abstract: Recently, Forr\'e (arXiv:2104.11547, 2021) introduced transitional conditional independence, a notion of conditional independence that provid...
arXiv:2606. 19361v1 Announce Type: cross Abstract: Identification conditions describe the computability of a target query or parameter of interest as a function of the type and amount of information available.
The paper addresses causal discovery in Directed Acyclic Graphs where nodes are either ordinal (modeled with an ordered logit) or follow a one‑parameter exponential family distribution. It proves that the direction of edges between such nodes is identifiable for generic parameter values, extending prior Ordinal‑Poisson results. The authors also propose a score‑based exhaustive search and a masked continuous optimization method using DAGMA, and demonstrate through simulations that these approaches recover orientations that are otherwise unidentifiable under classical structural equation models.
arXiv:2605. 03268v2 Announce Type: replace-cross Abstract: Here we introduce Partially Observed Structural Causal Models (POSCMs) as an extension of structural causal models (SCMs) to settings where upstream contexts co-determine both the interaction structure and downstream mechanisms on observed variables.
arXiv:2606. 24621v1 Announce Type: cross Abstract: This paper introduces a categorical account of infinitesimal causality in Frobenius Markov categories equipped with tangent-bundle semantics.
arXiv:2608. 19831v1 Announce Type: new Abstract: Causal Bayesian networks (CBNs) and structural causal models (SCMs) are the dominant frameworks for graphical causal reasoning, but they cannot adequately represent all real-world causal systems.
arXiv:2607. 03639v1 Announce Type: cross Abstract: For a multidimensional reflected diffusion, determining whether the associated basic adjoint relationship (BAR) uniquely characterizes the stationary distribution is a basic uniqueness problem in the BAR approach.
This paper introduces a categorical account of infinitesimal causality in Frobenius Markov categories equipped with tangent-bundle semantics. IDC captures the infinitesimal layer in which interventions act as tangent deformations of copy/discard structure.
arXiv:2606. 03067v1 Announce Type: cross Abstract: A recurring data mining task in complex networks is to determine how individual nodes contribute to system behavior.
The paper investigates how to recover the parameters of a multivariate Ornstein-Uhlenbeck process using only steady-state observational and interventional data. It proves that a single intervention per strongly connected component of the drift graph is sufficient to identify all parameters generically, up to a global scaling factor, provided the SCC condensation graph is connected with a single root and certain spectral conditions hold. A recursive learning algorithm and a regularized least-squares estimator are proposed, and experiments confirm the theoretical results.
The paper establishes a precise mathematical link between graph surgery and the do‑operator in deterministic acyclic structural causal models. It shows that deleting arrows in a graph corresponds exactly to replacing the associated mechanisms with constants, proving that “Graph(F^\iota)=Surg(Graph(F),T_\iota)”. The authors further characterize when this equality holds for the full graph, define the intervened model, and demonstrate how sequential interventions combine, concluding that an outcome depends only on interventions at its actual dependency ancestors.