27 citations · 63 across the 12 of their papers we have counts for
4 papers · 1 filter
Short Point Lists for CNFs and Stronger Constant-Depth Circuit Hardness
Xin Li, Yan Zhong
We give a short-description decomposition of bounded-width CNFs. For every fixed , every width- CNF on variables is an exact disjoint union of at most $2^{\va…
Subgraph probabilities in random intersection graphs
Katarzyna Rybarczyk, Grzegorz Serafin
Since their introduction by Karoński, Scheinerman, and Singer-Cohen in 90's, random intersection graphs have attracted much attention, mostly due to their various applications. In…
Arrangements of Consecutive Numbers in Mallows Permutations
Katarzyna Rybarczyk
We study the random variable that counts the number of specific arrangements of clustered consecutive numbers in permutations under the Mallows distribution. We provide an asymptot…
Note on edge expansion and modularity in preferential attachment graphs
Colin McDiarmid, Katarzyna Rybarczyk, Fiona Skerman +1
Edge expansion is a parameter indicating how well-connected a graph is. It is useful for designing robust networks, analysing random walks or information flow through a network and…