共查询到20条相似文献,搜索用时 31 毫秒
1.
We propose a deterministic weighted scale-free small-world model for considering pseudofractal web with the co-evolution of topology and weight. Considering the fluctuations in traffic flow constitute a main reason for congestion of packet delivery and poor performance of communication networks, we suggest a recursive algorithm to generate the network, which restricts the traffic fluctuations on it effectively during the evolutionary process. We provide a relatively complete view of topological structure and weight dynamics characteristics of the networks such as weight and strength distribution, degree correlations, average clustering coefficient and degree-cluster correlations as well as the diameter. 相似文献
2.
We introduce superposition-based quantum networks composed of (i) the classical perceptron model of multilayered, feedforward neural networks and (ii) the algebraic model of evolving reticular quantum structures as described in quantum gravity. The main feature of this model is moving from particular neural topologies to a quantum metastructure which embodies many differing topological patterns. Using quantum parallelism, training is possible on superpositions of different network topologies. As a result, not only classical transition functions, but also topology becomes a subject of training. The main feature of our model is that particular neural networks, with different topologies, are quantum states. We consider high-dimensionaldissipative quantum structures as candidates for implementation of the model. 相似文献
3.
Christopher Altman Jaroslaw Pykacz Romàn R. Zapatrin 《International Journal of Theoretical Physics》2004,43(10):2029-2040
We introduce superposition-based quantum networks composed of (i) the classical perceptron model of multilayered, feedforward neural networks and (ii) the algebraic model of evolving reticular quantum structures as described in quantum gravity. The main feature of this model is moving from particular neural topologies to a quantum metastructure which embodies many differing topological patterns. Using quantum parallelism, training is possible on superpositions of different network topologies. As a result, not only classical transition functions, but also topology becomes a subject of training. The main feature of our model is that particular neural networks, with different topologies, are quantum states. We consider high-dimensional dissipative quantum structures as candidates for implementation of the model. 相似文献
4.
Complex biological systems consist of large numbers of interconnected units, characterized by emergent properties such as collective computation. In spite of all the progress in the last decade, we still lack a deep understanding of how these properties arise from the coupling between the structure and dynamics. Here, we introduce the multiscale emergent functional state, which can be represented as a network where links encode the flow exchange between the nodes, calculated using diffusion processes on top of the network. We analyze the emergent functional state to study the distribution of the flow among components of 92 fungal networks, identifying their functional modules at different scales and, more importantly, demonstrating the importance of functional modules for the information content of networks, quantified in terms of network spectral entropy. Our results suggest that the topological complexity of fungal networks guarantees the existence of functional modules at different scales keeping the information entropy, and functional diversity, high. 相似文献
5.
Luciano da Fontoura Costa Filipi Nascimento Silva 《Journal of statistical physics》2006,125(4):841-872
While the majority of approaches to the characterization of complex networks has relied on measurements considering only the immediate neighborhood of each network node, valuable information about the network topological properties can be obtained by considering further neighborhoods. The current work considers the concept of virtual hierarchies established around each node and the respectively defined hierarchical node degree and clustering coefficient (introduced in cond-mat/0408076), complemented by new hierarchical measurements, in order to obtain a powerful set of topological features of complex networks. The interpretation of such measurements is discussed, including an analytical study of the hierarchical node degree for random networks, and the potential of the suggested measurements for the characterization of complex networks is illustrated with respect to simulations of random, scale-free and regular network models as well as real data (airports, proteins and word associations). The enhanced characterization of the connectivity provided by the set of hierarchical measurements also allows the use of agglomerative clustering methods in order to obtain taxonomies of relationships between nodes in a network, a possibility which is also illustrated in the current article. 相似文献
6.
A Hopfield neural network was constructed with relevance to protein dynamics. The dynamics of this network was analyzed by determining the distribution of first passage times between memories and its dependence on temperature. The distribution depended on the updating scheme. This illustrates the importance of choosing an updating scheme that leads to physically meaningful results in computational models of dynamic processes, such as in neural networks or molecular dynamics. 相似文献
7.
In this study, we analyze the network effect in a model of a personal communication market, by using a multi-agent based simulation approach. We introduce into the simulation model complex network structures as the interaction patterns of agents. With complex network models, we investigate the dynamics of a market in which two providers are competing. We also examine the structure of networks that affect the complex behavior of the market. By a series of simulations, we show that the structural properties of complex networks, such as the clustering coefficient and degree correlation, have a major influence on the dynamics of the market. We find that the network effect is increased if the interaction pattern of agents is characterized by a high clustering coefficient, or a positive degree correlation. We also discuss a suitable model of the interaction pattern for reproducing market dynamics in the real world, by performing simulations using real data of a social network. 相似文献
8.
复杂网络能够解决许多金融问题,能够发现金融市场的拓扑结构特征,反映不同金融主体之间的相互依赖关系.相关性度量在金融复杂网络构建中至关重要.通过将多元金融时间序列符号化,借鉴文本特征提取以及信息论的方法,定义了一种基于文本互信息的相关系数.为检验方法的有效性,分别构建了基于不同相关系数(Pearson和文本互信息)和不同网络缩减方法(阈值和最小生成树)的4个金融复杂网络模型.在阈值网络中提出了使用分位数来确定阈值的方法,将相关系数6等分,取第4部分的中点作为阈值,此时基于Pearson和文本互信息的阈值模型将会有相近的边数,有利于这两种模型的对比.数据使用了沪深两地证券市场地区指数收盘价,时间从2006年1月4日至2016年12月30日,共计2673个交易日.从网络节点相关性看,基于文本互信息的方法能够体现出大约20%的非线性相关关系;在网络整体拓扑指标上,本文计算了4种指标,结果显示能够使所保留的节点联系更为紧密,有效提高保留节点的重要性以及挖掘出更好的社区结构;最后,计算了阈值网络的动态指标,将数据按年分别构建网络,缩减方法只用了阈值方法,结果显示本文提出的方法在小世界动态和网络度中心性等指标上能够成功捕捉到样本区间内存在的两次异常波动.此外,本文构建的地区金融网络具有服从幂律分布、动态稳定性、一些经济欠发达地区在金融地区网络中占据重要地位等特性. 相似文献
9.
The topological structure of a dynamical network plays a pivotal part in its properties, dynamics and control. Thus, understanding and modeling the structure of a network will lead to a better knowledge of its evolutionary mechanisms and to a better cottoning on its dynamical and functional behaviors. However, in many practical situations, the topological structure of a dynamical network is usually unknown or uncertain. Thus, exploring the underlying topological structure of a dynamical network is of great value. In recent years, there has been a growing interest in structure identification of dynamical networks. As a result, various methods for identifying the network structure have been proposed. However, in most of the previous work, few of them were discussed in the perspective of optimization. In this paper, an optimization algorithm based on the projected conjugate gradient method is proposed to identify a network structure. It is straightforward and applicable to networks with or without observation noise. Furthermore, the proposed algorithm is applicable to dynamical networks with partially observed component variables for each multidimensional node, as well as small-scale networks with time-varying structures. Numerical experiments are conducted to illustrate the good performance and universality of the new algorithm. 相似文献
10.
Recent research has revealed a rich and complicated network topology in the cortical connectivity of mammalian brains. A challenging
task is to understand the implications of such network structures on the functional organisation of the brain activities.
We investigate synchronisation dynamics on the corticocortical network of the cat by modelling each node of the network (cortical
area) with a subnetwork of interacting excitable neurons. We find that this network of networks displays clustered synchronisation
behaviour and the dynamical clusters closely coincide with the topological community structures observed in the anatomical
network. The correlation between the firing rate of the areas and the areal intensity is additionally examined. Our results
provide insights into the relationship between the global organisation and the functional specialisation of the brain cortex.
相似文献
11.
Xiang Ling 《中国物理 B》2022,31(4):48901-048901
In recent years, most studies of complex networks have focused on a single network and ignored the interaction of multiple networks, much less the coupling mechanisms between multiplex networks. In this paper we investigate synchronization phenomena in multilayer networks with nonidentical topological structures based on three specific coupling mechanisms:assortative, disassortative, and anti-assortative couplings. We find rich and complex synchronous dynamic phenomena in coupled networks. We also study the behavior of effective frequencies for layers I and II to understand the underlying microscopic dynamics occurring under the three different coupling mechanisms. In particular, the coupling mechanisms proposed here have strong robustness and effectiveness and can produce abundant synchronization phenomena in coupled networks. 相似文献
12.
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 wealth 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ös–Rényi 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. 相似文献
13.
We consider two overlooked yet important factors that affect acquaintance network evolution and formation—friend-making resources and remembering—and propose a bottom-up, network-oriented simulation model based on three rules representing human social interactions. Our proposed model reproduces many topological features of real-world acquaintance networks, including a small-world phenomenon and a sharply peaked connectivity distribution feature that mixes power-law and exponential distribution types. We believe that this is an improvement over fieldwork sampling methods that fail to capture acquaintance network node connectivity distributions. Our model may produce valuable results for sociologists working with social opinion formation and epidemiologists studying epidemic dynamics. 相似文献
14.
Complex networks have been applied to model numerous interactive
nonlinear systems in the real world. Knowledge about network topology
is crucial to an understanding of the function, performance and
evolution of complex systems. In the last few years, many network
metrics and models have been proposed to investigate the network
topology, dynamics and evolution. Since these network metrics and
models are derived from a wide range of studies, a systematic study
is required to investigate the correlations among them. The present
paper explores the effect of degree correlation on the other network
metrics through studying an ensemble of graphs where the degree
sequence (set of degrees) is fixed. We show that to some extent, the
characteristic path length, clustering coefficient, modular extent
and robustness of networks are directly influenced by the degree
correlation. 相似文献
15.
16.
In this paper, we introduce a non-interacting boson model to investigate the topological structure of complex networks. By exactly solving this model, we show that it provides a powerful analytical tool in uncovering the important properties of realistic networks. We find that the ground-state degeneracy of this model is equal to the number of connected components in a network and the square of each coefficient in the expansion of the ground state gives the average time that a random walker spends at each node in the infinite time limit. To show the usefulness of this approach in practice, we also carry out numerical simulations on some concrete complex networks. Our results are completely consistent with the previous conclusions derived by graph theory methods. Furthermore, we show that the first excited state appears always on the largest connected component of the network. The relationship between the first excited energy and the average shortest path length in networks is also discussed. 相似文献
17.
18.
Topological probability and connection strength induced activity in complex neural networks 下载免费PDF全文
Recent experimental evidence suggests that some brain activities can be assigned to small-world networks. In this work, we investigate how the topological probability p and connection strength C affect the activities of discrete neural networks with small-world (SW) connections. Network elements are described by two-dimensional map neurons (2DMNs) with the values of parameters at which no activity occurs. It is found that when the value of p is smaller or larger, there are no active neurons in the network, no matter what the value of connection strength is; for a given appropriate connection strength, there is an intermediate range of topological probability where the activity of 2DMN network is induced and enhanced. On the other hand, for a given intermediate topological probability level, there exists an optimal value of connection strength such that the frequency of activity reaches its maximum. The possible mechanism behind the action of topological probability and connection strength is addressed based on the bifurcation method. Furthermore, the effects of noise and transmission delay on the activity of neural network are also studied. 相似文献
19.
Annick Lesne 《Letters in Mathematical Physics》2006,78(3):235-262
The aim of this text is to show the central role played by networks in complex system science. A remarkable feature of network studies is to lie at the crossroads of different disciplines, from mathematics (graph theory, combinatorics, probability theory) to physics (statistical physics of networks) to computer science (network generating algorithms, combinatorial optimization) to biological issues (regulatory networks). New paradigms recently appeared, like that of ‘scale-free networks’ providing an alternative to the random graph model introduced long ago by Erdös and Renyi. With the notion of statistical ensemble and methods originally introduced for percolation networks, statistical physics is of high relevance to get a deep account of topological and statistical properties of a network. Then their consequences on the dynamics taking place in the network should be investigated. Impact of network theory is huge in all natural sciences, especially in biology with gene networks, metabolic networks, neural networks or food webs. I illustrate this brief overview with a recent work on the influence of network topology on the dynamics of coupled excitable units, and the insights it provides about network emerging features, robustness of network behaviors, and the notion of static or dynamic motif. 相似文献
20.
《Comptes Rendus Physique》2018,19(4):205-232
Networks embedded in space can display all sorts of transitions when their structure is modified. The nature of these transitions (and in some cases crossovers) can differ from the usual appearance of a giant component as observed for the Erdös–Rényi graph, and spatial networks display a large variety of behaviors. We will discuss here some (mostly recent) results about topological transitions, ‘localization’ transitions seen in the shortest paths pattern, and also about the effect of congestion and fluctuations on the structure of optimal networks. The importance of spatial networks in real-world applications makes these transitions very relevant, and this review is meant as a step towards a deeper understanding of the effect of space on network structures. 相似文献