A New Random Graph Model with Self-Optimizing Nodes: Connectivity and Diameter

DOI10.1080/15427951.2015.1022626zbMath1465.05161OpenAlexW2290188836MaRDI QIDQ4985803

Maya Kabkab, Richard J. La

Publication date: 26 April 2021

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15427951.2015.1022626

zbMATH Keywords

connected Erdős-Rényi random graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Distance in graphs (05C12) Connectivity (05C40)

Related Items (1)

The Erlang weighted tree, a new branching process

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stochastic orders
• A note on uniform asymptotic normality of intermediate order statistics
• Connectivity of the uniform random intersection graph
• On the connectivity of random m-orientable graphs and digraphs
• Finite exchangeable sequences
• Connectivity of the mutual \(k\)-nearest-neighbor graph in clustering and outlier detection
• The connectivity of a graph on uniform points on [0,\,1\(^{d}\).]
• Statistical mechanics of complex networks
• A new approach to the giant component problem
• A critical constant for the k nearest-neighbour model
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• The Probability Integral Transform and Related Results
• Random Geometric Graphs
• Order Statistics
• Connectivity of random k-nearest-neighbour graphs
• A critical point for random graphs with a given degree sequence
• Networked Control Systems With Communication Constraints: Tradeoffs Between Transmission Intervals, Delays and Performance
• Zero–One Laws for Connectivity in Random Key Graphs
• Random Graphs
• Networks

This page was built for publication: A New Random Graph Model with Self-Optimizing Nodes: Connectivity and Diameter