# Independent Sets of Random Trees and of Sparse Random Graphs

An independent set of size k in a finite undirected graph G is a set of k vertices of the graph, no two of which are connected by an edge. Let x_k(G) be the number of independent sets of size k in the graph G and let α(G)=max{k≥0 x_k(G)≠0}. In 1987, Alavi, Malde, Schwenk and Erdös asked if the independent set sequence x_0(G),x_1(G),…,x_α(G)(G) of a tree is unimodal (the sequence goes up and then down). This problem is still open. In 2006, Levit and Mandrescu showed that the last third of the independent set sequence of a tree is decreasing. We show that the first 46.8% of the independent set sequence of a random tree is increasing with (exponentially) high probability as the number of vertices goes to infinity. So, the question of Alavi, Malde, Schwenk and Erdös is “four-fifths true”, with high probability. We also show unimodality of the independent set sequence of Erdös-Renyi random graphs, when the expected degree of a single vertex is large (with (exponentially) high probability as the number of vertices in the graph goes to infinity, except for a small region near the mode). A weaker result is shown for random regular graphs. The structure of independent sets of size k as k varies is of interest in probability, statistical physics, combinatorics, and computer science.

research
08/03/2023

### Reconstruction of colours

Given a graph G, when is it possible to reconstruct with high probabilit...
research
07/29/2022

### Archaeology of random recursive dags and Cooper-Frieze random networks

We study the problem of finding the root vertex in large growing network...
research
08/10/2018

### A New Algorithm for the Robust Semi-random Independent Set Problem

In this paper, we study a semi-random version of the planted independent...
research
06/16/2022

### The convergent Indian buffet process

We propose a new Bayesian nonparametric prior for latent feature models,...
research
11/05/2021

### Strong Recovery In Group Synchronization

The group synchronization problem is to estimate unknown group elements ...
research
07/10/2022

### Large independent sets in Markov random graphs

Computing the maximum size of an independent set in a graph is a famousl...
research
12/10/2019

### Asymptotic performance of the Grimmett-McDiarmid heuristic

Grimmett and McDiarmid suggested a simple heuristic for finding stable s...