The average distances in random graphs with given expected degrees
From MaRDI portal
Recommendations
Cites work
Cited in
(only showing first 100 items - show all)- The degree sequences of an asymmetrical growing network
- Constrained Markovian dynamics of random graphs
- Average distances in undirected graphs and the removal of vertices
- An iteration method for computing the total number of spanning trees and its applications in graph theory
- Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket
- Geometric inhomogeneous random graphs
- Fast analytical methods for finding significant labeled graph motifs
- 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
- Triadic closure in configuration models with unbounded degree fluctuations
- Sparse maximum-entropy random graphs with a given power-law degree distribution
- Metric structure of random networks
- Contact processes on scale-free networks
- PageRank on inhomogeneous random digraphs
- Counting cliques and cycles in scale-free inhomogeneous random graphs
- A note on asymptotic distributions in maximum entropy models for networks
- The Kuramoto model on power law graphs: synchronization and contrast states
- Number of edges in inhomogeneous random graphs
- Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing
- Greedy routing and the algorithmic small-world phenomenon
- An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem
- Limitations of Chung Lu random graph generation
- Some results about the inset edge and average distance of trees
- Distance evolutions in growing preferential attachment graphs
- Distinguishing power-law uniform random graphs from inhomogeneous random graphs through small subgraphs
- Large degrees in scale-free inhomogeneous random graphs
- 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
- The relations between network-operation and topological-property in a scale-free and small-world network with community structure
- A family of small-world network models built by complete graph and iteration-function
- Average hopcount of the shortest path in tree-like components with finite size
- Shells structure in uncorrelated scale-free networks
- On transmission irregular starlike trees
- Universality for critical heavy-tailed network models: metric structure of maximal components
- The average distance and the diameter of dense random regular graphs
- Greed is good for deterministic scale-free networks
- Absence of a resolution limit in in-block nestedness
- Percolation on complex networks: theory and application
- Optimal subgraph structures in scale-free configuration models
- PageRank's behavior under degree correlations
- Scalable and exact sampling method for probabilistic generative graph models
- Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs
- Limit laws for the number of triangles in the generalized random graphs with random node weights
- Structural sparsity of complex networks: bounded expansion in random models and real-world graphs
- The graph spectra and spectral moments of random graphs
- Swarming on random graphs. II
- Jigsaw percolation: what social networks can collaboratively solve a puzzle?
- Swarming on random graphs
- Complex networks: structure and dynamics
- Distances in random graphs with finite mean and infinite variance degrees
- On certain connectivity properties of the internet topology
- Capacity of an associative memory model on random graph architectures
- On the mean distance in scale free graphs
- Large deviations for power-law thinned Lévy processes
- Asymptotics for cliques in scale-free random graphs
- Core-periphery structure in networks: a statistical exposition
- Counting spanning trees in self-similar networks by evaluating determinants
- ENDOGENOUS JOB CONTACT NETWORKS
- Ensemble nonequivalence in random graphs with modular structure
- Minimum vertex cover in generalized random graphs with power law degree distribution
- Effect of random edge failure on the average path length
- Asymptotics of score test in the generalized \(\beta\)-model for networks
- Directed weighted random graphs with an increasing bi-degree sequence
- The small world phenomenon in hybrid power law graphs
- Unbiased sampling of network ensembles
- Typical distances in a geometric model for complex networks
- Goodness of Fit of Logistic Regression Models for Random Graphs
- Attack resistance of power-law random graphs in the finite-mean, infinite-variance region
- scientific article; zbMATH DE number 5130720 (Why is no real title available?)
- Ultra-fast load balancing on scale-free networks
- On the diameter of hyperbolic random graphs
- Normalization phenomena in asynchronous networks
- Community detection in temporal multilayer networks, with an application to correlation networks
- Hierarchical synchronization in complex networks with heterogeneous degrees
- Universality for distances in power-law random graphs
- RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
- Influences of degree inhomogeneity on average path length and random walks in disassortative scale-free networks
- Scale-free percolation
- Homophily and long-run integration in social networks
- scientific article; zbMATH DE number 6982944 (Why is no real title available?)
- On the diameter of hyperbolic random graphs
- Configuring random graph models with fixed degree sequences
- The Average Distance in a Random Graph with Given Expected Degrees
- The diameter of sparse random graphs
- Scale-free percolation in continuous space: quenched degree and clustering coefficient
- 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?
- GemBag: group estimation of multiple Bayesian graphical models
- Finding cliques in social networks: a new distribution-free model
- Limit theorems for assortativity and clustering in null models for scale-free networks
- Edge domination number and the number of minimum edge dominating sets in pseudofractal scale-free web and Sierpiński gasket
- Moments of uniform random multigraphs with fixed degree sequences
- The mean and variance of the distribution of shortest path lengths of random regular graphs
- Scale-free network clustering in hyperbolic and other random graphs
- Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs.
- A note on undirected random graph models parameterized by the strengths of vertices
- Disentangling bipartite and core-periphery structure in financial networks
This page was built for publication: The average distances in random graphs with given expected degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5460742)
