# The total acquisition number of random graphs

Deepak Bal, Patrick Bennett, Andrzej Dudek, Paweł Prałat

Research output: Contribution to journalArticle

3 Citations (Scopus)

### Abstract

Let G be a graph in which each vertex initially has weight 1. In each step, the weight from a vertex u to a neighbouring vertex v can be moved, provided that the weight on v is at least as large as the weight on u. The total acquisition number of G, denoted by at(G), is the minimum possible size of the set of vertices with positive weight at the end of the process. LeSaulnier, Prince, Wenger, West, and Worah asked for the minimum value of p = p(n) such that at(G(n, p)) = 1 with high probability, where G(n, p) is a binomial random graph. We show that p = log2n/n≈ 1:4427 log n/n is a sharp threshold for this property. We also show that almost all trees Tsatisfy at(T) = Θ (n), confirming a conjecture of West.

Original language English Electronic Journal of Combinatorics 23 2 Published - 24 Jun 2016

### Fingerprint

Random Graphs
Vertex of a graph
Sharp Threshold
Acquisition
Graph in graph theory

### Cite this

Bal, D., Bennett, P., Dudek, A., & Prałat, P. (2016). The total acquisition number of random graphs. Electronic Journal of Combinatorics, 23(2).
Bal, Deepak ; Bennett, Patrick ; Dudek, Andrzej ; Prałat, Paweł. / The total acquisition number of random graphs. In: Electronic Journal of Combinatorics. 2016 ; Vol. 23, No. 2.
@article{2f9a15620f6b49eeb3bd9a1be8b748b7,
title = "The total acquisition number of random graphs",
abstract = "Let G be a graph in which each vertex initially has weight 1. In each step, the weight from a vertex u to a neighbouring vertex v can be moved, provided that the weight on v is at least as large as the weight on u. The total acquisition number of G, denoted by at(G), is the minimum possible size of the set of vertices with positive weight at the end of the process. LeSaulnier, Prince, Wenger, West, and Worah asked for the minimum value of p = p(n) such that at(G(n, p)) = 1 with high probability, where G(n, p) is a binomial random graph. We show that p = log2n/n≈ 1:4427 log n/n is a sharp threshold for this property. We also show that almost all trees Tsatisfy at(T) = Θ (n), confirming a conjecture of West.",
author = "Deepak Bal and Patrick Bennett and Andrzej Dudek and Paweł Prałat",
year = "2016",
month = "6",
day = "24",
language = "English",
volume = "23",
journal = "Electronic Journal of Combinatorics",
issn = "1077-8926",
publisher = "Electronic Journal of Combinatorics",
number = "2",

}

Bal, D, Bennett, P, Dudek, A & Prałat, P 2016, 'The total acquisition number of random graphs', Electronic Journal of Combinatorics, vol. 23, no. 2.

The total acquisition number of random graphs. / Bal, Deepak; Bennett, Patrick; Dudek, Andrzej; Prałat, Paweł.

In: Electronic Journal of Combinatorics, Vol. 23, No. 2, 24.06.2016.

Research output: Contribution to journalArticle

TY - JOUR

T1 - The total acquisition number of random graphs

AU - Bal, Deepak

AU - Bennett, Patrick

AU - Dudek, Andrzej

AU - Prałat, Paweł

PY - 2016/6/24

Y1 - 2016/6/24

N2 - Let G be a graph in which each vertex initially has weight 1. In each step, the weight from a vertex u to a neighbouring vertex v can be moved, provided that the weight on v is at least as large as the weight on u. The total acquisition number of G, denoted by at(G), is the minimum possible size of the set of vertices with positive weight at the end of the process. LeSaulnier, Prince, Wenger, West, and Worah asked for the minimum value of p = p(n) such that at(G(n, p)) = 1 with high probability, where G(n, p) is a binomial random graph. We show that p = log2n/n≈ 1:4427 log n/n is a sharp threshold for this property. We also show that almost all trees Tsatisfy at(T) = Θ (n), confirming a conjecture of West.

AB - Let G be a graph in which each vertex initially has weight 1. In each step, the weight from a vertex u to a neighbouring vertex v can be moved, provided that the weight on v is at least as large as the weight on u. The total acquisition number of G, denoted by at(G), is the minimum possible size of the set of vertices with positive weight at the end of the process. LeSaulnier, Prince, Wenger, West, and Worah asked for the minimum value of p = p(n) such that at(G(n, p)) = 1 with high probability, where G(n, p) is a binomial random graph. We show that p = log2n/n≈ 1:4427 log n/n is a sharp threshold for this property. We also show that almost all trees Tsatisfy at(T) = Θ (n), confirming a conjecture of West.

UR - http://www.scopus.com/inward/record.url?scp=84976334745&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:84976334745

VL - 23

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

SN - 1077-8926

IS - 2

ER -