The threshold for d-collapsibility in random complexes

L. Aronshtam; N. Linial

doi:10.1002/rsa.20585

The threshold for d-collapsibility in random complexes

L. Aronshtam^*, N. Linial

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-review

15 Scopus citations

Abstract

In this paper we determine the threshold for d-collapsibility in the probabilistic model X_d(n,p) of d-dimensional simplicial complexes. A lower bound for this threshold p=ηdn was established in (Aronshtam and Linial, Random Struct. Algorithms 46 (2015) 26-35), and here we show that this is indeed the correct threshold. Namely, for every c>η_d, a complex drawn from is asymptotically almost surely not d-collapsible.

Original language	English
Pages (from-to)	260-269
Number of pages	10
Journal	Random Structures and Algorithms
Volume	48
Issue number	2
DOIs	https://doi.org/10.1002/rsa.20585
State	Published - 1 Mar 2016

Bibliographical note

Publisher Copyright:
© 2015 Wiley Periodicals, Inc.

Keywords

Collapsibility
Combinatory
Simplicial complex
Topology

Access to Document

10.1002/rsa.20585

Cite this

@article{1e68a80ad9384da8a50c198dbeff8ded,

title = "The threshold for d-collapsibility in random complexes",

abstract = "In this paper we determine the threshold for d-collapsibility in the probabilistic model Xd(n,p) of d-dimensional simplicial complexes. A lower bound for this threshold p=ηdn was established in (Aronshtam and Linial, Random Struct. Algorithms 46 (2015) 26-35), and here we show that this is indeed the correct threshold. Namely, for every c>ηd, a complex drawn from is asymptotically almost surely not d-collapsible.",

keywords = "Collapsibility, Combinatory, Simplicial complex, Topology",

author = "L. Aronshtam and N. Linial",

note = "Publisher Copyright: {\textcopyright} 2015 Wiley Periodicals, Inc.",

year = "2016",

month = mar,

day = "1",

doi = "10.1002/rsa.20585",

language = "אנגלית",

volume = "48",

pages = "260--269",

journal = "Random Structures and Algorithms",

issn = "1042-9832",

publisher = "John Wiley and Sons Ltd",

number = "2",

}

TY - JOUR

T1 - The threshold for d-collapsibility in random complexes

AU - Aronshtam, L.

AU - Linial, N.

PY - 2016/3/1

Y1 - 2016/3/1

N2 - In this paper we determine the threshold for d-collapsibility in the probabilistic model Xd(n,p) of d-dimensional simplicial complexes. A lower bound for this threshold p=ηdn was established in (Aronshtam and Linial, Random Struct. Algorithms 46 (2015) 26-35), and here we show that this is indeed the correct threshold. Namely, for every c>ηd, a complex drawn from is asymptotically almost surely not d-collapsible.

AB - In this paper we determine the threshold for d-collapsibility in the probabilistic model Xd(n,p) of d-dimensional simplicial complexes. A lower bound for this threshold p=ηdn was established in (Aronshtam and Linial, Random Struct. Algorithms 46 (2015) 26-35), and here we show that this is indeed the correct threshold. Namely, for every c>ηd, a complex drawn from is asymptotically almost surely not d-collapsible.

KW - Collapsibility

KW - Combinatory

KW - Simplicial complex

KW - Topology

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

U2 - 10.1002/rsa.20585

DO - 10.1002/rsa.20585

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84952897290

SN - 1042-9832

VL - 48

SP - 260

EP - 269

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

IS - 2

ER -

The threshold for d-collapsibility in random complexes

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this