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

0.3%0.5%0.8%0.3% · Aug 201119922001200920172026
8 results for Graphoids
Graphoidsmath.CO

Graphoids are topological invariants of virtual graph diagrams.

problem Understanding knotted graphs with open ends in proteins and simplifying virtual spatial graphs.
method Topological interpretations of graphoids using graph Reidemeister moves.
result Virtual graphoids are useful for studying knotted graphs and simplifying spatial graphs.

Let FF be a countable family of rational functions of two variables with real coefficients. Each rational function fFf\in F can be thought as a continuous function f:dom(f)Rˉf:dom(f)\to\bar R taking values in the projective line Rˉ=R{}\bar R=R\cup\{\infty\} and defined on a cofinite subset dom(f)dom(f) of the torus Rˉ2\bar R^2. Then t…

2011-08-10abs ↗pdf ↗

In this paper, we unify the Markov theory of a variety of different types of graphs used in graphical Markov models by introducing the class of loopless mixed graphs, and show that all independence models induced by mm-separation on such graphs are compositional graphoids. We focus in particular on the subclass of rib…

2011-09-27abs ↗pdf ↗

We present a graphical criterion for reading dependencies from the minimal directed independence map G of a graphoid p when G is a polytree and p satisfies composition and weak transitivity. We prove that the criterion is sound and complete. We argue that assuming composition and weak transitivity is not too restrictiv…

2012-06-20abs ↗pdf ↗

The covariance graph (aka bi-directed graph) of a probability distribution pp is the undirected graph GG where two nodes are adjacent iff their corresponding random variables are marginally dependent in pp. In this paper, we present a graphical criterion for reading dependencies from GG, under the assumption that $…

2010-10-21abs ↗pdf ↗

We present a new family of models that is based on graphs that may have undirected, directed and bidirected edges. We name these new models marginal AMP (MAMP) chain graphs because each of them is Markov equivalent to some AMP chain graph under marginalization of some of its nodes. However, MAMP chain graphs do not onl…

2013-05-03abs ↗pdf ↗