Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Kathrin Skubch"'
Publikováno v:
Random Structures & Algorithms. 51:459-482
The k-core, defined as the maximal subgraph of minimum degree at least k, of the random graph G(n,p) has been studied extensively. In a landmark paper Pittel, Wormald and Spencer [J Combin Theory Ser B 67 (1996), 111–151] determined the threshold d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8afd9a7126c87994363526df93ecac06
https://doi.org/10.1002/rsa.20712
https://doi.org/10.1002/rsa.20712
Publikováno v:
Theory of Computing. 13:1-22
In the planted bisection model a random graph G(n,p_+,p_-) with n vertices is created by partitioning the vertices randomly into two classes of equal size (up to plus or minus 1). Any two vertices that belong to the same class are linked by an edge w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::00f3520df87937b1bc6a760331321445
https://doi.org/10.4086/toc.2017.v013a008
https://doi.org/10.4086/toc.2017.v013a008
We establish a multivariate local limit theorem for the order and size as well as several other parameters of the k-core of the Erdős–Renyi random graph. The proof is based on a novel approach to the k-core problem that replaces the meticulous ana
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::11150a4c2f73aca0ee68f646baee4b06
http://arxiv.org/abs/1707.03556
http://arxiv.org/abs/1707.03556
Building upon the theory of graph limits and the Aldous–Hoover representation and inspired by Panchenko’s work on asymptotic Gibbs measures [Annals of Probability 2013], we construct continuous embeddings of discrete probability distributions. We
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5f7ee54fce434f7c82edfe9025dc886a