Return to Video

Margot Gerritsen on "Linear Algebra - the incredible beauty of math"

  • 0:01 - 0:04
    It's actually delightful to be here
  • 0:04 - 0:07
    So thanks to for inviting me.
  • 0:07 - 0:11
    I am a mathematician. And you may not
  • 0:11 - 0:13
    associate mathematicians with people that
  • 0:13 - 0:14
    love art.
  • 0:14 - 0:16
    But I happen to think that mathematics is
  • 0:16 - 0:17
    the most beautiful thing on earth.
  • 0:17 - 0:19
    And I want to convince you today that
  • 0:19 - 0:21
    that's the case.
  • 0:21 - 0:22
    Now we're going to use a few tricks.
  • 0:22 - 0:24
    So we're not just going to stare at
  • 0:24 - 0:26
    equations. I get really a wonderful
  • 0:26 - 0:29
    feeling inside of me when I stare at a
  • 0:29 - 0:32
    system of equations. But I'm not expecting
  • 0:32 - 0:33
    you to have that same sort of feeling.
  • 0:33 - 0:35
    So what I'd like to do is provide some
  • 0:35 - 0:37
    color and some illustrations of the
  • 0:37 - 0:43
    systems of equations.
  • 0:43 - 0:45
    Now, matrices what are matrices, you know?
  • 0:45 - 0:48
    Why, as a mathematician, do I love them so
  • 0:48 - 0:50
    much? Well, let me just give you a little
  • 0:50 - 0:52
    bit of a feel of the sort of problems I
  • 0:52 - 0:54
    work on. I'm a computational mathematician
  • 0:54 - 0:58
    And I really like things to do with fluid
  • 0:58 - 1:01
    flow. So you give me a fluid, I like to
  • 1:01 - 1:04
    simulate it. So I've done work on
  • 1:04 - 1:05
    coastal ocean flows
  • 1:05 - 1:06
    I've done work on oil and gas flows
  • 1:06 - 1:11
    I've designed sails for the American cup
  • 1:11 - 1:13
    For those of you who know about America's
  • 1:13 - 1:15
    cup Right now. Not for this particular
  • 1:15 - 1:17
    race but in 2000 and 2003
  • 1:17 - 1:19
    but in all of these things are eminent
  • 1:19 - 1:22
    flow I'd like to simulate it.
  • 1:22 - 1:23
    and to simulate this
  • 1:23 - 1:27
    we set up a really large system of
  • 1:27 - 1:29
    equations relating pressures at all
  • 1:29 - 1:31
    sort of different points in the flow
  • 1:31 - 1:33
    fields and velocities
  • 1:33 - 1:35
    and we need to solve it
  • 1:35 - 1:36
    and ultimately the system of equations
  • 1:36 - 1:38
    leads to something called a matrix.
  • 1:38 - 1:39
    I'll show you an example.
  • 1:39 - 1:42
    But also, because I like matrices so much
  • 1:42 - 1:43
    In these matrix equations
  • 1:43 - 1:44
    I can use that same
  • 1:44 - 1:47
    knowledge to help with example
  • 1:47 - 1:49
    of the design of a search engine.
  • 1:49 - 1:51
    Or a recommender system.
  • 1:51 - 1:53
    And that may sound really funny to you,
  • 1:53 - 1:54
    but it's exactly the same math
  • 1:54 - 1:56
    behind it.
  • 1:56 - 1:58
    And the math behind it,
  • 1:58 - 1:59
    is this matrix stuff.
  • 1:59 - 2:01
    Now for some of you,
  • 2:01 - 2:03
    matrices may actually have to do
  • 2:03 - 2:04
    with something like this.
  • 2:04 - 2:07
    Do you recognize that made with
  • 2:07 - 2:08
    the movie the matrix
  • 2:08 - 2:10
    which I happen to love.
  • 2:10 - 2:12
    But has nothing to do with my field.
  • 2:12 - 2:14
    But if you type in matrices
  • 2:14 - 2:16
    or you type in matrices for
  • 2:16 - 2:17
    engineering applications
  • 2:17 - 2:19
    in Google, you get millions and millions
  • 2:19 - 2:20
    and millions of hits.
  • 2:20 - 2:22
    And you can see lots of different
  • 2:22 - 2:24
    applications, which some how use this
  • 2:24 - 2:26
    This is just a snap shot
  • 2:26 - 2:27
    of the images
  • 2:27 - 2:28
    the first place of images you see
  • 2:28 - 2:30
    when you type in matrices.
  • 2:30 - 2:33
  • 2:33 - 2:35
    And when you go look at this,
  • 2:35 - 2:35
    you see matrices come up in
  • 2:35 - 2:36
    flow mechanics
  • 2:36 - 2:39
    but also in structural mechanics
  • 2:39 - 2:42
    you see it come up in social networks
  • 2:42 - 2:42
    you see it come up in neurology,
  • 2:42 - 2:44
    biology, so many different application areas
  • 2:46 - 2:46
    use this matrices.
  • 2:46 - 2:47
    And so, officialization of them is nice
  • 2:47 - 2:53
    also because sometimes, when we stare
  • 2:53 - 2:56
    at a big matrix
  • 2:56 - 2:58
    which is just a table with numbers,
  • 2:58 - 3:00
    it's very hard to discern patterns
  • 3:00 - 3:02
    But sometimes when you start visualizing
  • 3:02 - 3:03
    them,
  • 3:03 - 3:05
    you can get a deeper understanding,
  • 3:05 - 3:07
    also of the underlying math
  • 3:07 - 3:08
    and the underlying physics.
  • 3:08 - 3:13
    So, let's start with a little bit of
  • 3:13 - 3:14
    algebra.
  • 3:14 - 3:18
    So say, I have four unknowns, that I want
  • 3:18 - 3:20
    to compute. So this brings
  • 3:20 - 3:21
    you back to, maybe, high school algebra
  • 3:21 - 3:24
    If I have four unknowns I want to
  • 3:24 - 3:25
    compute,
  • 3:25 - 3:26
    in this case they're called
  • 3:26 - 3:27
    W, X, Y and Z
  • 3:27 - 3:29
    We always use these sort of variables
  • 3:29 - 3:31
    because mathematicians aren't
  • 3:31 - 3:32
    that creative
  • 3:32 - 3:33
    alright, so we use things like
  • 3:33 - 3:33
    X1, X2, X3
  • 3:33 - 3:35
    and so on, right?
  • 3:35 - 3:38
    And so if I want to solve for
  • 3:38 - 3:39
    four unknowns,
  • 3:39 - 3:40
    I need four constraints.
  • 3:40 - 3:42
    Four equations
  • 3:42 - 3:43
    that tell me how they relate to
  • 3:43 - 3:44
    each other
  • 3:44 - 3:45
    and here I just made up
  • 3:45 - 3:47
    four of those
  • 3:47 - 3:48
    K?
  • 3:48 - 3:49
    Now one of the things that you see,
  • 3:49 - 3:51
    is that there is
  • 3:51 - 3:52
    some empty spots here.
  • 3:52 - 3:55
    And you also see that there is
  • 3:55 - 3:57
    this pattern; W, X, Y Z
  • 3:57 - 3:58
    They are always written in the
  • 3:58 - 3:59
    same pattern.
  • 3:59 - 4:01
    Sometime there is a one in front
  • 4:01 - 4:02
    of it.
  • 4:02 - 4:03
    1 times W, 1 times X
  • 4:03 - 4:04
    and sometimes there is nothing.
  • 4:04 - 4:06
    Which really means there was a zero
  • 4:06 - 4:08
    in front of it, right?
  • 4:08 - 4:09
    But as a mathematician,
  • 4:09 - 4:11
    I look at these, I'm a very organized
  • 4:11 - 4:12
    person
  • 4:12 - 4:14
    So I write all of these things in
  • 4:14 - 4:15
    this particular order.
  • 4:15 - 4:17
    And I see there are four equations, and
  • 4:17 - 4:20
    each equation has a bunch of
  • 4:20 - 4:21
    coefficient corresponding to W.
  • 4:21 - 4:24
    Bunch corresponding to X,
  • 4:24 - 4:25
    to Y, and to Z.
  • 4:25 - 4:27
    And all I really need to remember
  • 4:27 - 4:30
    for the system, is these coefficients.
  • 4:30 - 4:32
    Right? As soon as I fix the order,
  • 4:32 - 4:35
    all I need to remember are these
  • 4:35 - 4:36
    coefficients.
  • 4:36 - 4:38
    So what I'm going to do,
  • 4:38 - 4:39
    is I'm going to re-write this
  • 4:39 - 4:40
    a little bit.
  • 4:40 - 4:41
    And I'm going to create,
  • 4:41 - 4:43
    this table here, which has these
  • 4:43 - 4:45
    coefficients, now I left out
  • 4:45 - 4:46
    the zeros.
  • 4:46 - 4:48
    Now we are also very lazy,
  • 4:48 - 4:49
    mathematicians.
  • 4:49 - 4:51
    Zeros, we never write down.
  • 4:51 - 4:52
    Also, because with these
  • 4:52 - 4:54
    large systems of equations
  • 4:54 - 4:55
    that we have to deal with,
  • 4:55 - 4:56
    say for recommender system
  • 4:56 - 4:58
    or page rank, or search algorithm
  • 4:58 - 5:00
    there are many, many many zeros.
  • 5:00 - 5:00
    So we leave them out.
  • 5:00 - 5:01
    K?
  • 5:01 - 5:03
    But, arguably, all that's really
  • 5:03 - 5:06
    important to me, for this particular
  • 5:06 - 5:07
    system, whatever that represents;
  • 5:07 - 5:10
    maybe it's pressure of velocity
  • 5:10 - 5:12
    relationships in fluid flow,
  • 5:12 - 5:14
    maybe it's a friend networking
  • 5:14 - 5:15
    algorithm. I don't really care.
  • 5:15 - 5:17
    All that's really important
  • 5:17 - 5:19
    is this table with the numbers
  • 5:19 - 5:21
    this table, that we call a matrix
  • 5:21 - 5:24
    K? So that's the matrix.
  • 5:24 - 5:26
    Now
  • 5:26 - 5:28
    sometimes we use very simple
  • 5:28 - 5:30
    visualizations.
  • 5:30 - 5:32
    Mine is called, Spy Plot.
  • 5:32 - 5:34
    And all I do
  • 5:34 - 5:36
    is, you know, I had all these ones
  • 5:36 - 5:39
    and everywhere a one appears
  • 5:39 - 5:41
    I simply put a little dot.
  • 5:41 - 5:42
    K?
  • 5:42 - 5:44
    So in this case I'm not so interested in
  • 5:44 - 5:47
    what size these coefficients are,
  • 5:47 - 5:49
    whether they're one or two or ten
  • 5:49 - 5:50
    or minus two-hundred.
  • 5:50 - 5:51
    I don't really care.
  • 5:51 - 5:53
    I just want to know where there are
  • 5:53 - 5:55
    non-zeros
  • 5:55 - 5:57
    because these non-zeros
  • 5:57 - 5:59
    give me exactly, how these things relate.
  • 5:59 - 6:03
    If i have a non-zero right here, and a non
  • 6:03 - 6:07
    zero there, I know that W and Y are an
  • 6:07 - 6:08
    equation together.
  • 6:08 - 6:11
    And so, the patterns, of these non zeros
  • 6:11 - 6:12
    give me information about the system.
  • 6:12 - 6:14
    Does that make sense?
  • 6:14 - 6:17
    And so the simplest way,
  • 6:17 - 6:19
    because again you know the start
  • 6:19 - 6:20
    is very simple, and not super creative.
  • 6:20 - 6:22
    In the beginning, we just put a little
  • 6:22 - 6:25
    dot. And therefore very large systems
  • 6:25 - 6:27
    of equations we may get things like this.
  • 6:27 - 6:30
    So this is called, "Spy plot."
  • 6:30 - 6:33
    So this is just a matrix, with dots
  • 6:33 - 6:35
    where ever there is a non zero
  • 6:35 - 6:38
    and you see there are patterns,
  • 6:38 - 6:39
    now that I can see.
  • 6:39 - 6:41
    And actually these come from a network
  • 6:41 - 6:44
    a matrix can also represent a network,
  • 6:44 - 6:46
    which we'll see in a little bit.
  • 6:46 - 6:48
    They're Stanford Networks.
  • 6:48 - 6:50
    This is, I think, uh Standford as a whole
  • 6:50 - 6:53
    And this was the Internet.
  • 6:53 - 6:56
    And all the pages in Ero Astro
  • 6:56 - 6:58
    that we crolled in 2004 to create those
  • 6:58 - 6:59
    "Spy plots."
  • 6:59 - 7:02
    And looking at this, I can see
  • 7:02 - 7:03
    because I know a little bit about how
  • 7:03 - 7:04
    these were created,
  • 7:04 - 7:07
    That here are clusters of websites
  • 7:07 - 7:10
    that are correlated very strongly
  • 7:10 - 7:12
    so they keep on referring to each other
  • 7:12 - 7:14
    and internally. And they're not very
  • 7:14 - 7:15
    much connected to this
  • 7:15 - 7:17
    so that's central administration.
  • 7:17 - 7:18
    They only talk to each other.
  • 7:18 - 7:20
    Not so much to others.
  • 7:20 - 7:21
    And they can look at this, and they
  • 7:21 - 7:22
    can discern
  • 7:22 - 7:23
    organizational structures.
  • 7:23 - 7:25
    And it's amazing how you can
  • 7:25 - 7:26
    use these things.
  • 7:26 - 7:26
    Right?
  • 7:26 - 7:29
    And of course, some other equations
  • 7:29 - 7:30
    lead to more interesting patterns.
  • 7:30 - 7:32
    This is a "spy plot"
  • 7:32 - 7:34
    Of a particular
  • 7:34 - 7:36
    equation, or system of equation
  • 7:36 - 7:37
    that looked at an oil resovoir modeling.
  • 7:37 - 7:40
    And when look at these particular
  • 7:40 - 7:41
    patterns, I can say something about
  • 7:41 - 7:45
    the behavior, not that much
  • 7:45 - 7:47
    But it's still, you know, resonably
  • 7:47 - 7:48
    pretty.
  • 7:48 - 7:49
    And then what I could do,
  • 7:49 - 7:52
    if the actual non zeros change in size
  • 7:52 - 7:54
    so some if they're bigger than others
  • 7:54 - 7:56
    I could give them a color,
  • 7:56 - 7:57
    depending on the size.
  • 7:57 - 7:58
    Now we're getting very artsy,
  • 7:58 - 7:59
    for a mathmatician.
  • 7:59 - 8:00
    Which is pretty amazing.
  • 8:00 - 8:04
    And I get things like this.
  • 8:04 - 8:07
    Now there are many more interesting ways
  • 8:07 - 8:08
    to do this though, and this is really
  • 8:08 - 8:10
    what I'd like to show you today.
  • 8:10 - 8:12
    Is to use graphs.
  • 8:12 - 8:14
    So we're going to go back
  • 8:14 - 8:16
    I hope
  • 8:16 - 8:17
    Yep.
  • 8:17 - 8:18
    To this matrix.
  • 8:18 - 8:19
    OK?
  • 8:19 - 8:25
    Now I want you to focus on, ehm, this
  • 8:25 - 8:29
    equation here, this equation had W
  • 8:29 - 8:31
    Plus zero times X
  • 8:31 - 8:33
    X doesn't play a role
  • 8:33 - 8:34
    Plus Y times nothing, times Z
  • 8:34 - 8:36
    Is equal to one.
  • 8:36 - 8:39
    That's really where that came from
  • 8:39 - 8:41
    And from this, I know that there is
  • 8:41 - 8:45
    a connection between W and X.
  • 8:45 - 8:50
    They're in the same equation.
  • 8:50 - 8:51
    Right?
  • 8:51 - 8:52
    W and Y, sorry. W and Y.
  • 8:52 - 8:54
    I thought you said "Why," so I tried to
  • 8:54 - 8:57
    explain it again. (Laughter).
  • 8:57 - 8:58
    Because there is an equation connected.
  • 8:58 - 9:01
    But W and Y.
  • 9:01 - 9:04
    So all I'm going to remember now is
  • 9:04 - 9:05
    that there is that connection.
  • 9:05 - 9:11
    Now W is here in this location and Y
  • 9:11 - 9:14
    is in this location. And this non zero
  • 9:14 - 9:16
    I can see is really connecting
  • 9:16 - 9:17
    those two together.
  • 9:17 - 9:22
    So if I say I have a non zero in the
  • 9:22 - 9:24
    first row and the third column,
  • 9:24 - 9:28
    I know that W and Y are connected.
  • 9:28 - 9:30
    If there is a non zero, say, in the
  • 9:30 - 9:31
    second row and the fourth column
  • 9:31 - 9:34
    I know that X and Z are connected.
  • 9:34 - 9:36
    And that's what I am going to do.
  • 9:36 - 9:41
    So I am just looking at these non zeros
  • 9:41 - 9:44
    You know, these ones off of the diagonal
  • 9:44 - 9:47
    The one that's saying W is connected
  • 9:47 - 9:48
    To itself, but this one
  • 9:48 - 9:50
    signifies a connection between W and Y
  • 9:50 - 9:52
    This one between X and Y
  • 9:52 - 9:56
    And so when I look at those non zeros
  • 9:56 - 9:59
    I could also write it like this like a
  • 9:59 - 10:00
    little graph.
  • 10:00 - 10:03
    Now I see one and three are connected.
  • 10:03 - 10:05
    The first element, and the third element,
  • 10:05 - 10:07
    That is the W and the Y.
  • 10:07 - 10:11
    Now I measure W, X, Y and Z.
  • 10:11 - 10:12
    One, two, three, four.
  • 10:12 - 10:14
    And so one and three are connected,
  • 10:14 - 10:16
    there is another equation that connects
  • 10:16 - 10:18
    Two with three, and there is an equation
  • 10:18 - 10:20
    that connects two and four.
  • 10:20 - 10:21
    And there is an equation that connects
  • 10:21 - 10:22
    three and four.
  • 10:22 - 10:24
    These are the connections that I have
  • 10:24 - 10:25
    between these unknowns.
  • 10:25 - 10:27
    Now I made it very abstract, right?
  • 10:27 - 10:29
    Because I had this system of equations
  • 10:29 - 10:31
    that told me exactly what these equations
  • 10:31 - 10:33
    were. And I'm just removing that
  • 10:33 - 10:35
    and say, I'm just interested now in
  • 10:35 - 10:37
    connections.
  • 10:37 - 10:38
    What is influenced by what?
  • 10:38 - 10:41
    If W and Y are in an equation together,
  • 10:41 - 10:43
    then the size of one influences
  • 10:43 - 10:44
    the size of the other.
  • 10:44 - 10:46
    That's all I am interested in now.
  • 10:46 - 10:49
    Now vice-versa, if I had a network like
  • 10:49 - 10:52
    this, a connected graph, maybe
  • 10:52 - 10:55
    friends. Friend one is connected to
  • 10:55 - 10:57
    friend three and three is friends with
  • 10:57 - 10:58
    four but four is not friends with one,
  • 10:58 - 11:02
    then I could replace that network
  • 11:02 - 11:04
    with this graph with a matrix.
  • 11:04 - 11:06
    Right? I could go from one to the
  • 11:06 - 11:09
    other. But now I'm going to take these
  • 11:09 - 11:10
    matrices, maybe they come from
  • 11:10 - 11:13
    fluid mechanics. And I have ten million
  • 11:13 - 11:17
    columns this way, and I have 10 million
  • 11:17 - 11:19
    rows this way. This is what we call small
  • 11:19 - 11:20
    simulation.
  • 11:20 - 11:23
    So I have a lot, and I'm going to create
  • 11:23 - 11:25
    a graph out of that. Right?
  • 11:25 - 11:28
    Now when I look at that graph I can see
  • 11:28 - 11:29
    these connections, but of course
  • 11:29 - 11:31
    you immediately say, well I control this
  • 11:31 - 11:32
    in all sorts of different ways.
  • 11:32 - 11:36
    You see the same graphs, just drawn
  • 11:36 - 11:38
    a little differently.
  • 11:38 - 11:39
    And then the question is, well
  • 11:39 - 11:41
    which drawing do you prefer?
  • 11:41 - 11:43
    Which makes it clearest, what the
  • 11:43 - 11:45
    connections are.
  • 11:45 - 11:46
    To you.
  • 11:46 - 11:47
    Just by looking at it, what do you think?
  • 11:47 - 11:50
    This one?
  • 11:50 - 11:51
    (Audience) "That one"
  • 11:51 - 11:53
    Yeah I like this one a lot too.
  • 11:53 - 11:56
    So then, of course, this is just
  • 11:56 - 11:57
    with four, right? I just had four
  • 11:57 - 12:00
    One, two, three and four in connections
  • 12:00 - 12:02
    Now suppose I have 10 million
  • 12:02 - 12:05
    With maybe 50 million in connection total
  • 12:05 - 12:09
    and, and I ask my student, make me
  • 12:09 - 12:12
    a nice looking graph.
  • 12:12 - 12:14
    So they can look at it and maybe
  • 12:14 - 12:16
    discern a little bit of information about
  • 12:16 - 12:17
    fluid flow.
  • 12:17 - 12:17
    Right?
  • 12:17 - 12:19
    So that would be very hard to do, by hand.
  • 12:19 - 12:22
    So if I had something like this.
  • 12:22 - 12:24
    And I say, now give me something
  • 12:24 - 12:27
    that looks very good because now there
  • 12:27 - 12:28
    are all these overlapping connections.
  • 12:28 - 12:31
    So then, it's an interesting thing
  • 12:31 - 12:35
    How do I pull a part this complicated
  • 12:35 - 12:37
    looking graph and make something
  • 12:37 - 12:39
    where structures and connections
  • 12:39 - 12:41
    are much more easy to see.
  • 12:41 - 12:43
    And that's what I want to show you,
  • 12:43 - 12:45
    because we can do this. Now you may say
  • 12:45 - 12:47
    this is a made up example.
  • 12:47 - 12:48
    What has a messy network like this?
  • 12:48 - 12:49
    Well let me just show you.
  • 12:49 - 12:50
    Just one example.
  • 12:50 - 12:51
    Don't just thought off the web.
  • 12:51 - 12:55
    I just looked at work by Allera Hall.
  • 12:55 - 12:57
    And I looked at Saga's from Iceland,
  • 12:57 - 12:59
    and he published this.
  • 12:59 - 13:01
    So these are the connections between
  • 13:01 - 13:03
    various sagas.
  • 13:03 - 13:04
    Obviously this is very messy.
  • 13:04 - 13:06
    And I think he should be using
  • 13:06 - 13:06
    our software.
  • 13:06 - 13:09
    (Audience Laughter)
  • 13:09 - 13:10
    Maybe I should send it to him.
  • 13:10 - 13:12
    So these things happen.
  • 13:12 - 13:13
    So now the question is,
  • 13:13 - 13:16
    if I have a bunch of nodes
  • 13:16 - 13:18
    and I would just place the nodes,
  • 13:18 - 13:19
    one, two, three, four, all the way
  • 13:19 - 13:20
    to 10 million
  • 13:20 - 13:23
    and I have connections between them,
  • 13:23 - 13:25
    how do I figure out how to pull them
  • 13:25 - 13:27
    apart and put them on a two
  • 13:27 - 13:29
    dimensional piece of paper.
  • 13:29 - 13:30
    So that I have a nice view.
  • 13:30 - 13:34
    Okay? So how would you do it?
  • 13:34 - 13:37
    (Audience "grab one and pull?")
  • 13:37 - 13:40
    Somehow you need - no first of all you
  • 13:40 - 13:41
    need two nodes that are really
  • 13:41 - 13:45
    strongly connected to come close
  • 13:45 - 13:47
    Right? So if node one and two are strongly
  • 13:47 - 13:48
    connected, maybe because there was
  • 13:48 - 13:51
    a big non-zero in this matrix then
  • 13:51 - 13:52
    I want them to be close.
  • 13:52 - 13:56
    Right? And if one is connected to two
  • 13:56 - 13:58
    and two to four and four to 17 and
  • 13:58 - 14:01
    17 to 300, I don't want 1 and 300
  • 14:01 - 14:02
    to be too close because there is
  • 14:02 - 14:05
    four degrees of separation.
  • 14:05 - 14:06
    Right? So the question is, how do I do
  • 14:06 - 14:07
    that?
  • 14:07 - 14:15
    So we have these nodes, and
  • 14:15 - 14:17
    we have these lines connecting them.
  • 14:17 - 14:18
    K? Now what we're going to do is
  • 14:18 - 14:21
    two things. Each of these lines will
  • 14:21 - 14:22
    imagine it's a spring.
  • 14:22 - 14:27
    So when we pull things apart,
  • 14:27 - 14:29
    they pull back.
  • 14:29 - 14:31
    Right? And the size of the spring -
  • 14:31 - 14:32
    the strength of the spring, Guess what?
  • 14:32 - 14:35
    That's determined by what?
  • 14:35 - 14:39
    By the strength of that Non-zero.
  • 14:39 - 14:42
    Right? OK, that's nice. But what would
  • 14:42 - 14:43
    happen if I did this?
  • 14:43 - 14:45
    If I had all of these nodes and I
  • 14:45 - 14:47
    put springs on them, and let them go.
  • 14:47 - 14:51
    What would happen if I didn't do anything
  • 14:51 - 14:52
    else?
  • 14:52 - 14:54
    Would they (shooo)? All get together?
  • 14:54 - 14:56
    I don't want that either.
  • 14:56 - 14:57
    I don't want them all to cluster,
  • 14:57 - 14:59
    so they're not allowed to get too close.
  • 14:59 - 15:02
    So how can I make things - I need some
  • 15:02 - 15:04
    kind of repelling force. So when they get
  • 15:04 - 15:06
    too close, they're not allowed to.
  • 15:06 - 15:07
    So what do I do?
  • 15:07 - 15:10
    I give every node an electric charge.
  • 15:10 - 15:15
    So that they repel each other.
  • 15:15 - 15:17
    K? So now I have a whole network of
  • 15:17 - 15:19
    balls attached to springs,
  • 15:19 - 15:21
    the springs have stiffness, the balls
  • 15:21 - 15:23
    have an electric charge.
  • 15:23 - 15:25
    And I let the whole thing drop on the
  • 15:25 - 15:26
    floor.
  • 15:26 - 15:32
    Because I want it two dimensional, right?
  • 15:32 - 15:35
    And I let this thing organize itself.
  • 15:35 - 15:38
    So it comes to an equilibrium shape.
  • 15:38 - 15:40
    That's always minimizing some sort of
  • 15:40 - 15:40
    energy.
  • 15:40 - 15:41
    Right?
  • 15:41 - 15:43
    It's beautiful, these systems do this
  • 15:43 - 15:44
    automatically.
  • 15:44 - 15:46
    And I just let them organize themselves.
  • 15:46 - 15:48
    So it would look something like this.
  • 15:48 - 15:50
    We start with this,
  • 15:50 - 15:52
    we let it drop,
  • 15:52 - 15:54
    and now it becomes this.
  • 15:54 - 15:57
    So it's exactly that same configuration.
  • 15:57 - 16:00
    Now here we've cheated a little,
  • 16:00 - 16:04
    how big you make that electric charge
  • 16:04 - 16:07
    and how big you make the strength of
  • 16:07 - 16:09
    the springs.
  • 16:09 - 16:11
    That determines what stuff you get out.
  • 16:11 - 16:14
    So afterward, we need a lot of changing
  • 16:14 - 16:16
    to make it look beautiful.
  • 16:16 - 16:17
    K so this looks really easy.
  • 16:17 - 16:19
    But some of the pictures I'm going to
  • 16:19 - 16:21
    show you took a long, long time to create.
  • 16:21 - 16:23
    Because there was a lot of
  • 16:23 - 16:23
    twiggling. Put a little
  • 16:23 - 16:25
    bit more spring strength here.
  • 16:25 - 16:26
    And more repulsive charge there.
  • 16:26 - 16:30
    But when you look at this it's beautiful
  • 16:30 - 16:33
    structure. And it shows you very naturally
  • 16:33 - 16:36
    these clusters and when you stare at
  • 16:36 - 16:37
    these structures
  • 16:37 - 16:38
    you can really get some information
  • 16:38 - 16:39
    about the underlying system.
  • 16:39 - 16:41
    No matter where this comes from.
  • 16:41 - 16:44
    Now let me show you some
  • 16:44 - 16:46
    really beautiful examples.
  • 16:46 - 16:50
    In much larger systems than this.
  • 16:50 - 16:52
    This is a financial portfolio
  • 16:52 - 16:53
    optimization.
  • 16:53 - 16:56
    So this is one of the matrices you
  • 16:56 - 16:59
    would have come up in one of the
  • 16:59 - 17:00
    simulations or computer programs you
  • 17:00 - 17:02
    would have in financial portfolio
  • 17:02 - 17:03
    optimizations. This looks much better
  • 17:03 - 17:06
    than what you would imagine. From the
  • 17:06 - 17:08
    2008 problems.
  • 17:08 - 17:09
    Right?
  • 17:09 - 17:13
    How did we know that this was behind it.
  • 17:13 - 17:17
    This one, is another type of program
  • 17:17 - 17:19
    that we often have in optimization.
  • 17:19 - 17:20
    Called "prodredic(sp?)" programming.
  • 17:20 - 17:22
    It's the matrix from one of those
  • 17:22 - 17:24
    simulations, here is the close up.
  • 17:24 - 17:26
    So they're very intricate things.
  • 17:26 - 17:27
    These are just two dimensional
  • 17:27 - 17:30
    patterns. But of course, it looks a little
  • 17:30 - 17:32
    bit three dimensional.
  • 17:32 - 17:33
    You can also do these things in 3D
  • 17:33 - 17:35
    but it is much harder to vision.
  • 17:35 - 17:39
    This one, is from electrical engineering
  • 17:39 - 17:41
    It's a circuit simulation.
  • 17:41 - 17:46
    So we also call this the porcupine.
  • 17:46 - 17:48
    And this is a close up
  • 17:48 - 17:50
    It's not a super high resolution image,
  • 17:50 - 17:52
    but it gives you an idea.
  • 17:52 - 17:55
    This is another linear programming problem
  • 17:55 - 17:57
    That comes from some sort of optimization
  • 17:57 - 18:00
    problem. And I forgot which one this is.
  • 18:00 - 18:03
    And this color is often the strength of
  • 18:03 - 18:07
    connection. You can also use it in also
  • 18:07 - 18:08
    different ways.
  • 18:08 - 18:10
    And my friend, Tim, who created this,
  • 18:10 - 18:13
    uses colors so the pictures look really
  • 18:13 - 18:17
    nice. (audience laughter).
  • 18:17 - 18:18
    So we can play with these colors because
  • 18:18 - 18:19
    there is lots of different ways to color
  • 18:19 - 18:20
    this.
  • 18:20 - 18:21
    I have to admit, this is pretty nice.
  • 18:21 - 18:22
    I'll show you some others.
  • 18:22 - 18:29
    This one, is part of my field, it's
  • 18:29 - 18:38
    a matrix of an ocean, of shallow water.
  • 18:38 - 18:40
    So where the depth of the water is much
  • 18:40 - 18:42
    less than the width of the area.
  • 18:42 - 18:45
    Now, this doesn't nearly look as nice.
  • 18:45 - 18:46
    But the matrix that comes out
  • 18:46 - 18:50
    is very unstructured, but still,
  • 18:50 - 18:53
    it almost has the same feel to it as
  • 18:53 - 18:57
    water. That's of course why we made it
  • 18:57 - 18:59
    green and blue.
  • 18:59 - 19:02
    Now this is a close-up.
  • 19:02 - 19:05
    This one is another linear programming
  • 19:05 - 19:08
    problem. It's my favorite. It has quite
  • 19:08 - 19:10
    beautiful structures.
  • 19:10 - 19:13
    And this one is actually a social network
  • 19:13 - 19:17
    Which we have labeled, the poppy.
  • 19:17 - 19:25
    And here, where you see poppies
  • 19:25 - 19:28
    of flowers, they're really clusters
  • 19:28 - 19:29
    of friends.
  • 19:29 - 19:32
    They are strongly connected friend
  • 19:32 - 19:34
    networks, within this large social
  • 19:34 - 19:37
    network. So you can have a lot of fun
  • 19:37 - 19:43
    with this. Right?
  • 19:43 - 19:46
    We played with something else as well.
  • 19:46 - 19:50
    And I brought a poster.
  • 19:50 - 19:58
    Because Allison was going to show her
  • 19:58 - 19:59
    beautiful work, so I wanted to show
  • 19:59 - 20:02
    that we also do nice things.
  • 20:02 - 20:06
    Here is my artwork.
  • 20:06 - 20:12
    Sometimes I ask people, what are they
  • 20:12 - 20:14
    looking at, and they say I'm looking at
  • 20:14 - 20:17
    some sort of network or graph. But
  • 20:17 - 20:20
    this is the LCSH.
  • 20:20 - 20:25
    Library of Congress Subject headers.
  • 20:25 - 20:27
    So this is the library system that we use
  • 20:27 - 20:29
    in almost all libraries of the world
  • 20:29 - 20:32
    And what you are looking at are
  • 20:32 - 20:37
    library main categories, and their sub
  • 20:37 - 20:38
    categories, and how everything
  • 20:38 - 20:41
    is linked together.
  • 20:41 - 20:46
    Now the LCSH asked us in 2005, me
  • 20:46 - 20:48
    and a group of my students, to help
  • 20:48 - 20:50
    them understand the structure.
  • 20:50 - 20:54
    So here are cataloggers who have
  • 20:54 - 20:57
    worked on this categorizing
  • 20:57 - 21:01
    for decades. But they have never seen it,
  • 21:01 - 21:12
    they just put it the data. So we
  • 21:12 - 21:15
    used exactly the same kind of program
  • 21:15 - 21:20
    that you just saw. We call it the galaxy.
  • 21:20 - 21:26
    I will make sure they get the link
  • 21:26 - 21:28
    so they can play with it. You
  • 21:28 - 21:30
    can go in and zoom in and click on
  • 21:30 - 21:32
    the node and it will jump up
  • 21:32 - 21:34
    and show connected notes, and this
  • 21:34 - 21:37
    is a way to browse. What is also really
  • 21:37 - 21:40
    funny here, is you see this whole mess
  • 21:40 - 21:43
    in the middle, because it is very strongly
  • 21:43 - 21:51
    interconnected stuff, we but in words
  • 21:51 - 21:58
    where the connections were strongest
  • 21:58 - 22:03
    But the library also used it to find
  • 22:03 - 22:07
    lazy cataloggers. Because look at this,
  • 22:07 - 22:10
    we call this a Supernova. This is
  • 22:10 - 22:14
    Japanese Antiquites. And it has one main
  • 22:14 - 22:17
    category, and a whole bunch of sub
  • 22:17 - 22:20
    categories. But the catalogger did
  • 22:20 - 22:21
    not interconnect the sub-catagories.
  • 22:21 - 22:23
    So we have Japanese Antiquities,
  • 22:23 - 22:26
    and 140 things attached to it,
  • 22:26 - 22:29
    but how they related, he or she did
  • 22:29 - 22:30
    not relate it. So the library can look
  • 22:30 - 22:34
    at it and say, we really should do
  • 22:34 - 22:36
    something about this. Because the more
  • 22:36 - 22:39
    messy it looks, the better it is for
  • 22:39 - 22:41
    browsing purposes. But we just
  • 22:45 - 22:48
    thought it was a beautiful picture.
  • 22:48 - 22:50
    This took a long, long time to create,
  • 22:50 - 22:52
    we had to think about the colors,
  • 22:52 - 22:59
    and how the nodes.
  • 22:59 - 23:00
    And now we are looking at ways
  • 23:00 - 23:02
    to put this in 3D, so you can
  • 23:02 - 23:03
    truly fly through the galaxy.
  • 23:03 - 23:05
    And you can do the same with
  • 23:05 - 23:08
    Wikipedia, and other networks that you
  • 23:08 - 23:13
    have. You can say let's go on a flight
  • 23:13 - 23:16
    through my social network.
  • 23:16 - 23:18
    And you can see who is stronger connected
  • 23:18 - 23:21
    than you are. Anyway it is a lot of fun
  • 23:21 - 23:23
    to play with. So I'll make sure you have
  • 23:23 - 23:24
    this link, and I'll take any questions you
  • 23:24 - 23:27
    may have.
Title:
Margot Gerritsen on "Linear Algebra - the incredible beauty of math"
Description:

more » « less
Video Language:
English
Team:
Captions Requested
Duration:
23:30

English subtitles

Revisions Compare revisions