Related papers: Hypergraphs in the characterization of regular vin…
We describe the R package kdecopula (current version 0.9.0), which provides fast implementations of various kernel estimators for the copula density. Due to a variety of available plotting options it is particularly useful for the…
We introduce a notion of non-commutative joint independence for multiple algebras in a non-commutative probability space. The pairwise relationships between these algebras are encoded by a graph with two edge sets -- a combinatorial…
Hypergraphs were introduced in 1973 by Berg\'e. This review aims at giving some hints on the main results that we can find in the literature, both on the mathematical side and on their practical usage. Particularly, different definitions of…
The use of copula-based models in EDAs (estimation of distribution algorithms) is currently an active area of research. In this context, the copulaedas package for R provides a platform where EDAs based on copulas can be implemented and…
Stallings remarked that an outer automorphism of a free group may be thought of as a subdivision of a graph followed by a sequence of folds. In this thesis, we prove that automorphisms of fundamental groups of graphs of groups satisfying…
This is a survey article on trees, with a modest number of proofs to give a flavor of the way these topologies can be efficiently handled. Trees are defined in set-theorist fashion as partially ordered sets in which the elements below each…
Tree-ordered weakly sparse models have recently emerged as a robust framework for representing structures in an ``almost sparse'' way, while allowing the structure to be reconstructed through a simple first-order interpretation. A prominent…
As a generalization of graphs, hypergraphs are widely used to model higher-order relations in data. This paper explores the benefit of the hypergraph structure for the interpolation of point cloud data that contain no explicit structural…
A hypertree is a connected hypergraph without cycles. Further a hypertree is called an $r$-tree if, additionally, it is $r$-uniform. Note that 2-trees are just ordinary trees. A classical result states that for any 2-tree $T$ with…
We solve the existence problem for $F$-designs for arbitrary $r$-uniform hypergraphs~$F$. This implies that given any $r$-uniform hypergraph~$F$, the trivially necessary divisibility conditions are sufficient to guarantee a decomposition of…
Graph-based signal processing techniques have become essential for handling data in non-Euclidean spaces. However, there is a growing awareness that these graph models might need to be expanded into `higher-order' domains to effectively…
Creative telescoping applied to a bivariate proper hypergeometric term produces linear recurrence operators with polynomial coefficients, called telescopers. We provide bounds for the degrees of the polynomials appearing in these operators.…
We describe two constructions of (very) dense graphs which are edge disjoint unions of large {\em induced} matchings. The first construction exhibits graphs on $N$ vertices with ${N \choose 2}-o(N^2)$ edges, which can be decomposed into…
We present a robust method to find region-level correspondences between shapes, which are invariant to changes in geometry and applicable across multiple shape representations. We generate simplified shape graphs by jointly decomposing the…
Hypergraphs, encoding structured interactions among any number of system units, have recently proven a successful tool to describe many real-world biological and social networks. Here we propose a framework based on statistical inference to…
We study the fine-grained complexity of evaluating Boolean Conjunctive Queries and their generalization to sum-of-product problems over an arbitrary semiring. For these problems, we present a general semiring-oblivious reduction from the…
The omnipotence of copulas when modeling dependence given marg\-inal distributions in a multivariate stochastic situation is assured by the Sklar's theorem. Montes et al.\ (2015) suggest the notion of what they call an \emph{imprecise…
Implicit copulas are the most common copula choice for modeling dependence in high dimensions. This broad class of copulas is introduced and surveyed, including elliptical copulas, skew $t$ copulas, factor copulas, time series copulas and…
We study the structure of $r$-uniform hypergraphs containing no Berge cycles of length at least $k$ for $k \leq r$, and determine that such hypergraphs have some special substructure. In particular we determine the extremal number of such…
An $r$-uniform hypergraph $H$ consists of a set of vertices $V$ and a set of edges whose elements are $r$-subsets of $V$. We define a hypertree to be a connected hypergraph which contains no cycles. A hypertree spans a hypergraph $H$ if it…