Related papers: Collaborative similarity analysis of multilayer de…
Scale-free (SF) networks exhibiting a power-law degree distribution can be grouped into the assortative, dissortative and neutral networks according to the behavior of the degree-degree correlation coefficient. Here we investigate the…
The social community in open source software developers has a complex network structure. The network structure represents the relations between the project and the engineer in the software developer's community. A project forms some teams…
In a range of scientific coauthorship networks, transitions emerge in degree distributions, correlations between degrees and local clustering coefficients, etc. The existence of those transitions could be regarded as a result of the…
Retractions undermine the reliability of scientific literature and the foundation of future research. Analyzing collaboration networks in retracted papers can identify risk factors, such as recurring co-authors or institutions. This study…
Hypergraphs, graph generalizations where edges are conglomerates of $r$ nodes called hyperedges of rank $r\geq 2$, are excellent models to study systems with interactions that are beyond the pairwise level. For hypergraphs, the node degree…
Several studies have found that collaboration networks are scale-free, proposing that such networks can be modeled by specific network evolution mechanisms like preferential attachment. This study argues that collaboration networks can look…
Online social network (OSN) applications provide different experiences; for example, posting a short text on Twitter and sharing photographs on Instagram. Multiple OSNs constitute a multiplex network. For privacy protection and usage…
[Background] In large open-source software projects, development knowledge is often fragmented across multiple artefacts and contributors such that individual stakeholders are generally unaware of the full breadth of the product features.…
It is a well-known fact that the degree distribution (DD) of the nodes in a partition of a bipartite network influences the DD of its one-mode projection on that partition. However, there are no studies exploring the effect of the DD of the…
Mixing patterns in large self-organizing networks, such as the Internet, the World Wide Web, social and biological networks are often characterized by degree-degree {dependencies} between neighbouring nodes. One of the problems with the…
Correlation between nodes is found to be a common and important property in many complex networks. Here we investigate degree correlations of the Barabasi-Albert (BA) Scale-Free model with both analytical results and simulations, and find…
We introduce a new family of models for growing networks. In these networks new edges are attached preferentially to vertices with higher number of connections, and new vertices are created by already existing ones, inheriting part of their…
Within network data analysis, bipartite networks represent a particular type of network where relationships occur between two disjoint sets of nodes, formally called sending and receiving nodes. In this context, sending nodes may be…
This study is concerned with the dynamical behaviors of epidemic spreading over a two-layered interconnected network. Three models in different levels are proposed to describe cooperative spreading processes over the interconnected network,…
This study proposed a model to give a full-scale simulation for the dynamics of the collaborations in the dblp dataset. It is a distributed model with the capability of simulating large hypergraphs, namely systems with heterogeneously…
Besides a git-based version control system, GitHub integrates several social coding features. Particularly, GitHub users can star a repository, presumably to manifest interest or satisfaction with an open source project. However, the real…
Co-authorship networks, where nodes represent authors and edges represent co-authorship relations, are key to understanding the production and diffusion of knowledge in academia. Social constructs, biases (implicit and explicit), and…
This work investigates and compares the performance of node-link diagrams, adjacency matrices, and bipartite layouts for visualizing networks. In a crowd-sourced user study (n = 150), we measure the task accuracy and completion time of the…
Information spreads on complex social networks extremely fast, in other words, a piece of information can go viral within no time. Often it is hard to barricade this diffusion prior to the significant occurrence of chaos, be it a social…
Consider two data providers that want to contribute data to a certain learning model. Recent works have shown that the value of the data of one of the providers is dependent on the similarity with the data owned by the other provider. It…