Friend recommendations in social networks using genetic algorithms and network topology

Network motifs are small subgraphs that reflect local network topology and were shown to be useful for creating profiles that reveal several properties of the network. In this work the motif analysis of the e-mail network of the Wroclaw University of Technology, consisting of over 4000 nodes was conducted. Temporal changes in the network structure during the period of 20 months were analysed and the correlations between global structural parameters of the network and motif distribution were found. These results are to be used in the development of methods dedicated for fast estimating of the properties of complex internet-based social networks.

Download Full-text

Industrial Network Topology Generation with Genetic Algorithms

2020 International Young Engineers Forum (YEF-ECE) ◽

10.1109/yef-ece49388.2020.9171812 ◽

2020 ◽

Author(s):

Christoph Fischer ◽

Maximilian Berndt ◽

Dennis Krummacker ◽

Janis Zemitis ◽

Daniel Fraunholz ◽

...

Keyword(s):

Genetic Algorithms ◽

Network Topology ◽

Topology Generation ◽

Industrial Network

Download Full-text

Dynamic Genetic Algorithms with Hyper-Mutation Schemes for Dynamic Shortest Path Routing Problem in Mobile Ad Hoc Networks

International Journal of Adaptive Resilient and Autonomic Systems ◽

10.4018/jaras.2012010105 ◽

2012 ◽

Vol 3 (1) ◽

pp. 87-98 ◽

Cited By ~ 1

Author(s):

Hui Cheng

Keyword(s):

Genetic Algorithms ◽

Wireless Networks ◽

Shortest Path ◽

Network Topology ◽

Ad Hoc ◽

Optimization Techniques ◽

Mobile Wireless Networks ◽

Mobile Wireless ◽

Routing Problem ◽

Mobile Ad Hoc

In recent years, the static shortest path (SP) routing problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks (ANNs), genetic algorithms (GAs), particle swarm optimization (PSO), etc. However, with the advancement in wireless communications, more and more mobile wireless networks appear, e.g., mobile ad hoc network (MANET), wireless mesh network (WMN), etc. One of the most important characteristics in mobile wireless networks is the topology dynamics, that is, the network topology changes over time due to energy conservation or node mobility. Therefore, the SP routing problem in MANETs turns out to be a dynamic optimization problem. This paper proposes to use two types of hyper-mutation GAs to solve the dynamic SP routing problem in MANETs. The authors consider MANETs as target systems because they represent new generation wireless networks. The experimental results show that the two hyper-mutation GAs can quickly adapt to the environmental changes (i.e., the network topology change) and produce good solutions after each change.

Download Full-text

The Speed of Innovation Diffusion in Social Networks

Econometrica ◽

10.3982/ecta17007 ◽

2020 ◽

Vol 88 (2) ◽

pp. 569-594

Author(s):

Itai Arieli ◽

Yakov Babichenko ◽

Ron Peretz ◽

H. Peyton Young

Keyword(s):

Social Networks ◽

Social Network ◽

Waiting Time ◽

Network Topology ◽

Upper Bound ◽

Status Quo ◽

Arbitrary Size ◽

The Status ◽

Expected Waiting Time ◽

Regular Networks

New ways of doing things often get started through the actions of a few innovators, then diffuse rapidly as more and more people come into contact with prior adopters in their social network. Much of the literature focuses on the speed of diffusion as a function of the network topology. In practice, the topology may not be known with any precision, and it is constantly in flux as links are formed and severed. Here, we establish an upper bound on the expected waiting time until a given proportion of the population has adopted that holds independently of the network structure. Kreindler and Young (2014) demonstrated such a bound for regular networks when agents choose between two options: the innovation and the status quo. Our bound holds for directed and undirected networks of arbitrary size and degree distribution, and for multiple competing innovations with different payoffs.

Download Full-text