標(biāo)題: Titlebook: Complex Networks; Eli Ben-Naim,Hans Frauenfelder,Zoltan Toroczkai Book 2004 Springer-Verlag Berlin Heidelberg 2004 biological networks.com [打印本頁] 作者: 法庭 時(shí)間: 2025-3-21 19:45
書目名稱Complex Networks影響因子(影響力)
書目名稱Complex Networks影響因子(影響力)學(xué)科排名
書目名稱Complex Networks網(wǎng)絡(luò)公開度
書目名稱Complex Networks網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Complex Networks被引頻次
書目名稱Complex Networks被引頻次學(xué)科排名
書目名稱Complex Networks年度引用
書目名稱Complex Networks年度引用學(xué)科排名
書目名稱Complex Networks讀者反饋
書目名稱Complex Networks讀者反饋學(xué)科排名
作者: Anecdote 時(shí)間: 2025-3-21 23:34
Transport, Overview and Recent Developments,n addition we show how the problem of strong disorder on a random graph can be mapped onto a percolation problem on a Cayley tree and using this mapping, obtain the probability distribution of the maximal weight on the optimal path.作者: 脫水 時(shí)間: 2025-3-22 01:57 作者: Emg827 時(shí)間: 2025-3-22 05:40
Stability in the Financial Systemnge links. Besides its importance concerning network security, our result has the unexpected implication that the small-world phenomenon in these scale-free networks is mainly due to short-range links.作者: Phagocytes 時(shí)間: 2025-3-22 11:14
James R. Barth,R. Dan Brumbaugh Jr. the strength of collaborative ties and propose a measure of this strength based on the number of papers coauthored by pairs of scientists, and the number of other scientists with whom they worked on those papers. Using a selection of our results, we suggest a variety of possible ways to answer the question “Who is the best connected scientist?”作者: 遍及 時(shí)間: 2025-3-22 15:45
The Small World Phenomenonin Hybrid Power Law Graphs,is uniquely determined depending only on the local connectivity). We can then apply our theoretical results for analyzing real graphs, provided the parameters of the hybrid model can be appropriately chosen.作者: 遍及 時(shí)間: 2025-3-22 17:07 作者: FORGO 時(shí)間: 2025-3-22 21:48 作者: Free-Radical 時(shí)間: 2025-3-23 04:05 作者: 山崩 時(shí)間: 2025-3-23 06:14
Who Is the Best Connected Scientist?A Study of Scientific Coauthorship Networks, the strength of collaborative ties and propose a measure of this strength based on the number of papers coauthored by pairs of scientists, and the number of other scientists with whom they worked on those papers. Using a selection of our results, we suggest a variety of possible ways to answer the question “Who is the best connected scientist?”作者: 感染 時(shí)間: 2025-3-23 09:55 作者: 向前變橢圓 時(shí)間: 2025-3-23 17:29 作者: –LOUS 時(shí)間: 2025-3-23 19:00
,A Tractable Complex Network Model Based on?the Stochastic Mean-Field Model of Distance,. The model is mathematically natural, permits a wide variety of explicit calculations, has the desired three qualitative features, and fits the complete range of degree scaling exponents and clustering parameters; in these respects it compares favorably with existing models.作者: mercenary 時(shí)間: 2025-3-24 00:47
Equilibrium Statistical Mechanicsof Network Structures,haracteristics, such as degrees, degree-degree correlations, component sizes, and spectral properties. We conclude with topological phase transitions and show examples for both continuous and discontinuous transitions.作者: instulate 時(shí)間: 2025-3-24 06:04
Emergence of Complexity in Financial Networks,In most of the cases these three kind of networks display scale-free properties making them interesting in their own. Nevertheless, we want to stress here that the main utility of this methodology is to provide new measures of the real data sets in order to validate the different models.作者: 過剩 時(shí)間: 2025-3-24 07:06 作者: 悠然 時(shí)間: 2025-3-24 12:41 作者: slow-wave-sleep 時(shí)間: 2025-3-24 15:37
Stability and Wave Motion in Porous Mediatogether with selected models that reproduce certain attributes of clustering in various networks. Lastly, we present an example of problems faced when solving a simple relevance-based model by one of the common methods in widespread use.作者: Anthology 時(shí)間: 2025-3-24 22:44 作者: Humble 時(shí)間: 2025-3-25 01:41
Clustering in Complex Networks,together with selected models that reproduce certain attributes of clustering in various networks. Lastly, we present an example of problems faced when solving a simple relevance-based model by one of the common methods in widespread use.作者: HEAVY 時(shí)間: 2025-3-25 03:30 作者: SOB 時(shí)間: 2025-3-25 08:34 作者: 相一致 時(shí)間: 2025-3-25 13:53
Peter J. Schmid,Dan S. Henningsonmation, calculate spectra of various graphs analytically. We also analyse the spectra of various complex networks and discuss the role of vertices of low degree. We show that spectra of locally tree-like random graphs gives a good description of the spectral properties of real-life networks like the Internet.作者: HAVOC 時(shí)間: 2025-3-25 16:15 作者: vascular 時(shí)間: 2025-3-25 23:49 作者: 人類的發(fā)源 時(shí)間: 2025-3-26 03:51 作者: dilute 時(shí)間: 2025-3-26 06:26
Mathematical Theory of Second-Grade Fluids,g simulated annealing optimization, it is shown that optimally heterogeneous nets actually cluster around the same narrow domain, suggesting that strong constraints actually operate on the possible universe of complex networks. The evolutionary implications are discussed.作者: originality 時(shí)間: 2025-3-26 09:05
Stability in the US Financial Systemum statistical mechanics models as well as to various non-equilibrium processes. Finally, we apply these results to the specific case of the Edwards-Wilkinson equation. There, we find that the mean-field behavior is valid for .>2 dimensions, but that for .≤ 2 dimensions there is anomalous scaling.作者: GET 時(shí)間: 2025-3-26 14:24
,Information Theory of Complex Networks: On?Evolution and Architectural Constraints,g simulated annealing optimization, it is shown that optimally heterogeneous nets actually cluster around the same narrow domain, suggesting that strong constraints actually operate on the possible universe of complex networks. The evolutionary implications are discussed.作者: enmesh 時(shí)間: 2025-3-26 18:52 作者: palette 時(shí)間: 2025-3-26 22:51
Tomography and Stability of Complex Networks,the phase transition and show that the critical exponents are influenced by the scale free nature of the network. We show that the critical exponent for the infinite cluster size behaves as ., and the exponent for the finite clusters size distribution behaves as ., for .. For . the exponents are .=1作者: contrast-medium 時(shí)間: 2025-3-27 02:14
,Classes of the Shortest Pathway Structures in?Scale Free Networks,ribution of diameter change by the removal of a single vertex. Finally, we remark that since the two numerical values of the load exponent are too close, it still remains an open question if they are really robust. Analytic solution resolving this controversial issue is needed.作者: subordinate 時(shí)間: 2025-3-27 05:30
Scholarly Information Network,large online corpus of academic literature. An emerging field of research can be identified as part of an existing corpus, permitting the implementation of a more coherent community structure for its network of practitioners.作者: 制造 時(shí)間: 2025-3-27 12:16 作者: TOXIN 時(shí)間: 2025-3-27 14:29
https://doi.org/10.1007/978-1-4614-3743-7ribution of diameter change by the removal of a single vertex. Finally, we remark that since the two numerical values of the load exponent are too close, it still remains an open question if they are really robust. Analytic solution resolving this controversial issue is needed.作者: 史前 時(shí)間: 2025-3-27 19:39
Stability in the US Financial Systemlarge online corpus of academic literature. An emerging field of research can be identified as part of an existing corpus, permitting the implementation of a more coherent community structure for its network of practitioners.作者: insightful 時(shí)間: 2025-3-27 22:18
Tomography and Stability of Complex Networks,kdown of nodes and intentional attack on the most highly connected nodes. We focus on scale free networks, where ., for .<.<.. We first examine the “Tomography” of these networks, i.e. the structure of layers around a network node. It is shown that the distance distribution of all nodes from the max作者: mastoid-bone 時(shí)間: 2025-3-28 03:45
Spectral Analysis of Random Networks,spectra of networks with a local tree-like structure, are presented. The tail of the density of eigenvalues . at large . is related to the behavior of the vertex degree distribution for large value of degree. In particular, as ., .. Under an effective medium approximation we propose a simple approxi作者: indubitable 時(shí)間: 2025-3-28 07:58
,A Tractable Complex Network Model Based on?the Stochastic Mean-Field Model of Distance,ive features: power-law degree distributions, local clustering, and slowly-growing diameter. We point out a new (in this context) platform for such models – the stochastic mean-field model of distances – and within this platform study a simple two-parameter proportional attachment (or copying) model作者: 消滅 時(shí)間: 2025-3-28 13:19 作者: BURSA 時(shí)間: 2025-3-28 17:23
,Classes of the Shortest Pathway Structures in?Scale Free Networks, a fraction of data packets traveling along the shortest pathways between every pair of vertices. It is found that the load distributions for many real-world networks follow a power law with an exponent . which is close to either 2.2(1) (class I) or 2.0 (class II), insensitive to different values of作者: impale 時(shí)間: 2025-3-28 19:23 作者: 模仿 時(shí)間: 2025-3-29 01:40
Clustering in Complex Networks,y linked triples of nodes. This is captured by the concept of clustering. We review a few milestones in the quantitative description of this feature, together with selected models that reproduce certain attributes of clustering in various networks. Lastly, we present an example of problems faced whe作者: Rotator-Cuff 時(shí)間: 2025-3-29 03:13
Equilibrium Statistical Mechanicsof Network Structures,el way of defining equilibrium graph (network) ensembles. We illustrate this concept on the classical random graph model and then survey a large variety of recently studied network models. Next, we analyze the structural properties of the graphs in these ensembles in terms of both local and global c作者: Dysplasia 時(shí)間: 2025-3-29 09:28
,Information Theory of Complex Networks: On?Evolution and Architectural Constraints,nder node removal. Several correlation measures have been defined in order to characterize the structure of these nets. Here we show that mutual information, noise and joint entropies can be properly defined on a static graph. These measures are computed for a number of real networks and analyticall作者: 慢跑 時(shí)間: 2025-3-29 11:59
On the Analysis of Backtrack Proceduresfor the Colouring of Random Graphs,s. Analysis of the performances of these procedures is a long-standing open problem in theoretical computer science. I present some statistical physics ideas and techniques to attack this problem. The approach is illustrated on the colouring of random graphs, and some current limitations and perspec作者: JUST 時(shí)間: 2025-3-29 17:33
Small-World Synchronized Computing Networks for Scalable Parallel Discrete-Event Simulations,chronization topology mimics that of the short-range interacting underlying system, the virtual time horizon (corresponding to the progress of the processing elements) exhibits Kardar-Parisi-Zhang-like kinetic roughening. Although the virtual times, on average, progress at a nonzero rate, their stat作者: pellagra 時(shí)間: 2025-3-29 21:14 作者: 使絕緣 時(shí)間: 2025-3-30 01:47
Attacks and Cascades in Complex Networks, the subsequent failure of other parts of the network induced by the failure of or attacks on only a few nodes. We investigate a mechanism leading to cascades of overload failures in complex networks by constructing a simple model incorporating the flow of physical quantities in the network. The sec作者: jabber 時(shí)間: 2025-3-30 04:56
Scholarly Information Network,scholarly publication models. If we were to start from scratch today to design a quality-controlled archive and distribution system for scientific and technical information, it could take a very different form from what has evolved in the past decade from pre-existing print infrastructure. Near-term作者: Hormones 時(shí)間: 2025-3-30 09:28
Who Is the Best Connected Scientist?A Study of Scientific Coauthorship Networks,ration between scientists in each of these disciplines. In these networks two scientists are considered connected if they have coauthored one or more papers together. We have studied many statistical properties of our networks, including numbers of papers written by authors, numbers of authors per p作者: occurrence 時(shí)間: 2025-3-30 12:36 作者: Extemporize 時(shí)間: 2025-3-30 19:04 作者: 減少 時(shí)間: 2025-3-30 23:22
Eli Ben-Naim,Hans Frauenfelder,Zoltan ToroczkaiIncludes supplementary material: 作者: PAGAN 時(shí)間: 2025-3-31 01:39 作者: Constant 時(shí)間: 2025-3-31 06:03 作者: MIME 時(shí)間: 2025-3-31 10:17
978-3-642-06110-3Springer-Verlag Berlin Heidelberg 2004作者: 聲明 時(shí)間: 2025-3-31 14:01
Progress in Mathematical PhysicsThe extremal characteristics of random structures, including trees, graphs, and networks, are discussed. A statistical physics approach is employed in which extremal properties are obtained through suitably defined rate equations. A variety of unusual time dependences and system-size dependences for basic extremal properties are obtained.作者: 輕而薄 時(shí)間: 2025-3-31 20:26 作者: Vital-Signs 時(shí)間: 2025-4-1 01:15 作者: Anecdote 時(shí)間: 2025-4-1 04:12
Information Dynamics in the Networked World,We review three studies of information flow in social networks that help reveal their underlying social structure, how information spreads among them and why small world experiments work.作者: 連系 時(shí)間: 2025-4-1 08:39 作者: exophthalmos 時(shí)間: 2025-4-1 13:55 作者: DOLT 時(shí)間: 2025-4-1 17:39 作者: 存在主義 時(shí)間: 2025-4-1 20:10
https://doi.org/10.1007/978-1-4613-0185-1ive features: power-law degree distributions, local clustering, and slowly-growing diameter. We point out a new (in this context) platform for such models – the stochastic mean-field model of distances – and within this platform study a simple two-parameter proportional attachment (or copying) model
