Related papers: The Forgiving Tree: A Self-Healing Distributed Dat…
In this paper we study the household-structure SIS epidemic spreading on general complex networks. The household structure gives us the way to distinguish inner and the outer infection rate. Unlike household-structure models on homogenous…
The in-degree and out-degree distributions of a growing network model are determined. The in-degree is the number of incoming links to a given node (and vice versa for out-degree. The network is built by (i) creation of new nodes which each…
We present analytical results for the emerging structure of networks that evolve via a combination of growth (by node addition and random attachment) and contraction (by random node deletion). To this end we consider a network model in…
Consider a fully connected network of nodes, some of which have a piece of data to be disseminated to the whole network. We analyze the following push-type epidemic algorithm: in each push round, every node that has the data, i.e., every…
We consider a distribution network for delivering a natural resource or physical good to a set of nodes, each of which serves a set of customers, in which disruptions may occur at one or more nodes. Each node receives flow through a path…
Peer to peer (P2P) systems are moving from application specific architectures to a generic service oriented design philosophy. This raises interesting problems in connection with providing useful P2P middleware services that are capable of…
We study the broadcast problem on dynamic networks with $n$ processes. The processes communicate in synchronous rounds along an arbitrary rooted tree. The sequence of trees is given by an adversary whose goal is to maximize the number of…
Spreading of either information or matter can often be treated as a network problem. It can be of great importance to be able to estimate the likelihood that spreading through a network reaches essentially the entire network while still not…
Measuring and optimizing the influence of nodes in big-data online social networks are important for many practical applications, such as the viral marketing and the adoption of new products. As the viral spreading on social network is a…
Answering connectivity queries is fundamental to fully dynamic graphs where edges and vertices are inserted and deleted frequently. Existing work proposes data structures and algorithms with worst-case guarantees. We propose a new data…
Peer to peer systems are the networks consisting of a group of nodes possible to be as wide as the Internet. These networks are required of evaluation mechanisms and distributed control and configurations, so each peer will be able to…
We show how to construct an overlay network of constant degree and diameter $O(\log n)$ in time $O(\log n)$ starting from an arbitrary weakly connected graph. We assume a synchronous communication network in which nodes can send messages to…
Distributed storage systems provide reliable access to data through redundancy spread over individually unreliable nodes. Application scenarios include data centers, peer-to-peer storage systems, and storage in wireless networks. Storing…
We present simulation results for the contact process on regular, cubic networks that are composed of a one-dimensional lattice and a set of long edges with unbounded length. Networks with different sets of long edges are considered, that…
Geometric trees are characterized by their tree-structured layout and spatially constrained nodes and edges, which significantly impacts their topological attributes. This inherent hierarchical structure plays a crucial role in domains such…
Real-world complex systems exhibit intricate interconnections and dependencies, especially social networks, technological infrastructures, and communication networks. These networks are prone to disconnection due to random failures or…
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…
One of the primary objectives of a distributed storage system is to reliably store a large amount $dsize$ of source data for a long duration using a large number $N$ of unreliable storage nodes, each with capacity $nsize$. The storage…
Being motivated by recent developments in the theory of complex networks, we examine the robustness of communication networks under intentional attack that takes down network nodes in a decreasing order of their nodal degrees. In this…
The fifth generation of communication technology (5G) revolutionizes mobile networks and the associated ecosystems through the integration of cross-domain networks. Network slicing is an enabling technology for 5G as it provides dynamic,…