General Connectivity Distribution Functions for Growing Networks with Preferential Attachment of Fractional Power
arXiv:cond-mat/0702497 · doi:10.1063/1.2812419
Abstract
We study the general connectivity distribution functions for growing networks with preferential attachment of fractional power, , using the Simon's method. We first show that the heart of the previously known methods of the rate equations for the connectivity distribution functions is nothing but the Simon's method for word problem. Secondly, we show that the case of fractional the -transformation of the rate equation provides a fractional differential equation of new type, which coincides with that for PA with linear power, when . We show that to solve such a fractional differential equation we need define a transidental function that we call {\it upsilon function}. Most of all previously known results are obtained consistently in the frame work of a unified theory.
10 pages
References in corpus (23)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Evolution of networks
- Resilience of the Internet to random breakdowns
- Self-similarity of complex networks
- Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model
- Topology of evolving networks: local events and universality
- Universal Behavior of Load Distribution in Scale-free Networks
- Connectivity of Growing Random Networks
- Organization of Growing Random Networks
- Bose-Einstein condensation in complex networks
- Generation of uncorrelated random scale-free networks
- Are randomly grown graphs really random?
- Degree Distributions of Growing Networks
- Spectra of complex networks
- Scaling properties of scale-free evolving networks: Continuous approach
- Scaling Behaviour of Developing and Decaying Networks
- Exact solutions for models of evolving networks with addition and deletion of nodes
- World-Wide Web scaling exponent from Simon's 1955 model
- A generative model for feedback networks
- Evolving networks by merging cliques
- Nonlinear Barabási-Albert Network