@Abmaj7add2 In this perspective, look at the matrix by rows, every row corresponds to an edge. And the first three rows, if see it in the graph, make a loop.
I thought this was an excellent lecture - lectures10 and 11 were a real struggle to get through but this really cleared up a lot of the terminology and why the four fundamental subspaces are so important. Thumbs up Professor Strang.
(Weird ironing creases on his blue shirt in the vicinity of his right nipple.)
I think in the example talks about electric Networks, so LOOP is correct. In fact OPEN LOOP and CLOSED LOOP is used frecuently in electric Networks or in Control Systems to study things that Stability,etc.
Cycle is used in the time domain to know the frecuency and in fact, the frecuency is measured in CYCLES/SEG or Hz.
He does not talk about electric networks in his example. He talks about graphs. Therefore he is using the terminology of graph theory.
In graph theory the term "loop" refers to the edge that connects a vertex to itself. The term that refers to the fact that there is a path with the same starting and ending node is "cycle".
Whoever gave me the thumbs down is a fucking idiot.
Why do you care about my degree? Because you think that a person needs a special degree to figure out that this professor is talking about graphs? All that's needed is a basic understanding of discrete structures.
This guy talks about graph properties, then he describes trees as graphs without loops. This is WRONG. Trees are defined as connected graphs without CYCLES. Pure and simple.
FYI, I have two degrees that I'm about to finish - Mathematics and Computer Science from Stanford.
@tbarker5252 So you are saying is that the graph with no loops he drew at about 38:00 is not a tree? He didn't give any definition, he said "A tree is the name for a graph with no loops" meaning that a graph with no loops is a tree, which is absolutely correct, no matter how you look at it! You certainly don't need any degrees to see that ;)
I am very happy to see the vidoe from you, hopefully the others also are happy for You Graphs, Networks, Incidence Matrices
NganaJHone 2 weeks ago
Steady I Really Like This Video Graphs, Networks, Incidence Matrices.
Ondelendo 2 weeks ago
Good, I like that you share this video Graphs, Networks, Incidence Matrices., I wish success always
bebeheuy 2 weeks ago
Nice Video That You Share , So Very Nice Thanks You Graphs, Networks, Incidence Matrices.
willamricard 2 weeks ago
Comment removed
willamricard 2 weeks ago
I Really Like The Video Graphs, Networks, Incidence Matrices From Your
imegatrone 2 weeks ago
Your Video Graphs, Networks, Incidence Matrices Is Very Useful Sharing
bundawartini 2 weeks ago
after i watched this video Graphs, Networks, Incidence Matrices, my insight is very open because the video is very good to give information
anakmudajaman 2 weeks ago 3
so ich wiege 300 kilo
TempleEvieyc484 1 month ago
J'aimerai bien avoir la traduction en français pleaaaase :(:(
popoalorki 1 month ago in playlist cours algebre
He teaches the lesson very well! Clap, clap, clap, clap!
agapitoflores001 2 months ago
thanks professor gilbert
akhil089 3 months ago in playlist b.linear algebra
Comment removed
CasperBHansen 5 months ago
7:55
i cant see why the subgraph is a loop. could anybody tell me, please ?
Abmaj7add2 7 months ago
@Abmaj7add2 In this perspective, look at the matrix by rows, every row corresponds to an edge. And the first three rows, if see it in the graph, make a loop.
jimmylovesyouall 6 months ago
If only I had seen this video before my third uni maths assignment T_T
HighGuy512 7 months ago in playlist MIT 18.06 Linear Algebra, Spring 2005
this lecture is not important..
pedroissler 8 months ago
I always try to skim through to see if there are any useless parts before I start. Lucky me, still haven't found anything.
pedroissler 8 months ago in playlist MIT 18.06 Linear Algebra, Spring 2005
I thought this was an excellent lecture - lectures10 and 11 were a real struggle to get through but this really cleared up a lot of the terminology and why the four fundamental subspaces are so important. Thumbs up Professor Strang.
(Weird ironing creases on his blue shirt in the vicinity of his right nipple.)
sendaitohoku 10 months ago 2
MATH
valanzo7 1 year ago
he loves the heart shaped tie!
kelfitore 1 year ago 2
Hi tbarker5252,
Do you think that the word cycle and loop are different?
And this discussion contribute with some development ... I dont think so.
abelgui 2 years ago
He made a mistake in this video by using the word "loop". The correct term for what he was talking about is "cycle".
For example, trees are graphs that have no cycles.
tbarker5252 2 years ago
Hi:
I think in the example talks about electric Networks, so LOOP is correct. In fact OPEN LOOP and CLOSED LOOP is used frecuently in electric Networks or in Control Systems to study things that Stability,etc.
Cycle is used in the time domain to know the frecuency and in fact, the frecuency is measured in CYCLES/SEG or Hz.
aitorsierra 2 years ago 4
He does not talk about electric networks in his example. He talks about graphs. Therefore he is using the terminology of graph theory.
In graph theory the term "loop" refers to the edge that connects a vertex to itself. The term that refers to the fact that there is a path with the same starting and ending node is "cycle".
Whoever gave me the thumbs down is a fucking idiot.
tbarker5252 2 years ago
This comment has received too many negative votes show
Hi:
Only one thing, What´s your degree?
aitorsierra 2 years ago
Why do you care about my degree? Because you think that a person needs a special degree to figure out that this professor is talking about graphs? All that's needed is a basic understanding of discrete structures.
This guy talks about graph properties, then he describes trees as graphs without loops. This is WRONG. Trees are defined as connected graphs without CYCLES. Pure and simple.
FYI, I have two degrees that I'm about to finish - Mathematics and Computer Science from Stanford.
tbarker5252 2 years ago
@tbarker5252 So you are saying is that the graph with no loops he drew at about 38:00 is not a tree? He didn't give any definition, he said "A tree is the name for a graph with no loops" meaning that a graph with no loops is a tree, which is absolutely correct, no matter how you look at it! You certainly don't need any degrees to see that ;)
bboysil 1 year ago
Lol "we see Euler again, that guy never stopped."
Mathematics215 2 years ago 3
22:06 great moment in linear algebra
sikory 2 years ago 18