The diameter of a scale-free random graph
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Asymptotic theory for the multidimensional random on-line nearest-neighbour graph
- On a random graph evolving by degrees
- The robot crawler graph process
- Modularity in several random graph models
- On limit behavior of maximum vertex degree in a conditional configuration graph near critical points
- Law of large numbers for the largest component in a hyperbolic model of complex networks
- Paired threshold graphs
- 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
- Large deviations for the degree structure in preferential attachment schemes
- Contact processes on scale-free networks
- On the chromatic number of the preferential attachment graph
- Distance evolutions in growing preferential attachment graphs
- Spatial networks and percolation. Abstracts from the workshop held January 17--23, 2021 (hybrid meeting)
- Extremal linkage networks
- Shells structure in uncorrelated scale-free networks
- The lattice of cycles of an undirected graph
- Greedy routing in small-world networks with power-law degrees
- The first fully polynomial stabilizing algorithm for BFS tree construction
- Clustering coefficients of large networks
- Algorithmic networks: central time to trigger expected emergent open-endedness
- Structural sparsity of complex networks: bounded expansion in random models and real-world graphs
- Studies on generalized Yule models
- Degree distribution of shortest path trees and bias of network sampling algorithms
- Degree distribution of the FKP network model
- Formation of a giant component in the intersection graph of a random chord diagram
- Controllability, matching ratio and graph convergence
- Thresholds for virus spread on networks
- Asymptotic behavior and distributional limits of preferential attachment graphs
- Diameters of random circulant graphs
- On the hardness of optimization in power-law graphs
- A new class of scale free random graphs
- On the mean distance in scale free graphs
- The diameter of the directed configuration model
- Exponential extinction time of the contact process on finite graphs
- The degree sequence of a scale-free random graph process
- The diameter of random massive graphs
- Social networks spread rumors in sublogarithmic time
- Typical distances in ultrasmall random networks
- On the number of subgraphs of the Barabási-Albert random graph
- Introduction to complex networks: structure and dynamics
- Justifying the small-world phenomenon via random recursive trees
- An estimate of the probability of localisation of the diameter of a random scale-free graph
- Sparse random graphs with clustering
- SIS epidemic propagation on hypergraphs
- Connectivity of random regular graphs generated by the pegging algorithm
- Graph diameter in long-range percolation
- It's a small world for random surfers
- scientific article; zbMATH DE number 7232749 (Why is no real title available?)
- Width of a scale-free tree
- Mixing Time of Random Walk on Poisson Geometry Small World
- Typical distances in a geometric model for complex networks
- On the degree sequence of an evolving random graph process and its critical phenomenon
- On the diameter of hyperbolic random graphs
- Degree sequences of geometric preferential attachment graphs
- Small-world graphs: characterization and alternative constructions
- A Phase Transition for the Diameter of the Configuration Model
- Universality for distances in power-law random graphs
- Modeling and Designing Real–World Networks
- scientific article; zbMATH DE number 1984541 (Why is no real title available?)
- scientific article; zbMATH DE number 2076942 (Why is no real title available?)
- From trees to graphs: collapsing continuous-time branching processes
- Perfect matchings and Hamiltonian cycles in the preferential attachment model
- Coupling Scale-Free and Classical Random Graphs
- The phase transition in the uniformly grown random graph has infinite order
- The Average Distance in a Random Graph with Given Expected Degrees
- A stochastic complex network model
- scientific article; zbMATH DE number 2119680 (Why is no real title available?)
- The diameter of sparse random graphs
- A preferential attachment process approaching the Rado graph
- Some typical properties of the spatial preferred attachment model
- A fast algorithm to find all high-degree vertices in graphs with a power-law degree sequence
- Some properties of random Apollonian networks
- A new random graph model with self-optimizing nodes: connectivity and diameter
- Spread of infection over P.A. random graphs with edge insertion
- Giant descendant trees, matchings, and independent sets in age-biased attachment graphs
- From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial)
- The three kinds of degree distributions and Nash equilibrium on the limiting random network
- Diameter of P.A. random graphs with edge-step functions
- The idemetric property: when most distances are (almost) the same
- Scale-free graphs of increasing degree
- Generating infinite random graphs
- On distribution function of the diameter in uncertain graph
- Phase changes in the topological indices of scale-free trees
- Coexistence in preferential attachment networks
- Diameter in ultra-small scale-free random graphs
- Rumor spreading in social networks
- Robustness of Preferential Attachment Under Deletion of Edges
- On the number of subgraphs of a random graph in the Barabasi-Albert model
- The diameter of sparse random graphs
- Phase transition on the degree sequence of a random graph process with vertex copying and deletion
- A Geometric Preferential Attachment Model of Networks II
- Price Variation in a Bipartite Exchange Network
- The average distances in random graphs with given expected degrees
- On a conditionally Poissonian graph process
- Generating stationary random graphs on ℤ with prescribed independent, identically distributed degrees
- The clustering coefficient of a scale-free random graph
- Testing permutation properties through subpermutations
- Ultra-small scale-free geometric networks
- A Theory of Network Security: Principles of Natural Selection and Combinatorics
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)
