Related papers: Sharpness of the Phase Transition for the Corrupte…
We consider the Boolean model $Z$ on $\mathbb{R}^d$ with random compact grains, i.e. $Z := \bigcup_{i \in \mathbb{N}} (X_i + Z_i)$ where $\eta_t := \{X_1, X_2, \dots\}$ is a Poisson point process of intensity $t$ and $(Z_1, Z_2, \dots)$ is…
We critically analyze the possibility of finding signatures of a phase transition by looking exclusively at static quantities of statistical systems, like e.g., the topology of potential energy sub-manifolds (PES). This topological…
Transition out of a topological phase is typically characterized by discontinuous changes in topological invariants along with bulk gap closings. However, as a clean system is geometrically punctured, it is natural to ask the fate of an…
We develop a fluctuation theory of connectivities for subcritical random cluster models. The theory is based on a comprehensive nonperturbative probabilistic description of long connected clusters in terms of essentially one-dimensional…
The phase behaviour of a weakly polydisperse system, such as a colloid with a small spread of particle sizes, can be related perturbatively to that of its monodisperse counterpart. I show how this approach can be generalized to remain…
We consider the level-sets of continuous Gaussian fields on $\mathbb{R}^d$ above a certain level $-\ell\in \mathbb{R}$, which defines a percolation model as $\ell$ varies. We assume that the covariance kernel satisfies certain regularity,…
It is well known that in a quantum phase transition (QPT), entanglement remains short ranged [Osterloh et al., Nature 416 608-610 (2005)]. We ask if there is a quantum property entailing the whole system which diverges near this point.…
An uncertain graph $\mathcal{G} = (V, E, p : E \rightarrow (0,1])$ can be viewed as a probability space whose outcomes (referred to as \emph{possible worlds}) are subgraphs of $\mathcal{G}$ where any edge $e\in E$ occurs with probability…
We present results from density functional theory and computer simulations that unambiguously predict the occurrence of first-order freezing transitions for a large class of ultrasoft model systems into cluster crystals. The clusters…
We study an inhomogeneous sparse random graph on [N] = {1, . . . , N } as introduced in a seminal paper by Bollobas, Janson and Riordan (2007): vertices have a type (here in a compact metric space S), and edges between different vertices…
We study parametric level statistics of the discretized excitation spectra inside a moving vortex core in layered superconductors with impurities. The universal conductivity is evaluated numerically for the various values of rescaled vortex…
The application of machine learning in the study of phase transitions has achieved remarkable success in both equilibrium and non-equilibrium systems. It is widely recognized that unsupervised learning can retrieve phase transition…
We fully characterize the nonasymptotic minimax separation rate for sparse signal detection in the Gaussian sequence model with $p$ equicorrelated observations, generalizing a result of Collier, Comminges, and Tsybakov. As a consequence of…
Vertex cover is one of the classical NP-complete problems in theoretical computer science. A vertex cover of a graph is a subset of vertices such that for each edge at least one of the two endpoints is contained in the subset. When studied…
We prove that every locally finite, quasi-transitive graph with a thick end whose cycle space is generated by cycles of bounded length contains the full-grid as an asymptotic minor and as a diverging minor. This in particular includes all…
The unified mathematical theory of gapped and gapless edges of 2d topological orders was developed by two of the authors. It provides a powerful tool to study pure edge topological phase transitions on the edges of 2d topological orders…
We consider vertex percolation on pseudo-random $d-$regular graphs. The previous study by the second author established the existence of phase transition from small components to a linear (in $\frac{n}{d}$) sized component, at…
We consider a large class of spatially-embedded random graphs that includes among others long-range percolation, continuum scale-free percolation and the age-dependent random connection model. We assume that the model is supercritical:…
This paper presents an empirical study of the relationship between the density of small-medium sized random graphs and their planarity. It is well known that, when the number of vertices tends to infinite, there is a sharp transition…
We consider a model of random permutations of the sites of the cubic lattice. Permutations are weighted so that sites are preferably sent onto neighbors. We present numerical evidence for the occurrence of a transition to a phase with…