February 19, 2019
Similar papers 5
October 26, 2010
The focus of this thesis is about statistical mechanics on heterogeneous random graphs, i.e. how this heterogeneity affects the cooperative behavior of model systems. It is not intended as a review on it, rather it is showed how this question emerges naturally and can give useful insights to specific instances. The first chapter is about the statistical mechanics of congestion in queuing networks. The second is devoted to the study of the glassy dynamics of facilitated spin m...
February 20, 2003
We study the dynamics of Random Threshold Network (RTN) on scale free networks, with asymmetric links, some interaction rules where propagation of local perturbations depends on in-degree $k$ of the nodes. We find that there is no phase transition with respect to average connectivty independently of network topology for the case temperature T=0, threshold $h=0$ and the probability distribution of indegree $P(k)$ satisfies $P(0)=D=0$. We have investigated the emergence of phas...
July 13, 2014
We compare phase transition and critical phenomena of bond percolation on Euclidean lattices, nonamenable graphs, and complex networks. On a Euclidean lattice, percolation shows a phase transition between the nonpercolating phase and percolating phase at the critical point. The critical point is stretched to a finite region, called the critical phase, on nonamenable graphs. To investigate the critical phase, we introduce a fractal exponent, which characterizes a subextensive ...
December 18, 2003
We discuss various aspects of the statistical formulation of the theory of random graphs, with emphasis on results obtained in a series of our recent publications.
March 15, 2013
We investigate the nucleation of Ising model on complex networks and focus on the role played by the heterogeneity of degree distribution on nucleation rate. Using Monte Carlo simulation combined with forward flux sampling, we find that for a weak external field the nucleation rate decreases monotonically as degree heterogeneity increases. Interestingly, for a relatively strong external field the nucleation rate exhibits a nonmonotonic dependence on degree heterogeneity, in w...
May 3, 2005
We review recent results on the dynamics of social networks which suggest that the interplay between the network formation process and volatility may lead to the occurrence of discontinuous phase transitions and phase coexistence in a large class of models. We then investigate the effects of negative links -- links inhibiting local growth of the network -- and of a geographical distribution of the agents in such models. We show, by extensive numerical simulations, that both e...
October 22, 2012
We propose a simple model for a binary decision making process on a graph, motivated by modeling social decision making with cooperative individuals. The model is similar to a random field Ising model or fiber bundle model, but with key differences on heterogeneous networks. For many types of disorder and interactions between the nodes, we predict discontinuous phase transitions with mean field theory which are largely independent of network structure. We show how these phase...
October 14, 2013
Growing network models with both heterogeneity of the nodes and topological constraints can give rise to a rich phase structure. We present a simple model based on preferential attachment with rewiring of the links. Rewiring probabilities are modulated by the negative fitness of the nodes and by the constraint for the network to be a simple graph. At low temperatures and high rewiring rates, this constraint induces a Bose-Einstein condensation of paths of length 2, i.e. a new...
January 26, 2010
We discuss several interesting random network models which exhibit (provable) explosive transitions and their applications.
June 19, 2005
We study the evolution of social networks that contain both friendly and unfriendly pairwise links between individual nodes. The network is endowed with dynamics in which the sense of a link in an imbalanced triad--a triangular loop with 1 or 3 unfriendly links--is reversed to make the triad balanced. With this dynamics, an infinite network undergoes a dynamic phase transition from a steady state to "paradise"--all links are friendly--as the propensity p for friendly links in...