Related papers: Solving Causal Stream Inclusions
This paper studies the set cover problem under the semi-streaming model. The underlying set system is formalized in terms of a hypergraph $G = (V, E)$ whose edges arrive one-by-one and the goal is to construct an edge cover $F \subseteq E$…
The broad abundance of time series data, which is in sharp contrast to limited knowledge of the underlying network dynamic processes that produce such observations, calls for a rigorous and efficient method of causal network inference. Here…
The extraction of spatio-temporal coherence in high-dimensional, chaotic, non-linear dynamical systems, such as turbulent flows, remains a fundamental challenge in physics, mathematics and engineering. In this work, we employ Shannon…
A structural causal model is made of endogenous (manifest) and exogenous (latent) variables. We show that endogenous observations induce linear constraints on the probabilities of the exogenous variables. This allows to exactly map a causal…
In this paper, we study the non-bipartite maximum matching problem in the semi-streaming model. The maximum matching problem in the semi-streaming model has received a significant amount of attention lately. While the problem has been…
Entanglement is resolved in conformal field theory (CFT) with respect to conformal families to all orders in the UV cutoff. To leading order, symmetry-resolved entanglement is connected to the quantum dimension of a conformal family, while…
We prove a general finite convergence theorem for "upward-guarded" fixpoint expressions over a well-quasi-ordered set. This has immediate applications in regular model checking of well-structured systems, where a main issue is the eventual…
We introduce a new computational model for data streams: asymptotically exact streaming algorithms. These algorithms have an approximation ratio that tends to one as the length of the stream goes to infinity while the memory used by the…
We propose a novel approach to stream definition and manipulation. Our solution is based on two key ideas. Regular corecursion, which avoids non termination by detecting cyclic calls, is enhanced, by allowing in equations defining streams…
Streams are infinite sequences over a given data type. A stream specification is a set of equations intended to define a stream. We propose a transformation from such a stream specification to a term rewriting system (TRS) in such a way…
Can the direction of time and the causal structure of space-time be inferred from operational principles? Causal models and tensor networks offer complementary perspectives: the former encodes cause-effect relations via directed graphs,…
It is shown that the causal structure associated to string-like solutions of the Fadeev-Niemi (FN) model is described by an effective metric. Remarkably, the surfaces characterising the causal replacement depend on the energy momentum…
The issue of causality in $f(T)$ gravity is investigated by examining the possibility of existence of the closed timelike curves in the G\"{o}del-type metric. By assuming a perfect fluid as the matter source, we find that the fluid must…
We show that a continuous map or a continuous flow on $\R^{n}$ with a certain recurrence relation must have a fixed point. Specifically, if there is a compact set W with the property that the forward orbit of every point in $\R^{n}$…
Modeling real processes often results in several suitable models. In order to be able to distinguish, or discriminate, which model best represents a phenomenon, one is interested, e.g., in so-called T-optimal designs. These consist of the…
Two prevalent models in the data stream literature are the insertion-only and turnstile models. Unfortunately, many important streaming problems require a $\Theta(\log(n))$ multiplicative factor more space for turnstile streams than for…
Existing algorithms for explaining the outputs of image classifiers are based on a variety of approaches and produce explanations that frequently lack formal rigour. On the other hand, logic-based explanations are formally and rigorously…
Coinduction refers to both a technique for the definition of infinite streams, so-called codata, and a technique for proving the equality of coinductively specified codata. This article first reviews coinduction in declarative programming.…
Complex dynamical systems are prevalent in many scientific disciplines. In the analysis of such systems two aspects are of particular interest: 1) the temporal patterns along which they evolve and 2) the underlying causal mechanisms.…
We propose a rich foundational theory of typed data streams and stream transformers, motivated by two high-level goals: (1) The type of a stream should be able to express complex sequential patterns of events over time. And (2) it should…