Metric structure of random networks

DOI10.1016/S0550-3213(02)01119-7zbMath1010.05073arXivcond-mat/0210085OpenAlexW3103952223WikidataQ59280484 ScholiaQ59280484MaRDI QIDQ1860844

J. F. F. Mendes, S. N. Dorogovtsev, A. N. Samukhin

Publication date: 26 February 2003

Published in: Nuclear Physics. B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/0210085

zbMATH Keywords

random graphs large-network limit shortest-path statistics

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (51)

A new method optimizing the subgraph centrality of large networks ⋮ Exploring networks with traceroute-like probes: Theory and simulations ⋮ Typical Distances in Ultrasmall Random Networks ⋮ Punctuated equilibrium in a non-linear system of action ⋮ The mean and variance of the distribution of shortest path lengths of random regular graphs ⋮ A network analysis of the Italian overnight money market ⋮ Modeling for evolving biological networks with scale-free connectivity, hierarchical modularity, and disassortativity ⋮ Average hopcount of the shortest path in tree-like components with finite size ⋮ Number of cliques in random scale-free network ensembles ⋮ \(k\)-core architecture and \(k\)-core percolation on complex networks ⋮ Shells structure in uncorrelated scale-free networks ⋮ \(Awaking\) and \(sleeping\) of a complex network ⋮ The performance model of dynamic virtual organization (VO) formations within grid computing context ⋮ Complexity in spanish optical fiber and SDH transport networks ⋮ Geometry of complex networks and topological centrality ⋮ Clustering in random line graphs ⋮ When is a scale-free graph ultra-small? ⋮ Degree distributions of evolving alphabetic bipartite networks and their projections ⋮ An adaptive routing strategy for packet delivery in complex networks ⋮ A history of graph entropy measures ⋮ Degree distributions of the visibility graphs mapped from fractional Brownian motions and multifractal random walks ⋮ Synchronization analysis of delayed complex networks via adaptive time-varying coupling strengths ⋮ Network model with scale-free, high clustering coefficients, and small-world properties ⋮ Gossip algorithms in quantum networks ⋮ Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication ⋮ Post-processing hierarchical community structures: quality improvements and multi-scale view ⋮ Structural stochastic multiresonance in a hierarchical network of coupled threshold elements ⋮ Towards Google matrix of brain ⋮ Principles of statistical mechanics of uncorrelated random networks ⋮ Measuring distances between complex networks ⋮ Power-law distribution of gene expression fluctuations ⋮ Distance-sum heterogeneity in graphs and complex networks ⋮ Statistical properties of model kinship networks ⋮ Degree correlations in growing networks with deletion of nodes ⋮ Percolation on complex networks: theory and application ⋮ The distribution of first hitting times of random walks on directed Erdős–Rényi networks ⋮ On a recursive equation over a \(p\)-adic field ⋮ A complex network-based approach for boundary shape analysis ⋮ Return probability for random walks on scale-free complex trees ⋮ Asymptotic behavior of connecting-nearest-neighbor models for growing networks ⋮ Navigation in spatial networks: a survey ⋮ Scaling of average weighted shortest path and average receiving time on weighted hierarchical networks ⋮ Correlation between graphs with an application to brain network analysis ⋮ Robust synchronization of a class of uncertain complex networks via discontinuous control ⋮ Typical distances in a geometric model for complex networks ⋮ Graph spectra as a systematic tool in computational biology ⋮ Popularity based random graph models leading to a scale-free degree sequence ⋮ Discrete network models of interacting nephrons ⋮ Phases of small worlds: a mean field formulation ⋮ Eigenvectors of isospectral graph transformations ⋮ On the mean distance in scale free graphs

Cites Work

This page was built for publication: Metric structure of random networks