Acquaintance Time of Random Graphs Near Connectivity Threshold
نویسندگان
چکیده
منابع مشابه
A Note on the Acquaintance Time of Random Graphs
In this short note, we prove a conjecture of Benjamini, Shinkar, and Tsur on the acquaintance time AC(G) of a random graph G ∈ G(n, p). It is shown that asymptotically almost surely AC(G) = O(log n/p) for G ∈ G(n, p), provided that pn−log n−log log n→∞ (that is, above the threshold for Hamiltonicity). Moreover, we show a matching lower bound for dense random graphs, which also implies that asym...
متن کاملThe acquaintance time of (percolated) random geometric graphs
In this paper, we study the acquaintance time AC(G) defined for a connected graph G. We focus on G(n, r, p), a random subgraph of a random geometric graph in which n vertices are chosen uniformly at random and independently from [0, 1], and two vertices are adjacent with probability p if the Euclidean distance between them is at most r. We present asymptotic results for the acquaintance time of...
متن کاملConnectivity Threshold of Random Geometric Graphs with Cantor Distributed Vertices
For connectivity of random geometric graphs, where there is no density for underlying distribution of the vertices, we consider n i.i.d. Cantor distributed points on [0, 1]. We show that for this random geometric graph, the connectivity threshold Rn, converges almost surely to a constant 1−2φ where 0 < φ < 1/2, which for standard Cantor distribution is 1/3. We also show that ‖Rn − (1− 2φ)‖1 ∼ 2...
متن کاملMixing time of near-critical random graphs
Let C1 be the largest component of the Erdős–Rényi random graph G(n,p). The mixing time of random walk on C1 in the strictly supercritical regime, p = c/n with fixed c > 1, was shown to have order log n by Fountoulakis and Reed, and independently by Benjamini, Kozma and Wormald. In the critical window, p = (1 + ε)/n where λ= εn is bounded, Nachmias and Peres proved that the mixing time on C1 is...
متن کاملConnectivity threshold of Bluetooth graphs
We study the connectivity properties of random Bluetooth graphs that model certain “ad hoc” wireless networks. The graphs are obtained as “irrigation subgraphs” of the well-known random geometric graph model. There are two parameters that control the model: the radius r that determines the “visible neighbors” of each vertex and the number of edges c that each vertex is allowed to send to these....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2016
ISSN: 0895-4801,1095-7146
DOI: 10.1137/140969105