{"id":449,"date":"2007-06-22T15:11:27","date_gmt":"2007-06-22T15:11:27","guid":{"rendered":"http:\/\/scientopia.org\/blogs\/goodmath\/2007\/06\/22\/pz-has-a-question-is-george-gilder-wrong-about-network-theory\/"},"modified":"2007-06-22T15:11:27","modified_gmt":"2007-06-22T15:11:27","slug":"pz-has-a-question-is-george-gilder-wrong-about-network-theory","status":"publish","type":"post","link":"http:\/\/www.goodmath.org\/blog\/2007\/06\/22\/pz-has-a-question-is-george-gilder-wrong-about-network-theory\/","title":{"rendered":"PZ Has a Question: Is George Gilder Wrong About Network Theory?"},"content":{"rendered":"

PZ wrote about the latest nonsense from IDiot George Gilder. In this interview<\/a>, Gilder tries to make some really horrible arguments about how everything is really hierarchical, and he uses “information theory, computer science, and network theory” as examples.<\/p>\n

\nI believe that the universe is hierarchical, with creation at the top – the idea that there’s a creator and that we, at our best, act in his image. This top-down model is what all of my work has in common. I sensed that the basic flaw and failure of feminism was its gradient toward pure animal passion with no procreative purpose. In economics, I believed that it was the supply that created the demand. In my examination of computers and telecom, and subsequently biology, I saw the same thing. That’s really how I came into the intelligent design movement – through the recognition of this same structure that I’d previously examined in sexuality and economics, information theory, computer science and network theory.\n<\/p><\/blockquote>\n

PZ does a great job of tearing him down, but also asks<\/a>:<\/p>\n

\nComputer science and network theory: Gilder knows nothing about either, and has no training in the subjects. I suspect there are readers who know far more about the subject than Gilder: is network theory all about setting up strict hierarchies of top-down control?\n<\/p><\/blockquote>\n

And hey golly, that’s right smack dab in my area.
\nNetwork theory is seriously nifty stuff. It’s a sub-area of graph theory, which is one
\nof my favorite areas of computer science. And the short answer to PZs question is: “Hell no: in fact, if that *were* the case, it wouldn’t be an interesting subject at all. What makes it so interesting and difficult is precisely the fact that things aren’t hierarchical”.<\/p>\n


\nThe longer version needs a bit of background – because the terms “graph” and “network” don’t mean what many people expect them to.
\n\"example-network.jpg\"
\nMost people hear the word “graph”, and think of one of those wiggly-line like a stock-price-over-time graph. In computer science, we mean something very different. A graph
\nis a collection of objects (*nodes*), which are connected to one another by *edges*. There are two different types of graphs, depending on whether edges are symmetric or not. If the edges are symmetric (meaning that they don’t distinguish between an edge from A to B and an edge from B to A), the graph is called an *undirected* graph; if edges distinguish their source from their target, then it’s a *directed* graph. Graphs *can* also associate a
\nnumeric value with an edge, in which case they’re called *weighted* graphs. For example, the thing over to the right is a simple directed weighted graph.
\nGraphs can be used for a *lot* of different things; I’m planning on spending at least several months writing about graph theory somewhere down the line. But in the case of
\nnetwork theory, graphs are used to describe complex relationships between collections of objects. For example:
\n* Social networks: the objects are people; the edges connect people if they know
\neach other. Social network graphs are undirected, and generally, unweighted. (They
\n*could* be weighted with a number indicating the strength of the social bond between
\nthe individuals, but in general, social networks don’t really do that.)
\n* Computer networks: the objects are computers; the edges are communication links
\nbetween the computers. Computer networks are generally weighted (to represent the
\nbandwidth of the connection), and directed (because many network connections have
\ndifferent bandwidths in different directions – my home broadband connection is,
\nI think, has about 8 times the bandwidth from their router to my computer as
\nthe bandwidth from my compute to their router).
\n* Economic networks: edges are entities that participate in economic activities – people, companies, etc. Edges represent relationships between them: a factory has edges
\n*from* the sources of its materials, and *to* the entities that use the things it
\nproduces.
\n* Gene regulation networks: these are, fascinatingly, very similar to economic
\nnetworks. The objects are genes, specific proteins and related
\nbiochemical complexes. The edges are directed, and basically represent input\/output
\nrelationships: the source of an edge represents the production of that chemical;
\nthe target of it represents something which will use it. A gene typically has
\ninputs like transcription factors, and outputs are edges to the proteins produced
\nby the gene.
\nThe idea of network theory is that all of these kinds of things consist of graphs representing relationships, and that the relationship graphs represent a kind of common structure that allows you to study them. The reason that you need something like network theory is precisely because these things *don’t* generally have a simple hierarchical
\nstructure that you can use. They tend to be large, complex, decentralized networks, with
\nno single point of control (or even a small set of points of control). To understand
\nthem, you need to study the properties of the structures. And that’s what network
\ntheory is most fundamentally about: understanding the meaning of the structure of
\ncomplex networks in ways that allow you to understand or plan activity within that
\nnetwork.
\nThe ways of understanding networks involve a wide range of techniques – including simulating activity within the network using process calculi; simulating constraints
\nusing something called petri-nets; finding interesting substructures (like things called
\ncliques); identifying non-obvious single points of failure; predicting activity levels
\nby constraint propagation; and several hundred other fascinating things.
\nThe point of all of this, though, is to answer PZs question. And I hope this makes
\nclear that the answer is a giant and resounding **NO**. Network theory is *not*
\nabout setting up hierarchical structure. As usual, Gilder is talking out his ass about
\nsomething that he clearly knows *nothing* about.<\/p>\n","protected":false},"excerpt":{"rendered":"

PZ wrote about the latest nonsense from IDiot George Gilder. In this interview, Gilder tries to make some really horrible arguments about how everything is really hierarchical, and he uses “information theory, computer science, and network theory” as examples. I believe that the universe is hierarchical, with creation at the top – the idea that […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":false,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2}},"categories":[31],"tags":[],"class_list":["post-449","post","type-post","status-publish","format-standard","hentry","category-intelligent-design"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_shortlink":"https:\/\/wp.me\/p4lzZS-7f","jetpack_sharing_enabled":true,"jetpack_likes_enabled":true,"_links":{"self":[{"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/posts\/449","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/comments?post=449"}],"version-history":[{"count":0,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/posts\/449\/revisions"}],"wp:attachment":[{"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/media?parent=449"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/categories?post=449"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/tags?post=449"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}