FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2955201734> ?p ?o ?g. }

• W2955201734 abstract "We study certain questions related to the performance of the Karp-Sipser algorithm on the sparse Erdős-Renyi random graph. The Karp-Sipser algorithm, introduced by Karp and Sipser [34] is a greedy algorithm which aims to obtain a near-maximum matching on a given graph. The algorithm evolves through a sequence of steps. In each step, it picks an edge according to a certain rule, adds it to the matching and removes it from the remaining graph. The algorithm stops when the remining graph is empty. In [34], the performance of the Karp-Sipser algorithm on the Erdős-Renyi random graphs G(n,M = [cn/2]) and G(n, p = c/n), c G 0 is studied. It is proved there that the algorithm behaves near-optimally, in the sense that the difference between the size of a matching obtained by the algorithm and a maximum matching is at most o(n), with high probability as n → ∞. The main result of [34] is a law of large numbers for the size of a maximum matching in G(n,M = cn/2) and G(n, p = c/n), c G 0. Aronson, Frieze and Pittel [2] further refine these results. In particular, they prove that for c L e, the Karp-Sipser algorithm obtains a maximum matching, with high probability as n → ∞; for c G e, the difference between the size of a matching obtained by the algorithm and the size of a maximum matching of G(n,M = cn/2) is of order Θlog n(n1/5), with high probability as n → ∞. They further conjecture a central limit theorem for the size of a maximum matching of G(n,M = cn/2) and G(n, p = c/n) for all c G 0. As noted in [2], the central limit theorem for c L 1 is a consequence of the result of Pittel [45]. In this thesis, we prove a central limit theorem for the size of a maximum matching of both G(n,M = cn/2) and G(n, p = c/n) for c G e. (We do not analyse the case 1 ≤ c ≤ e.) Our approach is based on the further analysis of the Karp-Sipser algorithm. We use the results from [2] and refine them. For c G e, the difference between the size of a matching obtained by the algorithm and the size of a maximum matching is of order Θlog n(n1/5), with high probability as n → ∞, and the study [2] suggests that this difference is accumulated at the very end of the process. The question how the Karp-Sipser algorithm evolves in its final stages for c > e, motivated us to consider the following problem in this thesis. We study a model for the destruction of a random network by fire. Let us assume that we have a multigraph with minimum degree at least 2 with real-valued edge-lengths. We first choose a uniform random point from along the length and set it alight. The edges burn at speed 1. If the fire reaches a node of degree 2, it is passed on to the neighbouring edge. On the other hand, a node of degree at least 3 passes the fire either to all its neighbours or none, each with probability 1/2. If the fire extinguishes before the graph is burnt, we again pick a uniform point and set it alight. We study this model in the setting of a random multigraph with N nodes of degree 3 and α(N) nodes of degree 4, where α(N)/N → 0 as N → ∞. We assume the edges to have i.i.d. standard exponential lengths. We are interested in the asymptotic behaviour of the number of fires we must set alight in order to burn the whole graph, and the number of points which are burnt from two different directions. Depending on whether α(N) » √N or not, we prove that after the suitable rescaling these quantities converge jointly in distribution to either a pair of constants or to (complicated) functionals of Brownian motion. Our analysis supports the conjecture that the difference between the size of a matching obtained by the Karp-Sipser algorithm and the size of a maximum matching of the Erdős-Renyi random graph G(n,M = cn/2) for c > e, rescaled by n1/5, converges in distribution." @default.
• W2955201734 created "2019-07-12" @default.
• W2955201734 creator A5029186164 @default.
• W2955201734 date "2017-01-01" @default.
• W2955201734 modified "2023-09-27" @default.
• W2955201734 title "Some problems related to the Karp-Sipser algorithm on random graphs" @default.
• W2955201734 hasPublicationYear "2017" @default.
• W2955201734 type Work @default.
• W2955201734 sameAs 2955201734 @default.
• W2955201734 citedByCount "0" @default.
• W2955201734 crossrefType "dissertation" @default.
• W2955201734 hasAuthorship W2955201734A5029186164 @default.
• W2955201734 hasConcept C100107663 @default.
• W2955201734 hasConcept C105795698 @default.
• W2955201734 hasConcept C11413529 @default.
• W2955201734 hasConcept C114614502 @default.
• W2955201734 hasConcept C118615104 @default.
• W2955201734 hasConcept C132525143 @default.
• W2955201734 hasConcept C165064840 @default.
• W2955201734 hasConcept C203776342 @default.
• W2955201734 hasConcept C33923547 @default.
• W2955201734 hasConcept C43517604 @default.
• W2955201734 hasConcept C47458327 @default.
• W2955201734 hasConceptScore W2955201734C100107663 @default.
• W2955201734 hasConceptScore W2955201734C105795698 @default.
• W2955201734 hasConceptScore W2955201734C11413529 @default.
• W2955201734 hasConceptScore W2955201734C114614502 @default.
• W2955201734 hasConceptScore W2955201734C118615104 @default.
• W2955201734 hasConceptScore W2955201734C132525143 @default.
• W2955201734 hasConceptScore W2955201734C165064840 @default.
• W2955201734 hasConceptScore W2955201734C203776342 @default.
• W2955201734 hasConceptScore W2955201734C33923547 @default.
• W2955201734 hasConceptScore W2955201734C43517604 @default.
• W2955201734 hasConceptScore W2955201734C47458327 @default.
• W2955201734 hasLocation W29552017341 @default.
• W2955201734 hasOpenAccess W2955201734 @default.
• W2955201734 hasPrimaryLocation W29552017341 @default.
• W2955201734 hasRelatedWork W1548168548 @default.
• W2955201734 hasRelatedWork W1565384686 @default.
• W2955201734 hasRelatedWork W1732919352 @default.
• W2955201734 hasRelatedWork W1917184511 @default.
• W2955201734 hasRelatedWork W2095073488 @default.
• W2955201734 hasRelatedWork W2145192475 @default.
• W2955201734 hasRelatedWork W2750681941 @default.
• W2955201734 hasRelatedWork W2903540361 @default.
• W2955201734 hasRelatedWork W2950262288 @default.
• W2955201734 hasRelatedWork W2951109865 @default.
• W2955201734 hasRelatedWork W2953048456 @default.
• W2955201734 hasRelatedWork W2962910333 @default.
• W2955201734 hasRelatedWork W2965323926 @default.
• W2955201734 hasRelatedWork W3007661461 @default.
• W2955201734 hasRelatedWork W3016624917 @default.
• W2955201734 hasRelatedWork W3022523306 @default.
• W2955201734 hasRelatedWork W3158696645 @default.
• W2955201734 hasRelatedWork W2123734400 @default.
• W2955201734 hasRelatedWork W2185076815 @default.
• W2955201734 hasRelatedWork W3046823294 @default.
• W2955201734 isParatext "false" @default.
• W2955201734 isRetracted "false" @default.
• W2955201734 magId "2955201734" @default.
• W2955201734 workType "dissertation" @default.