Zobrazeno 1 - 10
of 85
pro vyhledávání: '"Graham Brightwell"'
We present new concentration of measure inequalities for Markov chains, generalising results for chains that are contracting in Wasserstein distance. These are particularly suited to establishing the cut-off phenomenon for suitable chains. We apply o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f57f51b825eb2d2e88e0813cc33f85b6
http://eprints.lse.ac.uk/115196/
http://eprints.lse.ac.uk/115196/
Publikováno v:
Random Structures & Algorithms. 51:565-586
We analyse the size of an independent set in a random graph on $n$ vertices with specified vertex degrees, constructed via a simple greedy algorithm: order the vertices arbitrarily, and, for each vertex in turn, place it in the independent set unless
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::210e7da8f70991912b64b2ad4cae6bc5
https://doi.org/10.1002/rsa.20716
https://doi.org/10.1002/rsa.20716
Publikováno v:
Brightwell, G, House, T & Luczak, M 2018, ' Extinction times in the subcritical stochastic SIS logistic epidemic ', Journal of Mathematical Biology, vol. 77, no. 2, pp. 1-39 . https://doi.org/10.1007/s00285-018-1210-5
Many real epidemics of an infectious disease are not straightforwardly super- or sub-critical, and the understanding of epidemic models that exhibit such complexity has been identified as a priority for theoretical work. We provide insights into the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ad9273b097e04ef7b1052d748abc5f50
http://www.scopus.com/inward/record.url?scp=85044943701&partnerID=8YFLogxK
http://www.scopus.com/inward/record.url?scp=85044943701&partnerID=8YFLogxK
Publikováno v:
Combinatorica. 33:125-160
A celebrated result of Chv\'atal, R\"odl, Szemer\'edi and Trotter states (in slightly weakened form) that, for every natural number $\Delta$, there is a constant $r_\Delta$ such that, for any connected $n$-vertex graph $G$ with maximum degree $\Delta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2d1c6f105b29457aae3edca4e1ea4054
https://doi.org/10.1007/s00493-013-2778-4
https://doi.org/10.1007/s00493-013-2778-4
Autor:
Graham Brightwell, Malwina J. Luczak
Publikováno v:
Recent Trends in Combinatorics ISBN: 9783319242965
The causal set approach to quantum gravity is based on the hypothesis that the underlying structure of spacetime is that of a random partial order. We survey some of the interesting mathematics that has arisen in connection with the causal set hypoth
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a3b91e370dbceb0765cf43fe5c70699a
https://doi.org/10.1007/978-3-319-24298-9_15
https://doi.org/10.1007/978-3-319-24298-9_15
Publikováno v:
Random Structures & Algorithms. 41:147-178
We prove that there is a constant c > 0, such that whenever p ≥ n-c, with probability tending to 1 when n goes to infinity, every maximum triangle-free subgraph of the random graph Gn,p is bipartite. This answers a question of Babai, Simonovits and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4a29345217e7a29846bd9d1b3429a5f0
https://doi.org/10.1002/rsa.20413
https://doi.org/10.1002/rsa.20413
Autor:
Gábor Simonyi, Emanuela Fachini, Ágnes Tóth, Marianne Fairthorne, János Körner, Gérard D. Cohen, Graham Brightwell
Publikováno v:
Electronic Notes in Discrete Mathematics. 38:195-199
The notion of permutation capacities is motivated by and shows similarities with the Shannon capacity of graphs and its generalization to directed graphs called Sperner capacity. We show that families of oriented paths have a different behaviour with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::156d5468142f707003be5472fbfa732a
https://doi.org/10.1016/j.endm.2011.09.033
https://doi.org/10.1016/j.endm.2011.09.033
Publikováno v:
Journal of Combinatorial Theory, Series A. 118(3):729-747
Isoperimetric inequalities have been studied since antiquity, and in recent decades they have been studied extensively on discrete objects, such as the hypercube. An important special case of this problem involves bounding the size of the shadow of a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::68b4cb22453301f900ca28cc63672767
Autor:
Gábor Simonyi, Graham Brightwell, Emanuela Fachini, Ágnes Tóth, Marianne Fairthorne, Gérard D. Cohen, János Körner
Publikováno v:
SIAM Journal on Discrete Mathematics. 24:441-456
Korner and Malvenuto asked whether one can find $\binom{n}{\lfloor n/2\rfloor}$ linear orderings (i.e., permutations) of the first $n$ natural numbers such that any pair of them places two consecutive integers somewhere in the same position. This led
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e37312778b1be245b38adb17f34d8b07
https://doi.org/10.1137/090765407
https://doi.org/10.1137/090765407
Autor:
Graham Brightwell, Nicholas Georgiou
Publikováno v:
Random Structures & Algorithms. 36:218-250
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bb3bd338a069219435afc94df5b633e7
https://doi.org/10.1002/rsa.20278
https://doi.org/10.1002/rsa.20278