Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Ewan Davies"'
Publikováno v:
PLoS ONE, Vol 18, Iss 9, p e0291514 (2023)
Although there are some techniques for dealing with sparse and concentrated discrete data, standard time-series analyses appear ill-suited to understanding the temporal patterns of terrorist attacks due to the sparsity of the events. This article add
Externí odkaz:
https://doaj.org/article/6538c0192fd54f67b04d5a3de0cd9f68
Autor:
Ewan Davies, Freddie Illingworth
Publikováno v:
SIAM Journal on Discrete Mathematics. 36:1124-1134
In 1967, Erd\H{o}s asked for the greatest chromatic number, $f(n)$, amongst all $n$-vertex, triangle-free graphs. An observation of Erd\H{o}s and Hajnal together with Shearer's classical upper bound for the off-diagonal Ramsey number $R(3, t)$ shows
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6ad0b3b3428a21b10ede4ba79ef54094
https://doi.org/10.1137/21m1437573
https://doi.org/10.1137/21m1437573
Publikováno v:
Journal of Combinatorial Theory, Series B. 151:393-416
We prove that the ‘Upper Matching Conjecture’ of Friedland, Krop, and Markstrom and the analogous conjecture of Kahn for independent sets in regular graphs hold for all large enough graphs as a function of the degree. That is, for every d and eve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::67051193ee4129926c87136c360c2402
https://doi.org/10.1016/j.jctb.2021.07.005
https://doi.org/10.1016/j.jctb.2021.07.005
Publikováno v:
Procedia Computer Science. 195:394-403
We obtain an approximate sparse hypergraph version of the blow-up lemma, showing that partite hypergraphs with sufficient regularity of small subgraph counts behave as if they were complete partite for the purpose of embedding bounded degree hypergra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::035369f6fe6bc2b2f569b58ad3eadfde
https://doi.org/10.1016/j.procs.2021.11.048
https://doi.org/10.1016/j.procs.2021.11.048
Autor:
Charlie Carlson, Ewan Davies, Nicolas Fraiman, Alexandra Kolla, Aditya Potukuchi, Corrine Yap
We give algorithms for approximating the partition function of the ferromagnetic Potts model on $d$-regular expanding graphs. We require much weaker expansion than in previous works; for example, the expansion exhibited by the hypercube suffices. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::873221a8906f563175661c2c38373ed6
http://arxiv.org/abs/2204.01923
http://arxiv.org/abs/2204.01923
Publikováno v:
Random Structures & Algorithms, 57, 730-744
Random Structures & Algorithms, 57, 3, pp. 730-744
Random Structures & Algorithms
Random Structures & Algorithms, 57, 3, pp. 730-744
Random Structures & Algorithms
We prove two distinct and natural refinements of a recent breakthrough result of Molloy (and a follow-up work of Bernshteyn) on the (list) chromatic number of triangle-free graphs. In both our results, we permit the amount of colour made available to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a3b135a48fb81ad75631dd278cfc700b
https://hdl.handle.net/2066/221942
https://hdl.handle.net/2066/221942
Publikováno v:
Annales de l'Institut Henri Poincaré D, 8(3), 459-489. European Mathematical Society Publishing House
For a graph $G=(V,E)$, $k\in \mathbb{N}$, and a complex number $w$ the partition function of the univariate Potts model is defined as \[ {\bf Z}(G;k,w):=\sum_{\phi:V\to [k]}\prod_{\substack{uv\in E \\ \phi(u)=\phi(v)}}w, \] where $[k]:=\{1,\ldots,k\}
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::27812aff879c61a0d1a132b63039fa21
https://dare.uva.nl/personal/pure/en/publications/on-zerofree-regions-for-the-antiferromagnetic-potts-model-on-boundeddegree-graphs(ac643285-b1c4-4e95-80b4-1d2a48410a23).html
https://dare.uva.nl/personal/pure/en/publications/on-zerofree-regions-for-the-antiferromagnetic-potts-model-on-boundeddegree-graphs(ac643285-b1c4-4e95-80b4-1d2a48410a23).html
Publikováno v:
Journal of Graph Theory, 97, 4, pp. 557-568
Journal of Graph Theory, 97, 557-568
Journal of Graph Theory
Journal of Graph Theory, 97, 557-568
Journal of Graph Theory
Given $\varepsilon>0$, there exists $f_0$ such that, if $f_0 \le f \le \Delta^2+1$, then for any graph $G$ on $n$ vertices of maximum degree $\Delta$ in which the neighbourhood of every vertex in $G$ spans at most $\Delta^2/f$ edges, (i) an independe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fdbd32782b3ef0413d5fb406d9bf1283
Publikováno v:
Proceedings of the American Mathematical Society. 146:111-124
We prove an asymptotically tight lower bound on the average size of independent sets in a triangle-free graph on $ n$ vertices with maximum degree $ d$, showing that an independent set drawn uniformly at random from such a graph has expected size at
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cf2e0d159505028d75aec8f1ed939e03
https://doi.org/10.1090/proc/13728
https://doi.org/10.1090/proc/13728
Publikováno v:
Journal of the London Mathematical Society. 96:47-66
We prove tight upper bounds on the logarithmic derivative of the independence and matching polynomials of d-regular graphs. For independent sets, this theorem is a strengthening of Kahn's result that a disjoint union of copies of Kd;d maximizes the n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d3cc72d71bc3335e7a752af52b4efb9b
https://doi.org/10.1112/jlms.12056
https://doi.org/10.1112/jlms.12056