相关论文: Rigidity percolation in a field

We study numerically the paramagnetic phase of the spin-1/2 random transverse-field Ising chain, using a mapping to non-interacting fermions. We extend our earlier work, Phys. Rev. 53, 8486 (1996), to finite temperatures and to dynamical…

Detailed study of centrality dependence of low-p_t manifestation of so-called "near-side ridge" phenomenon is reported recently by STAR for all charged hadrons with p_t>0.15 GeV/c from AuAu collisions at 62 and 200 GeV at RHIC[1]. It is…

A point process on the topological space S is at most countable subset without a random accumulation point in S. In studies of the point processes, there is a problem of seeing the properties of rigidity and tolerance, and this problem is…

We prove quasi-multiplicativity for critical level-sets of Gaussian free fields (GFF) on the metric graphs $\widetilde{\mathbb{Z}}^d$ ($d\ge 3$). Specifically, we study the probability of connecting two general sets located on opposite…

A graph is $\mathcal{R}_d$-independent (resp. $\mathcal{R}_d$-connected) if its $d$-dimensional generic rigidity matroid is free (resp. connected). A result of Maxwell from 1867 implies that every $\mathcal{R}_d$-independent graph satisfies…

The fault tolerance of random graphs with unbounded degrees with respect to connectivity is investigated, which relates to the reliability of wireless sensor networks with unreliable relay nodes. The model evaluates the network breakdown…

Let $(G_n)$ be a sequence of finite connected vertex-transitive graphs with volume tending to infinity. We say that a sequence of parameters $(p_n)$ is a percolation threshold if for every $\varepsilon > 0$, the proportion $\left\lVert K_1…

In dynamical percolation, the status of every bond is refreshed according to an independent Poisson clock. For graphs which do not percolate at criticality, the dynamical sensitivity of this property was analyzed extensively in the last…

For a compact set $E \subset \mathbb R^d$ and a connected graph $G$ on $k+1$ vertices, we define a $G$-framework to be a collection of $k+1$ points in $E$ such that the distance between a pair of points is specified if the corresponding…

Let a random geometric graph be defined in the supercritical regime for the existence of a unique infinite connected component in Euclidean space. Consider the first-passage percolation model with independent and identically distributed…

It is known that the critical probability for the percolation transition is not a sharp threshold, actually it is a region of non-zero width $\Delta p_c$ for systems of finite size. Here we present evidence that for complex networks $\Delta…

We investigate locality of the supercritical regime for Bernoulli percolation on transitive graphs with polynomial growth, by which we mean the following. Take a transitive graph of polynomial growth $\mathscr{G}$ satisfying…

We prove a Russo-Seymour-Welsch percolation theorem for nodal domains and nodal lines associated to a natural infinite dimensional space of real analytic functions on the real plane. More precisely, let $U$ be a smooth connected bounded…

Let $G$ be a vertex-transitive graph of superlinear polynomial growth. Given $r>0$, let $G_r$ be the graph on the same vertex set as $G$, with two vertices joined by an edge if and only if they are at graph distance at most $r$ apart in…

We analyze site percolation on directed and undirected graphs with site-dependent open-site probabilities. We construct upper bounds on cluster susceptibilities, vertex connectivity functions, and the expected number of simple open cycles…

The dynamics of supercritical fluids, a state of matter beyond the gas-liquid critical point, changes from diffusive to oscillatory motions at high pressure. This transition is believed to occur across a locus of thermodynamic states called…

In $H$-percolation, we start with an Erd\H{o}s--R\'enyi graph ${\mathcal G}_{n,p}$ and then iteratively add edges that complete copies of $H$. The process percolates if all edges missing from ${\mathcal G}_{n,p}$ are eventually added. We…

This Letter studies the critical point as well as the discontinuity of a class of explosive site percolation in Erd\"{o}s and R\'{e}nyi (ER) random network. The class of the percolation is implemented by introducing a best-of-m rule. Two…

Recently, ground state eigenvectors of the reduced Bardeen-Cooper-Schrieffer Hamiltonian, Richardson-Gaudin (RG) states, have been employed as a wavefunction ansatz for strong correlation. This wavefunction physically represents a…

We propose a distribution-free approach to the study of random geometric graphs. The distribution of vertices follows a Poisson point process with intensity function $nf(\cdot)$, where $n\in \mathbb{N}$, and $f$ is a probability density…