Fast graphical population protocols
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 …
collection of $ n $ indistinguishable, resource-limited nodes collectively solve tasks via …
Elites in social networks: An axiomatic approach to power balance and Price's square root law
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 …
parts, referred to as the elite and the periphery, where the “elite” is the relatively small but …
Phase transition of the 2-choices dynamics on core-periphery networks
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 …
or red; then, in each round, each agent looks at two random neighbors and, if the two have …
Developing a Blockchain-Based Framework for Digital Archiving of BIM Using Axiomatic Design
T Zhang, K Chen, Y Tao, H Xue - Buildings, 2024 - mdpi.com
Building information modeling (BIM) has been attracting increasing attention in the
architecture, engineering, and construction (AEC) industry in recent years. The wide spread …
architecture, engineering, and construction (AEC) industry in recent years. The wide spread …
[PDF][PDF] On the role of the high-low partition in realizing a degree sequence by a bipartite graph
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 …
bipartite graph. If a partition of the sequence into the two sides of the bipartite graph is given …
Phase transition of the 2-Choices dynamics on core–periphery networks
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 …
follows: Each agent initially holds either opinion blue or red; then, in each round, each agent …
Stochastic Opinion Dynamics for Interest Prediction in Social Networks
M Papachristou, D Fotakis - arXiv preprint arXiv:2107.03449, 2021 - arxiv.org
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 …
networks to develop faster and more accurate algorithms for user interest prediction. The …
Message lower bounds via efficient network synchronization
We present a uniform approach to derive message-time tradeoffs and message lower
bounds for synchronous distributed computations using results from communication …
bounds for synchronous distributed computations using results from communication …
Investigating the effectiveness of BIM-BMS integration on managing existing building facilities: A New Zealand educational building case
T Zhang - 2019 - openrepository.aut.ac.nz
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 …
the world's electricity consumption. Wherein, the operation accounts for 87% of total costs in …
[HTML][HTML] On network formation games with heterogeneous players and basic network creation games
C Kaklamanis, P Kanellopoulos, S Tsokana - Theoretical Computer Science, 2018 - Elsevier
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 …
large-scale networks and to capture the impact of selfish behavior, on behalf of the network …