Related papers: Efficient percolation simulations for lossy photon…
We consider a family of percolation models in which geometry and connectivity are defined by two independent random processes. Such models merge characteristics of discrete and continuous percolation. We develop an algorithm allowing…
Site percolation in a distorted simple cubic lattice is characterized numerically employing the Newman-Ziff algorithm. Distortion is administered in the lattice by systematically and randomly dislocating its sites from their regular…
We propose two schemes to achieve fast realizations of spatially correlated percolation models. The schemes are shown to be efficient in complementary regimes of correlation phase space. They are combined with a generalized Newman-Ziff…
We present a method for computing transition points of the random cluster model using a generalization of the Newman-Ziff algorithm, a celebrated technique in numerical percolation, to the random cluster model. The new method is…
We propose very efficient algorithms for the bootstrap percolation and the diffusion percolation models by extending the Newman-Ziff algorithm of the classical percolation [M. E. J. Newman and R. M. Ziff, Phys. Rev. Lett. 85 (2000) 4104].…
Percolation is an emblematic model to assess the robustness of interconnected systems when some of their components are corrupted. It is usually investigated in simple scenarios, such as the removal of the system's units in random order, or…
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…
Rigidity Percolation is a crucial framework for describing rigidity transitions in amorphous systems. We present a new, efficient algorithm to study central-force Rigidity Percolation in two dimensions. This algorithm combines the Pebble…
Percolation theory has been largely used in the study of structural properties of complex networks such as the robustness, with remarkable results. Nevertheless, a purely topological description is not sufficient for a correct…
This paper exhibits a Monte Carlo study on site percolation using the Newmann-Ziff algorithm in distorted square and simple cubic lattices where each site is allowed to be directly linked with any other site if the euclidean separation…
Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in many small connected components, while if the damage is light,…
Any quantum algorithm can be implemented by an adaptive sequence of single node measurements on an entangled cluster of qubits in a square lattice topology. Photons are a promising candidate for encoding qubits but assembling a photonic…
The function of a real network depends not only on the reliability of its own components, but is affected also by the simultaneous operation of other real networks coupled with it. Robustness of systems composed of interdependent network…
Recent work on the internet, social networks, and the power grid has addressed the resilience of these networks to either random or targeted deletion of network nodes. Such deletions include, for example, the failure of internet routers or…
The diffusion and bootstrap percolation models were studied in regular random and Erd\H{o}s-R\'{e}nyi networks using the modified Newman-Ziff algorithms. We calculated the percolation threshold and the order parameter of the percolation…
Neuroimaging data can be represented as networks of nodes and edges that capture the topological organization of the brain connectivity. Graph theory provides a general and powerful framework to study these networks and their structure at…
We study the bootstrap and diffusion percolation models in the simple-cubic (sc), body-centered cubic (bcc), and face-centered cubic (fcc) lattices using the Newman-Ziff algorithm. The percolation threshold and critical exponents were…
We study entanglement percolation in qubit-based planar quantum network models of arbitrary topology, where neighboring nodes are initially connected by pure states with quenched disorder in their entanglement. To address this, we develop a…
We explore the possibility of efficient classical simulation of linear optics experiments under the effect of particle losses. Specifically, we investigate the canonical boson sampling scenario in which an $n$-particle Fock input state…
Percolation is an important topic in climate, physics, materials science, epidemiology, finance, and so on. Prediction of percolation thresholds with machine learning methods remains challenging. In this paper, we build a powerful graph…