Молимо вас користите овај идентификатор за цитирање или овај линк до ове ставке:
https://open.uns.ac.rs/handle/123456789/12140
Назив: | Semi-random graph process | Аутори: | Ben-Eliezer O. Hefetz D. Kronenberg G. Parczyk O. Shikhelman C. Stojaković, Miloš |
Датум издавања: | 1-јан-2019 | Часопис: | Random Structures and Algorithms | Сажетак: | © Wiley Periodicals, Inc. We introduce and study a novel semi-random multigraph process, described as follows. The process starts with an empty graph on n vertices. In every round of the process, one vertex v of the graph is picked uniformly at random and independently of all previous rounds. We then choose an additional vertex (according to a strategy of our choice) and connect it by an edge to v. For various natural monotone increasing graph properties P, we prove tight upper and lower bounds on the minimum (extended over the set of all possible strategies) number of rounds required by the process to obtain, with high probability, a graph that satisfies P. Along the way, we show that the process is general enough to approximate (using suitable strategies) several well-studied random graph models. | URI: | https://open.uns.ac.rs/handle/123456789/12140 | ISSN: | 10429832 | DOI: | 10.1002/rsa.20887 |
Налази се у колекцијама: | PMF Publikacije/Publications |
Приказати целокупан запис ставки
SCOPUSTM
Навођења
6
проверено 12.08.2023.
Преглед/и станица
10
Протекла недеља
10
10
Протекли месец
0
0
проверено 03.05.2024.
Google ScholarTM
Проверите
Алт метрика
Ставке на DSpace-у су заштићене ауторским правима, са свим правима задржаним, осим ако није другачије назначено.