Related papers: Phase transitions for the cavity approach to the c…
Cavity quantum electrodynamics of multipartite systems is studied in depth, which consist of an arbitrary number of emitters in interaction with an arbitrary number of cavity modes. The governing model is obtained by taking the full…
In this paper a greedy algorithm to detect conflict cliques in interval graphs and circular-arc graphs is analyzed. In a graph, a stable set requires that at most one vertex is chosen for each edge. It is equivalent to requiring that at…
We study the problem of counting the number of {\em isomorphic} copies of a given {\em template} graph, say $H$, in the input {\em base} graph, say $G$. In general, it is believed that polynomial time algorithms that solve this problem…
The classical result of Erdos and Renyi shows that the random graph G(n,p) experiences sharp phase transition around p=1/n - for any \epsilon>0 and p=(1-\epsilon)/n, all connected components of G(n,p) are typically of size O(log n), while…
We study reconfiguration problems for cliques in a graph, which determine whether there exists a sequence of cliques that transforms a given clique into another one in a step-by-step fashion. As one step of a transformation, we consider…
Pinning particles at random in supercooled liquids is a promising route to make substantial progress on the glass transition problem. Here we develop a mean-field theory by studying the equilibrium and non-equilibrium dynamics of the…
We analyze the problem of identifying large cliques in graphs that are affected by adversarial uncertainty. More specifically, we consider a new formulation, namely the adversarial maximum clique problem, which extends the classical…
The emergence of complex behaviors in cellular automata is an area that has been widely developed in recent years with the intention to generate and analyze automata that produce space-moving patterns or gliders that interact in a periodic…
In this article we study algorithmic synthesis of the class of stabilizing switching signals for discrete-time switched linear systems proposed in [12]. A weighted digraph is associated in a natural way to a switched system, and the…
We show that a collection of independent Ising spins evolving stochastically can display surprisingly large fluctuations towards ordered behaviour, as quantified by certain types of time-integrated plaquette observables, despite the…
We propose a node clustering method for time-varying graphs based on the assumption that the cluster labels are changed smoothly over time. Clustering is one of the fundamental tasks in many science and engineering fields including signal…
We present a novel framework exploiting the cascade of phase transitions occurring during a simulated annealing of the Expectation-Maximisation algorithm to cluster datasets with multi-scale structures. Using the weighted local covariance,…
In this paper we give fast distributed graph algorithms for detecting and listing small subgraphs, and for computing or approximating the girth. Our algorithms improve upon the state of the art by polynomial factors, and for girth, we…
Problems based on the structure of graphs -- for example finding cliques, independent sets, or colourings -- are of fundamental importance in classical complexity. Defining well-formulated decision problems for quantum graphs, which are an…
Critical phase transitions have proven to be a powerful concept to capture the phenomenology of many systems, including deeply non-equilibrium ones like living systems. The study of these phase transitions has overwhelmingly relied on…
Causal Dynamical Triangulations (CDT) is a lattice approach to quantum gravity. CDT has rich phase structure, including a semiclassical phase consistent with Einstein's general relativity. Some of the observed phase transitions are second…
We analyze maximum entropy random graph ensembles with constrained degrees, drawn from arbitrary degree distributions, and a tuneable number of 3-loops (triangles). We find that such ensembles generally exhibit two transitions, a clustering…
The critical behaviour of the randomly spin-diluted Ising model in two space dimensions is investigated by a new method which combines a grand ensemble approach to disordered systems proposed by Morita with the phenomenological…
We present a new field theoretic approach for finite dimensional site disordered spin systems by introducing the notion of grand canonical disorder, where the number of spins in the system is random but quenched. We analyze this field…
We extend the newly proposed probability-changing cluster (PCC) Monte Carlo algorithm to the study of systems with the vector order parameter. Wolff's idea of the embedded cluster formalism is used for assigning clusters. The…