Numbers of n-th neighbors and node-to-node distances in growing networks
K. Malarz
Abstract
Topology of exponential and scale-free trees and simple graphs is investigated numerically. The numbers of the nearest neighbors, the next-nearest neighbors, the next-next-nearest neighbors, the 4-th and the 5-th neighbors are calculated. The functional dependence of the node-to-node distance dij on the product of connectivities kikj has been also checked. The results of simulations for exponential networks agree with the existing analytical predictions.
Create a lesson
Related papers
Long-time Dynamics of Many-body Open Quantum Systems using Quantum Generating Functions
Katha Ganguly, Dario Poletti, Bijay Kumar Agarwalla
Localization Delocalization Transition in Diffusion with Adaptive Resetting
Tommer D. Keidar, Shlomi Reuveni
Quenched activity induces nonuniversal scaling in nonreciprocal XY Models and surfaces
Sudip Mukherjee, Abhik Basu
Brownian yet non-Gaussian diffusion through equilibrium nonlinear friction
Jakob Mihatsch, Andreas M. Menzel
When dissipative steady states admit thermodynamic occupation laws
Tetsu Ichitsubo
Fluctuation--response relations from an emergent Z2 symmetry in the rotating stochastic Landau model
Dhruv Kush, Nicki Mullins, Mauricio Hippert et al.