Related papers: Generalized quasirandom properties of expanding gr…
Preferential attachment graphs are random graphs designed to mimic properties of typical real world networks. They are constructed by a random process that iteratively adds vertices and attaches them preferentially to vertices that already…
We conjecture that the distribution of the edge-disjoint union of two random regular graphs on the same vertex set is asymptotically equivalent to a random regular graph of the combined degree, provided it grows as the number of vertices…
We give variants of the Krein bound and the absolute bound for graphs with a spectrum similar to that of a strongly regular graph. In particular, we investigate what we call approximately strongly regular graphs. We apply our results to…
We prove that the properties of having small discrepancy and having small second eigenvalue are equivalent in Cayley graphs, extending a result of Kohayakawa, R\"odl, and Schacht, who treated the abelian case. The proof relies on…
We study the logical properties of infinite geometric random graphs, introduced by Bonato and Janssen. These are graphs whose vertex set is a dense ``generic'' subset of a metric space, where two vertices are adjacent with probability $p>0$…
Although the ``scale-free'' literature is large and growing, it gives neither a precise definition of scale-free graphs nor rigorous proofs of many of their claimed properties. In fact, it is easily shown that the existing theory has many…
In this manuscript we develop a version of Szemer\'edi's regularity lemma that is suitable for analyzing multicolorings of complete graphs and directed graphs. In this, we follow the proof of Alon, Fischer, Krivelevich and M. Szegedy…
A random vector whose norm and overlap (inner product with an independent copy) concentrates is shown to have random low-dimensional projections that are approximately random Gaussians. Conversely, asymptotically random Gaussian projections…
Spectral characterization of graphs is an important topic in spectral graph theory, which has received a lot of attention from researchers in recent years. It is generally very hard to show a given graph to be determined by its spectrum.…
We consider sparse random intersection graphs with the property that the clustering coefficient does not vanish as the number of nodes tends to infinity. We find explicit asymptotic expressions for the correlation coefficient of degrees of…
The bivariate distribution of degrees of adjacent vertices (degree-degree distribution) is an important network characteristic defining the statistical dependencies between degrees of adjacent vertices. We show the asymptotic degree-degree…
Random feature maps are ubiquitous in modern statistical machine learning, where they generalize random projections by means of powerful, yet often difficult to analyze nonlinear operators. In this paper, we leverage the "concentration"…
The literature on word-representable graphs is quite rich, and a number of variations of the original definition have been proposed over the years. We are initiating a systematic study of such variations based on formal languages. In our…
Highly-regular graphs can be regarded as a combinatorial generalization of distance-regular graphs. From this standpoint, we study combinatorial aspects of highly-regular graphs. As a result, we give the following three main results in this…
We study a family of directed random graphs whose arcs are sampled independently of each other, and are present in the graph with a probability that depends on the attributes of the vertices involved. In particular, this family of models…
Let G be a quasirandom graph on n vertices, and let W be a random walk on G of length alpha n^2. Must the set of edges traversed by W form a quasirandom graph? This question was asked by B\"ottcher, Hladk\'y, Piguet and Taraz. Our aim in…
We consider symmetric powers of a graph. In particular, we show that the spectra of the symmetric square of strongly regular graphs with the same parameters are equal. We also provide some bounds on the spectra of the symmetric squares of…
Graphs are used in many disciplines to model the relationships that exist between objects in a complex discrete system. Researchers may wish to compare a network of interest to a "typical" graph from a family (or ensemble) of graphs which…
We find an asymptotic enumeration formula for the number of simple $r$-uniform hypergraphs with a given degree sequence, when the number of edges is sufficiently large. The formula is given in terms of the solution of a system of equations.…
We consider a class of growing random graphs obtained by creating vertices sequentially one by one: at each step, we choose uniformly the neighbours of the newly created vertex; its degree is a random variable with a fixed but arbitrary…