Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

316192122 · May 202619922001200920172026
48 results for Causal Loop Diagrams

D2D converts CLDs into SDMs to explore leverage points under uncertainty.

problem Limited dynamic analysis of CLDs for intervention strategies.
method Minimal user input protocol to convert CLDs into SDMs, simulating interventions.
result D2D helps distinguish leverage points and provides uncertainty estimates.

Vassiliev invariants can be studied by studying the spaces of chord diagrams associated with singular knots. To these chord diagrams are associated the intersection graphs of the chords. We extend results of Chmutov, Duzhin and Lando to show that these graphs determine the chord diagram if the graph has at most one loo…

1998-07-08abs ↗pdf ↗

We relate the author's Lie cobracket in the module additively generated by loops on a surface with the Connes-Kreimer Lie bracket in the module additively generated by trees. To this end we introduce a pre-Lie coalgebra and a (commutative) Hopf algebra of pointed loops on a surface. In the last version I added sections…

2004-03-26abs ↗pdf ↗

CAFL breaks feedback loops in recommender systems using causal inference.

problem Feedback loops in recommender systems compromise recommendation quality and homogenize user behavior.
method Causal Adjustment for Feedback Loops (CAFL) algorithm that breaks feedback loops using causal inference.
result CAFL improves recommendation quality compared to prior correction methods.

Study clarifies variance of stratification estimators for causal effects.

problem Estimating average causal effects with discrete covariates.
method Combines insights from potential outcomes, causal diagrams, and structural models.
result Derives expressions for the variance of stratification estimators.

Study the kernel of surgery map restricted to 1-loop part of homology cylinders.

problem Understanding the kernel of the surgery map restricted to 1-loop parts of homology cylinders.
method Using Jacobi diagrams and clasper surgery, determine the kernel of the surgery map restricted to the 1-loop part.
result Determined the kernel of the surgery map restricted to the 1-loop part of homology cylinders.

A knot diagram has an associated looped interlacement graph, obtained from the intersection graph of the Gauss diagram by attaching loops to the vertices that correspond to negative crossings. This construction suggests an extension of the Kauffman bracket to an invariant of looped graphs, and an extension of Reidemeis…

2008-08-25abs ↗pdf ↗

The paper studies the n-loop Kontsevich invariant of knots with same Alexander polynomial.

problem Understanding the n-loop Kontsevich invariant for knots with identical Alexander polynomials.
method Analyzes the subspace generated by the n-loop Kontsevich invariant of knots with genus ≤ g and same Alexander polynomial.
result For n ≥ 2, the subspace is finite-dimensional.

We construct a space of string diagrams, which are a type of fatgraph with some additional data, and show that there are string topology operations on the chains of the free loop space of a closed Riemannian manifold which are parameterized by the chains on the space of string diagrams. These operations are shown to re…

2015-06-08abs ↗pdf ↗

We define transit clusters to simplify causal diagrams and preserve their essential properties.

problem Clustering variables in causal diagrams can alter essential properties of causal effects.
method We define transit clusters and provide an algorithm to find them, ensuring they preserve causal effect identifiability.
result Transit clusters simplify causal effect identification and maintain their essential properties.

Loops in surfaces and chord diagrams are studied with graph factorizations and grammars.

problem Understanding loops in surfaces and their properties.
method Factorization of filoops into spheric and toric sums, and grammars generating chordiagraphs.
result Minimal genus of filoops and stability properties under factorizations.

We classify link diagrams with Turaev genus one and two in terms of an alternating tangle structure of the link diagram. The proof involves surgery along simple closed curves on the Turaev surface, called cutting loops, which have corresponding cutting arcs that are visible on the planar link diagram. These also provid…

2015-07-10abs ↗pdf ↗

We introduce a way to color the regions of a classical knot diagram using ternary operations, so that the number of colorings is a knot invariant. By choosing appropriate substitutions in the algebras that we assign to diagrams, one obtains the relations from the knot group, and from the core group. Using the ternary o…

2013-01-03abs ↗pdf ↗

Causal diagrams based on do intervention are useful tools to formalize, process and understand causal relationship among variables. However, the do intervention has controversial interpretation of causal questions for non-manipulable variables, and it also lacks the power to check the conditions related to counterfactu…

2019-07-24abs ↗pdf ↗

The paper develops methods to bound causal effects using Partial Ancestral Graphs.

problem Bounding causal effects from observational data when true causal diagrams are unknown.
method Proposes a method using Partial Ancestral Graphs to derive bounds on causal effects from observational data.
result Demonstrates the effectiveness of the method with synthetic and real data examples.

Formula adjusts steady-state models for control confounding.

problem Learning steady-state models from operational data can be flawed due to control confounding.
method Derives a formula to adjust for control confounding using structural dynamical causal models.
result Estimates a causal steady-state model from closed-loop operational data.

Paper detects non-trivial cycles in embedding spaces using graph integrals.

problem Detecting non-trivial cycles in embedding spaces.
method Construct cycles from chord diagrams, use modified configuration space integrals, and pair arguments.
result Non-trivial cycles in embedding spaces are detected.

The paper constructs non-trivial cocycles for long embeddings with more than one loop.

