Let $ G $ be a graph on $ n $ nodes. In the stochastic population protocol model, a
collection of $ n $ indistinguishable, resource-limited nodes collectively solve tasks via …

A common two-tier structure for social networks is based on partitioning society into two
parts, referred to as the elite and the periphery, where the “elite” is the relatively small but …

Consider the following process on a network: Each agent initially holds either opinion blue
or red; then, in each round, each agent looks at two random neighbors and, if the two have …

Building information modeling (BIM) has been attracting increasing attention in the
architecture, engineering, and construction (AEC) industry in recent years. The wide spread …

We consider the problem of characterizing degree sequences that can be realized by a
bipartite graph. If a partition of the sequence into the two sides of the bipartite graph is given …

The 2-Choices dynamics is a process that models voting behavior on networks and works as
follows: Each agent initially holds either opinion blue or red; then, in each round, each agent …

We exploit the core-periphery structure and the strong homophilic properties of online social
networks to develop faster and more accurate algorithms for user interest prediction. The …

We present a uniform approach to derive message-time tradeoffs and message lower
bounds for synchronous distributed computations using results from communication …

Nowadays, the building sector and people's activities in buildings account for nearly 60% of
the world's electricity consumption. Wherein, the operation accounts for 87% of total costs in …

We consider two variants of the network formation game that aims to study the creation of
large-scale networks and to capture the impact of selfish behavior, on behalf of the network …