A simplicial (d-1)-dimensional complex K is called 'balanced' if the graph of K is d-colorable. Rather surprisingly, it turns out that many well-known face enumeration results have natural balanced analogs (or at least conjectural analogs). Specifically, we will discuss the balanced analog of the celebrated Lower Bound Theorem (together with the...
Creator:
Novik, Isabella (University of Washington)
Created:
2014-11-13
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.
Consider a Brownian particle in a deterministic time-independent incompressible flow in a bounded domain. We are interested how flow affects the expected exit time, the time the particle needs to reach the boundary of the domain. In particular, whether the presence of the flow decreases the maximum of this expected exit time. One would expect th...
Creator:
Novikov, Alexei (The Pennsylvania State University)
Created:
2010-04-12
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.
During his upcoming Public Lecture, evolutionary biologist Martin Nowak, author of the best-selling book SuperCooperators, will share his cutting-edge research on the mysteries of cooperation. According to Nowak, many problems that challenge us today can be traced back to a tension between what is good and desirable for society as a whole and wh...
Creator:
Nowak, Martin Andreas (Harvard University)
Created:
2013-10-08
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.
Sensor networking is an emerging technology that promises anunprecedented ability to monitor the physical world via a spatiallydistributed network of small and inexpensive wireless sensor nodes.The nodes can measure the physical environment with a wide variety ofsensors, including acoustic, seismic, thermal, and infrared. While thepractically un...
Creator:
Nowak, Robert
Created:
2005-11-10
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.
Clustering and ranking is often based on pairwise similarities (metric data) or comparisons (ordinal data). Most methods assume that the entire collection of all possible pairwise similarities or comparisons are known, but in high-dimensional settings there may be missing data and/or the costs of collecting this information may be prohibitive. T...
Creator:
Nowak, Robert (University of Wisconsin, Madison)
Created:
2011-09-26
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.
Adaptive sampling, also called 'Active Learning', uses informationgleaned from previous measurements (e.g., feedback) to guide and focusthe sampling process. Theoretical and experimental results have shownthat adaptive sampling can dramatically outperform conventionalnon-adaptive sampling schemes. I will review some of the mostencouraging theore...
Creator:
Nowak, Robert (University of Wisconsin, Madison)
Created:
2005-12-08
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.
Ordinal embedding, also known as non-metric multidimensional scaling, aims to represent items as points in d-dimensional Euclidean space so that the distances between points agree as well as possible with a given set of ordinal comparisons such as item i is closer to item j than to item k. This classic problem is often used to visualize perceptu...
Creator:
Nowak, Robert (University of Wisconsin, Madison)
Created:
2016-05-19
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.