|
Diskretnyi Analiz i Issledovanie Operatsii, 2013, Volume 20, Issue 6, Pages 40–58
(Mi da752)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Asymptotic enumeration of Eulerian orientations for graphs with strong mixing properties
M. I. Isaevab, K. V. Isaevaba a Moscow Institute of Physics and Technology, 9 Institute Lane, 141700 Dolgoprudny, Russia
b Centre de Mathématiques Appliquées, École Polytechnique, 91128 Palaiseau, France
Abstract:
We prove an asymptotic formula for the number of Eulerian orientations for graphs with strong mixing properties and with vertices having even degrees. The exact value is determined up to the multiplicative error $O(n^{1+\varepsilon})$, where $n$ is the number of vertices. Bibliogr. 14.
Keywords:
Eulerian orientation, asymptotic analysis, Gaussian integral, algebraic connectivity, Laplacian.
Received: 17.10.2012 Revised: 29.03.2013
Citation:
M. I. Isaev, K. V. Isaeva, “Asymptotic enumeration of Eulerian orientations for graphs with strong mixing properties”, Diskretn. Anal. Issled. Oper., 20:6 (2013), 40–58
Linking options:
https://www.mathnet.ru/eng/da752 https://www.mathnet.ru/eng/da/v20/i6/p40
|
Statistics & downloads: |
Abstract page: | 243 | Full-text PDF : | 82 | References: | 47 | First page: | 4 |
|