Zobrazeno 1 - 10
of 69
pro vyhledávání: '"Catherine Greenhill"'
Autor:
Pu Gao, Catherine Greenhill
Publikováno v:
Discrete Applied Mathematics. 291:143-162
The switch chain is a well-studied Markov chain which can be used to sample approximately uniformly from the set $\Omega(\boldsymbol{d})$ of all graphs with a given degree sequence $\boldsymbol{d}$. Polynomial mixing time (rapid mixing) has been esta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ff228fd42c8e5e9062cdb01ef21441b4
https://doi.org/10.1016/j.dam.2020.12.004
https://doi.org/10.1016/j.dam.2020.12.004
Autor:
Catherine Greenhill, Changhao Chen
Publikováno v:
Journal of Combinatorics. 12:157-183
The study of substructures in random objects has a long history, beginning with Erd\H{o}s and R\'enyi's work on subgraphs of random graphs. We study the existence of certain substructures in random subsets of vector spaces over finite fields. First w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6e3b0051857e262188fa853fb762929c
https://doi.org/10.4310/joc.2021.v12.n1.a6
https://doi.org/10.4310/joc.2021.v12.n1.a6
Publikováno v:
Journal of Combinatorial Theory, Series B. 142:307-373
Let G ( n , r , s ) denote a uniformly random r-regular s-uniform hypergraph on n vertices, where s is a fixed constant and r = r ( n ) may grow with n. An l-overlapping Hamilton cycle is a Hamilton cycle in which successive edges overlap in precisel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2d717bae13535e3c8efe0400a1b24843
https://doi.org/10.1016/j.jctb.2019.11.001
https://doi.org/10.1016/j.jctb.2019.11.001
Autor:
Peter J. Ayre, Catherine Greenhill
Publikováno v:
SIAM Journal on Discrete Mathematics. 33:1575-1606
We consider the problem of $q$-coloring a $k$-uniform random hypergraph, where $q,k \geq 3$, and determine the rigidity threshold. For edge densities above the rigidity threshold, we show that almo...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::85172812e3325bc7e632b17fdefe3fe4
https://doi.org/10.1137/18m1207211
https://doi.org/10.1137/18m1207211
We find an asymptotic enumeration formula for the number of simple $r$-uniform hypergraphs with a given degree sequence, when the number of edges is sufficiently large. The formula is given in terms of the solution of a system of equations. We give s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d7328b66473fca1e43978422edd655a0
http://arxiv.org/abs/2106.08100
http://arxiv.org/abs/2106.08100
Publikováno v:
Discrete Mathematics
Discrete Mathematics, Elsevier, 2021, 344 (11), pp.1-14. ⟨10.1016/j.disc.2021.112566⟩
Discrete Mathematics, 344(11)
Discrete Mathematics, 2021, 344 (11), pp.1-14. ⟨10.1016/j.disc.2021.112566⟩
Dyer, M, Greenhill, C, Kleer, P, Ross, J & Stougie, L 2021, ' Sampling hypergraphs with given degrees ', Discrete Mathematics, vol. 344, no. 11, 112566, pp. 1-14 . https://doi.org/10.1016/j.disc.2021.112566
Discrete Mathematics, 344(11):112566. Elsevier
Discrete Mathematics, 344(11):112566, 1-14. Elsevier
Discrete Mathematics, Elsevier, 2021, 344 (11), pp.1-14. ⟨10.1016/j.disc.2021.112566⟩
Discrete Mathematics, 344(11)
Discrete Mathematics, 2021, 344 (11), pp.1-14. ⟨10.1016/j.disc.2021.112566⟩
Dyer, M, Greenhill, C, Kleer, P, Ross, J & Stougie, L 2021, ' Sampling hypergraphs with given degrees ', Discrete Mathematics, vol. 344, no. 11, 112566, pp. 1-14 . https://doi.org/10.1016/j.disc.2021.112566
Discrete Mathematics, 344(11):112566. Elsevier
Discrete Mathematics, 344(11):112566, 1-14. Elsevier
There is a well-known connection between hypergraphs and bipartite graphs, obtained by treating the incidence matrix of the hypergraph as the biadjacency matrix of a bipartite graph. We use this connection to describe and analyse a rejection sampling
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0ae27ea7dce47c429158c263506271fc
https://doi.org/10.1016/j.disc.2021.112566
https://doi.org/10.1016/j.disc.2021.112566
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030799861
IWOCA
IWOCA
Switches are operations which make local changes to the edges of a graph, usually with the aim of preserving the vertex degrees. We study a restricted set of switches, called triangle switches. Each triangle switch creates or deletes at least one tri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e3053794cf21ec99ef52abe38d56f2fa
https://doi.org/10.1007/978-3-030-79987-8_22
https://doi.org/10.1007/978-3-030-79987-8_22
Let $\mathcal{G}_{n,r,s}$ denote a uniformly random $r$-regular $s$-uniform hypergraph on the vertex set $\{1,2,\ldots, n\}$. We establish a threshold result for the existence of a spanning tree in $\mathcal{G}_{n,r,s}$, restricting to $n$ satisfying
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a3ceb0b8cd3582e586f79dd527b889b3
http://arxiv.org/abs/2005.07350
http://arxiv.org/abs/2005.07350
Publikováno v:
Global Crime. 18:424-441
The current paper aimed to investigate the effectiveness of five law enforcement interventions in disrupting and dismantling criminal networks. We tested three law enforcement interventions that targeted social capital in criminal networks (betweenne
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ac31cebb24ecf079a73f820176b81f02
https://doi.org/10.1080/17440572.2017.1377614
https://doi.org/10.1080/17440572.2017.1377614