Analyzing Kleinberg's (and other) small-world Models
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Analyzing and characterizing small-world graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On certain connectivity properties of the internet topology
Journal of Computer and System Sciences - Special issue on FOCS 2003
Generalizing PageRank: damping functions for link-based ranking algorithms
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Fireflies: scalable support for intrusion-tolerant network overlays
Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
Energy efficient randomised communication in unknown AdHoc networks
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
The phase transition in inhomogeneous random graphs
Random Structures & Algorithms
First-Order Definability of Trees and Sparse Random Graphs
Combinatorics, Probability and Computing
The evolution of the mixing rate of a simple random walk on the giant component of a random graph
Random Structures & Algorithms
Flooding time in edge-Markovian dynamic graphs
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Distance graphs: from random geometric graphs to Bernoulli graphs and between
Proceedings of the fifth international workshop on Foundations of mobile computing
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
Probabilistic analysis of efficiency and vulnerability in the Erdös-Rénji model
International Journal of Computer Mathematics - Recent Advances in Computational and Applied Mathematics in Science and Engineering
A scale-free graph model based on bipartite graphs
Discrete Applied Mathematics
Energy efficient randomised communication in unknown AdHoc networks
Theoretical Computer Science
Parsimonious flooding in dynamic graphs
Proceedings of the 28th ACM symposium on Principles of distributed computing
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
Forward-secure key evolution in wireless sensor networks
CANS'07 Proceedings of the 6th international conference on Cryptology and network security
A fast algorithm to calculate powers of a Boolean matrix for diameter computation of random graphs
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Probabilistic flooding for efficient information dissemination in random graph topologies
Computer Networks: The International Journal of Computer and Telecommunications Networking
Theory of communication networks
Algorithms and theory of computation handbook
Diameters in supercritical random graphs via first passage percolation
Combinatorics, Probability and Computing
The diameter of sparse random graphs
Combinatorics, Probability and Computing
Geometric graphs with randomly deleted edges - connectivity and routing protocols
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Flooding Time of Edge-Markovian Evolving Graphs
SIAM Journal on Discrete Mathematics
Shortest hop multipath algorithm for wireless sensor networks
Computers & Mathematics with Applications
An index calculus algorithm for plane curves of small degree
ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
Network forensics: random infection vs spreading epidemic
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
Approximate discovery of random graphs
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
| Hi-index | 0.00 |
We consider the diameter of a random graph G(n,p) for various ranges of p close to the phase transition point for connectivity. For a disconnected graph G, we use the convention that the diameter of G is the maximum diameter of its connected components. We show that almost surely the diameter of random graph G(n,p) is close to lognlog(np) if np-~. Moreover if nplogn=c8, then the diameter of G(n,p) is concentrated on two values. In general, if nplogn=cc"0, the diameter is concentrated on at most 2@?1/c"0@?+4 values. We also proved that the diameter of G(n,p) is almost surely equal to the diameter of its giant component if np3.6.