Advanced search

Browse by subject

Browse by provider

Browse by language

Content Details
Normal View
CIP View

The Matching Process and Independent Pro...

Bal, Deepak...

Free

Share this content

The Matching Process and Independent Process in Random Regular Graphs and Hypergraphs by Bal, Deepak ( Author )

Content Provider	Lemonjar Open Access
Publisher	Australian National University
Publication Date	08-08-2023
Summary	In this note, we analyze two random greedy processes on sparse random graphs and hypergraphs with a given degree sequence. First we analyze the matching process, which builds a set of disjoint edges one edge at a time; then we analyze the independent process, which builds an independent set of vertices one vertex at a time. We use the differential equations method and apply a general theorem of Warnke. Our main contribution is to significantly reduce the associated systems of differential equations and simplify the expression for the final size of the matching or independent set.
ISBN	-
Item Type	Article
File Type	pdf
File Size	29.34 KB
Language	English
Subjects	-
Unlimited	MYR 0.01
Total read	-
URL	http://arxiv.org/abs/1603.09232

Citation

Review the full bibliography data and make any necessary corrections before using. Always consult your library resources for the exact formatting and punctuation guidelines.

AMA 11th EditionReferences

Bal, Deepak. The Matching Process and Independent Process in Random Regular Graphs and Hypergraphs. Australian National University. August 08, 2023. Accessed October 04, 2025. https://online.provdatabase.com/cite/12953

APA 7th EditionReferences

Bal, Deepak. (2023). The Matching Process and Independent Process in Random Regular Graphs and Hypergraphs. Australian National University. https://online.provdatabase.com/cite/12953

Chicago 17th EditionReferences

Bal, Deepak. The Matching Process and Independent Process in Random Regular Graphs and Hypergraphs. Australian National University. 2023. https://online.provdatabase.com/cite/12953

HarvardReferences

Bal, Deepak. (2023). The Matching Process and Independent Process in Random Regular Graphs and Hypergraphs. [Online]. Australian National University. Available from: https://online.provdatabase.com/cite/12953. (Accessed 04 October 2025).

Harvard AustraliaReferences

Bal, Deepak, 2023, The Matching Process and Independent Process in Random Regular Graphs and Hypergraphs, Australian National University, viewed 04 October 2025, <https://online.provdatabase.com/cite/12953>

MLA 9th EditionWorks Cited

Bal, Deepak. The Matching Process and Independent Process in Random Regular Graphs and Hypergraphs. Australian National University, 2023. PROV Database, https://online.provdatabase.com/cite/12953.

Share this eBook