Related papers: Statistics of the critical percolation backbone wi…
We study numerically and by scaling arguments the probability P(M)dM that a given dangling end of the incipient percolation cluster has a mass between M and M + dM. We find by scaling arguments that P(M) decays with a power law,…
Temporal higher-order networks, where each hyperlink involving a group of nodes are activated or deactivated over time, are recently used to represent complex systems such as social contacts, interactions or collaborations that occur at…
Analytical approaches to model the structure of complex networks can be distinguished into two groups according to whether they consider an intensive (e.g., fixed degree sequence and random otherwise) or an extensive (e.g., adjacency…
The curves of scaling behavior is a significant concept in fractal dimension analysis of complex systems. However, the underlying rationale of this kind of curves for fractal cities is not yet clear. The aim of this paper is at researching…
In high dimensional percolation at parameter $p < p_c$, the one-arm probability $\pi_p(n)$ is known to decay exponentially on scale $(p_c - p)^{-1/2}$. We show the same statement for the ratio $\pi_p(n) / \pi_{p_c}(n)$, establishing a form…
We propose a scaling hypothesis for pattern-forming systems in which modulation of the order parameter results from the competition between a short-ranged interaction and a long-ranged interaction decaying with some power $\alpha$ of the…
We formulate a scaling theory for the long-time diffusive motion in a space occluded by a high density of moving obstacles in dimensions 1, 2 and 3. Our tracers diffuse anomalously over many decades in time, before reaching a diffusive…
In long-range percolation on $\mathbb{Z}^d$, we connect each pair of distinct points $x$ and $y$ by an edge independently at random with probability $1-\exp(-\beta\|x-y\|^{-d-\alpha})$, where $\alpha>0$ is fixed and $\beta\geq 0$ is a…
We study the long-range correlations of heartbeat fluctuations with the method of diffusion entropy. We show that this method of analysis yields a scaling parameter $\delta$ that apparently conflicts with the direct evaluation of the…
We discuss the large scale properties of standard cold dark matter cosmological models characterizing the main features of the power-spectrum, of the two-point correlation function and of the mass variance. Both the real-space statistics…
For ordinary (independent) percolation on a large class of lattices it is well known that below the critical percolation parameter $p_c$ the cluster size distribution has exponential decay and that power-law behavior of this distribution…
Percolation threshold of a network is the critical value such that when nodes or edges are randomly selected with probability below the value, the network is fragmented but when the probability is above the value, a giant component…
Percolation models with multiple percolating clusters have attracted much attention in recent years. Here we use Monte Carlo simulations to study bond percolation on $L_{1}\times L_{2}$ planar random lattices, duals of random lattices, and…
We propose a maximally disassortative (MD) network model which realizes a maximally negative degree-degree correlation, and study its percolation transition to discuss the effect of a strong degree-degree correlation on the percolation…
We consider the Random-Cluster model on $(\mathbb{Z}/n\mathbb{Z})^d$ with parameters $p \in (0,1)$ and $q\ge 1$. This is a generalization of the standard bond percolation (with open probability $p$) which is biased by a factor $q$ raised to…
An important problem in the analysis of experimental data showing fractal properties, is that such samples are composed by a set of points limited by an upper and a lower cut off. We study how finite size effect due to the discreteness of…
Both the deterministic and stochastic sandpile models are studied on the percolation backbone, a random fractal, generated on a square lattice in $2$-dimensions. In spite of the underline random structure of the backbone, the deterministic…
Using a recently developed algorithm for generic rigidity of two-dimensional graphs, we analyze rigidity and connectivity percolation transitions in two dimensions on lattices of linear size up to L=4096. We compare three different…
We study gradient percolation for site percolation on the triangular lattice. This is a percolation model where the percolation probability depends linearly on the location of the site. We prove the results predicted by physicists for this…
Two-particle correlations based on the multiplicity of selected isobars are found to be sensitive to the parameterization of the fragments' binding energies and the breakup volume assumed in the model calculations. The properties of these…