Related papers: Phase transitions for the cavity approach to the c…
We study the planted clique problem in which a clique of size k is planted in an Erdos-Renyi graph G(n,1/2) and one is interested in recovering this planted clique. It is widely believed that it exhibits a statistical-computational gap when…
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…
The influence of uncorrelated, quenched disorder on the phase transition of two dimensional Potts models will be reviewed. After an introduction where the conditions of relevance of quenched randomness on phase transitions are exemplified…
Quantum electrodynamics of excitons in a cavity is shown to be relevant to quantum operations. We present a theory of an integrable solid-state quantum controlled-phase gate for generating entanglement of two photons using a coupled…
These lecture notes give a pedagogical introduction to phase transitions in disordered quantum systems and to the exotic Griffiths phases induced in their vicinity. We first review some fundamental concepts in the physics of phase…
A (unit) disk graph is the intersection graph of closed (unit) disks in the plane. Almost three decades ago, an elegant polynomial-time algorithm was found for \textsc{Maximum Clique} on unit disk graphs [Clark, Colbourn, Johnson; Discrete…
We discuss a phase transition in spin glass models which have been rarely considered in the past, namely the phase transition that may take place when two real replicas are forced to be at a larger distance (i.e. at a smaller overlap) than…
The latent stochastic block model is a flexible and widely used statistical model for the analysis of network data. Extensions of this model to a dynamic context often fail to capture the persistence of edges in contiguous network…
If a given behavior of a multi-agent system restricts the phase variable to a invariant manifold, then we define a phase transition as change of physical characteristics such as speed, coordination, and structure. We define such a phase…
The `random intersection graph with communities' models networks with communities, assuming an underlying bipartite structure of groups and individuals. Each group has its own internal structure described by a (small) graph, while groups…
We undertake a systematic numerical exploration of self-organized states in a deterministic model of interacting self-propelled particles in two dimensions. In the process, we identify various types of collective motion, namely, disordered…
This paper gives a way to simulate from the two star probability distribution on the space of simple graphs via auxiliary variables. Using this simulation scheme, the model is explored for various domains of the parameter values, and the…
In this paper we modify an algorithm for updating a maximal clique enumeration after an edge insertion to provide an algorithm that runs in linear time with respect to the number of cliques containing one of the edge's endpoints, whereas…
Two-qubit logical gates are proposed on the basis of two atoms trapped in a cavity setup. Losses in the interaction by spontaneous transitions are efficiently suppressed by employing adiabatic transitions and the Zeno effect. Dynamical and…
A transition from asymmetric to symmetric patterns in time-dependent extended systems is described. It is found that one dimensional cellular automata, started from fully random initial conditions, can be forced to evolve into complex…
A coarse-grained cellular automaton is proposed to simulate traffic systems. There, cells represent road sections. A cell can be in two states: jammed or passable. Numerical calculations are performed for a piece of square lattice with open…
A spin system is studied, with simultaneous permutation-symmetric Potts and spin-rotation-symmetric clock interactions, in spatial dimensions d=2 and 3. The global phase diagram is calculated from the renormalizaton-group solution with the…
We propose to employ the amplification mechanism of Grover's search algorithm to efficiently prepare entangled states of an ensemble of qubits. The conditional change of sign employed in the algorithm can be implemented by the phase shift…
We report on the phase transition of finding a complete subgraph, of specified dimensions, in a bipartite graph. Finding a complete subgraph in a bipartite graph is a problem that has growing attention in several domains, including…
In this paper we study the component structure of random graphs with independence between the edges. Under mild assumptions, we determine whether there is a giant component, and find its asymptotic size when it exists. We assume that the…