Related papers: Towards a Better Understanding of Large Scale Netw…
Besides advanced telecommunications techniques, the most prominent evolution of wireless networks is the densification of network deployment. In particular, the increasing access points/users density and reduced cell size significantly…
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…
A majority of real life networks are weighted and sparse. The present article aims at characterization of weighted networks based on sparsity, as a measure of inherent diversity, of different network parameters. It utilizes sparsity index…
Capacity scaling laws are analyzed in an underwater acoustic network with $n$ regularly located nodes on a square, in which both bandwidth and received signal power can be limited significantly. A narrow-band model is assumed where the…
We derive the probability that a randomly chosen NL-node over $S$ gets localized as a function of a variety of parameters. Then, we derive the probability that the whole network of NL-nodes over $S$ gets localized. In connection with the…
In this paper, we characterize the information-theoretic capacity scaling of wireless ad hoc networks with $n$ randomly distributed nodes. By using an exact channel model from Maxwell's equations, we successfully resolve the conflict in the…
Random networks are a powerful tool in the analytical modeling of complex networks as they allow us to write approximate mathematical models for diverse properties and behaviors of networks. One notable shortcoming of these models is that…
Nonextensivity is foreseeable in network ensembles, as heterogeneous interactions generally exist in complex networked systems that need to be described by network ensembles. But this nonextensivity has not been literatured proved yet. In…
Various natural and engineered systems, from urban traffic flow to the human brain, can be described by large-scale networked dynamical systems. These systems are similar in being comprised of a large number of microscopic subsystems, each…
In this paper we investigate the dependency of characteristic distance on energy dissipation model. Both the many-to-one and any-to-any communication paradigm have been presented for performance analysis. Characteristic distance has been…
Recent work in the area of interdependent networks has focused on interactions between two systems of the same type. However, an important and ubiquitous class of systems are those involving monitoring and control, an example of…
Network architecture design is very important for the optimization of industrial networks. The type of network architecture can be divided into small-scale network and large-scale network according to its scale. Graph theory is an efficient…
We establish the Strong Poisson Hypothesis for symmetric closed networks. In particular, the asymptotic independence of the nodes -- as the size of the system tends to infinity -- is proved.
Models of complex networks often incorporate node-intrinsic properties abstracted as hidden variables. The probability of connections in the network is then a function of these variables. Real-world networks evolve over time, and many…
This paper discusses the enumeration of two-terminal series-parallel networks, i.e. the number of electrical networks built with n identical elements connected in series or parallel with two-terminal nodes. They frequently occur in applied…
Complex networks with expanding dimensions are studied, where the networks may be directed and weighted, and network nodes are varying in discrete time in the sense that some new nodes may be added and some old nodes may be removed from…
The secrecy graph is a random geometric graph which is intended to model the connectivity of wireless networks under secrecy constraints. Directed edges in the graph are present whenever a node can talk to another node securely in the…
In this paper we study the small-world network model of Watts and Strogatz, which mimics some aspects of the structure of networks of social interactions. We argue that there is one non-trivial length-scale in the model, analogous to the…
Generative mechanisms which lead to empirically observed structure of networked systems from diverse fields like biology, technology and social sciences form a very important part of study of complex networks. The structure of many…
We study delay tolerant networking (DTN) and in particular, its capacity to store, carry and forward messages so that the messages eventually reach their final destinations. We approach this broad question in the framework of percolation…