相关论文: Spectrum and local weak convergence of sparse rand…

The $r$-color size-Ramsey number of a $k$-uniform hypergraph $H$, denoted by $\hat{R}_r(H)$, is the minimum number of edges in a $k$-uniform hypergraph $G$ such that for every $r$-coloring of the edges of $G$ there exists a monochromatic…

Using the replica method, we develop an analytical approach to compute the characteristic function for the probability $\mathcal{P}_N(K,\lambda)$ that a large $N \times N$ adjacency matrix of sparse random graphs has $K$ eigenvalues below a…

We study subgraphs of Paley graphs of prime order $p$ induced on the sets of vertices extending a given independent set of size $a$ to a larger independent set. Using a sufficient condition proved in the author's recent companion work, we…

In this paper, we provide an $O(n \mathrm{polylog} n)$ bound on the expected complexity of the randomly weighted Voronoi diagram of a set of $n$ sites in the plane, where the sites can be either points, interior-disjoint convex sets, or…

We consider general Exponential Random Graph Models (ERGMs) where the sufficient statistics are functions of homomorphism counts for a fixed collection of simple graphs $F_k$. Whereas previous work has shown a degeneracy phenomenon in dense…

For random combinatorial optimization problems, there has been much progress in establishing laws of large numbers and computing limiting constants for the optimal value of various problems. However, there has not been as much success in…

We consider the statistics of the extreme eigenvalues of sparse random matrices, a class of random matrices that includes the normalized adjacency matrices of the Erd{\H o}s-R{\'e}nyi graph $G(N,p)$. Recently, it was shown by Lee, up to an…

We consider a variation of the spectral sparsification problem where we are required to keep a subgraph of the original graph. Formally, given a union of two weighted graphs $G$ and $W$ and an integer $k$, we are asked to find a $k$-edge…

Let $\mathcal{C}(n,k)$ be the set of $k$-dimensional simplicial complexes $C$ over a fixed set of $n$ vertices such that: (1) $C$ has a complete $k-1$-skeleton; (2) $C$ has precisely ${{n-1}\choose {k}}$ $k$-faces; (3) the homology group…

In a recent breakthrough, Kelley and Meka (FOCS 2023) obtained a strong upper bound on the density of sets of integers without nontrivial three-term arithmetic progressions. In this work, we extend their result, establishing similar bounds…

Let p(k) denote the partition function of k. For each k >= 2, we describe a list of p(k)-1 quasirandom properties that a k-uniform hypergraph can have. Our work connects previous notions on linear hypergraph quasirandomness of…

We study ensembles of sparse random block matrices generated from the adjacency matrix of a Erd\"os-Renyi random graph with $N$ vertices of average degree $Z$, inserting a real symmetric $d \times d$ random block at each non-vanishing…

A new approach to prove weak convergence of random polytopes on the space of compact convex sets is presented. This is used to show that the profile of the rescaled Schl\"afli random cone of a random conical tessellation generated by $n$…

Consider a simple locally finite hypergraph on a countable vertex set, where each edge represents one unit of load which should be distributed among the vertices defining the edge. An allocation of load is called balanced if load cannot be…

Let $S_n f$ be the $n$th partial sum of the Fourier series of a function $f$ in $L^1(\D)$, where $\D$ is the ring of integers of a local field $K$. For $1<p<\infty$, we characterize all weight functions $w$ so that the partial sum operators…

In this paper, we study two examples of minimum weight random graphs with edge constraints. First we consider the complete graph on ${n}$ vertices equipped with uniformly heavy edge weights and use iteration methods to obtain deviation…

Given a weighted graph $G$ and an error parameter $\epsilon > 0$, the {\em graph sparsification} problem requires sampling edges in $G$ and giving the sampled edges appropriate weights to obtain a sparse graph $G_{\epsilon}$ (containing…

Cumulative weight enumerators of random linear codes are introduced, their asymptotic properties are studied, and very sharp thresholds are exhibited; as a consequence, it is shown that the asymptotic Gilbert-Varshamov bound is a very sharp…

We contribute an approach to the problem of locally computing sparse connected subgraphs of dense graphs. In this setting, given an edge in a connected graph $G = (V, E)$, an algorithm locally decides its membership in a sparse connected…

We consider eigenvectors of adjacency matrices of Erd\H{o}s-R\'{e}nyi graphs and study the variation of their directions by resampling the entries randomly. Let $\mathbf{v}$ be the eigenvector associated with the second-largest eigenvalue…