Related papers: Faster calculation of the percolation correlation …
In wave propagation theories, many problems of multi-sensor systems utilize time delay in their solution in signal processing. This technique finds great utility in seismic exploration and static correction (low-velocity weathering), which…
A wide variety of methods have been used to compute percolation thresholds. In lattice percolation, the most powerful of these methods consists of microcanonical simulations using the union-find algorithm to efficiently determine the…
The nature of phase boundaries in the QCD phase diagram has not been satisfactorily explored by experiments. Based on the Ginzburg-Landau free energy with a spatially inhomogeneous term as a function of a scalar order parameter, it is…
We describe in detail a new and highly efficient algorithm for studying site or bond percolation on any lattice. The algorithm can measure an observable quantity in a percolation system for all values of the site or bond occupation…
Motivated by the importance of geometric information in real systems, a new model for long-range correlated percolation in link-adding networks is proposed with the connecting probability decaying with a power-law of the distance on the…
The measurements of the magnetic and nematic correlation lengths in a generalization of the two dimensional XY model on the square lattice are presented using classical Monte Carlo simulation. The full phase diagram is re-examined based on…
Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cells. Percolation, on the other hand, has been the fundamental…
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…
Models of percolation processes on networks currently assume locally tree-like structures at low densities, and are derived exactly only in the thermodynamic limit. Finite size effects and the presence of short loops in real systems however…
A lattice-based model for continuum percolation is applied to the case of randomly located, partially aligned sticks with unequal lengths in 2D which are allowed to cross each other. Results are obtained for the critical number of sticks…
In this work we present PercIS, an algorithm based on Importance Sampling to approximate the percolation centrality of all the nodes of a graph. Percolation centrality is a generalization of betweenness centrality to attributed graphs, and…
The use of degree-degree correlations to model realistic networks which are characterized by their Pearson's coefficient, has become widespread. However the effect on how different correlation algorithms produce different results on…
We examine the geometry of the spaces between particles in diffusion-limited cluster aggregation, a numerical model of aggregating suspensions. Computing the distribution of distances from each point to the nearest particle, we show that it…
Percolation refers to an interesting class of problems related to the properties of disordered systems, usually formulated in terms of objects randomly placed on an underlying lattice or continuum. Despite the simplicity of the setup, most…
Using a recently introduced algorithm for simulating percolation in microcanonical (fixed-occupancy) samples, we study the convergence with increasing system size of a number of estimates for the percolation threshold for an open system…
We present high statistics data on the distribution of shortest path lengths between two near-by points on the same cluster at the percolation threshold. Our data are based on a new and very efficient algorithm. For $d=2$ they clearly…
We study the critical behavior of various geometrical and transport properties of percolation in 6 dimensions. By employing field theory and renormalization group methods we analyze fluctuation induced logarithmic corrections to scaling up…
We study the percolative properties of bi-dimensional systems generated by a random sequential adsorption of line-segments on a square lattice. As the segment length grows, the percolation threshold decreases, goes through a minimum and…
We introduce a new approach to connectivity-dependent properties of diluted systems, which is based on the transfer-matrix formulation of the percolation problem. It simultaneously incorporates the connective properties reflected in…
We reconsider the problem of percolation on an equilibrium random network with degree-degree correlations between nearest-neighboring vertices focusing on critical singularities at a percolation threshold. We obtain criteria for…