The Average Distance in a Random Graph with Given Expected Degrees
From MaRDI portal
Publication:4673815
DOI10.1080/15427951.2004.10129081zbMath1065.05084OpenAlexW2068902429MaRDI 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
Large deviations for power-law thinned Lévy processes, On the likelihood of forests, Typical Distances in Ultrasmall Random Networks, An elementary approach to component sizes in critical random graphs, The mean and variance of the distribution of shortest path lengths of random regular graphs, A phase transition regarding the evolution of bootstrap processes in inhomogeneous random graphs, The phase transition in inhomogeneous random graphs, Asymptotic in undirected random graph models with a noisy degree sequence, Efficient sampling methods for discrete distributions, When is a scale-free graph ultra-small?, A random graph model for clustering graphs, Push is Fast on Sparse Random Graphs, Generating large scale‐free networks with the Chung–Lu random graph model, Maximum entropy models and subjective interestingness: an application to tiles in binary databases, Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication, Bootstrap percolation in inhomogeneous random graphs, Thresholds for virus spread on networks, Bounds on the Spectral Radius of Digraphs from Subgraph Counts, Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes, The average distance and the diameter of dense random regular graphs, An asymptotic resolution of a problem of Plesník, Techniques for analyzing dynamic random graph models of web-like networks: An overview, 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, First passage percolation on random graphs with finite mean degrees, Unnamed Item, Analytical results for the in-degree and out-degree distributions of directed random networks that grow by node duplication, Generalized random dot product graph, Evolution of a modified binomial random graph by agglomeration, The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs, The Diameter of Sparse Random Graphs, Visualizing network communities with a semi-definite programming method, Scaling limits and generic bounds for exploration processes, The idemetric property: when most distances are (almost) the same, A weighted regularity lemma with applications, Cluster tails for critical power-law inhomogeneous random graphs, Bootstrap percolation in power-law random graphs, De-anonymization of heterogeneous random graphs in quasilinear time, Novel scaling limits for critical inhomogeneous random graphs, Greedy routing in small-world networks with power-law degrees, Diameters in preferential attachment models, Contact processes on random graphs with power law degree distributions have critical value 0, The contact process on the complete graph with random vertex-dependent infection rates, Ultra-small scale-free geometric networks, Cliques in rank-1 random graphs: the role of inhomogeneity, Security and Formation of Network-Centric Operations, Number of edges in inhomogeneous random graphs, Vertex Pursuit Games in Stochastic Network Models, Universality for distances in power-law random graphs, Mixing Time of Random Walk on Poisson Geometry Small World, On a conditionally Poissonian graph process, Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness, Component structure of the configuration model: Barely supercritical case, Critical behavior in inhomogeneous random graphs, Sampling Geometric Inhomogeneous Random Graphs in Linear Time, A note on the warmth of random graphs with given expected degrees, On the average order of a dominating set of a forest, Unnamed Item, First Passage Percolation on Inhomogeneous Random Graphs, The diameter of weighted random graphs, New analytical lower bounds on the clique number of a graph, Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness
