اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA two-layer team-assembly model for invention networks
100
0
0.0
(
0
)
تأليف
Hiroyasu Inoue
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Companies are exposed to rigid competition, so they seek how best to improve the capabilities of their innovations. One strategy is to collaborate with other companies in order to speed up their own innovations. Such inter-company collaborations are conducted by inventors belonging to the companies. At the same time, the inventors also seem to be affected by past collaborations between companies. Therefore, interdependency of two networks, namely inventor and company networks, exists. This paper discusses a model that replicates two-layer networks extracted from patent data of Japan and the United States in terms of degree distributions. The model replicates two-layer networks with the interdependency. Moreover it is the only model that uses local information, while other models have to use overall information, which is unrealistic. In addition, the proposed model replicates empirical data better than other models.
قيم البحث
اقرأ أيضاً
Invention has been commonly conceptualized as a search over a space of combinatorial possibilities. Despite the existence of a rich literature, spanning a variety of disciplines, elaborating on the recombinant nature of invention, we lack a formal an
d quantitative characterization of the combinatorial process underpinning inventive activity. Here we utilize U.S. patent records dating from 1790 to 2010 to formally characterize the invention as a combinatorial process. To do this we treat patented inventions as carriers of technologies and avail ourselves of the elaborate system of technology codes used by the U.S. Patent Office to classify the technologies responsible for an inventions novelty. We find that the combinatorial inventive process exhibits an invariant rate of exploitation (refinements of existing combinations of technologies) and exploration (the development of new technological combinations). This combinatorial dynamic contrasts sharply with the creation of new technological capabilities -- the building blocks to be combined -- which has significantly slowed down. We also find that notwithstanding the very reduced rate at which new technologies are introduced, the generation of novel technological combinations engenders a practically infinite space of technological configurations.
Many real-world networks known as attributed networks contain two types of information: topology information and node attributes. It is a challenging task on how to use these two types of information to explore structural regularities. In this paper,
by characterizing potential relationship between link communities and node attributes, a principled statistical model named PSB_PG that generates link topology and node attributes is proposed. This model for generating links is based on the stochastic blockmodels following a Poisson distribution. Therefore, it is capable of detecting a wide range of network structures including community structures, bipartite structures and other mixture structures. The model for generating node attributes assumes that node attributes are high dimensional and sparse and also follow a Poisson distribution. This makes the model be uniform and the model parameters can be directly estimated by expectation-maximization (EM) algorithm. Experimental results on artificial networks and real networks containing various structures have shown that the proposed model PSB_PG is not only competitive with the state-of-the-art models, but also provides good semantic interpretation for each community via the learned relationship between the community and its related attributes.
Modularity structures are common in various social and biological networks. However, its dynamical origin remains an open question. In this work, we set up a dynamical model describing the evolution of a social network. Based on the observations of r
eal social networks, we introduced a link-creating/deleting strategy according to the local dynamics in the model. Thus the coevolution of dynamics and topology naturally determines the network properties. It is found that for a small coupling strength, the networked system cannot reach any synchronization and the network topology is homogeneous. Interestingly, when the coupling strength is large enough, the networked system spontaneously forms communities with different dynamical states. Meanwhile, the network topology becomes heterogeneous with modular structures. It is further shown that in a certain parameter regime, both the degree and the community size in the formed network follow a power-law distribution, and the networks are found to be assortative. These results are consistent with the characteristics of many empirical networks, and are helpful to understand the mechanism of formation of modularity in complex networks.
Identifying important nodes is one of the central tasks in network science, which is crucial for analyzing the structure of a network and understanding the dynamical processes on a network. Most real-world systems are time-varying and can be well rep
resented as temporal networks. Motivated by the classic gravity model in physics, we propose a temporal gravity model to identify influential nodes in temporal networks. Two critical elements in the gravity model are the masses of the objects and the distance between two objects. In the temporal gravity model, we treat nodes as the objects, basic node properties, such as static and temporal properties, as the nodes masses. We define temporal distances, i.e., fastest arrival distance and temporal shortest distance, as the distance between two nodes in our model. We utilize our model as well as the baseline centrality methods on important nodes identification. Experimental results on ten real-world datasets show that the temporal gravity model outperforms the baseline methods in quantifying node structural influence. Moreover, when we use the temporal shortest distance as the distance between two nodes, our model is robust and performs the best in quantifying node spreading influence compared to the baseline methods.
Many models of market dynamics make use of the idea of conservative wealth exchanges among economic agents. A few years ago an exchange model using extremal dynamics was developed and a very interesting result was obtained: a self-generated minimum w
ealth or poverty line. On the other hand, the wealth distribution exhibited an exponential shape as a function of the square of the wealth. These results have been obtained both considering exchanges between nearest neighbors or in a mean field scheme. In the present paper we study the effect of distributing the agents on a complex network. We have considered archetypical complex networks: Erd{o}s-Renyi random networks and scale-free networks. The presence of a poverty line with finite wealth is preserved but spatial correlations are important, particularly between the degree of the node and the wealth. We present a detailed study of the correlations, as well as the changes in the Gini coefficient, that measures the inequality, as a function of the type and average degree of the considered networks.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
