Fiona Skerman

From flip processes to dynamical systems on graphons

Garbe, Frederik; Hladky, Jan; Sileikis, Matas; Skerman, Fiona

Ingår i Annales de l'I.H.P. Probabilites et statistiques, s. 2878-2922, 2024

• DOI för From flip processes to dynamical systems on graphons

Modularity and Graph Expansion

Louf, Baptiste; McDiarmid, Colin; Skerman, Fiona

Ingår i 15TH INNOVATIONS IN THEORETICAL COMPUTER SCIENCE CONFERENCE, ITCS 2024, 2024

• DOI för Modularity and Graph Expansion
• Ladda ner fulltext (pdf) av Modularity and Graph Expansion

A branching process with deletions and mergers that matches the threshold for hypercube percolation

Eslava, Laura; Penington, Sarah; Skerman, Fiona

Ingår i Annales de l'I.H.P. Probabilites et statistiques, s. 1418-1457, 2024

• DOI för A branching process with deletions and mergers that matches the threshold for hypercube percolation

Is it easier to count communities than find them?

Rush, Cynthia; Skerman, Fiona; Wein, Alexander S.; Yang, Dana

Ingår i 14th Innovations in Theoretical Computer Science Conference (ITCS 2023), 2023

• DOI för Is it easier to count communities than find them?
• Ladda ner fulltext (pdf) av Is it easier to count communities than find them?

Finding large expanders in graphs: from topological minors to induced subgraphs

Louf, Baptiste; Skerman, Fiona

Ingår i The Electronic Journal of Combinatorics, 2023

• DOI för Finding large expanders in graphs: from topological minors to induced subgraphs
• Ladda ner fulltext (pdf) av Finding large expanders in graphs: from topological minors to induced subgraphs

From flip processes to dynamical systems on graphons

Garbe, Frederik; Hladky, Jan; Sileikis, Matas; Skerman, Fiona

Ingår i Annales de l'I.H.P. Probabilites et statistiques, s. 2878-2922, 2024

• DOI för From flip processes to dynamical systems on graphons

A branching process with deletions and mergers that matches the threshold for hypercube percolation

Eslava, Laura; Penington, Sarah; Skerman, Fiona

Ingår i Annales de l'I.H.P. Probabilites et statistiques, s. 1418-1457, 2024

• DOI för A branching process with deletions and mergers that matches the threshold for hypercube percolation

Finding large expanders in graphs: from topological minors to induced subgraphs

Louf, Baptiste; Skerman, Fiona

Ingår i The Electronic Journal of Combinatorics, 2023

• DOI för Finding large expanders in graphs: from topological minors to induced subgraphs
• Ladda ner fulltext (pdf) av Finding large expanders in graphs: from topological minors to induced subgraphs

No additional tournaments are quasirandom-forcing?

Hancock, Robert; Kabela, Adam; Kral', Daniel; Martins, Taisa et al.

Ingår i European journal of combinatorics (Print), 2023

• DOI för No additional tournaments are quasirandom-forcing?

Assigning times to minimise reachability in temporal graphs

Enright, Jessica; Meeks, Kitty; Skerman, Fiona

Ingår i Journal of computer and system sciences (Print), s. 169-186, 2021

• DOI för Assigning times to minimise reachability in temporal graphs
• Ladda ner fulltext (pdf) av Assigning times to minimise reachability in temporal graphs

The modularity of random graphs on the hyperbolic plane

Chellig, Jordan; Fountoulakis, Nikolaos; Skerman, Fiona

Ingår i Journal of Complex Networks, 2021

• DOI för The modularity of random graphs on the hyperbolic plane
• Ladda ner fulltext (pdf) av The modularity of random graphs on the hyperbolic plane

Random tree recursions: Which fixed points correspond to tangible sets of trees?

Johnson, Tobias; Podder, Moumanti; Skerman, Fiona

Ingår i Random structures & algorithms (Print), s. 796-837, 2020

• DOI för Random tree recursions: Which fixed points correspond to tangible sets of trees?

Modularity of Erdos-Rényi random graphs

McDiarmid, Colin; Skerman, Fiona

Ingår i Random structures & algorithms (Print), s. 211-243, 2020

• DOI för Modularity of Erdos-Rényi random graphs

kappa-cut on paths and some trees

Cai, Xing Shi; Holmgren, Cecilia; Devroye, Luc; Skerman, Fiona

Ingår i Electronic Journal of Probability, 2019

• DOI för kappa-cut on paths and some trees
• Ladda ner fulltext (pdf) av kappa-cut on paths and some trees

Inversions in Split Trees and Conditional Galton-Watson Treest

Cai, Xing Shi; Holmgren, Cecilia; Janson, Svante; Johansson, Tony et al.

Ingår i Combinatorics, probability & computing, s. 335-364, 2019

• DOI för Inversions in Split Trees and Conditional Galton-Watson Treest

Modularity of regular and treelike graphs

McDiarmid, Colin; Skerman, Fiona

Ingår i Journal of Complex Networks, s. 596-619, 2018

• DOI för Modularity of regular and treelike graphs

Guessing Numbers of Odd Cycles

Atkins, Ross; Rombach, Puck; Skerman, Fiona

Ingår i The Electronic Journal of Combinatorics, 2017

• DOI för Guessing Numbers of Odd Cycles
• Ladda ner fulltext (pdf) av Guessing Numbers of Odd Cycles

Degree sequences of random digraphs and bipartite graphs

McKay, Brendan D.; Skerman, Fiona

Ingår i Journal of Combinatorics, s. 21-49, 2016

• DOI för Degree sequences of random digraphs and bipartite graphs

Avoider-enforcer star games

Grzesik, Andrzej; Mikalački, Mirjana; Nagy, Zoltán Lóránt; Naor, Alon et al.

Ingår i Discrete Mathematics & Theoretical Computer Science, s. 145-160, 2015

• DOI för Avoider-enforcer star games

Modularity and Graph Expansion

Louf, Baptiste; McDiarmid, Colin; Skerman, Fiona

Ingår i 15TH INNOVATIONS IN THEORETICAL COMPUTER SCIENCE CONFERENCE, ITCS 2024, 2024

• DOI för Modularity and Graph Expansion
• Ladda ner fulltext (pdf) av Modularity and Graph Expansion

Is it easier to count communities than find them?

Rush, Cynthia; Skerman, Fiona; Wein, Alexander S.; Yang, Dana

Ingår i 14th Innovations in Theoretical Computer Science Conference (ITCS 2023), 2023

• DOI för Is it easier to count communities than find them?
• Ladda ner fulltext (pdf) av Is it easier to count communities than find them?

Survival for a Galton-Watson tree with cousin mergers

Eslava, Laura; Penington, Sarah; Skerman, Fiona

Ingår i PROCEEDINGS OF THE XI LATIN AND AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM, s. 445-452, 2021

• DOI för Survival for a Galton-Watson tree with cousin mergers
• Ladda ner fulltext (pdf) av Survival for a Galton-Watson tree with cousin mergers