n-ary fragmentation model with nearest point flaw and maximal net force fracture

Through the distinction between “real” and “virtual” links between the nodes of a graph, we develop a set of simple rules leading to scale-free networks with a tunable degree distribution exponent. Albeit sharing some similarities with preferential attachment, our procedure is both faster than a naïve implementation of the Barabási and Albert model and exhibits different clustering properties. The model is thoroughly studied numerically and suggests that reducing the set of partners a node can connect to is important in seizing the diversity of scale-free structures.     

Degree correlation in scale-free graphs

We obtain closed form expressions for the expected conditional degree distribution and the joint degree distribution of the linear preferential attachment model for network growth in the steady state. We consider the multiple-destination preferential attachment growth model, where incoming nodes at each timestep attach to β existing nodes, selected by degree-proportional probabilities. By the conditional degree distribution p(?|k), we mean the degree distribution of nodes that are connected to a node of degree k. By the joint degree distribution p(k,?), we mean the proportion of links that connect nodes of degrees k and ?. In addition to this growth model, we consider the shifted-linear preferential growth model and solve for the same quantities, as well as a closed form expression for its steady-state degree distribution.     

Triadic Closure in Configuration Models with Unbounded Degree Fluctuations

The configuration model generates random graphs with any given degree distribution, and thus serves as a null model for scale-free networks with power-law degrees and unbounded degree fluctuations. For this setting, we study the local clustering c(k), i.e., the probability that two neighbors of a degree-k node are neighbors themselves. We show that c(k) progressively falls off with k and the graph size n and eventually for \(k=\varOmega (\sqrt{n})\) settles on a power law \(c(k)\sim n^{5-2\tau }k^{-2(3-\tau )}\) with \(\tau \in (2,3)\) the power-law exponent of the degree distribution. This fall-off has been observed in the majority of real-world networks and signals the presence of modular or hierarchical structure. Our results agree with recent results for the hidden-variable model and also give the expected number of triangles in the configuration model when counting triangles only once despite the presence of multi-edges. We show that only triangles consisting of triplets with uniquely specified degrees contribute to the triangle counting.     

Epidemic centrality — is there an underestimated epidemic impact of network peripheral nodes?

In the study of disease spreading on empirical complex networks in SIR model, initially infected nodes can be ranked according to some measure of their epidemic impact. The highest ranked nodes, also referred to as “superspreaders”, are associated to dominant epidemic risks and therefore deserve special attention. In simulations on studied empirical complex networks, it is shown that the ranking depends on the dynamical regime of the disease spreading. A possible mechanism leading to this dependence is illustrated in an analytically tractable example. In systems where the allocation of resources to counter disease spreading to individual nodes is based on their ranking, the dynamical regime of disease spreading is frequently not known before the outbreak of the disease. Therefore, we introduce a quantity called epidemic centrality as an average over all relevant regimes of disease spreading as a basis of the ranking. A recently introduced concept of phase diagram of epidemic spreading is used as a framework in which several types of averaging are studied. The epidemic centrality is compared to structural properties of nodes such as node degree, k-cores and betweenness. There is a growing trend of epidemic centrality with degree and k-cores values, but the variation of epidemic centrality is much smaller than the variation of degree or k-cores value. It is found that the epidemic centrality of the structurally peripheral nodes is of the same order of magnitude as the epidemic centrality of the structurally central nodes. The implications of these findings for the distributions of resources to counter disease spreading are discussed.     

A local-world evolving hypernetwork model

Complex hypernetworks are ubiquitous in the real system. It is very important to investigate the evolution mechanisms. In this paper, we present a local-world evolving hypernetwork model by taking into account the hyperedge growth and local-world hyperedge preferential attachment mechanisms. At each time step, a newly added hyperedge encircles a new coming node and a number of nodes from a randomly selected local world. The number of the selected nodes from the local world obeys the uniform distribution and its mean value is m. The analytical and simulation results show that the hyperdegree approximately obeys the power-law form and the exponent of hyperdegree distribution is γ = 2 + 1/m. Furthermore, we numerically investigate the node degree, hyperedge degree, clustering coefficient, as well as the average distance, and find that the hypernetwork model shares the scale-free and small-world properties, which shed some light for deeply understanding the evolution mechanism of the real systems.     

