Article
Licensed
Unlicensed
Requires Authentication
An estimate of the probability of localisation of the diameter of a random scale-free graph
-
M. M. Musin
Published/Copyright:
January 7, 2011
Abstract
An estimate of the probability of localisation of the diameter of a scale-free random graph is given; this estimate improves the estimate obtained in 2004 by B. Bollobás and O. Riordan. Some possible applications of such graphs to analysis of complex stochastic networks are mentioned.
Received: 2010-05-05
Published Online: 2011-01-07
Published in Print: 2010-December
© de Gruyter 2010
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Bounds for the number of Boolean functions admitting affine approximations of a given accuracy
- Identification of a binary Markov chain of order s with r partial connections subjected to additive distortions
- On conditional Internet graphs whose vertex degrees have no mathematical expectation
- An estimate of the probability of localisation of the diameter of a random scale-free graph
- On a recursive class of plateaued Boolean functions
- On the distribution of some characteristics of a quasimonotone mapping
- The expressibility problem in a lattice with closure operation
- An algorithm to restore a linear recurring sequence over the ring R = Zpn from a linear complication of its highest coordinate sequence
- The uniform id-decomposition of functions of many-valued logic over homogeneous functions
- The completeness problem in the function algebra of linear integer-coefficient polynomials
- Circuits for disjunction admitting short unitary diagnostic tests
- The group of automorphisms of the set of bent functions
- Complexity of multiplication in commutative group algebras over fields of prime characteristic
- The summation of Markov sequences on a finite abelian group
- The asymptotics of the number of repetition-free Boolean functions in the basis B1
Articles in the same Issue
- Bounds for the number of Boolean functions admitting affine approximations of a given accuracy
- Identification of a binary Markov chain of order s with r partial connections subjected to additive distortions
- On conditional Internet graphs whose vertex degrees have no mathematical expectation
- An estimate of the probability of localisation of the diameter of a random scale-free graph
- On a recursive class of plateaued Boolean functions
- On the distribution of some characteristics of a quasimonotone mapping
- The expressibility problem in a lattice with closure operation
- An algorithm to restore a linear recurring sequence over the ring R = Zpn from a linear complication of its highest coordinate sequence
- The uniform id-decomposition of functions of many-valued logic over homogeneous functions
- The completeness problem in the function algebra of linear integer-coefficient polynomials
- Circuits for disjunction admitting short unitary diagnostic tests
- The group of automorphisms of the set of bent functions
- Complexity of multiplication in commutative group algebras over fields of prime characteristic
- The summation of Markov sequences on a finite abelian group
- The asymptotics of the number of repetition-free Boolean functions in the basis B1
