Related papers: Percolation and Connectivity in the Intrinsically …
This correspondence investigates a reconfigurable intelligent surface (RIS)-assisted wireless communication system with security threats. The RIS is deployed to enhance the secrecy outage probability (SOP) of the data sent to a legitimate…
Due to the involved massive number of devices, radio frequency (RF) energy harvesting is indispensable to realize the foreseen Internet-of-Everything (IoE) within 6G networks. Analogous to the cellular networks concept, shared energy…
Despite the large effort devoted to cybersecurity research over the last decades, cyber intrusions and attacks are still increasing. With respect to routing networks, route hijacking has highlighted the need to reexamine the existing…
Bootstrap percolation is a well-known activation process in a graph, in which a node becomes active when it has at least $r$ active neighbors. Such process, originally studied on regular structures, has been recently investigated also in…
This letter presents a detailed performance analysis of the intelligent reflecting surface (IRS) aided single-input single-output communication systems, taking into account of the direct link between the transmitter and receiver. A…
This paper examines the impact of emerging fluid antenna systems (FAS) on reconfigurable intelligent surface (RIS)-aided secure communications. Specifically, we consider a classic wiretap channel, where a fixed-antenna transmitter sends…
We introduce the concept of matching connectivity as a notion of connectivity in graph admitting perfect matchings which heavily relies on the structural properties of those matchings. We generalise a result of Robertson, Seymour and Thomas…
We consider the level of information security provided by random linear network coding in network scenarios in which all nodes comply with the communication protocols yet are assumed to be potential eavesdroppers (i.e. "nice but curious").…
In the present article, numerical simulations have been performed to find the bond and site percolation thresholds on two-dimensional Gabriel graphs (GG) for Poisson point processes. GGs belong to the family of proximity graphs and are…
The advancement in wireless communication technologies is becoming more demanding and pervasive. One of the fundamental parameters that limit the efficiency of the network are the security challenges. The communication network is vulnerable…
Interdependent networks are ubiquitous in our society, ranging from infrastructure to economics, and the study of their cascading behaviors using percolation theory has attracted much attention in the recent years. To analyze the…
We present analytic and numeric results for percolation in a network formed of interdependent spatially embedded networks. We show results for a treelike and a random regular network of networks each with $(i)$ unconstrained interdependent…
This paper investigates the physical layer security (PLS) of a broadband in-home power line communication (PLC) system when a malicious wireless device tries to eavesdrop private messages exchanged between two PLC devices. Such a security…
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…
Hypergraphs capture the higher-order interactions in complex systems and always admit a factor graph representation, consisting of a bipartite network of nodes and hyperedges. As hypegraphs are ubiquitous, investigating hypergraph…
Consider the communication of a single-user aided by a nearby relay involved in a large wireless network where the nodes form an homogeneous Poisson point process. Since this network is interference-limited the asymptotic error probability…
In this paper we study the spectrum of long-range percolation graphs. The underlying geometry is given in terms of a finitely generated amenable group. We prove that the integrated density of states (IDS) or spectral distribution function…
Real data show that interdependent networks usually involve inter-similarity. Intersimilarity means that a pair of interdependent nodes have neighbors in both networks that are also interdependent (Parshani et al \cite{PAR10B}). For…
The emergence of large-scale connectivity and synchronization are crucial to the structure, function and failure of many complex socio-technical networks. Thus, there is great interest in analyzing phase transitions to large-scale…
We analyze complexity in spatial network ensembles through the lens of graph entropy. Mathematically, we model a spatial network as a soft random geometric graph, i.e., a graph with two sources of randomness, namely nodes located randomly…