Related papers: Critical time of the almost 2-regular random degre…

We perform an analytical analysis of the long-range degree correlation of the giant component in an uncorrelated random network by employing generating functions. By introducing a characteristic length, we find that a pair of nodes in the…

Two-dimensional (2D) disordered superconductor (SC) in class D exhibits a disorder-induced quantum multicritical phenomenon among diffusive thermal metal (DTM), topological superconductor (TS), and conventional localized (AI) phases. To…

Accurate estimation of the Worst-Case Deadline Failure Probability (WCDFP) has attracted growing attention as a means to provide safety assurances in complex systems such as robotic platforms and autonomous vehicles. WCDFP quantifies the…

We develop a general universality technique for establishing metric scaling limits of critical random discrete structures exhibiting mean-field behavior that requires four ingredients: (i) from the barely subcritical regime to the critical…

We consider percolation on high-dimensional product graphs, where the base graphs are regular and of bounded order. In the subcritical regime, we show that typically the largest component is of order logarithmic in the number of vertices.…

Consider a critical Erd\"os-R\'enyi random graph: $n$ is the number of vertices, each one of the $\binom{n}{2}$ possible edges is kept in the graph independently from the others with probability $n^{-1}+\lambda n^{-4/3}$, $\lambda$ being a…

Identifying the connected components of a graph, apart from being a fundamental problem with countless applications, is a key primitive for many other algorithms. In this paper, we consider this problem in parallel settings. Particularly,…

The edge of a quantum critical system can exhibit multiple distinct types of boundary criticality. We use a numerical real-space renormalization group (RSRG) to study the boundary criticality of a 2d quantum Ising model with random exchange…

We provide a complete description of the giant component of the Erd\H{o}s-R\'enyi random graph $G(n,p)$ as soon as it emerges from the scaling window, i.e., for $p = (1+\epsilon)/n$ where $\epsilon^3 n \to \infty$ and $\epsilon=o(1)$. Our…

We consider a random geometric graph obtained by placing a Poisson point process of intensity 1 in the d-dimensional torus of side length n^(1/d) and connecting two points by an edge if their distance is at most r. We consider the case of…

We study the two-dimensional contact process (CP) with quenched disorder (DCP), and determine the static critical exponents beta and nu_perp. The dynamic behavior is incompatible with scaling, as applied to models (such as the pure CP) that…

In Achlioptas processes, starting from an empty graph, in each step two potential edges are chosen uniformly at random, and using some rule one of them is selected and added to the evolving graph. Although the evolution of such `local'…

We investigate the random loop model on the $d$-ary tree. For $d \geq 3$, we establish a (locally) sharp phase transition for the existence of infinite loops. Moreover, we derive rigorous bounds that in principle allow to determine the…

In the Constrained-degree percolation model on a graph $(\mathbb{V},\mathbb{E})$ there are a sequence, $(U_e)_{e\in\mathbb{E}}$, of i.i.d. random variables with distribution $U[0,1]$ and a positive integer $k$. Each bond $e$ tries to open…

Motivated by applications, the last few years have witnessed tremendous interest in understanding the structure as well as the behavior of dynamics for inhomogeneous random graph models. In this study we analyze the maximal components at…

In 1998, Molloy and Reed showed that, under suitable conditions, if a sequence of degree sequences converges to a probability distribution $D$, then the size of the largest component in corresponding $n$-vertex random graph is…

The critical point degree of a periodic graph operator is the number of critical points of its complex Bloch variety. Determining it is a step towards the spectral edges conjecture and more generally understanding Bloch varieties. Previous…

A phase transition is an example of a ``topological defect'' in the space of parameters of a quantum or classical many-body systems. In this paper, we consider phase diagram topological defects of higher codimension. These have the property…

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…

In this paper we derive results concerning the connected components and the diameter of random graphs with an arbitrary i.i.d. degree sequence. We study these properties primarily, but not exclusively, when the tail of the degree…