Related papers: Percolation for D2D Networks on Street Systems
Device-to-device (D2D) communication enables us to spread information in the local area without infrastructure support. In this paper, we focus on information spreading in mobile wireless networks where all nodes move around. The source…
To achieve the potential in providing high throughput for cellular networks by device-to-device (D2D) communications, the interference among D2D links should be carefully managed. In this paper, we propose an opportunistic cooperation…
We study, theoretically and numerically, a minimal model for phonons in a disordered system. For sufficient disorder, the vibrational modes of this classical system can become Anderson localized, yet this problem has received significantly…
Recently, new results on percolation of interdependent networks have shown that the percolation transition can be first order. In this paper we show that, when considering antagonistic interactions between interacting networks, the…
In a Monte Carlo study the conductivity of two-dimensional random stick systems is investigated from the percolation threshold up to ten times the percolation threshold density. We propose a model explicitly depending on the stick density…
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…
We investigate random interlacements on Z^d, d bigger or equal to 3. This model recently introduced in arXiv:0704.2560 corresponds to a Poisson cloud on the space of doubly infinite trajectories modulo time-shift tending to infinity at…
Caching at mobile devices and leveraging device-to-device (D2D) communication are two promising approaches to support massive content delivery over wireless networks. Analysis of such D2D caching networks based on a physical interference…
Caching at mobile devices and leveraging device-to-device (D2D) communication are two promising approaches to support massive content delivery over wireless networks. The analysis of such D2D caching networks based on a physical…
The k-neighbor graph is a directed percolation model on the hypercubic lattice Z d in which each vertex independently picks exactly k of its 2d nearest neighbors at random, and we open directed edges towards those. We prove that the…
We introduce a bond percolation procedure on a $D$-dimensional lattice where two neighbouring sites are connected by $N$ channels, each operated by valves at both ends. Out of a total of $N$, randomly chosen $n$ valves are open at every…
A comprehensive vehicular network analysis requires modeling the street system and vehicle locations. Even when Poisson point processes (PPPs) are used to model the vehicle locations on each street, the analysis is barely tractable. That…
We analyze the critical connectivity of systems of penetrable $d$-dimensional spheres having size distributions in terms of weighed random geometrical graphs, in which vertex coordinates correspond to random positions of the sphere centers…
Percolation clusters are random fractals whose geometrical and transport properties can be characterized with the help of probability distribution functions. Using renormalized field theory, we determine the asymptotic form of various of…
Infrastructure systems, such as power, transportation, telecommunication, and water systems, are composed of multiple components which are interconnected and interdependent to produce and distribute essential goods and services. So, the…
It is important that a spatial network's construction algorithm reproduces the structural properties of the original physical embedding. Here, we assess the Delaunay triangulation as a spatial network construction algorithm for seven…
An important problem in wireless sensor networks is to find the minimal number of randomly deployed sensors making a network connected with a given probability. In practice sensors are often deployed one by one along a trajectory of a…
Percolation is perhaps the simplest example of a process exhibiting a phase transition and one of the most studied phenomena in statistical physics. The percolation transition is continuous if sites/bonds are occupied independently with the…
Robustness of two coupled networks system has been studied only for dependency coupling (S. Buldyrev et. al., Nature, 2010) and only for connectivity coupling (E. A. Leicht and R. M. D'Souza, arxiv:09070894). Here we study, using a…
We suggest treating a conducting network of oriented polymer chains as an anisotropic fractal whose dimensionality D=1+\epsilon is close to one. Percolation on such a fractal is studied within the real space renormalization group of Migdal…