相关论文: Bicoloring Random Hypergraphs

We study the dynamics of a backtracking procedure capable of proving uncolourability of graphs, and calculate its average running time T for sparse random graphs, as a function of the average degree c and the number of vertices N. The…

We describe novel purification protocols for bicolorable graph states. The protocols scale efficiently for large graph states. We introduce a method of analysis that allows us to derive simple recursion relations characterizing their…

Graph coloring is a problem with varied applications in industry and science such as scheduling, resource allocation, and circuit design. The purpose of this paper is to establish if a new gradient based iterative solver framework known as…

In order to make more complex number-based strings from topological coding for defending against the intelligent attacks equipped with quantum computing and providing effective protection technology for the age of quantum computing, we will…

The use of tools from analysis to approach problems in graph theory has become an active area of research. Usually such methods are applied to problems involving dense graphs and hypergraphs; here we give the an extension of such methods to…

We consider two independent Erd\H{o}s-R\'enyi random graphs, with possibly different parameters, and study two isomorphism problems, a graph embedding problem and a common subgraph problem. Under certain conditions on the graph parameters…

Colouring sparse graphs under various restrictions is a theoretical problem of significant practical relevance. Here we consider the problem of maximizing the number of different colours available at the nodes and their neighbourhoods,…

In many data structure settings, it has been shown that using "double hashing" in place of standard hashing, by which we mean choosing multiple hash values according to an arithmetic progression instead of choosing each hash value…

We provide a "how-to" guide to the use and application of the Discharging Method. Our aim is not to exhaustively survey results proved by this technique, but rather to demystify the technique and facilitate its wider use, using applications…

We consider the algorithmic complexity of recognizing bipartite temporal graphs. Rather than defining these graphs solely by their underlying graph or individual layers, we define a bipartite temporal graph as one in which every layer can…

We consider the problem of $q$-colouring a $k$-uniform random hypergraph, where $q,k \geq 3$, and determine the rigidity threshold. For edge densities above the rigidity threshold, we show that almost all solutions have a linear number of…

We consider the task of detecting a hidden bipartite subgraph in a given random graph. This is formulated as a hypothesis testing problem, under the null hypothesis, the graph is a realization of an Erd\H{o}s-R\'{e}nyi random graph over $n$…

We investigate the distributions of the number of: (1) monochromatic complete subgraphs over edgewise 2-colorings of complete graphs; and (2) monochromatic arithmetic progressions over 2-colorings of intervals, as statistical Ramsey theory…

Graph-based semi-supervised learning usually involves two separate stages, constructing an affinity graph and then propagating labels for transductive inference on the graph. It is suboptimal to solve them independently, as the correlation…

Set-coloring a graph means giving each vertex a subset of a fixed color set so that no two adjacent subsets have the same cardinality. When the graph is complete one gets a new distribution problem with an interesting generating function.…

We address the problem of sampling colorings of a graph $G$ by Markov chain simulation. For most of the article we restrict attention to proper $q$-colorings of a path on $n$ vertices (in statistical physics terms, the one-dimensional…

We study the problem of counting $k$-hypergraphlets, an interesting but surprisingly ignored primitive, with the aim of understanding whether efficient algorithms exist. To this end, we consider color coding, a well-known technique for…

We investigate the joint distribution of the vertex degrees in three models of random bipartite graphs. Namely, we can choose each edge with a specified probability, choose a specified number of edges, or specify the vertex degrees in one…

We investigate the clustering transition undergone by an exemplary random constraint satisfaction problem, the bicoloring of $k$-uniform random hypergraphs, when its solutions are weighted non-uniformly, with a soft interaction between…

For many random Constraint Satisfaction Problems, by now, we have asymptotically tight estimates of the largest constraint density for which they have solutions. At the same time, all known polynomial-time algorithms for many of these…