The diameter of a scale-free random graph

DOI10.1007/S00493-004-0002-2MaRDI QIDQ1882139zbMATH OpenOpenAlexFDO

Authors Béla Bollobás, Oliver Riordan

Publication date 19 October 2004

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00493-004-0002-2

zbMATH Keywords

scale-free random graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• A new class of scale free random graphs
• Diameters in preferential attachment models
• An estimate of the probability of localisation of the diameter of a random scale-free graph
• Diameter in ultra-small scale-free random graphs
• Concentration of vertex degrees in a scale‐free random graph process

Cited in

(only showing first 100 items - show all)

• A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• scientific article; zbMATH DE number 2119680 (Why is no real title available?)
• Law of large numbers for the largest component in a hyperbolic model of complex networks
• Exponential extinction time of the contact process on finite graphs
• Contact processes on scale-free networks
• On the degree sequence of an evolving random graph process and its critical phenomenon
• Price Variation in a Bipartite Exchange Network
• Typical distances in a geometric model for complex networks
• Popularity based random graph models leading to a scale-free degree sequence
• On reversible cascades in scale-free and Erdős-Rényi random graphs
• Typical distances in ultrasmall random networks
• Justifying the small-world phenomenon via random recursive trees
• Universality for distances in power-law random graphs
• Diameters of uniform subset graphs
• The degree sequence of a scale-free random graph process
• Phase transition on the degree sequence of a random graph process with vertex copying and deletion
• Rumor spreading in social networks
• scientific article; zbMATH DE number 2076942 (Why is no real title available?)
• On the number of subgraphs of a random graph in the Barabasi-Albert model
• A Phase Transition for the Diameter of the Configuration Model
• A new class of scale free random graphs
• Sparse random graphs with clustering
• On Bollobás‐Riordan random pairing model of preferential attachment graph
• The diameter of sparse random graphs
• A stochastic complex network model
• Modularity in several random graph models
• Diameters in preferential attachment models
• On symmetry of uniform and preferential attachment graphs
• Ultra-small scale-free geometric networks
• The spectra of multiplicative attribute graphs
• The average distances in random graphs with given expected degrees
• Asymptotic behavior and distributional limits of preferential attachment graphs
• Small-world graphs: characterization and alternative constructions
• On a conditionally Poissonian graph process
• The diameter of sparse random graphs
• Testing permutation properties through subpermutations
• The diameter of random massive graphs
• On the impact of the migration topology on the island model
• The cover time of the preferential attachment graph
• On the hardness of optimization in power-law graphs
• Asymptotic theory for the multidimensional random on-line nearest-neighbour graph
• The phase transition in the uniformly grown random graph has infinite order
• The Average Distance in a Random Graph with Given Expected Degrees
• SIS epidemic propagation on hypergraphs
• The degree distribution of the generalized duplication model
• The diameter of protean graphs
• Introduction to complex networks: structure and dynamics
• The average path length of scale free networks
• On the number of subgraphs of the Barabási-Albert random graph
• On the distribution of distances between specified nodes in increasing trees
• Generating stationary random graphs on ℤ with prescribed independent, identically distributed degrees
• Generalized Stirling permutations, families of increasing trees and urn models
• Thresholds for virus spread on networks
• Structural sparsity of complex networks: bounded expansion in random models and real-world graphs
• A Geometric Preferential Attachment Model of Networks II
• Diameters of random circulant graphs
• On the degree distribution of the nodes in increasing trees
• The evolution of genetic topologies
• Degree sequences of geometric preferential attachment graphs
• Controllability, matching ratio and graph convergence
• Coupling Scale-Free and Classical Random Graphs
• Diameter of P.A. random graphs with edge-step functions
• It's a small world for random surfers
• Graph diameter in long-range percolation
• On a random graph evolving by degrees
• On distribution function of the diameter in uncertain graph
• On the diameter of hyperbolic random graphs
• The lattice of cycles of an undirected graph
• Spread of infection over P.A. random graphs with edge insertion
• The diameter of the directed configuration model
• Analytical estimates and proof of the scale-free character of efficiency and improvement in Barabási-Albert trees
• The clustering coefficient of a scale-free random graph
• The idemetric property: when most distances are (almost) the same
• A fast algorithm to find all high-degree vertices in graphs with a power-law degree sequence
• A new random graph model with self-optimizing nodes: connectivity and diameter
• The degree sequence of the preferential attachment model
• Phase changes in the topological indices of scale-free trees
• Satisfiability threshold for power law random 2-SAT in configuration model
• Perfect matchings and Hamiltonian cycles in the preferential attachment model
• scientific article; zbMATH DE number 7232749 (Why is no real title available?)
• A preferential attachment process approaching the Rado graph
• Generating infinite random graphs
• An estimate of the probability of localisation of the diameter of a random scale-free graph
• Strong ties or structural holes? A distance distribution perspective
• Shells structure in uncorrelated scale-free networks
• Clustering coefficients of large networks
• Tree evolution processes for bucket increasing trees
• Degree distribution of the FKP network model
• On the chromatic number of the preferential attachment graph
• Connectivity of random regular graphs generated by the pegging algorithm
• Diameter in ultra-small scale-free random graphs
• The three kinds of degree distributions and Nash equilibrium on the limiting random network
• Greedy routing in small-world networks with power-law degrees
• First encounters on Watts-Strogatz networks and Barabási-Albert networks
• Giant descendant trees, matchings, and independent sets in age-biased attachment graphs
• On limit behavior of maximum vertex degree in a conditional configuration graph near critical points
• From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial)
• Recent advances on mechanisms of network generation: community, exchangeability, and scale-free properties
• Paired threshold graphs

This page was built for publication: The diameter of a scale-free random graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1882139)