Related papers: Hypergraphs in the characterization of regular vin…
Graphs are ubiquitous data structures for representing interactions between entities. With an emphasis on the use of graphs to represent chemical molecules, we explore the task of learning to generate graphs that conform to a distribution…
We study the problems of bounding the number weak and strong independent sets in $r$-uniform, $d$-regular, $n$-vertex linear hypergraphs with no cross-edges. In the case of weak independent sets, we provide an upper bound that is tight up…
Copulas are known to satisfy a number of regularity properties, and one might therefore believe that their densities, when they exist, admit a certain degree of regularity themselves. We show that this is not true in general by constructing…
In situations where both extreme and non-extreme data are of interest, modelling the whole data set accurately is important. In a univariate framework, modelling the bulk and tail of a distribution has been extensively studied before.…
Copulas are mathematical objects that fully capture the dependence structure among random variables and hence, offer a great flexibility in building multivariate stochastic models. In statistics, a copula is used as a general way of…
Most popular dimension reduction (DR) methods like t-SNE and UMAP are based on minimizing a cost between input and latent pairwise similarities. Though widely used, these approaches lack clear probabilistic foundations to enable a full…
A hypergraph $\mathcal{H}=(V,\mathcal{E})$ is a hypertree if it admits a tree $T$ with vertex set $V$ such that every edge of $\mathcal{H}$ induces a subtree of $T$. A tree like that is called a host tree. Several characterizations and…
We develop a shape analysis for reasoning about relational properties of data structures. Both the concrete and the abstract domain are represented by hypergraphs. The analysis is parameterized by user-supplied indexed graph grammars to…
There exist many bivariate parametric copulas to model bivariate data with different dependence features. We propose a new bivariate parametric copula family that cannot only handle various dependence patterns that appear in the existing…
We give a systematic approach to constructing non-reduced, locally Cohen-Macaulay schemes with reduced support a smooth projective variety. The hierarchy of such structures includes a lot of information about the underlying variety, its…
A hypergraph is linear if each pair of distinct vertices appears in at most one common edge. We say $\varGamma=(V,E)$ is an associated graph of a linear hypergraph $\mathcal{H}=(V, X)$ if for any $x\in X$, the induced subgraph…
We propose a generalization of the concept of a Ribbon graph suitable to provide combinatorial models for marked surfaces equipped with a G-structure. Our main insight is that the necessary combinatorics is neatly captured in the concept of…
Deep generative models offer powerful tools for multivariate data analysis, but their black-box architectures are often unidentified and difficult to interpret. We introduce the Deep Discrete Encoder (DDE) Copula, an identifiable and…
It is shown on the examples of Moore and Gosper curves that two spatially shifted or twisted, pre-asymptotic space-filling curves can produce large-scale superstructures akin to moir\'e patterns. To study physical phenomena emerging from…
This paper proposes a regression tree procedure to estimate conditional copulas. The associated algorithm determines classes of observations based on covariate values and fits a simple parametric copula model on each class. The association…
In this paper we are interested in decomposing a dihypergraph $\mathcal{H} = (V, \mathcal{E})$ into simpler dihypergraphs, that can be handled more efficiently. We study the properties of dihypergraphs that can be hierarchically decomposed…
The diversity of neuron models used in contemporary theoretical neuroscience to investigate specific properties of covariances raises the question how these models relate to each other. In particular it is hard to distinguish between…
Twin-width is a structural width parameter introduced by Bonnet, Kim, Thomass\'e and Watrigant [FOCS 2020]. Very briefly, its essence is a gradual reduction (a contraction sequence) of the given graph down to a single vertex while…
Classical models for multivariate or spatial extremes are mainly based upon the asymptotically justified max-stable or generalized Pareto processes. These models are suitable when asymptotic dependence is present, i.e., the joint tail…
This paper is the second in a series of papers which combine graphical modelling and marked spatial point patterns. Extending the previous results of \cite Eckardt (2016a), we introduce a marked spatial dependence graph model which depicts…