共查询到20条相似文献,搜索用时 30 毫秒
1.
Community structure is an important characteristic in real complex network. It is a network consists of groups of nodes within which links are dense but among which links are sparse. In this paper, the evolving network include node, link and community growth and we apply the community size preferential attachment and strength preferential attachment to a growing weighted network model and utilize weight assigning mechanism from BBV model. The resulting network reflects the intrinsic community structure with generalized power-law distributions of nodes' degrees and strengths. 相似文献
2.
This paper studies a simple asymmetrically evolved community
network with a combination of preferential attachment and random
properties. An important issue about community networks is to
discover the different utility increments of two nodes, where the
utility is introduced to investigate the asymmetrical effect of
connecting two nodes. On the other hand, the connection of two nodes
in community networks can be classified as two nodes belonging to the
same or to different communities. The simulation results show that the
model can reproduce a power-law utility distribution P(u)~u-σ, σ = 2 + 1/p, which can be obtained by
using mean-field approximation methods. Furthermore, the model
exhibits exponential behaviour with respect to small values of a
parameter denoting the random effect in our model at the low-utility
region and a power-law feature with respect to big values of this
parameter at the high-utility region, which is in good agreement with
theoretical analysis. This kind of community network can reproduce
a unique utility distribution by theoretical and numerical analysis. 相似文献
3.
The study of community networks has attracted considerable attention recently. In this paper, we propose an evolving community network model based on local processes, the addition of new nodes intra-community and new links intra- or inter-community. Employing growth and preferential attachment mechanisms, we generate networks with a generalized power-law distribution of nodes’ degrees. 相似文献
4.
Hayato Goto Eduardo Viegas Henrik Jeldtoft Jensen Hideki Takayasu Misako Takayasu 《Journal of statistical physics》2018,172(4):1086-1100
The dynamical phase diagram of a network undergoing annihilation, creation, and coagulation of nodes is found to exhibit two regimes controlled by the combined effect of preferential attachment for initiator and target nodes during coagulation and for link assignment to new nodes. The first regime exhibits smooth dynamics and power law degree distributions. In the second regime, giant degree nodes and gaps in the degree distribution are formed intermittently. Data for the Japanese firm network in 1994 and 2014 suggests that this network is moving towards the intermittent switching region. 相似文献
5.
Andrzej Grabowski 《Physica A》2007,385(1):363-369
We study a large social network consisting of over 106 individuals, who form an Internet community and organize themselves in groups of different sizes. On the basis of the users’ list of friends and other data registered in the database we investigate the structure and time development of the network. The structure of this friendship network is very similar to the structure of different social networks. However, here a degree distribution exhibiting two scaling regimes, power-law for low connectivity and exponential for large connectivity, was found. The groups size distribution and distribution of number of groups of an individual have power-law form. We found very interesting scaling laws concerning human dynamics. Our research has shown how long people are interested in a single task. 相似文献
6.
为分析公交复杂网络的拓扑性质, 本文以北京市为例, 选取截止到2010年7月的北京全市(14区、2县)的1165条公交线路和9618个公交站点为样本数据, 运用复杂网络理论构建起基于邻接站点的有向加权复杂网络模型. 该方法以公交站点作为节点, 相邻站点之间的公交线路作为边, 使得网络既具有复杂网络的拓扑性质同时节点(站点)又具有明确的地理坐标. 对网络中节点度、点强度、强度分布、平均最短路径、聚类系数等性质的分析显示, 公交复杂网络的度和点强度分布极为不均, 网络中前5%和前10%节点的累计强度分布分别达到22.43%和43.02%; 点强度与排列序数、累积强度分布都服从幂律分布, 具有无标度和小世界的网络特点, 少数关键节点在网络中发挥着重要的连接作用. 为分析复杂网络中的关键节点, 本文通过承载压力分析和基于"掠夺" 的区域中心节点提取两种方法, 得到了公交复杂网络中两类不同表现的关键节点. 这些规律也为优化城市公交网络及交通规划发展提供了新的参考建议. 相似文献
7.
8.
We study the detailed growth of a social networking site with full temporal information by examining the creation process of each friendship relation that can collectively lead to the macroscopic properties of the network. We first study the reciprocal behavior of users, and find that link requests are quickly responded to and that the distribution of reciprocation intervals decays in an exponential form. The degrees of inviters/accepters are slightly negatively correlative with reciprocation time. In addition, the temporal feature of the online community shows that the distributions of intervals of user behaviors, such as sending or accepting link requests, follow a power law with a universal exponent, and peaks emerge for intervals of an integral day. We finally study the preferential selection and linking phenomena of the social networking site and find that, for the former, a linear preference holds for preferential sending and reception, and for the latter, a linear preference also holds for preferential acceptance, creation, and attachment. Based on the linearly preferential linking, we put forward an analyzable network model which can reproduce the degree distribution of the network. The research framework presented in the paper could provide a potential insight into how the micro-motives of users lead to the global structure of online social networks. 相似文献
9.
Temporal effects in the growth of networks 总被引:1,自引:0,他引:1
We show that to explain the growth of the citation network by preferential attachment (PA), one has to accept that individual nodes exhibit heterogeneous fitness values that decay with time. While previous PA-based models assumed either heterogeneity or decay in isolation, we propose a simple analytically treatable model that combines these two factors. Depending on the input assumptions, the resulting degree distribution shows an exponential, log-normal or power-law decay, which makes the model an apt candidate for modeling a wide range of real systems. 相似文献
10.
以中国铁路车站作为“节点”,每辆列车经过的相邻两个停靠车站之间连接一条“边”,构成有方向有权重的中国铁路客运网.首先研究了该网络的拓扑结构,包括连接度、聚集系数、最短路径和强度,结果表明中国铁路客运网的连接度分布,强度分布都是介于指数分布和幂率分布之间,是一个具有小世界性质的阶层网络.修建铁路需考虑人口分布,行政区域等因素.铁路固定设施成本高,修建完成后很难做变动,因此需考虑诸多空间地理环境对中国铁路客运网的影响,如站点的连接度和站点的相连站点之间的平均行驶距离之间的关系、车站的分布密度与人口密度的关系,
关键词:
铁路客运网
拓扑统计
小世界
地理环境 相似文献
11.
In this work, we first formulate the Tsallis entropy in the context of complex networks. We then propose a network construction whose topology maximizes the Tsallis entropy. The growing network model has two main ingredients: copy process and random attachment mechanism (C-R model). We show that the resulting degree distribution exactly agrees with the required degree distribution that maximizes the Tsallis entropy. We also provide another example of network model using a combination of preferential and random attachment mechanisms (P-R model) and compare it with the distribution of the Tsallis entropy. In this case, we show that by adequately identifying the exponent factor q, the degree distribution can also be written in the q-exponential form. Taken together, our findings suggest that both mechanisms, copy process and preferential attachment, play a key role for the realization of networks with maximum Tsallis entropy. Finally, we discuss the interpretation of q parameter of the Tsallis entropy in the context of complex networks. 相似文献
12.
Y.-P. Jeon B. J. McCoy 《The European Physical Journal B - Condensed Matter and Complex Systems》2007,60(4):521-528
Networks are commonly observed structures in complex
systems with interacting and interdependent parts that self-organize. For
nonlinearly growing networks, when the total number of connections increases
faster than the total number of nodes, the network is said to accelerate. We
propose a systematic model for the dynamics of growing networks represented
by distribution kinetics equations. We define the nodal-linkage
distribution, construct a population dynamics equation based on the
association-dissociation process, and perform the moment calculations to
describe the dynamics of such networks. For nondirectional networks with
finite numbers of nodes and connections, the moments are the total number of
nodes, the total number of connections, and the degree (the average number
of connections per node), represented by the average moment. Size
independent rate coefficients yield an exponential network describing the
network without preferential attachment, and size dependent rate
coefficients produce a power law network with preferential attachment. The
model quantitatively describes accelerating network growth data for a
supercomputer (Earth Simulator), for regulatory gene networks, and for the
Internet. 相似文献
13.
We abstract the bus transport networks (BTNs) to two kinds of complex networks with space L and space P methods respectively. Using improved community detecting algorithm (PKM agglomerative algorithm), we analyze the community property of two kinds of BTNs graphs. The results show that the BTNs graph described with space L method have obvious community property, but the other kind of BTNs graph described with space P method have not. The reason is that the BTNs graph described with space P method have the intense overlapping community property and general community division algorithms can not identify this kind of community structure. To overcome this problem, we propose a novel community structure called N-depth community and present a corresponding community detecting algorithm, which can detect overlapping community. Applying the novel community structure and detecting algorithm to a BTN evolution model described with space P, whose network property agrees well with real BTNs', we get obvious community property. 相似文献
14.
LI Ke-Ping 《理论物理通讯》2006,46(8)
In this work, we propose a new model of evolution networks, which is based on the evolution of the traffic flow. In our method, the network growth does not take into account preferential attachment, and the attachment of new node is independent of the degree of nodes. Our aim is that employing the theory of evolution network, we give a further understanding about the dynamical evolution of the traffic flow. We investigate the probability distributions and scaling properties of the proposed model. The simulation results indicate that in the proposed model, the distribution of the output connections can be well described by scale-free distribution. Moreover, the distribution of the connections is largely related to the traffic flow states, such as the exponential distribution (i.e., the scale-free distribution) and random distribution etc. 相似文献
15.
Vladimir Y. Chernyak Michael Chertkov David A. Goldberg Konstantin Turitsyn 《Journal of statistical physics》2010,140(5):819-845
We consider a stable open queuing network as a steady non-equilibrium system of interacting particles. The network is completely specified by its underlying graphical structure, type of interaction at each node, and the Markovian transition rates between nodes. For such systems, we ask the question “What is the most likely way for large currents to accumulate over time in a network ?”, where time is large compared to the system correlation time scale. We identify two interesting regimes. In the first regime, in which the accumulation of currents over time exceeds the expected value by a small to moderate amount (moderate large deviation), we find that the large-deviation distribution of currents is universal (independent of the interaction details), and there is no long-time and averaged over time accumulation of particles (condensation) at any nodes. In the second regime, in which the accumulation of currents over time exceeds the expected value by a large amount (severe large deviation), we find that the large-deviation current distribution is sensitive to interaction details, and there is a long-time accumulation of particles (condensation) at some nodes. The transition between the two regimes can be described as a dynamical second order phase transition. We illustrate these ideas using the simple, yet non-trivial, example of a single node with feedback. 相似文献
16.
LI Ke-Ping 《理论物理通讯》2006,46(2):374-380
In this work, we propose a new model of evolution networks, which is based on the evolution of the traffic flow. In our method, the network growth does not take into account preferential attachment, and the attachment of new node is independent of the degree of nodes. Our aim is that employing the theory of evolution network, we give a further understanding about the dynamical evolution of the traffic flow. We investigate the probability distributions and scaling properties of the proposed model The simulation results indicate that in the proposed model, the distribution of the output connections can be well described by scale-free distribution. Moreover, the distribution of the connections is largely related to the traffic flow states, such as the exponential distribution (i.e., the scale-free distribution) and random distribution etc. 相似文献
17.
Recently developed concepts and techniques of analyzing complex systems provide new insight into the structure of social networks. Uncovering recurrent preferences and organizational principles in such networks is a key issue to characterize them. We investigate school friendship networks from the Add Health database. Applying threshold analysis, we find that the friendship networks do not form a single connected component through mutual strong nominations within a school, while under weaker conditions such interconnectedness is present. We extract the networks of overlapping communities at the schools (c-networks) and find that they are scale free and disassortative in contrast to the direct friendship networks, which have an exponential degree distribution and are assortative. Based on the network analysis we study the ethnic preferences in friendship selection. The clique percolation method we use reveals that when in minority, the students tend to build more densely interconnected groups of friends. We also find an asymmetry in the behavior of black minorities in a white majority as compared to that of white minorities in a black majority. 相似文献
18.
In this paper, we propose an evolving network model growing fast in units of module, according to the analysis of the evolution characteristics in real complex networks. Each module is a small-world network containing several interconnected nodes and the nodes between the modules are linked by preferential attachment on degree of nodes. We study the modularity measure of the proposed model, which can be adjusted by changing the ratio of the number of inner-module edges and the number of inter-module edges. In view of the mean-field theory, we develop an analytical function of the degree distribution, which is verified by a numerical example and indicates that the degree distribution shows characteristics of the small-world network and the scale-free network distinctly at different segments. The clustering coefficient and the average path length of the network are simulated numerically, indicating that the network shows the small-world property and is affected little by the randomness of the new module. 相似文献
19.
通过数值模拟激光驱动下电子在周期性势阱中的动力学行为, 研究了晶体在激光场中发射高次谐波的特性. 研究发现在一定的激光波长和光强驱动下, 晶体发射的谐波谱会呈现出双平台结构, 经分析后得知第一个平台主要来自于最低导带与价带间的电流(电子-空穴对复合), 第二个平台主要来源于较高导带与价带间的电流(电子-空穴对复合), 且两个平台的截止位置处的能量都与激光场的振幅呈线性关系. 在少周期激光驱动下, 晶体谐波第二平台的截止位置与激光的载波相位呈单调变化, 由此我们提出可以利用晶体谐波第二平台的截止位置来确定少周期激光的载波相位. 进一步研究发现, 在啁啾激光驱动下, 晶体发射谐波谱的第二平台有较大变化, 第二平台的发射效率会随啁啾参数而改变, 能够通过改变啁啾激光场来提高晶体谐波第二平台的发射效率. 相似文献
20.
A. Santiago 《Physica A》2008,387(10):2365-2376
In this paper we present a study of the connectivity degrees of the threshold preferential attachment model, a generalization of the Barabási-Albert model to heterogeneous complex networks. The threshold model incorporates the states of the nodes in its preferential linking rule and assumes that the affinity between network nodes follows an inverse relationship with the distance between their states. We numerically analyze the connectivity degrees of the model, studying the influence of the main parameters on the distribution of connectivity degrees and its statistics, the average degree and highest degree of the network. We show that such statistics exhibit markedly different behaviors in the dependence on the model parameters, particularly as regards the interaction threshold. Nevertheless, we show that the two statistics converge in the limit of null threshold and often exhibit scaling that can be described by power laws of the model parameters. 相似文献