February 19, 2019
Similar papers 2
October 21, 2009
The existence of explosive phase transitions in random (Erd\H os R\'enyi-type) networks has been recently documented by Achlioptas et al.\ [Science {\bf 323}, 1453 (2009)] via simulations. In this Letter we describe the underlying mechanism behind these first-order phase transitions and develop tools that allow us to identify (and predict) when a random network will exhibit an explosive transition. Several interesting new models displaying explosive transitions are also prese...
April 4, 2002
We develop a statistical mechanics approach for random networks with uncorrelated vertices. We construct equilibrium statistical ensembles of such networks and obtain their partition functions and main characteristics. We find simple dynamical construction procedures that produce equilibrium uncorrelated random graphs with an arbitrary degree distribution. In particular, we show that in equilibrium uncorrelated networks, fat-tailed degree distributions may exist only starting...
January 16, 2007
We study a model of network with clustering and desired node degree. The original purpose of the model was to describe optimal structures of scientific collaboration in the European Union. The model belongs to the family of exponential random graphs. We show by numerical simulations and analytical considerations how a very simple Hamiltonian can lead to surprisingly complicated and eventful phase diagram.
July 14, 2021
The spontaneous formation and subsequent growth, dissolution, merger and competition of social groups bears similarities to physical phase transitions in metastable finite systems. We examine three different scenarios, percolation, spinodal decomposition and nucleation, to describe the formation of social groups of varying size and density. In our agent-based model, we use a feedback between the opinions of agents and their ability to establish links. Groups can restrict furt...
April 1, 2008
We study a one parameter family of random graph models that spans a continuum between traditional random graphs of the Erd\H{o}s-R\'enyi type, where there is no underlying structure, and percolation models, where the possible edges are dictated exactly by a geometry. We find that previously developed theories in the fields of random graphs and percolation have, starting from different directions, covered almost all the models described by our family. In particular, the existe...
January 30, 2004
In this article we give an in depth overview of the recent advances in the field of equilibrium networks. After outlining this topic, we provide a novel 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 characteristics, such as degree...
August 4, 2010
We have studied nucleation dynamics of the Ising model in scale-free networks with degree distribution $P(k)\sim k^{-\gamma}$ by using forward flux sampling method, focusing on how the network topology would influence the nucleation rate and pathway. For homogeneous nucleation, the new phase clusters grow from those nodes with smaller degree, while the cluster sizes follow a power-law distribution. Interestingly, we find that the nucleation rate $R_{Hom}$ decays exponentially...
August 25, 2017
We study the relaxation dynamics of fully clustered networks (maximal number of triangles) to an unclustered state under two different edge dynamics---the double-edge swap, corresponding to degree-preserving randomization of the configuration model, and single edge replacement, corresponding to full randomization of the Erd\H{o}s--R\'enyi random graph. We derive expressions for the time evolution of the degree distribution, edge multiplicity distribution and clustering coeffi...
February 20, 2012
Identifying nucleation pathway is important for understanding the kinetics of first-order phase transitions in natural systems. In the present work, we study nucleation pathway of the Ising model in homogeneous and heterogeneous networks using the forward flux sampling method, and find that the nucleation processes represent distinct features along pathways for different network topologies. For homogeneous networks, there always exists a dominant nucleating cluster to which r...
June 6, 2003
To provide a phenomenological theory for the various interesting transitions in restructuring networks we employ a statistical mechanical approach with detailed balance satisfied for the transitions between topological states. This enables us to establish an equivalence between the equilibrium rewiring problem we consider and the dynamics of a lattice gas on the edge-dual graph of a fully connected network. By assigning energies to the different network topologies and definin...