In: Multimedia Tools and Applications, 2015, vol. 74, no. 4, p. 1175-1197
|
In: International Journal of Modern Physics C, 2020, vol. 31, no. 04, p. 2050056
Community division in complex networks has become one of the hot topics in the field of network science. Most of the methods developed based on network topology ignore the dynamic characteristics underlying the structure. By exploring the diffusion process in the network based on random walk, this paper sums up the general rule with temporal characteristics as a temporary local balancing...
|
In: Journal of Informetrics, 2020, vol. 14, no. 1, p. 101005
Despite the increasing use of citation-based metrics for research evaluation purposes, we do not know yet which metrics best deliver on their promise to gauge the significance of a scientific paper or a patent. We assess 17 network-based metrics by their ability to identify milestone papers and patents in three large citation datasets. We find that traditional information-retrieval evaluation...
|
In: Physica A: Statistical Mechanics and its Applications, 2020, vol. 540, p. 123140
Interacting with each other, individuals in a population form various social network topologies. Models of evolutionary games on networks provide insight into how the collective behaviors of structured populations are influenced by individual decision making and network topologies. In a hierarchical society, many social resources are allocated according to certain social rankings, such as...
|
In: IEEE Access, 2019, vol. 7, p. 184145–184159
Community structure discovery can help us better understand the capabilities and functions of the network. However, many existing methods have failed to identify nodes in communities accurately. In this paper, we proposed a heuristic community detection method based on node similarities that are computed by assigning different edge weight influence factors based on different neighbor types of...
|
In: Entropy, 2019, vol. 21, no. 9, p. 859
In many industries, partners are interconnected in project alliances that have limited lifespans and clearly-defined boundaries. The transparency of the movie industry provides a unique opportunity to study how alliance network topologies impact the performance of project alliances from the perspectives of social networks and organization theories. In this work, we compiled a massive movie...
|
In: Physics Reports, 2019, vol. 817, p. 1–104
Uncovering the structure of socioeconomic systems and timely estimation of socioeconomic status are significant for economic development. The understanding of socioeconomic processes provides foundations to quantify global economic development, to map regional industrial structure, and to infer individual socioeconomic status. In this review, we will make a brief manifesto about a new ...
|
In: The Semantic Web – ISWC 2019, 2019, p. 453-469
Collaborative Knowledge Graph platforms allow humans and automated scripts to collaborate in creating, updating and interlinking entities and facts. To ensure both the completeness of the data as well as a uniform coverage of the different topics, it is crucial to identify underrepresented classes in the Knowledge Graph. In this paper, we tackle this problem by developing statistical techniques...
|
In: Discrete Mathematics, 2010, vol. 310, p. 132-146
Given an undirected graph G=(V,E) with matching number \nu(G), a d-blocker is a subset of edges B such that \nu(/V,E\B))= d. While the associated decision problem is NP-complete in bipartite graphs we show how to construct efficiently minimum d-transversals and minimum d-blockers in the...
|
In: Journal of Discrete Algorithms, 2012, vol. 17, p. 95-102
Let G = (V , E) be a graph in which every vertex v ∈ V has a weight w(v)>=0 and a cost c(v) >=0. Let SG be the family of all maximum-weight stable sets in G. For any integer d 0, a minimum d-transversal in the graph G with respect to SG is a subset of vertices T ⊆ V of minimum total cost such that |T ∩ S| d for every S ∈ SG. In this paper, we present a polynomial-time algorithm to...
|