1k citations
- A. Sopczak2 profiles75 · h 83
- B. Åsman8 profiles74 · h 98
- L. Mundim2 profiles72 · h 124
- M. Begalli6 profiles72 · h 68
- M. Besançon2 profiles72 · h 132
- Y. Arnoud2 profiles72 · h 42
- D. Wicke6 profiles71 · h 64
- P. Verdier2 profiles71 · h 114
- P. Jonsson8 profiles69 · h 54
- D. Schaile8 profiles61 · h 87
- M. Mulders7 profiles57 · h 118
- A. Meyer3 profiles54 · h 142
- Stockholm UniversitySE84 papers
- Centre National de la Recherche ScientifiqueFR83 papers
- Joint Institute for Nuclear ResearchRU80 papers
- Lund UniversitySE79 papers
- University of WuppertalDE76 papers
- Charles UniversityCZ75 papers
- Iowa State UniversityUS75 papers
- Lancaster UniversityGB74 papers
- Sorbonne UniversitéFR74 papers
- Universidade do Estado do Rio de JaneiroBR73 papers
- Lyon 1 UniversitéFR71 papers
- FZU ‒ Institute of Physics of the Academy of Sciences of the Czech RepublicCZ69 papers
10 papers · 1 filter
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…
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…
Poset limits and exchangeable random posets
Svante Janson
We develop a theory of limits of finite posets in close analogy to the recent theory of graph limits. In particular, we study representations of the limits by functions of two vari…
Generalized Stirling permutations, families of increasing trees and urn models
Svante Janson, Markus Kuba, Alois Panholzer
Bona [2007+] studied the distribution of ascents, plateaux and descents in the class of Stirling permutations, introduced by Gessel and Stanley [1978]. Recently, Janson [2008+] sho…
On the size of identifying codes in binary hypercubes
Svante Janson, Tero Laihonen
We consider identifying codes in binary Hamming spaces F^n, i.e., in binary hypercubes. The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 199…