Related papers: Phase transitions for the cavity approach to the c…
This paper proposes a new algorithm for solving maximal cliques for simple undirected graphs using the theory of prime numbers. A novel approach using prime numbers is used to find cliques and ends with a discussion of the algorithm.
Identifying causality is fundamental for human understanding of the world, where complex non-autonomous systems such as species population changes, brain activities, etc. are extensively existed. Since the phase spaces of such systems are…
We consider a generalised model of a random simplicial complex, which arises from a random hypergraph. Our model is generated by taking the downward-closure of a non-uniform binomial random hypergraph, in which for each $k$, each set of…
We investigate quantum phase transitions in the frustrated orthogonal-dimer chain with an arbitrary spin $S \geq 1/2$. When the ratio of the competing exchange couplings is varied, first-order phase transitions occur 2S times among distinct…
Motivated by the success of a k-clique percolation method for the identification of overlapping communities in large real networks, here we study the k-clique percolation problem in the Erdos-Renyi graph. When the probability p of two nodes…
In a network cliques are fully connected subgraphs that reveal which are the tight communities present in it. Cliques of size c>3 are present in random Erdos and Renyi graphs only in the limit of diverging average connectivity. Starting…
We study a generalization of the classical hidden clique problem to graphs with real-valued edge weights. Formally, we define a hypothesis testing problem. Under the null hypothesis, edges of a complete graph on $n$ vertices are associated…
We present an optical cavity QED configuration that is described by a dissipative version of the Lipkin-Meshkov-Glick model of an infinitely coordinated spin system. This open quantum system exhibits both first- and second-order…
The exponential family of random graphs represents an important and challenging class of network models. Despite their flexibility, conventionally used exponential random graphs have one shortcoming. They cannot directly model weighted…
Recently, a phase transition phenomenon has been established for parking on random trees. We extend the results of Curien and H\'enard on general Galton--Watson trees and allow different car arrival distributions depending on the vertex…
The Dicke model consisting of an ensemble of two-state atoms interacting with a single quantized mode of the electromagnetic field exhibits a zero-temperature phase transition at a critical value of the dipole coupling strength. We propose…
We consider a model for random hypergraphs with identifiability, an analogue of connectedness. This model has a phase transition in the proportion of identifiable vertices when the underlying random graph becomes critical. The phase…
Many problems of interest in computer science and information theory can be phrased in terms of a probability distribution over discrete variables associated to the vertices of a large (but finite) sparse graph. In recent years,…
The recent solution to the fermion sign problem allows, for the first time, the use of cluster algorithm techniques to compute certain fermionic path integrals. To illustrate the underlying ideas behind the progress, a cluster algorithm is…
We study a three-dimensional plaquette spin model whose low temperature dynamics is glassy, due to localised defects and effective kinetic constraints. While the thermodynamics of this system is smooth at all temperatures, we show that…
Symmetry constraints provide a powerful means to control the dynamics of open quantum systems. However, the set of accessible control parameters is often limited. Here, we show that a tunable phase in the collective light-matter coupling of…
Topological phase transitions challenge conventional paradigms in many-body physics by separating phases that are locally indistinguishable yet globally distinct. Using a quantum simulator of interacting erbium atoms in an optical lattice,…
Finding cliques in a graph has several applications for its pattern matching ability. $k$-clique problem, a special case of clique problem, determines whether an arbitrary graph contains a clique of size $k$, has already been addressed in…
A significant generalization of the Erd\"os-R\'enyi random graph model is an `inhomogeneous' random graph where the edge probabilities vary according to vertex types. We identify the threshold value for this random graph with a finite…
In this paper we study the computational-statistical gap of the planted clique problem, where a clique of size $k$ is planted in an Erdos Renyi graph $G(n,\frac{1}{2})$ resulting in a graph $G\left(n,\frac{1}{2},k\right)$. The goal is to…