Vol. 10, No. 1, 2021

Download this article
Download this article For screen
For printing
Recent Issues
Volume 10, Issue 1
Volume 9, Issue 4
Volume 9, Issue 3
Volume 9, Issue 2
Volume 9, Issue 1
Volume 8, Issue 4
Volume 8, Issue 3
Volume 8, Issue 2
Volume 8, Issue 1
The Journal
About the Journal
Editorial Board
Subscriptions
 
Submission Guidelines
Submission Form
Policies for Authors
Ethics Statement
 
founded and published with the
scientific support and advice of the
Moscow Institute of
Physics and Technology
 
ISSN (electronic): 2640-7361
ISSN (print): 2220-5438
Previously Published
Author Index
To Appear
 
Other MSP Journals
This article is available for purchase or by subscription. See below.
Dense subgraphs of power-law random graphs

Denis O. Lazarev and Nikolay N. Kuzyurin

Vol. 10 (2021), No. 1, 1–11
Abstract

The problem of finding a maximal dense subgraph of a power-law random graph G(n,α) is considered for every value of density c (0,1) and for every α (0,+). It is shown that in case α < 2 a maximal c-dense subgraph has size Θp(n1α2), in case α = 2 it is limited whp, and in case α > 2 it is whp less than 4 c.

PDF Access Denied

However, your active subscription may be available on Project Euclid at
https://projecteuclid.org/moscow

We have not been able to recognize your IP address 3.235.173.155 as that of a subscriber to this journal.
Online access to the content of recent issues is by subscription, or purchase of single articles.

Please contact your institution's librarian suggesting a subscription, for example by using our journal-recom­mendation form. Or, visit our subscription page for instructions on purchasing a subscription.

You may also contact us at contact@msp.org
or by using our contact form.

Or, you may purchase this single article for USD 40.00:

Keywords
power-law random graph, Poissonian model, maximal dense subgraph, graph density, maximal dense subgraph of random graph.
Mathematical Subject Classification 2010
Primary: 05C42
Secondary: 05C69
Milestones
Received: 27 December 2019
Revised: 21 July 2020
Accepted: 7 August 2020
Published: 16 January 2021
Authors
Denis O. Lazarev
Theoretical Computer Science Departement
Ivannikov Institute for System Programming of the RAS
Moscow
Russia
Nikolay N. Kuzyurin
Theoretical Computer Science Departement
Ivannikov Institute for System Programming of the RAS
Moscow
Russia