Exact solution of finite size Mean Field Percolation and application to nuclear fragmentation

Random Graphs and Mean Field Percolation are two names given to the most general mathematical model of systems composed of a set of connected entities. It has many applications in the study of real life networks as well as physical systems. The model shows a precisely described phase transition, but its solution for finite systems was yet unresolved. However, atomic nuclei, as well as other mesoscopic objects (e.g. molecules, nano-structures), cannot be considered as infinite and their fragmentation does not necessarily occur close to the transition point. Here, we derive for the first time the exact solution of Mean Field Percolation for systems of any size, as well as provide important information on the internal structure of Random Graphs. We show how these equations can be used as a basis to select non-trivial correlations in systems and thus to provide evidence for physical phenomena.     

Percolation on bipartite scale-free networks

Recent studies introduced biased (degree-dependent) edge percolation as a model for failures in real-life systems. In this work, such process is applied to networks consisting of two types of nodes with edges running only between nodes of unlike type. Such bipartite graphs appear in many social networks, for instance in affiliation networks and in sexual-contact networks in which both types of nodes show the scale-free characteristic for the degree distribution. During the depreciation process, an edge between nodes with degrees k and q is retained with a probability proportional to (kq)^−α, where α is positive so that links between hubs are more prone to failure. The removal process is studied analytically by introducing a generating functions theory. We deduce exact self-consistent equations describing the system at a macroscopic level and discuss the percolation transition. Critical exponents are obtained by exploiting the Fortuin-Kasteleyn construction which provides a link between our model and a limit of the Potts model.     

Percolation on infinitely ramified fractal networks

We study how fractal features of an infinitely ramified network affect its percolation properties. The fractal attributes are characterized by the Hausdorff ($D_H$), topological Hausdorff ($D_{tH}$), and spectral ($d_s$) dimensions. Monte Carlo simulations of site percolation were performed on pre-fractal standard Sierpiński carpets with different fractal attributes. Our findings suggest that within the universality class of random percolation the values of critical percolation exponents are determined by the set of dimension numbers ($D_H$, $D_{tH}$, $d_s$), rather than solely by the spatial dimension (d). We also argue that the relevant dimension number for the percolation threshold is the topological Hausdorff dimension $D_{tH}$, whereas the hyperscaling relations between critical exponents are governed by the Hausdorff dimension $D_H$. The effect of the network connectivity on the site percolation threshold is revealed.     

Percolation on shopping and cashback electronic commerce networks

Many realistic networks live in the form of multiple networks, including interacting networks and interdependent networks. Here we study percolation properties of a special kind of interacting networks, namely Shopping and Cashback Electronic Commerce Networks (SCECNs). We investigate two actual SCECNs to extract their structural properties, and develop a mathematical framework based on generating functions for analyzing directed interacting networks. Then we derive the necessary and sufficient condition for the absence of the system-wide giant in- and out- component, and propose arithmetic to calculate the corresponding structural measures in the sub-critical and supercritical regimes. We apply our mathematical framework and arithmetic to those two actual SCECNs to observe its accuracy, and give some explanations on the discrepancies. We show those structural measures based on our mathematical framework and arithmetic are useful to appraise the status of SCECNs. We also find that the supercritical regime of the whole network is maintained mainly by hyperlinks between different kinds of websites, while those hyperlinks between the same kinds of websites can only enlarge the sizes of in-components and out-components.     

Skeleton of weighted social network

In the literature of social networks, understanding topological structure is an important scientific issue. In this paper, we construct a network from mobile phone call records and use the cumulative number of calls as a measure of the weight of a social tie. We extract skeletons from the weighted social network on the basis of the weights of ties, and we study their properties. We find that strong ties can support the skeleton in the network by studying the percolation characters. We explore the centrality of w$w$-skeletons based on the correlation between some centrality measures and the skeleton index w$w$ of a vertex, and we find that the average centrality of a w$w$-skeleton increases as w$w$ increases. We also study the cumulative degree distribution of the successive w$w$-skeletons and find that as w$w$ increases, the w$w$-skeleton tends to become more self-similar. Furthermore, fractal characteristics appear in higher w$w$-skeletons. We also explore the global information diffusion efficiency of w$w$-skeletons using simulations, from which we can see that the ties in the high w$w$-skeletons play important roles in information diffusion. Identifying such a simple structure of a w$w$-skeleton is a step forward toward understanding and representing the topological structure of weighted social networks.     

