Choice-driven phase transition in complex networks

DOI10.1088/1742-5468/2014/04/P04021zbMATH Open1457.90043arXiv1312.7803MaRDI QIDQ3301925FDOQ3301925

Authors: P. L. Krapivsky, S. Redner 

Publication date: 11 August 2020

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Abstract: We investigate choice-driven network growth. In this model, nodes are added one by one according to the following procedure: for each addition event a set of target nodes is selected, each according to linear preferential attachment, and a new node attaches to the target with the highest degree. Depending on precise details of the attachment rule, the resulting networks has three possible outcomes: (i) a non-universal power-law degree distribution; (ii) a single macroscopic hub (a node whose degree is of the order of N, the number of network nodes), while the remainder of the nodes comprises a non-universal power-law degree distribution; (iii) a degree distribution that decays as (k ln k)^{-2} at the transition between cases (i) and (ii). These properties are robust when attachment occurs to the highest-degree node from at least two targets. When attachment is made to a target whose degree is not the highest, the degree distribution has the ultra-narrow double-exponential form exp(-const. x e^k), from which the largest degree grows only as ln(ln N).

Full work available at URL: https://arxiv.org/abs/1312.7803

Recommendations

• Preferential attachment with choice
• The power of choice in growing trees
• Scale-free behavior of networks with the copresence of preferential and uniform attachment rules
• The power of choice combined with preferential attachement
• The power of choice over preferential attachment

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15)

Cites Work

• Statistical mechanics of complex networks
• Networks. An introduction.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Balanced Allocations
• A kinetic view of statistical physics
• Finiteness and fluctuations in growing networks
• Probability and Computing
• On the maximum queue length in the supermarket model
• Parallel randomized load balancing
• On the power of two choices: balls and bins in continuous time
• Explosive percolation in random networks
• Avoiding a giant component
• Achlioptas process phase transitions are continuous
• Creating a Giant Component
• Birth control for giants
• The power of choice in growing trees

Cited In (4)

• Random recursive hypergraphs
• Preferential attachment with location-based choice: degree distribution in the noncondensation phase
• EIGENMODE OF THE DECISION-BY-MAJORITY PROCESS IN COMPLEX NETWORKS
• Sublinear preferential attachment combined with a growing number of choices

This page was built for publication: Choice-driven phase transition in complex networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3301925)