The Metropolis Algorithm is an extremely useful and popular method of approximately sampling from complicated probability distributions. "Adaptive" versions automatically modify the algorithm while it runs, to improve its performance on the fly, but at the risk of destroying the Markov chain properties necessary for the algorithm to be valid. I...
Creator:
Rosenthal, Jeffrey (University of Toronto)
Created:
2021-03-23
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.
There are well known connections between the random walk on a graph, and its topological and spectral properties. In this talk we will define a new stochastic process on higher dimensional simplicial complexes, which reflects their homological and spectral properties in a parallel way. This leads to high dimensional analogues (not all of which h...
Creator:
Rosenthal, Ron (ETH Zürich)
Created:
2014-04-29
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.
Time Frames: The Past in the Present. How we experience time is the primary interest of this project -- the fictions and narratives of time embodied in architecture. Time Frames is the attempt to provide a view of architecture through the frame of time -- the distance from what the structures were in their own time to Rose's reading now, how tim...
Creator:
Rose, Thomas
Contributor:
Danto, Elizabeth Ann; Goebel, John
Created:
2008-03-10
Contributed By:
University of Minnesota, Institute for Advanced Study.