Topology of molecular interaction networks

Molecular interactions are often represented as network models which have become the common language of many areas of biology. Graphs serve as convenient mathematical representations of network models and have themselves become objects of study. Their topology has been intensively researched over the last decade after evidence was found that...

Inferring Private Attributes in Online Social Networks

Online social networks (OSNs) are playing an important role in current world and the way people communicate with each other. Despite the advantage of using online social networks, there are certain privacy risks that can affect users of such services. Since users provide a lot of personal information in OSNs, concerns about how data placed in...

Challenge-Aware Traffic Protection in Wireless Mobile Backhaul Networks

To protect active traffic against link or node failures in multi-hop communications networks, several so-called protection schemes have been introduced in the past. The most established ones are path, segment, node and link protection. However, these schemes are limited as challenges are modelled abstractly whereas challenges in real networks...

A study of demand oblivious routing algorithms

Nowadays, people make use of communication networks (e.g. Internet) everyday and expect high quality from the offered services. Providing a good quality of service and optimizing the utilization of the network resources are the main objectives in designing a routing. It has always been believed that traffic demands play an important role in this...

Gossip-based counting in dynamic networks

We propose Gossipico, a gossip algorithm to average, sum or find minima and maxima over node values in a large, distributed, and dynamic network. Unlike previous work, Gossipico provides a continuous estimate of, for example, the number of nodes, even when the network becomes disconnected. Gossipico converges quickly due to the introduction of a...

Distributed Storage Management Using Dynamic Pricing in a Self-Organized Energy Community

We consider a future self-organized energy community that is composed of “prosumer” households that can autonomously generate, store, import and export power, and also selfishly strive to minimize their cost by adjusting their load profiles using the flexibly of their distributed storage. In such scenario, the aggregate load profile of the...

Emergent Economic Impact of Digital Information Networks

Digital Information Networks (DINs) refer to information networks supported by telecommunication infrastructures and terminated by microprocessors. DINs provide a substrate for digital data flows. DINs enable the networking of individuals in the digital economy: an economy that uses digital products and services in any of the production,...

Peer Selection with Hopcount and Delay Constraint

We revisit the peer selection problem of finding the most nearby peer from an initiating peer. The metrics to assess the closeness between peers are hopcount and delay, respectively. Based on a dense graph model with i.i.d regular link weight, we calculate the probability density function to reach a peer with minimum hopcount and asymptotically...

The Weight of the Shortest Path Tree

The minimal weight of the shortest path tree in a complete graph with independent and exponential (mean 1) random link weights, is shown to converge to a Gaussian distribution. We prove a conditional central limit theorem and show that the condition holds with probability converging to 1.

Unravelling 21st Century Riddles – Universal Network Visions from a Human Perspective

Networks are omnipresent and universal. Mankind, for example, forms a social network. Today, information and communications technology (ICT) exponentially accelerates the interaction between the human nodes of this global social network. In that way, ICT appears to evoke a phase transformation, similar to the physical phase transitions of a...

Degree and Principal Eigenvectors in Complex Networks

The largest eigenvalue ? 1 of the adjacency matrix powerfully characterizes dynamic processes on networks, such as virus spread and synchronization. The minimization of the spectral radius by removing a set of links (or nodes) has been shown to be an NP-complete problem. So far, the best heuristic strategy is to remove links/nodes based on the...

Weight of the Shortest Path to the First Encountered Peer in a Peer Group of Size m

We model the weight (e.g. delay, distance or cost) from an arbitrary node to the nearest (in weight) peer in a peer-to-peer (P2P) network. The exact probability generating function and an asymptotic analysis is presented for a random graph with i.i.d. exponential link weights. The asymptotic distribution function is a Fermi-Dirac distribution...

Crawling and Detecting Community Structure in Online Social Networks using Local Information

As Online Social Networks (OSNs) become an intensive sub- ject of research for example in computer science, networking, social sci- ences etc., a growing need for valid and useful datasets is present. The time taken to crawl the network is however introducing a bias which should be minimized. Usual ways of addressing this problem are sampling...

Context-Sensitive Sentiment Classification of Short Colloquial Text

The wide-spread popularity of online social networks and the resulting availability of data to researchers has enabled the investigation of new research questions, such as the analysis of information diffusion and how individuals are influencing opinion formation in groups. Many of these new questions however require an automatic assessment of...