Related papers: On Sidorenko's conjecture for determinants and Gau…
A graph $H$ is said to be positive if the homomorphism density $t_H(G)$ is non-negative for all weighted graphs $G$. The positive graph conjecture proposes a characterisation of such graphs, saying that a graph is positive if and only if it…
We establish a large deviation principle (LDP) for probability graphons, which are symmetric functions from the unit square into the space of probability measures. This notion extends classical graphons and provides a flexible framework for…
In this paper we study the threshold model of \emph{geometric inhomogeneous random graphs} (GIRGs); a generative random graph model that is closely related to \emph{hyperbolic random graphs} (HRGs). These models have been observed to…
An n-vertex graph is called C-Ramsey if it has no clique or independent set of size C log n. All known constructions of Ramsey graphs involve randomness in an essential way, and there is an ongoing line of research towards showing that in…
We study an inhomogeneous sparse random graph on [N] = {1, . . . , N } as introduced in a seminal paper by Bollobas, Janson and Riordan (2007): vertices have a type (here in a compact metric space S), and edges between different vertices…
An edge-weighted graph $G$, possibly with loops, is said to be antiferromagnetic if it has nonnegative weights and at most one positive eigenvalue, counting multiplicities. The number of graph homomorphisms from a graph $H$ to an…
Understanding the effects of the choice of the tree on the joint distribution of a tree-structured Markov random field (MRF) is crucial for fully exploiting the intelligibility of such probabilistic graphical models. Tools must be developed…
Random geometric graphs (RGGs) are commonly used to model networked systems that depend on the underlying spatial embedding. We concern ourselves with the probability distribution of an RGG, which is crucial for studying its random…
To an exact endofunctor of a triangulated category with a split-generator, the notion of entropy is given by Dimitrov-Haiden-Katzarkov-Kontsevich, which is a (possibly negative infinite) real-valued function of a real variable. In this…
We propose a generalization of the asymptotic equipartition property to discrete sources with an ambiguous alphabet, and prove that it holds for irreducible stationary Markov sources with an arbitrary distinguishability relation. Our…
A result due to Gy\'arf\'as, Hubenko, and Solymosi (answering a question of Erd\"os) states that if a graph $G$ on $n$ vertices does not contain $K_{2,2}$ as an induced subgraph yet has at least $c\binom{n}{2}$ edges, then $G$ has a…
A \emph{locally irregular graph} is a graph whose adjacent vertices have distinct degrees. We say that a graph $G$ can be decomposed into $k$ locally irregular subgraphs if its edge set may be partitioned into $k$ subsets each of which…
Information theoretic quantities play an important role in various settings in machine learning, including causality testing, structure inference in graphical models, time-series problems, feature selection as well as in providing privacy…
Pairwise Markov Random Fields (MRFs) or undirected graphical models are parsimonious representations of joint probability distributions. Variables correspond to nodes of a graph, with edges between nodes corresponding to conditional…
We study conditional independence relationships for random networks and their interplay with exchangeability. We show that, for finitely exchangeable network models, the empirical subgraph densities are maximum likelihood estimates of their…
Let $F$ be a global field. Let $G$ be a non trivial finite \'etale tame $F$-group scheme. We define height functions on the set of $G$-torsors over $F,$ which generalize the usual heights such as discriminant. As an analogue of the Malle…
Appearing in different format, Gupta\,(1967), Goldberg\,(1973), Andersen\,(1977), and Seymour\,(1979) conjectured that if $G$ is an edge-$k$-critical graph with $k \ge \Delta +1$, then $|V(G)|$ is odd and, for every edge $e$, $E(G-e)$ is a…
A concentration graph associated with a random vector is an undirected graph where each vertex corresponds to one random variable in the vector. The absence of an edge between any pair of vertices (or variables) is equivalent to full…
In this article, we first generalize Kaplansky's zero-divisor conjecture of group-rings $K[G]$ (with $K$ a field) to the more general setting of $G$-graded rings $R=\bigoplus\limits_{n\in G}R_{n}$ with $G$ a torsion-free group. Then we…
Ramsey's Theorem guarantees for every graph H that any 2-edge-coloring of a sufficiently large complete graph contains a monochromatic copy of H. In 1962, Erdos conjectured that the random 2-edge-coloring minimizes the number of…