Related papers: On the chromatic number in the stochastic block mo…
Motivated by applications, the last few years have witnessed tremendous interest in understanding the structure as well as the behavior of dynamics for inhomogeneous random graph models. In this study we analyze the maximal components at…
We extend the latent position random graph model to the line graph of a random graph, which is formed by creating a vertex for each edge in the original random graph, and connecting each pair of edges incident to a common vertex in the…
$\Lambda$-coalescents model the evolution of a coalescing system in which any number of blocks randomly sampled from the whole may merge into a larger block. For the coalescent restricted to initially $n$ singletons we study the collision…
This article explores and analyzes the unsupervised clustering of large partially observed graphs. We propose a scalable and provable randomized framework for clustering graphs generated from the stochastic block model. The clustering is…
We focus on spectral clustering of unlabeled graphs and review some results on clustering methods which achieve weak or strong consistent identification in data generated by such models. We also present a new algorithm which appears to…
We give a short proof of the following theorem due to Jon H. Folkman (1969): The chromatic number of any graph is at most $2$ plus the maximum over all subgraphs of the difference between half the number of vertices and the independence…
Erd\H{o}s proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers.
The determination of the quantum chromatic number of graphs has attracted considerable attention recently. However, there are few families of graphs whose quantum chromatic numbers are determined. A notable exception is the family of…
It is known (Bollob\'{a}s (1978); Kostochka and Mazurova (1977)) that there exist graphs of maximum degree $\Delta$ and of arbitrarily large girth whose chromatic number is at least $c \Delta / \log \Delta$. We show an analogous result for…
We study two weighted graph coloring problems, in which one assigns $q$ colors to the vertices of a graph such that adjacent vertices have different colors, with a vertex weighting $w$ that either disfavors or favors a given color. We…
We study the inhomogeneous random graphs in the subcritical case. We derive an exact formula for the size of the largest connected component scaled to $\log n$ where $n$ is the size of the graph. This generalizes the recent result for the…
We consider a random graph process in which, at each time step, a new vertex is added with m out-neighbours, chosen with probabilities proportional to their degree plus a strictly positive constant. We show that the expectation of the…
In this paper we find the asymptotic main term of the variance of the number of roots of Kostlan-Shub-Smale random polynomials and prove a central limit theorem for the number of roots as the degree goes to infinity.
The Sudoku number $s(G)$ of graph $G$ with chromatic number $\chi(G)$ is the smallest partial $\chi(G)$-colouring of $G$ that determines a unique $\chi(G)$-colouring of the entire graph. We show that the Sudoku number of the random…
Random graph models play a central role in network analysis. The Chung-Lu model, which connects nodes based on their expected degrees is of particular interest. It is widely used to generate null-graph models with expected degree sequences…
After the discovery of Khovanov homology, which categorifies the Jones polynomial, an analogous categorification of the chromatic polynomial, known as chromatic homology, was introduced. Its graded Euler characteristic recovers the…
Let $G$ be a simple connected graph of order $n$. A hamiltonian coloring $c$ of a graph $G$ is an assignment of colors (non-negative integers) to the vertices of $G$ such that $D(u, v)$ + $|c(u) - c(v)|$ $\geq$ $n - 1$ for every two…
We study the scenario of graph-based clustering algorithms such as spectral clustering. Given a set of data points, one first has to construct a graph on the data points and then apply a graph clustering algorithm to find a suitable…
We count the asymptotic number of triangles in uniform random graphs where the degree distribution follows a power law with degree exponent $\tau\in(2,3)$. We also analyze the local clustering coefficient $c(k)$, the probability that two…
We consider the chromatic number of the random Borsuk graph. The random Borsuk graph is obtained by sampling $n$ points i.i.d. uniformly at random on the $d$-dimensional sphere $S^d$, and joining a pair of points by an edge whenever their…