相关论文: Percolation and Connectivity in the Intrinsically …

We study the behavior of algebraic connectivity in a weighted graph that is subject to site percolation, random deletion of the vertices. Using a refined concentration inequality for random matrices we show in our main theorem that the…

The ability to control a complex network towards a desired behavior relies on our understanding of the complex nature of these social and technological networks. The existence of numerous control schemes in a network promotes us to wonder:…

\emph{Full-bond percolation} with parameter $p$ is the process in which, given a graph, for every edge independently, we delete the edge with probability $1-p$. Bond percolation is motivated by problems in mathematical physics and it is…

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 work investigates the fundamental limits of \emph{perfect} covert communication assisted by an Intelligent Reflecting Surface (IRS). We first characterize the necessary and sufficient conditions for perfect covertness, defined as zero…

Bootstrap percolation is a process that is used to model the spread of an infection on a given graph. In the model considered here each vertex is equipped with an individual threshold. As soon as the number of infected neighbors exceeds…

A network picture has been applied to various physical and biological systems to understand their governing mechanisms intuitively. Utilizing discretization schemes, both electrical and optical materials can also be interpreted as abstract…

We present a comprehensive and versatile theoretical framework to study site and bond percolation on clustered and correlated random graphs. Our contribution can be summarized in three main points. (i) We introduce a set of iterative…

Much work has been devoted to studying percolation of networks and interdependent networks under varying levels of failures. Researchers have considered many different realistic network structures, but thus far no study has incorporated the…

Due to shorter range communication becoming more prevalent with the development of multiple-input, multiple-output antennas (MIMO) and millimeter wave communications, multi-hop, intra-cell communication is anticipated to play a major role…

This paper presents a quantified assessment of the physical layer security capabilities of reconfigurable intelligent surface (RIS)-aided wireless systems under eavesdropping. Specifically, we derive a closed-form expression for the ergodic…

A new family of graphs, {\it entangled networks}, with optimal properties in many respects, is introduced. By definition, their topology is such that optimizes synchronizability for many dynamical processes. These networks are shown to have…

We investigate large wireless networks subject to security constraints. In contrast to point-to-point, interference-limited communications considered in prior works, we propose active cooperative relaying based schemes. We consider a…

We present an exact mathematical framework able to describe site-percolation transitions in real multiplex networks. Specifically, we consider the average percolation diagram valid over an infinite number of random configurations where…

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…

Strategic Communication Protocols provide a structured approach for first contact with interstellar objects that demonstrate technological characteristics and high levels of threat. The protocols find their starting point in an ISO…

We consider a secure integrated sensing and communication (ISAC) scenario, in which a signal is transmitted through a state-dependent wiretap channel with one legitimate receiver with which the transmitter communicates and one…

A dynamic model of a society is studied where each person is an uncorrelated and non-interacting random walker. A dynamical random graph represents the acquaintance network of the society whose nodes are the individuals and links are the…

This paper studies the throughput of large-scale decentralized wireless networks with physical layer security constraints. In particular, we are interested in the question of how much throughput needs to be sacrificed for achieving a…

Quantum privacy amplification is a central task in quantum cryptography. Given shared randomness, which is initially correlated with a quantum system held by an eavesdropper, the goal is to extract uniform randomness which is decoupled from…