Related papers: Centralities for Networks with Consumable Resource…
In this paper we consider a set of heterogeneous terminals in a urban area that are interested in collecting the information originated from several sources. This set includes mobile nodes (pedestrian and vehicles) and fixed terminals. In…
This paper introduces some tools from graph theory and distributed consensus algorithms to construct an optimal, yet robust, hierarchical information sharing structure for large-scale decision making and control problems. The proposed…
We study a simple model of information propagation in social networks, where two quantities are introduced: the spread factor, which measures the average maximal fraction of neighbors of a given node that interchange information among each…
Proportional fairness is a popular service allocation mechanism to describe and analyze the performance of data networks at flow level. Recently, several authors have shown that the invariant distribution of such networks admits a product…
We present a simple model to predict network activity at the edge level, by extending a known approximation method to compute Betweenness Centrality (BC) with a repulsive mechanism to prevent unphysical densities. By taking into account the…
Social networks play a fundamental role in the diffusion of information. However, there are two different ways of how information reaches a person in a network. Information reaches us through connections in our social networks, as well as…
Human mobility and activity patterns mediate contagion on many levels, including the spatial spread of infectious diseases, diffusion of rumors, and emergence of consensus. These patterns however are often dominated by specific locations…
In order to maintain consistent quality of service, computer network engineers face the task of monitoring the traffic fluctuations on the individual links making up the network. However, due to resource constraints and limited access, it…
The identification of nodes occupying important positions in a network structure is crucial for the understanding of the associated real-world system. Usually, betweenness centrality is used to evaluate a node capacity to connect different…
We study proliferation of an action in binary action network coordination games that are generalized to include global effects. This captures important aspects of proliferation of a particular action or narrative in online social networks,…
We study a new notion of graph centrality based on absorbing random walks. Given a graph $G=(V,E)$ and a set of query nodes $Q\subseteq V$, we aim to identify the $k$ most central nodes in $G$ with respect to $Q$. Specifically, we consider…
Node centrality is one of the integral measures in network analysis with wide range of applications from socio-economic to personalized recommendation. We argue that an effective centrality measure should undertake stability even under…
Networks are universally considered as complex structures of interactions of large multi-component systems. In order to determine the role that each node has inside a complex network, several centrality measures have been developed. Such…
We investigate the problem of enforcing a desired centrality measure in complex networks, while still keeping the original pattern of the network. Specifically, by representing the network as a graph with suitable nodes and weighted edges,…
This paper introduces a new macroscopic perspective for simulating transportation networks. The idea is to look at the network as connected nodes. Each node sends an information package to its neighbors. Basically, the information package…
In the study of disease spreading on empirical complex networks in SIR model, initially infected nodes can be ranked according to some measure of their epidemic impact. The highest ranked nodes, also referred to as "superspreaders", are…
A rumor spreading in a social network or a disease propagating in a community can be modeled as an infection spreading in a network. Finding the infection source is a challenging problem, which is made more difficult in many applications…
We propose a resource distribution strategy to reduce the average travel time in a transportation network given a fixed generation rate. Suppose that there are essential resources to avoid congestion in the network as well as some extra…
We review the research literature investigating systems in which mobile entities can carry data while they move. These entities can be either mobile by nature (e.g., human beings and animals) or mobile by design (e.g., trains, airplanes,…
Most of the real world networks are complex as well as evolving. Therefore, it is important to study the effect of network topology on the dynamics of traffic and congestion in the network. To account this problem, we have designed a…