Related papers: The Missing Piece Syndrome in Peer-to-Peer Communi…
As a strategy to further reduce the transmission pressure during the peak traffic times in wireless network, coded caching has been widely studied recently. And several coded caching schemes are constructed focusing on the two core problems…
We consider the problem of broadcasting a viral video (a large file) over an ad hoc wireless network (e.g., students in a campus). Many smartphones are GPS enabled, and equipped with peer-to-peer (ad hoc) transmission mode, allowing them to…
The crowd panic and its contagion play non-negligible roles at the time of the stock crash, especially for China where inexperienced investors dominate the market. However, existing models rarely consider investors in networking stocks and…
The last mile connection is dominated by wireless links where heterogeneous nodes share the limited and already crowded electromagnetic spectrum. Current contention based decentralized wireless access system is reactive in nature to…
We present a capacity-achieving coding scheme for unicast or multicast over lossy packet networks. In the scheme, intermediate nodes perform additional coding yet do not decode nor even wait for a block of packets before sending out coded…
In this paper, we consider the problem of exchanging channel state information in a wireless network such that a subset of the clients can obtain the complete channel state information of all the links in the network. We first derive the…
We introduce and solve a model that mimics the herding effect in financial markets when groups of agents share information. The number of agents in the model is growing and at each time step either (i) with probability $p$ an incoming agent…
Looking to overcome the limitations of traditional networks, the network science community has lately given much attention to the so-called higher-order networks, where group interactions are modeled alongside pairwise ones. While degree…
Over the last decade, internet has seen an exponential increase in its growth.With more and more people using it, efficient data delivery over the internet has become a key issue. Peer-to-peer (P2P)/seed sharing based networks have several…
A metapopulations network is a multi-patch habitat system, where populations live and interact in the habitat patches, and individuals disperse from one patch to the other via dispersal connections. The loss of dispersal connections among…
Degree distribution of nodes, especially a power law degree distribution, has been regarded as one of the most significant structural characteristics of social and information networks. Node degree, however, only discloses the first-order…
We consider the canonical {\em shared link network} formed by a source node, hosting a library of $m$ information messages (files), connected via a noiseless common link to $n$ destination nodes (users), each with a cache of size M files.…
Seeders (peers that do not request anything but contribute to the system) are a powerful concept in peer-to-peer (P2P). They allow to leverage the capacities of a P2P system. While seeding is a natural idea for filesharing or…
Connectivity is one of the most fundamental properties of wireless multi-hop networks. A network is said to be connected if there is a path between any pair of nodes. A convenient way to study the connectivity of a random network is by…
This paper addresses the problem of maximizing the expected size of a matching in the case of unreliable vertices and/or edges. The assumption is that upon failure, remaining vertices that have not been matched may be subject to a new…
Network diffusion models are used to study disease transmission, information spread, technology adoption, and other socio-economic processes. We show that estimates of these diffusions are highly non-robust to mismeasurement. First, even…
Rumour spreading is a protocol for modelling the spread of information through a network via user-to-user interaction. The Spatial Preferred Attachment (SPA) model is a random graph model for complex networks: vertices are placed in a…
We study the complexity of the problem of searching for a set of patterns that separate two given sets of strings. This problem has applications in a wide variety of areas, most notably in data mining, computational biology, and in…
The goal of the paper is to study asymptotic behavior of the number of lost messages. Long messages are assumed to be divided into a random number of packets which are transmitted independently of one another. An error in transmission of a…
Viral spread on large graphs has many real-life applications such as malware propagation in computer networks and rumor (or misinformation) spread in Twitter-like online social networks. Although viral spread on large graphs has been…