arXiv research

New framework for cyclic quantum causal models with graph separation property.

We solve structure learning for cyclic linear causal models using observational data.

We prove that any isometry of the graph of cyclic splittings of a finitely generated free group $F_N$ of rank $N\ge 3$ is induced by an outer automorphism of $F_N$. The same statement also applies to the graphs of maximally-cyclic splittings, and of very small splittings.

New 3-manifold spines with unique Whitehead graphs identified.

Identifies root causes of outliers in unknown cyclic graphs.

We define analogues of the graphs of free splittings, of cyclic splittings, and of maximally-cyclic splittings of $F_N$ for free products of groups, and show their hyperbolicity. Given a countable group $G$ which splits as $G=G_1\ast\dots\ast G_k\ast F$, where $F$ denotes a finitely generated free group, we identify th…

Develops a new framework for causal models on cyclic graphs, solving unique solvability issues.

For a signed cyclic graph G, we can construct a unique virtual link L by taking the medial construction and convert 4-valent vertices of the medial graph to crossings according to the signs. If a virtual link can occur in this way then we say that the virtual link is graphical. In the article we shall prove that a virt…

MissNODAG learns cyclic causal graphs from incomplete data.

This paper proposes an axiomatic for Cyclic Foam Topological Field theories. That is Topological Field theories, corresponding to String theories, where particles are arbitrary graphs. World surfaces in this case are two-manifolds with one-dimensional singularities. We proved that Cyclic Foam Topological Field theories…

Generalized Baumslag-Solitar groups are defined as fundamental groups of graphs of groups with infinite cyclic vertex and edge groups. Forester proved (in "On uniqueness of JSJ decompositions of finitely generated groups", Comment. Math. Helv. 78 (2003) pp 740-751) that in most cases the defining graphs are cyclic JSJ …

We show that the arc graph of $S_g^1$ is a coarse Lipschitz retract of the free splitting complex of $F_{2g}$. We also show that the arc and curve graph of $S_g^1$ is a coarse Lipschitz retract of both the cyclic splitting graph of $F_{2g}$ and the maximally cyclic splitting graph of $F_{2g}$.

A fundamental theorem in the study of Dunwoody manifolds is a classification of finite graphs on $2n$ vertices that satisfy seven conditions (concerning planarity, regularity, and a cyclic automorphism of order $n$). Its significance is that if the presentation complex of a cyclic presentation is a spine of a 3-manifol…

Study counterfactuals in cyclic systems with shifts and scales.

A {\em word labeled oriented graph} (WLOG) is an oriented graph $\cal G$ on vertices $X=\{ x_1,\ldots ,x_k\}$, where each oriented edge is labeled by a word in $X^{\pm1}$. WLOGs give rise to presentations which generalize Wirtinger presentations of knots. WLOG presentations, where the underlying graph is a tree are of …

The study shows that certain groups can be uniquely identified by their finite abelian summands.

A new framework learns cyclic causal graphs from incomplete data.

A graph product kernel means the kernel of the natural surjection from a graph product to the corresponding direct product. We prove that a graph product kernel of countable groups is special, and a graph product of finite or cyclic groups is virtually cocompact special in the sense of Haglund and Wise. The proof of th…

DCCD-CONF discovers causal graphs with unmeasured confounders.

We discuss 3-manifolds which are cyclic coverings of the 3-sphere, branched over 2-bridge knots and links. Different descriptions of these manifolds are presented: polyhedral, Heegaard diagram, Dehn surgery and coloured graph constructions. Using these descriptions, we give presentations for their fundamental groups, w…

We study the hairy graph homology of a cyclic operad; in particular we show how to assemble corresponding hairy graph cohomology classes to form cocycles for ordinary graph homology, as defined by Kontsevich. We identify the part of hairy graph homology coming from graphs with cyclic fundamental group as the dihedral h…

Consider a one-ended word-hyperbolic group. If it is the fundamental group of a graph of free groups with cyclic edge groups then either it is the fundamental group of a surface or it contains a finitely generated one-ended subgroup of infinite index. As a corollary, the same holds for limit groups. We also obtain a ch…

Efficiently learns DAG structures without cycles.

We give upper bounds, linear in rank, to the topological dimensions of the Gromov boundaries of the intersection graph, the free factor graph and the cyclic splitting graph of a finitely generated free group.

New framework learns nonlinear cyclic causal models from data.

