Related papers: Percolation for D2D Networks on Street Systems
In this work, we present a new algorithm to approximate the percolation centrality of every node in a graph. Such a centrality measure quantifies the importance of the vertices in a network during a contagious process. In this paper, we…
In this paper, analytical assessment of overlay-inband device-to-device (D2D) communications is investigated, under cellular-network-assisted (coordinated) scheduling. To this end, a simple scheduling scheme is assumed that takes into…
In this work we investigate the problem of estimating the percolation centrality of every vertex in a graph. This centrality measure quantifies the importance of each vertex in a graph going through a contagious process. It is an open…
Spatial telecommunication systems have evolved along the years, leading to some concerns that telecommunication companies are facing today. The main inquietude is the ability to provide quality service to customers or users in a dense…
Device-to-device (D2D) communication, which enables a direct connection between users while bypassing the cellular channels to base stations (BSs), is a promising way to offload the traffic from conventional cellular networks. In D2D…
In this paper, we consider device-to-device (D2D) communication underlaying uplink cellular networks with multiple base stations (BSs), where each user can switch between traditional cellular mode (through BS) and D2D mode (by connecting…
The current analysis of wireless networks whose transceivers are confined to streets is largely based on Poissonian models, such as Poisson line processes and Poisson line Cox processes. We demonstrate important scenarios where a model with…
We develop a general theory for percolation in directed random networks with arbitrary two point correlations and bidirectional edges, that is, edges pointing in both directions simultaneously. These two ingredients alter the previously…
Many real-world networks exhibit the so-called small-world phenomenon: their typical distances are much smaller than their sizes. One mathematical model for this phenomenon is a long-range percolation graph on a $d$-dimensional box $\{0, 1,…
We use deep-learning strategies to study the 2D percolation model on a square lattice. We employ standard image recognition tools with a multi-layered convolutional neural network. We test how well these strategies can characterise…
We study the emergence of a giant component in a spatial network where the distribution of the metric distances between the nodes is scale-invariant, and the interaction between the nodes has a long-range power-law behavior. The nodes are…
We study the effect of assortative and disassortative mixing on the robustness of networks under random node failures. For ordinary (dyadic) networks, by using the generating function technique and stochastic simulations, we show that the…
We construct a connected network of 3.9 million nodes from mobile phone call records, which can be regarded as a proxy for the underlying human communication network at the societal level. We assign two weights on each edge to reflect the…
Device-to-device (D2D) communications are now considered as an integral part of future 5G networks which will enable direct communication between user equipment (UE) without unnecessary routing via the network infrastructure. This…
Analytical approaches to model the structure of complex networks can be distinguished into two groups according to whether they consider an intensive (e.g., fixed degree sequence and random otherwise) or an extensive (e.g., adjacency…
We introduce a model of random interlacements made of a countable collection of doubly infinite paths on Z^d, d bigger or equal to 3. A non-negative parameter u measures how many trajectories enter the picture. This model describes in the…
In this paper, using the stochastic geometry theory, we present a framework for analyzing the performance of device-to-device (D2D) communications underlaid uplink (UL) cellular networks. In our analysis, we consider a D2D mode selection…
We establish the existence of the phase transition in site percolation on pseudo-random $d$-regular graphs. Let $G=(V,E)$ be an $(n,d,\lambda)$-graph, that is, a $d$-regular graph on $n$ vertices in which all eigenvalues of the adjacency…
In this work, a VANET (Vehicular Ad-hoc NETwork) is considered to operate on a simple lane, without infrastructure. The arrivals of vehicles are assumed to be general with any traffic and speed assumptions. The vehicles communicate through…
Voronoi tessellations of Poisson point processes are widely used for modeling many types of physical and biological systems. In this paper, we analyze simulated Poisson-Voronoi structures containing a total of 250,000,000 cells to provide…