70 citations · 495 across the 84 of their papers we have counts for
4 papers · 1 filter
A note on estimating global subgraph counts by sampling
Svante Janson, Valentas Kurauskas
We give a simple proof of a generalization of an inequality for homomorphism counts by Sidorenko (1994). A special case of our inequality says that if denotes the degree of a…
Identities and periodic oscillations of divide-and-conquer recurrences splitting at half
Hsien-Kuei Hwang, Svante Janson, Tsung-Hsi Tsai
We study divide-and-conquer recurrences of the form \begin{equation*} f(n) = αf(\lfloor \tfrac n2\rfloor) + βf(\lceil \tfrac n2\rceil) + g(n) \qquad(n\ge2), \end{equation*} with $g…
The number of occurrences of patterns in a random tree or forest permutation
Svante Janson
The classes of tree permutations and forest permutations were defined by Acan and Hitczenko (2016). We study random permutations of a given length from these classes, and in partic…
Edge coherence in multiplex networks
Swati Chandna, Svante Janson, Sofia C. Olhede
This paper introduces a nonparametric framework for the setting where multiple networks are observed on the same set of nodes, also known as multiplex networks. Our objective is to…