Percolation processes in monomer-polyatomic mixtures

In this paper, the percolation of mixtures of monomers and polyatomic species (k$k$-mers) on a square lattice is studied. By means of a finite-size scaling analysis, the critical exponents and the scaling collapsing of the fraction of percolating lattices are found. A phase diagram separating a percolating from a non-percolating region is determined. The main features of the phase diagram are discussed in order to predict its evolution for larger k$k$-mer sizes.     

Knotted Paths in Percolation

We study the topology of doubly-infinite paths in the bond percolation model on the three-dimensional cubic lattice. We propose a natural definition of a knotted doubly-infinite path. We prove the existence of a critical probability p _k satisfying p _c < p _k < 1 (where p _c is the usual percolation critical probability), such that for p _c < p < p _k , all doubly-infinite open paths are knotted, while for p > p _k there are unknotted doubly-infinite paths.     

Inequalities in Entanglement Percolation

We present proofs of two results concerning entanglement in three-dimensional bond percolation. Firstly, the critical probability for entanglement with free boundary conditions is strictly less than the critical probability for connectivity percolation. (The proof presented here is a detailed justification of the ideas sketched in Aizenman and Grimmett.) Secondly, under the hypothesis that the critical probabilities for entanglement with free and wired boundary conditions are different, for p between the two critical probabilities, the size of the entangled cluster at the origin with free boundary conditions does not have exponentially decaying tails.     

Percolation and the Potts model

The Kasteleyn-Fortuin formulation of bond percolation as a lattice statistical model is rederived using an alternate approach. It is shown that the quantities of interest arising in the percolation problem, including the critical exponents, can be obtained from the solution of the Potts model. We also establish the Griffith inequality for critical exponents for the bond percolation problem.Work supported in part by NSF Grant No. D MR 76-20643.     

Percolation scale effects in metal-insulator thin films

Thin metal films near their continuity threshold and metal-insulator mixture films near their metal-insulator transition are well described by the percolation theory. Here we demonstrate that statement by reviewing some geometrical measurements done on both types of thin films. We then comment on the measurements of the other physical quantities.     

Percolation Phenomena in Low and High Density Systems

We consider the 2D quenched–disordered q–state Potts ferromagnets and show that in the translation invariant measure, averaged over the disorder, at self–dual points any amalgamation of q?1 species will fail to percolate despite an overall (high) density of 1?q ^?1. Further, in the dilute bond version of these systems, if the system is just above threshold, then throughout the low temperature phase there is percolation of a single species despite a correspondingly small density. Finally, we demonstrate both phenomena in a single model by considering a “perturbation” of the dilute model that has a self–dual point. We also demonstrate that these phenomena occur, by a similar mechanism, in a simple coloring model invented by O. Häggström.     

Percolation on networks with dependence links

As a classical model of statistical physics, the percolation theory provides a powerful approach to analyze the network structure and dynamics. Recently, to model the relations among interacting agents beyond the connection of the networked system, the concept of dependence link is proposed to represent the dependence relationship of agents. These studies suggest that the percolation properties of these networks differ greatly from those of the ordinary networks. In particular,unlike the well known continuous transition on the ordinary networks, the percolation transitions on these networks are discontinuous. Moreover, these networks are more fragile for a broader degree distribution, which is opposite to the famous results for the ordinary networks. In this article, we give a summary of the theoretical approaches to study the percolation process on networks with inter- and inner-dependence links, and review the recent advances in this field, focusing on the topology and robustness of such networks.     

Multiple routes transmitted epidemics on multiplex networks

