Related papers: Percolation for D2D Networks on Street Systems
Correlations are known to play a crucial role in determining the structure of complex networks. Here we study how their presence affects the computation of the percolation threshold in random hypergraphs. In order to mimic the correlation…
We explore the experimental observation that complex networks of porous media exhibit the property that the porous coordination number is proportional to its size. Based in this geometry-topology duality we developed an analytical approach…
In this note we discuss vacant set level set percolation on a transient weighted graph. It interpolates between the percolation of the vacant set of random interlacements and the level set percolation of the Gaussian free field. We employ…
We introduce a new correlated percolation model on the $d$-dimensional lattice $\mathbb{Z}^d$ called the random length worms model. Assume given a probability distribution on the set of positive integers (the length distribution) and $v \in…
The divergence of the correlation length $\xi$ at criticality is an important phenomenon of percolation in two-dimensional systems. Substantial speed-ups to the calculation of the percolation threshold and component distribution have been…
Message passing techniques on networks encompasses a family of related methods that can be employed to ascertain many important properties of a network. It is widely considered to be the state of the art formulation for networked systems…
We make use of the recent proof that the critical probability for percolation on random Voronoi tessellations is 1/2 to prove the corresponding result for random Johnson-Mehl tessellations, as well as for two-dimensional slices of higher…
We examine the heterogeneous responses of individual nodes in sparse networks to the random removal of a fraction of edges. Using the message-passing formulation of percolation, we discover considerable variation across the network in the…
Explosive percolation in a network is a phase transition where a large portion of nodes becomes connected with an addition of a small number of edges. Although extensively studied in random network models and reconstructed real networks,…
One of the most significant 5G technology enablers will be Device-to-Device (D2D) communications. D2D communications constitute a promising way to improve spectral, energy and latency performance, exploiting the physical proximity of…
We are interested in the assessment of electromagnetic Path-Loss in complex environments. The Path-loss is the attenuation function $P$ of the electromagnetic power at a distance $d$ of an antenna. In free-space, $P(d) \propto 1/d^2$, in…
We study in this paper the localization of light and the dielectric properties of thin metal-dielectric composites at the percolation threshold and around a resonant frequency where the conductivities of the two components are of the same…
Wireless multi-hop ad hoc communication networks represent an infrastructure-less and self-organized generalization of todays wireless cellular networks. Connectivity within such a network is an important issue. Continuum percolation and…
Many realistic systems such as infrastructures are characterized by spatial structure and anisotropic alignment. Here we propose and study a model for dealing with such characteristics by introducing a parameter that controls the strength…
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…
Hyperuniform many-particle systems, which encompass crystals, quasicrystals and certain exotic disordered systems, exhibit an anomalous suppression of density fluctuations on macroscopic length scales relative to those of conventional…
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…
Classical percolation theory underlies many processes of information transfer along the links of a network. In these standard situations, the requirement for two nodes to be able to communicate is the presence of at least one uninterrupted…
In real networks, the dependency between nodes is ubiquitous; however, the dependency is not always complete and homogeneous. In this paper, we propose a percolation model with weak and heterogeneous dependency; i.e., dependency strengths…
Given a network, the statistical ensemble of its graph-Voronoi diagrams with randomly chosen cell centers exhibits properties convertible into information on the network's large scale structures. We define a node-pair level measure called…