Abstract: 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 2050468 (Why is no real title available?)
- scientific article; zbMATH DE number 1866312 (Why is no real title available?)
- An Exponential Family of Probability Distributions for Directed Graphs
- Emergence of Scaling in Random Networks
- Logit models and logistic regressions for social networks. I: An introduction to Markov graphs and \(p^*\)
- Markov Graphs
- Phase transitions in social networks
- Statistical mechanics of complex networks
Cited in
(27)- When is a scale-free graph ultra-small?
- Emergence of clustering in an acquaintance model without homophily
- Ranking the spreading ability of nodes in complex networks based on local structure
- The mean and variance of the distribution of shortest path lengths of random regular graphs
- Network model with scale-free, high clustering coefficients, and small-world properties
- Low-temperature behaviour of social and economic networks
- Influence of dynamical change of edges on clustering coefficients
- Phase transitions in a complex network
- A stochastic complex network model
- Nonequilibrium phase transitions in a model with social influence of inflexible units
- Simulating weighted, directed small-world networks
- Model of epidemic control based on quarantine and message delivery
- Reachability problems in interval-constrained and cardinality-constrained graphs
- Phase diagram of a continuous opinion dynamics on Barabasi–Albert networks
- Networks based on collisions among mobile agents
- Network coherence analysis on a family of nested weighted \(n\)-polygon networks
- Phase transitions in optimized network models
- Phase transitions in the edge/concurrent vertex model
- Strict convexity of the free energy of the canonical ensemble under decay of correlations
- Asymptotical properties of social network dynamics on time scales
- Decay of correlations and uniqueness of the Infinite-Volume Gibbs measure of the Canonical ensemble of 1d-lattice systems
- Social percolation revisited: from 2d lattices to adaptive networks
- Construction of equilibrium networks with an energy function
- Network analysis based on statistical-thermodynamics formalism
- Adaptive pinning synchronization control of the fractional-order chaos nodes in complex networks
- A symmetry breaking transition in the edge/triangle network model
- Phase transitions in social networks
This page was built for publication: Phase transitions in social networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q978775)
