Some probabilistic trees with algebraic roots

From MaRDI portal
Publication:286127

zbMATH Open1336.05112arXiv1501.01135MaRDI QIDQ286127FDOQ286127


Authors: Olivier Bernardi, Alejandro H. Morales Edit this on Wikidata


Publication date: 20 May 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: In this article we consider several probabilistic processes defining random grapha. One of these processes appeared recently in connection with a factorization problem in the symmetric group. For each of the probabilistic processes, we prove that the probability for the random graph to be a tree has an extremely simple expression, which is independent of most parameters of the problem. This raises many open questions.


Full work available at URL: https://arxiv.org/abs/1501.01135

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations




Cites Work


Cited In (5)





This page was built for publication: Some probabilistic trees with algebraic roots

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q286127)