Related papers: Sharpness of the Phase Transition for the Corrupte…
In this paper we study sharp thresholds for detecting sparse signals in $\beta$-models for potentially sparse random graphs. The results demonstrate interesting interplay between graph sparsity, signal sparsity, and signal strength. In…
We introduce an evolving network model in which a new node attaches to a randomly selected target node and also to each of its neighbors with probability $p$. The resulting network is sparse for $p<\frac{1}{2}$ and dense (average degree…
We instigate the properties of the threshold contact process (TCP), a process showing an absorbing-state phase transition with infinitely many absorbing states, on random complex networks. The finite size scaling exponents characterizing…
We analyze the asymptotic states in the partially ordered phase of a system of globally coupled logistic maps. We confirm that, regardless of initial conditions, these states consist of a few clusters, and they properly belong in the…
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…
We show that sharply defined topological quantum phase transitions are not limited to states of matter with gapped electronic spectra. Such transitions may also occur between two gapless metallic states both with extended Fermi surfaces.…
In this paper, we study the high-order phase transition in random $r$-uniform hypergraphs. For a positive integer $n$ and a real $p\in [0,1]$, let $H:=H^r(n,p)$ be the random $r$-uniform hypergraph with vertex set $[n]$, where each $r$-set…
By constructing an exactly solvable spin model, we investigate the critical behaviors of transverse field Ising chains interpolated with cluster interactions, which exhibit various types of topologically distinct Ising critical points.…
The interaction between transitivity and sparsity, two common features in empirical networks, implies that there are local regions of large sparse networks that are dense. We call this the blessing of transitivity and it has consequences…
We prove the sharpness of the phase transition for speed in the biased random walk on the supercritical percolation cluster on Z^d. That is, for each d at least 2, and for any supercritical parameter p > p_c, we prove the existence of a…
We prove that for supercritical percolation on every infinite transitive graph, the probability that the origin belongs to a finite cluster of size at least $n$ decays exponentially in $\Phi(n)$, where $\Phi$ is the isoperimetric function…
The stochastic block model is a canonical random graph model for clustering and community detection on network-structured data. Decades of extensive study on the problem have established many profound results, among which the phase…
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…
We prove sharp bounds on the probability that the simple random walk on a vertex-transitive graph escapes the ball of radius $r$ before returning to its starting point. In particular, this shows that if the ball of radius $r$ has size…
We characterize phases of the compass ladder model by using degenerate perturbation theory, symmetry fractionalization, and numerical techniques. Through degenerate perturbation theory we obtain an effective Hamiltonian for each phase of…
We study topological transitions in one dimensional superconductors that can harbor multiple edge Majorana bound states protected by chiral symmetry. The chiral symmetry arises due to the structure of the internal spin degrees of freedom of…
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edges are far from independent, and to prove several results…
Let $\mathbb{S}_g$ be the orientable surface of genus $g$. We prove that the component structure of a graph chosen uniformly at random from the class $\mathcal{S}_g(n,m)$ of all graphs on vertex set $[n]=\{1,\dotsc,n\}$ with $m$ edges…
We present a comprehensive and versatile theoretical framework to study site and bond percolation on clustered and correlated random graphs. Our contribution can be summarized in three main points. (i) We introduce a set of iterative…
We study the percolation properties of graph partitioning on random regular graphs with N vertices of degree $k$. Optimal graph partitioning is directly related to optimal attack and immunization of complex networks. We find that for any…