70 citations · 453 across the 51 of their papers we have counts for
7 papers · 2 filters
Threshold graph limits and random threshold graphs
Persi Diaconis, Susan Holmes, Svante Janson
We study the limit theory of large threshold graphs and apply this to a variety of models for random threshold graphs. The results give a nice set of examples for the emerging theo…
The Mahonian probability distribution on words is asymptotically normal
E. Rodney Canfield, Svante Janson, Doron Zeilberger
The Mahonian statistic is the number of inversions in a permutation of a multiset with elements of type , . The counting function for this statistic is the $q…
Quasi-random graphs and graph limits
Svante Janson
We use the theory of graph limits to study several quasi-random properties, mainly dealing with various versions of hereditary subgraph counts. The main idea is to transfer the pro…
Large cliques in a power-law random graph
Svante Janson, Tomasz Łuczak, Ilkka Norros
We study the size of the largest clique in a random graph on vertices which has power-law degree distribution with exponent . We show that for `flat' de…
Asymptotic Normality of Statistics on Permutation Tableaux
Pawel Hitczenko, Svante Janson
In this paper we use a probabilistic approach to derive the expressions for the characteristic functions of basic statistics defined on permutation tableaux. Since our expressions…
Graphs where every k-subset of vertices is an identifying set
Sylvain Gravier, Svante Janson, Tero Laihonen +1
Let be an undirected graph without loops and multiple edges. A subset is called \emph{identifying} if for every vertex the intersection of and…