Related papers: Local algorithms for independent sets are half-opt…
Let $H_d(n,p)$ signify a random $d$-uniform hypergraph with $n$ vertices in which each of the ${n}\choose{d}$ possible edges is present with probability $p=p(n)$ independently, and let $H_d(n,m)$ denote a uniformly distributed with $n$…
We investigate the scaling of the largest critical percolation cluster on a large d-dimensional torus, for nearest-neighbor percolation in high dimensions, or when d>6 for sufficient spread-out percolation. We use a relatively simple…
The independence density of a finite hypergraph is the probability that a subset of vertices, chosen uniformly at random contains no hyperedges. Independence densities can be generalized to countable hypergraphs using limits. We show that,…
We prove that the maximum independent set approximation problem with polylogarithmic approximation factor is P-SLOCAL-complete. Thus an efficient algorithm for the maximum independent set approximation in the LOCAL model implies efficient…
We prove new lower bounds on the likely size of a maximum independent set in a random graph with a given average degree. Our method is a weighted version of the second moment method, where we give each independent set a weight based on the…
In graph theory, an independent set is a subset of nodes where there are no two adjacent nodes. The independent set is maximal if no node outside the independent set can join it. In network applications, maximal independent sets can be used…
We study the asymptotic behavior of the maximum interpoint distance of random points in a $d$-dimensional set with a unique diameter and a smooth boundary at the poles. Instead of investigating only a fixed number of $n$ points as $n$ tends…
Maximally recoverable codes are codes designed for distributed storage which combine quick recovery from single node failure and optimal recovery from catastrophic failure. Gopalan et al [SODA 2017] studied the alphabet size needed for such…
What is the maximum number of copies of a fixed forest $T$ in an $n$-vertex graph in a graph class $\mathcal{G}$ as $n\to \infty$? We answer this question for a variety of sparse graph classes $\mathcal{G}$. In particular, we show that the…
Given a graph $G$ of degree $k$ over $n$ vertices, we consider the problem of computing a near maximum cut or a near minimum bisection in polynomial time. For graphs of girth $2L$, we develop a local message passing algorithm whose…
We prove that, unless P=NP, there is no polynomial-time algorithm to approximate within some multiplicative constant the average size of an independent set in graphs of maximum degree 6. This is a special case of a more general result for…
Computing the size of maximum independent sets is a NP-hard problem for fixed graphs. Characterizing and designing efficient algorithms to estimate this independence number for random graphs are notoriously difficult and still largely open…
We analyze the asymptotic number and typical structure of claw-free graphs at constant edge densities. The first of our main results is a formula for the asymptotics of the logarithm of the number of claw-free graphs of edge density $\gamma…
It is shown that the following holds for each $\varepsilon>0$. For $G$ an $n$-vertex graph of maximum degree $D$ and "lists" $L_v$ ($v \in V(G)$) chosen independently and uniformly from the ($(1+\varepsilon)\ln n$)-subsets of $\{1, ...,…
The maximum independent set problem is one of the most important problems in graph algorithms and has been extensively studied in the line of research on the worst-case analysis of exact algorithms for NP-hard problems. In the weighted…
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…
We study the graph constructed on a Poisson point process in $d$ dimensions by connecting each point to the $k$ points nearest to it. This graph a.s. has an infinite cluster if $k > k_c(d)$ where $k_c(d)$, known as the critical value,…
Delattre et al. (2013) investigated asymptotic properties of the maximum likelihood estimator of the population parameters of the random effects associated with n independent stochastic differential equations (SDEs) assuming that the SDEs…
We study the algorithmic tractability of finding large independent sets in dense random hypergraphs. In the sparse regime, much of the natural algorithms can be formulated within either the local or the low-degree polynomial (LDP)…
We use Razborov's flag algebra method to show an asymptotic upper bound for the maximal induced density $i(\vec P_3)$ of the orgraph $\vec P_3$ in an arbitrary orgraph. A conjecture of Thomass\'e states that $i(\vec P_3)=2/5$. The hitherto…