1k citations
- A. Sopczak2 profiles59 · h 83
- B. Åsman9 profiles58 · h 98
- L. Mundim2 profiles56 · h 124
- M. Begalli5 profiles56 · h 68
- M. Besançon2 profiles56 · h 132
- Y. Arnoud2 profiles56 · h 42
- D. Wicke5 profiles55 · h 64
- P. Verdier2 profiles55 · h 114
- P. Jonsson5 profiles52 · h 54
- D. Schaile7 profiles48 · h 87
- A. Meyer3 profiles42 · h 142
- C. Bélanger-Champagne2 profiles42 · h 92
- Stockholm UniversitySE65 papers
- Joint Institute for Nuclear ResearchRU64 papers
- Centre National de la Recherche ScientifiqueFR63 papers
- Lund UniversitySE60 papers
- University of WuppertalDE60 papers
- Iowa State UniversityUS59 papers
- Charles UniversityCZ58 papers
- Lancaster UniversityGB58 papers
- Lyon 1 UniversitéFR57 papers
- Universidade do Estado do Rio de JaneiroBR57 papers
- Sorbonne UniversitéFR55 papers
- FZU ‒ Institute of Physics of the Academy of Sciences of the Czech RepublicCZ54 papers
4 papers · 2 filters
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…