Abstract
Retraction of: The speed of a biased random walk on a Galton-Watson tree is analytic
Highlights
The proofs of Theorem 1.1 and Lemma 3.1 use compact convergence of analytic functions to prove analyticity of the limiting function. Such an argument only holds for complex analytic functions and the argument is insufficient to deduce the aforementioned results
Donate to the IMS open access fund6
Summary
The proofs of Theorem 1.1 and Lemma 3.1 use compact convergence of analytic functions to prove analyticity of the limiting function. Retraction of: The speed of a biased random walk on a Galton-Watson tree is analytic*
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