problem Constructing non-trivial cocycles for long embeddings with more than one loop.
method Integral over configuration spaces associated with Bott-Cattaneo-Rossi graphs with more than one loop.
result Explicit construction of a non-trivial family of trivial long embeddings for odd dimensions.

A 2-dimensional braid over an oriented surface-knot FF is presented by a graph called a chart on a surface diagram of FF. We consider 2-dimensional braids obtained by an addition of 1-handles equipped with chart loops. We introduce moves of 1-handles with chart loops, called 1-handle moves, and we investigate how muc…

2015-03-02abs ↗pdf ↗

We study the unwheeled rational Kontsevich integral of torus knots. We give a precise formula for these invariants up to loop degree 3 and show that they appear as colorings of simple diagrams. We show that they behave under cyclic branched coverings in a very simple way. Our proof is combinatorial: it uses the results…

2003-10-08abs ↗pdf ↗

A hyperlink is a finite set of non-intersecting simple closed curves in R×R3\mathbb{R} \times \mathbb{R}^3. We compute the Wilson Loop observable using a path integral with an Einstein-Hilbert action. Using axial-gauge fixing, we can write this path integral as the limit of a sequence of Chern-Simons integrals, studied e…

2017-01-11abs ↗pdf ↗

We propose a method for learning cyclic causal models from a combination of observational and interventional equilibrium data. Novel aspects of the proposed method are its ability to work with continuous data (without assuming linearity) and to deal with feedback loops. Within the context of biochemical reactions, we a…

2013-09-26abs ↗pdf ↗

We consider two random group models: the hexagonal model and the square model, defined as the quotient of a free group by a random set of reduced words of length four and six respectively. Our first main result is that in this model there exists a sharp density threshold for Kazhdan's Property (T) and it equals 1/3. Ou…

2019-06-12abs ↗pdf ↗

Enhanced symplectic quandle colorings detect causal structure in spacetime diagrams.

problem Detecting causal structure in spacetime diagrams using polynomial invariants.
method Comparing symplectic quandle colorings of different diagrams representing spacetime connections.
result Enhanced symplectic quandle colorings consistently distinguish between causally unrelated and related spacetime configurations.

Fuzzy cognitive maps (FCMs) model feedback causal relations in interwoven webs of causality and policy variables. FCMs are fuzzy signed directed graphs that allow degrees of causal influence and event occurrence. Such causal models can simulate a wide range of policy scenarios and decision processes. Their directed loo…

2019-06-26abs ↗pdf ↗

Researchers use human-in-the-loop to create counterfactually augmented data, improving model performance.

problem Creating ML models less reliant on spurious patterns in NLP datasets.
method A human-in-the-loop process to curate counterfactually augmented data (CAD), prohibiting unnecessary edits.
result Models trained on CAD appear to rely less on semantically irrelevant words and generalize better out of domain.

Combining causality, control, and reinforcement learning for system control.

problem Learning to control dynamical systems using causal, control, and reinforcement learning approaches.
method Combining causal identification, control strategies, and reinforcement learning to control dynamical systems.
result Combining different learning paradigms for effective system control.

The causal assumptions, the study design and the data are the elements required for scientific inference in empirical research. The research is adequately communicated only if all of these elements and their relations are described precisely. Causal models with design describe the study design and the missing data mech…

2012-11-13abs ↗pdf ↗

Virtual knots arise in the study of Gauss diagrams and Vassiliev invariants of usual knots. Virtual braids correspond naturally to virtual knots. We consider the group of virtual braids on n strings VB_n and its Burau representation, in particular we study their homological properties. We prove that the plus-constructi…

1999-04-18abs ↗pdf ↗

We study the string topology of a closed oriented Riemannian manifold M. We describe a compact moduli space of diagrams, and show how the cellular chain complex of this space gives algebraic operations on the singular chains of the free loop space LM of M. These operations are well-defined on the homology of a quotient…

2011-11-15abs ↗pdf ↗

Using intersection theory in the context of Hilbert manifolds and geometric homology we show how to recover the main operations of string topology built by M. Chas and D. Sullivan. We also study and build an action of the homology of reduced Sullivan's chord diagrams on the singular homology of free loop spaces, extend…

2003-06-04abs ↗pdf ↗

New method estimates causal effects in complex spaces using topological structures.

problem Challenges in estimating causal effects in non-Euclidean spaces.
method Developed a topological causal inference framework using power-weighted silhouette functions of persistence diagrams.
result Successfully quantifies topological treatment effects across various complex outcomes.

We consider S^1-families of Legendrian knots in the standard contact R^3. We define the monodromy of such a loop, which is an automorphism of the Chekanov-Eliashberg contact homology of the starting (and ending) point. We prove this monodromy is a homotopy invariant of the loop. We also establish techniques to address …

2004-07-21abs ↗pdf ↗

Minimal grid diagrams found for 13-crossing prime knots.

problem Finding the simplest grid diagrams for prime knots with 13 crossings.
method Converted prime alternating knots to grid diagrams, focusing on minimal configurations.
result 4878 prime alternating knots with 13 crossings have been represented by grid diagrams with 15 vertical segments.