Related papers: Simple cubic random-site percolation thresholds fo…
In this paper, site percolation on random $\Phi^{3}$ planar graphs is studied by Monte-Carlo numerical techniques. The method consists in randomly removing a fraction $q=1-p$ of vertices from graphs generated by Monte-Carlo simulations,…
We study the two-dimensional site-percolation model on a square lattice. In this paradigmatic model, sites are randomly occupied with probability $p$; a second-order phase transition from a non-percolating to a fully percolating phase…
Consider an independent site percolation model with parameter $p \in (0,1)$ on $\Z^d,\ d\geq 2$ where there are only nearest neighbor bonds and long range bonds of length $k$ parallel to each coordinate axis. We show that the percolation…
The nearest-neighbor level spacing distribution is numerically investigated by directly diagonalizing disordered Anderson Hamiltonians for systems of sizes up to 100 x 100 x 100 lattice sites. The scaling behavior of the level statistics is…
In this work we apply a highly efficient Monte Carlo algorithm recently proposed by Newman and Ziff to treat percolation problems. The site and bond percolation are studied on a number of lattices in two and three dimensions. Quite good…
Statistical evidence of the influence of neighborhood topology on the performance of particle swarm optimization (PSO) algorithms has been shown in many works. However, little has been done about the implications could have the percolation…
We suggest a robust nearest-neighbor approach to classifying high-dimensional data. The method enhances sensitivity by employing a threshold and truncates to a sequence of zeros and ones in order to reduce the deleterious impact of…
Global physical properties of random media change qualitatively at a percolation threshold, where isolated clusters merge to form one infinite connected component. The precise knowledge of percolation thresholds is thus of paramount…
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…
Percolation on a five-dimensional simple hypercubic (sc(5)) lattice with extended neighborhoods is investigated by means of extensive Monte Carlo simulations, using an effective single-cluster growth algorithm. The critical exponents,…
Abridged] We present here new results on the space density of rich, optically-selected, clusters of galaxies at low redshift (z<0.15). These results are based on the application of the matched filter cluster-finding algorithm to 1067 deg2…
The indirect estimation of couplings in quantum dynamics relies on the measurement of the spectrum and the overlap of eigenvectors with some reference states. This data can be obtained by local measurements on some sites and eliminates the…
In the present study, we establish the existence of nontrivial site percolation threshold in the Relative Neighborhood Graph (RNG) for Poisson stationary point process with unit intensity in the plane.
Methods for determining the percolation threshold usually study the behavior of network ensembles and are often restricted to a particular type of probabilistic node/link removal strategy. We propose a network-specific method to determine…
K-Nearest Neighbours (k-NN) is a popular classification and regression algorithm, yet one of its main limitations is the difficulty in choosing the number of neighbours. We present a Bayesian algorithm to compute the posterior probability…
Higher order clustering coefficients $C(x)$ are introduced for random networks. The coefficients express probabilities that the shortest distance between any two nearest neighbours of a certain vertex $i$ equals $x$, when one neglects all…
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 social percolation model \citep{solomon-et-00} considers a 2-dimensional regular lattice. Each site is occupied by an agent with a preference $x_{i}$ sampled from a uniform distribution $U[0,1]$. Agents transfer the information about…
The upper estimate of the percolation threshold of the Bernoulli random field on the hexagonal lattice is found. It is done on the basis of the cluster decomposition. Each term of the decomposition is estimated using the number estimate of…
The statistical analysis of cosmic large-scale structure is most often based on simple two-point summary statistics, like the power spectrum or the two-point correlation function of a sample of galaxies or other types of tracers. In…