The diameter of a scale-free random graph
From MaRDI portal
Publication:1882139
DOI10.1007/s00493-004-0002-2zbMath1047.05038OpenAlexW2061118827MaRDI QIDQ1882139
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
Related Items
Towards a Systematic Evaluation of Generative Network Models, Exponential extinction time of the contact process on finite graphs, Spatial networks and percolation. Abstracts from the workshop held January 17--23, 2021 (hybrid meeting), Extremal linkage networks, Typical Distances in Ultrasmall Random Networks, Degree distribution of the FKP network model, SIS epidemic propagation on hypergraphs, Unnamed Item, Phase Changes in the Topological Indices of Scale-Free Trees, It's a small world for random surfers, From trees to graphs: collapsing continuous-time branching processes, The degree distribution of the generalized duplication model, The cover time of the preferential attachment graph, Formation of a giant component in the intersection graph of a random chord diagram, Shells structure in uncorrelated scale-free networks, The robot crawler graph process, Giant descendant trees, matchings, and independent sets in age-biased attachment graphs, On the degree distribution of the nodes in increasing trees, On the impact of the migration topology on the island model, Introduction to Complex Networks: Structure and Dynamics, The evolution of genetic topologies, Generalized Stirling permutations, families of increasing trees and urn models, Tree evolution processes for bucket increasing trees, On Bollobás‐Riordan random pairing model of preferential attachment graph, Controllability, matching ratio and graph convergence, Modularity in several random graph models, On limit behavior of maximum vertex degree in a conditional configuration graph near critical points, Thresholds for virus spread on networks, On reversible cascades in scale-free and Erdős-Rényi random graphs, A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents, Large deviations for the degree structure in preferential attachment schemes, Coexistence in Preferential Attachment Networks, Asymptotic behavior and distributional limits of preferential attachment graphs, Diameters of random circulant graphs, Spread of Infection over P.A. random graphs with edge insertion, Contact processes on scale-free networks, Justifying the small-world phenomenon via random recursive trees, Diameter in ultra‐small scale‐free random graphs, The three kinds of degree distributions and nash equilibrium on the limiting random network, Analytical estimates and proof of the scale-free character of efficiency and improvement in Barabási-Albert trees, The lattice of cycles of an undirected graph, The degree sequence of a scale-free random graph process, Perfect matchings and Hamiltonian cycles in the preferential attachment model, Sparse random graphs with clustering, Satisfiability threshold for power law random 2-SAT in configuration model, A Geometric Preferential Attachment Model of Networks II, Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing, The Diameter of Sparse Random Graphs, The idemetric property: when most distances are (almost) the same, Law of large numbers for the largest component in a hyperbolic model of complex networks, On the hardness of optimization in power-law graphs, Degree sequences of geometric preferential attachment graphs, Greedy routing in small-world networks with power-law degrees, Diameters in preferential attachment models, On the distribution of distances between specified nodes in increasing trees, Rumor spreading in social networks, On the number of subgraphs of a random graph in the Barabasi-Albert model, Some Typical Properties of the Spatial Preferred Attachment Model, Robustness of Preferential Attachment Under Deletion of Edges, Phase transition on the degree sequence of a random graph process with vertex copying and deletion, The clustering coefficient of a scale-free random graph, Unnamed Item, The phase transition in the uniformly grown random graph has infinite order, Testing permutation properties through subpermutations, The first fully polynomial stabilizing algorithm for BFS tree construction, Ultra-small scale-free geometric networks, A stochastic complex network model, The average path length of scale free networks, Small-world graphs: characterization and alternative constructions, Scale‐free graphs of increasing degree, On the chromatic number of the preferential attachment graph, Diameters of uniform subset graphs, Connectivity of random regular graphs generated by the pegging algorithm, Width of a scale-free tree, Paired threshold graphs, Clustering coefficients of large networks, A preferential attachment process approaching the Rado graph, Price Variation in a Bipartite Exchange Network, On symmetry of uniform and preferential attachment graphs, The spectra of multiplicative attribute graphs, Universality for distances in power-law random graphs, Asymptotic theory for the multidimensional random on-line nearest-neighbour graph, Mixing Time of Random Walk on Poisson Geometry Small World, Typical distances in a geometric model for complex networks, On a conditionally Poissonian graph process, Modeling and Designing Real–World Networks, Generating stationary random graphs on ℤ with prescribed independent, identically distributed degrees, From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial), Generating Infinite Random Graphs, Algorithmic networks: central time to trigger expected emergent open-endedness, A Fast Algorithm to Find All High-Degree Vertices in Graphs with a Power-Law Degree Sequence, Some Properties of Random Apollonian Networks, On the Degree Sequence of an Evolving Random Graph Process and Its Critical Phenomenon, Structural sparsity of complex networks: bounded expansion in random models and real-world graphs, Studies on generalized Yule models, On a random graph evolving by degrees, A Theory of Network Security: Principles of Natural Selection and Combinatorics, Distance evolutions in growing preferential attachment graphs, Degree distribution of shortest path trees and bias of network sampling algorithms, Strong ties or structural holes? A distance distribution perspective, Percolation and epidemic processes in one-dimensional small-world networks (extended abstract), Distributed PageRank computation with improved round complexities, Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size
