Some Probabilistic Trees with Algebraic Roots

dc.contributor.author	Bernardi, Olivier
dc.contributor.author	Morales, Alejandro M.
dc.date.accessioned	2018-02-16T18:51:39Z
dc.date.available	2018-02-16T18:51:39Z
dc.date.issued	2016
dc.identifier.citation	Bernardi, Olivier, and Alejandro H. Morales. "Some Probabilistic Trees with Algebraic Roots." 2015.
dc.identifier.issn	1077-8926
dc.identifier.uri	http://hdl.handle.net/10192/35472
dc.description	Published version can be found on Electronic Journal of Combinatorics
dc.description.abstract	We consider several probabilistic processes defining a random graph. One of these processes appeared recently in connection with a factorization problem in the symmetric group. For each process, we prove that the probability for the random graph to be a tree has an unexpectedly simple expression, which is independent of most parameters of the problem. This raises many open questions.
dc.description.sponsorship	Supported by NSF grant DMS-1308441, and ERC ExploreMaps and support from a CRM-ISM postdoctoral fellowship.
dc.language	English
dc.language.iso	eng
dc.publisher	Electronic Journal of Combinatorics
dc.rights	Copyright by the authors 2016
dc.subject	Branched polymers
dc.subject	Random graphs
dc.subject	Random trees
dc.subject	Matrix-tree theorem
dc.title	Some Probabilistic Trees with Algebraic Roots
dc.type	Article
dc.contributor.department	Department of Mathematics
dc.description.esploro	yes