2. Visually Intractable Problems Nathaniel Dean Department of Mathematics Texas State University San Marcos, Texas 78666 USA nd17@txstate.edu Career Options for Underrepresented Groups in Mathematical Sciences, Minneapolis, MN March 27, 2010

3. Models of Human Behavior (social networks, biology, epidemiology) Call Detail Internet Traffic Psychometric Biochemistry Global Terrorism Database Market Baskets A variety of massive data sets can be modeled as “large” mathematical structures. Problem: Extract and catalog interactions to identify “interesting” patterns or collaborative sub-networks.  Interactions between genes, proteins, terrorists, physical contacts, neurons, etc.

4. Mathematical & Computational Modeling Cycle Data from the Real World Math & Computer Models New View of the World Mathematical & Computational Results Verify Explain Interpret Organize Simplify Analyze

5. Mathematics → Super Abilities Ecomonics Biology Puzzles Games Logic Sociology Financial Markets Medicine Computing Linguistics Physics Engineering Disease

6. Graph Model  A graph consists nodes and edges.  The nodes model entities.  The edge set models a binary relationship on the nodes.  Edges may be weighted, reflecting similarities/dissimilarities between nodes.

7. Graph Drawing Find an aesthetic layout of the graph that clearly conveys its structure. Assign a location for each node so that the resulting drawing is “nice”. Example: Protein Interaction Data (file)file V = {1,2,3,4,5,6} E = {(1,2),(2,3),(1,4), (1,5),(3,4),(3,5), (4,5),(4,6),(5,6)} Input (data)Output (drawing)

8. Clustering Reveals the Macro Structure of Data dense sub-graph sparse sub-graph Communities of interest? dense sub-graph

9. a deg( b ) = 4 deg( c ) = 4 deg( f ) = 3deg( g ) = 4 b g f e c d deg( d ) = 1 deg( e ) = 0 Degree of a Vertex = the number of edges incident with it. deg( a ) = 2

10. Countries Regions States Counties Towns Subdivisions Blocks Lots Buildings Hierarchies (geography, families, companies)

11. Work on Large Graphs & Hierarchies Show demo

12. Are some graphs too complicated to understand?

13. The Algebraic School (end of 19 th century) George Boole and others, Algebraic structure of formulas, Boolean algebra The Mathematical School (early 20 th century) The Hilbert program: formalization of all of mathematics with a proof of consistency Godel’s Incompleteness Theorem Any axiomatization that includes arithmetic there is a sentence neither provable nor disprovable. Church-Turing thesis (computability) Defined what it means to compute. A Brief History of Logic

14. Forms of Intractability PSPACE, NP-hardness Computability Undecidability Incompleteness PSPACE, NP-hardness Computability Undecidability Incompleteness Incomprehensibility

15. Ulam’s Lattice Point Conjecture In any partition of the integer lattice points into uniformly bounded sets there exists a set that is adjacent to at least six other sets. - Joseph Hammer Unsolved Problems Concerning Lattice Points, 1977

16. Ulam’s Lattice Point Conjecture In any partition of the integer lattice points into uniformly bounded sets there exists a set that is adjacent to at least six other sets. - Joseph Hammer Unsolved Problems Concerning Lattice Points, 1977 Not Adjacent Adjacent

17. Ulam’s Lattice Point Conjecture In any partition of the integer lattice points into uniformly bounded sets there exists a set that is adjacent to at least six other sets. - Joseph Hammer Unsolved Problems Concerning Lattice Points, 1977 Not Uniformly Bounded

18. Ulam’s Lattice Point Conjecture In any partition of the integer lattice points into uniformly bounded sets there exists a set that is adjacent to at least six other sets. - Joseph Hammer Unsolved Problems Concerning Lattice Points, 1977

19. Homomorphism If xy  E(G), then f(x)f(y)  E(H) or f(x) = f(y) and If ab  E(H), then there exists x,y  V(G) such that f(x) = a, f(y) = b, and xy  E(G). A surjective map f: V(G)  V(H) of G onto H where

20. Homomorphism f: V(G)  V(H)

22. Homomorphism f 2 : V(G)  V(H)

23. A homomorph H of G is a uniformly bounded homomorph if for some integer m every vertex x of H satisfies Ulam number u(G) = min {  (H): H is a uniformly bounded homomorph of G}. u(G)   (G). H is a homomorph of G  u(H)  u(G). F  G  u(F)  u(G).

24. An infinite tree which is locally finite must contain an infinite path. Konig’s Infinity Lemma Hierarchical Structure

25.   Konig’s Infinity Lemma Proof Idea: Since there are finitely many branches, at least one of them must have an infinite subtree Go in that direction.

26.    Konig’s Infinity Lemma Proof Idea: Find an infinite branch of the tree. Go in that direction.

27.     Proof Idea: Find an infinite branch of the tree. Go in that direction. Konig’s Infinity Lemma

28.      Proof Idea: Find an infinite branch of the tree. Go in that direction. Konig’s Infinity Lemma

29. Proof Idea: Find an infinite branch of the tree. Go in that direction.      

30. Konig: An infinite tree which is locally finite contains an infinite path. Corollary: Every finite homomorph of contains as a subgraph. Corollary:

31. If G has a good drawing in a strip, then u(G)  2. Shrinking each cell to a vertex yields a homomorph isomorphic to a collection of paths.

32. If G has a good drawing in the plane, then u(G)  6. Shrinking each cell to a vertex yields a homomorph isomorphic to a subgraph of the triangular grid.

33. (not a good drawing ) u(G)  3  every drawing of G in any strip [0,N] x R is incomprehensible. u(G)  7  every drawing of G in the plane is incomprehensible.  d   + such that, for any integer N, there is a region of diameter ≤ d containing ≥ N vertices OR Edges are arbitrarily long. G has no good drawing ≡ G is incomprehensible.

34. Open Problems Mathematics → Super Abilities Disease Health Care Family Hunger Politics War Violence Medicine Poverty Emotions Survival Disease Love Happiness Feelings Success