Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Fiona Skerman"'
Autor:
Andrzej Grzesik, Mirjana Mikalački, Zoltán Lóránt Nagy, Alon Naor, Balázs Patkós, Fiona Skerman
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 17 no. 1, Iss Combinatorics (2015)
Combinatorics
Externí odkaz:
https://doaj.org/article/dd5c66a584de45aabefc7e48891f4af8
Publikováno v:
Johnson, T, Podder, M & Skerman, F 2019, ' Random tree recursions : Which fixed points correspond to tangible sets of trees? ', Random Structures and Algorithms . https://doi.org/10.1002/rsa.20895
Let $\mathcal{B}$ be the set of rooted trees containing an infinite binary subtree starting at the root. This set satisfies the metaproperty that a tree belongs to it if and only if its root has children $u$ and $v$ such that the subtrees rooted at $
Autor:
Fiona Skerman, Colin McDiarmid
Publikováno v:
Random Structures & Algorithms. 57:211-243
For a given graph G, modularity gives a score to each vertex partition, with higher values taken to indicate that the partition better captures community structure in G. The modularity q∗(G) (where 0 ≤ q∗(G) ≤ 1) of the graph G is defined to
Autor:
Fiona Skerman, Kitty Meeks
Publikováno v:
IPEC
Meeks, K & Skerman, F 2019, ' The Parameterised Complexity of Computing the Maximum Modularity of a Graph ', Algorithmica . https://doi.org/10.1007/s00453-019-00649-7
Meeks, K & Skerman, F 2019, ' The Parameterised Complexity of Computing the Maximum Modularity of a Graph ', Algorithmica . https://doi.org/10.1007/s00453-019-00649-7
The maximum modularity of a graph is a parameter widely used to describe the level of clustering or community structure in a network. Determining the maximum modularity of a graph is known to be NP-complete in general, and in practice a range of heur
We introduce a generalization of Galton-Watson trees where, individuals have independently a number of Poi(1 + p) offspring and, at each generation, pairs of cousins merge independently with probability q. If q = 0 we recover a usual Galton-Watson tr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3a9a97d6632251f939392cea561c582c
http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-471600
http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-471600
Autor:
Robert Hancock, Adam Kabela, Daniel Král’, Taísa Martins, Roberto Parente, Fiona Skerman, Jan Volec
A tournament H is quasirandom-forcing if the following holds for every sequence (G_n) of tournaments of growing orders: if the density of H in G_n converges to the expected density of H in a random tournament, then (G_n) is quasirandom. Every transit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4414c686229f1babf70b0aad4a0a9218
http://arxiv.org/abs/1912.04243
http://arxiv.org/abs/1912.04243
Publikováno v:
Cai, X S, Holmgren, C, Devroye, L & Skerman, F 2019, ' k-cut on paths and some trees ', Electronic Journal of Probability, vol. 24, 53 . https://doi.org/10.1214/19-EJP318
Electron. J. Probab.
Electron. J. Probab.
We define the (random) $k$-cut number of a rooted graph to model the difficulty of the destruction of a resilient network. The process is as the cut model of Meir and Moon except now a node must be cut $k$ times before it is destroyed. The first orde
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7389b68b5a94c029fb3b59737a55cf70
https://hdl.handle.net/1983/b972962c-1deb-4b72-bcde-40e8b595381d
https://hdl.handle.net/1983/b972962c-1deb-4b72-bcde-40e8b595381d
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030174019
CIAC
CIAC
We define the (random) \(k\)-cut number of a rooted graph to model the difficulty of the destruction of a resilient network. The process is as the cut model of Meir and Moon [14] except now a node must be cut \(k\) times before it is destroyed. The f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7317e0af7602a7bf260b8ce83bae3b3f
https://doi.org/10.1007/978-3-030-17402-6_10
https://doi.org/10.1007/978-3-030-17402-6_10
Publikováno v:
Albert, M, Holmgren, C, Johansson, T & Skerman, F 2020, ' Embedding Small Digraphs and Permutations in Binary Trees and Split Trees ', Algorithmica, vol. 82, pp. 589–615 . https://doi.org/10.1007/s00453-019-00667-5
We investigate the number of permutations that occur in random labellings of trees. This is a generalisation of the number of subpermutations occurring in a random permutation. It also generalises some recent results on the number of inversions in ra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ffe650a6d7fbb2bce9ef974fd3ff4905
Autor:
Fiona Skerman, Colin McDiarmid
Clustering algorithms for large networks typically use modularity values to test which partitions of the vertex set better represent structure in the data. The modularity of a graph is the maximum modularity of a partition. We consider the modularity
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1409fd5efcd90b57c596d25d3dcf71fb
https://ora.ox.ac.uk/objects/uuid:57a288f6-c40e-42bd-8ef9-e171cd484c28
https://ora.ox.ac.uk/objects/uuid:57a288f6-c40e-42bd-8ef9-e171cd484c28