Related papers: Quantitative Edge Eigenvector Universality for Ran…

Compared to the classical binomial random (hyper)graph model, the study of random regular hypergraphs is made more challenging due to correlations between the occurrence of different edges. We develop an edge-switching technique for…

Testing network effects in weighted directed networks is a foundational problem in econometrics, sociology, and psychology. Yet, the prevalent edge dependency poses a significant methodological challenge. Most existing methods are…

A bipartite graph $G$ is semi-algebraic in $\mathbb{R}^d$ if its vertices are represented by point sets $P,Q \subset \mathbb{R}^d$ and its edges are defined as pairs of points $(p,q) \in P\times Q$ that satisfy a Boolean combination of a…

Given a graph $H$, a balanced subdivision of $H$ is obtained by replacing all edges of $H$ with internally disjoint paths of the same length. In this paper, we prove that for any graph $H$, a linear-in-$e(H)$ bound on average degree…

An exchangeable pair approach is commonly taken in the normal and non-normal approximation using Stein's method. It has been successfully used to identify the limiting distribution and provide an error of approximation. However, when the…

Jiang, Tidor, Yao, Zhang, and Zhao recently showed that connected bounded degree graphs have sublinear second eigenvalue multiplicity (always referring to the adjacency matrix). This result was a key step in the solution to the problem of…

We give a nonuniform Berry-Esseen bound for self-normalized martingales, which bridges the gap between the result of Haeusler (1988) and Fan and Shao (2018). The bound coincides with the nonuniform Berry-Esseen bound of Haeusler and Joos…

In a recent paper, Caro, Lauri, Mifsud, Yuster, and Zarb ask which parameters $r$ and $c$ admit the existence of an $r$-regular graph such that the neighborhood of each vertex induces exactly $c$ edges. They show that every $r$ with $c$…

A graph $G$ is $\textit{universal}$ for a (finite) family $\mathcal{H}$ of graphs if every $H \in \mathcal{H}$ is a subgraph of $G$. For a given family $\mathcal{H}$, the goal is to determine the smallest number of edges an…

We generalise a theorem of Engman and Abreu--Freitas on the first invariant eigenvalue of non-negatively curved $S^{1}$-invariant metrics on $\mathbb{CP}^{1}$ to general toric K\"ahler metrics with non-negative scalar curvature. In…

Recently, Bollob\'as, Janson and Riordan introduced a very general family of random graph models, producing inhomogeneous random graphs with $\Theta(n)$ edges. Roughly speaking, there is one model for each {\em kernel}, i.e., each symmetric…

Sharp bounds on the least eigenvalue of an arbitrary graph are presented. Necessary and sufficient (just sufficient) conditions for the lower (upper) bound to be attained are deduced using edge clique partitions. As an application, we prove…

We consider the problem of achieving average consensus in the minimum number of linear iterations on a fixed, undirected graph. We are motivated by the task of deriving lower bounds for consensus protocols and by the so-called "definitive…

We prove that the optimal constant in the Lieb--Thirring inequality on a star graph with $N$ edges coincides with that on $\mathbb R$ if $N$ is even. For odd $N$ we show that this property holds when restricting to radial potentials and we…

We study the problem of estimating the number of edges in an unknown graph. We consider a hybrid model in which an algorithm may issue independent set, degree, and neighbor queries. We show that this model admits strictly more efficient…

An analogue of the Berry-Esseen inequality is proved for the speed of convergence of free additive convolutions of bounded probability measures. The obtained rate of convergence is of the order n^{-1/2}, the same as in the classical case.…

Let $\mathcal A$ be the adjacency matrix of the Erd\H{o}s-R\'{e}nyi directed graph $\mathscr G(N,p)$. We denote the eigenvalues of $\mathcal A$ by $\lambda_1^{\cal A},...,\lambda^{\cal A}_N$, and $|\lambda_1^{\cal A}|=\max_i|\lambda_i^{\cal…

We use the polynomial method of Guth and Katz to establish stronger and {\it more efficient} regularity and density theorems for such $k$-uniform hypergraphs $H=(P,E)$, where $P$ is a finite point set in ${\mathbb R}^d$, and the edge set…

We study the problem of detecting local geometry in random graphs. We introduce a model $\mathcal{G}(n, p, d, k)$, where a hidden community of average size $k$ has edges drawn as a random geometric graph on $\mathbb{S}^{d-1}$, while all…

We obtain sharp convergence rates, using Dirichlet correctors, for solutions of wave equations in a bounded domain with rapidly oscillating periodic coefficients. The results are used to prove the exact boundary controllability that is…