Related papers: Phase transitions for the cavity approach to the c…
We present an asymptotically exact analysis of the problem of detecting communities in sparse random networks. Our results are also applicable to detection of functional modules, partitions, and colorings in noisy planted models. Using a…
One of the longstanding open problems in spectral graph clustering (SGC) is the so-called model order selection problem: automated selection of the correct number of clusters. This is equivalent to the problem of finding the number of…
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…
We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be…
We propose a scheme for realizing two-qubit quantum phase gates via an unconventional geometric phase shift with atoms in a cavity. In the scheme the atoms interact simultaneously with a highly detuned cavity mode and a classical field. The…
In this review article, we discuss connections between the physics of disordered systems, phase transitions in inference problems, and computational hardness. We introduce two models representing the behavior of glassy systems, the spiked…
The focus of this thesis is about statistical mechanics on heterogeneous random graphs, i.e. how this heterogeneity affects the cooperative behavior of model systems. It is not intended as a review on it, rather it is showed how this…
In this work, we consider the application of continuous time quantum walking(CTQW) to the Maximum Clique(MC) Problem. Performing CTQW on graphs will generate distinct periodic probability amplitude for different vertices. We will show that…
We show the application of permutation-invariant quantum circuits to the clique problem. The experiment asks to label a clique through identification of the nodes in a larger subgraph. The permutation-invariant quantum circuit outperforms a…
We have numerically studied the trapping problem in a two-dimensional lattice where particles are continuously generated. We have introduced interaction between particles and directionality of their movement. This model presents a critical…
A clique in an undirected graph G= (V, E) is a subset V' V of vertices, each pair of which is connected by an edge in E. The clique problem is an optimization problem of finding a clique of maximum size in graph. The clique problem is…
In 2002, Chung and Lu introduced a version of the Erdos-Renyi model which an edge between $i$ and $j$ is present with probability $p(i,j)$. They applied this model to compute the diameter of power-law random graphs, with yielded easier…
This is a status report on a companion subject to extremal combinatorics, obtained by replacing extremality properties with emergent structure, `phases'. We discuss phases, and phase transitions, in large graphs and large permutations,…
Sharp quantum phase transitions typically require a large system with many particles. Here we show that for a frustrated fully-connected Ising spin network represented by trapped atomic ions, the competition between different spin orders…
In this paper, we study the sensitivity of the spectral clustering based community detection algorithm subject to a Erdos-Renyi type random noise model. We prove phase transitions in community detectability as a function of the external…
We propose a scheme to implement a two-qubit controlled-phase gate for single atomic qubits, which works in principle with nearly ideal success probability and fidelity. Our scheme is based on the cavity input-output process and the single…
The exponential family of random graphs is one of the most promising class of network models. Dependence between the random edges is defined through certain finite subgraphs, analogous to the use of potential energy to provide dependence…
We identify the scaling limit of random intersection graphs inside their critical windows. The limit graphs vary according to the clustering regimes, and coincide with the continuum Erdos--Renyi graph in two out of the three regimes. Our…
We show that the effective spin-spin interaction between three-level atoms confined in a multimode optical cavity is long-ranged and sign-changing, like the RKKY interaction; therefore, ensembles of such atoms subject to frozen-in…
Crystals arise as the result of the breaking of a spatial translation symmetry. Similarly, translation symmetries can also be broken in time so that discrete time crystals appear. Here, we introduce a method to describe, characterize, and…