The average distances in random graphs with given expected degrees
From MaRDI portal
Publication:5460742
DOI10.1073/PNAS.252631999zbMath1064.05137OpenAlexW2027377866WikidataQ34414687 ScholiaQ34414687MaRDI QIDQ5460742
Publication date: 19 July 2005
Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)
Full work available at URL: https://europepmc.org/articles/pmc138532
Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Distance in graphs (05C12)
Related Items (only showing first 100 items - show all)
Large deviations for power-law thinned Lévy processes ⋮ The hierarchy of block models ⋮ Null models and community detection in multi-layer networks ⋮ Scalable estimation of epidemic thresholds via node sampling ⋮ Not all interventions are equal for the height of the second peak ⋮ On the Diameter of Hyperbolic Random Graphs ⋮ Ultra-Fast Load Balancing on Scale-Free Networks ⋮ On the Diameter of Hyperbolic Random Graphs ⋮ Normalization Phenomena in Asynchronous Networks ⋮ A preferential attachment model with random initial degrees ⋮ Swarming on random graphs ⋮ Minimum vertex cover in generalized random graphs with power law degree distribution ⋮ The relations between network-operation and topological-property in a scale-free and small-world network with community structure ⋮ Community Detection in Temporal Multilayer Networks, with an Application to Correlation Networks ⋮ A family of small-world network models built by complete graph and iteration-function ⋮ Asymptotics of score test in the generalized \(\beta\)-model for networks ⋮ Directed weighted random graphs with an increasing bi-degree sequence ⋮ Average hopcount of the shortest path in tree-like components with finite size ⋮ Generating simple random graphs with prescribed degree distribution ⋮ Shells structure in uncorrelated scale-free networks ⋮ ENDOGENOUS JOB CONTACT NETWORKS ⋮ Scale-free percolation ⋮ Complex networks: structure and dynamics ⋮ Asynchronous rumor spreading on random graphs ⋮ Distance in random graphs with infinite mean degrees ⋮ On transmission irregular starlike trees ⋮ Universality for critical heavy-tailed network models: metric structure of maximal components ⋮ Asymptotics for cliques in scale-free random graphs ⋮ An iteration method for computing the total number of spanning trees and its applications in graph theory ⋮ Unnamed Item ⋮ Bootstrap percolation and the geometry of complex networks ⋮ Unnamed Item ⋮ Ensemble nonequivalence in random graphs with modular structure ⋮ Core-periphery structure in networks: a statistical exposition ⋮ Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket ⋮ Greed is good for deterministic scale-free networks ⋮ Contact processes on scale-free networks ⋮ Homophily and long-run integration in social networks ⋮ Geometric inhomogeneous random graphs ⋮ Hierarchical synchronization in complex networks with heterogeneous degrees ⋮ Absence of a resolution limit in in-block nestedness ⋮ Percolation on complex networks: theory and application ⋮ The largest component in a subcritical random graph with a power law degree distribution ⋮ Open quipus with the same Wiener index as their quadratic line graph ⋮ Fast analytical methods for finding significant labeled graph motifs ⋮ Configuring Random Graph Models with Fixed Degree Sequences ⋮ PageRank on inhomogeneous random digraphs ⋮ Optimal subgraph structures in scale-free configuration models ⋮ PageRank's behavior under degree correlations ⋮ Disentangling bipartite and core-periphery structure in financial networks ⋮ The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs ⋮ Continuum limit of critical inhomogeneous random graphs ⋮ The Diameter of Sparse Random Graphs ⋮ Law of large numbers for the largest component in a hyperbolic model of complex networks ⋮ Cluster tails for critical power-law inhomogeneous random graphs ⋮ De-anonymization of heterogeneous random graphs in quasilinear time ⋮ Universality for the distance in finite variance random graphs ⋮ Triadic closure in configuration models with unbounded degree fluctuations ⋮ Sparse maximum-entropy random graphs with a given power-law degree distribution ⋮ Counting cliques and cycles in scale-free inhomogeneous random graphs ⋮ Percolation in invariant Poisson graphs with i.i.d. degrees ⋮ 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 certain connectivity properties of the internet topology ⋮ A note on asymptotic distributions in maximum entropy models for networks ⋮ Unnamed Item ⋮ The Kuramoto model on power law graphs: synchronization and contrast states ⋮ Decompositions of Triangle-Dense Graphs ⋮ Scalable and exact sampling method for probabilistic generative graph models ⋮ Number of edges in inhomogeneous random graphs ⋮ Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing ⋮ Capacity of an associative memory model on random graph architectures ⋮ The degree sequences of an asymmetrical growing network ⋮ Universality for distances in power-law random graphs ⋮ Scale-free percolation in continuous space: quenched degree and clustering coefficient ⋮ Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs ⋮ Unbiased sampling of network ensembles ⋮ Typical distances in a geometric model for complex networks ⋮ Limit laws for the number of triangles in the generalized random graphs with random node weights ⋮ Goodness of Fit of Logistic Regression Models for Random Graphs ⋮ RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING ⋮ Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness ⋮ Why Do Simple Algorithms for Triangle Enumeration Work in the Real World? ⋮ Structural sparsity of complex networks: bounded expansion in random models and real-world graphs ⋮ Influences of degree inhomogeneity on average path length and random walks in disassortative scale-free networks ⋮ Greedy routing and the algorithmic small-world phenomenon ⋮ An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem ⋮ Constrained Markovian dynamics of random graphs ⋮ The graph spectra and spectral moments of random graphs ⋮ Counting triangles in power-law uniform random graphs ⋮ Limitations of Chung Lu random graph generation ⋮ Counting spanning trees in self-similar networks by evaluating determinants ⋮ Swarming on random graphs. II ⋮ On the mean distance in scale free graphs ⋮ Some results about the inset edge and average distance of trees ⋮ Distance evolutions in growing preferential attachment graphs ⋮ Jigsaw percolation: what social networks can collaboratively solve a puzzle? ⋮ Distinguishing power-law uniform random graphs from inhomogeneous random graphs through small subgraphs ⋮ Large degrees in scale-free inhomogeneous random graphs
Cites Work
This page was built for publication: The average distances in random graphs with given expected degrees
