 |
Network Science
Network science is an academic field which studies complex networks such as telecommunication networks, computer networks, biological networks, cognitive and semantic networks, and social networks, considering distinct elements or actors represented by ''nodes'' (or ''vertices'') and the connections between the elements or actors as ''links'' (or ''edges''). The field draws on theories and methods including graph theory from mathematics, statistical mechanics from physics, data mining and information visualization from computer science, inferential modeling from statistics, and social structure from sociology. The United States National Research Council defines network science as "the study of network representations of physical, biological, and social phenomena leading to predictive models of these phenomena." Background and history The study of networks has emerged in diverse disciplines as a means of analyzing complex relational data. The earliest known paper in this ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
 |
Complex Network
In the context of network theory, a complex network is a graph (network) with non-trivial topological features—features that do not occur in simple networks such as lattices or random graphs but often occur in networks representing real systems. The study of complex networks is a young and active area of scientific research (since 2000) inspired largely by empirical findings of real-world networks such as computer networks, biological networks, technological networks, brain networks, climate networks and social networks. Definition Most social, biological, and technological networks display substantial non-trivial topological features, with patterns of connection between their elements that are neither purely regular nor purely random. Such features include a heavy tail in the degree distribution, a high clustering coefficient, assortativity or disassortativity among vertices, community structure, and hierarchical structure. In the case of directed networks these fea ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
 |
Jacob Moreno
Jacob Levy Moreno (born Iacob Levy; May 18, 1889 – May 14, 1974) was a Romanian-American psychiatrist, psychosociologist, and educator, the founder of psychodrama, and the foremost pioneer of group psychotherapy. During his lifetime, he was recognized as one of the leading social scientists. Early life and education Jacob Levy Moreno was born in Bucharest in the Kingdom of Romania. His father was Moreno Nissim Levy, a Sephardi Jewish merchant born in 1856 in Plevna in the Ottoman Empire (today Pleven, Bulgaria). Jacob's grandfather Buchis had moved to Plevna from Constantinople, where his ancestors had settled after they left Spain in 1492. It is thought that the Morenos left Plevna for Bucharest during the Russo-Turkish War of 1877–1878, following the Plevna rabbi Haim Bejarano in search of a more hospitable environment. Jacob Moreno's mother, Paulina Iancu or Wolf, was also a Sephardi Jew, born in 1873, and originated from Călăraşi, Romania. In 1895, a time of great ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
Dynamic Network Analysis
Dynamic network analysis (DNA) is an emergent scientific field that brings together traditional social network analysis (SNA), link analysis (LA), social simulation and multi-agent systems (MAS) within network science and network theory. Dynamic networks are a function of time (modeled as a subset of the real numbers) to a set of graphs; for each time point there is a graph. This is akin to the definition of dynamical systems, in which the function is from time to an ambient space, where instead of ambient space time is translated to relationships between pairs of vertices. Overview There are two aspects of this field. The first is the statistical analysis of DNA data. The second is the utilization of simulation to address issues of network dynamics. DNA networks vary from traditional social networks in that they are larger, dynamic, multi-mode, multi-plex networks, and may contain varying levels of uncertainty Uncertainty refers to Epistemology, epistemic situations i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Kathleen Carley
Kathleen M. Carley is an American social scientist specializing in dynamic network analysis. She is a professor in the School of Computer Science in the Institute for Software Research at Carnegie Mellon University and also holds appointments in the Tepper School of Business, the Heinz College, the Department of Engineering and Public Policy, and the Department of Social and Decision Sciences. Background Kathleen Carley was born in Pueblo, Colorado in 1956. At High School her interest in social modeling was inspired by Isaac Asimov's Foundation series. Artificial intelligence was not a career path at that time and she was dissuaded from studying Mathematics because of gender stereotyping. Instead she studied for an S.B. in economics and an S.B. in political science from the Massachusetts Institute of Technology in 1978. She received her Ph.D. in sociology from Harvard University in 1984. Her Ph.D. advisor was Harrison White and her thesis was entitled ''Consensus Constructio ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
David Krackhardt
David Krackhardt is Professor of Organizations at Heinz College and the Tepper School of Business, with courtesy appointments in the Department of Social and Decision Sciences (Dietrich College of Humanities and Social Sciences) and the Machine Learning Department (School of Computer Science), all at Carnegie Mellon University in the United States, and he also serves a Fellow of CEDEP, the European Centre for Executive Education, in France. He is notable for being the author of KrackPlot, a network visualization software designed for social network analysis which is widely used in academic research. He is also the founder of thJournal of Social Structure Career Krackhardt received a BS degree from the Massachusetts Institute of Technology and a PhD from the University of California, Irvine. He joined the Johnson School of Management at Cornell as an assistant professor in 1984. He moved to Harvard Business School as a Marvin Bower Fellow for a year, before joining He ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Network Probability Matrix
The network probability matrix describes the probability structure of a network based on the historical presence or absence of edges in a network. For example, individuals in a social network are not connected to other individuals with uniform random probability. The probability structure is much more complex. Intuitively, there are some people whom a person will communicate with or be connected more closely than others. For this reason, real-world networks tend to have clusters or cliques of nodes that are more closely related than others (Albert and Barabasi, 2002, Carley ear Newmann 2003). This can be simulated by varying the probabilities that certain nodes will communicate. The network probability matrix was originally proposed by Ian McCulloh. References * McCulloh, I., Lospinoso, J. & Carley, K.M. (2007). Probability Mechanics in Communications Networks. In ''Proceedings of the 12th International Conference on Applied Mathematics'' of the World Science Engineering ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Exponential Random Graph Model
Exponential family random graph models (ERGMs) are a family of statistical models for analyzing data from social and other networks. Examples of networks examined using ERGM include knowledge networks, organizational networks, colleague networks, social media networks, networks of scientific development, and others. Background Many metrics exist to describe the structural features of an observed network such as the density, centrality, or assortativity. However, these metrics describe the observed network which is only one instance of a large number of possible alternative networks. This set of alternative networks may have similar or dissimilar structural features. To support statistical inference on the processes influencing the formation of network structure, a statistical model should consider the set of all possible alternative networks weighted on their similarity to an observed network. However because network data is inherently relational, it violates the assumptions of in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
 |
