A Central Limit Theorem for the Number of Degree- k Vertices in Random Maps

ISSN： 0178-4617

Source： Algorithmica, Vol.66, Iss.4, 2013-08, pp. : 741-761

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

An approach via the central limit theorem to randomization of Fourier's transform

By Jumarie Guy

COMPEL: Int J for Computation and Maths. in Electrical and Electronic Eng., Vol. 18, Iss. 1, 1999-01 ,pp. : 38-42

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Study on an evolving complex network with fixed number of vertices

By Fang Aili Zhang Siying Wang Zhenling

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 39, Iss. 6, 2010-01 ,pp. : 907-914

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

A Local Limit Theorem in the Theory of Overpartitions

By Corteel Sylvie Goh William M.Y. Hitczenko Pawel

Algorithmica, Vol. 46, Iss. 3-4, 2006-11 ,pp. : 329-343

Springer Publishing Company

Access to resources Recommend Favorite

Estimating the upper limit of the number of signals

By Chen P.

Signal Processing, Vol. 83, Iss. 10, 2003-10 ,pp. : 2265-2277

Elsevier

Access to resources Recommend Favorite

Applications of real number theorem proving in PVS

By Gottliebsen Hanne Hardy Ruth Lightfoot Olga Martin Ursula

Formal Aspects of Computing, Vol. 25, Iss. 6, 2013-11 ,pp. : 993-1016

Springer Publishing Company

Access to resources Recommend Favorite