一类高聚类系数的加权无标度网络及其同步能力分析

针对真实世界中大规模网络都具有明显聚类效应的特点, 提出一类具有高聚类系数的加权无标度网络演化模型, 该模型同时考虑了优先连接、三角结构、随机连接和社团结构等四种演化机制. 在模型演化规则中, 以概率p增加单个节点, 以概率1–p增加一个社团. 与以往研究的不同在于新边的建立, 以概率φ在旧节点之间进行三角连接, 以概率1–φ进行随机连接. 仿真分析表明, 所提出的网络度、强度和权值分布都是服从幂律分布的形式, 且具有高聚类系数的特性, 聚类系数的提高与社团结构和随机连接机制有直接的关系. 最后通过数值仿真分析了网络演化机制对同步动态特性的影响, 数值仿真结果表明, 网络的平均聚类系数越小, 网络的同步能力越强. 关键词： 无标度网络 加权网络 聚类系数 同步能力     

Empirical extraction of mechanisms underlying real world network generation

The generation mechanisms of real world networks have been described using multiple models. The mathematical features of these models are usually extrapolated from statistical properties of a snapshot of these networks. We here propose an alternative method based on direct measurement of a sequence of consecutive snapshots to uncover the dynamics underlying real world generation. We assume that the probability of adding a node or an edge depends only on local features surrounding the newly added node/edge, and directly measure the contribution of these features to the node/edge addition probability. These measurements are performed using newly defined N-node local structures. Each N-node local structure represents the configuration of edges surrounding a newly added edge. The N-node local structure measurements reproduce for some networks the now classical addition of edges between high degree node mechanisms. It also provides quantitative estimates of more complex mechanisms driving other networks’ evolution, such as the effect of common first and second neighbors. This new methodology reveals the relative importance of different generation mechanisms. We show, for example, that the main mechanism driving hyperlink addition between two websites is the existence of a third website linking to both the source and the target of the new hyperlink.     

Nonlinear growth in weighted networks with neighborhood preferential attachment

We propose a nonlinear growing model for weighted networks with two significant characteristics: (i) the new weights triggered by new edges at each time step grow nonlinearly with time; and (ii) a neighborhood local-world exists for local preferential attachment, which is defined as one selected node and its neighbors. Global strength-driven and local weight-driven preferential attachment mechanisms are involved in our model. We study the evolution process through both mathematical analysis and numerical simulation, and find that the model exhibits a wide-range power-law distribution for node degree, strength, and weight. In particular, a nonlinear degree–strength relationship is obtained. This nonlinearity implies that accelerating growth of new weights plays a nontrivial role compared with accelerating growth of edges. Because of the specific local-world model, a small-world property emerges, and a significant hierarchical organization, independent of the parameters, is observed.     

Topological phase transition in a network model with preferential attachment and node removal

Preferential attachment is a popular model of growing networks. We consider a generalized model with random node removal, and a combination of preferential and random attachment. Using a high-degree expansion of the master equation, we identify a topological phase transition depending on the rate of node removal and the relative strength of preferential vs. random attachment, where the degree distribution goes from a power law to one with an exponential tail.     

Scale-Free Properties in Traffic System

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.     

An evolving network model with modular growth

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.     

Scale-Free Properties in Traffic System

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.     

Weighted Networks Model Based on Traffic Dynamics with Local Perturbation

In the study of weighted complex networks, the interplay between traffic and topology have been paid much attention. However, the variation of topology and weight brought by new added vertices or edges should also be considered. In this paper, an evolution model of weighted networks driven by traffic dynamics with local perturbation is proposed. The model gives power-law distribution of degree, weight and strength, as confirmed by empirical measurements. By choosing appropriate parameters W and δ, the exponents of various power law distributions can be adjusted to meet real world networks. Nontrivial clustering coefficient C, degree assortativity coefficient r, and strength-degree correlation are also considered. What should be emphasized is that, with the consideration of local perturbation, one can adjust the exponent of strength-degree correlation more effectively. It makes our model more general than previous ones and may help reproducing real world networks more appropriately. PACS numbers： 87.23.Kg, 89.75.Da, 89.75.Fb, 89.75.Hc.     

