Related papers: Continuum Percolation in the Intrinsically Secure …
Efficient use of a wireless network requires that transmissions be grouped into feasible sets, where feasibility means that each transmission can be successfully decoded in spite of the interference caused by simultaneous transmissions.…
A graph is CIS if every maximal clique interesects every maximal stable set. Currently, no good characterization or recognition algorithm for the CIS graphs is known. We characterize graphs in which every maximal matching saturates all…
Emergency Services Communication Systems (ESCS) are evolving into Internet Protocol based communication networks, promising enhancements to their function, availability, and resilience. This increase in complexity and cyber-attack surface…
A statistical characterization of the fundamental performance bounds of an intelligent reflective surface (IRS) intended for aiding wireless communications is presented. To this end, the outage probability, average symbol error probability,…
On a geometric model for complex networks (introduced by Krioukov et al.) we investigate the bootstrap percolation process. This model consists of random geometric graphs on the hyperbolic plane having $N$ vertices, a dependent version of…
Connectivity and reachability on temporal networks, which can describe the spreading of a disease, decimation of information or the accessibility of a public transport system over time, have been among the main contemporary areas of study…
We consider a secure communication scenario through the two-user Gaussian interference channel: each transmitter (user) has a confidential message to send reliably to its intended receiver while keeping it secret from the other receiver.…
We provide a sufficient condition on the isoperimetric properties of a regular graph $G$ of growing degree $d$, under which the random subgraph $G_p$ typically undergoes a phase transition around $p=\frac{1}{d}$ which resembles the…
Given an infinite connected graph $G$, a way to randomly perturb its metric is to assign random i.i.d. lengths to the edges of the graph, a process called first-passage percolation. Assume that the graph is infinite and of bounded degree.…
A significant generalization of the Erd\"os-R\'enyi random graph model is an `inhomogeneous' random graph where the edge probabilities vary according to vertex types. We identify the threshold value for this random graph with a finite…
The proliferation of low-cost Internet of Things (IoT) devices has led to a race between wireless security and channel attacks. Traditional cryptography requires high-computational power and is not suitable for low-power IoT scenarios.…
Security is an essential requirement of Industrial Control System (ICS) environments and its underlying communication infrastructure. Especially the lowest communication level within Supervisory Control and Data Acquisition (SCADA) systems…
This work models a secure integrated sensing and communication (ISAC) system as a wiretap channel with action-dependent channel states and channel output feedback, e.g., obtained through reflections. The transmitted message is split into a…
We propose a multistage version of the independent cascade model, which we call a multistage independent cascade (MIC) model, on networks. This model is parameterized by two probabilities: the probability $T_1$ that a node adopting a fad…
Starting from a stochastic individual-based description of an SIS epidemic spreading on a random network, we study the dynamics when the size $n$ of the network tends to infinity. We recover in the limit an infinite-dimensional…
This study proposes a novel approach to ensure the security of textual data transmission in a semantic communication system. In the proposed system, a sender transmits textual information to a receiver, while a potential eavesdropper…
We introduce an evolving network model in which a new node attaches to a randomly selected target node and also to each of its neighbors with probability $p$. The resulting network is sparse for $p<\frac{1}{2}$ and dense (average degree…
This letter investigates the secrecy performance of wireless communication systems assisted by a fluid reconfigurable intelligent surface (FRIS). Unlike conventional reconfigurable intelligent surfaces (RISs) with fixed geometries, FRISs…
We study the problem of wireless network resilience to node failures from a percolation-based perspective. In practical wireless networks, it is often the case that the failure probability of a node depends on its degree (number of…
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…