Distribution of coefficients of rank polynomials for random sparse graphs
The electronic journal of combinatorics, Tome 25 (2018) no. 4
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We study the distribution of coefficients of rank polynomials of random sparse graphs. We first discuss the limiting distribution for general graph sequences that converge in the sense of Benjamini-Schramm. Then we compute the limiting distribution and Newton polygons of the coefficients of the rank polynomial of random $d$-regular graphs.
DOI : 10.37236/7133
Classification : 05C31, 05C80, 05C42, 05C63, 60B10
Mots-clés : Tutte polynomial, rank polynomial, graph limits

Dmitry Jakobson  1   ; Calum MacRury  1   ; Sergey Norin  1   ; Lise Turner  1

1 McGill University
@article{10_37236_7133,
     author = {Dmitry Jakobson and Calum MacRury and Sergey Norin and Lise Turner},
     title = {Distribution of coefficients of rank polynomials for random sparse graphs},
     journal = {The electronic journal of combinatorics},
     year = {2018},
     volume = {25},
     number = {4},
     doi = {10.37236/7133},
     zbl = {1406.05047},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/7133/}
}
TY  - JOUR
AU  - Dmitry Jakobson
AU  - Calum MacRury
AU  - Sergey Norin
AU  - Lise Turner
TI  - Distribution of coefficients of rank polynomials for random sparse graphs
JO  - The electronic journal of combinatorics
PY  - 2018
VL  - 25
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.37236/7133/
DO  - 10.37236/7133
ID  - 10_37236_7133
ER  - 
%0 Journal Article
%A Dmitry Jakobson
%A Calum MacRury
%A Sergey Norin
%A Lise Turner
%T Distribution of coefficients of rank polynomials for random sparse graphs
%J The electronic journal of combinatorics
%D 2018
%V 25
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/7133/
%R 10.37236/7133
%F 10_37236_7133
Dmitry Jakobson; Calum MacRury; Sergey Norin; Lise Turner. Distribution of coefficients of rank polynomials for random sparse graphs. The electronic journal of combinatorics, Tome 25 (2018) no. 4. doi: 10.37236/7133

Cité par Sources :