Metric structure of random networks
From MaRDI portal
Abstract: We propose a consistent approach to the statistics of the shortest paths in random graphs with a given degree distribution. This approach goes further than a usual tree ansatz and rigorously accounts for loops in a network. We calculate the distribution of shortest-path lengths (intervertex distances) in these networks and a number of related characteristics for the networks with various degree distributions. We show that in the large network limit this extremely narrow intervertex distance distribution has a finite width while the mean intervertex distance grows with the size of a network. The size dependence of the mean intervertex distance is discussed in various situations.
Recommendations
Cites work
- scientific article; zbMATH DE number 3435482 (Why is no real title available?)
- scientific article; zbMATH DE number 2050468 (Why is no real title available?)
- scientific article; zbMATH DE number 1866312 (Why is no real title available?)
- A critical point for random graphs with a given degree sequence
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Appearance of mother universe and singular vertices in random geometries
- Condensation in the Backgammon model
- Scaling in four-dimensional quantum gravity
- Statistical mechanics of complex networks
- The Size of the Giant Component of a Random Graph with a Given Degree Sequence
- The asymptotic connectivity of labelled regular graphs
- The asymptotic number of labeled graphs with given degree sequences
Cited in
(62)- The shortest distance in random multi-type intersection graphs
- When is a scale-free graph ultra-small?
- Power-law distribution of gene expression fluctuations
- Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication
- Typical distances in a geometric model for complex networks
- Spreading and shortest paths in systems with sparse long-range connections.
- Popularity based random graph models leading to a scale-free degree sequence
- Shells structure in uncorrelated scale-free networks
- Post-processing hierarchical community structures: quality improvements and multi-scale view
- Measuring distances between complex networks
- Typical distances in ultrasmall random networks
- Geometry of complex networks and topological centrality
- \(k\)-core architecture and \(k\)-core percolation on complex networks
- Discrete network models of interacting nephrons
- Effect of random edge failure on the average path length
- Correlation between graphs with an application to brain network analysis
- On a recursive equation over a \(p\)-adic field
- Phases of small worlds: a mean field formulation
- Gossip algorithms in quantum networks
- Structural stochastic multiresonance in a hierarchical network of coupled threshold elements
- The distribution of first hitting times of random walks on directed Erdős–Rényi networks
- 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
- Return probability for random walks on scale-free complex trees
- Metric dimension for random graphs
- \(Awaking\) and \(sleeping\) of a complex network
- Clustering in random line graphs
- Exploring networks with traceroute-like probes: Theory and simulations
- Average hopcount of the shortest path in tree-like components with finite size
- A new method optimizing the subgraph centrality of large networks
- A network analysis of the Italian overnight money market
- Principles of statistical mechanics of uncorrelated random networks
- Complexity in spanish optical fiber and SDH transport networks
- Number of cliques in random scale-free network ensembles
- An adaptive routing strategy for packet delivery in complex networks
- Modulus metrics on networks
- Percolation on complex networks: theory and application
- A complex network-based approach for boundary shape analysis
- Length of optimal path in random networks with strong disorder
- A history of graph entropy measures
- Joint distribution of distances in large random regular networks
- Towards Google matrix of brain
- A Quest to Unravel the Metric Structure Behind Perturbed Networks
- Navigation in spatial networks: a survey
- Eigenvectors of isospectral graph transformations
- Degree distributions of evolving alphabetic bipartite networks and their projections
- On the mean distance in scale free graphs
- Distance-sum heterogeneity in graphs and complex networks
- Graph spectra as a systematic tool in computational biology
- Scaling of average weighted shortest path and average receiving time on weighted hierarchical networks
- Degree correlations in growing networks with deletion of nodes
- Robust synchronization of a class of uncertain complex networks via discontinuous control
- Punctuated equilibrium in a non-linear system of action
- The performance model of dynamic virtual organization (VO) formations within grid computing context
- Modeling for evolving biological networks with scale-free connectivity, hierarchical modularity, and disassortativity
- The mean and variance of the distribution of shortest path lengths of random regular graphs
- Network model with scale-free, high clustering coefficients, and small-world properties
- Exact computations for structural characteristics of BA exponential networks
- Network Analysis
- Statistical properties of model kinship networks
- Asymptotic behavior of connecting-nearest-neighbor models for growing networks
- scientific article; zbMATH DE number 7264203 (Why is no real title available?)
This page was built for publication: Metric structure of random networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1860844)
