Phase transition in random distance graphs on the torus

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningfagfællebedømt

Standard

Phase transition in random distance graphs on the torus. / Ajazi, Fioralba; Napolitano, George M.; Turova, Tatyana.

I: Journal of Applied Probability, Bind 54, Nr. 4, 12.2017, s. 1278-1294.

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningfagfællebedømt

Harvard

Ajazi, F, Napolitano, GM & Turova, T 2017, 'Phase transition in random distance graphs on the torus', Journal of Applied Probability, bind 54, nr. 4, s. 1278-1294. https://doi.org/10.1017/jpr.2017.63

APA

Ajazi, F., Napolitano, G. M., & Turova, T. (2017). Phase transition in random distance graphs on the torus. Journal of Applied Probability, 54(4), 1278-1294. https://doi.org/10.1017/jpr.2017.63

Vancouver

Ajazi F, Napolitano GM, Turova T. Phase transition in random distance graphs on the torus. Journal of Applied Probability. 2017 dec.;54(4):1278-1294. https://doi.org/10.1017/jpr.2017.63

Author

Ajazi, Fioralba ; Napolitano, George M. ; Turova, Tatyana. / Phase transition in random distance graphs on the torus. I: Journal of Applied Probability. 2017 ; Bind 54, Nr. 4. s. 1278-1294.

Bibtex

@article{7a8f840b27974778ac80a81ab0b9a362,
title = "Phase transition in random distance graphs on the torus",
abstract = "In this paper we consider random distance graphs motivated by applications in neurobiology. These models can be viewed as examples of inhomogeneous random graphs, notably outside of the so-called rank-1 case. Treating these models in the context of the general theory of inhomogeneous graphs helps us to derive the asymptotics for the size of the largest connected component. In particular, we show that certain random distance graphs behave exactly as the classical Erdos-R{\'e}nyi model, not only in the supercritical phase (as already known) but in the subcritical case as well.",
keywords = "Inhomogeneous random graph, largest connected component, random distance graph",
author = "Fioralba Ajazi and Napolitano, {George M.} and Tatyana Turova",
year = "2017",
month = dec,
doi = "10.1017/jpr.2017.63",
language = "English",
volume = "54",
pages = "1278--1294",
journal = "Journal of Applied Probability",
issn = "0021-9002",
publisher = "Applied Probability Trust",
number = "4",

}

RIS

TY - JOUR

T1 - Phase transition in random distance graphs on the torus

AU - Ajazi, Fioralba

AU - Napolitano, George M.

AU - Turova, Tatyana

PY - 2017/12

Y1 - 2017/12

N2 - In this paper we consider random distance graphs motivated by applications in neurobiology. These models can be viewed as examples of inhomogeneous random graphs, notably outside of the so-called rank-1 case. Treating these models in the context of the general theory of inhomogeneous graphs helps us to derive the asymptotics for the size of the largest connected component. In particular, we show that certain random distance graphs behave exactly as the classical Erdos-Rényi model, not only in the supercritical phase (as already known) but in the subcritical case as well.

AB - In this paper we consider random distance graphs motivated by applications in neurobiology. These models can be viewed as examples of inhomogeneous random graphs, notably outside of the so-called rank-1 case. Treating these models in the context of the general theory of inhomogeneous graphs helps us to derive the asymptotics for the size of the largest connected component. In particular, we show that certain random distance graphs behave exactly as the classical Erdos-Rényi model, not only in the supercritical phase (as already known) but in the subcritical case as well.

KW - Inhomogeneous random graph

KW - largest connected component

KW - random distance graph

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

U2 - 10.1017/jpr.2017.63

DO - 10.1017/jpr.2017.63

M3 - Journal article

AN - SCOPUS:85041365676

VL - 54

SP - 1278

EP - 1294

JO - Journal of Applied Probability

JF - Journal of Applied Probability

SN - 0021-9002

IS - 4

ER -

ID: 189624191