4 citations · 4 across the 9 of their papers we have counts for
11 papers
Early career researcher responses to AI in math
Anna Brandenberger, Hanna Mularczyk, Dora Woodruff
We've heard a lot about AI in math from Fields medalists, AI labs, and established professors. However, the personal stakes are highest for early career researchers. Hoping to prov…
The largest common subtree of two random trees
Omer Angel, Caelan Atamanchuk, Anna Brandenberger +2
We study the size and structure of the largest common subtree (LCS) between two independent Bienaymé trees conditioned to have size . When the trees are critical with finite …
Does freezing impede the growth of random recursive trees?
Anna Brandenberger, Simon Briend, Hannah Cairns +2
Uniform attachment with freezing is an extension of the classical model of random recursive trees, in which trees are recursively built by attaching new vertices to old ones. In th…
Temporal connectivity of Random Geometric Graphs
Anna Brandenberger, Serte Donderwinkel, Céline Kerriou +2
A temporal random geometric graph is a random geometric graph in which all edges are endowed with a uniformly random time-stamp, representing the time of interaction between vertic…
Leaf Stripping on Uniform Attachment Trees
Louigi Addario-Berry, Anna Brandenberger, Simon Briend +2
In this note we analyze the performance of a simple root-finding algorithm in uniform attachment trees. The leaf-stripping algorithm recursively removes all leaves of the tree for…
Progress Towards Decoding Visual Imagery via fNIRS
Michel Adamic, Wellington Avelino, Anna Brandenberger +14
We demonstrate the possibility of reconstructing images from fNIRS brain activity and start building a prototype to match the required specs. By training an image reconstruction mo…
Leaf multiplicity in a Bienaymé-Galton-Watson tree
Anna M. Brandenberger, Luc Devroye, Marcel K. Goh +1
This note defines a notion of multiplicity for nodes in a rooted tree and presents an asymptotic calculation of the maximum multiplicity over all leaves in a Bienaymé-Galton-Watson…
Universal height and width bounds for random trees
Louigi Addario-Berry, Anna Brandenberger, Jad Hamdan +1
We prove non-asymptotic stretched exponential tail bounds on the height of a randomly sampled node in a random combinatorial tree, which we use to prove bounds on the heights and w…
A Study of Policy Gradient on a Class of Exactly Solvable Models
Gavin McCracken, Colin Daniels, Rosie Zhao +3
Policy gradient methods are extensively used in reinforcement learning as a way to optimize expected return. In this paper, we explore the evolution of the policy parameters, for a…
The Horton-Strahler Number of Conditioned Galton-Watson Trees
Anna M. Brandenberger, Luc Devroye, Tommy Reddad
The Horton-Strahler number of a tree is a measure of its branching complexity; it is also known in the literature as the register function. We show that for critical Galton-Watson…
Root estimation in Galton-Watson trees
Anna M. Brandenberger, Luc Devroye, Marcel K. Goh
Given only the free-tree structure of a tree, the root estimation problem asks if one can guess which of the free tree's nodes is the root of the original tree. We determine the ma…