How to construct a correlated net
S. N. Dorogovtsev, J. F. F. Mendes, A. N. Samukhin
Abstract
(a) We propose a ``static'' construction procedure for random networks with given correlations of the degrees of the nearest-neighbor vertices. This is an equilibrium graph, maximally random under the constraint that its degree-degree distribution is fixed. (b) We generalize the notion of preferential linking and introduce a new category, pair preference and a pair preference function for the attaching of edges to pairs of vertices. This allows dynamically generate equilibrium correlated networks.
Create a lesson
Related papers
Universal Boolean Computation in Negatively Coupled Circle Map Lattices
Priyanka D. Bhoyar, Prashant M. Gade
Developing the Statistical Mechanics of Evolving Assembly Spaces
Anisha K. Yeddanapudi, Abhishek Sharma, Ian Seet et al.
Ergodicity breaking transition beyond qubits
Tanay Pathak, Abhik Kumar Saha
Extended-range percolation on lattices with cubic and non-compact neighborhoods in three dimensions
Zhe Zhang, Yuxuan Fan, Yang Yang et al.
Competitive scaling of small-subsystem-optimization heuristics for LABS
Ginger E. Lau, Adil A. Gangat
IceCube data for astrophysical neutrinos exhibit q-statistical behavior
Constantino Tsallis, Ugur Tirnakli