Scale-free graph with preferential attachment and evolving internal vertex structure

DOI10.1007/S10955-013-0749-1zbMath1273.82020OpenAlexW1964756196WikidataQ56170569 ScholiaQ56170569MaRDI QIDQ359574

Michał Matuszak, Jacek Miekisz, Krzysztof Choromanski

Publication date: 12 August 2013

Published in: Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10955-013-0749-1

zbMATH Keywords

random graphsscale-free graphspreferential attachment

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

Related Items (10)

Agents of change and the approximation of network outcomes: a simulation study ⋮ Financial networks and interconnectedness in an advanced emerging market economy ⋮ On new PageRank computation methods using quantum computing ⋮ Lyapunov-based anomaly detection in highly-clustered networks ⋮ The formation of continuous opinion dynamics based on a gambling mechanism and its sensitivity analysis ⋮ A trust model for spreading gossip in social networks: a multi-type bootstrap percolation model ⋮ Lyapunov-based anomaly detection in preferential attachment networks ⋮ Synchronization analysis of drive-response multi-layer dynamical networks with additive couplings and stochastic perturbations ⋮ Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks ⋮ Impact of network structure on synchronization of Hindmarsh-Rose neurons coupled in structured network

Cites Work

• Complex networks: structure and dynamics
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Scale-free graph with preferential attachment and evolving internal vertex structure