Complex network of the brain I Small world vs. scale-free networks Jaeseung Jeong, Ph.D. Department of Bio and Brain Engineering, KAIST

Vertex (node) and edge (link) Any system can be expressed as a network with nodes and links.

Examples of complex networks: geometric, regular Eileen Kraemer

Examples of complex networks: semi-geometric, irregular Eileen Kraemer

Structural metrics: Average path length

Structural Metrics: Degree distribution(connectivity)

Structural Metrics: Clustering coefficient A clustering coefficient is a measure of the degree to which nodes in a graph tend to cluster together.

Milgram’s experiment: Six degrees of separation Milgram's experiment was designed to measure these path lengths by developing a procedure to count the number of ties between any two people. Milgram's experiment developed out of a desire to learn more about the probability that two randomly selected people would know each other, as one way of looking at the small world problem. An alternative view of the problem is to imagine the population as a social network and attempt to find the average path length between any two nodes.

Milgram’s experiment: Procedure Milgram chose individuals in an U.S. city (Omaha) to be the starting points and Boston, Massachusetts, to be the end point of a chain of correspondence. Letters were initially sent to "randomly" selected individuals in Omaha. The letter detailed the study's purpose, and basic information about a target contact person in Boston. It additionally contained a roster on which they could write their own name, as well as business reply cards that were pre- addressed to Harvard. Upon receiving the invitation to participate, the recipient was asked whether he or she personally knew the contact person described in the letter. If so, the recipient could forward the letter directly to that person. (Knowing someone "personally" was defined as knowing them on a first-name basis.)

Milgram’s experiment: Procedure If the recipient did not personally know the target person, the recipient was to think of a friend he knew personally who was more likely to know the target. He was then directed to sign his name on the roster and forward the letter to that person. A postcard was also mailed to the researchers at Harvard so that they could track the chain's progression toward the target. When and if the package eventually reached the target person in Boston, the researchers could examine the roster to count the number of times it had been forwarded from person to person. (Additionally, for packages that never reached the destination, the incoming postcards helped identify the break point in the chain.)

Milgram’s experiment: Results Six degrees of separation In one case, 232 of the 296 letters never reached the destination because the recipients refulsed to participate in this study. However, 64 of the letters eventually did reach the target contact. Among these chains, the average path length fell around ‘five and a half or six.’ Hence, the researchers concluded that people in the United States are separated by about six people on average.

Six degrees of Kevin Bacon

Kevin Bacon game: Six degrees of Kevin Bacon

Kevin Bacon Game

D. J. Watts and Steven Strogatz (June 1998). "Collective dynamics of 'small-world' networks". Nature 393 (6684): 440–442.

A small-world network is a type of mathematical graph in which most nodes are not neighbors of one another, but most nodes can be reached from every other by a small number of hops or steps.

Scale-free network

The scale-free nature of the web of sexual contacts. They analyze data gathered in a 1996 Swedish survey of sexual behavior. The survey--involving a random sample of 4781 Swedish individuals (ages yr)--used structured personal interviews and questionnaires to collect information. The response rate was 59 percent, corresponding to 2810 respondents. Connections in the network of sexual contacts appear and disappear as sexual relations are initiated and terminated. To analyze the connectivity of this dynamic network, whose links may be quite short lived, we first analyze the number k of sex partners over a relatively short time window- -the twelve months prior to the survey.

Preferential attachment (Albert-Lazlo Barabasi) A preferential attachment process is any of processes in which links are distributed among a number of nodes according to how much they already have links, so that those who are already wealthy receive more than those who are not. (The rich get richer)

Preferential attachment (Albert-Lazlo Barabasi)

Models Erdös-Rényi  Homogeneous – Each possible link exists with probability p Scale-free  Heterogeneous – The network grows a node at a time – The probability  i that the new node is connected to node i is proportional to know many links node i owns (preferential attachment)

Brain and complex network (graph) theory Undirected graph Directed graph Weighted graph Boccaletti et al., 2006Liu, 2008  Node (vertex) : Brain region or voxel, channel of EEG/MEG  Link (edge) : Functional or anatomical connection between nodes  Network analysis can reveal structural and functional organization of the brain (Liu, 2008)

Constructing Brain Networks Bullmore and Sporns, 2009

Brain is a small-world network  high clustering coefficient (C) – high resilience to damage in local structures  low average path length (L) – high level of global communication efficiency  Brain functional network has small-world structure, while this property may be disrupted in damaged brain such as AD (vulnerability to damages, decreased communication efficiency between distant brain regions … ) Watts and Strogatz, 1998 high C high C low C high L low L low L

Small-world and scale-free organization of voxel-based resting state functional connectivity in the human brain van den Heuvel et al., Neuroimage, 2008 normal, resting-state, voxel-based(N=10,000), zero-lag temporal correlation, bandpass-filtered ( Hz), unweighted, small-world and scale-free : optimal network organization balance between maximum communication efficiency and minimum wiring AD, damage modeling, weighted graph, efficiency

A resilient, low-frequency, small-world human brain functional network with highly connected association cortical hubs ( Achard et al., The Journal of Neuroscience, 2006) MODWT (Maximal Overlap Discrete Wavelet Transform) at 6 frequency scales healthy young subjects, resting-state, Parcellation (90 region-based), unweighted, small-world, NOT scale-free resilient to targeted attack than SF network AD, voxel-based, weighted, efficiency, region attack

Alzheimer vs. Healthy subjects

Why does the brain process information so quickly?