Related papers: Mixed Volume Techniques for Embeddings of Laman Gr…

A Laman graph $G$ is a minimally rigid graph in dimension two, and its realization number is its number of distinct embeddings with fixed generic edge lengths. While conjectured to grow exponentially in the number of vertices of $G$, the…

We show that the volumes of certain hyperbolic A-adequate links can be bounded (above and) below in terms of two diagrammatic quantities: the twist number and the number of certain alternating tangles in an A-adequate diagram. We then…

We revisit the problem of counting the number of copies of a fixed graph in a random graph or multigraph, including the case of constrained degrees. Our approach relies heavily on analytic combinatorics and on the notion of patchwork to…

Let $G$ be a connected undirected graph on $n$ vertices with no loops but possibly multiedges. Given an arithmetical structure $(\textbf{r}, \textbf{d})$ on $G$, we describe a construction which associates to it a graph $G'$ on $n-1$…

A unified framework for the Expander Mixing Lemma for irregular graphs using adjacency eigenvalues is presented, as well as two new versions of it. While the existing Expander Mixing Lemmas for irregular graphs make use of the notion of…

Feature extraction and dimension reduction for networks is critical in a wide variety of domains. Efficiently and accurately learning features for multiple graphs has important applications in statistical inference on graphs. We propose a…

This work is devoted to the study of the relationships between graph theory and the qualitative analysis of ordinary differential equations, with a special focus on two-dimensional systems. In particular, we reinterpret classical results…

Ribbon graphs embedded on a Riemann surface provide a useful way to describe the double line Feynman diagrams of large N computations and a variety of other QFT correlator and scattering amplitude calculations, e.g in MHV rules for…

Graphical models are a rich language for describing high-dimensional distributions in terms of their dependence structure. While there are algorithms with provable guarantees for learning undirected graphical models in a variety of…

Given a hyperbolic 3-manifold with torus boundary, we bound the change in volume under a Dehn filling where all slopes have length at least 2\pi. This result is applied to give explicit diagrammatic bounds on the volumes of many knots and…

We improve the best known upper bound on the number of edges in a unit-distance graph on $n$ vertices for each $n\in\{16,\ldots,30\}$. When $n\leq 21$, our bounds match the best known lower bounds, and we fully enumerate the densest…

Just as semantic hashing can accelerate information retrieval, binary valued embeddings can significantly reduce latency in the retrieval of graphical data. We introduce a simple but effective model for learning such binary vectors for…

We study the problem of recovering a collection of $n$ numbers from the evaluation of $m$ power sums. This yields a system of polynomial equations, which can be underconstrained ($m < n$), square ($m = n$), or overconstrained ($m > n$).…

In this paper, we study the Bernstein polynomial model for estimating the multivariate distribution functions and densities with bounded support. As a mixture model of multivariate beta distributions, the maximum (approximate) likelihood…

Hyperbolic geometry has emerged as an effective latent space for representing complex networks, owing to its ability to capture hierarchical organization and heterogeneous connectivity patterns using low-dimensional embeddings. As a result,…

In this paper, we consider the problems of enumerating minimal vertex covers and minimal dominating sets with capacity and/or connectivity constraints. We develop polynomial-delay enumeration algorithms for these problems on bounded-degree…

We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…

We investigate novel random graph embeddings that can be computed in expected polynomial time and that are able to distinguish all non-isomorphic graphs in expectation. Previous graph embeddings have limited expressiveness and either cannot…

We prove matching asymptotic lower and upper bounds on the variances of the intrinsic volumes and the number of $k$-faces of $d$-dimensional random beta-polytopes. Using Stein's methods, we establish central limit theorems for the intrinsic…

Euclidean embeddings of data are fundamentally limited in their ability to capture latent semantic structures, which need not conform to Euclidean spatial assumptions. Here we consider an alternative, which embeds data as discrete…