scholarly journals Preferential attachment graphs as agent interaction structure

2020 ◽  
Vol 1441 ◽  
pp. 012176
Author(s):  
M N Yudina
Author(s):  
Catarina LELIS

The brand is a powerful representational and identification-led asset that can be used to engage staff in creative, sustainable and developmental activities. Being a brand the result of, foremost, a design exercise, it is fair to suppose that it can be a relevant resource for the advancement of design literacy within organisational contexts. The main objective of this paper was to test and validate an interaction structure for an informed co-design process on visual brand artefacts. To carry on the empirical study, a university was chosen as case study as these contexts are generally rich in employee diversity. A non-functional prototype was designed, and walkthroughs were performed in five focus groups held with staff. The latter evidenced a need/wish to engage with basic design principles and high willingness to participate in the creation of brand design artefacts, mostly with the purposeof increasing its consistent use and innovate in its representation possibilities, whilst augmenting the brand’s socially responsible values.


Author(s):  
Mark Newman

This chapter describes models of the growth or formation of networks, with a particular focus on preferential attachment models. It starts with a discussion of the classic preferential attachment model for citation networks introduced by Price, including a complete derivation of the degree distribution in the limit of large network size. Subsequent sections introduce the Barabasi-Albert model and various generalized preferential attachment models, including models with addition or removal of extra nodes or edges and models with nonlinear preferential attachment. Also discussed are node copying models and models in which networks are formed by optimization processes, such as delivery networks or airline networks.


2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Jason Hindes ◽  
Victoria Edwards ◽  
Klimka Szwaykowska Kasraie ◽  
George Stantchev ◽  
Ira B. Schwartz

AbstractUnderstanding swarm pattern formation is of great interest because it occurs naturally in many physical and biological systems, and has artificial applications in robotics. In both natural and engineered swarms, agent communication is typically local and sparse. This is because, over a limited sensing or communication range, the number of interactions an agent has is much smaller than the total possible number. A central question for self-organizing swarms interacting through sparse networks is whether or not collective motion states can emerge where all agents have coherent and stable dynamics. In this work we introduce the phenomenon of swarm shedding in which weakly-connected agents are ejected from stable milling patterns in self-propelled swarming networks with finite-range interactions. We show that swarm shedding can be localized around a few agents, or delocalized, and entail a simultaneous ejection of all agents in a network. Despite the complexity of milling motion in complex networks, we successfully build mean-field theory that accurately predicts both milling state dynamics and shedding transitions. The latter are described in terms of saddle-node bifurcations that depend on the range of communication, the inter-agent interaction strength, and the network topology.


2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Ghislain Romaric Meleu ◽  
Paulin Yonta Melatagia

AbstractUsing the headers of scientific papers, we have built multilayer networks of entities involved in research namely: authors, laboratories, and institutions. We have analyzed some properties of such networks built from data extracted from the HAL archives and found that the network at each layer is a small-world network with power law distribution. In order to simulate such co-publication network, we propose a multilayer network generation model based on the formation of cliques at each layer and the affiliation of each new node to the higher layers. The clique is built from new and existing nodes selected using preferential attachment. We also show that, the degree distribution of generated layers follows a power law. From the simulations of our model, we show that the generated multilayer networks reproduce the studied properties of co-publication networks.


2021 ◽  
Vol 13 (3) ◽  
pp. 1512
Author(s):  
Yicheol Han ◽  
Stephan J. Goetz ◽  
Claudia Schmidt

This article presents a spatial supply network model for estimating and visualizing spatial commodity flows that used data on firm location and employment, an input–output table of inter-industry transactions, and material balance-type equations. Building on earlier work, we proposed a general method for visualizing detailed supply chains across geographic space, applying the preferential attachment rule to gravity equations in the network context; we then provided illustrations for U.S. extractive, manufacturing, and service industries, also highlighting differences in rural–urban interdependencies across these sectors. The resulting visualizations may be helpful for better understanding supply chain geographies, as well as business interconnections and interdependencies, and to anticipate and potentially address vulnerabilities to different types of shocks.


2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Linqing Liu ◽  
Mengyun Shen ◽  
Chang Tan

AbstractFailing to consider the strong correlations between weights and topological properties in capacity-weighted networks renders test results on the scale-free property unreliable. According to the preferential attachment mechanism, existing high-degree nodes normally attract new nodes. However, in capacity-weighted networks, the weights of existing edges increase as the network grows. We propose an optimized simplification method and apply it to international trade networks. Our study covers more than 1200 product categories annually from 1995 to 2018. We find that, on average, 38%, 38% and 69% of product networks in export, import and total trade are scale-free. Furthermore, the scale-free characteristics differ depending on the technology. Counter to expectations, the exports of high-technology products are distributed worldwide rather than concentrated in a few developed countries. Our research extends the scale-free exploration of capacity-weighted networks and demonstrates that choosing appropriate filtering methods can clarify the properties of complex networks.


2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Naomi A. Arnold ◽  
Raul J. Mondragón ◽  
Richard G. Clegg

AbstractDiscriminating between competing explanatory models as to which is more likely responsible for the growth of a network is a problem of fundamental importance for network science. The rules governing this growth are attributed to mechanisms such as preferential attachment and triangle closure, with a wealth of explanatory models based on these. These models are deliberately simple, commonly with the network growing according to a constant mechanism for its lifetime, to allow for analytical results. We use a likelihood-based framework on artificial data where the network model changes at a known point in time and demonstrate that we can recover the change point from analysis of the network. We then use real datasets and demonstrate how our framework can show the changing importance of network growth mechanisms over time.


Sign in / Sign up

Export Citation Format

Share Document