Related papers: Clique detection using symmetry-restricted quantum…
We present quantum algorithms for various problems related to graph connectivity. We give simple and query-optimal algorithms for cycle detection and odd-length cycle detection (bipartiteness) using a reduction to st-connectivity.…
The clique graph $kG$ of a graph $G$ has as its vertices the cliques (maximal complete subgraphs) of $G$, two of which are adjacent in $kG$ if they have non-empty intersection in $G$. We say that $G$ is clique convergent if $k^nG\cong k^m…
We determine when a permutation with cycle type $\mu$ admits a non-zero invariant vector in the irreducible representation $V_\lambda$ of the symmetric group. We find that a majority of pairs $(\lambda,\mu)$ have this property, with only a…
This manuscript provides a comprehensive review of the Maximum Clique Problem, a computational problem that involves finding subsets of vertices in a graph that are all pairwise adjacent to each other. The manuscript covers in a simple way…
In this paper we propose a new method for multiple change-point detection for piecewise-constant circular signals, a setting that, despite its importance in many scientific domains, remains comparatively under-explored. The proposed method,…
Many real-world networks were found to be highly clustered, and contain a large amount of small cliques. We here investigate the number of cliques of any size k contained in a geometric inhomogeneous random graph: a scale-free network model…
A general treatment of the spectral problem of quantum graphs and tight-binding models in finite Hilbert spaces is given. The direct spectral problem and the inverse spectral problem are written in terms of simple algebraic equations…
We provide a fast distributed algorithm for detecting $h$-cycles in the \textsf{Congested Clique} model, whose running time decreases as the number of $h$-cycles in the graph increases. In undirected graphs, constant-round algorithms are…
If $\Gamma$ is a graph for which every edge is in exactly one clique of order $\omega$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $\Gamma$. We discover many general…
Quantum annealing has the potential to find low energy solutions of NP-hard problems that can be expressed as quadratic unconstrained binary optimization problems. However, the hardware of the quantum annealer manufactured by D-Wave…
Variational quantum algorithms are the leading candidate for advantage on near-term quantum hardware. When training a parametrized quantum circuit in this setting to solve a specific problem, the choice of ansatz is one of the most…
In a sequence of multivariate observations or non-Euclidean data objects, such as networks, local dependence is common and could lead to false change-point discoveries. We propose a new way of permutation -- circular block permutation with…
Deep neural networks have been applied to a wide range of problems across different application domains with great success. Recently, research into combinatorial optimization problems in particular has generated much interest in the machine…
Cliques, or fully connected subgraphs, are among the most important and well-studied graph motifs in network science. We consider the problem of finding a statisti- cally anomalous clique hidden in a large network. There are two parts to…
We identify and study a particular class of distinguishability problems for quantum observables (POVMs), in which observables with permuted effects are involved, which we call as the labeling problem. Consequently, we identify the binary…
We consider the problem of quantum behavior in the finite background. Introduction of continuum or other infinities into physics leads only to technical complications without any need for them in description of empirical observations. The…
In this paper, we propose constructing self-referential instances to reveal the inherent algorithmic hardness of the clique problem. First, we prove the existence of a phase transition phenomenon for the clique problem in the…
We study permutation groups of given minimal degree without the classical primitivity assumption. We provide sharp upper bounds on the order of a permutation group of minimal degree m and on the number of its elements of any given support.…
The most important problem of spectroscopic chiral analysis is the inherently weak chiral signals are easily overwhelmed by the environment noises. Enormous efforts had been spent to overcome this problem by enhancing the symmetry break in…
We study graphs whose chromatic number is close to the order of the graph (the number of vertices). Both when the chromatic number is a constant multiple of the order and when the difference of the chromatic number and the order is a small…