The Average Distance in a Random Graph with Given Expected Degrees
From MaRDI portal
Publication:4673815
DOI10.1080/15427951.2004.10129081zbMath1065.05084MaRDI QIDQ4673815
Publication date: 9 May 2005
Published in: Internet Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/15427951.2004.10129081
Related Items
The Diameter of Sparse Random Graphs, Unnamed Item, Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness, Unnamed Item, Bounds on the Spectral Radius of Digraphs from Subgraph Counts, Analytical results for the in-degree and out-degree distributions of directed random networks that grow by node duplication, Component structure of the configuration model: Barely supercritical case, First Passage Percolation on Inhomogeneous Random Graphs, New analytical lower bounds on the clique number of a graph, The phase transition in inhomogeneous random graphs, Vertex Pursuit Games in Stochastic Network Models, On a conditionally Poissonian graph process, Unnamed Item, Ultra-small scale-free geometric networks, Large deviations for power-law thinned Lévy processes, Maximum entropy models and subjective interestingness: an application to tiles in binary databases, The contact process on the complete graph with random vertex-dependent infection rates, A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents, The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs, Scaling limits and generic bounds for exploration processes, Novel scaling limits for critical inhomogeneous random graphs, Diameters in preferential attachment models, Contact processes on random graphs with power law degree distributions have critical value 0, On the likelihood of forests, A phase transition regarding the evolution of bootstrap processes in inhomogeneous random graphs, When is a scale-free graph ultra-small?, Generalized random dot product graph, Evolution of a modified binomial random graph by agglomeration, Visualizing network communities with a semi-definite programming method, Cluster tails for critical power-law inhomogeneous random graphs, De-anonymization of heterogeneous random graphs in quasilinear time, On reversible cascades in scale-free and Erdős-Rényi random graphs, First passage percolation on random graphs with finite mean degrees, The average distance and the diameter of dense random regular graphs, An asymptotic resolution of a problem of Plesník, A weighted regularity lemma with applications, Bootstrap percolation in power-law random graphs, Greedy routing in small-world networks with power-law degrees, Cliques in rank-1 random graphs: the role of inhomogeneity, A note on the warmth of random graphs with given expected degrees, The diameter of weighted random graphs, Efficient sampling methods for discrete distributions, Thresholds for virus spread on networks, Security and Formation of Network-Centric Operations, Critical behavior in inhomogeneous random graphs, Typical Distances in Ultrasmall Random Networks, Push is Fast on Sparse Random Graphs, Techniques for analyzing dynamic random graph models of web-like networks: An overview, Universality for distances in power-law random graphs