This letter investigates the multiple routes transmitted epidemic process on multiplex networks. We propose detailed theoretical analysis that allows us to accurately calculate the epidemic threshold and outbreak size. It is found that the epidemic can spread across the multiplex network even if all the network layers are well below their respective epidemic thresholds. Strong positive degree–degree correlation of nodes in multiplex network could lead to a much lower epidemic threshold and a relatively smaller outbreak size. However, the average similarity of neighbors from different layers of nodes has no obvious effect on the epidemic threshold and outbreak size.     

Percolation and Minimal Spanning Trees

Consider a random set of points in the box [n, –n) ^d , generated either by a Poisson process with density p or by a site percolation process with parameter p. We analyze the empirical distribution function F _n of the lengths of edges in a minimal (Euclidean) spanning tree on . We express the limit of F _n, as n , in terms of the free energies of a family of percolation processes derived from by declaring two points to be adjacent whenever they are closer than a prescribed distance. By exploring the singularities of such free energies, we show that the large-n limits of the moments of F _n are infinitely differentiable functions of p except possibly at values belonging to a certain infinite sequence (p _c(k): k 1) of critical percolation probabilities. It is believed that, in two dimensions, these limiting moments are twice differentiable at these singular values, but not thrice differentiable. This analysis provides a rigorous framework for the numerical experimentation of Dussert, Rasigni, Rasigni, Palmari, and Llebaria, who have proposed novel Monte Carlo methods for estimating the numerical values of critical percolation probabilities.     

Percolation of chains and jamming coverage in two dimensions by computer simulation

A computer simulation model is used to study the percolation of random chains with a self-avoiding constraint. The percolation threshold is found to decay with the chain lengthL _c with a power lawL _c ^–0.1 , while the jamming coverage varies asL _c ^–1/3 .     

Line graphs as social networks

It was demonstrated recently that the line graphs are clustered and assortative. These topological features are known to characterize some social networks [M.E.J. Newman, Y. Park, Why social networks are different from other types of networks, Phys. Rev. E 68 (2003) 036122]; it was argued that this similarity reveals their cliquey character. In the model proposed here, a social network is the line graph of an initial network of families, communities, interest groups, school classes and small companies. These groups play the role of nodes, and individuals are represented by links between these nodes. The picture is supported by the data on the LiveJournal network of about 8×10⁶ people.     

荷电膜渗透传质过程的计算机模拟：一价离子的传递

以渗透理论的方法研究一价离子通过荷电膜的传质机理,用计算机编程模拟一价带电离子通过荷电膜的过程以研究荷电膜中导电性能和荷电组分含量的关系.模拟结果表明,对于二维格栅体系在荷电组分含量为0.4～0.6时,膜导电性能存在渗透突跃现象;而对于三维格栅体系则在0.1～0.2时存在渗透突跃现象,此结果和MontoCarlo的二维、三维随机模拟结果比较接近.由于实际的荷电膜也可看作为三维格栅体系,因此,可用三维格栅体系程序对不同荷电分率膜的电导数据进行拟合,结果表明,对于实际的磺化聚苯硫醚(SPPS)/聚醚砜(PES)共混膜,当荷电组分SPPS的分率达到0.144时,共混膜即会从不良导体变为良导体,显然该值落在理论值0.1～0.2,因此,理论模拟结果与实际荷电膜传质的实验数据相吻合.     

Percolation,fractals, and anomalous diffusion

Both the infinite cluster and its backbone are self-similar at the percolation threshold,p _c . This self-similarity also holds at concentrationsp nearp _c , for length scalesL which are smaller than the percolation connectedness length,. ForL<, the number of bonds on the infinite cluster scales asL ^D , where the fractal dimensionalityD is equal to(d-/v). Geometrical fractal models, which imitate the backbone and on which physical models are exactly solvable, are presented. Above six dimensions, one has D=4 and an additional scaling length must be included. The effects of the geometrical structure of the backbone on magnetic spin correlations and on diffusion at percolation are also discussed.