A new random graph model with self-optimizing nodes: connectivity and diameter
From MaRDI portal
Recommendations
Cites work
- A critical constant for the k nearest-neighbour model
- A critical point for random graphs with a given degree sequence
- A new approach to the giant component problem
- A note on uniform asymptotic normality of intermediate order statistics
- Connectivity of random k-nearest-neighbour graphs
- Connectivity of the mutual k-nearest-neighbor graph in clustering and outlier detection
- Connectivity of the uniform random intersection graph
- Extreme value theory. An introduction.
- Finite exchangeable sequences
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 5541960 (Why is no real title available?)
- scientific article; zbMATH DE number 1254188 (Why is no real title available?)
- Networked Control Systems With Communication Constraints: Tradeoffs Between Transmission Intervals, Delays and Performance
- Networks, crowds and markets. Reasoning about a highly connected world.
- Networks. An introduction.
- On the connectivity of random m-orientable graphs and digraphs
- Order Statistics
- Probability and random processes.
- Random Geometric Graphs
- Random graph dynamics
- Random Graphs
- Random graphs.
- Social and economic networks.
- Statistical mechanics of complex networks
- Stochastic orders
- The connectivity of a graph on uniform points on [0,\,1]\(^{d}\).
- The Probability Integral Transform and Related Results
- The Size of the Giant Component of a Random Graph with a Given Degree Sequence
- Zero–One Laws for Connectivity in Random Key Graphs
Cited in
(3)
This page was built for publication: A new random graph model with self-optimizing nodes: connectivity and diameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4985803)
