Zobrazeno 1 - 10
of 201
pro vyhledávání: '"Greenhill, Catherine"'
Autor:
Greenhill, Catherine, Makai, Tamás
A dihypergraph consists of a set of vertices and a set of directed hyperedges, where each directed hyperedge is partitioned into a head and a tail. Directed hypergraphs are useful in many applications, including the study of chemical reactions or rel
Externí odkaz:
http://arxiv.org/abs/2408.12874
We study $k$-star decompositions, that is, partitions of the edge set into disjoint stars with $k$ edges, in the uniformly random $d$-regular graph model $\mathcal{G}_{n,d}$. We prove an existence result for such decompositions for all $d,k$ such tha
Externí odkaz:
http://arxiv.org/abs/2308.16037
The triangle switch Markov chain is designed to generate random graphs with given degree sequence, but having more triangles than would appear under the uniform distribution. Transition probabilities of the chain depends on a parameter, called the ac
Externí odkaz:
http://arxiv.org/abs/2301.08499
Autor:
Greenhill, Catherine
Graphs are used in many disciplines to model the relationships that exist between objects in a complex discrete system. Researchers may wish to compare a network of interest to a "typical" graph from a family (or ensemble) of graphs which are similar
Externí odkaz:
http://arxiv.org/abs/2201.04888
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:
http://arxiv.org/abs/2106.08100
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:
http://arxiv.org/abs/2012.12972
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:
http://arxiv.org/abs/2006.12021
We consider a variation of balls-into-bins which randomly allocates $m$ balls into $n$ bins. Following Godfrey's model (SODA, 2008), we assume that each ball $t$, $1\le t\le m$, comes with a hypergraph $\mathcal{H}^{(t)}=\{B_1,B_2,\ldots,B_{s_t}\}$,
Externí odkaz:
http://arxiv.org/abs/2006.07588
Publikováno v:
Combinator. Probab. Comp. 31 (2022) 29-53
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:
http://arxiv.org/abs/2005.07350
We introduce a family of graph parameters, called induced multipartite graph parameters, and study their computational complexity. First, we consider the following decision problem: an instance is an induced multipartite graph parameter $p$ and a giv
Externí odkaz:
http://arxiv.org/abs/2004.09938