We propose a number of techniques for obtaining a global ranking from data that may be incomplete and imbalanced -- characteristics almost universal to modern datasets coming from e-commerce and internet applications. We are primarily interested in score or rating-based cardinal data. From raw ranking data, we construc…

We propose two spectral algorithms for partitioning nodes in directed graphs respectively with a cyclic and an acyclic pattern of connection between groups of nodes. Our methods are based on the computation of extremal eigenvalues of the transition matrix associated to the directed graph. The two algorithms outperform …

We construct examples of free-by-cyclic hyperbolic groups which fiber in infinitely many ways over Z. The construction involves adding a specialized square 2-cell to a non-positively curved, squared 2-complex defined by labeled oriented graphs. The fundamental groups of the resulting complexes are hyperbolic, free-by-c…

We study the dependence of solutions of equations of the form $a_0 + a_1 z^{\ell_1} + ... + a_m z^{\ell_m} = 0$, on the exponents $\ell_1, ..., \ell_m$. We apply our results to equations that appear in graph theory, the theory of 3-manifolds fibering over the circle, and the theory of free-by-cyclic groups. In particul…

RECLAIM discovers causal graphs in cyclic, noisy systems.

Develops a model for causal discovery in path spaces.

We give a technical result that implies a straightforward necessary and sufficient conditions for a graph of groups with virtually cyclic edge groups to be one ended. For arbitrary graphs of groups, we show that if their fundamental group is not one-ended, then we can blow up vertex groups to graphs of groups with simp…

We introduce a model for causal structure learning from multivariate functional data, even when graphs have cycles.

We consider a family of 2-step nilpotent Lie algebras associated to uniform complete graphs on odd number of vertices. We prove that the symmetry group of such a graph is the holomorph of the additive cyclic group $\Z_n$. Moreover, we prove that the (Lie) automorphism group of the corresponding nilpotent Lie algebra co…

Simplified presentation of symplectic fillings of lens spaces.

In classical differential geometry, a central question has been whether abstract surfaces with given geometric features can be realized as surfaces in Euclidean space. Inspired by the rich theory of embedded triply periodic minimal surfaces, we seek examples of triply periodic polyhedral surfaces that have an identifia…

For a smoothing Y of a 2-dimensional cyclic quotient singularity X, we construct a simple handle decomposition of Y by using a particular birational map from Y to the projective plane. The manifold Y is built up from the product of an annulus with a disk by attaching 2-handles in a manner which can be described by mean…

The study proves conjecture for specific Artin groups.

The paper explores circular orderability in 3-manifold groups, related to the L-space conjecture.

We study biinvariant word metrics on groups. We provide an efficient algorithm for computing the biinvariant word norm on a finitely generated free group and we construct an isometric embedding of a locally compact tree into the biinvariant Cayley graph of a nonabelian free group. We investigate the geometry of cyclic …

We solve the isomorphism problem for the whole class of Lins-Mandel gems (graphs encoded manifolds). We also present certain homeomorphisms of branched cyclic coverings of two-bridge hyperbolic links. As a consequence, we prove that, in in a wide subset of interesting cases, the isomorphism conditions for Lins-Mandel g…

Study lens spaces' definite fillings, classifying those with specific inequalities.

We present an algorithm that computes Bowditch's canonical JSJ decomposition of a given one-ended hyperbolic group over its virtually cyclic subgroups. The algorithm works by identifying topological features in the boundary of the group. As a corollary we also show how to compute the JSJ decomposition of such a group o…

Toroidal 3-manifolds have special group structures that can be shown through specific covers.

Leighton's graph covering theorem states that a pair of finite graphs with isomorphic universal covers have a common finite cover. We provide a new proof of Leighton's theorem that allows generalizations; we prove the corresponding result for graphs with fins. As a corollary we obtain pattern rigidity for free groups w…

Let $Γ$ be a word hyperbolic group with a cyclic JSJ decomposition that has only rigid vertex groups, which are all fundamental groups of closed surface groups. We show that any group $H$ quasi-isometric to $Γ$ is abstractly commensurable with $Γ$.

In this paper we complete the classification of topological symmetry groups for complete graphs $K_n$ by characterizing which $K_n$ can have a cyclic group, a dihedral group, or a subgroup of $D_m \times D_m$ where $m$ is odd, as its topological symmetry group.

We consider intrinsic linking and knotting in the context of directed graphs. We construct an example of a directed graph that contains a consistently oriented knotted cycle in every embedding. We also construct examples of intrinsically 3-linked and 4-linked directed graphs. We introduce two operations, consistent edg…