In this paper, we study phase transition behavior emerging from the interactions among multiple agents in the presence of noise. We propose a simple discrete-time model in which a...
Recent studies have shown that various models can explain the emergence of complex networks, such as scale-free and small-world networks. This paper presents a different model to...
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...