Comparison of rigidity and connectivity percolation in two dimensions

Discretized landscapes can be mapped onto ranked surfaces, where every element (site or bond) has a unique rank associated with its corresponding relative height. By sequentially allocating these elements according to their ranks and systematically preventing the occupation of bridges, namely elements that, if occupied, would provide global connectivity, we disclose that bridges hide a new tricritical point at an occupation fraction $p=p_{c}$, where $p_{c}$ is the percolation...

Rigidity Percolation with g degrees of freedom per site is analyzed on randomly diluted Erdos-Renyi graphs with average connectivity gamma, in the presence of a field h. In the (gamma,h) plane, the rigid and flexible phases are separated by a line of first-order transitions whose location is determined exactly. This line ends at a critical point with classical critical exponents. Analytic expressions are given for the densities n_f of uncanceled degrees of freedom and gamma_r...

We argue that the elastic backbone (EB) (union of shortest paths) on a cylindrical system, recently studied by Sampaio Filho et al. [Phys. Rev. Lett. 120, 175701 (2018)], is in fact the backbone of two-dimensional directed percolation (DP). We simulate the EB on the same system as considered by these authors, and also study the DP backbone directly using an algorithm that allows backbones to be generated in a completely periodic manner. We find that both the EB in the bulk an...

We study the history-dependent percolation in two dimensions, which evolves in generations from standard bond-percolation configurations through iteratively removing occupied bonds. Extensive simulations are performed for various generations on periodic square lattices up to side length $L=4096$. From finite-size scaling, we find that the model undergoes a continuous phase transition, which, for any finite number of generations, falls into the universality of standard 2D perc...

The phenomenon of percolation is one of the core topics in statistical mechanics. It allows one to study the phase transition known in real physical systems only in a purely geometrical way. And three things are unavoidable: death, paying taxes, and excepting universal formula for percolation thresholds. Anyway, in this paper, we try to solve the third of the enumerated problems and determine thresholds $p_c$ for random site percolation in triangular and honeycomb lattices fo...

We study the nature of the frictional jamming transition within the framework of rigidity percolation theory. Slowly sheared frictional packings are decomposed into rigid clusters and floppy regions with a generalization of the pebble game including frictional contacts. We discover a second-order transition controlled by the emergence of a system-spanning rigid cluster accompanied by a critical cluster size distribution. Rigid clusters also correlate with common measures of r...

We first introduce the percolation problems associated with the graph theoretical concepts of $(k,l)$-sparsity, and make contact with the physical concepts of ordinary and rigidity percolation. We then devise a renormalization transformation for $(k,l)$-percolation problems, and investigate its domain of validity. In particular, we show that it allows an exact solution of $(k,l)$-percolation problems on hierarchical graphs, for $k\leq l<2k$. We introduce and solve by renormal...

The stochastic addition of either vertices or connections in a network leads to the observation of the percolation transition, a structural change with the appearance of a connected component encompassing a finite fraction of the system. Percolation has always been regarded as a substrate-dependent but model-independent process, in the sense that the critical exponents of the transition are determined by the geometry of the system, but they are identical for the bond and site...

To investigate the network-growth rule dependence of certain geometric aspects of percolation clusters, we propose a generalized network-growth rule introducing a generalized parameter $q$ and we study the time evolution of the network. The rule we propose includes a rule in which elements are randomly connected step by step and the rule recently proposed by Achlioptas {\it et al.} [Science {\bf 323} (2009) 1453]. We consider the $q$-dependence of the dynamics of the number o...

We present a unifying, consistent, finite-size-scaling picture for percolation theory bringing it into the framework of a general, renormalization-group-based, scaling scheme for systems above their upper critical dimensions $d_c$. Behaviour at the critical point is non-universal in $d>d_c=6$ dimensions. Proliferation of the largest clusters, with fractal dimension $4$, is associated with the breakdown of hyperscaling there when free boundary conditions are used. But when the...