Speaker: Yuriy Mileyko (UH)
Title: Internet and its Dimensions
Abstract
The large-scale structure of the Internet (or, rather of the graph of
the Autonomous System Nodes) has been attracting a lot of attention by
the researchers for decades. One family of attractive models for this
graph stipulates that it “looks like” is if sampled from a hyperbolic
plane. We shall discuss possible tests for the dimension of samples from
manifolds, and apply them to the ANS graph.
The on-line interactive Complexity Option Game allows players to test their intuition and knowledge of complexity and American options.
Its companion paper is “Pricing complexity options”, to appear in the journal Algorithmic Finance, joint with Math graduate Malihe Alikhani, and Shidler graduates Amir Pakravan and Babak Saadat.
The paper introduces a thought experiment: a financial derivative based on the complexity of a sequence of up and down ticks of a stock price.
The difficulty of succeeding in this game may be related to the phenomenon of bounded rationality, to be discussed by Lance Fortnow during the 11th International Conference on Computability, Complexity and Randomness, UH Manoa, January 4-8, 2016.
Event Sponsor
Mathematics, Manoa Campus
More Information
Bjørn Kjos-Hanssen, 9568595, bjoern.kjos-hanssen@hawaii.edu, http://math.hawaii.edu/wordpress/bjoern/software/web/complexity-option-game/