Related papers: Sharpness of the Phase Transition for the Corrupte…

We consider random graphs with uniformly bounded edges on a Poisson point process conditioned to contain the origin. In particular we focus on the random connection model, the Boolean model and Miller-Abrahams random resistor network with…

Answering an open question from 2007, we construct infinite $k$-crossing-critical families of graphs that contain vertices of any prescribed odd degree, for any sufficiently large~$k$. To answer this question, we introduce several…

We show that, in almost every $n$-vertex random directed graph process, a copy of every possible $n$-vertex oriented cycle will appear strictly before a directed Hamilton cycle does, except of course for the directed cycle itself.…

The quantum phase transition (QPT) of the one-dimensional (1D) quantum compass model in a transverse magnetic field is studied in this paper. An exact solution is obtained by using an extended Jordan and Wigner transformation to the…

The low-energy spectra of many body systems on a torus, of finite size $L$, are well understood in magnetically ordered and gapped topological phases. However, the spectra at quantum critical points separating such phases are largely…

We study the fundamental tradeoffs between computational tractability and statistical accuracy for a general family of hypothesis testing problems with combinatorial structures. Based upon an oracle model of computation, which captures the…

We study the algorithmic tractability of finding large independent sets in dense random hypergraphs. In the sparse regime, much of the natural algorithms can be formulated within either the local or the low-degree polynomial (LDP)…

In this paper we propose a new type of random CSP model, called Model RB, which is a revision to the standard Model B. It is proved that phase transitions from a region where almost all problems are satisfiable to a region where almost all…

Using the finite-size scaling, we have investigated the percolation phase transitions of evolving random networks under a generalized Achlioptas process (GAP). During this GAP, the edge with minimum product of two connecting cluster sizes…

Consider subcritical Bernoulli bond percolation with fixed parameter p<p_c. We define a dependent site percolation model by the following procedure: for each bond cluster, we colour all vertices in the cluster black with probability r and…

A graph is Hamiltonian if it contains a cycle passing through every vertex. One of the cornerstone results in the theory of random graphs asserts that for edge probability $p \gg \frac{\log n}{n}$, the random graph $G(n,p)$ is…

The mincut graph bisection problem involves partitioning the n vertices of a graph into disjoint subsets, each containing exactly n/2 vertices, while minimizing the number of "cut" edges with an endpoint in each subset. When considered over…

We prove that a simple random walk on quasi-transitive graphs with the volume growth being faster than any polynomial of degree 4 has a.s. infinitely many cut times, and hence infinitely many cutpoints. This confirms a conjecture raised by…

The phase diagram of the Blume--Capel model on a semi--infinite simple cubic lattice with a (100) free surface is studied in the pair approximation of the cluster variation method. Six main topologies are found, of which two are new, due to…

In the bootstrap percolation model, sites in an L by L square are initially infected independently with probability p. At subsequent steps, a healthy site becomes infected if it has at least 2 infected neighbours. As (L,p)->(infinity,0),…

We prove that for a sequence of finite vertex-transitive graphs of increasing sizes, the cover times are asymptotically concentrated if and only if the product of the spectral-gap and the expected cover time diverges. In fact, we prove this…

The large N limit of a one-dimensional infinite chain of random matrices is investigated. It is found that in addition to the expected Kosterlitz--Thouless phase transition this model exhibits an infinite series of phase transitions at…

We investigate two separate notions of dynamical phase transitions in the two-dimensional nearest-neighbor transverse-field Ising model on a square lattice using matrix product states and a new \textit{hybrid} infinite time-evolving block…

In this paper, we investigate signatures of topological phase transitions in interacting systems. We show that the key signature is the existence of a topologically protected level crossing, which is robust and sharply defines the…

We consider the problem of clustering a graph $G$ into two communities by observing a subset of the vertex correlations. Specifically, we consider the inverse problem with observed variables $Y=B_G x \oplus Z$, where $B_G$ is the incidence…