Author(s)

José Miguel Montañana¹, Antonio Hervás², Pedro Pablo Soriano³

¹High Performance Computing Center Stuttgart (HLRS), University of Stuttgart, Nobelstraβe, Stuttgart, Germany.
²Instituto Universitario de Matemática Multidisciplinar, Universitat Politècnica de València, Valencia, Spain.
³SEPyC, Universitat Politècnica de València, Valencia, Spain.

The previous studies on detection of communities on complex networks were focused on nondirected graphs, such as Neural Networks, social networks, social interrelations, the contagion of diseases, and bibliographies. However, there are also other problems whose modeling entails obtaining a weakly connected directed graph such as the student access to the university, the public transport networks, or trophic chains. Those cases deserve particularized study with an analysis and the resolution adjusted to them. Additionally, this is a challenge, since the existing algorithms in most of the cases were originally designed for non-directed graphs or symmetrical and regular graphs. Our proposal is a Benchmark Generator of Weakly Connected Directed Graphs whose properties can be defined by the end-users according to their necessities. The source code of the generators described in this article is available in GitHub under the GNU license.

Graphs and Networks Applications, Clustering, Cluster Analysis, Complex Networks, Social Models, Higher Education Management

Montañana, J. , Hervás, A. and Soriano, P. (2020) A Proposal for a Benchmark Generator of Weakly Connected Directed Graphs. Open Journal of Modelling and Simulation, 8, 18-34. doi: 10.4236/ojmsi.2020.81002.