Related papers: On Sidorenko's conjecture for determinants and Gau…

Let $G/\Gamma$ be the quotient of a semisimple Lie group by an arithmetic lattice. We show that for reductive subgroups $H$ of $G$ that is large enough, the orbits of $H$ on $G/\Gamma$ intersect nontrivially with a fixed compact set. As a…

We propose the following conjecture extending Dirac's theorem: if $G$ is a graph with $n\ge 3$ vertices and minimum degree $\delta(G)\ge n/2$, then in every orientation of $G$ there is a Hamilton cycle with at least $\delta(G)$ edges…

We study Markov population processes on large graphs, with the local state transition rates of a single vertex being linear function of its neighborhood. A simple way to approximate such processes is by a system of ODEs called the…

We consider the geometric random (GR) graph on the $d-$dimensional torus with the $L_\sigma$ distance measure ($1 \leq \sigma \leq \infty$). Our main result is an exact characterization of the probability that a particular labeled cycle…

With a sequence of regressions, one may generate joint probability distributions. One starts with a joint, marginal distribution of context variables having possibly a concentration graph structure and continues with an ordered sequence of…

Breaking of equivalence between the microcanonical ensemble and the canonical ensemble, describing a large system subject to hard and soft constraints, respectively, was recently shown to occur in large random graphs. Hard constraints must…

We consider the number of common edges in two independent random spanning trees of a graph $G$. For complete graphs $K_n$, we give a new proof of the fact, originally obtained by Moon, that the distribution converges to a Poisson…

Methods for inference and simulation of linearly constrained Gaussian Markov Random Fields (GMRF) are computationally prohibitive when the number of constraints is large. In some cases, such as for intrinsic GMRFs, they may even be…

Let $G=(V,E)$ be a finite, connected graph. We investigate a notion of boundary $\partial G \subseteq V$ and argue that it is well behaved from the point of view of potential theory. This is done by proving a number of discrete analogous of…

In this paper, we study the well-known Kohayakawa-Nagle-R{\"o}dl-Schacht (KNRS) conjecture, with a specific focus on graph subdivisions. The KNRS conjecture asserts that for any graph $H$, locally dense graphs contain asymptotically at…

Eggert's Conjecture says that if R is a finite-dimensional nilpotent commutative algebra over a perfect field F of characteristic p, and R^{(p)} is the image of the p-th power map on R, then dim_F R \geq p dim_F R^{(p)}. Whether this very…

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…

Let $H$ and $G$ be two finite graphs. Define $h_H(G)$ to be the number of homomorphisms from $H$ to $G$. The function $h_H(\cdot)$ extends in a natural way to a function from the set of symmetric matrices to $\mathbb{R}$ such that for…

Let $G$ be a graph with $n$ vertices and $m$ edges. The spectral radius $\rho(G)$ of $G$ is the largest eigenvalue of the adjacency matrix of $G$. As is well known, $\rho(G)\geq\frac{2m}{n}$ with equality if and only if $G$ is regular. To…

We introduce Markov Random Geometric Graphs (MRGGs), a growth model for temporal dynamic networks. It is based on a Markovian latent space dynamic: consecutive latent points are sampled on the Euclidean Sphere using an unknown Markov…

An $n$-vertex graph is called $C$-Ramsey if it has no clique or independent set of size $C\log_2 n$ (i.e., if it has near-optimal Ramsey behavior). In this paper, we study edge-statistics in Ramsey graphs, in particular obtaining very…

Liu, Hong, Gu, and Lai proved if the second largest eigenvalue of the adjacency matrix of graph $G$ with minimum degree $\delta \ge 2m+2 \ge 4$ satisfies $\lambda_2(G) < \delta - \frac{2m+1}{\delta+1}$, then $G$ contains at least $m+1$…

We consider homogenization of random surfaces and study the variational principle for graph homomorphisms from subsets of $\mathbb{Z}^m$ into $\mathbb{Z}$, where the underlying uniform measure is perturbed by a random field. Motivated by…

We prove that every $n$-vertex $K_t$-minor-free graph $G$ of maximum degree $\Delta$ has a set $F$ of $O(t^2(\log t)^{1/4}\sqrt{\Delta n})$ edges such that every component of $G - F$ has at most $n/2$ vertices. This is best possible up to…

Centered Gaussian random fields (GRFs) indexed by compacta such as smooth, bounded Euclidean domains or smooth, compact and orientable manifolds are determined by their covariance operators. We consider centered GRFs given as variational…