# Role of dimensionality in preferential attachment growth in the Bianconi–Barabási model

@article{Nunes2017RoleOD, title={Role of dimensionality in preferential attachment growth in the Bianconi–Barab{\'a}si model}, author={Thiago C. Nunes and S. G. A. Brito and Luciano R. da Silva and Constantino Tsallis}, journal={Journal of Statistical Mechanics: Theory and Experiment}, year={2017}, volume={2017}, pages={093402} }

Scale-free networks are quite popular nowadays since many systems are well represented by such structures. In order to study these systems, several models were proposed. However, most of them do not take into account the node-to-node Euclidean distance, i.e. the geographical distance. In real networks, the distance between sites can be very relevant, e.g. those cases where it is intended to minimize costs. Within this scenario we studied the role of dimensionality d in the Bianconi–Barabasi…

## 14 Citations

Networks with Growth and Preferential Attachment: Modeling and Applications

- Computer ScienceJ. Complex Networks
- 2021

It is found that characteristics as homophily, fitness and geographic distance are significant preferential attachment rules to modeling real networks.

Scaling properties of d-dimensional complex networks.

- Computer SciencePhysical review. E
- 2019

This paper numerically analyzed the time evolution of the connectivity of sites, the average shortest path, the degree distribution entropy, and the average clustering coefficient for d=1,2,3,4 and typical values of α_{A}.

Statistical mechanical approach of complex networks with weighted links

- Political Science
- 2021

, Systems which consist of many localized constituents interacting with each other can be rep-resented by complex networks. Consistently, network science has become highly popular in vast ﬁelds…

Connecting complex networks to nonadditive entropies

- Computer ScienceScientific reports
- 2021

The Boltzmann–Gibbs exponential factor is generically substituted by its q -generalisation, and is recovered in the $$q=1$$ q = 1 limit when the nonlocal effects fade away.

Erratum to “Surname complex network for Brazil and Portugal” [Physica A 499 (2018) 198–207]

- Computer SciencePhysica A: Statistical Mechanics and its Applications
- 2019

Surname complex network for Brazil and Portugal

- Computer SciencePhysica A: Statistical Mechanics and its Applications
- 2018

Validity and failure of the Boltzmann weight

- PhysicsEPL (Europhysics Letters)
- 2018

The dynamics and thermostatistics of a classical inertial XY model, characterized by long-range interactions, are investigated on d-dimensional lattices (d = 1, 2, and 3), through molecular dynamics.…

d-Dimensional Classical Heisenberg Model with Arbitrarily-Ranged Interactions: Lyapunov Exponents and Distributions of Momenta and Energies

- PhysicsEntropy
- 2019

Through the Lyapunov exponents, an intriguing, and possibly size-dependent, persistence of the non-Boltzmannian behavior even in the α/d>1 regime is observed.

Quasi-stationary-state duration in the classical d-dimensional long-range inertial XY ferromagnet.

- PhysicsPhysical review. E
- 2021

It is shown that the exponent A(α/d) and the coefficient B(N) present universal behavior (within error bars), comparing the XY and Heisenberg cases, and a scaling for t-QSS is proposed, namely, t_{QSS}∝N^{A( α/d)}e-B(N)(α/ d)^{2}, analogous to a recent analysis carried out for the classical α-Heisenberg inertial model.

## References

SHOWING 1-10 OF 27 REFERENCES

Preferential attachment growth model and nonextensive statistical mechanics

- Computer Science
- 2005

The present results reinforce the conjecture that the microscopic dynamics of nonextensive systems typically build (for instance, in Gibbs Γ-space for Hamiltonian systems) a scale-free network.

Role of dimensionality in complex networks

- Computer ScienceScientific reports
- 2016

D-dimensional geographically-located networks which grow with preferential attachment involving Euclidean distances through q-statistics are introduced and it is numerically verified that the q-exponential degree distributions exhibit universal dependences on the ratio αA/d.

Nonextensive aspects of self-organized scale-free gas-like networks

- Computer Science
- 2005

This work explores the possibility to interpret as a "gas" the dynamical self-organized scale-free network recently introduced by Kim et al. (2005), and numerically shows that this system exhibits nonextensive statistics in the degree distribution, and calculates how the entropic index q depends on α.

Network geometry with flavor: From complexity to quantum geometry.

- PhysicsPhysical review. E
- 2016

This work introduces the network geometry with flavor s=-1,0,1 (NGF) describing simplicial complexes defined in arbitrary dimension d and evolving by a nonequilibrium dynamics, and shows that NGF admits a quantum mechanical description in terms of associated quantum network states.

Emergence of scaling in random networks

- Computer ScienceScience
- 1999

A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.

Collective dynamics of ‘small-world’ networks

- Computer ScienceNature
- 1998

Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.

Preferential Attachment Scale-Free Growth Model with Random Fitness and Connection with Tsallis Statistics(COMPLEXITY AND NONEXTENSIVITY:NEW TRENDS IN STATISTICAL MECHANICS)

- Computer Science
- 2006

We introduce a network growth model in which the preferential attachment probability includes the fitness vertex and the Euclidean distance between nodes. We grow a planar network around its…

Competition and multiscaling in evolving networks

- Computer Science
- 2000

This work finds that competition for links translates into multiscaling, i.e. a fitness dependent dynamic exponent, allowing fitter nodes to overcome the more connected but less fit ones.