Social Networks
A social network is a social structure made up of a set of social actors (such as individuals or organizations), sets of dyadic ties, and other social interactions between actors. The social network perspective provides a set of methods for analyzing the structure of whole social entities as well as a variety of theories explaining the patterns observed in these structures. The study of these structures uses social network analysis to identify local and global patterns, locate influential entities, and examine network dynamics. Social networks and the analysis of them is an inherently interdisciplinary academic field which emerged from social psychology, sociology, statistics, and graph theory. Georg Simmel authored early structural theories in sociology emphasizing the dynamics of triads and "web of group affiliations". Jacob Moreno is credited with developing the first sociograms in the 1930s to study interpersonal relationships. These approaches were mathematically ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
Random Graphs
In mathematics, random graph is the general term to refer to probability distributions over graphs. Random graphs may be described simply by a probability distribution, or by a random process which generates them. The theory of random graphs lies at the intersection between graph theory and probability theory. From a mathematical perspective, random graphs are used to answer questions about the properties of ''typical'' graphs. Its practical applications are found in all areas in which complex networks need to be modeled – many random graph models are thus known, mirroring the diverse types of complex networks encountered in different areas. In a mathematical context, ''random graph'' refers almost exclusively to the Erdős–Rényi random graph model. In other contexts, any graph model may be referred to as a ''random graph''. Models A random graph is obtained by starting with a set of ''n'' isolated vertices and adding successive edges between them at random. The ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Alfréd Rényi
Alfréd Rényi (20 March 1921 – 1 February 1970) was a Hungarian mathematician known for his work in probability theory, though he also made contributions in combinatorics, graph theory, and number theory. Life Rényi was born in Budapest to Artúr Rényi and Borbála Alexander; his father was a mechanical engineer, while his mother was the daughter of philosopher and literary critic Bernhard Alexander; his uncle was Franz Alexander, a Hungarian-American psychoanalyst and physician. He was prevented from enrolling in university in 1939 due to the anti-Jewish laws then in force, but enrolled at the University of Budapest in 1940 and finished his studies in 1944. At this point, he was drafted to forced labour service, from which he escaped. He then completed his PhD in 1947 at the University of Szeged, under the advisement of Frigyes Riesz. He married Katalin Schulhof (who used Kató Rényi as her married name), herself a mathematician, in 1946; their daughter Zsuzsanna ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
 |
Paul Erdős
Paul Erdős ( hu, Erdős Pál ; 26 March 1913 – 20 September 1996) was a Hungarian mathematician. He was one of the most prolific mathematicians and producers of mathematical conjectures of the 20th century. pursued and proposed problems in discrete mathematics, graph theory, number theory, mathematical analysis, approximation theory, set theory, and probability theory. Much of his work centered around discrete mathematics, cracking many previously unsolved problems in the field. He championed and contributed to Ramsey theory, which studies the conditions in which order necessarily appears. Overall, his work leaned towards solving previously open problems, rather than developing or exploring new areas of mathematics. Erdős published around 1,500 mathematical papers during his lifetime, a figure that remains unsurpassed. He firmly believed mathematics to be a social activity, living an itinerant lifestyle with the sole purpose of writing mathematical papers with other mat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
 |
Social Network Analysis
Social network analysis (SNA) is the process of investigating social structures through the use of networks and graph theory. It characterizes networked structures in terms of ''nodes'' (individual actors, people, or things within the network) and the ''ties'', ''edges'', or ''links'' (relationships or interactions) that connect them. Examples of social structures commonly visualized through social network analysis include social media networks, memes spread, information circulation, friendship and acquaintance networks, business networks, knowledge networks, difficult working relationships, social networks, collaboration graphs, kinship, disease transmission, and sexual relationships. These networks are often visualized through '' sociograms'' in which nodes are represented as points and ties are represented as lines. These visualizations provide a means of qualitatively assessing networks by varying the visual representation of their nodes and edges to reflect attribute ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |