|
Small-world Networks
A small-world network is a type of mathematical graph in which most nodes are not neighbors of one another, but the neighbors of any given node are likely to be neighbors of each other and most nodes can be reached from every other node by a small number of hops or steps. Specifically, a small-world network is defined to be a network where the typical distance ''L'' between two randomly chosen nodes (the number of steps required) grows proportionally to the logarithm of the number of nodes ''N'' in the network, that is: :L \propto \log N while the global clustering coefficient is not small. In the context of a social network, this results in the small world phenomenon of strangers being linked by a short chain of acquaintances. Many empirical graphs show the small-world effect, including social networks, wikis such as Wikipedia, gene networks, and even the underlying architecture of the Internet. It is the inspiration for many network-on-chip architectures in contempor ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Average Path Length
Average path length, or average shortest path length is a concept in network topology that is defined as the average number of steps along the shortest paths for all possible pairs of network nodes. It is a measure of the efficiency of information or mass transport on a network. __TOC__ Concept Average path length is one of the three most robust measures of network topology, along with its clustering coefficient and its degree distribution. Some examples are: the average number of clicks which will lead you from one website to another, or the number of people you will have to communicate through, on an average, to contact a complete stranger. It should not be confused with the diameter of the network, which is defined as the longest geodesic, i.e., the longest shortest path between any two nodes in the network (see Distance (graph theory)). The average path length distinguishes an easily negotiable network from one, which is complicated and inefficient, with a shorter average pa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Six Degrees Of Separation
Six degrees of separation is the idea that all people are six or fewer social connections away from each other. As a result, a chain of "friend of a friend" statements can be made to connect any two people in a maximum of six steps. It is also known as the six handshakes rule. The concept was originally set out in a 1929 short story by Frigyes Karinthy, where a group of people play a game trying to connect any person in the world to themselves by a chain of five others. It was popularized in John Guare's 1990 play '' Six Degrees of Separation''. The idea is sometimes generalized to the average social distance being logarithmic in the size of the population. Early conceptions Shrinking world Theories on optimal design of cities, city traffic flows, neighborhoods, and demographics were in vogue after World War I. These conjectures were expanded in 1929 by Hungarian author Frigyes Karinthy, who published a volume of short stories titled ''Everything is Different.'' One of th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gene
In biology, the word gene (from , ; "... Wilhelm Johannsen coined the word gene to describe the Mendelian units of heredity..." meaning ''generation'' or ''birth'' or ''gender'') can have several different meanings. The Mendelian gene is a basic unit of heredity and the molecular gene is a sequence of nucleotides in DNA that is transcribed to produce a functional RNA. There are two types of molecular genes: protein-coding genes and noncoding genes. During gene expression, the DNA is first copied into RNA. The RNA can be directly functional or be the intermediate template for a protein that performs a function. The transmission of genes to an organism's offspring is the basis of the inheritance of phenotypic traits. These genes make up different DNA sequences called genotypes. Genotypes along with environmental and developmental factors determine what the phenotypes will be. Most biological traits are under the influence of polygenes (many different genes) as well as ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Transcriptional Regulation
In molecular biology and genetics, transcriptional regulation is the means by which a cell regulates the conversion of DNA to RNA (transcription), thereby orchestrating gene activity. A single gene can be regulated in a range of ways, from altering the number of copies of RNA that are transcribed, to the temporal control of when the gene is transcribed. This control allows the cell or organism to respond to a variety of intra- and extracellular signals and thus mount a response. Some examples of this include producing the mRNA that encode enzymes to adapt to a change in a food source, producing the gene products involved in cell cycle specific activities, and producing the gene products responsible for cellular differentiation in multicellular eukaryotes, as studied in evolutionary developmental biology. The regulation of transcription is a vital process in all living organisms. It is orchestrated by transcription factors and other proteins working in concert to finely tune ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Co-occurrence Network
Co-occurrence network, sometimes referred to as a semantic network, is a method to analyze text that includes a graphic visualization of potential relationships between people, organizations, concepts, biological organisms like bacteria or other entities represented within written material. The generation and visualization of co-occurrence networks has become practical with the advent of electronically stored text compliant to text mining. By way of definition, co-occurrence networks are the collective interconnection of terms based on their paired presence within a specified unit of text. Networks are generated by connecting pairs of terms using a set of criteria defining co-occurrence. For example, terms A and B may be said to “co-occur” if they both appear in a particular article. Another article may contain terms B and C. Linking A to B and B to C creates a co-occurrence network of these three terms. Rules to define co-occurrence within a text corpus can be set accordin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Biological Neural Network
A neural circuit is a population of neurons interconnected by synapses to carry out a specific function when activated. Neural circuits interconnect to one another to form large scale brain networks. Biological neural networks have inspired the design of artificial neural networks, but artificial neural networks are usually not strict copies of their biological counterparts. Early study Early treatments of neural networks can be found in Herbert Spencer's ''Principles of Psychology'', 3rd edition (1872), Theodor Meynert's ''Psychiatry'' (1884), William James' ''Principles of Psychology'' (1890), and Sigmund Freud's Project for a Scientific Psychology (composed 1895). The first rule of neuronal learning was described by Hebb in 1949, in the Hebbian theory. Thus, Hebbian pairing of pre-synaptic and post-synaptic activity can substantially alter the dynamic characteristics of the synaptic connection and therefore either facilitate or inhibit signal transmission. In 1959, th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fat-tailed Distribution
A fat-tailed distribution is a probability distribution that exhibits a large skewness or kurtosis, relative to that of either a normal distribution or an exponential distribution. In common usage, the terms fat-tailed and heavy-tailed are sometimes synonymous; fat-tailed is sometimes also defined as a subset of heavy-tailed. Different research communities favor one or the other largely for historical reasons, and may have differences in the precise definition of either. Fat-tailed distributions have been empirically encountered in a variety of areas: physics, earth sciences, economics and political science. The class of fat-tailed distributions includes those whose tails decay like a power law, which is a common point of reference in their use in the scientific literature. However, fat-tailed distributions also include other slowly-decaying distributions, such as the log-normal. The extreme case: a power-law distribution The most extreme case of a fat tail is given by a distrib ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Airline Hub
An airline hub or hub airport is an airport used by one or more airlines to concentrate passenger traffic and flight operations. Hubs serve as transfer (or stop-over) points to help get passengers to their final destination. It is part of the hub-and-spoke system. An airline may operate flights from several non-hub (spoke) cities to the hub airport, and passengers traveling between spoke cities connect through the hub. This paradigm creates economies of scale that allow an airline to serve (via an intermediate connection) city-pairs that could otherwise not be economically served on a non-stop basis. This system contrasts with the point-to-point model, in which there are no hubs and nonstop flights are instead offered between spoke cities. Hub airports also serve origin and destination (O&D) traffic. Operations The hub-and-spoke system allows an airline to serve fewer routes, so fewer aircraft are needed. The system also increases passenger loads; a flight from a hub to a s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Degree (graph Theory)
In graph theory, the degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex; in a multigraph, a loop contributes 2 to a vertex's degree, for the two ends of the edge. The degree of a vertex v is denoted \deg(v) or \deg v. The maximum degree of a graph G, denoted by \Delta(G), and the minimum degree of a graph, denoted by \delta(G), are the maximum and minimum of its vertices' degrees. In the multigraph shown on the right, the maximum degree is 5 and the minimum degree is 0. In a regular graph, every vertex has the same degree, and so we can speak of ''the'' degree of the graph. A complete graph (denoted K_n, where n is the number of vertices in the graph) is a special kind of regular graph where all vertices have the maximum possible degree, n-1. In a signed graph, the number of positive edges connected to the vertex v is called positive deg(v) and the number of connected negative edges is entitled negative deg(v). Handshaking lem ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Clique (graph Theory)
In the mathematical area of graph theory, a clique ( or ) is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent. That is, a clique of a graph G is an induced subgraph of G that is complete. Cliques are one of the basic concepts of graph theory and are used in many other mathematical problems and constructions on graphs. Cliques have also been studied in computer science: the task of finding whether there is a clique of a given size in a graph (the clique problem) is NP-complete, but despite this hardness result, many algorithms for finding cliques have been studied. Although the study of complete subgraphs goes back at least to the graph-theoretic reformulation of Ramsey theory by , the term ''clique'' comes from , who used complete subgraphs in social networks to model cliques of people; that is, groups of people all of whom know each other. Cliques have many other applications in the sciences and particularly in bioin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.svg "Click for more on -> Degree (graph Theory)")