A model of classical thermodynamics based on the partition theory of integers,Earth gravitation,and semiclassical asymptotics. I

In the paper, a new construction of the theory of partitions of integers is proposed. The author defines entropy as the natural logarithm of the number of partitions of a number M into natural summands with repetitions allowed p(M) and repetitions forbidden q(M). The passage from ln p(M) to lnq(M) through the mesoscopic values M → 0 is studied. The topological transition from the mesoscopic lower levels of the Bohr–Kalckar construction to the macroscopic levels corresponding to the critical number of neutrons according to the consequence of Einstein’s inequality M ≤ c N _c , where c is determined for the particles of the given atomic nucleus. The role of quantum mechanics in establishing the new world outlook in physics is analyzed. It is pointed out that the main equations of thermodynamics in the volume “Statistical Physics” of the Landau–Lifshits treatise are obtained without appealing to the so-called “three main principles of thermodynamics”. It is also pointed out that Niels Bohr’s liquid model of the nucleus does not involve any interaction of particles in the form of attraction and is based on the presence of a common potential trough for all elements of the nucleus. The author constructs a new approach to thermodynamics, using quantum mechanics and the Earth’s gravitational attraction as a common potential trough.     

A criticism of the standard treatment of phonon drag

By the study of a simple example, namely the evolution in timet of an electron-phonon system with fixed, total momentum, it is shown that the “standard” treatment of “phonon drag”, which involves solving the (linearized and spatially homogeneous) coupled electron and phonon Boltzmann equations by an iteration procedure, is not always correct. In the asymptotic limit (t→∞), the iteration or “standard” procedure does not give the “correct” (i.e. the equilibrium statistical mechanical) result for the distribution of momentum between electrons and phonons. However, a proper treatment of the Boltzmann equations does lead to the “correct” sharing of momentum between electrons and phonons fort→∞. All the calculations in this paper are performed for metals at high temperatures (i.e.,T>Θ_D, the Debye temperature).     

An evolving model of online bipartite networks

Understanding the structure and evolution of online bipartite networks is a significant task since they play a crucial role in various e-commerce services nowadays. Recently, various attempts have been tried to propose different models, resulting in either power-law or exponential degree distributions. However, many empirical results show that the user degree distribution actually follows a shifted power-law distribution, the so-called Mandelbrot’s law, which cannot be fully described by previous models. In this paper, we propose an evolving model, considering two different user behaviors: random and preferential attachment. Extensive empirical results on two real bipartite networks, Delicious and CiteULike  , show that the theoretical model can well characterize the structure of real networks for both user and object degree distributions. In addition, we introduce a structural parameter p$p$, to demonstrate that the hybrid user behavior leads to the shifted power-law degree distribution, and the region of power-law tail will increase with the increment of p$p$. The proposed model might shed some lights in understanding the underlying laws governing the structure of real online bipartite networks.     

Jets as accelerators of ultrahigh-energy cosmic ray particles

The model of a cosmic jet that operates in the regimes of an MHD nozzle and a unipolar inductor is considered. It is shown that the “solid-body” rotation (according to Ferraro’s law) of helical magnetic field lines should lead to an acceleration of a small fraction of the plasma particles to ultrarelativistic energies with a spectrum dq/d? ～ ?^?n and an index n close to its observed value of n ≈ 2.70–2.75.     

A real space description of magnetic field induced melting in the charge ordered manganites: I. The clean limit

We study the melting of charge order in the half doped manganites using a model thatincorporates double exchange, antiferromagnetic superexchange, and Jahn-Teller couplingbetween electrons and phonons. We primarily use a real space Monte Carlo technique tostudy the phase diagram in terms of applied field (h) and temperature(T),exploring the melting of charge order with increasing h and its recovery ondecreasing h.We observe hysteresis in this response, and discover that the “field melted” highconductance state can be spatially inhomogeneous even without extrinsic disorder. Thehysteretic response plays out in the background of field driven equilibrium phaseseparation. Our results, exploring h, T, and the electronic parameter space, are backedup by analysis of simpler limiting cases and a Landau framework for the field response.This paper focuses on our results in the “clean” systems, a companion paper studies theeffect of cation disorder on the melting phenomena.