<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="zh-Hans-CN">
	<id>https://wiki.swarma.org/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=%E6%9C%A8%E5%AD%90%E4%BA%8C%E6%9C%88%E9%B8%9F</id>
	<title>集智百科 - 复杂系统|人工智能|复杂科学|复杂网络|自组织 - 用户贡献 [zh-cn]</title>
	<link rel="self" type="application/atom+xml" href="https://wiki.swarma.org/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=%E6%9C%A8%E5%AD%90%E4%BA%8C%E6%9C%88%E9%B8%9F"/>
	<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php/%E7%89%B9%E6%AE%8A:%E7%94%A8%E6%88%B7%E8%B4%A1%E7%8C%AE/%E6%9C%A8%E5%AD%90%E4%BA%8C%E6%9C%88%E9%B8%9F"/>
	<updated>2026-11-02T20:39:46Z</updated>
	<subtitle>用户贡献</subtitle>
	<generator>MediaWiki 1.35.0</generator>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E9%B8%9F%E7%BE%A4%E7%AE%97%E6%B3%95&amp;diff=11463</id>
		<title>鸟群算法</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E9%B8%9F%E7%BE%A4%E7%AE%97%E6%B3%95&amp;diff=11463"/>
		<updated>2020-08-02T02:13:39Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。&lt;br /&gt;
&lt;br /&gt;
{{short description|Artificial life program, developed by Craig Reynolds in 1986, which simulates the flocking behaviour of birds}}&lt;br /&gt;
&lt;br /&gt;
{{Use mdy dates|date=July 2011}}&lt;br /&gt;
&lt;br /&gt;
{{for|the reptilian family|Boidae}}&lt;br /&gt;
&lt;br /&gt;
[[File:Boids OpenGL example.webm|thumb|A Boids example created in [[OpenGL]]]]&lt;br /&gt;
&lt;br /&gt;
A Boids example created in [[OpenGL]]&lt;br /&gt;
&lt;br /&gt;
在[[[ OpenGL ]]中创建的 Boids 示例&lt;br /&gt;
&lt;br /&gt;
'''Boids''' is an [[artificial life]] program, developed by [[Craig Reynolds (computer graphics)|Craig Reynolds]] in 1986, which simulates the [[Flocking (behavior)|flocking]] behaviour of [[Bird|birds]]. His paper on this topic was published in 1987 in the proceedings of the [[Association for Computing Machinery|ACM]] [[SIGGRAPH]] conference. &amp;lt;ref&amp;gt;{{Cite book&lt;br /&gt;
&lt;br /&gt;
Boids is an artificial life program, developed by Craig Reynolds in 1986, which simulates the flocking behaviour of birds. His paper on this topic was published in 1987 in the proceedings of the ACM SIGGRAPH conference. &amp;lt;ref&amp;gt;{{Cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 | last1=Reynolds&lt;br /&gt;
&lt;br /&gt;
 | last1=Reynolds&lt;br /&gt;
&lt;br /&gt;
最后1雷诺&lt;br /&gt;
&lt;br /&gt;
 | first1=Craig&lt;br /&gt;
&lt;br /&gt;
 | first1=Craig&lt;br /&gt;
&lt;br /&gt;
第一名: 克雷格&lt;br /&gt;
&lt;br /&gt;
 | author1-link=Craig Reynolds (computer_graphics)&lt;br /&gt;
&lt;br /&gt;
 | author1-link=Craig Reynolds (computer_graphics)&lt;br /&gt;
&lt;br /&gt;
| author1-link Craig Reynolds (计算机图形学)&lt;br /&gt;
&lt;br /&gt;
 | title=Flocks, herds and schools: A distributed behavioral model.&lt;br /&gt;
&lt;br /&gt;
 | title=Flocks, herds and schools: A distributed behavioral model.&lt;br /&gt;
&lt;br /&gt;
羊群、畜群和学校: 一个分布式的行为模型。&lt;br /&gt;
&lt;br /&gt;
 | year=1987&lt;br /&gt;
&lt;br /&gt;
 | year=1987&lt;br /&gt;
&lt;br /&gt;
1987年&lt;br /&gt;
&lt;br /&gt;
 | number=&lt;br /&gt;
&lt;br /&gt;
 | number=&lt;br /&gt;
&lt;br /&gt;
数字&lt;br /&gt;
&lt;br /&gt;
 | journal=SIGGRAPH '87: Proceedings of the 14th Annual Conference on Computer Graphics and Interactive Techniques&lt;br /&gt;
&lt;br /&gt;
 | journal=SIGGRAPH '87: Proceedings of the 14th Annual Conference on Computer Graphics and Interactive Techniques&lt;br /&gt;
&lt;br /&gt;
87: 第14届计算机图形学与互动技术年度会议论文集&lt;br /&gt;
&lt;br /&gt;
 | publisher=[[Association for Computing Machinery]]&lt;br /&gt;
&lt;br /&gt;
 | publisher=Association for Computing Machinery&lt;br /&gt;
&lt;br /&gt;
| 出版商计算机协会&lt;br /&gt;
&lt;br /&gt;
 | pages=25–34&lt;br /&gt;
&lt;br /&gt;
 | pages=25–34&lt;br /&gt;
&lt;br /&gt;
第25-34页&lt;br /&gt;
&lt;br /&gt;
 | isbn=978-0-89791-227-3&lt;br /&gt;
&lt;br /&gt;
 | isbn=978-0-89791-227-3&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-89791-227-3]&lt;br /&gt;
&lt;br /&gt;
 | doi=10.1145/37401.37406&lt;br /&gt;
&lt;br /&gt;
 | doi=10.1145/37401.37406&lt;br /&gt;
&lt;br /&gt;
10.1145 / 37401.37406&lt;br /&gt;
&lt;br /&gt;
| citeseerx=10.1.1.103.7187&lt;br /&gt;
&lt;br /&gt;
| citeseerx=10.1.1.103.7187&lt;br /&gt;
&lt;br /&gt;
10.1.1.103.7187&lt;br /&gt;
&lt;br /&gt;
 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
{} / ref&lt;br /&gt;
&lt;br /&gt;
The name &amp;quot;boid&amp;quot; corresponds to a shortened version of &amp;quot;bird-oid object&amp;quot;, which refers to a bird-like object.&amp;lt;ref&amp;gt;{{Cite journal&lt;br /&gt;
&lt;br /&gt;
The name &amp;quot;boid&amp;quot; corresponds to a shortened version of &amp;quot;bird-oid object&amp;quot;, which refers to a bird-like object.&amp;lt;ref&amp;gt;{{Cite journal&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 | last1=Banks&lt;br /&gt;
&lt;br /&gt;
 | last1=Banks&lt;br /&gt;
&lt;br /&gt;
1 Banks&lt;br /&gt;
&lt;br /&gt;
 | first1=Alec&lt;br /&gt;
&lt;br /&gt;
 | first1=Alec&lt;br /&gt;
&lt;br /&gt;
首先 Alec&lt;br /&gt;
&lt;br /&gt;
 | last2=Vincent&lt;br /&gt;
&lt;br /&gt;
 | last2=Vincent&lt;br /&gt;
&lt;br /&gt;
最后2文森特&lt;br /&gt;
&lt;br /&gt;
 | first2=Jonathan&lt;br /&gt;
&lt;br /&gt;
 | first2=Jonathan&lt;br /&gt;
&lt;br /&gt;
第二名: 乔纳森&lt;br /&gt;
&lt;br /&gt;
 | last3=Anyakoha&lt;br /&gt;
&lt;br /&gt;
 | last3=Anyakoha&lt;br /&gt;
&lt;br /&gt;
3 / lastanyakoha&lt;br /&gt;
&lt;br /&gt;
 | first3=Chukwudi&lt;br /&gt;
&lt;br /&gt;
 | first3=Chukwudi&lt;br /&gt;
&lt;br /&gt;
| first3 Chukwudi&lt;br /&gt;
&lt;br /&gt;
 | title=A review of particle swarm optimization. Part I: background and development&lt;br /&gt;
&lt;br /&gt;
 | title=A review of particle swarm optimization. Part I: background and development&lt;br /&gt;
&lt;br /&gt;
2012年10月12日 | 标题: 粒子群优化的回顾。第一部分: 背景与发展&lt;br /&gt;
&lt;br /&gt;
 |date=July 2007&lt;br /&gt;
&lt;br /&gt;
 |date=July 2007&lt;br /&gt;
&lt;br /&gt;
2007年7月&lt;br /&gt;
&lt;br /&gt;
 | journal=Natural Computing&lt;br /&gt;
&lt;br /&gt;
 | journal=Natural Computing&lt;br /&gt;
&lt;br /&gt;
自然计算杂志&lt;br /&gt;
&lt;br /&gt;
 | volume=6&lt;br /&gt;
&lt;br /&gt;
 | volume=6&lt;br /&gt;
&lt;br /&gt;
第六卷&lt;br /&gt;
&lt;br /&gt;
 | issue=4&lt;br /&gt;
&lt;br /&gt;
 | issue=4&lt;br /&gt;
&lt;br /&gt;
第四期&lt;br /&gt;
&lt;br /&gt;
 | pages=467–484&lt;br /&gt;
&lt;br /&gt;
 | pages=467–484&lt;br /&gt;
&lt;br /&gt;
第467-484页&lt;br /&gt;
&lt;br /&gt;
 | doi=10.1007/s11047-007-9049-5&lt;br /&gt;
&lt;br /&gt;
 | doi=10.1007/s11047-007-9049-5&lt;br /&gt;
&lt;br /&gt;
10.1007 / s11047-007-9049-5&lt;br /&gt;
&lt;br /&gt;
| citeseerx=10.1.1.605.5879&lt;br /&gt;
&lt;br /&gt;
| citeseerx=10.1.1.605.5879&lt;br /&gt;
&lt;br /&gt;
10.1.1.605.5879&lt;br /&gt;
&lt;br /&gt;
 }}&amp;lt;/ref&amp;gt; Incidentally, &amp;quot;boid&amp;quot; is also a New York Metropolitan dialect pronunciation for &amp;quot;bird&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
 }}&amp;lt;/ref&amp;gt; Incidentally, &amp;quot;boid&amp;quot; is also a New York Metropolitan dialect pronunciation for &amp;quot;bird&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
} / ref &lt;br /&gt;
'''鸟群算法 Boids'''是模拟鸟类群集行为的人工生命项目，由'''克雷格·雷诺兹 Craig Reynolds'''于1986年开发。该模型基于常用于计算机动画或计算机辅助设计的计算机三维几何。他关于这个主题的论文发表在1987年的 ACM SIGGRAPH（美国计算机协会计算机图形专业组组织的计算机图形学顶级年度会议）会议记录上。“ boid”是“ bird-oid object”的缩写，指一个类鸟对象。恰巧，“boid”也是纽约都市方言中“bird”的发音。&lt;br /&gt;
&lt;br /&gt;
 --[[用户:Dorr|Dorr]]（[[用户讨论:Dorr|讨论]]）补充自http://www.red3d.com/cwr/boids/：It was based on three dimensional computational geometry of the sort normally used in computer animation or computer aided design.&lt;br /&gt;
&lt;br /&gt;
{{multiple image|direction=vertical|image1=Rule separation.gif|caption1=Separation|image2=Rule alignment.gif|caption2=Alignment|image3=Rule cohesion.gif|caption3=Cohesion|header=Rules applied in simple Boids}}&lt;br /&gt;
&lt;br /&gt;
As with most artificial life simulations, Boids is an example of [[emergence|emergent]] behavior; that is, the complexity of Boids arises from the interaction of individual agents (the boids, in this case) adhering to a set of simple rules.  The rules applied in the simplest Boids world are as follows:&lt;br /&gt;
&lt;br /&gt;
As with most artificial life simulations, Boids is an example of emergent behavior; that is, the complexity of Boids arises from the interaction of individual agents (the boids, in this case) adhering to a set of simple rules.  The rules applied in the simplest Boids world are as follows:&lt;br /&gt;
&lt;br /&gt;
与大多数人工生命模拟一样，Boids 是'''涌现 Emergent'''行为的一个例子; 也就是说，Boids 的复杂性来自于遵循一系列简单规则的个体代理（这里是 Boids）的相互作用。在最简单的Bolds 世界中适用的规则如下，其描述了鸟群中的个体如何根据周边同伴的位置和速度移动:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* '''separation''': [[wikt:steer#Verb 2|steer]] to avoid crowding local flockmates&lt;br /&gt;
&lt;br /&gt;
* '''alignment''': steer towards the average heading of local flockmates&lt;br /&gt;
&lt;br /&gt;
* '''cohesion''': steer to move towards the average position (center of mass) of local flockmates&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* '''分离 Separation''': 移动以避开群体拥挤处&lt;br /&gt;
&lt;br /&gt;
* '''对齐 Alignment''': 转向群体的平均航向&lt;br /&gt;
&lt;br /&gt;
* '''靠近 Cohesion''': 朝群体的平均位置（质心）移动&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
每个 boid 个体都可以得知整体的几何参数，但群体要求其只对其周围某个小邻近范围作出反应。该邻近范围由一个距离（从该个体的中心算起）和一个角度（从其飞行方向算起）决定。此范围外的同伴不予考虑。该临近范围可以认为是一个有限知觉的模型（就像浑浊的水中的鱼一样）；但更恰当的想法可能是，其定义了鸟群影响了个体转向的区域范围。&lt;br /&gt;
&lt;br /&gt;
 --[[用户:Dorr|Dorr]]（[[用户讨论:Dorr|讨论]]）补充自http://www.red3d.com/cwr/boids/：Each boid has direct access to the whole scene's geometric description, but flocking requires that it reacts only to flockmates within a certain small neighborhood around itself. The neighborhood is characterized by a distance (measured from the center of the boid) and an angle, measured from the boid's direction of flight. Flockmates outside this local neighborhood are ignored. The neighborhood could be considered a model of limited perception (as by fish in murky water) but it is probably more correct to think of it as defining the region in which flockmates influence a boids steering.&lt;br /&gt;
&lt;br /&gt;
More complex rules can be added, such as obstacle avoidance and goal seeking.&lt;br /&gt;
&lt;br /&gt;
More complex rules can be added, such as obstacle avoidance and goal seeking.&lt;br /&gt;
&lt;br /&gt;
可以添加更复杂的规则，如避障和寻找目标。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The basic model has been extended in several different ways since Reynolds proposed it. For instance, Delgado-Mata et&amp;amp;nbsp;al.&amp;lt;ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The basic model has been extended in several different ways since Reynolds proposed it. For instance, Delgado-Mata et&amp;amp;nbsp;al.&amp;lt;ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{cite journal&lt;br /&gt;
&lt;br /&gt;
{{cite journal&lt;br /&gt;
&lt;br /&gt;
{引用期刊&lt;br /&gt;
&lt;br /&gt;
|first1= Carlos | last1= Delgado-Mata&lt;br /&gt;
&lt;br /&gt;
|first1= Carlos | last1= Delgado-Mata&lt;br /&gt;
&lt;br /&gt;
卡洛斯，德尔加多，马塔&lt;br /&gt;
&lt;br /&gt;
|first2= Jesus Ibanez | last2= Martinez&lt;br /&gt;
&lt;br /&gt;
|first2= Jesus Ibanez | last2= Martinez&lt;br /&gt;
&lt;br /&gt;
2 Jesus Ibanez | last 2 Martinez&lt;br /&gt;
&lt;br /&gt;
|first3= Simon | last3= Bee&lt;br /&gt;
&lt;br /&gt;
|first3= Simon | last3= Bee&lt;br /&gt;
&lt;br /&gt;
| first3 Simon | last3 Bee&lt;br /&gt;
&lt;br /&gt;
|first4= Rocio | last4= Ruiz-Rodarte&lt;br /&gt;
&lt;br /&gt;
|first4= Rocio | last4= Ruiz-Rodarte&lt;br /&gt;
&lt;br /&gt;
4 Rocio | last 4 Ruiz-Rodarte&lt;br /&gt;
&lt;br /&gt;
|first5= Ruth | last5= Aylett&lt;br /&gt;
&lt;br /&gt;
|first5= Ruth | last5= Aylett&lt;br /&gt;
&lt;br /&gt;
| first5 Ruth | last 5 Aylett&lt;br /&gt;
&lt;br /&gt;
|title= On the use of Virtual Animals with Artificial Fear in Virtual Environments&lt;br /&gt;
&lt;br /&gt;
|title= On the use of Virtual Animals with Artificial Fear in Virtual Environments&lt;br /&gt;
&lt;br /&gt;
论虚拟动物在虚拟环境中的人为恐惧&lt;br /&gt;
&lt;br /&gt;
|journal= New Generation Computing&lt;br /&gt;
&lt;br /&gt;
|journal= New Generation Computing&lt;br /&gt;
&lt;br /&gt;
| 杂志新一代计算&lt;br /&gt;
&lt;br /&gt;
|volume=25 |issue=2 |pages= 145–169&lt;br /&gt;
&lt;br /&gt;
|volume=25 |issue=2 |pages= 145–169&lt;br /&gt;
&lt;br /&gt;
第25卷，第2期，第145-169页&lt;br /&gt;
&lt;br /&gt;
|date=2007&lt;br /&gt;
&lt;br /&gt;
|date=2007&lt;br /&gt;
&lt;br /&gt;
2007年&lt;br /&gt;
&lt;br /&gt;
|doi= 10.1007/s00354-007-0009-5}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
|doi= 10.1007/s00354-007-0009-5}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
| doi 10.1007 / s00354-007-0009-5} / ref&lt;br /&gt;
&lt;br /&gt;
extended the basic model to incorporate the effects of fear. Olfaction was used to transmit emotion between animals, through pheromones modelled as particles in a free expansion gas. Hartman and Benes&amp;lt;ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
extended the basic model to incorporate the effects of fear. Olfaction was used to transmit emotion between animals, through pheromones modelled as particles in a free expansion gas. Hartman and Benes&amp;lt;ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{cite journal&lt;br /&gt;
&lt;br /&gt;
{{cite journal&lt;br /&gt;
&lt;br /&gt;
{引用期刊&lt;br /&gt;
&lt;br /&gt;
|first1= Christopher | last1= Hartman&lt;br /&gt;
&lt;br /&gt;
|first1= Christopher | last1= Hartman&lt;br /&gt;
&lt;br /&gt;
1 Christopher | last 1 Hartman&lt;br /&gt;
&lt;br /&gt;
|first2= Bedr̆ich |last2= Benes̆&lt;br /&gt;
&lt;br /&gt;
|first2= Bedr̆ich |last2= Benes̆&lt;br /&gt;
&lt;br /&gt;
|first2= Bedr̆ich |last2= Benes̆&lt;br /&gt;
&lt;br /&gt;
|title= Autonomous boids&lt;br /&gt;
&lt;br /&gt;
|title= Autonomous boids&lt;br /&gt;
&lt;br /&gt;
标题自主 boids&lt;br /&gt;
&lt;br /&gt;
|journal= Computer Animation and Virtual Worlds&lt;br /&gt;
&lt;br /&gt;
|journal= Computer Animation and Virtual Worlds&lt;br /&gt;
&lt;br /&gt;
计算机动画与虚拟世界&lt;br /&gt;
&lt;br /&gt;
|volume=17 |issue=3–4 |pages= 199–206&lt;br /&gt;
&lt;br /&gt;
|volume=17 |issue=3–4 |pages= 199–206&lt;br /&gt;
&lt;br /&gt;
第17卷第3-4期，第199-206页&lt;br /&gt;
&lt;br /&gt;
|date=July 2006&lt;br /&gt;
&lt;br /&gt;
|date=July 2006&lt;br /&gt;
&lt;br /&gt;
2006年7月&lt;br /&gt;
&lt;br /&gt;
|doi= 10.1002/cav.123}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
|doi= 10.1002/cav.123}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
10.1002 / cav. 123} / ref&lt;br /&gt;
&lt;br /&gt;
introduced a complementary force to the alignment that they call the change of leadership. This steer defines the chance of the boid to become a leader and try to escape.&lt;br /&gt;
&lt;br /&gt;
introduced a complementary force to the alignment that they call the change of leadership. This steer defines the chance of the boid to become a leader and try to escape.&lt;br /&gt;
&lt;br /&gt;
该基本模型自雷诺兹提出以来，已用多种方法扩展。例如，Delgado-Mata 等人扩展基本模型以加入恐惧的影响。利过一种可用自由膨胀气体中的粒子模拟的信息素，动物间用嗅觉来传递情感。'''哈特曼 Hartman'''和'''贝内斯 Benes'''为定位过程引入了一种补充力量，他们称之为领导权的更迭。这条决定了某只鸟成为领导者及试图逃跑的机会。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The movement of Boids can be characterized as either chaotic (splitting groups and wild behaviour) or orderly. Unexpected behaviours, such as splitting flocks and reuniting after avoiding obstacles, can be considered emergent.&lt;br /&gt;
&lt;br /&gt;
The movement of Boids can be characterized as either chaotic (splitting groups and wild behaviour) or orderly. Unexpected behaviours, such as splitting flocks and reuniting after avoiding obstacles, can be considered emergent.&lt;br /&gt;
&lt;br /&gt;
Boids 的运动可以表现为混乱（分裂的群体和狂野的行为）或有序。意想不到的行为，比如群体分散和避开障碍后的团聚可以被认为是应急的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The boids framework is often used in computer graphics, providing realistic-looking representations of flocks of birds and other creatures, such as schools of fish or herds of animals. It was for instance used in the 1998 video game ''[[Half-Life (video game)|Half-Life]]'' for the flying bird-like creatures seen at the end of the game on [[Locations of Half-Life#Xen|Xen]], named &amp;quot;boid&amp;quot; in the game files.&lt;br /&gt;
&lt;br /&gt;
The boids framework is often used in computer graphics, providing realistic-looking representations of flocks of birds and other creatures, such as schools of fish or herds of animals. It was for instance used in the 1998 video game Half-Life for the flying bird-like creatures seen at the end of the game on Xen, named &amp;quot;boid&amp;quot; in the game files.&lt;br /&gt;
&lt;br /&gt;
Boids 框架通常用于计算机图形学，提供鸟群和其他生物（如鱼群）的逼真表现。例如，在1998年的视频游戏《'''半条命 Half-Life'''》中，Xen&amp;lt;s&amp;gt;（游戏文件中命名为“ boid”）&amp;lt;/s&amp;gt;中游戏结束时出现的类似鸟类的飞行生物就使用了该框架&amp;lt;font color='blue'&amp;gt;（游戏文件中命名为“ boid”）&amp;lt;/font&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
 --[[用户:Dorr|Dorr]]（[[用户讨论:Dorr|讨论]]）存疑&lt;br /&gt;
&lt;br /&gt;
The Boids model can be used for direct control and stabilization of teams of simple Unmanned Ground Vehicles (UGV)&amp;lt;ref&amp;gt;{{cite conference |title= Design and analysis of Group Escape Behavior for distributed autonomous mobile robots  |first1= Hongkyu |last1= Min  |first2= Zhidong |last2= Wang |year= 2011 |conference= IEEE International Conference on Robotics and Automation (ICRA)|doi= 10.1109/ICRA.2011.5980123 }}&amp;lt;/ref&amp;gt; or [[Micro air vehicle|Micro Aerial Vehicles]] (MAV)&amp;lt;ref&amp;gt;{{cite conference |title= Swarms of micro aerial vehicles stabilized under a visual relative localization  |first1= Martin |last1= Saska |first2= Vakula |last2= Jan |first3= Preucil |last3= Libor |year= 2014 |conference= IEEE International Conference on Robotics and Automation (ICRA)|doi= 10.1109/ICRA.2014.6907374 }}&amp;lt;/ref&amp;gt; in [[swarm robotics]]. For stabilization of heterogeneous UAV-UGV teams, the model was adapted for using onboard relative localization by Saska et&amp;amp;nbsp;al.&amp;lt;ref&amp;gt;{{cite conference |title= Coordination and Navigation of Heterogeneous UAVs-UGVs Teams Localized by a Hawk-Eye Approach  |first1= Martin |last1= Saska |first2= Vonasek |last2= Vojtech |first3= Krajnik |last3= Tomas |first4= Preucil |last4= Libor |year= 2012 |conference= IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)|url=http://labe.felk.cvut.cz/~tkrajnik/ardrone/articles/formace.pdf}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The Boids model can be used for direct control and stabilization of teams of simple Unmanned Ground Vehicles (UGV) or Micro Aerial Vehicles (MAV) in swarm robotics. For stabilization of heterogeneous UAV-UGV teams, the model was adapted for using onboard relative localization by Saska et&amp;amp;nbsp;al.&lt;br /&gt;
&lt;br /&gt;
Boids 模型可用于'''[[集群机器人]] Swarm Robotics'''中简单的无人地面车辆（UGV）或'''微型飞行器 Micro Aerial Vehicles'''（MAV）群体的直接控制和稳定。为了&amp;lt;s&amp;gt;稳定&amp;lt;/s&amp;gt;异质 UAV-UGV &amp;lt;s&amp;gt;团队&amp;lt;/s&amp;gt;&amp;lt;font color='blue'&amp;gt;群体的稳定性&amp;lt;/font&amp;gt;，Saska 等人将该模型用于板载相对定位。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
At the time of proposal, Reynolds' approach represented a giant step forward compared to the traditional techniques used in computer animation for motion pictures. The first animation created with the model was ''[[Stanley and Stella in: Breaking the Ice]]'' (1987), followed by a feature film debut in [[Tim Burton]]'s film ''[[Batman Returns]]'' (1992) with computer generated bat swarms and armies of penguins marching through the streets of Gotham City.&amp;lt;ref&amp;gt;{{cite journal | url=http://lrss.fri.uni-lj.si/people/ilbajec/papers/ilb_ab09.pdf | last1=Lebar Bajec |first1= Iztok |first2=  Frank H. |last2= Heppner | date=2009 | title=Organized flight in birds | journal=Animal Behaviour | volume = 78 | issue = 4 | pages = 777–789 | doi = 10.1016/j.anbehav.2009.07.007 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
At the time of proposal, Reynolds' approach represented a giant step forward compared to the traditional techniques used in computer animation for motion pictures. The first animation created with the model was Stanley and Stella in: Breaking the Ice (1987), followed by a feature film debut in Tim Burton's film Batman Returns (1992) with computer generated bat swarms and armies of penguins marching through the streets of Gotham City.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
在当时提出时，雷诺兹的方法相比于传统的计算机动画电影技术是一个巨大的进步。第一部利用了此模型的动画片是《'''史丹利和史黛拉: 破冰 Stanley and Stella in: Breaking The Ice'''》（1987），之后是'''蒂姆·伯顿 Tim Burton'''的故事片《'''蝙蝠侠归来 Batman Returns'''》（1992），电脑合成的蝙蝠群和成群的企鹅行进穿过'''哥谭市 Gotham City'''的街道。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The boids model has been used for other interesting applications. It has been applied to automatically program Internet multi-channel radio stations.&amp;lt;ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The boids model has been used for other interesting applications. It has been applied to automatically program Internet multi-channel radio stations.&amp;lt;ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{cite conference&lt;br /&gt;
&lt;br /&gt;
{{cite conference&lt;br /&gt;
&lt;br /&gt;
{引用会议&lt;br /&gt;
&lt;br /&gt;
| title         = DJ-boids: emergent collective behavior as multichannel radio station programming&lt;br /&gt;
&lt;br /&gt;
| title         = DJ-boids: emergent collective behavior as multichannel radio station programming&lt;br /&gt;
&lt;br /&gt;
多频道电台节目中的紧急集体行为&lt;br /&gt;
&lt;br /&gt;
| first1 = Jesús | last1 = Ibáñez&lt;br /&gt;
&lt;br /&gt;
| first1 = Jesús | last1 = Ibáñez&lt;br /&gt;
&lt;br /&gt;
| first1 = Jesús | last1 = Ibáñez&lt;br /&gt;
&lt;br /&gt;
| first2 = Antonio F. | last2 = Gómez-Skarmeta	&lt;br /&gt;
&lt;br /&gt;
| first2 = Antonio F. | last2 = Gómez-Skarmeta	&lt;br /&gt;
&lt;br /&gt;
| first2 = Antonio F. | last2 = Gómez-Skarmeta&lt;br /&gt;
&lt;br /&gt;
| first3 = Josep | last3 = Blat&lt;br /&gt;
&lt;br /&gt;
| first3 = Josep | last3 = Blat&lt;br /&gt;
&lt;br /&gt;
| first3 = Josep | last3 = Blat&lt;br /&gt;
&lt;br /&gt;
| date          = 2003&lt;br /&gt;
&lt;br /&gt;
| date          = 2003&lt;br /&gt;
&lt;br /&gt;
2003年&lt;br /&gt;
&lt;br /&gt;
| booktitle     = Proceedings of the 8th international conference on Intelligent User Interfaces&lt;br /&gt;
&lt;br /&gt;
| booktitle     = Proceedings of the 8th international conference on Intelligent User Interfaces&lt;br /&gt;
&lt;br /&gt;
第八届智能用户界面国际会议论文集&lt;br /&gt;
&lt;br /&gt;
| pages         = 248–250&lt;br /&gt;
&lt;br /&gt;
| pages         = 248–250&lt;br /&gt;
&lt;br /&gt;
第248-250页&lt;br /&gt;
&lt;br /&gt;
| doi           = 10.1145/604045.604089&lt;br /&gt;
&lt;br /&gt;
| doi           = 10.1145/604045.604089&lt;br /&gt;
&lt;br /&gt;
10.1145 / 604045.604089&lt;br /&gt;
&lt;br /&gt;
}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
{} / ref&lt;br /&gt;
&lt;br /&gt;
It has also been used for visualizing information&amp;lt;ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
It has also been used for visualizing information&amp;lt;ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{cite conference&lt;br /&gt;
&lt;br /&gt;
{{cite conference&lt;br /&gt;
&lt;br /&gt;
{引用会议&lt;br /&gt;
&lt;br /&gt;
| title         = Time-Varying Data Visualization Using Information Flocking Boids&lt;br /&gt;
&lt;br /&gt;
| title         = Time-Varying Data Visualization Using Information Flocking Boids&lt;br /&gt;
&lt;br /&gt;
使用信息植群的时变数据可视化&lt;br /&gt;
&lt;br /&gt;
| last = Moere | first = A V&lt;br /&gt;
&lt;br /&gt;
| last = Moere | first = A V&lt;br /&gt;
&lt;br /&gt;
最后一个 Moere | 第一个 a v&lt;br /&gt;
&lt;br /&gt;
| date          = 2004&lt;br /&gt;
&lt;br /&gt;
| date          = 2004&lt;br /&gt;
&lt;br /&gt;
2004年&lt;br /&gt;
&lt;br /&gt;
| booktitle     = Proceedings of the IEEE Symposium on Information Visualization&lt;br /&gt;
&lt;br /&gt;
| booktitle     = Proceedings of the IEEE Symposium on Information Visualization&lt;br /&gt;
&lt;br /&gt;
美国电气和电子工程师学会信息可视化研讨会论文集&lt;br /&gt;
&lt;br /&gt;
| pages         = 97–104&lt;br /&gt;
&lt;br /&gt;
| pages         = 97–104&lt;br /&gt;
&lt;br /&gt;
第97-104页&lt;br /&gt;
&lt;br /&gt;
| doi           = 10.1109/INFVIS.2004.65&lt;br /&gt;
&lt;br /&gt;
| doi           = 10.1109/INFVIS.2004.65&lt;br /&gt;
&lt;br /&gt;
10.1109 / INFVIS. 2004.65&lt;br /&gt;
&lt;br /&gt;
}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
{} / ref&lt;br /&gt;
&lt;br /&gt;
and for optimization tasks.&amp;lt;ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
and for optimization tasks.&amp;lt;ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{cite journal&lt;br /&gt;
&lt;br /&gt;
{{cite journal&lt;br /&gt;
&lt;br /&gt;
{引用期刊&lt;br /&gt;
&lt;br /&gt;
|first1 = Zhihua | last1 = Cui&lt;br /&gt;
&lt;br /&gt;
|first1 = Zhihua | last1 = Cui&lt;br /&gt;
&lt;br /&gt;
最新一期崔&lt;br /&gt;
&lt;br /&gt;
|first2 = Zhongzhi | last2 = Shi&lt;br /&gt;
&lt;br /&gt;
|first2 = Zhongzhi | last2 = Shi&lt;br /&gt;
&lt;br /&gt;
|first2 = Zhongzhi | last2 = Shi&lt;br /&gt;
&lt;br /&gt;
|title= Boid particle swarm optimisation&lt;br /&gt;
&lt;br /&gt;
|title= Boid particle swarm optimisation&lt;br /&gt;
&lt;br /&gt;
博伊德粒子群优化&lt;br /&gt;
&lt;br /&gt;
|journal= International Journal of Innovative Computing and Applications&lt;br /&gt;
&lt;br /&gt;
|journal= International Journal of Innovative Computing and Applications&lt;br /&gt;
&lt;br /&gt;
国际创新计算与应用杂志&lt;br /&gt;
&lt;br /&gt;
|volume=2 |issue=2 |pages= 77–85&lt;br /&gt;
&lt;br /&gt;
|volume=2 |issue=2 |pages= 77–85&lt;br /&gt;
&lt;br /&gt;
第二期，第77-85页&lt;br /&gt;
&lt;br /&gt;
|date=2009&lt;br /&gt;
&lt;br /&gt;
|date=2009&lt;br /&gt;
&lt;br /&gt;
2009年&lt;br /&gt;
&lt;br /&gt;
|doi= 10.1504/IJICA.2009.031778}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
|doi= 10.1504/IJICA.2009.031778}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
| doi 10.1504 / IJICA. 2009.031778} / ref&lt;br /&gt;
&lt;br /&gt;
Boids 模型已经被用于其他有趣应用。该系统已应用于互联网多频道广播电台的自动节目编排，以及可视化信息和优化任务。&lt;br /&gt;
&lt;br /&gt;
==See also 参见==&lt;br /&gt;
&lt;br /&gt;
*[[Swarm intelligence]] 群体智能&lt;br /&gt;
&lt;br /&gt;
*[[Collective cell migration]] 集体细胞迁移&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==References 参考资料==&lt;br /&gt;
&lt;br /&gt;
{{Reflist}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==External links 外部链接==&lt;br /&gt;
&lt;br /&gt;
* [http://www.red3d.com/cwr/boids/ Craig Reynolds' Boids page]&lt;br /&gt;
&lt;br /&gt;
* [http://www.vergenet.net/~conrad/boids/pseudocode.html Explanation of algorithm in pseudocode]&lt;br /&gt;
&lt;br /&gt;
* [https://gpolo.github.com/birdflocking JavaScript implementation]&lt;br /&gt;
&lt;br /&gt;
*[https://lufemas.github.io/boid-ai-implementation/ JavaScript implementation with Phaser Framework]&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20080205014305/http://www.navgen.com/3d_boids/ 3D Boids Simulation using OpenGL, used by the BBC's Natural History Unit]&lt;br /&gt;
&lt;br /&gt;
*[https://black-square.github.io/BirdFlock/ Live In-Browser 3D Simulation of Bird Flocking Behavior in Unity3D] – Open Source implementation for Windows, Linux and Mac&lt;br /&gt;
&lt;br /&gt;
* [https://github.com/piskvorky/PredatorPrey UNIX+Windows open source implementation in C++, using OpenGL and simulation controls]&lt;br /&gt;
&lt;br /&gt;
* [https://github.com/tofti/javafx-boids A java implementation using the javafx API]&lt;br /&gt;
&lt;br /&gt;
*GLSchool - part of [[XScreenSaver]] software&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{collective animal behaviour}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
===[https://campus.swarma.org/ 集智学园]课程：[https://campus.swarma.org/course/1104 透过人工鸟群Boid模型学习List的使用]===&lt;br /&gt;
&lt;br /&gt;
讲师：[[张江]](北师大系统科学学院教授、博士生导师，集智俱乐部、集智学园创始人。)&lt;br /&gt;
&lt;br /&gt;
本课程通过数个案例教会大家如何去动手搭建一个多主体仿真模型，以及如何利用NetLogo去实现。从生命游戏到人工鸟群，从模拟经济系统到病毒沿网络的传播，通过循序渐进的案例，该课程带你逐步走入NetLogo多主体建模的神奇世界。&lt;br /&gt;
&lt;br /&gt;
===[https://swarma.org/ 集智俱乐部]扩展阅读：[https://swarma.org/?p=16504 张江：乌合之众还是群智涌现？鸟群知道答案]===&lt;br /&gt;
&lt;br /&gt;
生命如何起源，智能如何涌现，因果如何反转，复杂谜题，引人深思。2019年7月13日，集智俱乐部创始人[[张江]]教授在混沌大学授课，详细解读了复杂系统中的混沌、涌现与进化，此文整理自课堂内容。&lt;br /&gt;
&lt;br /&gt;
===[https://v.qq.com/x/page/z13491sn7fy.html 动画片《Stanley and Stella in: Breaking the Ice (1987)》]===&lt;br /&gt;
&lt;br /&gt;
Craig Reynolds 与 Symbolics Graphics 和 Whitney / Demos Production 的同事合作制作的利用 boids 模型的小短片，讲述了飞鸟与鱼相爱，鸟儿冲破冰面与鱼相见的故事。影片最早于87年在 SIGGRAPH 电子剧院展出。&lt;br /&gt;
&lt;br /&gt;
 --[[用户:Dorr|Dorr]]（[[用户讨论:Dorr|讨论]]）补充自http://www.red3d.com/cwr/boids/：In cooperation with many coworkers at the Symbolics Graphics Division and Whitney / Demos Productions, we made an animated short featuring the boids model called Stanley and Stella in: Breaking the Ice. This film was first shown at the Electronic Theater at SIGGRAPH '87.&lt;br /&gt;
&lt;br /&gt;
[[Category:Artificial life]]&lt;br /&gt;
&lt;br /&gt;
Category:Artificial life&lt;br /&gt;
&lt;br /&gt;
类别: 人工生命&lt;br /&gt;
&lt;br /&gt;
[[Category:1986 software]]&lt;br /&gt;
&lt;br /&gt;
Category:1986 software&lt;br /&gt;
&lt;br /&gt;
类别: 1986软件&lt;br /&gt;
&lt;br /&gt;
&amp;lt;noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;small&amp;gt;This page was moved from [[wikipedia:en:Boids]]. Its edit history can be viewed at [[鸟群算法/edithistory]]&amp;lt;/small&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:待整理页面]]&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E9%B8%9F%E7%BE%A4%E7%AE%97%E6%B3%95&amp;diff=11462</id>
		<title>鸟群算法</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E9%B8%9F%E7%BE%A4%E7%AE%97%E6%B3%95&amp;diff=11462"/>
		<updated>2020-08-02T02:10:08Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。&lt;br /&gt;
&lt;br /&gt;
{{short description|Artificial life program, developed by Craig Reynolds in 1986, which simulates the flocking behaviour of birds}}&lt;br /&gt;
&lt;br /&gt;
{{Use mdy dates|date=July 2011}}&lt;br /&gt;
&lt;br /&gt;
{{for|the reptilian family|Boidae}}&lt;br /&gt;
&lt;br /&gt;
[[File:Boids OpenGL example.webm|thumb|A Boids example created in [[OpenGL]]]]&lt;br /&gt;
&lt;br /&gt;
A Boids example created in [[OpenGL]]&lt;br /&gt;
&lt;br /&gt;
在[[[ OpenGL ]]中创建的 Boids 示例&lt;br /&gt;
&lt;br /&gt;
'''Boids''' is an [[artificial life]] program, developed by [[Craig Reynolds (computer graphics)|Craig Reynolds]] in 1986, which simulates the [[Flocking (behavior)|flocking]] behaviour of [[Bird|birds]]. His paper on this topic was published in 1987 in the proceedings of the [[Association for Computing Machinery|ACM]] [[SIGGRAPH]] conference. &amp;lt;ref&amp;gt;{{Cite book&lt;br /&gt;
&lt;br /&gt;
Boids is an artificial life program, developed by Craig Reynolds in 1986, which simulates the flocking behaviour of birds. His paper on this topic was published in 1987 in the proceedings of the ACM SIGGRAPH conference. &amp;lt;ref&amp;gt;{{Cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 | last1=Reynolds&lt;br /&gt;
&lt;br /&gt;
 | last1=Reynolds&lt;br /&gt;
&lt;br /&gt;
最后1雷诺&lt;br /&gt;
&lt;br /&gt;
 | first1=Craig&lt;br /&gt;
&lt;br /&gt;
 | first1=Craig&lt;br /&gt;
&lt;br /&gt;
第一名: 克雷格&lt;br /&gt;
&lt;br /&gt;
 | author1-link=Craig Reynolds (computer_graphics)&lt;br /&gt;
&lt;br /&gt;
 | author1-link=Craig Reynolds (computer_graphics)&lt;br /&gt;
&lt;br /&gt;
| author1-link Craig Reynolds (计算机图形学)&lt;br /&gt;
&lt;br /&gt;
 | title=Flocks, herds and schools: A distributed behavioral model.&lt;br /&gt;
&lt;br /&gt;
 | title=Flocks, herds and schools: A distributed behavioral model.&lt;br /&gt;
&lt;br /&gt;
羊群、畜群和学校: 一个分布式的行为模型。&lt;br /&gt;
&lt;br /&gt;
 | year=1987&lt;br /&gt;
&lt;br /&gt;
 | year=1987&lt;br /&gt;
&lt;br /&gt;
1987年&lt;br /&gt;
&lt;br /&gt;
 | number=&lt;br /&gt;
&lt;br /&gt;
 | number=&lt;br /&gt;
&lt;br /&gt;
数字&lt;br /&gt;
&lt;br /&gt;
 | journal=SIGGRAPH '87: Proceedings of the 14th Annual Conference on Computer Graphics and Interactive Techniques&lt;br /&gt;
&lt;br /&gt;
 | journal=SIGGRAPH '87: Proceedings of the 14th Annual Conference on Computer Graphics and Interactive Techniques&lt;br /&gt;
&lt;br /&gt;
87: 第14届计算机图形学与互动技术年度会议论文集&lt;br /&gt;
&lt;br /&gt;
 | publisher=[[Association for Computing Machinery]]&lt;br /&gt;
&lt;br /&gt;
 | publisher=Association for Computing Machinery&lt;br /&gt;
&lt;br /&gt;
| 出版商计算机协会&lt;br /&gt;
&lt;br /&gt;
 | pages=25–34&lt;br /&gt;
&lt;br /&gt;
 | pages=25–34&lt;br /&gt;
&lt;br /&gt;
第25-34页&lt;br /&gt;
&lt;br /&gt;
 | isbn=978-0-89791-227-3&lt;br /&gt;
&lt;br /&gt;
 | isbn=978-0-89791-227-3&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-89791-227-3]&lt;br /&gt;
&lt;br /&gt;
 | doi=10.1145/37401.37406&lt;br /&gt;
&lt;br /&gt;
 | doi=10.1145/37401.37406&lt;br /&gt;
&lt;br /&gt;
10.1145 / 37401.37406&lt;br /&gt;
&lt;br /&gt;
| citeseerx=10.1.1.103.7187&lt;br /&gt;
&lt;br /&gt;
| citeseerx=10.1.1.103.7187&lt;br /&gt;
&lt;br /&gt;
10.1.1.103.7187&lt;br /&gt;
&lt;br /&gt;
 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
{} / ref&lt;br /&gt;
&lt;br /&gt;
The name &amp;quot;boid&amp;quot; corresponds to a shortened version of &amp;quot;bird-oid object&amp;quot;, which refers to a bird-like object.&amp;lt;ref&amp;gt;{{Cite journal&lt;br /&gt;
&lt;br /&gt;
The name &amp;quot;boid&amp;quot; corresponds to a shortened version of &amp;quot;bird-oid object&amp;quot;, which refers to a bird-like object.&amp;lt;ref&amp;gt;{{Cite journal&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 | last1=Banks&lt;br /&gt;
&lt;br /&gt;
 | last1=Banks&lt;br /&gt;
&lt;br /&gt;
1 Banks&lt;br /&gt;
&lt;br /&gt;
 | first1=Alec&lt;br /&gt;
&lt;br /&gt;
 | first1=Alec&lt;br /&gt;
&lt;br /&gt;
首先 Alec&lt;br /&gt;
&lt;br /&gt;
 | last2=Vincent&lt;br /&gt;
&lt;br /&gt;
 | last2=Vincent&lt;br /&gt;
&lt;br /&gt;
最后2文森特&lt;br /&gt;
&lt;br /&gt;
 | first2=Jonathan&lt;br /&gt;
&lt;br /&gt;
 | first2=Jonathan&lt;br /&gt;
&lt;br /&gt;
第二名: 乔纳森&lt;br /&gt;
&lt;br /&gt;
 | last3=Anyakoha&lt;br /&gt;
&lt;br /&gt;
 | last3=Anyakoha&lt;br /&gt;
&lt;br /&gt;
3 / lastanyakoha&lt;br /&gt;
&lt;br /&gt;
 | first3=Chukwudi&lt;br /&gt;
&lt;br /&gt;
 | first3=Chukwudi&lt;br /&gt;
&lt;br /&gt;
| first3 Chukwudi&lt;br /&gt;
&lt;br /&gt;
 | title=A review of particle swarm optimization. Part I: background and development&lt;br /&gt;
&lt;br /&gt;
 | title=A review of particle swarm optimization. Part I: background and development&lt;br /&gt;
&lt;br /&gt;
2012年10月12日 | 标题: 粒子群优化的回顾。第一部分: 背景与发展&lt;br /&gt;
&lt;br /&gt;
 |date=July 2007&lt;br /&gt;
&lt;br /&gt;
 |date=July 2007&lt;br /&gt;
&lt;br /&gt;
2007年7月&lt;br /&gt;
&lt;br /&gt;
 | journal=Natural Computing&lt;br /&gt;
&lt;br /&gt;
 | journal=Natural Computing&lt;br /&gt;
&lt;br /&gt;
自然计算杂志&lt;br /&gt;
&lt;br /&gt;
 | volume=6&lt;br /&gt;
&lt;br /&gt;
 | volume=6&lt;br /&gt;
&lt;br /&gt;
第六卷&lt;br /&gt;
&lt;br /&gt;
 | issue=4&lt;br /&gt;
&lt;br /&gt;
 | issue=4&lt;br /&gt;
&lt;br /&gt;
第四期&lt;br /&gt;
&lt;br /&gt;
 | pages=467–484&lt;br /&gt;
&lt;br /&gt;
 | pages=467–484&lt;br /&gt;
&lt;br /&gt;
第467-484页&lt;br /&gt;
&lt;br /&gt;
 | doi=10.1007/s11047-007-9049-5&lt;br /&gt;
&lt;br /&gt;
 | doi=10.1007/s11047-007-9049-5&lt;br /&gt;
&lt;br /&gt;
10.1007 / s11047-007-9049-5&lt;br /&gt;
&lt;br /&gt;
| citeseerx=10.1.1.605.5879&lt;br /&gt;
&lt;br /&gt;
| citeseerx=10.1.1.605.5879&lt;br /&gt;
&lt;br /&gt;
10.1.1.605.5879&lt;br /&gt;
&lt;br /&gt;
 }}&amp;lt;/ref&amp;gt; Incidentally, &amp;quot;boid&amp;quot; is also a New York Metropolitan dialect pronunciation for &amp;quot;bird&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
 }}&amp;lt;/ref&amp;gt; Incidentally, &amp;quot;boid&amp;quot; is also a New York Metropolitan dialect pronunciation for &amp;quot;bird&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
} / ref &lt;br /&gt;
'''鸟群算法 Boids'''是模拟鸟类群集行为的人工生命项目，由'''克雷格·雷诺兹 Craig Reynolds'''于1986年开发。该模型基于常用于计算机动画或计算机辅助设计的计算机三维几何。他关于这个主题的论文发表在1987年的 ACM SIGGRAPH（美国计算机协会计算机图形专业组组织的计算机图形学顶级年度会议）会议记录上。“ boid”是“ bird-oid object”的缩写，指一个类鸟对象。恰巧，“boid”也是纽约都市方言中“bird”的发音。&lt;br /&gt;
&lt;br /&gt;
 --[[用户:Dorr|Dorr]]（[[用户讨论:Dorr|讨论]]）补充自http://www.red3d.com/cwr/boids/：It was based on three dimensional computational geometry of the sort normally used in computer animation or computer aided design.&lt;br /&gt;
&lt;br /&gt;
{{multiple image|direction=vertical|image1=Rule separation.gif|caption1=Separation|image2=Rule alignment.gif|caption2=Alignment|image3=Rule cohesion.gif|caption3=Cohesion|header=Rules applied in simple Boids}}&lt;br /&gt;
&lt;br /&gt;
As with most artificial life simulations, Boids is an example of [[emergence|emergent]] behavior; that is, the complexity of Boids arises from the interaction of individual agents (the boids, in this case) adhering to a set of simple rules.  The rules applied in the simplest Boids world are as follows:&lt;br /&gt;
&lt;br /&gt;
As with most artificial life simulations, Boids is an example of emergent behavior; that is, the complexity of Boids arises from the interaction of individual agents (the boids, in this case) adhering to a set of simple rules.  The rules applied in the simplest Boids world are as follows:&lt;br /&gt;
&lt;br /&gt;
与大多数人工生命模拟一样，Boids 是'''涌现 Emergent'''行为的一个例子; 也就是说，Boids 的复杂性来自于遵循一系列简单规则的个体代理（这里是 Boids）的相互作用。在最简单的Bolds 世界中适用的规则如下，其描述了鸟群中的个体如何根据周边同伴的位置和速度移动:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* '''separation''': [[wikt:steer#Verb 2|steer]] to avoid crowding local flockmates&lt;br /&gt;
&lt;br /&gt;
* '''alignment''': steer towards the average heading of local flockmates&lt;br /&gt;
&lt;br /&gt;
* '''cohesion''': steer to move towards the average position (center of mass) of local flockmates&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* '''分离 Separation''': 移动以避开群体拥挤处&lt;br /&gt;
&lt;br /&gt;
* '''对齐 Alignment''': 转向群体的平均航向&lt;br /&gt;
&lt;br /&gt;
* '''靠近 Cohesion''': 朝群体的平均位置（质心）移动&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
每个 boid 个体都可以得知整体的几何参数，但群体要求其只对其周围某个小邻近范围作出反应。该邻近范围由一个距离（从该个体的中心算起）和一个角度（从其飞行方向算起）决定。此范围外的同伴不予考虑。该临近范围可以认为是一个有限知觉的模型（就像浑浊的水中的鱼一样）；但更恰当的想法可能是，其定义了鸟群影响了个体转向的区域范围。&lt;br /&gt;
&lt;br /&gt;
 --[[用户:Dorr|Dorr]]（[[用户讨论:Dorr|讨论]]）补充自http://www.red3d.com/cwr/boids/：Each boid has direct access to the whole scene's geometric description, but flocking requires that it reacts only to flockmates within a certain small neighborhood around itself. The neighborhood is characterized by a distance (measured from the center of the boid) and an angle, measured from the boid's direction of flight. Flockmates outside this local neighborhood are ignored. The neighborhood could be considered a model of limited perception (as by fish in murky water) but it is probably more correct to think of it as defining the region in which flockmates influence a boids steering.&lt;br /&gt;
&lt;br /&gt;
More complex rules can be added, such as obstacle avoidance and goal seeking.&lt;br /&gt;
&lt;br /&gt;
More complex rules can be added, such as obstacle avoidance and goal seeking.&lt;br /&gt;
&lt;br /&gt;
可以添加更复杂的规则，如避障和寻找目标。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The basic model has been extended in several different ways since Reynolds proposed it. For instance, Delgado-Mata et&amp;amp;nbsp;al.&amp;lt;ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The basic model has been extended in several different ways since Reynolds proposed it. For instance, Delgado-Mata et&amp;amp;nbsp;al.&amp;lt;ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{cite journal&lt;br /&gt;
&lt;br /&gt;
{{cite journal&lt;br /&gt;
&lt;br /&gt;
{引用期刊&lt;br /&gt;
&lt;br /&gt;
|first1= Carlos | last1= Delgado-Mata&lt;br /&gt;
&lt;br /&gt;
|first1= Carlos | last1= Delgado-Mata&lt;br /&gt;
&lt;br /&gt;
卡洛斯，德尔加多，马塔&lt;br /&gt;
&lt;br /&gt;
|first2= Jesus Ibanez | last2= Martinez&lt;br /&gt;
&lt;br /&gt;
|first2= Jesus Ibanez | last2= Martinez&lt;br /&gt;
&lt;br /&gt;
2 Jesus Ibanez | last 2 Martinez&lt;br /&gt;
&lt;br /&gt;
|first3= Simon | last3= Bee&lt;br /&gt;
&lt;br /&gt;
|first3= Simon | last3= Bee&lt;br /&gt;
&lt;br /&gt;
| first3 Simon | last3 Bee&lt;br /&gt;
&lt;br /&gt;
|first4= Rocio | last4= Ruiz-Rodarte&lt;br /&gt;
&lt;br /&gt;
|first4= Rocio | last4= Ruiz-Rodarte&lt;br /&gt;
&lt;br /&gt;
4 Rocio | last 4 Ruiz-Rodarte&lt;br /&gt;
&lt;br /&gt;
|first5= Ruth | last5= Aylett&lt;br /&gt;
&lt;br /&gt;
|first5= Ruth | last5= Aylett&lt;br /&gt;
&lt;br /&gt;
| first5 Ruth | last 5 Aylett&lt;br /&gt;
&lt;br /&gt;
|title= On the use of Virtual Animals with Artificial Fear in Virtual Environments&lt;br /&gt;
&lt;br /&gt;
|title= On the use of Virtual Animals with Artificial Fear in Virtual Environments&lt;br /&gt;
&lt;br /&gt;
论虚拟动物在虚拟环境中的人为恐惧&lt;br /&gt;
&lt;br /&gt;
|journal= New Generation Computing&lt;br /&gt;
&lt;br /&gt;
|journal= New Generation Computing&lt;br /&gt;
&lt;br /&gt;
| 杂志新一代计算&lt;br /&gt;
&lt;br /&gt;
|volume=25 |issue=2 |pages= 145–169&lt;br /&gt;
&lt;br /&gt;
|volume=25 |issue=2 |pages= 145–169&lt;br /&gt;
&lt;br /&gt;
第25卷，第2期，第145-169页&lt;br /&gt;
&lt;br /&gt;
|date=2007&lt;br /&gt;
&lt;br /&gt;
|date=2007&lt;br /&gt;
&lt;br /&gt;
2007年&lt;br /&gt;
&lt;br /&gt;
|doi= 10.1007/s00354-007-0009-5}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
|doi= 10.1007/s00354-007-0009-5}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
| doi 10.1007 / s00354-007-0009-5} / ref&lt;br /&gt;
&lt;br /&gt;
extended the basic model to incorporate the effects of fear. Olfaction was used to transmit emotion between animals, through pheromones modelled as particles in a free expansion gas. Hartman and Benes&amp;lt;ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
extended the basic model to incorporate the effects of fear. Olfaction was used to transmit emotion between animals, through pheromones modelled as particles in a free expansion gas. Hartman and Benes&amp;lt;ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{cite journal&lt;br /&gt;
&lt;br /&gt;
{{cite journal&lt;br /&gt;
&lt;br /&gt;
{引用期刊&lt;br /&gt;
&lt;br /&gt;
|first1= Christopher | last1= Hartman&lt;br /&gt;
&lt;br /&gt;
|first1= Christopher | last1= Hartman&lt;br /&gt;
&lt;br /&gt;
1 Christopher | last 1 Hartman&lt;br /&gt;
&lt;br /&gt;
|first2= Bedr̆ich |last2= Benes̆&lt;br /&gt;
&lt;br /&gt;
|first2= Bedr̆ich |last2= Benes̆&lt;br /&gt;
&lt;br /&gt;
|first2= Bedr̆ich |last2= Benes̆&lt;br /&gt;
&lt;br /&gt;
|title= Autonomous boids&lt;br /&gt;
&lt;br /&gt;
|title= Autonomous boids&lt;br /&gt;
&lt;br /&gt;
标题自主 boids&lt;br /&gt;
&lt;br /&gt;
|journal= Computer Animation and Virtual Worlds&lt;br /&gt;
&lt;br /&gt;
|journal= Computer Animation and Virtual Worlds&lt;br /&gt;
&lt;br /&gt;
计算机动画与虚拟世界&lt;br /&gt;
&lt;br /&gt;
|volume=17 |issue=3–4 |pages= 199–206&lt;br /&gt;
&lt;br /&gt;
|volume=17 |issue=3–4 |pages= 199–206&lt;br /&gt;
&lt;br /&gt;
第17卷第3-4期，第199-206页&lt;br /&gt;
&lt;br /&gt;
|date=July 2006&lt;br /&gt;
&lt;br /&gt;
|date=July 2006&lt;br /&gt;
&lt;br /&gt;
2006年7月&lt;br /&gt;
&lt;br /&gt;
|doi= 10.1002/cav.123}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
|doi= 10.1002/cav.123}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
10.1002 / cav. 123} / ref&lt;br /&gt;
&lt;br /&gt;
introduced a complementary force to the alignment that they call the change of leadership. This steer defines the chance of the boid to become a leader and try to escape.&lt;br /&gt;
&lt;br /&gt;
introduced a complementary force to the alignment that they call the change of leadership. This steer defines the chance of the boid to become a leader and try to escape.&lt;br /&gt;
&lt;br /&gt;
该基本模型自雷诺兹提出以来，已用多种方法扩展。例如，Delgado-Mata 等人扩展基本模型以加入恐惧的影响。利过一种可用自由膨胀气体中的粒子模拟的信息素，动物间用嗅觉来传递情感。'''哈特曼 Hartman'''和'''贝内斯 Benes'''为定位过程引入了一种补充力量，他们称之为领导权的更迭。这条决定了某只鸟成为领导者及试图逃跑的机会。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The movement of Boids can be characterized as either chaotic (splitting groups and wild behaviour) or orderly. Unexpected behaviours, such as splitting flocks and reuniting after avoiding obstacles, can be considered emergent.&lt;br /&gt;
&lt;br /&gt;
The movement of Boids can be characterized as either chaotic (splitting groups and wild behaviour) or orderly. Unexpected behaviours, such as splitting flocks and reuniting after avoiding obstacles, can be considered emergent.&lt;br /&gt;
&lt;br /&gt;
Boids 的运动可以表现为混乱（分裂的群体和狂野的行为）或有序。意想不到的行为，比如群体分散和避开障碍后的团聚可以被认为是应急的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The boids framework is often used in computer graphics, providing realistic-looking representations of flocks of birds and other creatures, such as schools of fish or herds of animals. It was for instance used in the 1998 video game ''[[Half-Life (video game)|Half-Life]]'' for the flying bird-like creatures seen at the end of the game on [[Locations of Half-Life#Xen|Xen]], named &amp;quot;boid&amp;quot; in the game files.&lt;br /&gt;
&lt;br /&gt;
The boids framework is often used in computer graphics, providing realistic-looking representations of flocks of birds and other creatures, such as schools of fish or herds of animals. It was for instance used in the 1998 video game Half-Life for the flying bird-like creatures seen at the end of the game on Xen, named &amp;quot;boid&amp;quot; in the game files.&lt;br /&gt;
&lt;br /&gt;
Boids 框架通常用于计算机图形学，提供鸟群和其他生物（如鱼群）的逼真表现。例如，在1998年的视频游戏《'''半条命 Half-Life'''》中，Xen&amp;lt;s&amp;gt;（游戏文件中命名为“ boid”）&amp;lt;/s&amp;gt;中游戏结束时出现的类似鸟类的飞行生物就使用了该框架&amp;lt;font color='blue'&amp;gt;（游戏文件中命名为“ boid”）&amp;lt;/font&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
 --[[用户:Dorr|Dorr]]（[[用户讨论:Dorr|讨论]]）存疑&lt;br /&gt;
&lt;br /&gt;
The Boids model can be used for direct control and stabilization of teams of simple Unmanned Ground Vehicles (UGV)&amp;lt;ref&amp;gt;{{cite conference |title= Design and analysis of Group Escape Behavior for distributed autonomous mobile robots  |first1= Hongkyu |last1= Min  |first2= Zhidong |last2= Wang |year= 2011 |conference= IEEE International Conference on Robotics and Automation (ICRA)|doi= 10.1109/ICRA.2011.5980123 }}&amp;lt;/ref&amp;gt; or [[Micro air vehicle|Micro Aerial Vehicles]] (MAV)&amp;lt;ref&amp;gt;{{cite conference |title= Swarms of micro aerial vehicles stabilized under a visual relative localization  |first1= Martin |last1= Saska |first2= Vakula |last2= Jan |first3= Preucil |last3= Libor |year= 2014 |conference= IEEE International Conference on Robotics and Automation (ICRA)|doi= 10.1109/ICRA.2014.6907374 }}&amp;lt;/ref&amp;gt; in [[swarm robotics]]. For stabilization of heterogeneous UAV-UGV teams, the model was adapted for using onboard relative localization by Saska et&amp;amp;nbsp;al.&amp;lt;ref&amp;gt;{{cite conference |title= Coordination and Navigation of Heterogeneous UAVs-UGVs Teams Localized by a Hawk-Eye Approach  |first1= Martin |last1= Saska |first2= Vonasek |last2= Vojtech |first3= Krajnik |last3= Tomas |first4= Preucil |last4= Libor |year= 2012 |conference= IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)|url=http://labe.felk.cvut.cz/~tkrajnik/ardrone/articles/formace.pdf}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The Boids model can be used for direct control and stabilization of teams of simple Unmanned Ground Vehicles (UGV) or Micro Aerial Vehicles (MAV) in swarm robotics. For stabilization of heterogeneous UAV-UGV teams, the model was adapted for using onboard relative localization by Saska et&amp;amp;nbsp;al.&lt;br /&gt;
&lt;br /&gt;
Boids 模型可用于'''[[集群机器人]] Swarm Robotics'''中简单的无人地面车辆（UGV）或'''微型飞行器 Micro Aerial Vehicles'''（MAV）群体的直接控制和稳定。为了稳定异质 UAV-UGV 团队，Saska 等人将该模型用于板载相对定位。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
At the time of proposal, Reynolds' approach represented a giant step forward compared to the traditional techniques used in computer animation for motion pictures. The first animation created with the model was ''[[Stanley and Stella in: Breaking the Ice]]'' (1987), followed by a feature film debut in [[Tim Burton]]'s film ''[[Batman Returns]]'' (1992) with computer generated bat swarms and armies of penguins marching through the streets of Gotham City.&amp;lt;ref&amp;gt;{{cite journal | url=http://lrss.fri.uni-lj.si/people/ilbajec/papers/ilb_ab09.pdf | last1=Lebar Bajec |first1= Iztok |first2=  Frank H. |last2= Heppner | date=2009 | title=Organized flight in birds | journal=Animal Behaviour | volume = 78 | issue = 4 | pages = 777–789 | doi = 10.1016/j.anbehav.2009.07.007 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
At the time of proposal, Reynolds' approach represented a giant step forward compared to the traditional techniques used in computer animation for motion pictures. The first animation created with the model was Stanley and Stella in: Breaking the Ice (1987), followed by a feature film debut in Tim Burton's film Batman Returns (1992) with computer generated bat swarms and armies of penguins marching through the streets of Gotham City.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
在当时提出时，雷诺兹的方法相比于传统的计算机动画电影技术是一个巨大的进步。第一部利用了此模型的动画片是《'''史丹利和史黛拉: 破冰 Stanley and Stella in: Breaking The Ice'''》（1987），之后是'''蒂姆·伯顿 Tim Burton'''的故事片《'''蝙蝠侠归来 Batman Returns'''》（1992），电脑合成的蝙蝠群和成群的企鹅行进穿过'''哥谭市 Gotham City'''的街道。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The boids model has been used for other interesting applications. It has been applied to automatically program Internet multi-channel radio stations.&amp;lt;ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The boids model has been used for other interesting applications. It has been applied to automatically program Internet multi-channel radio stations.&amp;lt;ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{cite conference&lt;br /&gt;
&lt;br /&gt;
{{cite conference&lt;br /&gt;
&lt;br /&gt;
{引用会议&lt;br /&gt;
&lt;br /&gt;
| title         = DJ-boids: emergent collective behavior as multichannel radio station programming&lt;br /&gt;
&lt;br /&gt;
| title         = DJ-boids: emergent collective behavior as multichannel radio station programming&lt;br /&gt;
&lt;br /&gt;
多频道电台节目中的紧急集体行为&lt;br /&gt;
&lt;br /&gt;
| first1 = Jesús | last1 = Ibáñez&lt;br /&gt;
&lt;br /&gt;
| first1 = Jesús | last1 = Ibáñez&lt;br /&gt;
&lt;br /&gt;
| first1 = Jesús | last1 = Ibáñez&lt;br /&gt;
&lt;br /&gt;
| first2 = Antonio F. | last2 = Gómez-Skarmeta	&lt;br /&gt;
&lt;br /&gt;
| first2 = Antonio F. | last2 = Gómez-Skarmeta	&lt;br /&gt;
&lt;br /&gt;
| first2 = Antonio F. | last2 = Gómez-Skarmeta&lt;br /&gt;
&lt;br /&gt;
| first3 = Josep | last3 = Blat&lt;br /&gt;
&lt;br /&gt;
| first3 = Josep | last3 = Blat&lt;br /&gt;
&lt;br /&gt;
| first3 = Josep | last3 = Blat&lt;br /&gt;
&lt;br /&gt;
| date          = 2003&lt;br /&gt;
&lt;br /&gt;
| date          = 2003&lt;br /&gt;
&lt;br /&gt;
2003年&lt;br /&gt;
&lt;br /&gt;
| booktitle     = Proceedings of the 8th international conference on Intelligent User Interfaces&lt;br /&gt;
&lt;br /&gt;
| booktitle     = Proceedings of the 8th international conference on Intelligent User Interfaces&lt;br /&gt;
&lt;br /&gt;
第八届智能用户界面国际会议论文集&lt;br /&gt;
&lt;br /&gt;
| pages         = 248–250&lt;br /&gt;
&lt;br /&gt;
| pages         = 248–250&lt;br /&gt;
&lt;br /&gt;
第248-250页&lt;br /&gt;
&lt;br /&gt;
| doi           = 10.1145/604045.604089&lt;br /&gt;
&lt;br /&gt;
| doi           = 10.1145/604045.604089&lt;br /&gt;
&lt;br /&gt;
10.1145 / 604045.604089&lt;br /&gt;
&lt;br /&gt;
}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
{} / ref&lt;br /&gt;
&lt;br /&gt;
It has also been used for visualizing information&amp;lt;ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
It has also been used for visualizing information&amp;lt;ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{cite conference&lt;br /&gt;
&lt;br /&gt;
{{cite conference&lt;br /&gt;
&lt;br /&gt;
{引用会议&lt;br /&gt;
&lt;br /&gt;
| title         = Time-Varying Data Visualization Using Information Flocking Boids&lt;br /&gt;
&lt;br /&gt;
| title         = Time-Varying Data Visualization Using Information Flocking Boids&lt;br /&gt;
&lt;br /&gt;
使用信息植群的时变数据可视化&lt;br /&gt;
&lt;br /&gt;
| last = Moere | first = A V&lt;br /&gt;
&lt;br /&gt;
| last = Moere | first = A V&lt;br /&gt;
&lt;br /&gt;
最后一个 Moere | 第一个 a v&lt;br /&gt;
&lt;br /&gt;
| date          = 2004&lt;br /&gt;
&lt;br /&gt;
| date          = 2004&lt;br /&gt;
&lt;br /&gt;
2004年&lt;br /&gt;
&lt;br /&gt;
| booktitle     = Proceedings of the IEEE Symposium on Information Visualization&lt;br /&gt;
&lt;br /&gt;
| booktitle     = Proceedings of the IEEE Symposium on Information Visualization&lt;br /&gt;
&lt;br /&gt;
美国电气和电子工程师学会信息可视化研讨会论文集&lt;br /&gt;
&lt;br /&gt;
| pages         = 97–104&lt;br /&gt;
&lt;br /&gt;
| pages         = 97–104&lt;br /&gt;
&lt;br /&gt;
第97-104页&lt;br /&gt;
&lt;br /&gt;
| doi           = 10.1109/INFVIS.2004.65&lt;br /&gt;
&lt;br /&gt;
| doi           = 10.1109/INFVIS.2004.65&lt;br /&gt;
&lt;br /&gt;
10.1109 / INFVIS. 2004.65&lt;br /&gt;
&lt;br /&gt;
}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
{} / ref&lt;br /&gt;
&lt;br /&gt;
and for optimization tasks.&amp;lt;ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
and for optimization tasks.&amp;lt;ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{cite journal&lt;br /&gt;
&lt;br /&gt;
{{cite journal&lt;br /&gt;
&lt;br /&gt;
{引用期刊&lt;br /&gt;
&lt;br /&gt;
|first1 = Zhihua | last1 = Cui&lt;br /&gt;
&lt;br /&gt;
|first1 = Zhihua | last1 = Cui&lt;br /&gt;
&lt;br /&gt;
最新一期崔&lt;br /&gt;
&lt;br /&gt;
|first2 = Zhongzhi | last2 = Shi&lt;br /&gt;
&lt;br /&gt;
|first2 = Zhongzhi | last2 = Shi&lt;br /&gt;
&lt;br /&gt;
|first2 = Zhongzhi | last2 = Shi&lt;br /&gt;
&lt;br /&gt;
|title= Boid particle swarm optimisation&lt;br /&gt;
&lt;br /&gt;
|title= Boid particle swarm optimisation&lt;br /&gt;
&lt;br /&gt;
博伊德粒子群优化&lt;br /&gt;
&lt;br /&gt;
|journal= International Journal of Innovative Computing and Applications&lt;br /&gt;
&lt;br /&gt;
|journal= International Journal of Innovative Computing and Applications&lt;br /&gt;
&lt;br /&gt;
国际创新计算与应用杂志&lt;br /&gt;
&lt;br /&gt;
|volume=2 |issue=2 |pages= 77–85&lt;br /&gt;
&lt;br /&gt;
|volume=2 |issue=2 |pages= 77–85&lt;br /&gt;
&lt;br /&gt;
第二期，第77-85页&lt;br /&gt;
&lt;br /&gt;
|date=2009&lt;br /&gt;
&lt;br /&gt;
|date=2009&lt;br /&gt;
&lt;br /&gt;
2009年&lt;br /&gt;
&lt;br /&gt;
|doi= 10.1504/IJICA.2009.031778}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
|doi= 10.1504/IJICA.2009.031778}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
| doi 10.1504 / IJICA. 2009.031778} / ref&lt;br /&gt;
&lt;br /&gt;
Boids 模型已经被用于其他有趣应用。该系统已应用于互联网多频道广播电台的自动节目编排，以及可视化信息和优化任务。&lt;br /&gt;
&lt;br /&gt;
==See also 参见==&lt;br /&gt;
&lt;br /&gt;
*[[Swarm intelligence]] 群体智能&lt;br /&gt;
&lt;br /&gt;
*[[Collective cell migration]] 集体细胞迁移&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==References 参考资料==&lt;br /&gt;
&lt;br /&gt;
{{Reflist}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==External links 外部链接==&lt;br /&gt;
&lt;br /&gt;
* [http://www.red3d.com/cwr/boids/ Craig Reynolds' Boids page]&lt;br /&gt;
&lt;br /&gt;
* [http://www.vergenet.net/~conrad/boids/pseudocode.html Explanation of algorithm in pseudocode]&lt;br /&gt;
&lt;br /&gt;
* [https://gpolo.github.com/birdflocking JavaScript implementation]&lt;br /&gt;
&lt;br /&gt;
*[https://lufemas.github.io/boid-ai-implementation/ JavaScript implementation with Phaser Framework]&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20080205014305/http://www.navgen.com/3d_boids/ 3D Boids Simulation using OpenGL, used by the BBC's Natural History Unit]&lt;br /&gt;
&lt;br /&gt;
*[https://black-square.github.io/BirdFlock/ Live In-Browser 3D Simulation of Bird Flocking Behavior in Unity3D] – Open Source implementation for Windows, Linux and Mac&lt;br /&gt;
&lt;br /&gt;
* [https://github.com/piskvorky/PredatorPrey UNIX+Windows open source implementation in C++, using OpenGL and simulation controls]&lt;br /&gt;
&lt;br /&gt;
* [https://github.com/tofti/javafx-boids A java implementation using the javafx API]&lt;br /&gt;
&lt;br /&gt;
*GLSchool - part of [[XScreenSaver]] software&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{collective animal behaviour}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
===[https://campus.swarma.org/ 集智学园]课程：[https://campus.swarma.org/course/1104 透过人工鸟群Boid模型学习List的使用]===&lt;br /&gt;
&lt;br /&gt;
讲师：[[张江]](北师大系统科学学院教授、博士生导师，集智俱乐部、集智学园创始人。)&lt;br /&gt;
&lt;br /&gt;
本课程通过数个案例教会大家如何去动手搭建一个多主体仿真模型，以及如何利用NetLogo去实现。从生命游戏到人工鸟群，从模拟经济系统到病毒沿网络的传播，通过循序渐进的案例，该课程带你逐步走入NetLogo多主体建模的神奇世界。&lt;br /&gt;
&lt;br /&gt;
===[https://swarma.org/ 集智俱乐部]扩展阅读：[https://swarma.org/?p=16504 张江：乌合之众还是群智涌现？鸟群知道答案]===&lt;br /&gt;
&lt;br /&gt;
生命如何起源，智能如何涌现，因果如何反转，复杂谜题，引人深思。2019年7月13日，集智俱乐部创始人[[张江]]教授在混沌大学授课，详细解读了复杂系统中的混沌、涌现与进化，此文整理自课堂内容。&lt;br /&gt;
&lt;br /&gt;
===[https://v.qq.com/x/page/z13491sn7fy.html 动画片《Stanley and Stella in: Breaking the Ice (1987)》]===&lt;br /&gt;
&lt;br /&gt;
Craig Reynolds 与 Symbolics Graphics 和 Whitney / Demos Production 的同事合作制作的利用 boids 模型的小短片，讲述了飞鸟与鱼相爱，鸟儿冲破冰面与鱼相见的故事。影片最早于87年在 SIGGRAPH 电子剧院展出。&lt;br /&gt;
&lt;br /&gt;
 --[[用户:Dorr|Dorr]]（[[用户讨论:Dorr|讨论]]）补充自http://www.red3d.com/cwr/boids/：In cooperation with many coworkers at the Symbolics Graphics Division and Whitney / Demos Productions, we made an animated short featuring the boids model called Stanley and Stella in: Breaking the Ice. This film was first shown at the Electronic Theater at SIGGRAPH '87.&lt;br /&gt;
&lt;br /&gt;
[[Category:Artificial life]]&lt;br /&gt;
&lt;br /&gt;
Category:Artificial life&lt;br /&gt;
&lt;br /&gt;
类别: 人工生命&lt;br /&gt;
&lt;br /&gt;
[[Category:1986 software]]&lt;br /&gt;
&lt;br /&gt;
Category:1986 software&lt;br /&gt;
&lt;br /&gt;
类别: 1986软件&lt;br /&gt;
&lt;br /&gt;
&amp;lt;noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;small&amp;gt;This page was moved from [[wikipedia:en:Boids]]. Its edit history can be viewed at [[鸟群算法/edithistory]]&amp;lt;/small&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:待整理页面]]&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E7%A4%BE%E4%BC%9A%E8%AE%A1%E7%AE%97&amp;diff=11224</id>
		<title>社会计算</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E7%A4%BE%E4%BC%9A%E8%AE%A1%E7%AE%97&amp;diff=11224"/>
		<updated>2020-07-26T15:07:05Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：/* Challenges 挑战 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;#重定向 [[社会计算]]&lt;br /&gt;
此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。&lt;br /&gt;
{{sociology}}&amp;lt;onlyinclude&amp;gt;&amp;lt;!-- &lt;br /&gt;
&lt;br /&gt;
&amp;lt;onlyinclude&amp;gt;&amp;lt;!-- &lt;br /&gt;
&lt;br /&gt;
只包括! -- &lt;br /&gt;
&lt;br /&gt;
While editing this lead/intro, please keep your text BELOW this line - this will make it easier to automatically insert the lede into other articles --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
  While editing this lead/intro, please keep your text BELOW this line - this will make it easier to automatically insert the lede into other articles --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
当编辑这个导语 / 介绍，请保持你的文本下面这行-这将使它更容易自动插入到其他文章的莱德-&lt;br /&gt;
&lt;br /&gt;
'''Computational sociology''' is a branch of [[sociology]] that uses computationally intensive methods to analyze and model social phenomena. Using [[computer simulation]]s, [[artificial intelligence]], complex statistical methods, and analytic approaches like [[social network analysis]], computational sociology develops and tests theories of complex social processes through bottom-up modeling of social interactions.&amp;lt;ref name=&amp;quot;MW&amp;quot;&amp;gt;{{cite journal|doi=10.1146/annurev.soc.28.110601.141117|title=From Factors to Actors: Computational Sociology and Agent-Based Modeling |first1=Michael W. |last1=Macy |first2=Robert |last2=Willer |journal=Annual Review of Sociology |volume=28 |pages=143–166 |jstor=3069238|year=2002}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Computational sociology is a branch of sociology that uses computationally intensive methods to analyze and model social phenomena. Using computer simulations, artificial intelligence, complex statistical methods, and analytic approaches like social network analysis, computational sociology develops and tests theories of complex social processes through bottom-up modeling of social interactions.&lt;br /&gt;
&lt;br /&gt;
'''计算社会学 Computational Sociology''' 是社会学的一个分支，它使用计算密集型方法来分析和模拟社会现象。&amp;lt;font color='red'&amp;gt;计算社会学通过使用计算机模拟、人工智能、复杂统计方法以及社会网络分析等分析方法自下而上地建立社会互动模型，是建立并检验复杂社会过程的理论。&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;  借助计算机模拟、人工智能、复杂统计方法以及社会网络分析等分析方法，计算社会学通过自下而上地建立社会互动模型来发展和检验关于复杂社会过程的理论。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
It involves the understanding of social agents, the interaction among these agents, and the effect of these interactions on the social aggregate.&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;&amp;gt;{{cite book|last1=Gilbert |first1=Nigel |last2=Troitzsch |first2=Klaus |year=2005 |title=Simulation for Social Scientists |edition=2 |chapter=Simulation and social science |publisher=Open University Press |chapter-url=http://cress.soc.surrey.ac.uk/s4ss/}}&amp;lt;/ref&amp;gt; Although the subject matter and methodologies in [[social science]] differ from those in [[natural science]] or [[computer science]], several of the approaches used in contemporary [[social simulation]] originated from fields such as [[physics]] and [[artificial intelligence]].&amp;lt;ref name=&amp;quot;Artificial Societies&amp;quot;&amp;gt;{{cite book|last1=Epstein |first1=Joshua M. |last2=Axtell |first2=Robert |year=1996 |title=Growing Artificial Societies: Social Science from the Bottom Up |location=Washington DC |publisher=Brookings Institution Press|url=https://archive.org/details/growingartificia00epst|url-access=registration |isbn=978-0262050531 }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;Cooperation&amp;quot;&amp;gt;{{cite book|last1=Axelrod |first1=Robert |year=1997 |title=The Complexity of Cooperation: Agent-Based Models of Competition and Collaboration |location=Princeton, NJ |publisher=Princeton University Press}}&amp;lt;/ref&amp;gt; Some of the approaches that originated in this field have been imported into the natural sciences, such as measures of [[centrality|network centrality]] from the fields of [[social network analysis]] and [[network science]].&lt;br /&gt;
&lt;br /&gt;
It involves the understanding of social agents, the interaction among these agents, and the effect of these interactions on the social aggregate. Although the subject matter and methodologies in social science differ from those in natural science or computer science, several of the approaches used in contemporary social simulation originated from fields such as physics and artificial intelligence. Some of the approaches that originated in this field have been imported into the natural sciences, such as measures of network centrality from the fields of social network analysis and network science.&lt;br /&gt;
&lt;br /&gt;
它涉及理解社会行为主体和它们的相互作用，以及这些相互作用如何影响社会总体(--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） social aggregate--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|讨论]]） 我觉得这样翻译是ok的)。虽然社会科学的主题和方法不同于自然科学或计算机科学，但当代社会仿真模拟中使用的一些方法起源于物理学和人工智能等领域。这一领域的一些方法，如来自社会网络分析和网络科学领域的网络中心性度量方法等，早已被引入到自然科学中。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In relevant literature, computational sociology is often related to the study of [[social complexity]].&amp;lt;ref&amp;gt;{{cite journal|last=Casti |first=J |year=1999 |title=The Computer as Laboratory: Toward a Theory of Complex Adaptive Systems |journal=Complexity |volume=4 |issue=5 |pages=12–14 |doi=10.1002/(SICI)1099-0526(199905/06)4:5&amp;lt;12::AID-CPLX3&amp;gt;3.0.CO;2-4}}&amp;lt;/ref&amp;gt; Social complexity concepts such as [[complex systems]], [[non-linear]] interconnection among macro and micro process, and [[emergence]], have entered the vocabulary of computational sociology.&amp;lt;ref&amp;gt;{{cite journal|last=Goldspink |first=C |year=2002 |title=Methodological Implications of Complex Systems Approaches to Sociality: Simulation as a Foundation for Knowledge |url=http://jasss.soc.surrey.ac.uk/5/1/3.html |publisher=Journal of Artificial Societies and Social Simulation |volume=5 |issue=1}}&amp;lt;/ref&amp;gt; A practical and well-known example is the construction of a computational model in the form of an &amp;quot;[[artificial society]]&amp;quot;, by which researchers can analyze the structure of a [[Social structure|social system]].&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;Generative&amp;quot;&amp;gt;{{cite book|last=Epstein |first=Joshua |year=2007 |title=Generative Social Science: Studies in Agent-Based Computational Modeling |location=Princeton, NJ |publisher=Princeton University Press|url=https://www.researchgate.net/publication/283615593}}&lt;br /&gt;
&lt;br /&gt;
In relevant literature, computational sociology is often related to the study of social complexity. Social complexity concepts such as complex systems, non-linear interconnection among macro and micro process, and emergence, have entered the vocabulary of computational sociology. A practical and well-known example is the construction of a computational model in the form of an &amp;quot;artificial society&amp;quot;, by which researchers can analyze the structure of a social system.&lt;br /&gt;
&lt;br /&gt;
在相关文献中，计算社会学经常与社会复杂性的研究有关。复杂系统、宏观和微观过程之间的非线性关联、涌现等社会复杂性概念已经进入计算社会学的词汇。一个实际而著名的例子是建立“'''人工社会 Artificial Society'''”的计算模型，通过它研究人员可以分析一个社会系统的结构。 &lt;br /&gt;
&lt;br /&gt;
While editing this lead/intro, please keep your text ABOVE this line - this will make it easier to automatically insert the lede into other articles - thanks!  &lt;br /&gt;
&lt;br /&gt;
While editing this lead/intro, please keep your text ABOVE this line - this will make it easier to automatically insert the lede into other articles - thanks!  &lt;br /&gt;
&lt;br /&gt;
当编辑这个引导 / 介绍，请保持你的文本以上这一行-这将使它更容易自动插入到其他文章的莱德-谢谢！&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;&amp;lt;/onlyinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;&amp;lt;/onlyinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
-- / 只包括&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==History 历史==&lt;br /&gt;
&lt;br /&gt;
{{see also|Sociology and complexity science}}&lt;br /&gt;
&lt;br /&gt;
[[File:Complexity-map-with-sociolo.png|thumb|right|300px|Historical map of research paradigms and associated scientists in [[sociology and complexity science]].]]&lt;br /&gt;
&lt;br /&gt;
Historical map of research paradigms and associated scientists in [[sociology and complexity science.]]&lt;br /&gt;
&lt;br /&gt;
【图1：Historical map of research paradigms and associated scientists in [[sociology and complexity science＋社会学和复杂性中的研究范式和科学家的历史地图】&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Background 背景===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In the past four decades, computational sociology has been introduced and gaining popularity {{According to whom|date=June 2017}}.  This has been used primarily for modeling or building explanations of social processes and are depending on the emergence of complex behavior from simple activities.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;&amp;gt;Salgado, Mauricio, and Nigel Gilbert. &amp;quot;[http://epubs.surrey.ac.uk/749319/1/Emergence%20and%20Communication%20-%20V3%201.pdf Emergence and communication in computational sociology].&amp;quot; Journal for the Theory of Social Behaviour 43.1 (2013): 87-110.&amp;lt;/ref&amp;gt;  The idea behind emergence is that properties of any bigger system do not always have to be properties of the components that the system is made of.&amp;lt;ref&amp;gt;Macy, Michael W., and Robert Willer. &amp;quot;[http://sct.uab.cat/lsds/sites/sct.uab.cat.lsds/files/FROM%20FACTORS%20TO%20ACTORS%20(Macy%20and%20Willer%202002).pdf From factors to actors: computational sociology and agent-based modeling].&amp;quot; Annual review of sociology 28.1 (2002): 143-166.&amp;lt;/ref&amp;gt;  The people responsible for the introduction of the idea of emergence are Alexander, Morgan, and Broad, who were classical emergentists.  The time at which these emergentists came up with this concept and method was during the time of the early twentieth century.  The aim of this method was to find a good enough accommodation between two different and extreme ontologies, which were reductionist materialism and dualism.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;/&amp;gt; &lt;br /&gt;
&lt;br /&gt;
In the past four decades, computational sociology has been introduced and gaining popularity.  This has been used primarily for modeling or building explanations of social processes and are depending on the emergence of complex behavior from simple activities.  The idea behind emergence is that properties of any bigger system do not always have to be properties of the components that the system is made of.  The people responsible for the introduction of the idea of emergence are Alexander, Morgan, and Broad, who were classical emergentists.  The time at which these emergentists came up with this concept and method was during the time of the early twentieth century.  The aim of this method was to find a good enough accommodation between two different and extreme ontologies, which were reductionist materialism and dualism. &lt;br /&gt;
&lt;br /&gt;
在过去的四十年里，计算社会学诞生并且越来越受欢迎。这主要用于建模或构建社会过程的解释，并且依赖于从简单活动中'''涌现 Emergence'''的复杂行为。涌现背后的思想是，任何较大系统不总是必须和组成系统的部分具有一样的性质。引入涌现思想的人是亚历山大 Alexander、摩根 Morgan和布罗德 Broad，他们都是'''经典涌现主义者 Classical Emergentists'''。经典涌现主义者提出这个概念和方法的时间是在二十世纪初期。这种方法的目的是在还原论的唯物主义和二元论这两种不同的本体论之间找到一个足够好的调和。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
While emergence has had a valuable and important role with the foundation of Computational Sociology, there are those who do not necessarily agree.  One major leader in the field, Epstein, doubted the use because there were aspects that are unexplainable.  Epstein put up a claim against emergentism, in which he says it &amp;quot;is precisely the generative sufficiency of the parts that constitutes the whole's explanation&amp;quot;.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
While emergence has had a valuable and important role with the foundation of Computational Sociology, there are those who do not necessarily agree.  One major leader in the field, Epstein, doubted the use because there were aspects that are unexplainable.  Epstein put up a claim against emergentism, in which he says it &amp;quot;is precisely the generative sufficiency of the parts that constitutes the whole's explanation&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
虽然涌现在计算社会学的建立上发挥了宝贵而重要的作用，但也有人不太同意。该领域的一个主要人物爱泼斯坦 Epstein对这种&amp;lt;font color='red'&amp;gt;用法&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;概念&amp;lt;/font&amp;gt;持怀疑态度，因为有些方面是这个&amp;lt;font color='red'&amp;gt;用法&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;概念&amp;lt;/font&amp;gt;无法解释的。爱泼斯坦提出了一种反对“涌现主义”的观点，他表示:“&amp;lt;font color=='red'&amp;gt;正是这些部分的有生成意义的充分性构成了对整体的解释&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;  正是这些部分所产生的充分性构成了对整体的解释&amp;lt;/font&amp;gt;”。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Agent-based models have had a historical influence on Computational Sociology.   These models first came around in the 1960s, and were used to simulate control and feedback processes in organizations, cities, etc.  During the 1970s, the application introduced the use of individuals as the main units for the analyses and used bottom-up strategies for modeling behaviors.  The last wave occurred in the 1980s.  At this time, the models were still bottom-up; the only difference is that the agents interact interdependently.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Agent-based models have had a historical influence on Computational Sociology. These models first came around in the 1960s, and were used to simulate control and feedback processes in organizations, cities, etc.  During the 1970s, the application introduced the use of individuals as the main units for the analyses and used bottom-up strategies for modeling behaviors.  The last wave occurred in the 1980s.  At this time, the models were still bottom-up; the only difference is that the agents interact interdependently.&lt;br /&gt;
&lt;br /&gt;
'''基于主体的模型 Agent-based Models'''对计算社会学有着历史性的影响。这些模型最早出现在20世纪60年代，用于仿真模拟组织、城市等系统的控制和反馈过程。在20世纪70年代，&amp;lt;font color='red'&amp;gt;应用程序&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; ABM模型&amp;lt;/font&amp;gt;引入个体作为主要的分析单元，并使用自下而上的策略来对行为建模。最后一波浪潮发生在20世纪80年代。那时，模型仍然是自下而上的; 唯一的区别是主体之间具有互相依赖和相互作用。&lt;br /&gt;
&lt;br /&gt;
===Systems theory and structural functionalism 系统理论和结构功能主义===&lt;br /&gt;
&lt;br /&gt;
{{main|Systems theory|Structural functionalism}}&lt;br /&gt;
&lt;br /&gt;
In the post-war era, [[Vannevar Bush]]'s [[differential analyser]], [[John von Neumann]]'s [[Von Neumann cellular automata|cellular automata]], [[Norbert Wiener]]'s [[cybernetics]], and [[Claude Shannon]]'s [[information theory]] became influential paradigms for modeling and understanding complexity in technical systems. In response, scientists in disciplines such as physics, biology, electronics, and economics began to articulate a [[systems theory|general theory of systems]] in which all natural and physical phenomena are manifestations of interrelated elements in a system that has common patterns and properties. Following [[Émile Durkheim]]'s call to analyze complex modern society ''[[sui generis]]'',&amp;lt;ref&amp;gt;{{cite book|first=Émile |last=Durkheim |title=The Division of Labor in Society |location=New York, NY |publisher=Macmillan}}&amp;lt;/ref&amp;gt; post-war structural functionalist sociologists such as [[Talcott Parsons]] seized upon these theories of systematic and hierarchical interaction among constituent components to attempt to generate grand unified sociological theories, such as the [[AGIL paradigm]].&amp;lt;ref name=&amp;quot;Bailey&amp;quot;&amp;gt;{{cite book|first1=Kenneth D. |last1=Bailey |editor=Jonathan H. Turner |chapter=Systems Theory |title=Handbook of Sociological Theory |publisher=Springer Science |year=2006 |location=New York, NY |isbn=978-0-387-32458-6 |pages=379–404}}&amp;lt;/ref&amp;gt; Sociologists such as [[George Homans]] argued that sociological theories should be formalized into hierarchical structures of propositions and precise terminology from which other propositions and hypotheses could be derived and operationalized into empirical studies.&amp;lt;ref name=&amp;quot;Blackwell&amp;quot;&amp;gt;{{cite encyclopedia|year=2007 |title=Computational Sociology |last=Bainbridge |first=William Sims |encyclopedia=Blackwell Encyclopedia of Sociology |publisher=Blackwell Reference Online |url=http://www.sociologyencyclopedia.com/subscriber/tocnode?id=g9781405124331_chunk_g97814051243319_ss1-85 |doi=10.1111/b.9781405124331.2007.x |hdl=10138/224218 |editor=Ritzer, George|isbn=978-1-4051-2433-1|hdl-access=free }}&amp;lt;/ref&amp;gt; Because computer algorithms and programs had been used as early as 1956 to test and validate mathematical theorems, such as the [[four color theorem]],&amp;lt;ref&amp;gt;{{cite book|last=Crevier |first=D. |year=1993 |title=AI: The Tumultuous History of the Search for Artificial Intelligence |url=https://archive.org/details/aitumultuoushist00crev |url-access=registration |publisher=Basic Books |location=New York, NY}}&amp;lt;/ref&amp;gt; some scholars anticipated that similar computational approaches could &amp;quot;solve&amp;quot; and &amp;quot;prove&amp;quot; analogously formalized problems and theorems of social structures and dynamics.&lt;br /&gt;
&lt;br /&gt;
In the post-war era, Vannevar Bush's differential analyser, John von Neumann's cellular automata, Norbert Wiener's cybernetics, and Claude Shannon's information theory became influential paradigms for modeling and understanding complexity in technical systems. In response, scientists in disciplines such as physics, biology, electronics, and economics began to articulate a general theory of systems in which all natural and physical phenomena are manifestations of interrelated elements in a system that has common patterns and properties. Following Émile Durkheim's call to analyze complex modern society sui generis, post-war structural functionalist sociologists such as Talcott Parsons seized upon these theories of systematic and hierarchical interaction among constituent components to attempt to generate grand unified sociological theories, such as the AGIL paradigm. Sociologists such as George Homans argued that sociological theories should be formalized into hierarchical structures of propositions and precise terminology from which other propositions and hypotheses could be derived and operationalized into empirical studies. Because computer algorithms and programs had been used as early as 1956 to test and validate mathematical theorems, such as the four color theorem, some scholars anticipated that similar computational approaches could &amp;quot;solve&amp;quot; and &amp;quot;prove&amp;quot; analogously formalized problems and theorems of social structures and dynamics.&lt;br /&gt;
&lt;br /&gt;
战后时期，范内瓦·布什（Vannevar Bush）的'''微分分析机 Differential Analyser''' 、冯·诺伊曼（John von Neumann）的'''元胞自动机 Cellular Automata'''、 维纳（Norbert Wiener）的'''控制论 Cybernetics'''和克劳德·香农（Claude Shannon）的'''信息论 Information Theory'''成为技术系统中建模和理解复杂性的重要范式。物理学、生物学、电子学和经济学等学科的科学家开始阐述系统的一般理论，即所有自然和物理现象都是具有共同模式和属性的系统中相互关联的元素的表现。&amp;lt;font color='red'&amp;gt;按照 &amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 沿着&amp;lt;/font&amp;gt;涂尔干（Émile Durkheim）分析特定的复杂现代社会&lt;br /&gt;
&lt;br /&gt;
（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]）Following Émile Durkheim's call to analyze complex modern society sui generis）&lt;br /&gt;
  --~~克劳德·香农（Claude Shannon）  这些同样去括号&lt;br /&gt;
&lt;br /&gt;
的&amp;lt;font color='red'&amp;gt;要求&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 思路&amp;lt;/font&amp;gt;，战后结构功能主义社会学家如帕森斯（Talcott Parsons）利用这些组成部分之间系统&amp;lt;font color='blue'&amp;gt;化&amp;lt;/font&amp;gt;和&amp;lt;font color='red'&amp;gt;等级&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 层次化&amp;lt;/font&amp;gt;相互作用的理论，试图产生大统一的社会学理论，如 AGIL 范式。霍曼斯（George Homans）等社会学家认为，社会学理论应该被构建为具有&amp;lt;font color='blue'&amp;gt;逻辑&amp;lt;/font&amp;gt;命题和精确术语的&amp;lt;font color='red'&amp;gt;等级&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 层次化&amp;lt;/font&amp;gt;结构，并且从中可以得出能够在实证研究中被操作化的其他命题和假设。由于早在1956年计算机算法和程序就已经被用来测试和验证数学定理（如'''四色定理Four Color Theorem'''），&amp;lt;font color='red'&amp;gt;一些学者预计相似的计算方法可以“解决”和“证明”类似的社会结构和动态的问题和定理。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 一些学者预计相似的计算方法可以“解释”和“证明”关于社会结构和演变的类似形式化的问题和定理。&amp;lt;/font&amp;gt;&lt;br /&gt;
--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|讨论]]formalized应该也要翻译出来，computational证明的是形式化定理)&lt;br /&gt;
&lt;br /&gt;
===Macrosimulation and microsimulation 宏观模拟和微观模拟===&lt;br /&gt;
&lt;br /&gt;
{{main|System dynamics|Microsimulation}}&lt;br /&gt;
&lt;br /&gt;
By the late 1960s and early 1970s, social scientists used increasingly available computing technology to perform macro-simulations of control and feedback processes in organizations, industries, cities, and global populations. These models used differential equations to predict population distributions as holistic functions of other systematic factors such as inventory control, urban traffic, migration, and disease transmission.&amp;lt;ref&amp;gt;{{cite book|first=Jay |last=Forrester |year=1971 |title=World Dynamics |location=Cambridge, MA |publisher=MIT Press}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|doi=10.1287/opre.26.2.237|title=Using Simulation to Develop and Validate Analytic Models: Some Case Studies |first1=Edward J. |last1=Ignall |first2=Peter |last2=Kolesar |first3=Warren E. |last3=Walker |journal=Operations Research |volume=26 |issue=2 |year=1978 |pages=237–253}}&amp;lt;/ref&amp;gt; Although simulations of social systems received substantial attention in the mid-1970s after the [[Club of Rome]] published reports predicting that policies promoting exponential economic growth would eventually bring global environmental catastrophe,&amp;lt;ref&amp;gt;{{cite book|title=The Dynamics of Growth in a Finite World |last1=Meadows |first1=DL |last2=Behrens |first2=WW |last3=Meadows |first3=DH |last4=Naill |first4=RF |last5= Randers |first5=J |last6=Zahn |first6=EK |year=1974 |location=Cambridge, MA |publisher=MIT Press}}&amp;lt;/ref&amp;gt; the inconvenient conclusions led many authors to seek to discredit the models, attempting to make the researchers themselves appear unscientific.&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;/&amp;gt;&amp;lt;ref&amp;gt;{{cite news|title=Computer View of Disaster Is Rebutted |newspaper=The New York Times |date=October 18, 1974|url=https://www.nytimes.com/1974/10/18/archives/computer-view-of-disaster-is-rebutted.html?_r=0}}&amp;lt;/ref&amp;gt; Hoping to avoid the same fate, many social scientists turned their attention toward micro-simulation models to make forecasts and study policy effects by modeling aggregate changes in state of individual-level entities rather than the changes in distribution at the population level.&amp;lt;ref&amp;gt;{{cite journal|doi=10.1016/0167-2681(90)90038-F|title=From engineering to microsimulation : An autobiographical reflection |journal=Journal of Economic Behavior &amp;amp; Organization |year=1990 |volume=14 |issue=1 |pages=5–27 |first=Guy H. |last=Orcutt}}&amp;lt;/ref&amp;gt; However, these micro-simulation models did not permit individuals to interact or adapt and were not intended for basic theoretical research.&amp;lt;ref name=&amp;quot;MW&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
By the late 1960s and early 1970s, social scientists used increasingly available computing technology to perform macro-simulations of control and feedback processes in organizations, industries, cities, and global populations. These models used differential equations to predict population distributions as holistic functions of other systematic factors such as inventory control, urban traffic, migration, and disease transmission. Although simulations of social systems received substantial attention in the mid-1970s after the Club of Rome published reports predicting that policies promoting exponential economic growth would eventually bring global environmental catastrophe, the inconvenient conclusions led many authors to seek to discredit the models, attempting to make the researchers themselves appear unscientific. Hoping to avoid the same fate, many social scientists turned their attention toward micro-simulation models to make forecasts and study policy effects by modeling aggregate changes in state of individual-level entities rather than the changes in distribution at the population level. However, these micro-simulation models did not permit individuals to interact or adapt and were not intended for basic theoretical research.&lt;br /&gt;
&lt;br /&gt;
截至20世纪60年代末70年代初，社会科学家越来越多地使用已有的计算技术，&amp;lt;s&amp;gt;在&amp;lt;/s&amp;gt;&amp;lt;font color='blue'&amp;gt;对&amp;lt;/font&amp;gt;组织、工业、城市和全球人口&amp;lt;s&amp;gt;中&amp;lt;/s&amp;gt;进行&amp;lt;font color='blue'&amp;gt;包含&amp;lt;/font&amp;gt;控制和反馈过程的'''宏观模拟 Macrosimulation''' 。这些模型使用微分方程作为其他系统因素的整体函数来预测人口分布，这些系统因素包括&amp;lt;font color='red'&amp;gt;库存&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 财产&amp;lt;/font&amp;gt;控制、城市交通、人口迁移和疾病传播等。&amp;lt;font color='red'&amp;gt;20世纪70年代中期，'''罗马俱乐部 Club of Rome''' 发表报告预测，促进指数式经济增长的政策最终将导致全球环境灾难，这个悲观的结论导致许多研究者试图反驳这些模型，并试图让研究显得不那么科学。&amp;lt;/font&amp;gt;&lt;br /&gt;
  （--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） 根据意思，inconvenient译为悲观的，因为这个结论预示了悲观的未来，所以令指出这一点的科学家们感到inconvenient）&lt;br /&gt;
  （--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟树|讨论]]） inconvenient的翻译没问题，不过好像缺失了Although simulations of social systems received substantial attention）&lt;br /&gt;
&amp;lt;font color='blue'&amp;gt; 20世纪70年代中期，尽管对社会系统的仿真获得了巨大的关注，但在'''罗马俱乐部 Club of Rome''' 发布预测报告称促进指数式经济增长的政策最终将导致全球环境灾难，这个悲观的结论导致许多研究者尝试抹黑这些(仿真)模型，并试图让(这些模型的)研究者自身显得不那么科学。&amp;lt;/font&amp;gt;&lt;br /&gt;
为了避免同样的情况，许多社会科学家将注意力转向'''微观模拟 Microsimulation'''模型。这些模型通过模拟个体状态的总体变化而不是总体人口级别的&amp;lt;font color='blue'&amp;gt;分布&amp;lt;/font&amp;gt;变化来进行预测和研究政策的效果。然而，这些微观模拟模型并不允许个体相互作用或适应、变化（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]）变化是根据适应（adapt）加上去的，不知道是否合理--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|讨论]]）我觉得ok），研究者也不打算将它们用于基础理论研究。&lt;br /&gt;
&lt;br /&gt;
===Cellular automata and agent-based modeling 元胞自动机和基于主体建模===&lt;br /&gt;
&lt;br /&gt;
{{main|Cellular automata|agent-based modeling}}&lt;br /&gt;
&lt;br /&gt;
The 1970s and 1980s were also a time when physicists and mathematicians were attempting to model and analyze how simple component units, such as atoms, give rise to global properties, such as complex material properties at low temperatures, in magnetic materials, and within turbulent flows.&amp;lt;ref&amp;gt;{{cite book|title=Cellular automata machines: a new environment for modeling |url=https://archive.org/details/cellularautomata00toff |url-access=registration |first1=Tommaso |last1=Toffoli |first2=Norman |last2=Margolus | author2-link = Norman Margolus |year=1987 |publisher=MIT Press |location=Cambridge, MA}}&amp;lt;/ref&amp;gt; Using cellular automata, scientists were able to specify systems consisting of a grid of cells in which each cell only occupied some finite states and changes between states were solely governed by the states of immediate neighbors. Along with advances in [[artificial intelligence]] and [[microcomputer]] power, these methods contributed to the development of &amp;quot;[[chaos theory]]&amp;quot; and &amp;quot;[[complex systems|complexity theory]]&amp;quot; which, in turn, renewed interest in understanding complex physical and social systems across disciplinary boundaries.&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;/&amp;gt; Research organizations explicitly dedicated to the interdisciplinary study of complexity were also founded in this era: the [[Santa Fe Institute]] was established in 1984 by scientists based at [[Los Alamos National Laboratory]] and the BACH group at the [[University of Michigan]] likewise started in the mid-1980s.&lt;br /&gt;
&lt;br /&gt;
The 1970s and 1980s were also a time when physicists and mathematicians were attempting to model and analyze how simple component units, such as atoms, give rise to global properties, such as complex material properties at low temperatures, in magnetic materials, and within turbulent flows. Using cellular automata, scientists were able to specify systems consisting of a grid of cells in which each cell only occupied some finite states and changes between states were solely governed by the states of immediate neighbors. Along with advances in artificial intelligence and microcomputer power, these methods contributed to the development of &amp;quot;chaos theory&amp;quot; and &amp;quot;complexity theory&amp;quot; which, in turn, renewed interest in understanding complex physical and social systems across disciplinary boundaries. Research organizations explicitly dedicated to the interdisciplinary study of complexity were also founded in this era: the Santa Fe Institute was established in 1984 by scientists based at Los Alamos National Laboratory and the BACH group at the University of Michigan likewise started in the mid-1980s.&lt;br /&gt;
&lt;br /&gt;
20世纪70年代和80年代，物理学家和数学家也在试图模拟和分析简单的组成单位如何产生整体特性，比如低温环境中原子在磁性材料和湍流中&amp;lt;font color='blue'&amp;gt;(表现出的)&amp;lt;/font&amp;gt;的复杂材料特性。使用'''元胞自动机 Cellular Automata'''，科学家们能够指定由元胞网格组成的系统，其中每个元胞只占据一些有限的状态，状态之间的变化完全由相邻元胞的状态控制。随着人工智能和微型计算机能力的进步，这些方法促进了“混沌理论”和“复杂性理论”的发展，这反过来又重新引起了人们对跨学科的复杂物理和社会系统的兴趣。明确致力于跨学科复杂性研究的机构也是在这个时代成立的: 圣菲研究所是由美国洛斯阿拉莫斯国家实验室（Los Alamos National Laboratory）的科学家于1984年建立的，密歇根大学的 BACH 小组也是在20世纪80年代中期建立的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This cellular automata paradigm gave rise to a third wave of social simulation emphasizing agent-based modeling. Like micro-simulations, these models emphasized bottom-up designs but adopted four key assumptions that diverged from microsimulation: autonomy, interdependency, simple rules, and adaptive behavior.&amp;lt;ref name=&amp;quot;MW&amp;quot;/&amp;gt; Agent-based models are less concerned with predictive accuracy and instead emphasize theoretical development.&amp;lt;ref&amp;gt;{{cite journal |title=A simulation of the structure of academic science |journal=Sociological Research Online |volume=2 |issue=2 |pages=1–15 |year=1997 |first=Nigel |last=Gilbert |url=http://www.socresonline.org.uk/socresonline/2/2/3.html |doi=10.5153/sro.85 |access-date=2009-12-16 |archive-url=https://web.archive.org/web/19980524062306/http://www.socresonline.org.uk/socresonline/2/2/3.html |archive-date=1998-05-24 |url-status=dead }}&amp;lt;/ref&amp;gt; In 1981, mathematician and political scientist [[Robert Axelrod]] and evolutionary biologist [[W.D. Hamilton]] published a major paper in ''[[Science (journal)|Science]]'' titled &amp;quot;The Evolution of Cooperation&amp;quot; which used an agent-based modeling approach to demonstrate how social cooperation based upon reciprocity can be established and stabilized in a [[prisoner's dilemma]] game when agents followed simple rules of self-interest.&amp;lt;ref&amp;gt;{{cite journal|title=The Evolution of Cooperation |first1=Robert |last1=Axelrod |first2=William D. |last2=Hamilton |journal=Science |volume=211 |issue=4489 |pages=1390–1396 |doi=10.1126/science.7466396|pmid=7466396 |date=March 27, 1981|bibcode=1981Sci...211.1390A }}&amp;lt;/ref&amp;gt; Axelrod and Hamilton demonstrated that individual agents following a simple rule set of (1) cooperate on the first turn and (2) thereafter replicate the partner's previous action were able to develop &amp;quot;norms&amp;quot; of cooperation and sanctioning in the absence of canonical sociological constructs such as demographics, values, religion, and culture as preconditions or mediators of cooperation.&amp;lt;ref name=&amp;quot;Cooperation&amp;quot;/&amp;gt; Throughout the 1990s, scholars like [[William Sims Bainbridge]], [[Kathleen Carley]], [[Michael Macy]],  and [[John Skvoretz]] developed multi-agent-based models of [[generalized reciprocity]], [[prejudice]], [[social influence]], and organizational [[information processing]]. In 1999, [[Nigel Gilbert]] published the first textbook on Social Simulation: ''Simulation for the social scientist'' and established its most relevant journal: the [[Journal of Artificial Societies and Social Simulation]].&lt;br /&gt;
&lt;br /&gt;
This cellular automata paradigm gave rise to a third wave of social simulation emphasizing agent-based modeling. Like micro-simulations, these models emphasized bottom-up designs but adopted four key assumptions that diverged from microsimulation: autonomy, interdependency, simple rules, and adaptive behavior. In 1981, mathematician and political scientist Robert Axelrod and evolutionary biologist W.D. Hamilton published a major paper in Science titled &amp;quot;The Evolution of Cooperation&amp;quot; which used an agent-based modeling approach to demonstrate how social cooperation based upon reciprocity can be established and stabilized in a prisoner's dilemma game when agents followed simple rules of self-interest. Axelrod and Hamilton demonstrated that individual agents following a simple rule set of (1) cooperate on the first turn and (2) thereafter replicate the partner's previous action were able to develop &amp;quot;norms&amp;quot; of cooperation and sanctioning in the absence of canonical sociological constructs such as demographics, values, religion, and culture as preconditions or mediators of cooperation. Throughout the 1990s, scholars like William Sims Bainbridge, Kathleen Carley, Michael Macy,  and John Skvoretz developed multi-agent-based models of generalized reciprocity, prejudice, social influence, and organizational information processing. In 1999, Nigel Gilbert published the first textbook on Social Simulation: Simulation for the social scientist and established its most relevant journal: the Journal of Artificial Societies and Social Simulation.&lt;br /&gt;
&lt;br /&gt;
元胞自动机范式引发了强调'''基于主体建模 Agent-based Modeling'''的第三次社会模拟浪潮。与微观模拟一样，这些模型强调自下而上的设计，但采用了与微观模拟不同的四个关键假设: '''自主性 Autonomy'''、'''相互依赖性 Interdependency'''、'''简单规则 Simple Rules'''和'''适应性行为 Adaptive Behavior'''。1981年，数学家、政治学家阿克塞尔罗德（Robert Axelrod）和进化生物学家汉密尔顿（W.D. Hamilton）在《科学》杂志上发表了一篇名为《合作的进化》（The Evolution of Cooperation）的重要论文，该论文采用基于主体建模方法，论证了在一个囚徒困境中，当主体遵循简单的自利规则（rules of self-interest）时，互惠的社会合作是如何建立和稳定的。阿克塞尔罗德和汉密尔顿证明，主体遵循这样一套简单的规则: (1)在第一轮进行合作，(2)在其后重复伙伴以前的行动，能够在没有人口学差异、价值观、宗教和文化等社会规范作为合作的先决条件或中介的情况下制定合作和制裁的“规范”。整个20世纪90年代，像威廉·希姆斯·本布里奇（William Sims Bainbridge），Kathleen Carley，Michael Macy 和 John Skvoretz 这样的学者开发了&amp;lt;s&amp;gt;基于多主体的&amp;lt;/s&amp;gt;&amp;lt;font color='blue'&amp;gt;关于&amp;lt;/font&amp;gt;广义互惠、偏见、社会影响和组织信息处理模型&amp;lt;font color='blue'&amp;gt;的多主体模型&amp;lt;/font&amp;gt;。1999年，吉尔伯特（Nigel Gilbert）出版了第一本关于社会模拟&amp;lt;font color='blue'&amp;gt;的教科书&amp;lt;/font&amp;gt;: 《写给社会科学家的仿真模拟（Simulation for the social scientist）》&amp;lt;s&amp;gt;的教科书&amp;lt;/s&amp;gt;，并建立了它最相关的杂志: 人工社会和社会模拟杂志（the Journal of Artificial Societies and Social Simulation）。&lt;br /&gt;
&lt;br /&gt;
===Data mining and social network analysis 数据挖掘和社会网络分析===&lt;br /&gt;
&lt;br /&gt;
{{main|Data mining|Social network analysis}}&lt;br /&gt;
&lt;br /&gt;
--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） 少一段原文 &lt;br /&gt;
Independent from developments in computational models of social systems, social network analysis emerged in the 1970s and 1980s from advances in graph theory, statistics, and studies of social structure as a distinct analytical method and was articulated and employed by sociologists like James S. Coleman, Harrison White, Linton Freeman, J. Clyde Mitchell, Mark Granovetter, Ronald Burt, and Barry Wellman.[22] The increasing pervasiveness of computing and telecommunication technologies throughout the 1980s and 1990s demanded analytical techniques, such as network analysis and multilevel modeling, that could scale to increasingly complex and large data sets. The most recent wave of computational sociology, rather than employing simulations, uses network analysis and advanced statistical techniques to analyze large-scale computer databases of electronic proxies for behavioral data. Electronic records such as email and instant message records, hyperlinks on the World Wide Web, mobile phone usage, and discussion on Usenet allow social scientists to directly observe and analyze social behavior at multiple points in time and multiple levels of analysis without the constraints of traditional empirical methods such as interviews, participant observation, or survey instruments.[23] Continued improvements in machine learning algorithms likewise have permitted social scientists and entrepreneurs to use novel techniques to identify latent and meaningful patterns of social interaction and evolution in large electronic datasets.[24][25]&lt;br /&gt;
&lt;br /&gt;
Independent from developments in computational models of social systems, social network analysis emerged in the 1970s and 1980s from advances in graph theory, statistics, and studies of social structure as a distinct analytical method and was articulated and employed by sociologists like [[James Samuel Coleman|James S. Coleman]], [[Harrison White]], [[Linton Freeman]], [[J. Clyde Mitchell]], [[Mark Granovetter]], [[Ronald Burt]], and [[Barry Wellman]].&amp;lt;ref&amp;gt;{{cite book|title=The Development of Social Network Analysis: A Study in the Sociology of Science |first=Linton C. |last=Freeman |publisher=Empirical Press |location=Vancouver, BC |year=2004}}&amp;lt;/ref&amp;gt; The increasing pervasiveness of computing and telecommunication technologies throughout the 1980s and 1990s demanded analytical techniques, such as [[network theory|network analysis]] and [[multilevel modeling]], that could scale to increasingly complex and large data sets. The most recent wave of computational sociology, rather than employing simulations, uses network analysis and advanced statistical techniques to analyze large-scale computer databases of electronic proxies for behavioral data. Electronic records such as email and instant message records, hyperlinks on the [[World Wide Web]], mobile phone usage, and discussion on [[Usenet]] allow social scientists to directly observe and analyze social behavior at multiple points in time and multiple levels of analysis without the constraints of traditional empirical methods such as interviews, participant observation, or survey instruments.&amp;lt;ref&amp;gt;{{cite journal|title=Life in the network: the coming age of computational social science|first9=J|last10=Gutmann|first10=M.|last11=Jebara|first11=T.|last12=King|first12=G.|last13=Macy|first13=M.|last14=Roy|first14=D.|last15=Van Alstyne|first15=M.|last9=Fowler|first8=N|last8=Contractor|first7=N|last7=Christakis|first6=D|last6=Brewer|first5=AL|last5=Barabasi|first4=S |journal=Science|last4=Aral |date=February 6, 2009|first3=L |volume=323|pmid=19197046 |issue=5915|last3=Adamic |pages=721–723|pmc=2745217 |doi=10.1126/science.1167742 |first1=David |last1=Lazer |first2=Alex |last2=Pentland |display-authors=8}}&amp;lt;/ref&amp;gt; Continued improvements in [[machine learning]] algorithms likewise have permitted social scientists and entrepreneurs to use novel techniques to identify latent and meaningful patterns of social interaction and evolution in large electronic datasets.&amp;lt;ref&amp;gt;{{cite journal|first1=Jaideep |last1=Srivastava |first2=Robert |last2=Cooley |first3=Mukund |last3=Deshpande |first4=Pang-Ning |last4=Tan |journal=Proceedings of the ACM Conference on Knowledge Discovery and Data Mining |title=Web usage mining: discovery and applications of usage patterns from Web data|volume=1 |year=2000 |pages=12–23 |doi=10.1145/846183.846188|issue=2}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|doi=10.1016/S0169-7552(98)00110-X|title=The anatomy of a large-scale hypertextual Web search engine |first1=Sergey |last1=Brin |first2=Lawrence |last2=Page |journal=Computer Networks and ISDN Systems |volume=30 |issue=1–7 |pages=107–117 |date=April 1998|citeseerx=10.1.1.115.5930 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Independent from developments in computational models of social systems, social network analysis emerged in the 1970s and 1980s from advances in graph theory, statistics, and studies of social structure as a distinct analytical method and was articulated and employed by sociologists like James S. Coleman, Harrison White, Linton Freeman, J. Clyde Mitchell, Mark Granovetter, Ronald Burt, and Barry Wellman. The increasing pervasiveness of computing and telecommunication technologies throughout the 1980s and 1990s demanded analytical techniques, such as network analysis and multilevel modeling, that could scale to increasingly complex and large data sets. The most recent wave of computational sociology, rather than employing simulations, uses network analysis and advanced statistical techniques to analyze large-scale computer databases of electronic proxies for behavioral data. Electronic records such as email and instant message records, hyperlinks on the World Wide Web, mobile phone usage, and discussion on Usenet allow social scientists to directly observe and analyze social behavior at multiple points in time and multiple levels of analysis without the constraints of traditional empirical methods such as interviews, participant observation, or survey instruments. Continued improvements in machine learning algorithms likewise have permitted social scientists and entrepreneurs to use novel techniques to identify latent and meaningful patterns of social interaction and evolution in large electronic datasets.&lt;br /&gt;
&lt;br /&gt;
'''社会网络分析 Social Network Analysis'''独立于社会系统计算模型的发展，在20世纪70年代和80年代出现于图论、统计学和社会结构的研究中，它作为一种独特的分析方法被社会学家如 James s. Coleman，Harrison White，Linton Freeman，J. Clyde Mitchell，Mark Granovetter，Ronald Burt 和 Barry Wellman 等阐述和采用。在整个1980年代和1990年代，计算和通信技术日益普及，这要求采用诸如网络分析和多级建模等分析技术，这些技术可以扩展到日益复杂和庞大的数据集中。最近的计算社会学没有使用模拟，而是使用网络分析和先进的统计技术来分析大规模&amp;lt;font color='blue'&amp;gt;电子服务器构成的&amp;lt;/font&amp;gt;计算机数据库中&amp;lt;s&amp;gt;电子代理&amp;lt;/s&amp;gt;的行为数据。电子记录，如电子邮件和即时消息记录，万维网上的超链接，移动电话数据，以及 Usenet 上的讨论，使社会科学家能够直接观察社会行为并在多个时间点和多个层次的分析行为，并且不受传统的实证方法，如访谈、观察（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]）为了通顺，删除研究对象/被试：participants）或调查工具的限制。机器学习算法的不断改进同样使得社会科学家和企业家能够使用新技术来识别大型电子数据集中潜在但有意义的社会互动和演化模式。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:Tripletsnew2012.png|thumb|right|Narrative network of US Elections 2012&amp;lt;ref name=&amp;quot;ReferenceA&amp;quot;&amp;gt;{{cite journal|title=Automated analysis of the US presidential elections using Big Data and network analysis|author1=S Sudhahar|author2=GA Veltri|author3=N Cristianini|journal=Big Data &amp;amp; Society|volume=2|issue=1|pages=1–28|year=2015|doi=10.1177/2053951715572916|doi-access=free}}&amp;lt;/ref&amp;gt;]]&lt;br /&gt;
&lt;br /&gt;
Narrative network of US Elections 2012&lt;br /&gt;
&lt;br /&gt;
【图2：Narrative network of US Elections 2012 + 2012年美国大选叙事网络】&lt;br /&gt;
&lt;br /&gt;
The automatic parsing of textual corpora has enabled the extraction of actors and their relational networks on a vast scale, turning textual data into network data.  The resulting networks, which can contain thousands of nodes, are then analysed by using tools from Network theory to identify the key actors, the key communities or parties, and general properties such as robustness or structural stability of the overall network, or centrality of certain nodes.&amp;lt;ref&amp;gt;{{cite journal|title=Network analysis of narrative content in large corpora|author1=S Sudhahar|author2=G De Fazio|author3=R Franzosi|author4=N Cristianini|journal=Natural Language Engineering|volume=21|issue=1|pages=1–32|year=2013|doi=10.1017/S1351324913000247 |url=https://research-information.bristol.ac.uk/files/129621186/Network_Analysis_of_Narrative_Content_in_Large_Corpora.pdf}}&amp;lt;/ref&amp;gt; This automates the approach introduced by quantitative narrative analysis,&amp;lt;ref&amp;gt;{{cite book|title=Quantitative Narrative Analysis|last=Franzosi|first=Roberto|publisher=Emory University|year=2010}}&amp;lt;/ref&amp;gt; whereby subject-verb-object triplets are identified with pairs of actors linked by an action, or pairs formed by actor-object.&amp;lt;ref name=&amp;quot;ReferenceA&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The automatic parsing of textual corpora has enabled the extraction of actors and their relational networks on a vast scale, turning textual data into network data.  The resulting networks, which can contain thousands of nodes, are then analysed by using tools from Network theory to identify the key actors, the key communities or parties, and general properties such as robustness or structural stability of the overall network, or centrality of certain nodes. This automates the approach introduced by quantitative narrative analysis, whereby subject-verb-object triplets are identified with pairs of actors linked by an action, or pairs formed by actor-object.&lt;br /&gt;
&lt;br /&gt;
文本语料库的自动解析使对参与者及其关系网络的大规模提取成为可能，它将文本数据转换为网络数据。由此产生的网络可以包含数千个'''节点 Nodes'''，然后利用网络理论中的工具对其进行分析，以确定关键参与者、关键群体，以及网络的总体特性如稳健性、结构稳定性，或某些节点的'''中心性 Centrality'''等。这使'''定量叙事分析Quantitative Narrative Analysis'''引入的方法得以自动化，据此，主语-动词-宾语三元组被看作由动作连接的成对行为者，或者由行为者-宾语形成的成对行为者。&lt;br /&gt;
&lt;br /&gt;
===Computational content analysis 计算&amp;lt;font color='red'&amp;gt;&amp;lt;s&amp;gt;机&amp;lt;/s&amp;gt;&amp;lt;/font&amp;gt;内容分析 （名词翻译可吗？）===&lt;br /&gt;
&lt;br /&gt;
[[Content analysis]] has been a traditional part of social sciences and media studies for a long time. The automation of content analysis has allowed a &amp;quot;[[big data]]&amp;quot; revolution to take place in that field, with studies in social media and newspaper content that include millions of news items. [[Gender bias]], [[readability]], content similarity, reader preferences, and even mood have been analyzed based on [[text mining]] methods over millions of documents.&amp;lt;ref&amp;gt;{{cite journal|author1=I. Flaounas|author2=M. Turchi|author3=O. Ali|author4=N. Fyson|author5=T. De Bie|author6=N. Mosdell|author7=J. Lewis|author8=N. Cristianini|title=The Structure of EU Mediasphere|journal=PLOS One|volume=5|issue=12|pages=e14243|year=2010|doi=10.1371/journal.pone.0014243|url=https://orca-mwe.cf.ac.uk/50732/1/Flaounas%202010.pdf|pmid=21170383|pmc=2999531|bibcode=2010PLoSO...514243F}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|title=Nowcasting Events from the Social Web with Statistical Learning|author1=V Lampos|author2=N Cristianini|journal=ACM Transactions on Intelligent Systems and Technology |volume=3|issue=4|page=72|doi=10.1145/2337542.2337557|year=2012|url=http://www.lampos.net/sites/default/files/papers/lampos2012nowcasting.pdf}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite conference|title=NOAM: news outlets analysis and monitoring system|author1=I. Flaounas|author2=O. Ali|author3=M. Turchi|author4=T Snowsill|author5=F Nicart|author6=T De Bie|author7=N Cristianini|conference=Proc. of the 2011 ACM SIGMOD international conference on Management of data|year=2011|url=http://www.tijldebie.net/system/files/SIGMOD_11_demo_Ilias.pdf|doi=10.1145/1989323.1989474}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite book|author=N Cristianini|title=''Combinatorial Pattern Matching''|pages=2–13|year=2011|volume=6661|series= Lecture Notes in Computer Science|isbn=978-3-642-21457-8|doi=10.1007/978-3-642-21458-5_2|chapter=Automatic Discovery of Patterns in Media Content|citeseerx=10.1.1.653.9525}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite journal|last=Lansdall-Welfare|first=Thomas|last2=Sudhahar|first2=Saatviga|last3=Thompson|first3=James|last4=Lewis|first4=Justin|last5=Team|first5=FindMyPast Newspaper|last6=Cristianini|first6=Nello|date=2017-01-09|title=Content analysis of 150 years of British periodicals|url=http://www.pnas.org/content/early/2017/01/03/1606380114|journal=Proceedings of the National Academy of Sciences|volume=114|issue=4|language=en|pages=E457–E465|doi=10.1073/pnas.1606380114|issn=0027-8424|pmid=28069962|pmc=5278459}}&amp;lt;/ref&amp;gt; The analysis of readability, gender bias and topic bias was demonstrated in Flaounas et al.&amp;lt;ref&amp;gt;{{cite journal|author1=I. Flaounas|author2=O. Ali|author3=M. Turchi|author4=T. Lansdall-Welfare|author5=T. De Bie|author6=N. Mosdell|author7=J. Lewis|author8=N. Cristianini|title=Research methods in the age of digital journalism|journal=Digital Journalism|year=2012|doi=10.1080/21670811.2012.714928|volume=1|pages=102–116}}&amp;lt;/ref&amp;gt; showing how different topics have different gender biases and levels of readability; the possibility to detect mood shifts in a vast population by analysing Twitter content was demonstrated as well.&amp;lt;ref&amp;gt;{{cite conference|title=Effects of the Recession on Public Mood in the UK|author=T Lansdall-Welfare|author2=V Lampos|author3=N Cristianini|series=Mining Social Network Dynamics (MSND) session on Social Media Applications|doi=10.1145/2187980.2188264|conference=Proceedings of the 21st International Conference on World Wide Web|pages=1221–1226|location=New York, NY, USA|url=http://www.cs.bris.ac.uk/Publications/Papers/2001521.pdf}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Content analysis has been a traditional part of social sciences and media studies for a long time. The automation of content analysis has allowed a &amp;quot;big data&amp;quot; revolution to take place in that field, with studies in social media and newspaper content that include millions of news items. Gender bias, readability, content similarity, reader preferences, and even mood have been analyzed based on text mining methods over millions of documents. The analysis of readability, gender bias and topic bias was demonstrated in Flaounas et al. showing how different topics have different gender biases and levels of readability; the possibility to detect mood shifts in a vast population by analysing Twitter content was demonstrated as well.&lt;br /&gt;
&lt;br /&gt;
长期以来，内容分析一直是社会科学和媒体研究的传统方法。内容分析的自动化使得这一领域发生了一场“大数据”革命，这些研究中，社交媒体和报纸内容包括了数百万条的新闻。基于&amp;lt;font color='blue'&amp;gt;数以百万计的文档和&amp;lt;/font&amp;gt;文本挖掘方法，'''性别偏差Gender Bias'''、'''可读性 Readability'''、'''内容相似度 Content Similarity'''、'''读者偏好 Reader Preferences'''，甚至是'''情绪 Mood'''&amp;lt;s&amp;gt;的数以百万计的文档&amp;lt;/s&amp;gt;都可以被分析。Flaounas等人对可读性、性别偏差和'''话题偏差 Topic Bias'''&amp;lt;s&amp;gt;为主要研究对象&amp;lt;/s&amp;gt;&amp;lt;font color='blue'&amp;gt;的研究&amp;lt;/font&amp;gt;，展示了不同的话题如何有不同&amp;lt;s&amp;gt;水平&amp;lt;/s&amp;gt;的性别偏差和可读性&amp;lt;font color='blue'&amp;gt;水平&amp;lt;/font&amp;gt;; &amp;lt;s&amp;gt;展示了&amp;lt;/s&amp;gt;&amp;lt;font color='blue'&amp;gt;以及&amp;lt;/font&amp;gt;通过分析推特内容来检测人群情绪变化的可能性。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The analysis of vast quantities of historical newspaper content has been pioneered by Dzogang et al.,&amp;lt;ref&amp;gt;{{Cite journal|last=Dzogang|first=Fabon|last2=Lansdall-Welfare|first2=Thomas|last3=Team|first3=FindMyPast Newspaper|last4=Cristianini|first4=Nello|date=2016-11-08|title=Discovering Periodic Patterns in Historical News|journal=PLOS One|volume=11|issue=11|pages=e0165736|doi=10.1371/journal.pone.0165736|issn=1932-6203|pmc=5100883|pmid=27824911|bibcode=2016PLoSO..1165736D}}&amp;lt;/ref&amp;gt; which showed how periodic structures can be automatically discovered in historical newspapers. A similar analysis was performed on social media, again revealing strongly periodic structures.&amp;lt;ref&amp;gt;[https://core.ac.uk/download/pdf/83929129.pdf Seasonal Fluctuations in Collective Mood Revealed by Wikipedia Searches and Twitter Posts] F Dzogang, T Lansdall-Welfare, N Cristianini - 2016 IEEE International Conference on Data Mining, Workshop on ''Data Mining'' in Human Activity Analysis&lt;br /&gt;
&lt;br /&gt;
The analysis of vast quantities of historical newspaper content has been pioneered by Dzogang et al., which showed how periodic structures can be automatically discovered in historical newspapers. A similar analysis was performed on social media, again revealing strongly periodic structures.&amp;lt;ref&amp;gt;[https://core.ac.uk/download/pdf/83929129.pdf Seasonal Fluctuations in Collective Mood Revealed by Wikipedia Searches and Twitter Posts] F Dzogang, T Lansdall-Welfare, N Cristianini - 2016 IEEE International Conference on Data Mining, Workshop on Data Mining in Human Activity Analysis&lt;br /&gt;
&lt;br /&gt;
对大量历史报纸内容的分析是由 Dzogang 等人率先进行的，他们展示了如何在历史报纸中自动发现'''周期结构 Periodic Structures'''。一个类似的社交媒体上进行的分析，也揭示了强烈的周期性结构。 参考文献[ https://core.ac.uk/download/pdf/83929129.pdf 维基百科搜索和推特帖子揭示的集体情绪的季节性波动] f Dzogang，t Lansdall-Welfare，n Cristianini-2016 IEEE International Conference on Data Mining, Workshop on Data Mining in Human Activity Analysis&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
==Challenges 挑战==&lt;br /&gt;
&lt;br /&gt;
Computational sociology, as with any field of study, faces a set of challenges.&amp;lt;ref name=&amp;quot;MCSS&amp;quot;&amp;gt;Conte, Rosaria, et al. &amp;quot;[https://link.springer.com/content/pdf/10.1140%252Fepjst%252Fe2012-01697-8.pdf Manifesto of computational social science].&amp;quot; The European Physical Journal Special Topics 214.1 (2012): 325-346.&amp;lt;/ref&amp;gt; These challenges need to be handled meaningfully so as to make the maximum impact on society.&lt;br /&gt;
&lt;br /&gt;
Computational sociology, as with any field of study, faces a set of challenges. These challenges need to be handled meaningfully so as to make the maximum impact on society.&lt;br /&gt;
&lt;br /&gt;
计算社会学和其他研究领域一样面临着一系列的挑战。必须有意义&amp;lt;font color='blue'&amp;gt;（目的？针对性？）&amp;lt;/font&amp;gt;地处理这些挑战（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） meaningfully怎么翻译才比较通顺？--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|讨论]](这个词确实不好翻译)），才能对社会产生最大的影响。&lt;br /&gt;
  &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Levels and their interactions 层级和层级的交互关系===&lt;br /&gt;
&lt;br /&gt;
Each society that is formed tends to be in one level or the other and there exists tendencies of interactions between and across these levels. Levels need not only be micro-level or macro-level in nature. There can be intermediate levels in which a society exists say - groups, networks, communities etc.&amp;lt;ref name=&amp;quot;MCSS&amp;quot; /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Each society that is formed tends to be in one level or the other and there exists tendencies of interactions between and across these levels. Levels need not only be micro-level or macro-level in nature. There can be intermediate levels in which a society exists say - groups, networks, communities etc.&lt;br /&gt;
&lt;br /&gt;
形成的每个社会都处于某种层次上，并且这些层次之间&amp;lt;font color='blue'&amp;gt;和跨层次间&amp;lt;/font&amp;gt;有相互作用的倾向。社会中的级别不仅可以分为微观或宏观的层次，还可以存在中间的层次，比如群体、网络、社区等。&lt;br /&gt;
（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） 合并了英文的原句）&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The question however arises as to how to identify these levels and how they come into existence? And once they are in existence how do they interact within themselves and with other levels?&lt;br /&gt;
&lt;br /&gt;
The question however arises as to how to identify these levels and how they come into existence? And once they are in existence how do they interact within themselves and with other levels?&lt;br /&gt;
&lt;br /&gt;
然而问题是，这些层次是如何确定的以及如何产生的？并且，一旦它们产生了，它们如何在自身内部以及与其他层次相互作用？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
If we view entities (agents) as nodes and the connections between them as the edges, we see the formation of networks. The connections in these networks do not come about based on just objective relationships between the entities, rather they are decided upon by factors chosen by the participating entities.&amp;lt;ref&amp;gt;{{cite journal|last1=Egu´ıluz|first1=V. M.|last2=Zimmermann|first2=M. G.|last3=Cela-Conde|first3=C. J.|last4=San Miguel|first4=M.|title=American Journal of Sociology|issue=2005|pages=110, 977}}&amp;lt;/ref&amp;gt; The challenge with this process is that, it is difficult to identify when a set of entities will form a network. These networks may be of trust networks, co-operation networks, dependence networks etc. There have been cases where heterogeneous set of entities have shown to form strong and meaningful networks among themselves.&amp;lt;ref&amp;gt;{{cite journal|last1=Sichman|first1=J. S.|last2=Conte|first2=R.|title=Computational &amp;amp; Mathematical Organization Theory|issue=2002|pages=8(2)}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Ehrhardt|first1=G.|last2=Marsili|first2=M.|last3=Vega-Redondo|first3=F.|title=Physical Review E|issue=2006|pages=74(3)}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
If we view entities (agents) as nodes and the connections between them as the edges, we see the formation of networks. The connections in these networks do not come about based on just objective relationships between the entities, rather they are decided upon by factors chosen by the participating entities. The challenge with this process is that, it is difficult to identify when a set of entities will form a network. These networks may be of trust networks, co-operation networks, dependence networks etc. There have been cases where heterogeneous set of entities have shown to form strong and meaningful networks among themselves.&lt;br /&gt;
&lt;br /&gt;
如果我们把'''实体 Entities'''（'''主体 Agents'''）看作节点，把它们之间的连接看作边，我们就看到了网络的形成。这些网络中的连接并非只是基于实体之间的客观关系，而是由实体选择的因素决定的。这个过程的困难之处在于，很难确定一组实体何时形成网络。这些网络可以是信任网络、合作网络、依赖网络等。在一些情况下，异质的实体集在它们之间形成了强大而有意义的网络。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
As discussed previously, societies fall into levels and in one such level, the individual level, a micro-macro link&amp;lt;ref&amp;gt;Billari, Francesco C. [https://books.google.com/books?hl=en&amp;amp;lr=&amp;amp;id=Tc8iL0b-OycC&amp;amp;oi=fnd&amp;amp;pg=PA1&amp;amp;dq=%22Agent-based+computational+modelling:+applications+in+demography,+social,+economic+and+environmental+sciences%22&amp;amp;ots=6MNVK7JP-e&amp;amp;sig=-o_iS9zCK3r-t1eHn3554UVadUs Agent-based computational modelling: applications in demography, social, economic and environmental sciences]. Taylor &amp;amp; Francis, 2006.&amp;lt;/ref&amp;gt; refers to the interactions which create higher-levels. There are a set of questions that needs to be answered regarding these Micro-Macro links. How they are formed? When do they converge? What is the feedback pushed to the lower levels and how are they pushed?&lt;br /&gt;
&lt;br /&gt;
As discussed previously, societies fall into levels and in one such level, the individual level, a micro-macro link refers to the interactions which create higher-levels. There are a set of questions that needs to be answered regarding these Micro-Macro links. How they are formed? When do they converge? What is the feedback pushed to the lower levels and how are they pushed?&lt;br /&gt;
&lt;br /&gt;
正如前面所讨论的，社会分为不同层次。在其中的一个层次：个体层次中，'''微观-宏观联系 Micro-macro Link'''指的是创造更高层次的相互作用。关于微观-宏观链接有一系列问题等待回答。它们是如何形成的？它们什么时候汇聚？什么反馈被推到了较低的层次，以及它们是如何被推到较低层次的？ &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Another major challenge in this category concerns the validity of information and their sources. In recent years there has been a boom in information gathering and processing. However, little attention was paid to the spread of false information between the societies. Tracing back the sources and finding ownership of such information is difficult.&lt;br /&gt;
&lt;br /&gt;
Another major challenge in this category concerns the validity of information and their sources. In recent years there has been a boom in information gathering and processing. However, little attention was paid to the spread of false information between the societies. Tracing back the sources and finding ownership of such information is difficult.&lt;br /&gt;
&lt;br /&gt;
这一分类的另一个主要挑战涉及信息的有效性及其来源。近年来，信息收集和处理有着蓬勃的发展。但人们很少注意到社会之间虚假信息的传播。追溯资料来源并找到这些资料的所有者是很困难的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Culture modeling 文化建模===&lt;br /&gt;
&lt;br /&gt;
The evolution of the networks and levels in the society brings about cultural diversity.&amp;lt;ref&amp;gt;{{cite journal|last1=Centola|first1=D.|last2=Gonz´alez-Avella|first2=J. C.|last3=Egu´ıluz|first3=V. M.|last4=San Miguel|first4=M.|title=Journal of Conflict Resolution|issue=2007|pages=51}}&amp;lt;/ref&amp;gt; A thought which arises however is that, when people tend to interact and become more accepting of other cultures and beliefs, how is it that diversity still persists? Why is there no convergence? A major challenge is how to model these diversities. Are there external factors like mass media, locality of societies etc. which influence the evolution or persistence of cultural diversities?{{Citation needed|reason=Sounds just like personal thoughts|date=May 2017}}&lt;br /&gt;
&lt;br /&gt;
The evolution of the networks and levels in the society brings about cultural diversity. A thought which arises however is that, when people tend to interact and become more accepting of other cultures and beliefs, how is it that diversity still persists? Why is there no convergence? A major challenge is how to model these diversities. Are there external factors like mass media, locality of societies etc. which influence the evolution or persistence of cultural diversities?&lt;br /&gt;
&lt;br /&gt;
社会网络和层次的演变带来了文化的多样性。然而人们会想，当人们倾向于相互作用，变得更能接受其他文化和信仰时，为什么多样性仍然存在？为什么人们没有趋同？一个主要的挑战是如何为这些多样性建立模型。是否存在大众传媒、社会地域性等外部因素，这些因素影响文化多样性的演化或保持？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Experimentation and evaluation 实验和评估===&lt;br /&gt;
&lt;br /&gt;
Any study or modelling when combined with experimentation needs to be able to address the questions being asked. [[Computational social science]] deals with large scale data and the challenge becomes much more evident as the scale grows. How would one design informative simulations on a large scale? And even if a large scale simulation is brought up, how is the evaluation supposed to be performed?&lt;br /&gt;
&lt;br /&gt;
Any study or modelling when combined with experimentation needs to be able to address the questions being asked. Computational social science deals with large scale data and the challenge becomes much more evident as the scale grows. How would one design informative simulations on a large scale? And even if a large scale simulation is brought up, how is the evaluation supposed to be performed?&lt;br /&gt;
&lt;br /&gt;
任何与实验结合的研究或建模都需要能够解决所提出的问题。计算社会科学处理大规模数据，并且数据规模越大建模的挑战就越明显。如何在一个大规模的数据集里设计信息仿真模型？并且，即使提出了一个大规模的仿真模型，应该如何对它进行评估？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Model choice and model complexities 模型选择和模型复杂性===&lt;br /&gt;
&lt;br /&gt;
Another challenge is identifying the models that would best fit the data and the complexities of these models. These models would help us predict how societies might evolve over time and provide possible explanations on how things work.&amp;lt;ref&amp;gt;Weisberg, Michael. [http://www.academia.edu/download/30604870/lessmorefinal.pdf When less is more: Tradeoffs and idealization in model building]. Diss. Stanford University, 2003.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Another challenge is identifying the models that would best fit the data and the complexities of these models. These models would help us predict how societies might evolve over time and provide possible explanations on how things work.&lt;br /&gt;
&lt;br /&gt;
另一个挑战是确定最适合数据的模型，以及最合适的'''模型复杂性 Model Complexities'''。这些模型将帮助我们预测随着时间的推移社会将如何演变，并为事物如何运动和变化提供可能的解释。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====Generative models 生成模型====&lt;br /&gt;
&lt;br /&gt;
Generative models helps us to perform extensive qualitative analysis in a controlled fashion. A model proposed by Epstein, is the agent-based simulation, which talks about identifying an initial set of heterogeneous entities (agents) and observe their evolution and growth based on simple local rules.&amp;lt;ref&amp;gt;Epstein, Joshua M. [https://www.researchgate.net/profile/Eric_Jones14/publication/283615593_Book_Review_-_Generative_Social_Science_Studies_in_Agent-Based_Computational_Modeling/links/5641398808aebaaea1f70216.pdf Generative social science: Studies in agent-based computational modeling]. Princeton University Press, 2006.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Generative models helps us to perform extensive qualitative analysis in a controlled fashion. A model proposed by Epstein, is the agent-based simulation, which talks about identifying an initial set of heterogeneous entities (agents) and observe their evolution and growth based on simple local rules.&lt;br /&gt;
&lt;br /&gt;
'''生成模型 Generative Models'''帮助我们以一种受控的方式进行广泛的定性分析。爱泼斯坦（Epstein）提出的一个基于主体的模型，就是探讨如何识别异质实体(主体)的'''初始集 Initial Set'''，并&amp;lt;s&amp;gt;根据简单的局部规则&amp;lt;/s&amp;gt;观察它们&amp;lt;font color='blue'&amp;gt;基于简单的局部规则带来&amp;lt;/font&amp;gt;的演化和增长。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
But what are these local rules? How does one identify them for a set of heterogeneous agents? Evaluation and impact of these rules state a whole new set of difficulties.&lt;br /&gt;
&lt;br /&gt;
But what are these local rules? How does one identify them for a set of heterogeneous agents? Evaluation and impact of these rules state a whole new set of difficulties.&lt;br /&gt;
&lt;br /&gt;
但是这些局部规则是什么呢？如何识别一组异质实体？这些规则的评估和影响都是新出现的困难之处。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====Heterogeneous or ensemble models 异质模型和组合模型====&lt;br /&gt;
&lt;br /&gt;
Integrating simple models which perform better on individual tasks to form a Hybrid model is an approach that can be looked into{{Citation needed|reason=unsupported claims|date=May 2017}}. These models can offer better performance and understanding of the data. However the trade-off of identifying and having a deep understanding of the interactions between these simple models arises when one needs to come up with one combined, well performing model. Also, coming up with tools and applications to help analyse and visualize the data based on these hybrid models is another added challenge.&lt;br /&gt;
&lt;br /&gt;
Integrating simple models which perform better on individual tasks to form a Hybrid model is an approach that can be looked into. These models can offer better performance and understanding of the data. However the trade-off of identifying and having a deep understanding of the interactions between these simple models arises when one needs to come up with one combined, well performing model. Also, coming up with tools and applications to help analyse and visualize the data based on these hybrid models is another added challenge.&lt;br /&gt;
&lt;br /&gt;
集成在单个任务中表现良好的简单模型并形成'''混合模型 Hybrid model'''是一种可以继续考虑的方法。这些模型有更好的性能并可以对数据提供更好的理解。然而，当需要提出一个整合的、性能良好的模型时，识别简单模型和深入理解模型之间相互作用的权衡问题就出现了。此外，另一个挑战是开发工具和应用程序来帮助分析和可视化基于这些混合模型的数据。&lt;br /&gt;
&lt;br /&gt;
==Impact 影响==&lt;br /&gt;
&lt;br /&gt;
Computational sociology can bring impacts to science, technology and society.&amp;lt;ref name=&amp;quot;MCSS&amp;quot; /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Computational sociology can bring impacts to science, technology and society.&lt;br /&gt;
&lt;br /&gt;
计算社会学可以给科学、技术和社会带来影响。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Impact on science 对科学的影响===&lt;br /&gt;
&lt;br /&gt;
In order for the study of computational sociology to be effective, there has to be valuable innovations. These innovation can be of the form of new data analytics tools, better models and algorithms. The advent of such innovation will be a boon for the scientific community in large. {{Citation needed|reason=citation for claim on innovation and the type of innovation|date=May 2017}}&lt;br /&gt;
&lt;br /&gt;
In order for the study of computational sociology to be effective, there has to be valuable innovations. These innovation can be of the form of new data analytics tools, better models and algorithms. The advent of such innovation will be a boon for the scientific community in large. &lt;br /&gt;
&lt;br /&gt;
为了使计算社会学的研究有效，必须有一些有价值的创新。这些创新可以是新形式的数据分析工具，或更好的模型和算法。这些创新的出现将为整个科学界带来益处。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Impact on society 对社会的影响===&lt;br /&gt;
&lt;br /&gt;
One of the major challenges of computational sociology is the modelling of social processes {{Citation needed|reason=to support the claim for need of modeling of social processes|date=May 2017}}. Various law and policy makers would be able to see efficient and effective paths to issue new guidelines and the mass in general would be able to evaluate and gain fair understanding of the options presented in front of them enabling an open and well balanced decision process. {{Citation needed|reason=unsupported claims|date=May 2017}}.&lt;br /&gt;
&lt;br /&gt;
One of the major challenges of computational sociology is the modelling of social processes . Various law and policy makers would be able to see efficient and effective paths to issue new guidelines and the mass in general would be able to evaluate and gain fair understanding of the options presented in front of them enabling an open and well balanced decision process. &lt;br /&gt;
&lt;br /&gt;
计算社会学的主要挑战之一是对社会过程的建模。各种法律和政策制定者将能够得到发布新指导方针的快速有效的方法，广大群众将能够评价和更好地理解各种备选方案，从而实现决策进程的公开和平衡。&lt;br /&gt;
&lt;br /&gt;
==Journals and academic publications 期刊和学术出版物==&lt;br /&gt;
&lt;br /&gt;
The most relevant journal of the discipline is the [[Journal of Artificial Societies and Social Simulation]].&lt;br /&gt;
&lt;br /&gt;
The most relevant journal of the discipline is the Journal of Artificial Societies and Social Simulation.&lt;br /&gt;
&lt;br /&gt;
该学科最相关的期刊是《人工社会与社会模拟（the Journal of Artificial Societies and Social Simulation）》。&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20100611121626/http://www.ccsr.uiuc.edu/web/Journals/Journals.html Complexity Research Journal List], from UIUC, IL 复杂研究期刊列表（资料来自伊利诺伊大学香槟分校）&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20100611091342/http://www.ccsr.uiuc.edu/web/Groups/Groups.html Related Research Groups], from UIUC, IL 相关研究组（资料来自伊利诺伊大学香槟分校）&lt;br /&gt;
&lt;br /&gt;
==Associations, conferences and workshops 协会、会议及工作坊==&lt;br /&gt;
&lt;br /&gt;
*[http://www.casos.cs.cmu.edu/naacsos/ North American Association for Computational Social and Organization Sciences]&lt;br /&gt;
&lt;br /&gt;
*[http://www.essa.eu.org/ ESSA: European Social Simulation Association]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Academic programs, departments and degrees 学术课程、院系和学位==&lt;br /&gt;
&lt;br /&gt;
* [http://mediapatterns.enm.bris.ac.uk/ University of Bristol &amp;quot;Mediapatterns&amp;quot; project]&lt;br /&gt;
&lt;br /&gt;
* [http://www.cos.cs.cmu.edu/ Carnegie Mellon University], [http://www.casos.cs.cmu.edu PhD program] in Computation, Organizations and Society (COS)&lt;br /&gt;
&lt;br /&gt;
* [http://www.uchicago.edu University of Chicago]&lt;br /&gt;
&lt;br /&gt;
** [https://macss.uchicago.edu/ Certificate, MA and PhD in Computational Social Sciences]&lt;br /&gt;
&lt;br /&gt;
* [http://www.gmu.edu George Mason University]&lt;br /&gt;
&lt;br /&gt;
** PhD program in [http://css.gmu.edu CSS (Computational Social Sciences)]&lt;br /&gt;
&lt;br /&gt;
** MA program in [http://mais.gmu.edu/programs/la-mais-css Master's of Interdisciplinary Studies, CSS emphasis]&lt;br /&gt;
&lt;br /&gt;
* [http://www.pdx.edu/sysc/program-systems-science-phd-program Portland State], PhD program in Systems Science&lt;br /&gt;
&lt;br /&gt;
* [http://www.pdx.edu/sysc/program-systems-science-masters-program Portland State], MS program in Systems Science&lt;br /&gt;
&lt;br /&gt;
* [http://www.ucd.ie University College Dublin], &lt;br /&gt;
&lt;br /&gt;
** PhD Program in [http://www.ucd.ie/geary/postgraduatetraining/cscs Complex Systems and Computational Social Science]&lt;br /&gt;
&lt;br /&gt;
** MSc in [https://sisweb.ucd.ie/usis/!W_HU_MENU.P_PUBLISH?p_tag=PROG&amp;amp;MAJR=W390 Social Data Analytics] &lt;br /&gt;
&lt;br /&gt;
** BSc in [https://www.myucd.ie/courses/social-sciences/computational-social-science Computational Social Science] &lt;br /&gt;
&lt;br /&gt;
* [https://archive.is/20121215023745/http://hcs.ucla.edu/courses.htm UCLA], Minor in Human Complex Systems&lt;br /&gt;
&lt;br /&gt;
* [http://www.cs.ucla.edu/~cyber/ UCLA], Major in Computational &amp;amp; Systems Biology (including behavioral sciences)&lt;br /&gt;
&lt;br /&gt;
* [http://cscs.umich.edu/education/undergrad/undergrad.html Univ. of Michigan], Minor in Complex Systems&lt;br /&gt;
&lt;br /&gt;
* [http://www.pdx.edu/sysc/resources-other-systems-science-programs Systems Sciences Programs List], Portland State.  List of other worldwide related programs.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Centers and institutes 中心和机构==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===North America 北美===&lt;br /&gt;
&lt;br /&gt;
* [http://cnets.indiana.edu/ Center for Complex Networks and Systems Research], Indiana University, Bloomington, IN, USA.&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20110430200327/http://www.ccsr.uiuc.edu/ Center for Complex Systems Research], University of Illinois at Urbana-Champaign, IL, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://socialcomplexity.gmu.edu/ Center for Social Complexity], George Mason University, Fairfax, VA, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.asu.edu/clas/csdc/ Center for Social Dynamics and Complexity], Arizona State University, Tempe, AZ, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.cscs.umich.edu/ Center of the Study of Complex Systems], University of Michigan, Ann Arbor, MI, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://hcs.ucla.edu/ Human Complex Systems], University of California Los Angeles, Los Angeles, CA, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.iq.harvard.edu/ Institute for Quantitative Social Science], Harvard University, Boston, MA, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.nico.northwestern.edu/ Northwestern Institute on Complex Systems (NICO)], Northwestern University, Evanston, IL USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.santafe.edu/ Santa Fe Institute], Santa Fe, NM, USA.&lt;br /&gt;
&lt;br /&gt;
* Duke Network Analysis Center, [[Duke University]], Durham, NC, USA&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===South America 南美===&lt;br /&gt;
&lt;br /&gt;
* [http://www5.each.usp.br/mestrado-academico-em-modelagem-de-sistemas-complexos/ Modelagem de Sistemas Complexos], University of São Paulo - EACH, São Paulo, SP, Brazil&lt;br /&gt;
&lt;br /&gt;
* [http://inct.cnpq.br/web/inct-sc Instituto Nacional de Ciência e Tecnologia de Sistemas Complexos], Centro Brasileiro de Pesquisas Físicas, Rio de Janeiro, RJ, Brazil&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Europe 欧洲===&lt;br /&gt;
&lt;br /&gt;
* [http://cfpm.org Centre for Policy Modelling], Manchester, UK.&lt;br /&gt;
&lt;br /&gt;
* [http://cress.soc.surrey.ac.uk/ Centre for Research in Social Simulation], University of Surrey, UK.&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20130425014018/http://dl.ucd.ie/ UCD Dynamics Lab- Centre for Computational Social Science], Geary Institute for Public Policy, University College Dublin, Ireland.&lt;br /&gt;
&lt;br /&gt;
* [http://www.rug.nl/research/gcscs/ Groningen Center for Social Complexity Studies (GCSCS)], Groningen, NL.&lt;br /&gt;
&lt;br /&gt;
* [http://www.soms.ethz.ch/ Chair of Sociology, in particular of Modeling and Simulation (SOMS)], Zürich, Switzerland.&lt;br /&gt;
&lt;br /&gt;
* [http://www.eco.unibs.it/gecs/ Research Group on Experimental and Computational Sociology (GECS)], Brescia, IT.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Asia 亚洲===&lt;br /&gt;
&lt;br /&gt;
* [http://bandungfe.net Bandung Fe Institute, Centre for Complexity in Surya University], Bandung, Indonesia.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== See also 参见==&lt;br /&gt;
&lt;br /&gt;
* [[Artificial society]] 人工社会&lt;br /&gt;
&lt;br /&gt;
* [[Simulated reality]] 虚拟现实&lt;br /&gt;
&lt;br /&gt;
* [[Social simulation]] 社会仿真&lt;br /&gt;
&lt;br /&gt;
* [[Agent-based social simulation]] 基于主体的社会仿真&lt;br /&gt;
&lt;br /&gt;
* [[Social complexity]] 社会复杂性&lt;br /&gt;
&lt;br /&gt;
* [[Computational economics]] 计算经济学&lt;br /&gt;
&lt;br /&gt;
* [[Computational epidemiology]] 计算流行病学&lt;br /&gt;
&lt;br /&gt;
* [[Cliodynamics]] 历史动力学&lt;br /&gt;
&lt;br /&gt;
* [[Predictive analytics]] 预测分析&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&lt;br /&gt;
{{reflist|35em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==External links 外部链接==&lt;br /&gt;
&lt;br /&gt;
*[http://cress.soc.surrey.ac.uk/s4ss/ On-line book &amp;quot;Simulation for the Social Scientist&amp;quot; by Nigel Gilbert and Klaus G. Troitzsch, 1999, second edition 2005 社会科学家的仿真建模 电子书 作者：Nigel Gilbert and Klaus G. Troitzsch 第二版（2005年版）]&lt;br /&gt;
&lt;br /&gt;
*[http://jasss.soc.surrey.ac.uk/JASSS.html Journal of Artificial Societies and Social Simulation 人工社会和社会建模仿真期刊]&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20110516072744/http://cmol.nbi.dk/models/ Agent based models for social networks, interactive java applets 基于主体的社会网络模型，交互式 java 小程序]&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20090827052722/http://www.personal.kent.edu/~bcastel3/ Sociology and Complexity Science Website 社会学与复杂性科学网站]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:Subfields of sociology]]&lt;br /&gt;
&lt;br /&gt;
Category:Subfields of sociology&lt;br /&gt;
&lt;br /&gt;
范畴: 社会学的子领域&lt;br /&gt;
&lt;br /&gt;
[[Category:Complex systems theory]]&lt;br /&gt;
&lt;br /&gt;
Category:Complex systems theory&lt;br /&gt;
&lt;br /&gt;
范畴: 复杂系统理论&lt;br /&gt;
&lt;br /&gt;
[[Category:Methods in sociology]]&lt;br /&gt;
&lt;br /&gt;
Category:Methods in sociology&lt;br /&gt;
&lt;br /&gt;
范畴: 社会学方法&lt;br /&gt;
&lt;br /&gt;
[[Category:Computational fields of study]]&lt;br /&gt;
&lt;br /&gt;
Category:Computational fields of study&lt;br /&gt;
&lt;br /&gt;
类别: 研究的计算领域&lt;br /&gt;
&lt;br /&gt;
&amp;lt;noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;small&amp;gt;This page was moved from [[wikipedia:en:Computational sociology]]. Its edit history can be viewed at [[社会计算/edithistory]]&amp;lt;/small&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:待整理页面]]&lt;br /&gt;
&lt;br /&gt;
== 编者推荐 ==&lt;br /&gt;
=== 书籍推荐 ===&lt;br /&gt;
====[https://e.jd.com/30159646.html 社会计算的基本方法与应用]====&lt;br /&gt;
这是中科院自动化所的王飞跃老师关于社会计算的专著，从利用计算技术解决社会问题的角度介绍社会计算。阅读难度可能较高。&lt;br /&gt;
&lt;br /&gt;
=== 集智推荐 ===&lt;br /&gt;
====[https://campus.swarma.org/course/1028 2019 International Conference of Social Computing]====&lt;br /&gt;
本课程是2019年8月26日、27日的2019 International Conference of Social Computing记录。教师团队由芝加哥大学社会学系James Evans教授，Science University of Gottingen傅晓明教授，清华大学罗家德教授，电子科技大学周涛教授等多位老师组成。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://campus.swarma.org/course/1016 复杂系统与社会计算研讨会]====&lt;br /&gt;
本课程是，2019年10月27日北京计算科学研究中心主办的复杂系统与社会计算研讨会活动记录。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://pattern.swarma.org/path?id=12 计算社会科学入门路径]====&lt;br /&gt;
计算社会科学诞生至今，已有将近10年。在自然科学领域已经广泛应用大数据、分布式计算等方式提高研究质量的今天，社会科学领域涉及到的核心数据仍然被少数机构所拥有并创造着巨大的价值。本文将从计算社会科学的发展历史，常用方法，以及前沿问题来给大家粗略地展示计算社会科学的脉络。&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E7%A4%BE%E4%BC%9A%E8%AE%A1%E7%AE%97&amp;diff=11211</id>
		<title>社会计算</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E7%A4%BE%E4%BC%9A%E8%AE%A1%E7%AE%97&amp;diff=11211"/>
		<updated>2020-07-26T14:25:07Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：/* Computational content analysis 计算机内容分析 （名词翻译可吗？） */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;#重定向 [[社会计算]]&lt;br /&gt;
此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。&lt;br /&gt;
{{sociology}}&amp;lt;onlyinclude&amp;gt;&amp;lt;!-- &lt;br /&gt;
&lt;br /&gt;
&amp;lt;onlyinclude&amp;gt;&amp;lt;!-- &lt;br /&gt;
&lt;br /&gt;
只包括! -- &lt;br /&gt;
&lt;br /&gt;
While editing this lead/intro, please keep your text BELOW this line - this will make it easier to automatically insert the lede into other articles --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
  While editing this lead/intro, please keep your text BELOW this line - this will make it easier to automatically insert the lede into other articles --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
当编辑这个导语 / 介绍，请保持你的文本下面这行-这将使它更容易自动插入到其他文章的莱德-&lt;br /&gt;
&lt;br /&gt;
'''Computational sociology''' is a branch of [[sociology]] that uses computationally intensive methods to analyze and model social phenomena. Using [[computer simulation]]s, [[artificial intelligence]], complex statistical methods, and analytic approaches like [[social network analysis]], computational sociology develops and tests theories of complex social processes through bottom-up modeling of social interactions.&amp;lt;ref name=&amp;quot;MW&amp;quot;&amp;gt;{{cite journal|doi=10.1146/annurev.soc.28.110601.141117|title=From Factors to Actors: Computational Sociology and Agent-Based Modeling |first1=Michael W. |last1=Macy |first2=Robert |last2=Willer |journal=Annual Review of Sociology |volume=28 |pages=143–166 |jstor=3069238|year=2002}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Computational sociology is a branch of sociology that uses computationally intensive methods to analyze and model social phenomena. Using computer simulations, artificial intelligence, complex statistical methods, and analytic approaches like social network analysis, computational sociology develops and tests theories of complex social processes through bottom-up modeling of social interactions.&lt;br /&gt;
&lt;br /&gt;
'''计算社会学 Computational Sociology''' 是社会学的一个分支，它使用计算密集型方法来分析和模拟社会现象。&amp;lt;font color='red'&amp;gt;计算社会学通过使用计算机模拟、人工智能、复杂统计方法以及社会网络分析等分析方法自下而上地建立社会互动模型，是建立并检验复杂社会过程的理论。&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;  借助计算机模拟、人工智能、复杂统计方法以及社会网络分析等分析方法，计算社会学通过自下而上地建立社会互动模型来发展和检验关于复杂社会过程的理论。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
It involves the understanding of social agents, the interaction among these agents, and the effect of these interactions on the social aggregate.&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;&amp;gt;{{cite book|last1=Gilbert |first1=Nigel |last2=Troitzsch |first2=Klaus |year=2005 |title=Simulation for Social Scientists |edition=2 |chapter=Simulation and social science |publisher=Open University Press |chapter-url=http://cress.soc.surrey.ac.uk/s4ss/}}&amp;lt;/ref&amp;gt; Although the subject matter and methodologies in [[social science]] differ from those in [[natural science]] or [[computer science]], several of the approaches used in contemporary [[social simulation]] originated from fields such as [[physics]] and [[artificial intelligence]].&amp;lt;ref name=&amp;quot;Artificial Societies&amp;quot;&amp;gt;{{cite book|last1=Epstein |first1=Joshua M. |last2=Axtell |first2=Robert |year=1996 |title=Growing Artificial Societies: Social Science from the Bottom Up |location=Washington DC |publisher=Brookings Institution Press|url=https://archive.org/details/growingartificia00epst|url-access=registration |isbn=978-0262050531 }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;Cooperation&amp;quot;&amp;gt;{{cite book|last1=Axelrod |first1=Robert |year=1997 |title=The Complexity of Cooperation: Agent-Based Models of Competition and Collaboration |location=Princeton, NJ |publisher=Princeton University Press}}&amp;lt;/ref&amp;gt; Some of the approaches that originated in this field have been imported into the natural sciences, such as measures of [[centrality|network centrality]] from the fields of [[social network analysis]] and [[network science]].&lt;br /&gt;
&lt;br /&gt;
It involves the understanding of social agents, the interaction among these agents, and the effect of these interactions on the social aggregate. Although the subject matter and methodologies in social science differ from those in natural science or computer science, several of the approaches used in contemporary social simulation originated from fields such as physics and artificial intelligence. Some of the approaches that originated in this field have been imported into the natural sciences, such as measures of network centrality from the fields of social network analysis and network science.&lt;br /&gt;
&lt;br /&gt;
它涉及理解社会行为主体和它们的相互作用，以及这些相互作用如何影响社会总体(--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） social aggregate--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|讨论]]） 我觉得这样翻译是ok的)。虽然社会科学的主题和方法不同于自然科学或计算机科学，但当代社会仿真模拟中使用的一些方法起源于物理学和人工智能等领域。这一领域的一些方法，如来自社会网络分析和网络科学领域的网络中心性度量方法等，早已被引入到自然科学中。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In relevant literature, computational sociology is often related to the study of [[social complexity]].&amp;lt;ref&amp;gt;{{cite journal|last=Casti |first=J |year=1999 |title=The Computer as Laboratory: Toward a Theory of Complex Adaptive Systems |journal=Complexity |volume=4 |issue=5 |pages=12–14 |doi=10.1002/(SICI)1099-0526(199905/06)4:5&amp;lt;12::AID-CPLX3&amp;gt;3.0.CO;2-4}}&amp;lt;/ref&amp;gt; Social complexity concepts such as [[complex systems]], [[non-linear]] interconnection among macro and micro process, and [[emergence]], have entered the vocabulary of computational sociology.&amp;lt;ref&amp;gt;{{cite journal|last=Goldspink |first=C |year=2002 |title=Methodological Implications of Complex Systems Approaches to Sociality: Simulation as a Foundation for Knowledge |url=http://jasss.soc.surrey.ac.uk/5/1/3.html |publisher=Journal of Artificial Societies and Social Simulation |volume=5 |issue=1}}&amp;lt;/ref&amp;gt; A practical and well-known example is the construction of a computational model in the form of an &amp;quot;[[artificial society]]&amp;quot;, by which researchers can analyze the structure of a [[Social structure|social system]].&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;Generative&amp;quot;&amp;gt;{{cite book|last=Epstein |first=Joshua |year=2007 |title=Generative Social Science: Studies in Agent-Based Computational Modeling |location=Princeton, NJ |publisher=Princeton University Press|url=https://www.researchgate.net/publication/283615593}}&lt;br /&gt;
&lt;br /&gt;
In relevant literature, computational sociology is often related to the study of social complexity. Social complexity concepts such as complex systems, non-linear interconnection among macro and micro process, and emergence, have entered the vocabulary of computational sociology. A practical and well-known example is the construction of a computational model in the form of an &amp;quot;artificial society&amp;quot;, by which researchers can analyze the structure of a social system.&lt;br /&gt;
&lt;br /&gt;
在相关文献中，计算社会学经常与社会复杂性的研究有关。复杂系统、宏观和微观过程之间的非线性关联、涌现等社会复杂性概念已经进入计算社会学的词汇。一个实际而著名的例子是建立“'''人工社会 Artificial Society'''”的计算模型，通过它研究人员可以分析一个社会系统的结构。 &lt;br /&gt;
&lt;br /&gt;
While editing this lead/intro, please keep your text ABOVE this line - this will make it easier to automatically insert the lede into other articles - thanks!  &lt;br /&gt;
&lt;br /&gt;
While editing this lead/intro, please keep your text ABOVE this line - this will make it easier to automatically insert the lede into other articles - thanks!  &lt;br /&gt;
&lt;br /&gt;
当编辑这个引导 / 介绍，请保持你的文本以上这一行-这将使它更容易自动插入到其他文章的莱德-谢谢！&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;&amp;lt;/onlyinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;&amp;lt;/onlyinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
-- / 只包括&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==History 历史==&lt;br /&gt;
&lt;br /&gt;
{{see also|Sociology and complexity science}}&lt;br /&gt;
&lt;br /&gt;
[[File:Complexity-map-with-sociolo.png|thumb|right|300px|Historical map of research paradigms and associated scientists in [[sociology and complexity science]].]]&lt;br /&gt;
&lt;br /&gt;
Historical map of research paradigms and associated scientists in [[sociology and complexity science.]]&lt;br /&gt;
&lt;br /&gt;
【图1：Historical map of research paradigms and associated scientists in [[sociology and complexity science＋社会学和复杂性中的研究范式和科学家的历史地图】&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Background 背景===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In the past four decades, computational sociology has been introduced and gaining popularity {{According to whom|date=June 2017}}.  This has been used primarily for modeling or building explanations of social processes and are depending on the emergence of complex behavior from simple activities.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;&amp;gt;Salgado, Mauricio, and Nigel Gilbert. &amp;quot;[http://epubs.surrey.ac.uk/749319/1/Emergence%20and%20Communication%20-%20V3%201.pdf Emergence and communication in computational sociology].&amp;quot; Journal for the Theory of Social Behaviour 43.1 (2013): 87-110.&amp;lt;/ref&amp;gt;  The idea behind emergence is that properties of any bigger system do not always have to be properties of the components that the system is made of.&amp;lt;ref&amp;gt;Macy, Michael W., and Robert Willer. &amp;quot;[http://sct.uab.cat/lsds/sites/sct.uab.cat.lsds/files/FROM%20FACTORS%20TO%20ACTORS%20(Macy%20and%20Willer%202002).pdf From factors to actors: computational sociology and agent-based modeling].&amp;quot; Annual review of sociology 28.1 (2002): 143-166.&amp;lt;/ref&amp;gt;  The people responsible for the introduction of the idea of emergence are Alexander, Morgan, and Broad, who were classical emergentists.  The time at which these emergentists came up with this concept and method was during the time of the early twentieth century.  The aim of this method was to find a good enough accommodation between two different and extreme ontologies, which were reductionist materialism and dualism.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;/&amp;gt; &lt;br /&gt;
&lt;br /&gt;
In the past four decades, computational sociology has been introduced and gaining popularity.  This has been used primarily for modeling or building explanations of social processes and are depending on the emergence of complex behavior from simple activities.  The idea behind emergence is that properties of any bigger system do not always have to be properties of the components that the system is made of.  The people responsible for the introduction of the idea of emergence are Alexander, Morgan, and Broad, who were classical emergentists.  The time at which these emergentists came up with this concept and method was during the time of the early twentieth century.  The aim of this method was to find a good enough accommodation between two different and extreme ontologies, which were reductionist materialism and dualism. &lt;br /&gt;
&lt;br /&gt;
在过去的四十年里，计算社会学诞生并且越来越受欢迎。这主要用于建模或构建社会过程的解释，并且依赖于从简单活动中'''涌现 Emergence'''的复杂行为。涌现背后的思想是，任何较大系统不总是必须和组成系统的部分具有一样的性质。引入涌现思想的人是亚历山大 Alexander、摩根 Morgan和布罗德 Broad，他们都是'''经典涌现主义者 Classical Emergentists'''。经典涌现主义者提出这个概念和方法的时间是在二十世纪初期。这种方法的目的是在还原论的唯物主义和二元论这两种不同的本体论之间找到一个足够好的调和。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
While emergence has had a valuable and important role with the foundation of Computational Sociology, there are those who do not necessarily agree.  One major leader in the field, Epstein, doubted the use because there were aspects that are unexplainable.  Epstein put up a claim against emergentism, in which he says it &amp;quot;is precisely the generative sufficiency of the parts that constitutes the whole's explanation&amp;quot;.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
While emergence has had a valuable and important role with the foundation of Computational Sociology, there are those who do not necessarily agree.  One major leader in the field, Epstein, doubted the use because there were aspects that are unexplainable.  Epstein put up a claim against emergentism, in which he says it &amp;quot;is precisely the generative sufficiency of the parts that constitutes the whole's explanation&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
虽然涌现在计算社会学的建立上发挥了宝贵而重要的作用，但也有人不太同意。该领域的一个主要人物爱泼斯坦 Epstein对这种&amp;lt;font color='red'&amp;gt;用法&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;概念&amp;lt;/font&amp;gt;持怀疑态度，因为有些方面是这个&amp;lt;font color='red'&amp;gt;用法&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;概念&amp;lt;/font&amp;gt;无法解释的。爱泼斯坦提出了一种反对“涌现主义”的观点，他表示:“&amp;lt;font color=='red'&amp;gt;正是这些部分的有生成意义的充分性构成了对整体的解释&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;  正是这些部分所产生的充分性构成了对整体的解释&amp;lt;/font&amp;gt;”。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Agent-based models have had a historical influence on Computational Sociology.   These models first came around in the 1960s, and were used to simulate control and feedback processes in organizations, cities, etc.  During the 1970s, the application introduced the use of individuals as the main units for the analyses and used bottom-up strategies for modeling behaviors.  The last wave occurred in the 1980s.  At this time, the models were still bottom-up; the only difference is that the agents interact interdependently.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Agent-based models have had a historical influence on Computational Sociology. These models first came around in the 1960s, and were used to simulate control and feedback processes in organizations, cities, etc.  During the 1970s, the application introduced the use of individuals as the main units for the analyses and used bottom-up strategies for modeling behaviors.  The last wave occurred in the 1980s.  At this time, the models were still bottom-up; the only difference is that the agents interact interdependently.&lt;br /&gt;
&lt;br /&gt;
'''基于主体的模型 Agent-based Models'''对计算社会学有着历史性的影响。这些模型最早出现在20世纪60年代，用于仿真模拟组织、城市等系统的控制和反馈过程。在20世纪70年代，&amp;lt;font color='red'&amp;gt;应用程序&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; ABM模型&amp;lt;/font&amp;gt;引入个体作为主要的分析单元，并使用自下而上的策略来对行为建模。最后一波浪潮发生在20世纪80年代。那时，模型仍然是自下而上的; 唯一的区别是主体之间具有互相依赖和相互作用。&lt;br /&gt;
&lt;br /&gt;
===Systems theory and structural functionalism 系统理论和结构功能主义===&lt;br /&gt;
&lt;br /&gt;
{{main|Systems theory|Structural functionalism}}&lt;br /&gt;
&lt;br /&gt;
In the post-war era, [[Vannevar Bush]]'s [[differential analyser]], [[John von Neumann]]'s [[Von Neumann cellular automata|cellular automata]], [[Norbert Wiener]]'s [[cybernetics]], and [[Claude Shannon]]'s [[information theory]] became influential paradigms for modeling and understanding complexity in technical systems. In response, scientists in disciplines such as physics, biology, electronics, and economics began to articulate a [[systems theory|general theory of systems]] in which all natural and physical phenomena are manifestations of interrelated elements in a system that has common patterns and properties. Following [[Émile Durkheim]]'s call to analyze complex modern society ''[[sui generis]]'',&amp;lt;ref&amp;gt;{{cite book|first=Émile |last=Durkheim |title=The Division of Labor in Society |location=New York, NY |publisher=Macmillan}}&amp;lt;/ref&amp;gt; post-war structural functionalist sociologists such as [[Talcott Parsons]] seized upon these theories of systematic and hierarchical interaction among constituent components to attempt to generate grand unified sociological theories, such as the [[AGIL paradigm]].&amp;lt;ref name=&amp;quot;Bailey&amp;quot;&amp;gt;{{cite book|first1=Kenneth D. |last1=Bailey |editor=Jonathan H. Turner |chapter=Systems Theory |title=Handbook of Sociological Theory |publisher=Springer Science |year=2006 |location=New York, NY |isbn=978-0-387-32458-6 |pages=379–404}}&amp;lt;/ref&amp;gt; Sociologists such as [[George Homans]] argued that sociological theories should be formalized into hierarchical structures of propositions and precise terminology from which other propositions and hypotheses could be derived and operationalized into empirical studies.&amp;lt;ref name=&amp;quot;Blackwell&amp;quot;&amp;gt;{{cite encyclopedia|year=2007 |title=Computational Sociology |last=Bainbridge |first=William Sims |encyclopedia=Blackwell Encyclopedia of Sociology |publisher=Blackwell Reference Online |url=http://www.sociologyencyclopedia.com/subscriber/tocnode?id=g9781405124331_chunk_g97814051243319_ss1-85 |doi=10.1111/b.9781405124331.2007.x |hdl=10138/224218 |editor=Ritzer, George|isbn=978-1-4051-2433-1|hdl-access=free }}&amp;lt;/ref&amp;gt; Because computer algorithms and programs had been used as early as 1956 to test and validate mathematical theorems, such as the [[four color theorem]],&amp;lt;ref&amp;gt;{{cite book|last=Crevier |first=D. |year=1993 |title=AI: The Tumultuous History of the Search for Artificial Intelligence |url=https://archive.org/details/aitumultuoushist00crev |url-access=registration |publisher=Basic Books |location=New York, NY}}&amp;lt;/ref&amp;gt; some scholars anticipated that similar computational approaches could &amp;quot;solve&amp;quot; and &amp;quot;prove&amp;quot; analogously formalized problems and theorems of social structures and dynamics.&lt;br /&gt;
&lt;br /&gt;
In the post-war era, Vannevar Bush's differential analyser, John von Neumann's cellular automata, Norbert Wiener's cybernetics, and Claude Shannon's information theory became influential paradigms for modeling and understanding complexity in technical systems. In response, scientists in disciplines such as physics, biology, electronics, and economics began to articulate a general theory of systems in which all natural and physical phenomena are manifestations of interrelated elements in a system that has common patterns and properties. Following Émile Durkheim's call to analyze complex modern society sui generis, post-war structural functionalist sociologists such as Talcott Parsons seized upon these theories of systematic and hierarchical interaction among constituent components to attempt to generate grand unified sociological theories, such as the AGIL paradigm. Sociologists such as George Homans argued that sociological theories should be formalized into hierarchical structures of propositions and precise terminology from which other propositions and hypotheses could be derived and operationalized into empirical studies. Because computer algorithms and programs had been used as early as 1956 to test and validate mathematical theorems, such as the four color theorem, some scholars anticipated that similar computational approaches could &amp;quot;solve&amp;quot; and &amp;quot;prove&amp;quot; analogously formalized problems and theorems of social structures and dynamics.&lt;br /&gt;
&lt;br /&gt;
战后时期，范内瓦·布什（Vannevar Bush）的'''微分分析机 Differential Analyser''' 、冯·诺伊曼（John von Neumann）的'''元胞自动机 Cellular Automata'''、 维纳（Norbert Wiener）的'''控制论 Cybernetics'''和克劳德·香农（Claude Shannon）的'''信息论 Information Theory'''成为技术系统中建模和理解复杂性的重要范式。物理学、生物学、电子学和经济学等学科的科学家开始阐述系统的一般理论，即所有自然和物理现象都是具有共同模式和属性的系统中相互关联的元素的表现。&amp;lt;font color='red'&amp;gt;按照 &amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 沿着&amp;lt;/font&amp;gt;涂尔干（Émile Durkheim）分析特定的复杂现代社会&lt;br /&gt;
&lt;br /&gt;
（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]）Following Émile Durkheim's call to analyze complex modern society sui generis）&lt;br /&gt;
  --~~克劳德·香农（Claude Shannon）  这些同样去括号&lt;br /&gt;
&lt;br /&gt;
的&amp;lt;font color='red'&amp;gt;要求&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 思路&amp;lt;/font&amp;gt;，战后结构功能主义社会学家如帕森斯（Talcott Parsons）利用这些组成部分之间系统&amp;lt;font color='blue'&amp;gt;化&amp;lt;/font&amp;gt;和&amp;lt;font color='red'&amp;gt;等级&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 层次化&amp;lt;/font&amp;gt;相互作用的理论，试图产生大统一的社会学理论，如 AGIL 范式。霍曼斯（George Homans）等社会学家认为，社会学理论应该被构建为具有&amp;lt;font color='blue'&amp;gt;逻辑&amp;lt;/font&amp;gt;命题和精确术语的&amp;lt;font color='red'&amp;gt;等级&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 层次化&amp;lt;/font&amp;gt;结构，并且从中可以得出能够在实证研究中被操作化的其他命题和假设。由于早在1956年计算机算法和程序就已经被用来测试和验证数学定理（如'''四色定理Four Color Theorem'''），&amp;lt;font color='red'&amp;gt;一些学者预计相似的计算方法可以“解决”和“证明”类似的社会结构和动态的问题和定理。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 一些学者预计相似的计算方法可以“解释”和“证明”关于社会结构和演变的类似形式化的问题和定理。&amp;lt;/font&amp;gt;&lt;br /&gt;
--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|讨论]]formalized应该也要翻译出来，computational证明的是形式化定理)&lt;br /&gt;
&lt;br /&gt;
===Macrosimulation and microsimulation 宏观模拟和微观模拟===&lt;br /&gt;
&lt;br /&gt;
{{main|System dynamics|Microsimulation}}&lt;br /&gt;
&lt;br /&gt;
By the late 1960s and early 1970s, social scientists used increasingly available computing technology to perform macro-simulations of control and feedback processes in organizations, industries, cities, and global populations. These models used differential equations to predict population distributions as holistic functions of other systematic factors such as inventory control, urban traffic, migration, and disease transmission.&amp;lt;ref&amp;gt;{{cite book|first=Jay |last=Forrester |year=1971 |title=World Dynamics |location=Cambridge, MA |publisher=MIT Press}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|doi=10.1287/opre.26.2.237|title=Using Simulation to Develop and Validate Analytic Models: Some Case Studies |first1=Edward J. |last1=Ignall |first2=Peter |last2=Kolesar |first3=Warren E. |last3=Walker |journal=Operations Research |volume=26 |issue=2 |year=1978 |pages=237–253}}&amp;lt;/ref&amp;gt; Although simulations of social systems received substantial attention in the mid-1970s after the [[Club of Rome]] published reports predicting that policies promoting exponential economic growth would eventually bring global environmental catastrophe,&amp;lt;ref&amp;gt;{{cite book|title=The Dynamics of Growth in a Finite World |last1=Meadows |first1=DL |last2=Behrens |first2=WW |last3=Meadows |first3=DH |last4=Naill |first4=RF |last5= Randers |first5=J |last6=Zahn |first6=EK |year=1974 |location=Cambridge, MA |publisher=MIT Press}}&amp;lt;/ref&amp;gt; the inconvenient conclusions led many authors to seek to discredit the models, attempting to make the researchers themselves appear unscientific.&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;/&amp;gt;&amp;lt;ref&amp;gt;{{cite news|title=Computer View of Disaster Is Rebutted |newspaper=The New York Times |date=October 18, 1974|url=https://www.nytimes.com/1974/10/18/archives/computer-view-of-disaster-is-rebutted.html?_r=0}}&amp;lt;/ref&amp;gt; Hoping to avoid the same fate, many social scientists turned their attention toward micro-simulation models to make forecasts and study policy effects by modeling aggregate changes in state of individual-level entities rather than the changes in distribution at the population level.&amp;lt;ref&amp;gt;{{cite journal|doi=10.1016/0167-2681(90)90038-F|title=From engineering to microsimulation : An autobiographical reflection |journal=Journal of Economic Behavior &amp;amp; Organization |year=1990 |volume=14 |issue=1 |pages=5–27 |first=Guy H. |last=Orcutt}}&amp;lt;/ref&amp;gt; However, these micro-simulation models did not permit individuals to interact or adapt and were not intended for basic theoretical research.&amp;lt;ref name=&amp;quot;MW&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
By the late 1960s and early 1970s, social scientists used increasingly available computing technology to perform macro-simulations of control and feedback processes in organizations, industries, cities, and global populations. These models used differential equations to predict population distributions as holistic functions of other systematic factors such as inventory control, urban traffic, migration, and disease transmission. Although simulations of social systems received substantial attention in the mid-1970s after the Club of Rome published reports predicting that policies promoting exponential economic growth would eventually bring global environmental catastrophe, the inconvenient conclusions led many authors to seek to discredit the models, attempting to make the researchers themselves appear unscientific. Hoping to avoid the same fate, many social scientists turned their attention toward micro-simulation models to make forecasts and study policy effects by modeling aggregate changes in state of individual-level entities rather than the changes in distribution at the population level. However, these micro-simulation models did not permit individuals to interact or adapt and were not intended for basic theoretical research.&lt;br /&gt;
&lt;br /&gt;
截至20世纪60年代末70年代初，社会科学家越来越多地使用已有的计算技术，&amp;lt;s&amp;gt;在&amp;lt;/s&amp;gt;&amp;lt;font color='blue'&amp;gt;对&amp;lt;/font&amp;gt;组织、工业、城市和全球人口&amp;lt;s&amp;gt;中&amp;lt;/s&amp;gt;进行&amp;lt;font color='blue'&amp;gt;包含&amp;lt;/font&amp;gt;控制和反馈过程的'''宏观模拟 Macrosimulation''' 。这些模型使用微分方程作为其他系统因素的整体函数来预测人口分布，这些系统因素包括&amp;lt;font color='red'&amp;gt;库存&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 财产&amp;lt;/font&amp;gt;控制、城市交通、人口迁移和疾病传播等。&amp;lt;font color='red'&amp;gt;20世纪70年代中期，'''罗马俱乐部 Club of Rome''' 发表报告预测，促进指数式经济增长的政策最终将导致全球环境灾难，这个悲观的结论导致许多研究者试图反驳这些模型，并试图让研究显得不那么科学。&amp;lt;/font&amp;gt;&lt;br /&gt;
  （--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） 根据意思，inconvenient译为悲观的，因为这个结论预示了悲观的未来，所以令指出这一点的科学家们感到inconvenient）&lt;br /&gt;
  （--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟树|讨论]]） inconvenient的翻译没问题，不过好像缺失了Although simulations of social systems received substantial attention）&lt;br /&gt;
&amp;lt;font color='blue'&amp;gt; 20世纪70年代中期，尽管对社会系统的仿真获得了巨大的关注，但在'''罗马俱乐部 Club of Rome''' 发布预测报告称促进指数式经济增长的政策最终将导致全球环境灾难，这个悲观的结论导致许多研究者尝试抹黑这些(仿真)模型，并试图让(这些模型的)研究者自身显得不那么科学。&amp;lt;/font&amp;gt;&lt;br /&gt;
为了避免同样的情况，许多社会科学家将注意力转向'''微观模拟 Microsimulation'''模型。这些模型通过模拟个体状态的总体变化而不是总体人口级别的&amp;lt;font color='blue'&amp;gt;分布&amp;lt;/font&amp;gt;变化来进行预测和研究政策的效果。然而，这些微观模拟模型并不允许个体相互作用或适应、变化（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]）变化是根据适应（adapt）加上去的，不知道是否合理--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|讨论]]）我觉得ok），研究者也不打算将它们用于基础理论研究。&lt;br /&gt;
&lt;br /&gt;
===Cellular automata and agent-based modeling 元胞自动机和基于主体建模===&lt;br /&gt;
&lt;br /&gt;
{{main|Cellular automata|agent-based modeling}}&lt;br /&gt;
&lt;br /&gt;
The 1970s and 1980s were also a time when physicists and mathematicians were attempting to model and analyze how simple component units, such as atoms, give rise to global properties, such as complex material properties at low temperatures, in magnetic materials, and within turbulent flows.&amp;lt;ref&amp;gt;{{cite book|title=Cellular automata machines: a new environment for modeling |url=https://archive.org/details/cellularautomata00toff |url-access=registration |first1=Tommaso |last1=Toffoli |first2=Norman |last2=Margolus | author2-link = Norman Margolus |year=1987 |publisher=MIT Press |location=Cambridge, MA}}&amp;lt;/ref&amp;gt; Using cellular automata, scientists were able to specify systems consisting of a grid of cells in which each cell only occupied some finite states and changes between states were solely governed by the states of immediate neighbors. Along with advances in [[artificial intelligence]] and [[microcomputer]] power, these methods contributed to the development of &amp;quot;[[chaos theory]]&amp;quot; and &amp;quot;[[complex systems|complexity theory]]&amp;quot; which, in turn, renewed interest in understanding complex physical and social systems across disciplinary boundaries.&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;/&amp;gt; Research organizations explicitly dedicated to the interdisciplinary study of complexity were also founded in this era: the [[Santa Fe Institute]] was established in 1984 by scientists based at [[Los Alamos National Laboratory]] and the BACH group at the [[University of Michigan]] likewise started in the mid-1980s.&lt;br /&gt;
&lt;br /&gt;
The 1970s and 1980s were also a time when physicists and mathematicians were attempting to model and analyze how simple component units, such as atoms, give rise to global properties, such as complex material properties at low temperatures, in magnetic materials, and within turbulent flows. Using cellular automata, scientists were able to specify systems consisting of a grid of cells in which each cell only occupied some finite states and changes between states were solely governed by the states of immediate neighbors. Along with advances in artificial intelligence and microcomputer power, these methods contributed to the development of &amp;quot;chaos theory&amp;quot; and &amp;quot;complexity theory&amp;quot; which, in turn, renewed interest in understanding complex physical and social systems across disciplinary boundaries. Research organizations explicitly dedicated to the interdisciplinary study of complexity were also founded in this era: the Santa Fe Institute was established in 1984 by scientists based at Los Alamos National Laboratory and the BACH group at the University of Michigan likewise started in the mid-1980s.&lt;br /&gt;
&lt;br /&gt;
20世纪70年代和80年代，物理学家和数学家也在试图模拟和分析简单的组成单位如何产生整体特性，比如低温环境中原子在磁性材料和湍流中&amp;lt;font color='blue'&amp;gt;(表现出的)&amp;lt;/font&amp;gt;的复杂材料特性。使用'''元胞自动机 Cellular Automata'''，科学家们能够指定由元胞网格组成的系统，其中每个元胞只占据一些有限的状态，状态之间的变化完全由相邻元胞的状态控制。随着人工智能和微型计算机能力的进步，这些方法促进了“混沌理论”和“复杂性理论”的发展，这反过来又重新引起了人们对跨学科的复杂物理和社会系统的兴趣。明确致力于跨学科复杂性研究的机构也是在这个时代成立的: 圣菲研究所是由美国洛斯阿拉莫斯国家实验室（Los Alamos National Laboratory）的科学家于1984年建立的，密歇根大学的 BACH 小组也是在20世纪80年代中期建立的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This cellular automata paradigm gave rise to a third wave of social simulation emphasizing agent-based modeling. Like micro-simulations, these models emphasized bottom-up designs but adopted four key assumptions that diverged from microsimulation: autonomy, interdependency, simple rules, and adaptive behavior.&amp;lt;ref name=&amp;quot;MW&amp;quot;/&amp;gt; Agent-based models are less concerned with predictive accuracy and instead emphasize theoretical development.&amp;lt;ref&amp;gt;{{cite journal |title=A simulation of the structure of academic science |journal=Sociological Research Online |volume=2 |issue=2 |pages=1–15 |year=1997 |first=Nigel |last=Gilbert |url=http://www.socresonline.org.uk/socresonline/2/2/3.html |doi=10.5153/sro.85 |access-date=2009-12-16 |archive-url=https://web.archive.org/web/19980524062306/http://www.socresonline.org.uk/socresonline/2/2/3.html |archive-date=1998-05-24 |url-status=dead }}&amp;lt;/ref&amp;gt; In 1981, mathematician and political scientist [[Robert Axelrod]] and evolutionary biologist [[W.D. Hamilton]] published a major paper in ''[[Science (journal)|Science]]'' titled &amp;quot;The Evolution of Cooperation&amp;quot; which used an agent-based modeling approach to demonstrate how social cooperation based upon reciprocity can be established and stabilized in a [[prisoner's dilemma]] game when agents followed simple rules of self-interest.&amp;lt;ref&amp;gt;{{cite journal|title=The Evolution of Cooperation |first1=Robert |last1=Axelrod |first2=William D. |last2=Hamilton |journal=Science |volume=211 |issue=4489 |pages=1390–1396 |doi=10.1126/science.7466396|pmid=7466396 |date=March 27, 1981|bibcode=1981Sci...211.1390A }}&amp;lt;/ref&amp;gt; Axelrod and Hamilton demonstrated that individual agents following a simple rule set of (1) cooperate on the first turn and (2) thereafter replicate the partner's previous action were able to develop &amp;quot;norms&amp;quot; of cooperation and sanctioning in the absence of canonical sociological constructs such as demographics, values, religion, and culture as preconditions or mediators of cooperation.&amp;lt;ref name=&amp;quot;Cooperation&amp;quot;/&amp;gt; Throughout the 1990s, scholars like [[William Sims Bainbridge]], [[Kathleen Carley]], [[Michael Macy]],  and [[John Skvoretz]] developed multi-agent-based models of [[generalized reciprocity]], [[prejudice]], [[social influence]], and organizational [[information processing]]. In 1999, [[Nigel Gilbert]] published the first textbook on Social Simulation: ''Simulation for the social scientist'' and established its most relevant journal: the [[Journal of Artificial Societies and Social Simulation]].&lt;br /&gt;
&lt;br /&gt;
This cellular automata paradigm gave rise to a third wave of social simulation emphasizing agent-based modeling. Like micro-simulations, these models emphasized bottom-up designs but adopted four key assumptions that diverged from microsimulation: autonomy, interdependency, simple rules, and adaptive behavior. In 1981, mathematician and political scientist Robert Axelrod and evolutionary biologist W.D. Hamilton published a major paper in Science titled &amp;quot;The Evolution of Cooperation&amp;quot; which used an agent-based modeling approach to demonstrate how social cooperation based upon reciprocity can be established and stabilized in a prisoner's dilemma game when agents followed simple rules of self-interest. Axelrod and Hamilton demonstrated that individual agents following a simple rule set of (1) cooperate on the first turn and (2) thereafter replicate the partner's previous action were able to develop &amp;quot;norms&amp;quot; of cooperation and sanctioning in the absence of canonical sociological constructs such as demographics, values, religion, and culture as preconditions or mediators of cooperation. Throughout the 1990s, scholars like William Sims Bainbridge, Kathleen Carley, Michael Macy,  and John Skvoretz developed multi-agent-based models of generalized reciprocity, prejudice, social influence, and organizational information processing. In 1999, Nigel Gilbert published the first textbook on Social Simulation: Simulation for the social scientist and established its most relevant journal: the Journal of Artificial Societies and Social Simulation.&lt;br /&gt;
&lt;br /&gt;
元胞自动机范式引发了强调'''基于主体建模 Agent-based Modeling'''的第三次社会模拟浪潮。与微观模拟一样，这些模型强调自下而上的设计，但采用了与微观模拟不同的四个关键假设: '''自主性 Autonomy'''、'''相互依赖性 Interdependency'''、'''简单规则 Simple Rules'''和'''适应性行为 Adaptive Behavior'''。1981年，数学家、政治学家阿克塞尔罗德（Robert Axelrod）和进化生物学家汉密尔顿（W.D. Hamilton）在《科学》杂志上发表了一篇名为《合作的进化》（The Evolution of Cooperation）的重要论文，该论文采用基于主体建模方法，论证了在一个囚徒困境中，当主体遵循简单的自利规则（rules of self-interest）时，互惠的社会合作是如何建立和稳定的。阿克塞尔罗德和汉密尔顿证明，主体遵循这样一套简单的规则: (1)在第一轮进行合作，(2)在其后重复伙伴以前的行动，能够在没有人口学差异、价值观、宗教和文化等社会规范作为合作的先决条件或中介的情况下制定合作和制裁的“规范”。整个20世纪90年代，像威廉·希姆斯·本布里奇（William Sims Bainbridge），Kathleen Carley，Michael Macy 和 John Skvoretz 这样的学者开发了&amp;lt;s&amp;gt;基于多主体的&amp;lt;/s&amp;gt;&amp;lt;font color='blue'&amp;gt;关于&amp;lt;/font&amp;gt;广义互惠、偏见、社会影响和组织信息处理模型&amp;lt;font color='blue'&amp;gt;的多主体模型&amp;lt;/font&amp;gt;。1999年，吉尔伯特（Nigel Gilbert）出版了第一本关于社会模拟&amp;lt;font color='blue'&amp;gt;的教科书&amp;lt;/font&amp;gt;: 《写给社会科学家的仿真模拟（Simulation for the social scientist）》&amp;lt;s&amp;gt;的教科书&amp;lt;/s&amp;gt;，并建立了它最相关的杂志: 人工社会和社会模拟杂志（the Journal of Artificial Societies and Social Simulation）。&lt;br /&gt;
&lt;br /&gt;
===Data mining and social network analysis 数据挖掘和社会网络分析===&lt;br /&gt;
&lt;br /&gt;
{{main|Data mining|Social network analysis}}&lt;br /&gt;
&lt;br /&gt;
--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） 少一段原文 &lt;br /&gt;
Independent from developments in computational models of social systems, social network analysis emerged in the 1970s and 1980s from advances in graph theory, statistics, and studies of social structure as a distinct analytical method and was articulated and employed by sociologists like James S. Coleman, Harrison White, Linton Freeman, J. Clyde Mitchell, Mark Granovetter, Ronald Burt, and Barry Wellman.[22] The increasing pervasiveness of computing and telecommunication technologies throughout the 1980s and 1990s demanded analytical techniques, such as network analysis and multilevel modeling, that could scale to increasingly complex and large data sets. The most recent wave of computational sociology, rather than employing simulations, uses network analysis and advanced statistical techniques to analyze large-scale computer databases of electronic proxies for behavioral data. Electronic records such as email and instant message records, hyperlinks on the World Wide Web, mobile phone usage, and discussion on Usenet allow social scientists to directly observe and analyze social behavior at multiple points in time and multiple levels of analysis without the constraints of traditional empirical methods such as interviews, participant observation, or survey instruments.[23] Continued improvements in machine learning algorithms likewise have permitted social scientists and entrepreneurs to use novel techniques to identify latent and meaningful patterns of social interaction and evolution in large electronic datasets.[24][25]&lt;br /&gt;
&lt;br /&gt;
Independent from developments in computational models of social systems, social network analysis emerged in the 1970s and 1980s from advances in graph theory, statistics, and studies of social structure as a distinct analytical method and was articulated and employed by sociologists like [[James Samuel Coleman|James S. Coleman]], [[Harrison White]], [[Linton Freeman]], [[J. Clyde Mitchell]], [[Mark Granovetter]], [[Ronald Burt]], and [[Barry Wellman]].&amp;lt;ref&amp;gt;{{cite book|title=The Development of Social Network Analysis: A Study in the Sociology of Science |first=Linton C. |last=Freeman |publisher=Empirical Press |location=Vancouver, BC |year=2004}}&amp;lt;/ref&amp;gt; The increasing pervasiveness of computing and telecommunication technologies throughout the 1980s and 1990s demanded analytical techniques, such as [[network theory|network analysis]] and [[multilevel modeling]], that could scale to increasingly complex and large data sets. The most recent wave of computational sociology, rather than employing simulations, uses network analysis and advanced statistical techniques to analyze large-scale computer databases of electronic proxies for behavioral data. Electronic records such as email and instant message records, hyperlinks on the [[World Wide Web]], mobile phone usage, and discussion on [[Usenet]] allow social scientists to directly observe and analyze social behavior at multiple points in time and multiple levels of analysis without the constraints of traditional empirical methods such as interviews, participant observation, or survey instruments.&amp;lt;ref&amp;gt;{{cite journal|title=Life in the network: the coming age of computational social science|first9=J|last10=Gutmann|first10=M.|last11=Jebara|first11=T.|last12=King|first12=G.|last13=Macy|first13=M.|last14=Roy|first14=D.|last15=Van Alstyne|first15=M.|last9=Fowler|first8=N|last8=Contractor|first7=N|last7=Christakis|first6=D|last6=Brewer|first5=AL|last5=Barabasi|first4=S |journal=Science|last4=Aral |date=February 6, 2009|first3=L |volume=323|pmid=19197046 |issue=5915|last3=Adamic |pages=721–723|pmc=2745217 |doi=10.1126/science.1167742 |first1=David |last1=Lazer |first2=Alex |last2=Pentland |display-authors=8}}&amp;lt;/ref&amp;gt; Continued improvements in [[machine learning]] algorithms likewise have permitted social scientists and entrepreneurs to use novel techniques to identify latent and meaningful patterns of social interaction and evolution in large electronic datasets.&amp;lt;ref&amp;gt;{{cite journal|first1=Jaideep |last1=Srivastava |first2=Robert |last2=Cooley |first3=Mukund |last3=Deshpande |first4=Pang-Ning |last4=Tan |journal=Proceedings of the ACM Conference on Knowledge Discovery and Data Mining |title=Web usage mining: discovery and applications of usage patterns from Web data|volume=1 |year=2000 |pages=12–23 |doi=10.1145/846183.846188|issue=2}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|doi=10.1016/S0169-7552(98)00110-X|title=The anatomy of a large-scale hypertextual Web search engine |first1=Sergey |last1=Brin |first2=Lawrence |last2=Page |journal=Computer Networks and ISDN Systems |volume=30 |issue=1–7 |pages=107–117 |date=April 1998|citeseerx=10.1.1.115.5930 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Independent from developments in computational models of social systems, social network analysis emerged in the 1970s and 1980s from advances in graph theory, statistics, and studies of social structure as a distinct analytical method and was articulated and employed by sociologists like James S. Coleman, Harrison White, Linton Freeman, J. Clyde Mitchell, Mark Granovetter, Ronald Burt, and Barry Wellman. The increasing pervasiveness of computing and telecommunication technologies throughout the 1980s and 1990s demanded analytical techniques, such as network analysis and multilevel modeling, that could scale to increasingly complex and large data sets. The most recent wave of computational sociology, rather than employing simulations, uses network analysis and advanced statistical techniques to analyze large-scale computer databases of electronic proxies for behavioral data. Electronic records such as email and instant message records, hyperlinks on the World Wide Web, mobile phone usage, and discussion on Usenet allow social scientists to directly observe and analyze social behavior at multiple points in time and multiple levels of analysis without the constraints of traditional empirical methods such as interviews, participant observation, or survey instruments. Continued improvements in machine learning algorithms likewise have permitted social scientists and entrepreneurs to use novel techniques to identify latent and meaningful patterns of social interaction and evolution in large electronic datasets.&lt;br /&gt;
&lt;br /&gt;
'''社会网络分析 Social Network Analysis'''独立于社会系统计算模型的发展，在20世纪70年代和80年代出现于图论、统计学和社会结构的研究中，它作为一种独特的分析方法被社会学家如 James s. Coleman，Harrison White，Linton Freeman，J. Clyde Mitchell，Mark Granovetter，Ronald Burt 和 Barry Wellman 等阐述和采用。在整个1980年代和1990年代，计算和通信技术日益普及，这要求采用诸如网络分析和多级建模等分析技术，这些技术可以扩展到日益复杂和庞大的数据集中。最近的计算社会学没有使用模拟，而是使用网络分析和先进的统计技术来分析大规模&amp;lt;font color='blue'&amp;gt;电子服务器构成的&amp;lt;/font&amp;gt;计算机数据库中&amp;lt;s&amp;gt;电子代理&amp;lt;/s&amp;gt;的行为数据。电子记录，如电子邮件和即时消息记录，万维网上的超链接，移动电话数据，以及 Usenet 上的讨论，使社会科学家能够直接观察社会行为并在多个时间点和多个层次的分析行为，并且不受传统的实证方法，如访谈、观察（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]）为了通顺，删除研究对象/被试：participants）或调查工具的限制。机器学习算法的不断改进同样使得社会科学家和企业家能够使用新技术来识别大型电子数据集中潜在但有意义的社会互动和演化模式。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:Tripletsnew2012.png|thumb|right|Narrative network of US Elections 2012&amp;lt;ref name=&amp;quot;ReferenceA&amp;quot;&amp;gt;{{cite journal|title=Automated analysis of the US presidential elections using Big Data and network analysis|author1=S Sudhahar|author2=GA Veltri|author3=N Cristianini|journal=Big Data &amp;amp; Society|volume=2|issue=1|pages=1–28|year=2015|doi=10.1177/2053951715572916|doi-access=free}}&amp;lt;/ref&amp;gt;]]&lt;br /&gt;
&lt;br /&gt;
Narrative network of US Elections 2012&lt;br /&gt;
&lt;br /&gt;
【图2：Narrative network of US Elections 2012 + 2012年美国大选叙事网络】&lt;br /&gt;
&lt;br /&gt;
The automatic parsing of textual corpora has enabled the extraction of actors and their relational networks on a vast scale, turning textual data into network data.  The resulting networks, which can contain thousands of nodes, are then analysed by using tools from Network theory to identify the key actors, the key communities or parties, and general properties such as robustness or structural stability of the overall network, or centrality of certain nodes.&amp;lt;ref&amp;gt;{{cite journal|title=Network analysis of narrative content in large corpora|author1=S Sudhahar|author2=G De Fazio|author3=R Franzosi|author4=N Cristianini|journal=Natural Language Engineering|volume=21|issue=1|pages=1–32|year=2013|doi=10.1017/S1351324913000247 |url=https://research-information.bristol.ac.uk/files/129621186/Network_Analysis_of_Narrative_Content_in_Large_Corpora.pdf}}&amp;lt;/ref&amp;gt; This automates the approach introduced by quantitative narrative analysis,&amp;lt;ref&amp;gt;{{cite book|title=Quantitative Narrative Analysis|last=Franzosi|first=Roberto|publisher=Emory University|year=2010}}&amp;lt;/ref&amp;gt; whereby subject-verb-object triplets are identified with pairs of actors linked by an action, or pairs formed by actor-object.&amp;lt;ref name=&amp;quot;ReferenceA&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The automatic parsing of textual corpora has enabled the extraction of actors and their relational networks on a vast scale, turning textual data into network data.  The resulting networks, which can contain thousands of nodes, are then analysed by using tools from Network theory to identify the key actors, the key communities or parties, and general properties such as robustness or structural stability of the overall network, or centrality of certain nodes. This automates the approach introduced by quantitative narrative analysis, whereby subject-verb-object triplets are identified with pairs of actors linked by an action, or pairs formed by actor-object.&lt;br /&gt;
&lt;br /&gt;
文本语料库的自动解析使对参与者及其关系网络的大规模提取成为可能，它将文本数据转换为网络数据。由此产生的网络可以包含数千个'''节点 Nodes'''，然后利用网络理论中的工具对其进行分析，以确定关键参与者、关键群体，以及网络的总体特性如稳健性、结构稳定性，或某些节点的'''中心性 Centrality'''等。这使'''定量叙事分析Quantitative Narrative Analysis'''引入的方法得以自动化，据此，主语-动词-宾语三元组被看作由动作连接的成对行为者，或者由行为者-宾语形成的成对行为者。&lt;br /&gt;
&lt;br /&gt;
===Computational content analysis 计算&amp;lt;font color='red'&amp;gt;&amp;lt;s&amp;gt;机&amp;lt;/s&amp;gt;&amp;lt;/font&amp;gt;内容分析 （名词翻译可吗？）===&lt;br /&gt;
&lt;br /&gt;
[[Content analysis]] has been a traditional part of social sciences and media studies for a long time. The automation of content analysis has allowed a &amp;quot;[[big data]]&amp;quot; revolution to take place in that field, with studies in social media and newspaper content that include millions of news items. [[Gender bias]], [[readability]], content similarity, reader preferences, and even mood have been analyzed based on [[text mining]] methods over millions of documents.&amp;lt;ref&amp;gt;{{cite journal|author1=I. Flaounas|author2=M. Turchi|author3=O. Ali|author4=N. Fyson|author5=T. De Bie|author6=N. Mosdell|author7=J. Lewis|author8=N. Cristianini|title=The Structure of EU Mediasphere|journal=PLOS One|volume=5|issue=12|pages=e14243|year=2010|doi=10.1371/journal.pone.0014243|url=https://orca-mwe.cf.ac.uk/50732/1/Flaounas%202010.pdf|pmid=21170383|pmc=2999531|bibcode=2010PLoSO...514243F}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|title=Nowcasting Events from the Social Web with Statistical Learning|author1=V Lampos|author2=N Cristianini|journal=ACM Transactions on Intelligent Systems and Technology |volume=3|issue=4|page=72|doi=10.1145/2337542.2337557|year=2012|url=http://www.lampos.net/sites/default/files/papers/lampos2012nowcasting.pdf}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite conference|title=NOAM: news outlets analysis and monitoring system|author1=I. Flaounas|author2=O. Ali|author3=M. Turchi|author4=T Snowsill|author5=F Nicart|author6=T De Bie|author7=N Cristianini|conference=Proc. of the 2011 ACM SIGMOD international conference on Management of data|year=2011|url=http://www.tijldebie.net/system/files/SIGMOD_11_demo_Ilias.pdf|doi=10.1145/1989323.1989474}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite book|author=N Cristianini|title=''Combinatorial Pattern Matching''|pages=2–13|year=2011|volume=6661|series= Lecture Notes in Computer Science|isbn=978-3-642-21457-8|doi=10.1007/978-3-642-21458-5_2|chapter=Automatic Discovery of Patterns in Media Content|citeseerx=10.1.1.653.9525}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite journal|last=Lansdall-Welfare|first=Thomas|last2=Sudhahar|first2=Saatviga|last3=Thompson|first3=James|last4=Lewis|first4=Justin|last5=Team|first5=FindMyPast Newspaper|last6=Cristianini|first6=Nello|date=2017-01-09|title=Content analysis of 150 years of British periodicals|url=http://www.pnas.org/content/early/2017/01/03/1606380114|journal=Proceedings of the National Academy of Sciences|volume=114|issue=4|language=en|pages=E457–E465|doi=10.1073/pnas.1606380114|issn=0027-8424|pmid=28069962|pmc=5278459}}&amp;lt;/ref&amp;gt; The analysis of readability, gender bias and topic bias was demonstrated in Flaounas et al.&amp;lt;ref&amp;gt;{{cite journal|author1=I. Flaounas|author2=O. Ali|author3=M. Turchi|author4=T. Lansdall-Welfare|author5=T. De Bie|author6=N. Mosdell|author7=J. Lewis|author8=N. Cristianini|title=Research methods in the age of digital journalism|journal=Digital Journalism|year=2012|doi=10.1080/21670811.2012.714928|volume=1|pages=102–116}}&amp;lt;/ref&amp;gt; showing how different topics have different gender biases and levels of readability; the possibility to detect mood shifts in a vast population by analysing Twitter content was demonstrated as well.&amp;lt;ref&amp;gt;{{cite conference|title=Effects of the Recession on Public Mood in the UK|author=T Lansdall-Welfare|author2=V Lampos|author3=N Cristianini|series=Mining Social Network Dynamics (MSND) session on Social Media Applications|doi=10.1145/2187980.2188264|conference=Proceedings of the 21st International Conference on World Wide Web|pages=1221–1226|location=New York, NY, USA|url=http://www.cs.bris.ac.uk/Publications/Papers/2001521.pdf}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Content analysis has been a traditional part of social sciences and media studies for a long time. The automation of content analysis has allowed a &amp;quot;big data&amp;quot; revolution to take place in that field, with studies in social media and newspaper content that include millions of news items. Gender bias, readability, content similarity, reader preferences, and even mood have been analyzed based on text mining methods over millions of documents. The analysis of readability, gender bias and topic bias was demonstrated in Flaounas et al. showing how different topics have different gender biases and levels of readability; the possibility to detect mood shifts in a vast population by analysing Twitter content was demonstrated as well.&lt;br /&gt;
&lt;br /&gt;
长期以来，内容分析一直是社会科学和媒体研究的传统方法。内容分析的自动化使得这一领域发生了一场“大数据”革命，这些研究中，社交媒体和报纸内容包括了数百万条的新闻。基于&amp;lt;font color='blue'&amp;gt;数以百万计的文档和&amp;lt;/font&amp;gt;文本挖掘方法，'''性别偏差Gender Bias'''、'''可读性 Readability'''、'''内容相似度 Content Similarity'''、'''读者偏好 Reader Preferences'''，甚至是'''情绪 Mood'''&amp;lt;s&amp;gt;的数以百万计的文档&amp;lt;/s&amp;gt;都可以被分析。Flaounas等人对可读性、性别偏差和'''话题偏差 Topic Bias'''&amp;lt;s&amp;gt;为主要研究对象&amp;lt;/s&amp;gt;&amp;lt;font color='blue'&amp;gt;的研究&amp;lt;/font&amp;gt;，展示了不同的话题如何有不同&amp;lt;s&amp;gt;水平&amp;lt;/s&amp;gt;的性别偏差和可读性&amp;lt;font color='blue'&amp;gt;水平&amp;lt;/font&amp;gt;; &amp;lt;s&amp;gt;展示了&amp;lt;/s&amp;gt;&amp;lt;font color='blue'&amp;gt;以及&amp;lt;/font&amp;gt;通过分析推特内容来检测人群情绪变化的可能性。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The analysis of vast quantities of historical newspaper content has been pioneered by Dzogang et al.,&amp;lt;ref&amp;gt;{{Cite journal|last=Dzogang|first=Fabon|last2=Lansdall-Welfare|first2=Thomas|last3=Team|first3=FindMyPast Newspaper|last4=Cristianini|first4=Nello|date=2016-11-08|title=Discovering Periodic Patterns in Historical News|journal=PLOS One|volume=11|issue=11|pages=e0165736|doi=10.1371/journal.pone.0165736|issn=1932-6203|pmc=5100883|pmid=27824911|bibcode=2016PLoSO..1165736D}}&amp;lt;/ref&amp;gt; which showed how periodic structures can be automatically discovered in historical newspapers. A similar analysis was performed on social media, again revealing strongly periodic structures.&amp;lt;ref&amp;gt;[https://core.ac.uk/download/pdf/83929129.pdf Seasonal Fluctuations in Collective Mood Revealed by Wikipedia Searches and Twitter Posts] F Dzogang, T Lansdall-Welfare, N Cristianini - 2016 IEEE International Conference on Data Mining, Workshop on ''Data Mining'' in Human Activity Analysis&lt;br /&gt;
&lt;br /&gt;
The analysis of vast quantities of historical newspaper content has been pioneered by Dzogang et al., which showed how periodic structures can be automatically discovered in historical newspapers. A similar analysis was performed on social media, again revealing strongly periodic structures.&amp;lt;ref&amp;gt;[https://core.ac.uk/download/pdf/83929129.pdf Seasonal Fluctuations in Collective Mood Revealed by Wikipedia Searches and Twitter Posts] F Dzogang, T Lansdall-Welfare, N Cristianini - 2016 IEEE International Conference on Data Mining, Workshop on Data Mining in Human Activity Analysis&lt;br /&gt;
&lt;br /&gt;
对大量历史报纸内容的分析是由 Dzogang 等人率先进行的，他们展示了如何在历史报纸中自动发现'''周期结构 Periodic Structures'''。一个类似的社交媒体上进行的分析，也揭示了强烈的周期性结构。 参考文献[ https://core.ac.uk/download/pdf/83929129.pdf 维基百科搜索和推特帖子揭示的集体情绪的季节性波动] f Dzogang，t Lansdall-Welfare，n Cristianini-2016 IEEE International Conference on Data Mining, Workshop on Data Mining in Human Activity Analysis&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
==Challenges 挑战==&lt;br /&gt;
&lt;br /&gt;
Computational sociology, as with any field of study, faces a set of challenges.&amp;lt;ref name=&amp;quot;MCSS&amp;quot;&amp;gt;Conte, Rosaria, et al. &amp;quot;[https://link.springer.com/content/pdf/10.1140%252Fepjst%252Fe2012-01697-8.pdf Manifesto of computational social science].&amp;quot; The European Physical Journal Special Topics 214.1 (2012): 325-346.&amp;lt;/ref&amp;gt; These challenges need to be handled meaningfully so as to make the maximum impact on society.&lt;br /&gt;
&lt;br /&gt;
Computational sociology, as with any field of study, faces a set of challenges. These challenges need to be handled meaningfully so as to make the maximum impact on society.&lt;br /&gt;
&lt;br /&gt;
计算社会学和其他研究领域一样面临着一系列的挑战。必须有意义地处理这些挑战（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） meaningfully怎么翻译才比较通顺？），才能对社会产生最大的影响。&lt;br /&gt;
  &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Levels and their interactions 层级和层级的交互关系===&lt;br /&gt;
&lt;br /&gt;
Each society that is formed tends to be in one level or the other and there exists tendencies of interactions between and across these levels. Levels need not only be micro-level or macro-level in nature. There can be intermediate levels in which a society exists say - groups, networks, communities etc.&amp;lt;ref name=&amp;quot;MCSS&amp;quot; /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Each society that is formed tends to be in one level or the other and there exists tendencies of interactions between and across these levels. Levels need not only be micro-level or macro-level in nature. There can be intermediate levels in which a society exists say - groups, networks, communities etc.&lt;br /&gt;
&lt;br /&gt;
形成的每个社会都处于某种层次上，并且这些层次之间有相互作用的倾向。社会中的级别不仅可以分为微观或宏观的层次，还可以存在中间的层次，比如群体、网络、社区等。&lt;br /&gt;
（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） 合并了英文的原句）&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The question however arises as to how to identify these levels and how they come into existence? And once they are in existence how do they interact within themselves and with other levels?&lt;br /&gt;
&lt;br /&gt;
The question however arises as to how to identify these levels and how they come into existence? And once they are in existence how do they interact within themselves and with other levels?&lt;br /&gt;
&lt;br /&gt;
然而问题是，这些层次是如何确定的以及如何产生的？并且，一旦它们产生了，它们如何在自身内部以及与其他层次相互作用？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
If we view entities (agents) as nodes and the connections between them as the edges, we see the formation of networks. The connections in these networks do not come about based on just objective relationships between the entities, rather they are decided upon by factors chosen by the participating entities.&amp;lt;ref&amp;gt;{{cite journal|last1=Egu´ıluz|first1=V. M.|last2=Zimmermann|first2=M. G.|last3=Cela-Conde|first3=C. J.|last4=San Miguel|first4=M.|title=American Journal of Sociology|issue=2005|pages=110, 977}}&amp;lt;/ref&amp;gt; The challenge with this process is that, it is difficult to identify when a set of entities will form a network. These networks may be of trust networks, co-operation networks, dependence networks etc. There have been cases where heterogeneous set of entities have shown to form strong and meaningful networks among themselves.&amp;lt;ref&amp;gt;{{cite journal|last1=Sichman|first1=J. S.|last2=Conte|first2=R.|title=Computational &amp;amp; Mathematical Organization Theory|issue=2002|pages=8(2)}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Ehrhardt|first1=G.|last2=Marsili|first2=M.|last3=Vega-Redondo|first3=F.|title=Physical Review E|issue=2006|pages=74(3)}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
If we view entities (agents) as nodes and the connections between them as the edges, we see the formation of networks. The connections in these networks do not come about based on just objective relationships between the entities, rather they are decided upon by factors chosen by the participating entities. The challenge with this process is that, it is difficult to identify when a set of entities will form a network. These networks may be of trust networks, co-operation networks, dependence networks etc. There have been cases where heterogeneous set of entities have shown to form strong and meaningful networks among themselves.&lt;br /&gt;
&lt;br /&gt;
如果我们把'''实体 Entities'''（'''主体 Agents'''）看作节点，把它们之间的连接看作边，我们就看到了网络的形成。这些网络中的连接并非只是基于实体之间的客观关系，而是由实体选择的因素决定的。这个过程的困难之处在于，很难确定一组实体何时形成网络。这些网络可以是信任网络、合作网络、依赖网络等。在一些情况下，异质的实体集在它们之间形成了强大而有意义的网络。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
As discussed previously, societies fall into levels and in one such level, the individual level, a micro-macro link&amp;lt;ref&amp;gt;Billari, Francesco C. [https://books.google.com/books?hl=en&amp;amp;lr=&amp;amp;id=Tc8iL0b-OycC&amp;amp;oi=fnd&amp;amp;pg=PA1&amp;amp;dq=%22Agent-based+computational+modelling:+applications+in+demography,+social,+economic+and+environmental+sciences%22&amp;amp;ots=6MNVK7JP-e&amp;amp;sig=-o_iS9zCK3r-t1eHn3554UVadUs Agent-based computational modelling: applications in demography, social, economic and environmental sciences]. Taylor &amp;amp; Francis, 2006.&amp;lt;/ref&amp;gt; refers to the interactions which create higher-levels. There are a set of questions that needs to be answered regarding these Micro-Macro links. How they are formed? When do they converge? What is the feedback pushed to the lower levels and how are they pushed?&lt;br /&gt;
&lt;br /&gt;
As discussed previously, societies fall into levels and in one such level, the individual level, a micro-macro link refers to the interactions which create higher-levels. There are a set of questions that needs to be answered regarding these Micro-Macro links. How they are formed? When do they converge? What is the feedback pushed to the lower levels and how are they pushed?&lt;br /&gt;
&lt;br /&gt;
正如前面所讨论的，社会分为不同层次。在其中的一个层次：个体层次中，'''微观-宏观联系 Micro-macro Link'''指的是创造更高层次的相互作用。关于微观-宏观链接有一系列问题等待回答。它们是如何形成的？它们什么时候汇聚？什么反馈被推到了较低的层次，以及它们是如何被推到较低层次的？ &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Another major challenge in this category concerns the validity of information and their sources. In recent years there has been a boom in information gathering and processing. However, little attention was paid to the spread of false information between the societies. Tracing back the sources and finding ownership of such information is difficult.&lt;br /&gt;
&lt;br /&gt;
Another major challenge in this category concerns the validity of information and their sources. In recent years there has been a boom in information gathering and processing. However, little attention was paid to the spread of false information between the societies. Tracing back the sources and finding ownership of such information is difficult.&lt;br /&gt;
&lt;br /&gt;
这一分类的另一个主要挑战涉及信息的有效性及其来源。近年来，信息收集和处理有着蓬勃的发展。但人们很少注意到社会之间虚假信息的传播。追溯资料来源并找到这些资料的所有者是很困难的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Culture modeling 文化建模===&lt;br /&gt;
&lt;br /&gt;
The evolution of the networks and levels in the society brings about cultural diversity.&amp;lt;ref&amp;gt;{{cite journal|last1=Centola|first1=D.|last2=Gonz´alez-Avella|first2=J. C.|last3=Egu´ıluz|first3=V. M.|last4=San Miguel|first4=M.|title=Journal of Conflict Resolution|issue=2007|pages=51}}&amp;lt;/ref&amp;gt; A thought which arises however is that, when people tend to interact and become more accepting of other cultures and beliefs, how is it that diversity still persists? Why is there no convergence? A major challenge is how to model these diversities. Are there external factors like mass media, locality of societies etc. which influence the evolution or persistence of cultural diversities?{{Citation needed|reason=Sounds just like personal thoughts|date=May 2017}}&lt;br /&gt;
&lt;br /&gt;
The evolution of the networks and levels in the society brings about cultural diversity. A thought which arises however is that, when people tend to interact and become more accepting of other cultures and beliefs, how is it that diversity still persists? Why is there no convergence? A major challenge is how to model these diversities. Are there external factors like mass media, locality of societies etc. which influence the evolution or persistence of cultural diversities?&lt;br /&gt;
&lt;br /&gt;
社会网络和层次的演变带来了文化的多样性。然而人们会想，当人们倾向于相互作用，变得更能接受其他文化和信仰时，为什么多样性仍然存在？为什么人们没有趋同？一个主要的挑战是如何为这些多样性建立模型。是否存在大众传媒、社会地域性等外部因素，这些因素影响文化多样性的演化或保持？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Experimentation and evaluation 实验和评估===&lt;br /&gt;
&lt;br /&gt;
Any study or modelling when combined with experimentation needs to be able to address the questions being asked. [[Computational social science]] deals with large scale data and the challenge becomes much more evident as the scale grows. How would one design informative simulations on a large scale? And even if a large scale simulation is brought up, how is the evaluation supposed to be performed?&lt;br /&gt;
&lt;br /&gt;
Any study or modelling when combined with experimentation needs to be able to address the questions being asked. Computational social science deals with large scale data and the challenge becomes much more evident as the scale grows. How would one design informative simulations on a large scale? And even if a large scale simulation is brought up, how is the evaluation supposed to be performed?&lt;br /&gt;
&lt;br /&gt;
任何与实验结合的研究或建模都需要能够解决所提出的问题。计算社会科学处理大规模数据，并且数据规模越大建模的挑战就越明显。如何在一个大规模的数据集里设计信息仿真模型？并且，即使提出了一个大规模的仿真模型，应该如何对它进行评估？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Model choice and model complexities 模型选择和模型复杂性===&lt;br /&gt;
&lt;br /&gt;
Another challenge is identifying the models that would best fit the data and the complexities of these models. These models would help us predict how societies might evolve over time and provide possible explanations on how things work.&amp;lt;ref&amp;gt;Weisberg, Michael. [http://www.academia.edu/download/30604870/lessmorefinal.pdf When less is more: Tradeoffs and idealization in model building]. Diss. Stanford University, 2003.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Another challenge is identifying the models that would best fit the data and the complexities of these models. These models would help us predict how societies might evolve over time and provide possible explanations on how things work.&lt;br /&gt;
&lt;br /&gt;
另一个挑战是确定最适合数据的模型，以及最合适的'''模型复杂性 Model Complexities'''。这些模型将帮助我们预测随着时间的推移社会将如何演变，并为事物如何运动和变化提供可能的解释。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====Generative models 生成模型====&lt;br /&gt;
&lt;br /&gt;
Generative models helps us to perform extensive qualitative analysis in a controlled fashion. A model proposed by Epstein, is the agent-based simulation, which talks about identifying an initial set of heterogeneous entities (agents) and observe their evolution and growth based on simple local rules.&amp;lt;ref&amp;gt;Epstein, Joshua M. [https://www.researchgate.net/profile/Eric_Jones14/publication/283615593_Book_Review_-_Generative_Social_Science_Studies_in_Agent-Based_Computational_Modeling/links/5641398808aebaaea1f70216.pdf Generative social science: Studies in agent-based computational modeling]. Princeton University Press, 2006.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Generative models helps us to perform extensive qualitative analysis in a controlled fashion. A model proposed by Epstein, is the agent-based simulation, which talks about identifying an initial set of heterogeneous entities (agents) and observe their evolution and growth based on simple local rules.&lt;br /&gt;
&lt;br /&gt;
'''生成模型 Generative Models'''帮助我们以一种受控的方式进行广泛的定性分析。爱泼斯坦（Epstein）提出的一个基于主体的模型，就是探讨如何识别异质实体(主体)的'''初始集 Initial Set'''，并根据简单的局部规则观察它们的演化和增长。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
But what are these local rules? How does one identify them for a set of heterogeneous agents? Evaluation and impact of these rules state a whole new set of difficulties.&lt;br /&gt;
&lt;br /&gt;
But what are these local rules? How does one identify them for a set of heterogeneous agents? Evaluation and impact of these rules state a whole new set of difficulties.&lt;br /&gt;
&lt;br /&gt;
但是这些局部规则是什么呢？如何识别一组异质实体？这些规则的评估和影响都是新出现的困难之处。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====Heterogeneous or ensemble models 异质模型和组合模型====&lt;br /&gt;
&lt;br /&gt;
Integrating simple models which perform better on individual tasks to form a Hybrid model is an approach that can be looked into{{Citation needed|reason=unsupported claims|date=May 2017}}. These models can offer better performance and understanding of the data. However the trade-off of identifying and having a deep understanding of the interactions between these simple models arises when one needs to come up with one combined, well performing model. Also, coming up with tools and applications to help analyse and visualize the data based on these hybrid models is another added challenge.&lt;br /&gt;
&lt;br /&gt;
Integrating simple models which perform better on individual tasks to form a Hybrid model is an approach that can be looked into. These models can offer better performance and understanding of the data. However the trade-off of identifying and having a deep understanding of the interactions between these simple models arises when one needs to come up with one combined, well performing model. Also, coming up with tools and applications to help analyse and visualize the data based on these hybrid models is another added challenge.&lt;br /&gt;
&lt;br /&gt;
集成在单个任务中表现良好的简单模型并形成'''混合模型 Hybrid model'''是一种可以继续考虑的方法。这些模型有更好的性能并可以对数据提供更好的理解。然而，当需要提出一个整合的、性能良好的模型时，识别简单模型和深入理解模型之间相互作用的权衡问题就出现了。此外，另一个挑战是开发工具和应用程序来帮助分析和可视化基于这些混合模型的数据。&lt;br /&gt;
&lt;br /&gt;
==Impact 影响==&lt;br /&gt;
&lt;br /&gt;
Computational sociology can bring impacts to science, technology and society.&amp;lt;ref name=&amp;quot;MCSS&amp;quot; /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Computational sociology can bring impacts to science, technology and society.&lt;br /&gt;
&lt;br /&gt;
计算社会学可以给科学、技术和社会带来影响。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Impact on science 对科学的影响===&lt;br /&gt;
&lt;br /&gt;
In order for the study of computational sociology to be effective, there has to be valuable innovations. These innovation can be of the form of new data analytics tools, better models and algorithms. The advent of such innovation will be a boon for the scientific community in large. {{Citation needed|reason=citation for claim on innovation and the type of innovation|date=May 2017}}&lt;br /&gt;
&lt;br /&gt;
In order for the study of computational sociology to be effective, there has to be valuable innovations. These innovation can be of the form of new data analytics tools, better models and algorithms. The advent of such innovation will be a boon for the scientific community in large. &lt;br /&gt;
&lt;br /&gt;
为了使计算社会学的研究有效，必须有一些有价值的创新。这些创新可以是新形式的数据分析工具，或更好的模型和算法。这些创新的出现将为整个科学界带来益处。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Impact on society 对社会的影响===&lt;br /&gt;
&lt;br /&gt;
One of the major challenges of computational sociology is the modelling of social processes {{Citation needed|reason=to support the claim for need of modeling of social processes|date=May 2017}}. Various law and policy makers would be able to see efficient and effective paths to issue new guidelines and the mass in general would be able to evaluate and gain fair understanding of the options presented in front of them enabling an open and well balanced decision process. {{Citation needed|reason=unsupported claims|date=May 2017}}.&lt;br /&gt;
&lt;br /&gt;
One of the major challenges of computational sociology is the modelling of social processes . Various law and policy makers would be able to see efficient and effective paths to issue new guidelines and the mass in general would be able to evaluate and gain fair understanding of the options presented in front of them enabling an open and well balanced decision process. &lt;br /&gt;
&lt;br /&gt;
计算社会学的主要挑战之一是对社会过程的建模。各种法律和政策制定者将能够得到发布新指导方针的快速有效的方法，广大群众将能够评价和更好地理解各种备选方案，从而实现决策进程的公开和平衡。&lt;br /&gt;
&lt;br /&gt;
==Journals and academic publications 期刊和学术出版物==&lt;br /&gt;
&lt;br /&gt;
The most relevant journal of the discipline is the [[Journal of Artificial Societies and Social Simulation]].&lt;br /&gt;
&lt;br /&gt;
The most relevant journal of the discipline is the Journal of Artificial Societies and Social Simulation.&lt;br /&gt;
&lt;br /&gt;
该学科最相关的期刊是《人工社会与社会模拟（the Journal of Artificial Societies and Social Simulation）》。&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20100611121626/http://www.ccsr.uiuc.edu/web/Journals/Journals.html Complexity Research Journal List], from UIUC, IL 复杂研究期刊列表（资料来自伊利诺伊大学香槟分校）&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20100611091342/http://www.ccsr.uiuc.edu/web/Groups/Groups.html Related Research Groups], from UIUC, IL 相关研究组（资料来自伊利诺伊大学香槟分校）&lt;br /&gt;
&lt;br /&gt;
==Associations, conferences and workshops 协会、会议及工作坊==&lt;br /&gt;
&lt;br /&gt;
*[http://www.casos.cs.cmu.edu/naacsos/ North American Association for Computational Social and Organization Sciences]&lt;br /&gt;
&lt;br /&gt;
*[http://www.essa.eu.org/ ESSA: European Social Simulation Association]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Academic programs, departments and degrees 学术课程、院系和学位==&lt;br /&gt;
&lt;br /&gt;
* [http://mediapatterns.enm.bris.ac.uk/ University of Bristol &amp;quot;Mediapatterns&amp;quot; project]&lt;br /&gt;
&lt;br /&gt;
* [http://www.cos.cs.cmu.edu/ Carnegie Mellon University], [http://www.casos.cs.cmu.edu PhD program] in Computation, Organizations and Society (COS)&lt;br /&gt;
&lt;br /&gt;
* [http://www.uchicago.edu University of Chicago]&lt;br /&gt;
&lt;br /&gt;
** [https://macss.uchicago.edu/ Certificate, MA and PhD in Computational Social Sciences]&lt;br /&gt;
&lt;br /&gt;
* [http://www.gmu.edu George Mason University]&lt;br /&gt;
&lt;br /&gt;
** PhD program in [http://css.gmu.edu CSS (Computational Social Sciences)]&lt;br /&gt;
&lt;br /&gt;
** MA program in [http://mais.gmu.edu/programs/la-mais-css Master's of Interdisciplinary Studies, CSS emphasis]&lt;br /&gt;
&lt;br /&gt;
* [http://www.pdx.edu/sysc/program-systems-science-phd-program Portland State], PhD program in Systems Science&lt;br /&gt;
&lt;br /&gt;
* [http://www.pdx.edu/sysc/program-systems-science-masters-program Portland State], MS program in Systems Science&lt;br /&gt;
&lt;br /&gt;
* [http://www.ucd.ie University College Dublin], &lt;br /&gt;
&lt;br /&gt;
** PhD Program in [http://www.ucd.ie/geary/postgraduatetraining/cscs Complex Systems and Computational Social Science]&lt;br /&gt;
&lt;br /&gt;
** MSc in [https://sisweb.ucd.ie/usis/!W_HU_MENU.P_PUBLISH?p_tag=PROG&amp;amp;MAJR=W390 Social Data Analytics] &lt;br /&gt;
&lt;br /&gt;
** BSc in [https://www.myucd.ie/courses/social-sciences/computational-social-science Computational Social Science] &lt;br /&gt;
&lt;br /&gt;
* [https://archive.is/20121215023745/http://hcs.ucla.edu/courses.htm UCLA], Minor in Human Complex Systems&lt;br /&gt;
&lt;br /&gt;
* [http://www.cs.ucla.edu/~cyber/ UCLA], Major in Computational &amp;amp; Systems Biology (including behavioral sciences)&lt;br /&gt;
&lt;br /&gt;
* [http://cscs.umich.edu/education/undergrad/undergrad.html Univ. of Michigan], Minor in Complex Systems&lt;br /&gt;
&lt;br /&gt;
* [http://www.pdx.edu/sysc/resources-other-systems-science-programs Systems Sciences Programs List], Portland State.  List of other worldwide related programs.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Centers and institutes 中心和机构==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===North America 北美===&lt;br /&gt;
&lt;br /&gt;
* [http://cnets.indiana.edu/ Center for Complex Networks and Systems Research], Indiana University, Bloomington, IN, USA.&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20110430200327/http://www.ccsr.uiuc.edu/ Center for Complex Systems Research], University of Illinois at Urbana-Champaign, IL, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://socialcomplexity.gmu.edu/ Center for Social Complexity], George Mason University, Fairfax, VA, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.asu.edu/clas/csdc/ Center for Social Dynamics and Complexity], Arizona State University, Tempe, AZ, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.cscs.umich.edu/ Center of the Study of Complex Systems], University of Michigan, Ann Arbor, MI, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://hcs.ucla.edu/ Human Complex Systems], University of California Los Angeles, Los Angeles, CA, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.iq.harvard.edu/ Institute for Quantitative Social Science], Harvard University, Boston, MA, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.nico.northwestern.edu/ Northwestern Institute on Complex Systems (NICO)], Northwestern University, Evanston, IL USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.santafe.edu/ Santa Fe Institute], Santa Fe, NM, USA.&lt;br /&gt;
&lt;br /&gt;
* Duke Network Analysis Center, [[Duke University]], Durham, NC, USA&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===South America 南美===&lt;br /&gt;
&lt;br /&gt;
* [http://www5.each.usp.br/mestrado-academico-em-modelagem-de-sistemas-complexos/ Modelagem de Sistemas Complexos], University of São Paulo - EACH, São Paulo, SP, Brazil&lt;br /&gt;
&lt;br /&gt;
* [http://inct.cnpq.br/web/inct-sc Instituto Nacional de Ciência e Tecnologia de Sistemas Complexos], Centro Brasileiro de Pesquisas Físicas, Rio de Janeiro, RJ, Brazil&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Europe 欧洲===&lt;br /&gt;
&lt;br /&gt;
* [http://cfpm.org Centre for Policy Modelling], Manchester, UK.&lt;br /&gt;
&lt;br /&gt;
* [http://cress.soc.surrey.ac.uk/ Centre for Research in Social Simulation], University of Surrey, UK.&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20130425014018/http://dl.ucd.ie/ UCD Dynamics Lab- Centre for Computational Social Science], Geary Institute for Public Policy, University College Dublin, Ireland.&lt;br /&gt;
&lt;br /&gt;
* [http://www.rug.nl/research/gcscs/ Groningen Center for Social Complexity Studies (GCSCS)], Groningen, NL.&lt;br /&gt;
&lt;br /&gt;
* [http://www.soms.ethz.ch/ Chair of Sociology, in particular of Modeling and Simulation (SOMS)], Zürich, Switzerland.&lt;br /&gt;
&lt;br /&gt;
* [http://www.eco.unibs.it/gecs/ Research Group on Experimental and Computational Sociology (GECS)], Brescia, IT.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Asia 亚洲===&lt;br /&gt;
&lt;br /&gt;
* [http://bandungfe.net Bandung Fe Institute, Centre for Complexity in Surya University], Bandung, Indonesia.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== See also 参见==&lt;br /&gt;
&lt;br /&gt;
* [[Artificial society]] 人工社会&lt;br /&gt;
&lt;br /&gt;
* [[Simulated reality]] 虚拟现实&lt;br /&gt;
&lt;br /&gt;
* [[Social simulation]] 社会仿真&lt;br /&gt;
&lt;br /&gt;
* [[Agent-based social simulation]] 基于主体的社会仿真&lt;br /&gt;
&lt;br /&gt;
* [[Social complexity]] 社会复杂性&lt;br /&gt;
&lt;br /&gt;
* [[Computational economics]] 计算经济学&lt;br /&gt;
&lt;br /&gt;
* [[Computational epidemiology]] 计算流行病学&lt;br /&gt;
&lt;br /&gt;
* [[Cliodynamics]] 历史动力学&lt;br /&gt;
&lt;br /&gt;
* [[Predictive analytics]] 预测分析&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&lt;br /&gt;
{{reflist|35em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==External links 外部链接==&lt;br /&gt;
&lt;br /&gt;
*[http://cress.soc.surrey.ac.uk/s4ss/ On-line book &amp;quot;Simulation for the Social Scientist&amp;quot; by Nigel Gilbert and Klaus G. Troitzsch, 1999, second edition 2005 社会科学家的仿真建模 电子书 作者：Nigel Gilbert and Klaus G. Troitzsch 第二版（2005年版）]&lt;br /&gt;
&lt;br /&gt;
*[http://jasss.soc.surrey.ac.uk/JASSS.html Journal of Artificial Societies and Social Simulation 人工社会和社会建模仿真期刊]&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20110516072744/http://cmol.nbi.dk/models/ Agent based models for social networks, interactive java applets 基于主体的社会网络模型，交互式 java 小程序]&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20090827052722/http://www.personal.kent.edu/~bcastel3/ Sociology and Complexity Science Website 社会学与复杂性科学网站]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:Subfields of sociology]]&lt;br /&gt;
&lt;br /&gt;
Category:Subfields of sociology&lt;br /&gt;
&lt;br /&gt;
范畴: 社会学的子领域&lt;br /&gt;
&lt;br /&gt;
[[Category:Complex systems theory]]&lt;br /&gt;
&lt;br /&gt;
Category:Complex systems theory&lt;br /&gt;
&lt;br /&gt;
范畴: 复杂系统理论&lt;br /&gt;
&lt;br /&gt;
[[Category:Methods in sociology]]&lt;br /&gt;
&lt;br /&gt;
Category:Methods in sociology&lt;br /&gt;
&lt;br /&gt;
范畴: 社会学方法&lt;br /&gt;
&lt;br /&gt;
[[Category:Computational fields of study]]&lt;br /&gt;
&lt;br /&gt;
Category:Computational fields of study&lt;br /&gt;
&lt;br /&gt;
类别: 研究的计算领域&lt;br /&gt;
&lt;br /&gt;
&amp;lt;noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;small&amp;gt;This page was moved from [[wikipedia:en:Computational sociology]]. Its edit history can be viewed at [[社会计算/edithistory]]&amp;lt;/small&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:待整理页面]]&lt;br /&gt;
&lt;br /&gt;
== 编者推荐 ==&lt;br /&gt;
=== 书籍推荐 ===&lt;br /&gt;
====[https://e.jd.com/30159646.html 社会计算的基本方法与应用]====&lt;br /&gt;
这是中科院自动化所的王飞跃老师关于社会计算的专著，从利用计算技术解决社会问题的角度介绍社会计算。阅读难度可能较高。&lt;br /&gt;
&lt;br /&gt;
=== 集智推荐 ===&lt;br /&gt;
====[https://campus.swarma.org/course/1028 2019 International Conference of Social Computing]====&lt;br /&gt;
本课程是2019年8月26日、27日的2019 International Conference of Social Computing记录。教师团队由芝加哥大学社会学系James Evans教授，Science University of Gottingen傅晓明教授，清华大学罗家德教授，电子科技大学周涛教授等多位老师组成。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://campus.swarma.org/course/1016 复杂系统与社会计算研讨会]====&lt;br /&gt;
本课程是，2019年10月27日北京计算科学研究中心主办的复杂系统与社会计算研讨会活动记录。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://pattern.swarma.org/path?id=12 计算社会科学入门路径]====&lt;br /&gt;
计算社会科学诞生至今，已有将近10年。在自然科学领域已经广泛应用大数据、分布式计算等方式提高研究质量的今天，社会科学领域涉及到的核心数据仍然被少数机构所拥有并创造着巨大的价值。本文将从计算社会科学的发展历史，常用方法，以及前沿问题来给大家粗略地展示计算社会科学的脉络。&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E7%A4%BE%E4%BC%9A%E8%AE%A1%E7%AE%97&amp;diff=11209</id>
		<title>社会计算</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E7%A4%BE%E4%BC%9A%E8%AE%A1%E7%AE%97&amp;diff=11209"/>
		<updated>2020-07-26T13:41:33Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：/* Data mining and social network analysis 数据挖掘和社会网络分析 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;#重定向 [[社会计算]]&lt;br /&gt;
此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。&lt;br /&gt;
{{sociology}}&amp;lt;onlyinclude&amp;gt;&amp;lt;!-- &lt;br /&gt;
&lt;br /&gt;
&amp;lt;onlyinclude&amp;gt;&amp;lt;!-- &lt;br /&gt;
&lt;br /&gt;
只包括! -- &lt;br /&gt;
&lt;br /&gt;
While editing this lead/intro, please keep your text BELOW this line - this will make it easier to automatically insert the lede into other articles --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
  While editing this lead/intro, please keep your text BELOW this line - this will make it easier to automatically insert the lede into other articles --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
当编辑这个导语 / 介绍，请保持你的文本下面这行-这将使它更容易自动插入到其他文章的莱德-&lt;br /&gt;
&lt;br /&gt;
'''Computational sociology''' is a branch of [[sociology]] that uses computationally intensive methods to analyze and model social phenomena. Using [[computer simulation]]s, [[artificial intelligence]], complex statistical methods, and analytic approaches like [[social network analysis]], computational sociology develops and tests theories of complex social processes through bottom-up modeling of social interactions.&amp;lt;ref name=&amp;quot;MW&amp;quot;&amp;gt;{{cite journal|doi=10.1146/annurev.soc.28.110601.141117|title=From Factors to Actors: Computational Sociology and Agent-Based Modeling |first1=Michael W. |last1=Macy |first2=Robert |last2=Willer |journal=Annual Review of Sociology |volume=28 |pages=143–166 |jstor=3069238|year=2002}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Computational sociology is a branch of sociology that uses computationally intensive methods to analyze and model social phenomena. Using computer simulations, artificial intelligence, complex statistical methods, and analytic approaches like social network analysis, computational sociology develops and tests theories of complex social processes through bottom-up modeling of social interactions.&lt;br /&gt;
&lt;br /&gt;
'''计算社会学 Computational Sociology''' 是社会学的一个分支，它使用计算密集型方法来分析和模拟社会现象。&amp;lt;font color='red'&amp;gt;计算社会学通过使用计算机模拟、人工智能、复杂统计方法以及社会网络分析等分析方法自下而上地建立社会互动模型，是建立并检验复杂社会过程的理论。&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;  借助计算机模拟、人工智能、复杂统计方法以及社会网络分析等分析方法，计算社会学通过自下而上地建立社会互动模型来发展和检验关于复杂社会过程的理论。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
It involves the understanding of social agents, the interaction among these agents, and the effect of these interactions on the social aggregate.&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;&amp;gt;{{cite book|last1=Gilbert |first1=Nigel |last2=Troitzsch |first2=Klaus |year=2005 |title=Simulation for Social Scientists |edition=2 |chapter=Simulation and social science |publisher=Open University Press |chapter-url=http://cress.soc.surrey.ac.uk/s4ss/}}&amp;lt;/ref&amp;gt; Although the subject matter and methodologies in [[social science]] differ from those in [[natural science]] or [[computer science]], several of the approaches used in contemporary [[social simulation]] originated from fields such as [[physics]] and [[artificial intelligence]].&amp;lt;ref name=&amp;quot;Artificial Societies&amp;quot;&amp;gt;{{cite book|last1=Epstein |first1=Joshua M. |last2=Axtell |first2=Robert |year=1996 |title=Growing Artificial Societies: Social Science from the Bottom Up |location=Washington DC |publisher=Brookings Institution Press|url=https://archive.org/details/growingartificia00epst|url-access=registration |isbn=978-0262050531 }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;Cooperation&amp;quot;&amp;gt;{{cite book|last1=Axelrod |first1=Robert |year=1997 |title=The Complexity of Cooperation: Agent-Based Models of Competition and Collaboration |location=Princeton, NJ |publisher=Princeton University Press}}&amp;lt;/ref&amp;gt; Some of the approaches that originated in this field have been imported into the natural sciences, such as measures of [[centrality|network centrality]] from the fields of [[social network analysis]] and [[network science]].&lt;br /&gt;
&lt;br /&gt;
It involves the understanding of social agents, the interaction among these agents, and the effect of these interactions on the social aggregate. Although the subject matter and methodologies in social science differ from those in natural science or computer science, several of the approaches used in contemporary social simulation originated from fields such as physics and artificial intelligence. Some of the approaches that originated in this field have been imported into the natural sciences, such as measures of network centrality from the fields of social network analysis and network science.&lt;br /&gt;
&lt;br /&gt;
它涉及理解社会行为主体和它们的相互作用，以及这些相互作用如何影响社会总体(--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） social aggregate--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|讨论]]） 我觉得这样翻译是ok的)。虽然社会科学的主题和方法不同于自然科学或计算机科学，但当代社会仿真模拟中使用的一些方法起源于物理学和人工智能等领域。这一领域的一些方法，如来自社会网络分析和网络科学领域的网络中心性度量方法等，早已被引入到自然科学中。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In relevant literature, computational sociology is often related to the study of [[social complexity]].&amp;lt;ref&amp;gt;{{cite journal|last=Casti |first=J |year=1999 |title=The Computer as Laboratory: Toward a Theory of Complex Adaptive Systems |journal=Complexity |volume=4 |issue=5 |pages=12–14 |doi=10.1002/(SICI)1099-0526(199905/06)4:5&amp;lt;12::AID-CPLX3&amp;gt;3.0.CO;2-4}}&amp;lt;/ref&amp;gt; Social complexity concepts such as [[complex systems]], [[non-linear]] interconnection among macro and micro process, and [[emergence]], have entered the vocabulary of computational sociology.&amp;lt;ref&amp;gt;{{cite journal|last=Goldspink |first=C |year=2002 |title=Methodological Implications of Complex Systems Approaches to Sociality: Simulation as a Foundation for Knowledge |url=http://jasss.soc.surrey.ac.uk/5/1/3.html |publisher=Journal of Artificial Societies and Social Simulation |volume=5 |issue=1}}&amp;lt;/ref&amp;gt; A practical and well-known example is the construction of a computational model in the form of an &amp;quot;[[artificial society]]&amp;quot;, by which researchers can analyze the structure of a [[Social structure|social system]].&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;Generative&amp;quot;&amp;gt;{{cite book|last=Epstein |first=Joshua |year=2007 |title=Generative Social Science: Studies in Agent-Based Computational Modeling |location=Princeton, NJ |publisher=Princeton University Press|url=https://www.researchgate.net/publication/283615593}}&lt;br /&gt;
&lt;br /&gt;
In relevant literature, computational sociology is often related to the study of social complexity. Social complexity concepts such as complex systems, non-linear interconnection among macro and micro process, and emergence, have entered the vocabulary of computational sociology. A practical and well-known example is the construction of a computational model in the form of an &amp;quot;artificial society&amp;quot;, by which researchers can analyze the structure of a social system.&lt;br /&gt;
&lt;br /&gt;
在相关文献中，计算社会学经常与社会复杂性的研究有关。复杂系统、宏观和微观过程之间的非线性关联、涌现等社会复杂性概念已经进入计算社会学的词汇。一个实际而著名的例子是建立“'''人工社会 Artificial Society'''”的计算模型，通过它研究人员可以分析一个社会系统的结构。 &lt;br /&gt;
&lt;br /&gt;
While editing this lead/intro, please keep your text ABOVE this line - this will make it easier to automatically insert the lede into other articles - thanks!  &lt;br /&gt;
&lt;br /&gt;
While editing this lead/intro, please keep your text ABOVE this line - this will make it easier to automatically insert the lede into other articles - thanks!  &lt;br /&gt;
&lt;br /&gt;
当编辑这个引导 / 介绍，请保持你的文本以上这一行-这将使它更容易自动插入到其他文章的莱德-谢谢！&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;&amp;lt;/onlyinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;&amp;lt;/onlyinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
-- / 只包括&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==History 历史==&lt;br /&gt;
&lt;br /&gt;
{{see also|Sociology and complexity science}}&lt;br /&gt;
&lt;br /&gt;
[[File:Complexity-map-with-sociolo.png|thumb|right|300px|Historical map of research paradigms and associated scientists in [[sociology and complexity science]].]]&lt;br /&gt;
&lt;br /&gt;
Historical map of research paradigms and associated scientists in [[sociology and complexity science.]]&lt;br /&gt;
&lt;br /&gt;
【图1：Historical map of research paradigms and associated scientists in [[sociology and complexity science＋社会学和复杂性中的研究范式和科学家的历史地图】&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Background 背景===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In the past four decades, computational sociology has been introduced and gaining popularity {{According to whom|date=June 2017}}.  This has been used primarily for modeling or building explanations of social processes and are depending on the emergence of complex behavior from simple activities.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;&amp;gt;Salgado, Mauricio, and Nigel Gilbert. &amp;quot;[http://epubs.surrey.ac.uk/749319/1/Emergence%20and%20Communication%20-%20V3%201.pdf Emergence and communication in computational sociology].&amp;quot; Journal for the Theory of Social Behaviour 43.1 (2013): 87-110.&amp;lt;/ref&amp;gt;  The idea behind emergence is that properties of any bigger system do not always have to be properties of the components that the system is made of.&amp;lt;ref&amp;gt;Macy, Michael W., and Robert Willer. &amp;quot;[http://sct.uab.cat/lsds/sites/sct.uab.cat.lsds/files/FROM%20FACTORS%20TO%20ACTORS%20(Macy%20and%20Willer%202002).pdf From factors to actors: computational sociology and agent-based modeling].&amp;quot; Annual review of sociology 28.1 (2002): 143-166.&amp;lt;/ref&amp;gt;  The people responsible for the introduction of the idea of emergence are Alexander, Morgan, and Broad, who were classical emergentists.  The time at which these emergentists came up with this concept and method was during the time of the early twentieth century.  The aim of this method was to find a good enough accommodation between two different and extreme ontologies, which were reductionist materialism and dualism.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;/&amp;gt; &lt;br /&gt;
&lt;br /&gt;
In the past four decades, computational sociology has been introduced and gaining popularity.  This has been used primarily for modeling or building explanations of social processes and are depending on the emergence of complex behavior from simple activities.  The idea behind emergence is that properties of any bigger system do not always have to be properties of the components that the system is made of.  The people responsible for the introduction of the idea of emergence are Alexander, Morgan, and Broad, who were classical emergentists.  The time at which these emergentists came up with this concept and method was during the time of the early twentieth century.  The aim of this method was to find a good enough accommodation between two different and extreme ontologies, which were reductionist materialism and dualism. &lt;br /&gt;
&lt;br /&gt;
在过去的四十年里，计算社会学诞生并且越来越受欢迎。这主要用于建模或构建社会过程的解释，并且依赖于从简单活动中'''涌现 Emergence'''的复杂行为。涌现背后的思想是，任何较大系统不总是必须和组成系统的部分具有一样的性质。引入涌现思想的人是亚历山大 Alexander、摩根 Morgan和布罗德 Broad，他们都是'''经典涌现主义者 Classical Emergentists'''。经典涌现主义者提出这个概念和方法的时间是在二十世纪初期。这种方法的目的是在还原论的唯物主义和二元论这两种不同的本体论之间找到一个足够好的调和。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
While emergence has had a valuable and important role with the foundation of Computational Sociology, there are those who do not necessarily agree.  One major leader in the field, Epstein, doubted the use because there were aspects that are unexplainable.  Epstein put up a claim against emergentism, in which he says it &amp;quot;is precisely the generative sufficiency of the parts that constitutes the whole's explanation&amp;quot;.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
While emergence has had a valuable and important role with the foundation of Computational Sociology, there are those who do not necessarily agree.  One major leader in the field, Epstein, doubted the use because there were aspects that are unexplainable.  Epstein put up a claim against emergentism, in which he says it &amp;quot;is precisely the generative sufficiency of the parts that constitutes the whole's explanation&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
虽然涌现在计算社会学的建立上发挥了宝贵而重要的作用，但也有人不太同意。该领域的一个主要人物爱泼斯坦 Epstein对这种&amp;lt;font color='red'&amp;gt;用法&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;概念&amp;lt;/font&amp;gt;持怀疑态度，因为有些方面是这个&amp;lt;font color='red'&amp;gt;用法&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;概念&amp;lt;/font&amp;gt;无法解释的。爱泼斯坦提出了一种反对“涌现主义”的观点，他表示:“&amp;lt;font color=='red'&amp;gt;正是这些部分的有生成意义的充分性构成了对整体的解释&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;  正是这些部分所产生的充分性构成了对整体的解释&amp;lt;/font&amp;gt;”。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Agent-based models have had a historical influence on Computational Sociology.   These models first came around in the 1960s, and were used to simulate control and feedback processes in organizations, cities, etc.  During the 1970s, the application introduced the use of individuals as the main units for the analyses and used bottom-up strategies for modeling behaviors.  The last wave occurred in the 1980s.  At this time, the models were still bottom-up; the only difference is that the agents interact interdependently.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Agent-based models have had a historical influence on Computational Sociology. These models first came around in the 1960s, and were used to simulate control and feedback processes in organizations, cities, etc.  During the 1970s, the application introduced the use of individuals as the main units for the analyses and used bottom-up strategies for modeling behaviors.  The last wave occurred in the 1980s.  At this time, the models were still bottom-up; the only difference is that the agents interact interdependently.&lt;br /&gt;
&lt;br /&gt;
'''基于主体的模型 Agent-based Models'''对计算社会学有着历史性的影响。这些模型最早出现在20世纪60年代，用于仿真模拟组织、城市等系统的控制和反馈过程。在20世纪70年代，&amp;lt;font color='red'&amp;gt;应用程序&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; ABM模型&amp;lt;/font&amp;gt;引入个体作为主要的分析单元，并使用自下而上的策略来对行为建模。最后一波浪潮发生在20世纪80年代。那时，模型仍然是自下而上的; 唯一的区别是主体之间具有互相依赖和相互作用。&lt;br /&gt;
&lt;br /&gt;
===Systems theory and structural functionalism 系统理论和结构功能主义===&lt;br /&gt;
&lt;br /&gt;
{{main|Systems theory|Structural functionalism}}&lt;br /&gt;
&lt;br /&gt;
In the post-war era, [[Vannevar Bush]]'s [[differential analyser]], [[John von Neumann]]'s [[Von Neumann cellular automata|cellular automata]], [[Norbert Wiener]]'s [[cybernetics]], and [[Claude Shannon]]'s [[information theory]] became influential paradigms for modeling and understanding complexity in technical systems. In response, scientists in disciplines such as physics, biology, electronics, and economics began to articulate a [[systems theory|general theory of systems]] in which all natural and physical phenomena are manifestations of interrelated elements in a system that has common patterns and properties. Following [[Émile Durkheim]]'s call to analyze complex modern society ''[[sui generis]]'',&amp;lt;ref&amp;gt;{{cite book|first=Émile |last=Durkheim |title=The Division of Labor in Society |location=New York, NY |publisher=Macmillan}}&amp;lt;/ref&amp;gt; post-war structural functionalist sociologists such as [[Talcott Parsons]] seized upon these theories of systematic and hierarchical interaction among constituent components to attempt to generate grand unified sociological theories, such as the [[AGIL paradigm]].&amp;lt;ref name=&amp;quot;Bailey&amp;quot;&amp;gt;{{cite book|first1=Kenneth D. |last1=Bailey |editor=Jonathan H. Turner |chapter=Systems Theory |title=Handbook of Sociological Theory |publisher=Springer Science |year=2006 |location=New York, NY |isbn=978-0-387-32458-6 |pages=379–404}}&amp;lt;/ref&amp;gt; Sociologists such as [[George Homans]] argued that sociological theories should be formalized into hierarchical structures of propositions and precise terminology from which other propositions and hypotheses could be derived and operationalized into empirical studies.&amp;lt;ref name=&amp;quot;Blackwell&amp;quot;&amp;gt;{{cite encyclopedia|year=2007 |title=Computational Sociology |last=Bainbridge |first=William Sims |encyclopedia=Blackwell Encyclopedia of Sociology |publisher=Blackwell Reference Online |url=http://www.sociologyencyclopedia.com/subscriber/tocnode?id=g9781405124331_chunk_g97814051243319_ss1-85 |doi=10.1111/b.9781405124331.2007.x |hdl=10138/224218 |editor=Ritzer, George|isbn=978-1-4051-2433-1|hdl-access=free }}&amp;lt;/ref&amp;gt; Because computer algorithms and programs had been used as early as 1956 to test and validate mathematical theorems, such as the [[four color theorem]],&amp;lt;ref&amp;gt;{{cite book|last=Crevier |first=D. |year=1993 |title=AI: The Tumultuous History of the Search for Artificial Intelligence |url=https://archive.org/details/aitumultuoushist00crev |url-access=registration |publisher=Basic Books |location=New York, NY}}&amp;lt;/ref&amp;gt; some scholars anticipated that similar computational approaches could &amp;quot;solve&amp;quot; and &amp;quot;prove&amp;quot; analogously formalized problems and theorems of social structures and dynamics.&lt;br /&gt;
&lt;br /&gt;
In the post-war era, Vannevar Bush's differential analyser, John von Neumann's cellular automata, Norbert Wiener's cybernetics, and Claude Shannon's information theory became influential paradigms for modeling and understanding complexity in technical systems. In response, scientists in disciplines such as physics, biology, electronics, and economics began to articulate a general theory of systems in which all natural and physical phenomena are manifestations of interrelated elements in a system that has common patterns and properties. Following Émile Durkheim's call to analyze complex modern society sui generis, post-war structural functionalist sociologists such as Talcott Parsons seized upon these theories of systematic and hierarchical interaction among constituent components to attempt to generate grand unified sociological theories, such as the AGIL paradigm. Sociologists such as George Homans argued that sociological theories should be formalized into hierarchical structures of propositions and precise terminology from which other propositions and hypotheses could be derived and operationalized into empirical studies. Because computer algorithms and programs had been used as early as 1956 to test and validate mathematical theorems, such as the four color theorem, some scholars anticipated that similar computational approaches could &amp;quot;solve&amp;quot; and &amp;quot;prove&amp;quot; analogously formalized problems and theorems of social structures and dynamics.&lt;br /&gt;
&lt;br /&gt;
战后时期，范内瓦·布什（Vannevar Bush）的'''微分分析机 Differential Analyser''' 、冯·诺伊曼（John von Neumann）的'''元胞自动机 Cellular Automata'''、 维纳（Norbert Wiener）的'''控制论 Cybernetics'''和克劳德·香农（Claude Shannon）的'''信息论 Information Theory'''成为技术系统中建模和理解复杂性的重要范式。物理学、生物学、电子学和经济学等学科的科学家开始阐述系统的一般理论，即所有自然和物理现象都是具有共同模式和属性的系统中相互关联的元素的表现。&amp;lt;font color='red'&amp;gt;按照 &amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 沿着&amp;lt;/font&amp;gt;涂尔干（Émile Durkheim）分析特定的复杂现代社会&lt;br /&gt;
&lt;br /&gt;
（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]）Following Émile Durkheim's call to analyze complex modern society sui generis）&lt;br /&gt;
  --~~克劳德·香农（Claude Shannon）  这些同样去括号&lt;br /&gt;
&lt;br /&gt;
的&amp;lt;font color='red'&amp;gt;要求&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 思路&amp;lt;/font&amp;gt;，战后结构功能主义社会学家如帕森斯（Talcott Parsons）利用这些组成部分之间系统&amp;lt;font color='blue'&amp;gt;化&amp;lt;/font&amp;gt;和&amp;lt;font color='red'&amp;gt;等级&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 层次化&amp;lt;/font&amp;gt;相互作用的理论，试图产生大统一的社会学理论，如 AGIL 范式。霍曼斯（George Homans）等社会学家认为，社会学理论应该被构建为具有&amp;lt;font color='blue'&amp;gt;逻辑&amp;lt;/font&amp;gt;命题和精确术语的&amp;lt;font color='red'&amp;gt;等级&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 层次化&amp;lt;/font&amp;gt;结构，并且从中可以得出能够在实证研究中被操作化的其他命题和假设。由于早在1956年计算机算法和程序就已经被用来测试和验证数学定理（如'''四色定理Four Color Theorem'''），&amp;lt;font color='red'&amp;gt;一些学者预计相似的计算方法可以“解决”和“证明”类似的社会结构和动态的问题和定理。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 一些学者预计相似的计算方法可以“解释”和“证明”关于社会结构和演变的类似形式化的问题和定理。&amp;lt;/font&amp;gt;&lt;br /&gt;
--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|讨论]]formalized应该也要翻译出来，computational证明的是形式化定理)&lt;br /&gt;
&lt;br /&gt;
===Macrosimulation and microsimulation 宏观模拟和微观模拟===&lt;br /&gt;
&lt;br /&gt;
{{main|System dynamics|Microsimulation}}&lt;br /&gt;
&lt;br /&gt;
By the late 1960s and early 1970s, social scientists used increasingly available computing technology to perform macro-simulations of control and feedback processes in organizations, industries, cities, and global populations. These models used differential equations to predict population distributions as holistic functions of other systematic factors such as inventory control, urban traffic, migration, and disease transmission.&amp;lt;ref&amp;gt;{{cite book|first=Jay |last=Forrester |year=1971 |title=World Dynamics |location=Cambridge, MA |publisher=MIT Press}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|doi=10.1287/opre.26.2.237|title=Using Simulation to Develop and Validate Analytic Models: Some Case Studies |first1=Edward J. |last1=Ignall |first2=Peter |last2=Kolesar |first3=Warren E. |last3=Walker |journal=Operations Research |volume=26 |issue=2 |year=1978 |pages=237–253}}&amp;lt;/ref&amp;gt; Although simulations of social systems received substantial attention in the mid-1970s after the [[Club of Rome]] published reports predicting that policies promoting exponential economic growth would eventually bring global environmental catastrophe,&amp;lt;ref&amp;gt;{{cite book|title=The Dynamics of Growth in a Finite World |last1=Meadows |first1=DL |last2=Behrens |first2=WW |last3=Meadows |first3=DH |last4=Naill |first4=RF |last5= Randers |first5=J |last6=Zahn |first6=EK |year=1974 |location=Cambridge, MA |publisher=MIT Press}}&amp;lt;/ref&amp;gt; the inconvenient conclusions led many authors to seek to discredit the models, attempting to make the researchers themselves appear unscientific.&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;/&amp;gt;&amp;lt;ref&amp;gt;{{cite news|title=Computer View of Disaster Is Rebutted |newspaper=The New York Times |date=October 18, 1974|url=https://www.nytimes.com/1974/10/18/archives/computer-view-of-disaster-is-rebutted.html?_r=0}}&amp;lt;/ref&amp;gt; Hoping to avoid the same fate, many social scientists turned their attention toward micro-simulation models to make forecasts and study policy effects by modeling aggregate changes in state of individual-level entities rather than the changes in distribution at the population level.&amp;lt;ref&amp;gt;{{cite journal|doi=10.1016/0167-2681(90)90038-F|title=From engineering to microsimulation : An autobiographical reflection |journal=Journal of Economic Behavior &amp;amp; Organization |year=1990 |volume=14 |issue=1 |pages=5–27 |first=Guy H. |last=Orcutt}}&amp;lt;/ref&amp;gt; However, these micro-simulation models did not permit individuals to interact or adapt and were not intended for basic theoretical research.&amp;lt;ref name=&amp;quot;MW&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
By the late 1960s and early 1970s, social scientists used increasingly available computing technology to perform macro-simulations of control and feedback processes in organizations, industries, cities, and global populations. These models used differential equations to predict population distributions as holistic functions of other systematic factors such as inventory control, urban traffic, migration, and disease transmission. Although simulations of social systems received substantial attention in the mid-1970s after the Club of Rome published reports predicting that policies promoting exponential economic growth would eventually bring global environmental catastrophe, the inconvenient conclusions led many authors to seek to discredit the models, attempting to make the researchers themselves appear unscientific. Hoping to avoid the same fate, many social scientists turned their attention toward micro-simulation models to make forecasts and study policy effects by modeling aggregate changes in state of individual-level entities rather than the changes in distribution at the population level. However, these micro-simulation models did not permit individuals to interact or adapt and were not intended for basic theoretical research.&lt;br /&gt;
&lt;br /&gt;
截至20世纪60年代末70年代初，社会科学家越来越多地使用已有的计算技术，&amp;lt;s&amp;gt;在&amp;lt;/s&amp;gt;&amp;lt;font color='blue'&amp;gt;对&amp;lt;/font&amp;gt;组织、工业、城市和全球人口&amp;lt;s&amp;gt;中&amp;lt;/s&amp;gt;进行&amp;lt;font color='blue'&amp;gt;包含&amp;lt;/font&amp;gt;控制和反馈过程的'''宏观模拟 Macrosimulation''' 。这些模型使用微分方程作为其他系统因素的整体函数来预测人口分布，这些系统因素包括&amp;lt;font color='red'&amp;gt;库存&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 财产&amp;lt;/font&amp;gt;控制、城市交通、人口迁移和疾病传播等。&amp;lt;font color='red'&amp;gt;20世纪70年代中期，'''罗马俱乐部 Club of Rome''' 发表报告预测，促进指数式经济增长的政策最终将导致全球环境灾难，这个悲观的结论导致许多研究者试图反驳这些模型，并试图让研究显得不那么科学。&amp;lt;/font&amp;gt;&lt;br /&gt;
  （--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） 根据意思，inconvenient译为悲观的，因为这个结论预示了悲观的未来，所以令指出这一点的科学家们感到inconvenient）&lt;br /&gt;
  （--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟树|讨论]]） inconvenient的翻译没问题，不过好像缺失了Although simulations of social systems received substantial attention）&lt;br /&gt;
&amp;lt;font color='blue'&amp;gt; 20世纪70年代中期，尽管对社会系统的仿真获得了巨大的关注，但在'''罗马俱乐部 Club of Rome''' 发布预测报告称促进指数式经济增长的政策最终将导致全球环境灾难，这个悲观的结论导致许多研究者尝试抹黑这些(仿真)模型，并试图让(这些模型的)研究者自身显得不那么科学。&amp;lt;/font&amp;gt;&lt;br /&gt;
为了避免同样的情况，许多社会科学家将注意力转向'''微观模拟 Microsimulation'''模型。这些模型通过模拟个体状态的总体变化而不是总体人口级别的&amp;lt;font color='blue'&amp;gt;分布&amp;lt;/font&amp;gt;变化来进行预测和研究政策的效果。然而，这些微观模拟模型并不允许个体相互作用或适应、变化（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]）变化是根据适应（adapt）加上去的，不知道是否合理--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|讨论]]）我觉得ok），研究者也不打算将它们用于基础理论研究。&lt;br /&gt;
&lt;br /&gt;
===Cellular automata and agent-based modeling 元胞自动机和基于主体建模===&lt;br /&gt;
&lt;br /&gt;
{{main|Cellular automata|agent-based modeling}}&lt;br /&gt;
&lt;br /&gt;
The 1970s and 1980s were also a time when physicists and mathematicians were attempting to model and analyze how simple component units, such as atoms, give rise to global properties, such as complex material properties at low temperatures, in magnetic materials, and within turbulent flows.&amp;lt;ref&amp;gt;{{cite book|title=Cellular automata machines: a new environment for modeling |url=https://archive.org/details/cellularautomata00toff |url-access=registration |first1=Tommaso |last1=Toffoli |first2=Norman |last2=Margolus | author2-link = Norman Margolus |year=1987 |publisher=MIT Press |location=Cambridge, MA}}&amp;lt;/ref&amp;gt; Using cellular automata, scientists were able to specify systems consisting of a grid of cells in which each cell only occupied some finite states and changes between states were solely governed by the states of immediate neighbors. Along with advances in [[artificial intelligence]] and [[microcomputer]] power, these methods contributed to the development of &amp;quot;[[chaos theory]]&amp;quot; and &amp;quot;[[complex systems|complexity theory]]&amp;quot; which, in turn, renewed interest in understanding complex physical and social systems across disciplinary boundaries.&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;/&amp;gt; Research organizations explicitly dedicated to the interdisciplinary study of complexity were also founded in this era: the [[Santa Fe Institute]] was established in 1984 by scientists based at [[Los Alamos National Laboratory]] and the BACH group at the [[University of Michigan]] likewise started in the mid-1980s.&lt;br /&gt;
&lt;br /&gt;
The 1970s and 1980s were also a time when physicists and mathematicians were attempting to model and analyze how simple component units, such as atoms, give rise to global properties, such as complex material properties at low temperatures, in magnetic materials, and within turbulent flows. Using cellular automata, scientists were able to specify systems consisting of a grid of cells in which each cell only occupied some finite states and changes between states were solely governed by the states of immediate neighbors. Along with advances in artificial intelligence and microcomputer power, these methods contributed to the development of &amp;quot;chaos theory&amp;quot; and &amp;quot;complexity theory&amp;quot; which, in turn, renewed interest in understanding complex physical and social systems across disciplinary boundaries. Research organizations explicitly dedicated to the interdisciplinary study of complexity were also founded in this era: the Santa Fe Institute was established in 1984 by scientists based at Los Alamos National Laboratory and the BACH group at the University of Michigan likewise started in the mid-1980s.&lt;br /&gt;
&lt;br /&gt;
20世纪70年代和80年代，物理学家和数学家也在试图模拟和分析简单的组成单位如何产生整体特性，比如低温环境中原子在磁性材料和湍流中&amp;lt;font color='blue'&amp;gt;(表现出的)&amp;lt;/font&amp;gt;的复杂材料特性。使用'''元胞自动机 Cellular Automata'''，科学家们能够指定由元胞网格组成的系统，其中每个元胞只占据一些有限的状态，状态之间的变化完全由相邻元胞的状态控制。随着人工智能和微型计算机能力的进步，这些方法促进了“混沌理论”和“复杂性理论”的发展，这反过来又重新引起了人们对跨学科的复杂物理和社会系统的兴趣。明确致力于跨学科复杂性研究的机构也是在这个时代成立的: 圣菲研究所是由美国洛斯阿拉莫斯国家实验室（Los Alamos National Laboratory）的科学家于1984年建立的，密歇根大学的 BACH 小组也是在20世纪80年代中期建立的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This cellular automata paradigm gave rise to a third wave of social simulation emphasizing agent-based modeling. Like micro-simulations, these models emphasized bottom-up designs but adopted four key assumptions that diverged from microsimulation: autonomy, interdependency, simple rules, and adaptive behavior.&amp;lt;ref name=&amp;quot;MW&amp;quot;/&amp;gt; Agent-based models are less concerned with predictive accuracy and instead emphasize theoretical development.&amp;lt;ref&amp;gt;{{cite journal |title=A simulation of the structure of academic science |journal=Sociological Research Online |volume=2 |issue=2 |pages=1–15 |year=1997 |first=Nigel |last=Gilbert |url=http://www.socresonline.org.uk/socresonline/2/2/3.html |doi=10.5153/sro.85 |access-date=2009-12-16 |archive-url=https://web.archive.org/web/19980524062306/http://www.socresonline.org.uk/socresonline/2/2/3.html |archive-date=1998-05-24 |url-status=dead }}&amp;lt;/ref&amp;gt; In 1981, mathematician and political scientist [[Robert Axelrod]] and evolutionary biologist [[W.D. Hamilton]] published a major paper in ''[[Science (journal)|Science]]'' titled &amp;quot;The Evolution of Cooperation&amp;quot; which used an agent-based modeling approach to demonstrate how social cooperation based upon reciprocity can be established and stabilized in a [[prisoner's dilemma]] game when agents followed simple rules of self-interest.&amp;lt;ref&amp;gt;{{cite journal|title=The Evolution of Cooperation |first1=Robert |last1=Axelrod |first2=William D. |last2=Hamilton |journal=Science |volume=211 |issue=4489 |pages=1390–1396 |doi=10.1126/science.7466396|pmid=7466396 |date=March 27, 1981|bibcode=1981Sci...211.1390A }}&amp;lt;/ref&amp;gt; Axelrod and Hamilton demonstrated that individual agents following a simple rule set of (1) cooperate on the first turn and (2) thereafter replicate the partner's previous action were able to develop &amp;quot;norms&amp;quot; of cooperation and sanctioning in the absence of canonical sociological constructs such as demographics, values, religion, and culture as preconditions or mediators of cooperation.&amp;lt;ref name=&amp;quot;Cooperation&amp;quot;/&amp;gt; Throughout the 1990s, scholars like [[William Sims Bainbridge]], [[Kathleen Carley]], [[Michael Macy]],  and [[John Skvoretz]] developed multi-agent-based models of [[generalized reciprocity]], [[prejudice]], [[social influence]], and organizational [[information processing]]. In 1999, [[Nigel Gilbert]] published the first textbook on Social Simulation: ''Simulation for the social scientist'' and established its most relevant journal: the [[Journal of Artificial Societies and Social Simulation]].&lt;br /&gt;
&lt;br /&gt;
This cellular automata paradigm gave rise to a third wave of social simulation emphasizing agent-based modeling. Like micro-simulations, these models emphasized bottom-up designs but adopted four key assumptions that diverged from microsimulation: autonomy, interdependency, simple rules, and adaptive behavior. In 1981, mathematician and political scientist Robert Axelrod and evolutionary biologist W.D. Hamilton published a major paper in Science titled &amp;quot;The Evolution of Cooperation&amp;quot; which used an agent-based modeling approach to demonstrate how social cooperation based upon reciprocity can be established and stabilized in a prisoner's dilemma game when agents followed simple rules of self-interest. Axelrod and Hamilton demonstrated that individual agents following a simple rule set of (1) cooperate on the first turn and (2) thereafter replicate the partner's previous action were able to develop &amp;quot;norms&amp;quot; of cooperation and sanctioning in the absence of canonical sociological constructs such as demographics, values, religion, and culture as preconditions or mediators of cooperation. Throughout the 1990s, scholars like William Sims Bainbridge, Kathleen Carley, Michael Macy,  and John Skvoretz developed multi-agent-based models of generalized reciprocity, prejudice, social influence, and organizational information processing. In 1999, Nigel Gilbert published the first textbook on Social Simulation: Simulation for the social scientist and established its most relevant journal: the Journal of Artificial Societies and Social Simulation.&lt;br /&gt;
&lt;br /&gt;
元胞自动机范式引发了强调'''基于主体建模 Agent-based Modeling'''的第三次社会模拟浪潮。与微观模拟一样，这些模型强调自下而上的设计，但采用了与微观模拟不同的四个关键假设: '''自主性 Autonomy'''、'''相互依赖性 Interdependency'''、'''简单规则 Simple Rules'''和'''适应性行为 Adaptive Behavior'''。1981年，数学家、政治学家阿克塞尔罗德（Robert Axelrod）和进化生物学家汉密尔顿（W.D. Hamilton）在《科学》杂志上发表了一篇名为《合作的进化》（The Evolution of Cooperation）的重要论文，该论文采用基于主体建模方法，论证了在一个囚徒困境中，当主体遵循简单的自利规则（rules of self-interest）时，互惠的社会合作是如何建立和稳定的。阿克塞尔罗德和汉密尔顿证明，主体遵循这样一套简单的规则: (1)在第一轮进行合作，(2)在其后重复伙伴以前的行动，能够在没有人口学差异、价值观、宗教和文化等社会规范作为合作的先决条件或中介的情况下制定合作和制裁的“规范”。整个20世纪90年代，像威廉·希姆斯·本布里奇（William Sims Bainbridge），Kathleen Carley，Michael Macy 和 John Skvoretz 这样的学者开发了&amp;lt;s&amp;gt;基于多主体的&amp;lt;/s&amp;gt;&amp;lt;font color='blue'&amp;gt;关于&amp;lt;/font&amp;gt;广义互惠、偏见、社会影响和组织信息处理模型&amp;lt;font color='blue'&amp;gt;的多主体模型&amp;lt;/font&amp;gt;。1999年，吉尔伯特（Nigel Gilbert）出版了第一本关于社会模拟&amp;lt;font color='blue'&amp;gt;的教科书&amp;lt;/font&amp;gt;: 《写给社会科学家的仿真模拟（Simulation for the social scientist）》&amp;lt;s&amp;gt;的教科书&amp;lt;/s&amp;gt;，并建立了它最相关的杂志: 人工社会和社会模拟杂志（the Journal of Artificial Societies and Social Simulation）。&lt;br /&gt;
&lt;br /&gt;
===Data mining and social network analysis 数据挖掘和社会网络分析===&lt;br /&gt;
&lt;br /&gt;
{{main|Data mining|Social network analysis}}&lt;br /&gt;
&lt;br /&gt;
--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） 少一段原文 &lt;br /&gt;
Independent from developments in computational models of social systems, social network analysis emerged in the 1970s and 1980s from advances in graph theory, statistics, and studies of social structure as a distinct analytical method and was articulated and employed by sociologists like James S. Coleman, Harrison White, Linton Freeman, J. Clyde Mitchell, Mark Granovetter, Ronald Burt, and Barry Wellman.[22] The increasing pervasiveness of computing and telecommunication technologies throughout the 1980s and 1990s demanded analytical techniques, such as network analysis and multilevel modeling, that could scale to increasingly complex and large data sets. The most recent wave of computational sociology, rather than employing simulations, uses network analysis and advanced statistical techniques to analyze large-scale computer databases of electronic proxies for behavioral data. Electronic records such as email and instant message records, hyperlinks on the World Wide Web, mobile phone usage, and discussion on Usenet allow social scientists to directly observe and analyze social behavior at multiple points in time and multiple levels of analysis without the constraints of traditional empirical methods such as interviews, participant observation, or survey instruments.[23] Continued improvements in machine learning algorithms likewise have permitted social scientists and entrepreneurs to use novel techniques to identify latent and meaningful patterns of social interaction and evolution in large electronic datasets.[24][25]&lt;br /&gt;
&lt;br /&gt;
Independent from developments in computational models of social systems, social network analysis emerged in the 1970s and 1980s from advances in graph theory, statistics, and studies of social structure as a distinct analytical method and was articulated and employed by sociologists like [[James Samuel Coleman|James S. Coleman]], [[Harrison White]], [[Linton Freeman]], [[J. Clyde Mitchell]], [[Mark Granovetter]], [[Ronald Burt]], and [[Barry Wellman]].&amp;lt;ref&amp;gt;{{cite book|title=The Development of Social Network Analysis: A Study in the Sociology of Science |first=Linton C. |last=Freeman |publisher=Empirical Press |location=Vancouver, BC |year=2004}}&amp;lt;/ref&amp;gt; The increasing pervasiveness of computing and telecommunication technologies throughout the 1980s and 1990s demanded analytical techniques, such as [[network theory|network analysis]] and [[multilevel modeling]], that could scale to increasingly complex and large data sets. The most recent wave of computational sociology, rather than employing simulations, uses network analysis and advanced statistical techniques to analyze large-scale computer databases of electronic proxies for behavioral data. Electronic records such as email and instant message records, hyperlinks on the [[World Wide Web]], mobile phone usage, and discussion on [[Usenet]] allow social scientists to directly observe and analyze social behavior at multiple points in time and multiple levels of analysis without the constraints of traditional empirical methods such as interviews, participant observation, or survey instruments.&amp;lt;ref&amp;gt;{{cite journal|title=Life in the network: the coming age of computational social science|first9=J|last10=Gutmann|first10=M.|last11=Jebara|first11=T.|last12=King|first12=G.|last13=Macy|first13=M.|last14=Roy|first14=D.|last15=Van Alstyne|first15=M.|last9=Fowler|first8=N|last8=Contractor|first7=N|last7=Christakis|first6=D|last6=Brewer|first5=AL|last5=Barabasi|first4=S |journal=Science|last4=Aral |date=February 6, 2009|first3=L |volume=323|pmid=19197046 |issue=5915|last3=Adamic |pages=721–723|pmc=2745217 |doi=10.1126/science.1167742 |first1=David |last1=Lazer |first2=Alex |last2=Pentland |display-authors=8}}&amp;lt;/ref&amp;gt; Continued improvements in [[machine learning]] algorithms likewise have permitted social scientists and entrepreneurs to use novel techniques to identify latent and meaningful patterns of social interaction and evolution in large electronic datasets.&amp;lt;ref&amp;gt;{{cite journal|first1=Jaideep |last1=Srivastava |first2=Robert |last2=Cooley |first3=Mukund |last3=Deshpande |first4=Pang-Ning |last4=Tan |journal=Proceedings of the ACM Conference on Knowledge Discovery and Data Mining |title=Web usage mining: discovery and applications of usage patterns from Web data|volume=1 |year=2000 |pages=12–23 |doi=10.1145/846183.846188|issue=2}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|doi=10.1016/S0169-7552(98)00110-X|title=The anatomy of a large-scale hypertextual Web search engine |first1=Sergey |last1=Brin |first2=Lawrence |last2=Page |journal=Computer Networks and ISDN Systems |volume=30 |issue=1–7 |pages=107–117 |date=April 1998|citeseerx=10.1.1.115.5930 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Independent from developments in computational models of social systems, social network analysis emerged in the 1970s and 1980s from advances in graph theory, statistics, and studies of social structure as a distinct analytical method and was articulated and employed by sociologists like James S. Coleman, Harrison White, Linton Freeman, J. Clyde Mitchell, Mark Granovetter, Ronald Burt, and Barry Wellman. The increasing pervasiveness of computing and telecommunication technologies throughout the 1980s and 1990s demanded analytical techniques, such as network analysis and multilevel modeling, that could scale to increasingly complex and large data sets. The most recent wave of computational sociology, rather than employing simulations, uses network analysis and advanced statistical techniques to analyze large-scale computer databases of electronic proxies for behavioral data. Electronic records such as email and instant message records, hyperlinks on the World Wide Web, mobile phone usage, and discussion on Usenet allow social scientists to directly observe and analyze social behavior at multiple points in time and multiple levels of analysis without the constraints of traditional empirical methods such as interviews, participant observation, or survey instruments. Continued improvements in machine learning algorithms likewise have permitted social scientists and entrepreneurs to use novel techniques to identify latent and meaningful patterns of social interaction and evolution in large electronic datasets.&lt;br /&gt;
&lt;br /&gt;
'''社会网络分析 Social Network Analysis'''独立于社会系统计算模型的发展，在20世纪70年代和80年代出现于图论、统计学和社会结构的研究中，它作为一种独特的分析方法被社会学家如 James s. Coleman，Harrison White，Linton Freeman，J. Clyde Mitchell，Mark Granovetter，Ronald Burt 和 Barry Wellman 等阐述和采用。在整个1980年代和1990年代，计算和通信技术日益普及，这要求采用诸如网络分析和多级建模等分析技术，这些技术可以扩展到日益复杂和庞大的数据集中。最近的计算社会学没有使用模拟，而是使用网络分析和先进的统计技术来分析大规模&amp;lt;font color='blue'&amp;gt;电子服务器构成的&amp;lt;/font&amp;gt;计算机数据库中&amp;lt;s&amp;gt;电子代理&amp;lt;/s&amp;gt;的行为数据。电子记录，如电子邮件和即时消息记录，万维网上的超链接，移动电话数据，以及 Usenet 上的讨论，使社会科学家能够直接观察社会行为并在多个时间点和多个层次的分析行为，并且不受传统的实证方法，如访谈、观察（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]）为了通顺，删除研究对象/被试：participants）或调查工具的限制。机器学习算法的不断改进同样使得社会科学家和企业家能够使用新技术来识别大型电子数据集中潜在但有意义的社会互动和演化模式。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:Tripletsnew2012.png|thumb|right|Narrative network of US Elections 2012&amp;lt;ref name=&amp;quot;ReferenceA&amp;quot;&amp;gt;{{cite journal|title=Automated analysis of the US presidential elections using Big Data and network analysis|author1=S Sudhahar|author2=GA Veltri|author3=N Cristianini|journal=Big Data &amp;amp; Society|volume=2|issue=1|pages=1–28|year=2015|doi=10.1177/2053951715572916|doi-access=free}}&amp;lt;/ref&amp;gt;]]&lt;br /&gt;
&lt;br /&gt;
Narrative network of US Elections 2012&lt;br /&gt;
&lt;br /&gt;
【图2：Narrative network of US Elections 2012 + 2012年美国大选叙事网络】&lt;br /&gt;
&lt;br /&gt;
The automatic parsing of textual corpora has enabled the extraction of actors and their relational networks on a vast scale, turning textual data into network data.  The resulting networks, which can contain thousands of nodes, are then analysed by using tools from Network theory to identify the key actors, the key communities or parties, and general properties such as robustness or structural stability of the overall network, or centrality of certain nodes.&amp;lt;ref&amp;gt;{{cite journal|title=Network analysis of narrative content in large corpora|author1=S Sudhahar|author2=G De Fazio|author3=R Franzosi|author4=N Cristianini|journal=Natural Language Engineering|volume=21|issue=1|pages=1–32|year=2013|doi=10.1017/S1351324913000247 |url=https://research-information.bristol.ac.uk/files/129621186/Network_Analysis_of_Narrative_Content_in_Large_Corpora.pdf}}&amp;lt;/ref&amp;gt; This automates the approach introduced by quantitative narrative analysis,&amp;lt;ref&amp;gt;{{cite book|title=Quantitative Narrative Analysis|last=Franzosi|first=Roberto|publisher=Emory University|year=2010}}&amp;lt;/ref&amp;gt; whereby subject-verb-object triplets are identified with pairs of actors linked by an action, or pairs formed by actor-object.&amp;lt;ref name=&amp;quot;ReferenceA&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The automatic parsing of textual corpora has enabled the extraction of actors and their relational networks on a vast scale, turning textual data into network data.  The resulting networks, which can contain thousands of nodes, are then analysed by using tools from Network theory to identify the key actors, the key communities or parties, and general properties such as robustness or structural stability of the overall network, or centrality of certain nodes. This automates the approach introduced by quantitative narrative analysis, whereby subject-verb-object triplets are identified with pairs of actors linked by an action, or pairs formed by actor-object.&lt;br /&gt;
&lt;br /&gt;
文本语料库的自动解析使对参与者及其关系网络的大规模提取成为可能，它将文本数据转换为网络数据。由此产生的网络可以包含数千个'''节点 Nodes'''，然后利用网络理论中的工具对其进行分析，以确定关键参与者、关键群体，以及网络的总体特性如稳健性、结构稳定性，或某些节点的'''中心性 Centrality'''等。这使'''定量叙事分析Quantitative Narrative Analysis'''引入的方法得以自动化，据此，主语-动词-宾语三元组被看作由动作连接的成对行为者，或者由行为者-宾语形成的成对行为者。&lt;br /&gt;
&lt;br /&gt;
===Computational content analysis 计算机内容分析 （名词翻译可吗？）===&lt;br /&gt;
&lt;br /&gt;
[[Content analysis]] has been a traditional part of social sciences and media studies for a long time. The automation of content analysis has allowed a &amp;quot;[[big data]]&amp;quot; revolution to take place in that field, with studies in social media and newspaper content that include millions of news items. [[Gender bias]], [[readability]], content similarity, reader preferences, and even mood have been analyzed based on [[text mining]] methods over millions of documents.&amp;lt;ref&amp;gt;{{cite journal|author1=I. Flaounas|author2=M. Turchi|author3=O. Ali|author4=N. Fyson|author5=T. De Bie|author6=N. Mosdell|author7=J. Lewis|author8=N. Cristianini|title=The Structure of EU Mediasphere|journal=PLOS One|volume=5|issue=12|pages=e14243|year=2010|doi=10.1371/journal.pone.0014243|url=https://orca-mwe.cf.ac.uk/50732/1/Flaounas%202010.pdf|pmid=21170383|pmc=2999531|bibcode=2010PLoSO...514243F}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|title=Nowcasting Events from the Social Web with Statistical Learning|author1=V Lampos|author2=N Cristianini|journal=ACM Transactions on Intelligent Systems and Technology |volume=3|issue=4|page=72|doi=10.1145/2337542.2337557|year=2012|url=http://www.lampos.net/sites/default/files/papers/lampos2012nowcasting.pdf}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite conference|title=NOAM: news outlets analysis and monitoring system|author1=I. Flaounas|author2=O. Ali|author3=M. Turchi|author4=T Snowsill|author5=F Nicart|author6=T De Bie|author7=N Cristianini|conference=Proc. of the 2011 ACM SIGMOD international conference on Management of data|year=2011|url=http://www.tijldebie.net/system/files/SIGMOD_11_demo_Ilias.pdf|doi=10.1145/1989323.1989474}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite book|author=N Cristianini|title=''Combinatorial Pattern Matching''|pages=2–13|year=2011|volume=6661|series= Lecture Notes in Computer Science|isbn=978-3-642-21457-8|doi=10.1007/978-3-642-21458-5_2|chapter=Automatic Discovery of Patterns in Media Content|citeseerx=10.1.1.653.9525}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite journal|last=Lansdall-Welfare|first=Thomas|last2=Sudhahar|first2=Saatviga|last3=Thompson|first3=James|last4=Lewis|first4=Justin|last5=Team|first5=FindMyPast Newspaper|last6=Cristianini|first6=Nello|date=2017-01-09|title=Content analysis of 150 years of British periodicals|url=http://www.pnas.org/content/early/2017/01/03/1606380114|journal=Proceedings of the National Academy of Sciences|volume=114|issue=4|language=en|pages=E457–E465|doi=10.1073/pnas.1606380114|issn=0027-8424|pmid=28069962|pmc=5278459}}&amp;lt;/ref&amp;gt; The analysis of readability, gender bias and topic bias was demonstrated in Flaounas et al.&amp;lt;ref&amp;gt;{{cite journal|author1=I. Flaounas|author2=O. Ali|author3=M. Turchi|author4=T. Lansdall-Welfare|author5=T. De Bie|author6=N. Mosdell|author7=J. Lewis|author8=N. Cristianini|title=Research methods in the age of digital journalism|journal=Digital Journalism|year=2012|doi=10.1080/21670811.2012.714928|volume=1|pages=102–116}}&amp;lt;/ref&amp;gt; showing how different topics have different gender biases and levels of readability; the possibility to detect mood shifts in a vast population by analysing Twitter content was demonstrated as well.&amp;lt;ref&amp;gt;{{cite conference|title=Effects of the Recession on Public Mood in the UK|author=T Lansdall-Welfare|author2=V Lampos|author3=N Cristianini|series=Mining Social Network Dynamics (MSND) session on Social Media Applications|doi=10.1145/2187980.2188264|conference=Proceedings of the 21st International Conference on World Wide Web|pages=1221–1226|location=New York, NY, USA|url=http://www.cs.bris.ac.uk/Publications/Papers/2001521.pdf}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Content analysis has been a traditional part of social sciences and media studies for a long time. The automation of content analysis has allowed a &amp;quot;big data&amp;quot; revolution to take place in that field, with studies in social media and newspaper content that include millions of news items. Gender bias, readability, content similarity, reader preferences, and even mood have been analyzed based on text mining methods over millions of documents. The analysis of readability, gender bias and topic bias was demonstrated in Flaounas et al. showing how different topics have different gender biases and levels of readability; the possibility to detect mood shifts in a vast population by analysing Twitter content was demonstrated as well.&lt;br /&gt;
&lt;br /&gt;
长期以来，内容分析一直是社会科学和媒体研究的传统方法。内容分析的自动化使得这一领域发生了一场“大数据”革命，这些研究中，社交媒体和报纸内容包括了数百万条的新闻。基于文本挖掘方法，'''性别偏差Gender Bias'''、'''可读性 Readability'''、'''内容相似度 Content Similarity'''、'''读者偏好 Reader Preferences'''，甚至是'''情绪 Mood'''的数以百万计的文档都可以被分析。Flaounas等人对可读性、性别偏差和'''话题偏差 Topic Bias'''为主要研究对象，展示了不同的话题如何有不同水平的性别偏差和可读性; 展示了通过分析推特内容来检测人群情绪变化的可能性。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The analysis of vast quantities of historical newspaper content has been pioneered by Dzogang et al.,&amp;lt;ref&amp;gt;{{Cite journal|last=Dzogang|first=Fabon|last2=Lansdall-Welfare|first2=Thomas|last3=Team|first3=FindMyPast Newspaper|last4=Cristianini|first4=Nello|date=2016-11-08|title=Discovering Periodic Patterns in Historical News|journal=PLOS One|volume=11|issue=11|pages=e0165736|doi=10.1371/journal.pone.0165736|issn=1932-6203|pmc=5100883|pmid=27824911|bibcode=2016PLoSO..1165736D}}&amp;lt;/ref&amp;gt; which showed how periodic structures can be automatically discovered in historical newspapers. A similar analysis was performed on social media, again revealing strongly periodic structures.&amp;lt;ref&amp;gt;[https://core.ac.uk/download/pdf/83929129.pdf Seasonal Fluctuations in Collective Mood Revealed by Wikipedia Searches and Twitter Posts] F Dzogang, T Lansdall-Welfare, N Cristianini - 2016 IEEE International Conference on Data Mining, Workshop on ''Data Mining'' in Human Activity Analysis&lt;br /&gt;
&lt;br /&gt;
The analysis of vast quantities of historical newspaper content has been pioneered by Dzogang et al., which showed how periodic structures can be automatically discovered in historical newspapers. A similar analysis was performed on social media, again revealing strongly periodic structures.&amp;lt;ref&amp;gt;[https://core.ac.uk/download/pdf/83929129.pdf Seasonal Fluctuations in Collective Mood Revealed by Wikipedia Searches and Twitter Posts] F Dzogang, T Lansdall-Welfare, N Cristianini - 2016 IEEE International Conference on Data Mining, Workshop on Data Mining in Human Activity Analysis&lt;br /&gt;
&lt;br /&gt;
对大量历史报纸内容的分析是由 Dzogang 等人率先进行的，他们展示了如何在历史报纸中自动发现'''周期结构 Periodic Structures'''。一个类似的社交媒体上进行的分析，也揭示了强烈的周期性结构。 参考文献[ https://core.ac.uk/download/pdf/83929129.pdf 维基百科搜索和推特帖子揭示的集体情绪的季节性波动] f Dzogang，t Lansdall-Welfare，n Cristianini-2016 IEEE International Conference on Data Mining, Workshop on Data Mining in Human Activity Analysis&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
==Challenges 挑战==&lt;br /&gt;
&lt;br /&gt;
Computational sociology, as with any field of study, faces a set of challenges.&amp;lt;ref name=&amp;quot;MCSS&amp;quot;&amp;gt;Conte, Rosaria, et al. &amp;quot;[https://link.springer.com/content/pdf/10.1140%252Fepjst%252Fe2012-01697-8.pdf Manifesto of computational social science].&amp;quot; The European Physical Journal Special Topics 214.1 (2012): 325-346.&amp;lt;/ref&amp;gt; These challenges need to be handled meaningfully so as to make the maximum impact on society.&lt;br /&gt;
&lt;br /&gt;
Computational sociology, as with any field of study, faces a set of challenges. These challenges need to be handled meaningfully so as to make the maximum impact on society.&lt;br /&gt;
&lt;br /&gt;
计算社会学和其他研究领域一样面临着一系列的挑战。必须有意义地处理这些挑战（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） meaningfully怎么翻译才比较通顺？），才能对社会产生最大的影响。&lt;br /&gt;
  &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Levels and their interactions 层级和层级的交互关系===&lt;br /&gt;
&lt;br /&gt;
Each society that is formed tends to be in one level or the other and there exists tendencies of interactions between and across these levels. Levels need not only be micro-level or macro-level in nature. There can be intermediate levels in which a society exists say - groups, networks, communities etc.&amp;lt;ref name=&amp;quot;MCSS&amp;quot; /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Each society that is formed tends to be in one level or the other and there exists tendencies of interactions between and across these levels. Levels need not only be micro-level or macro-level in nature. There can be intermediate levels in which a society exists say - groups, networks, communities etc.&lt;br /&gt;
&lt;br /&gt;
形成的每个社会都处于某种层次上，并且这些层次之间有相互作用的倾向。社会中的级别不仅可以分为微观或宏观的层次，还可以存在中间的层次，比如群体、网络、社区等。&lt;br /&gt;
（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） 合并了英文的原句）&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The question however arises as to how to identify these levels and how they come into existence? And once they are in existence how do they interact within themselves and with other levels?&lt;br /&gt;
&lt;br /&gt;
The question however arises as to how to identify these levels and how they come into existence? And once they are in existence how do they interact within themselves and with other levels?&lt;br /&gt;
&lt;br /&gt;
然而问题是，这些层次是如何确定的以及如何产生的？并且，一旦它们产生了，它们如何在自身内部以及与其他层次相互作用？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
If we view entities (agents) as nodes and the connections between them as the edges, we see the formation of networks. The connections in these networks do not come about based on just objective relationships between the entities, rather they are decided upon by factors chosen by the participating entities.&amp;lt;ref&amp;gt;{{cite journal|last1=Egu´ıluz|first1=V. M.|last2=Zimmermann|first2=M. G.|last3=Cela-Conde|first3=C. J.|last4=San Miguel|first4=M.|title=American Journal of Sociology|issue=2005|pages=110, 977}}&amp;lt;/ref&amp;gt; The challenge with this process is that, it is difficult to identify when a set of entities will form a network. These networks may be of trust networks, co-operation networks, dependence networks etc. There have been cases where heterogeneous set of entities have shown to form strong and meaningful networks among themselves.&amp;lt;ref&amp;gt;{{cite journal|last1=Sichman|first1=J. S.|last2=Conte|first2=R.|title=Computational &amp;amp; Mathematical Organization Theory|issue=2002|pages=8(2)}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Ehrhardt|first1=G.|last2=Marsili|first2=M.|last3=Vega-Redondo|first3=F.|title=Physical Review E|issue=2006|pages=74(3)}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
If we view entities (agents) as nodes and the connections between them as the edges, we see the formation of networks. The connections in these networks do not come about based on just objective relationships between the entities, rather they are decided upon by factors chosen by the participating entities. The challenge with this process is that, it is difficult to identify when a set of entities will form a network. These networks may be of trust networks, co-operation networks, dependence networks etc. There have been cases where heterogeneous set of entities have shown to form strong and meaningful networks among themselves.&lt;br /&gt;
&lt;br /&gt;
如果我们把'''实体 Entities'''（'''主体 Agents'''）看作节点，把它们之间的连接看作边，我们就看到了网络的形成。这些网络中的连接并非只是基于实体之间的客观关系，而是由实体选择的因素决定的。这个过程的困难之处在于，很难确定一组实体何时形成网络。这些网络可以是信任网络、合作网络、依赖网络等。在一些情况下，异质的实体集在它们之间形成了强大而有意义的网络。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
As discussed previously, societies fall into levels and in one such level, the individual level, a micro-macro link&amp;lt;ref&amp;gt;Billari, Francesco C. [https://books.google.com/books?hl=en&amp;amp;lr=&amp;amp;id=Tc8iL0b-OycC&amp;amp;oi=fnd&amp;amp;pg=PA1&amp;amp;dq=%22Agent-based+computational+modelling:+applications+in+demography,+social,+economic+and+environmental+sciences%22&amp;amp;ots=6MNVK7JP-e&amp;amp;sig=-o_iS9zCK3r-t1eHn3554UVadUs Agent-based computational modelling: applications in demography, social, economic and environmental sciences]. Taylor &amp;amp; Francis, 2006.&amp;lt;/ref&amp;gt; refers to the interactions which create higher-levels. There are a set of questions that needs to be answered regarding these Micro-Macro links. How they are formed? When do they converge? What is the feedback pushed to the lower levels and how are they pushed?&lt;br /&gt;
&lt;br /&gt;
As discussed previously, societies fall into levels and in one such level, the individual level, a micro-macro link refers to the interactions which create higher-levels. There are a set of questions that needs to be answered regarding these Micro-Macro links. How they are formed? When do they converge? What is the feedback pushed to the lower levels and how are they pushed?&lt;br /&gt;
&lt;br /&gt;
正如前面所讨论的，社会分为不同层次。在其中的一个层次：个体层次中，'''微观-宏观联系 Micro-macro Link'''指的是创造更高层次的相互作用。关于微观-宏观链接有一系列问题等待回答。它们是如何形成的？它们什么时候汇聚？什么反馈被推到了较低的层次，以及它们是如何被推到较低层次的？ &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Another major challenge in this category concerns the validity of information and their sources. In recent years there has been a boom in information gathering and processing. However, little attention was paid to the spread of false information between the societies. Tracing back the sources and finding ownership of such information is difficult.&lt;br /&gt;
&lt;br /&gt;
Another major challenge in this category concerns the validity of information and their sources. In recent years there has been a boom in information gathering and processing. However, little attention was paid to the spread of false information between the societies. Tracing back the sources and finding ownership of such information is difficult.&lt;br /&gt;
&lt;br /&gt;
这一分类的另一个主要挑战涉及信息的有效性及其来源。近年来，信息收集和处理有着蓬勃的发展。但人们很少注意到社会之间虚假信息的传播。追溯资料来源并找到这些资料的所有者是很困难的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Culture modeling 文化建模===&lt;br /&gt;
&lt;br /&gt;
The evolution of the networks and levels in the society brings about cultural diversity.&amp;lt;ref&amp;gt;{{cite journal|last1=Centola|first1=D.|last2=Gonz´alez-Avella|first2=J. C.|last3=Egu´ıluz|first3=V. M.|last4=San Miguel|first4=M.|title=Journal of Conflict Resolution|issue=2007|pages=51}}&amp;lt;/ref&amp;gt; A thought which arises however is that, when people tend to interact and become more accepting of other cultures and beliefs, how is it that diversity still persists? Why is there no convergence? A major challenge is how to model these diversities. Are there external factors like mass media, locality of societies etc. which influence the evolution or persistence of cultural diversities?{{Citation needed|reason=Sounds just like personal thoughts|date=May 2017}}&lt;br /&gt;
&lt;br /&gt;
The evolution of the networks and levels in the society brings about cultural diversity. A thought which arises however is that, when people tend to interact and become more accepting of other cultures and beliefs, how is it that diversity still persists? Why is there no convergence? A major challenge is how to model these diversities. Are there external factors like mass media, locality of societies etc. which influence the evolution or persistence of cultural diversities?&lt;br /&gt;
&lt;br /&gt;
社会网络和层次的演变带来了文化的多样性。然而人们会想，当人们倾向于相互作用，变得更能接受其他文化和信仰时，为什么多样性仍然存在？为什么人们没有趋同？一个主要的挑战是如何为这些多样性建立模型。是否存在大众传媒、社会地域性等外部因素，这些因素影响文化多样性的演化或保持？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Experimentation and evaluation 实验和评估===&lt;br /&gt;
&lt;br /&gt;
Any study or modelling when combined with experimentation needs to be able to address the questions being asked. [[Computational social science]] deals with large scale data and the challenge becomes much more evident as the scale grows. How would one design informative simulations on a large scale? And even if a large scale simulation is brought up, how is the evaluation supposed to be performed?&lt;br /&gt;
&lt;br /&gt;
Any study or modelling when combined with experimentation needs to be able to address the questions being asked. Computational social science deals with large scale data and the challenge becomes much more evident as the scale grows. How would one design informative simulations on a large scale? And even if a large scale simulation is brought up, how is the evaluation supposed to be performed?&lt;br /&gt;
&lt;br /&gt;
任何与实验结合的研究或建模都需要能够解决所提出的问题。计算社会科学处理大规模数据，并且数据规模越大建模的挑战就越明显。如何在一个大规模的数据集里设计信息仿真模型？并且，即使提出了一个大规模的仿真模型，应该如何对它进行评估？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Model choice and model complexities 模型选择和模型复杂性===&lt;br /&gt;
&lt;br /&gt;
Another challenge is identifying the models that would best fit the data and the complexities of these models. These models would help us predict how societies might evolve over time and provide possible explanations on how things work.&amp;lt;ref&amp;gt;Weisberg, Michael. [http://www.academia.edu/download/30604870/lessmorefinal.pdf When less is more: Tradeoffs and idealization in model building]. Diss. Stanford University, 2003.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Another challenge is identifying the models that would best fit the data and the complexities of these models. These models would help us predict how societies might evolve over time and provide possible explanations on how things work.&lt;br /&gt;
&lt;br /&gt;
另一个挑战是确定最适合数据的模型，以及最合适的'''模型复杂性 Model Complexities'''。这些模型将帮助我们预测随着时间的推移社会将如何演变，并为事物如何运动和变化提供可能的解释。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====Generative models 生成模型====&lt;br /&gt;
&lt;br /&gt;
Generative models helps us to perform extensive qualitative analysis in a controlled fashion. A model proposed by Epstein, is the agent-based simulation, which talks about identifying an initial set of heterogeneous entities (agents) and observe their evolution and growth based on simple local rules.&amp;lt;ref&amp;gt;Epstein, Joshua M. [https://www.researchgate.net/profile/Eric_Jones14/publication/283615593_Book_Review_-_Generative_Social_Science_Studies_in_Agent-Based_Computational_Modeling/links/5641398808aebaaea1f70216.pdf Generative social science: Studies in agent-based computational modeling]. Princeton University Press, 2006.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Generative models helps us to perform extensive qualitative analysis in a controlled fashion. A model proposed by Epstein, is the agent-based simulation, which talks about identifying an initial set of heterogeneous entities (agents) and observe their evolution and growth based on simple local rules.&lt;br /&gt;
&lt;br /&gt;
'''生成模型 Generative Models'''帮助我们以一种受控的方式进行广泛的定性分析。爱泼斯坦（Epstein）提出的一个基于主体的模型，就是探讨如何识别异质实体(主体)的'''初始集 Initial Set'''，并根据简单的局部规则观察它们的演化和增长。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
But what are these local rules? How does one identify them for a set of heterogeneous agents? Evaluation and impact of these rules state a whole new set of difficulties.&lt;br /&gt;
&lt;br /&gt;
But what are these local rules? How does one identify them for a set of heterogeneous agents? Evaluation and impact of these rules state a whole new set of difficulties.&lt;br /&gt;
&lt;br /&gt;
但是这些局部规则是什么呢？如何识别一组异质实体？这些规则的评估和影响都是新出现的困难之处。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====Heterogeneous or ensemble models 异质模型和组合模型====&lt;br /&gt;
&lt;br /&gt;
Integrating simple models which perform better on individual tasks to form a Hybrid model is an approach that can be looked into{{Citation needed|reason=unsupported claims|date=May 2017}}. These models can offer better performance and understanding of the data. However the trade-off of identifying and having a deep understanding of the interactions between these simple models arises when one needs to come up with one combined, well performing model. Also, coming up with tools and applications to help analyse and visualize the data based on these hybrid models is another added challenge.&lt;br /&gt;
&lt;br /&gt;
Integrating simple models which perform better on individual tasks to form a Hybrid model is an approach that can be looked into. These models can offer better performance and understanding of the data. However the trade-off of identifying and having a deep understanding of the interactions between these simple models arises when one needs to come up with one combined, well performing model. Also, coming up with tools and applications to help analyse and visualize the data based on these hybrid models is another added challenge.&lt;br /&gt;
&lt;br /&gt;
集成在单个任务中表现良好的简单模型并形成'''混合模型 Hybrid model'''是一种可以继续考虑的方法。这些模型有更好的性能并可以对数据提供更好的理解。然而，当需要提出一个整合的、性能良好的模型时，识别简单模型和深入理解模型之间相互作用的权衡问题就出现了。此外，另一个挑战是开发工具和应用程序来帮助分析和可视化基于这些混合模型的数据。&lt;br /&gt;
&lt;br /&gt;
==Impact 影响==&lt;br /&gt;
&lt;br /&gt;
Computational sociology can bring impacts to science, technology and society.&amp;lt;ref name=&amp;quot;MCSS&amp;quot; /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Computational sociology can bring impacts to science, technology and society.&lt;br /&gt;
&lt;br /&gt;
计算社会学可以给科学、技术和社会带来影响。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Impact on science 对科学的影响===&lt;br /&gt;
&lt;br /&gt;
In order for the study of computational sociology to be effective, there has to be valuable innovations. These innovation can be of the form of new data analytics tools, better models and algorithms. The advent of such innovation will be a boon for the scientific community in large. {{Citation needed|reason=citation for claim on innovation and the type of innovation|date=May 2017}}&lt;br /&gt;
&lt;br /&gt;
In order for the study of computational sociology to be effective, there has to be valuable innovations. These innovation can be of the form of new data analytics tools, better models and algorithms. The advent of such innovation will be a boon for the scientific community in large. &lt;br /&gt;
&lt;br /&gt;
为了使计算社会学的研究有效，必须有一些有价值的创新。这些创新可以是新形式的数据分析工具，或更好的模型和算法。这些创新的出现将为整个科学界带来益处。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Impact on society 对社会的影响===&lt;br /&gt;
&lt;br /&gt;
One of the major challenges of computational sociology is the modelling of social processes {{Citation needed|reason=to support the claim for need of modeling of social processes|date=May 2017}}. Various law and policy makers would be able to see efficient and effective paths to issue new guidelines and the mass in general would be able to evaluate and gain fair understanding of the options presented in front of them enabling an open and well balanced decision process. {{Citation needed|reason=unsupported claims|date=May 2017}}.&lt;br /&gt;
&lt;br /&gt;
One of the major challenges of computational sociology is the modelling of social processes . Various law and policy makers would be able to see efficient and effective paths to issue new guidelines and the mass in general would be able to evaluate and gain fair understanding of the options presented in front of them enabling an open and well balanced decision process. &lt;br /&gt;
&lt;br /&gt;
计算社会学的主要挑战之一是对社会过程的建模。各种法律和政策制定者将能够得到发布新指导方针的快速有效的方法，广大群众将能够评价和更好地理解各种备选方案，从而实现决策进程的公开和平衡。&lt;br /&gt;
&lt;br /&gt;
==Journals and academic publications 期刊和学术出版物==&lt;br /&gt;
&lt;br /&gt;
The most relevant journal of the discipline is the [[Journal of Artificial Societies and Social Simulation]].&lt;br /&gt;
&lt;br /&gt;
The most relevant journal of the discipline is the Journal of Artificial Societies and Social Simulation.&lt;br /&gt;
&lt;br /&gt;
该学科最相关的期刊是《人工社会与社会模拟（the Journal of Artificial Societies and Social Simulation）》。&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20100611121626/http://www.ccsr.uiuc.edu/web/Journals/Journals.html Complexity Research Journal List], from UIUC, IL 复杂研究期刊列表（资料来自伊利诺伊大学香槟分校）&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20100611091342/http://www.ccsr.uiuc.edu/web/Groups/Groups.html Related Research Groups], from UIUC, IL 相关研究组（资料来自伊利诺伊大学香槟分校）&lt;br /&gt;
&lt;br /&gt;
==Associations, conferences and workshops 协会、会议及工作坊==&lt;br /&gt;
&lt;br /&gt;
*[http://www.casos.cs.cmu.edu/naacsos/ North American Association for Computational Social and Organization Sciences]&lt;br /&gt;
&lt;br /&gt;
*[http://www.essa.eu.org/ ESSA: European Social Simulation Association]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Academic programs, departments and degrees 学术课程、院系和学位==&lt;br /&gt;
&lt;br /&gt;
* [http://mediapatterns.enm.bris.ac.uk/ University of Bristol &amp;quot;Mediapatterns&amp;quot; project]&lt;br /&gt;
&lt;br /&gt;
* [http://www.cos.cs.cmu.edu/ Carnegie Mellon University], [http://www.casos.cs.cmu.edu PhD program] in Computation, Organizations and Society (COS)&lt;br /&gt;
&lt;br /&gt;
* [http://www.uchicago.edu University of Chicago]&lt;br /&gt;
&lt;br /&gt;
** [https://macss.uchicago.edu/ Certificate, MA and PhD in Computational Social Sciences]&lt;br /&gt;
&lt;br /&gt;
* [http://www.gmu.edu George Mason University]&lt;br /&gt;
&lt;br /&gt;
** PhD program in [http://css.gmu.edu CSS (Computational Social Sciences)]&lt;br /&gt;
&lt;br /&gt;
** MA program in [http://mais.gmu.edu/programs/la-mais-css Master's of Interdisciplinary Studies, CSS emphasis]&lt;br /&gt;
&lt;br /&gt;
* [http://www.pdx.edu/sysc/program-systems-science-phd-program Portland State], PhD program in Systems Science&lt;br /&gt;
&lt;br /&gt;
* [http://www.pdx.edu/sysc/program-systems-science-masters-program Portland State], MS program in Systems Science&lt;br /&gt;
&lt;br /&gt;
* [http://www.ucd.ie University College Dublin], &lt;br /&gt;
&lt;br /&gt;
** PhD Program in [http://www.ucd.ie/geary/postgraduatetraining/cscs Complex Systems and Computational Social Science]&lt;br /&gt;
&lt;br /&gt;
** MSc in [https://sisweb.ucd.ie/usis/!W_HU_MENU.P_PUBLISH?p_tag=PROG&amp;amp;MAJR=W390 Social Data Analytics] &lt;br /&gt;
&lt;br /&gt;
** BSc in [https://www.myucd.ie/courses/social-sciences/computational-social-science Computational Social Science] &lt;br /&gt;
&lt;br /&gt;
* [https://archive.is/20121215023745/http://hcs.ucla.edu/courses.htm UCLA], Minor in Human Complex Systems&lt;br /&gt;
&lt;br /&gt;
* [http://www.cs.ucla.edu/~cyber/ UCLA], Major in Computational &amp;amp; Systems Biology (including behavioral sciences)&lt;br /&gt;
&lt;br /&gt;
* [http://cscs.umich.edu/education/undergrad/undergrad.html Univ. of Michigan], Minor in Complex Systems&lt;br /&gt;
&lt;br /&gt;
* [http://www.pdx.edu/sysc/resources-other-systems-science-programs Systems Sciences Programs List], Portland State.  List of other worldwide related programs.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Centers and institutes 中心和机构==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===North America 北美===&lt;br /&gt;
&lt;br /&gt;
* [http://cnets.indiana.edu/ Center for Complex Networks and Systems Research], Indiana University, Bloomington, IN, USA.&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20110430200327/http://www.ccsr.uiuc.edu/ Center for Complex Systems Research], University of Illinois at Urbana-Champaign, IL, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://socialcomplexity.gmu.edu/ Center for Social Complexity], George Mason University, Fairfax, VA, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.asu.edu/clas/csdc/ Center for Social Dynamics and Complexity], Arizona State University, Tempe, AZ, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.cscs.umich.edu/ Center of the Study of Complex Systems], University of Michigan, Ann Arbor, MI, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://hcs.ucla.edu/ Human Complex Systems], University of California Los Angeles, Los Angeles, CA, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.iq.harvard.edu/ Institute for Quantitative Social Science], Harvard University, Boston, MA, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.nico.northwestern.edu/ Northwestern Institute on Complex Systems (NICO)], Northwestern University, Evanston, IL USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.santafe.edu/ Santa Fe Institute], Santa Fe, NM, USA.&lt;br /&gt;
&lt;br /&gt;
* Duke Network Analysis Center, [[Duke University]], Durham, NC, USA&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===South America 南美===&lt;br /&gt;
&lt;br /&gt;
* [http://www5.each.usp.br/mestrado-academico-em-modelagem-de-sistemas-complexos/ Modelagem de Sistemas Complexos], University of São Paulo - EACH, São Paulo, SP, Brazil&lt;br /&gt;
&lt;br /&gt;
* [http://inct.cnpq.br/web/inct-sc Instituto Nacional de Ciência e Tecnologia de Sistemas Complexos], Centro Brasileiro de Pesquisas Físicas, Rio de Janeiro, RJ, Brazil&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Europe 欧洲===&lt;br /&gt;
&lt;br /&gt;
* [http://cfpm.org Centre for Policy Modelling], Manchester, UK.&lt;br /&gt;
&lt;br /&gt;
* [http://cress.soc.surrey.ac.uk/ Centre for Research in Social Simulation], University of Surrey, UK.&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20130425014018/http://dl.ucd.ie/ UCD Dynamics Lab- Centre for Computational Social Science], Geary Institute for Public Policy, University College Dublin, Ireland.&lt;br /&gt;
&lt;br /&gt;
* [http://www.rug.nl/research/gcscs/ Groningen Center for Social Complexity Studies (GCSCS)], Groningen, NL.&lt;br /&gt;
&lt;br /&gt;
* [http://www.soms.ethz.ch/ Chair of Sociology, in particular of Modeling and Simulation (SOMS)], Zürich, Switzerland.&lt;br /&gt;
&lt;br /&gt;
* [http://www.eco.unibs.it/gecs/ Research Group on Experimental and Computational Sociology (GECS)], Brescia, IT.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Asia 亚洲===&lt;br /&gt;
&lt;br /&gt;
* [http://bandungfe.net Bandung Fe Institute, Centre for Complexity in Surya University], Bandung, Indonesia.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== See also 参见==&lt;br /&gt;
&lt;br /&gt;
* [[Artificial society]] 人工社会&lt;br /&gt;
&lt;br /&gt;
* [[Simulated reality]] 虚拟现实&lt;br /&gt;
&lt;br /&gt;
* [[Social simulation]] 社会仿真&lt;br /&gt;
&lt;br /&gt;
* [[Agent-based social simulation]] 基于主体的社会仿真&lt;br /&gt;
&lt;br /&gt;
* [[Social complexity]] 社会复杂性&lt;br /&gt;
&lt;br /&gt;
* [[Computational economics]] 计算经济学&lt;br /&gt;
&lt;br /&gt;
* [[Computational epidemiology]] 计算流行病学&lt;br /&gt;
&lt;br /&gt;
* [[Cliodynamics]] 历史动力学&lt;br /&gt;
&lt;br /&gt;
* [[Predictive analytics]] 预测分析&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&lt;br /&gt;
{{reflist|35em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==External links 外部链接==&lt;br /&gt;
&lt;br /&gt;
*[http://cress.soc.surrey.ac.uk/s4ss/ On-line book &amp;quot;Simulation for the Social Scientist&amp;quot; by Nigel Gilbert and Klaus G. Troitzsch, 1999, second edition 2005 社会科学家的仿真建模 电子书 作者：Nigel Gilbert and Klaus G. Troitzsch 第二版（2005年版）]&lt;br /&gt;
&lt;br /&gt;
*[http://jasss.soc.surrey.ac.uk/JASSS.html Journal of Artificial Societies and Social Simulation 人工社会和社会建模仿真期刊]&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20110516072744/http://cmol.nbi.dk/models/ Agent based models for social networks, interactive java applets 基于主体的社会网络模型，交互式 java 小程序]&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20090827052722/http://www.personal.kent.edu/~bcastel3/ Sociology and Complexity Science Website 社会学与复杂性科学网站]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:Subfields of sociology]]&lt;br /&gt;
&lt;br /&gt;
Category:Subfields of sociology&lt;br /&gt;
&lt;br /&gt;
范畴: 社会学的子领域&lt;br /&gt;
&lt;br /&gt;
[[Category:Complex systems theory]]&lt;br /&gt;
&lt;br /&gt;
Category:Complex systems theory&lt;br /&gt;
&lt;br /&gt;
范畴: 复杂系统理论&lt;br /&gt;
&lt;br /&gt;
[[Category:Methods in sociology]]&lt;br /&gt;
&lt;br /&gt;
Category:Methods in sociology&lt;br /&gt;
&lt;br /&gt;
范畴: 社会学方法&lt;br /&gt;
&lt;br /&gt;
[[Category:Computational fields of study]]&lt;br /&gt;
&lt;br /&gt;
Category:Computational fields of study&lt;br /&gt;
&lt;br /&gt;
类别: 研究的计算领域&lt;br /&gt;
&lt;br /&gt;
&amp;lt;noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;small&amp;gt;This page was moved from [[wikipedia:en:Computational sociology]]. Its edit history can be viewed at [[社会计算/edithistory]]&amp;lt;/small&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:待整理页面]]&lt;br /&gt;
&lt;br /&gt;
== 编者推荐 ==&lt;br /&gt;
=== 书籍推荐 ===&lt;br /&gt;
====[https://e.jd.com/30159646.html 社会计算的基本方法与应用]====&lt;br /&gt;
这是中科院自动化所的王飞跃老师关于社会计算的专著，从利用计算技术解决社会问题的角度介绍社会计算。阅读难度可能较高。&lt;br /&gt;
&lt;br /&gt;
=== 集智推荐 ===&lt;br /&gt;
====[https://campus.swarma.org/course/1028 2019 International Conference of Social Computing]====&lt;br /&gt;
本课程是2019年8月26日、27日的2019 International Conference of Social Computing记录。教师团队由芝加哥大学社会学系James Evans教授，Science University of Gottingen傅晓明教授，清华大学罗家德教授，电子科技大学周涛教授等多位老师组成。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://campus.swarma.org/course/1016 复杂系统与社会计算研讨会]====&lt;br /&gt;
本课程是，2019年10月27日北京计算科学研究中心主办的复杂系统与社会计算研讨会活动记录。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://pattern.swarma.org/path?id=12 计算社会科学入门路径]====&lt;br /&gt;
计算社会科学诞生至今，已有将近10年。在自然科学领域已经广泛应用大数据、分布式计算等方式提高研究质量的今天，社会科学领域涉及到的核心数据仍然被少数机构所拥有并创造着巨大的价值。本文将从计算社会科学的发展历史，常用方法，以及前沿问题来给大家粗略地展示计算社会科学的脉络。&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E7%A4%BE%E4%BC%9A%E8%AE%A1%E7%AE%97&amp;diff=11183</id>
		<title>社会计算</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E7%A4%BE%E4%BC%9A%E8%AE%A1%E7%AE%97&amp;diff=11183"/>
		<updated>2020-07-26T10:17:12Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：/* Cellular automata and agent-based modeling 元胞自动机和基于主体建模 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;#重定向 [[社会计算]]&lt;br /&gt;
此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。&lt;br /&gt;
{{sociology}}&amp;lt;onlyinclude&amp;gt;&amp;lt;!-- &lt;br /&gt;
&lt;br /&gt;
&amp;lt;onlyinclude&amp;gt;&amp;lt;!-- &lt;br /&gt;
&lt;br /&gt;
只包括! -- &lt;br /&gt;
&lt;br /&gt;
While editing this lead/intro, please keep your text BELOW this line - this will make it easier to automatically insert the lede into other articles --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
  While editing this lead/intro, please keep your text BELOW this line - this will make it easier to automatically insert the lede into other articles --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
当编辑这个导语 / 介绍，请保持你的文本下面这行-这将使它更容易自动插入到其他文章的莱德-&lt;br /&gt;
&lt;br /&gt;
'''Computational sociology''' is a branch of [[sociology]] that uses computationally intensive methods to analyze and model social phenomena. Using [[computer simulation]]s, [[artificial intelligence]], complex statistical methods, and analytic approaches like [[social network analysis]], computational sociology develops and tests theories of complex social processes through bottom-up modeling of social interactions.&amp;lt;ref name=&amp;quot;MW&amp;quot;&amp;gt;{{cite journal|doi=10.1146/annurev.soc.28.110601.141117|title=From Factors to Actors: Computational Sociology and Agent-Based Modeling |first1=Michael W. |last1=Macy |first2=Robert |last2=Willer |journal=Annual Review of Sociology |volume=28 |pages=143–166 |jstor=3069238|year=2002}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Computational sociology is a branch of sociology that uses computationally intensive methods to analyze and model social phenomena. Using computer simulations, artificial intelligence, complex statistical methods, and analytic approaches like social network analysis, computational sociology develops and tests theories of complex social processes through bottom-up modeling of social interactions.&lt;br /&gt;
&lt;br /&gt;
'''计算社会学 Computational Sociology''' 是社会学的一个分支，它使用计算密集型方法来分析和模拟社会现象。&amp;lt;font color='red'&amp;gt;计算社会学通过使用计算机模拟、人工智能、复杂统计方法以及社会网络分析等分析方法自下而上地建立社会互动模型，是建立并检验复杂社会过程的理论。&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;  借助计算机模拟、人工智能、复杂统计方法以及社会网络分析等分析方法，计算社会学通过自下而上地建立社会互动模型来发展和检验关于复杂社会过程的理论。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
It involves the understanding of social agents, the interaction among these agents, and the effect of these interactions on the social aggregate.&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;&amp;gt;{{cite book|last1=Gilbert |first1=Nigel |last2=Troitzsch |first2=Klaus |year=2005 |title=Simulation for Social Scientists |edition=2 |chapter=Simulation and social science |publisher=Open University Press |chapter-url=http://cress.soc.surrey.ac.uk/s4ss/}}&amp;lt;/ref&amp;gt; Although the subject matter and methodologies in [[social science]] differ from those in [[natural science]] or [[computer science]], several of the approaches used in contemporary [[social simulation]] originated from fields such as [[physics]] and [[artificial intelligence]].&amp;lt;ref name=&amp;quot;Artificial Societies&amp;quot;&amp;gt;{{cite book|last1=Epstein |first1=Joshua M. |last2=Axtell |first2=Robert |year=1996 |title=Growing Artificial Societies: Social Science from the Bottom Up |location=Washington DC |publisher=Brookings Institution Press|url=https://archive.org/details/growingartificia00epst|url-access=registration |isbn=978-0262050531 }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;Cooperation&amp;quot;&amp;gt;{{cite book|last1=Axelrod |first1=Robert |year=1997 |title=The Complexity of Cooperation: Agent-Based Models of Competition and Collaboration |location=Princeton, NJ |publisher=Princeton University Press}}&amp;lt;/ref&amp;gt; Some of the approaches that originated in this field have been imported into the natural sciences, such as measures of [[centrality|network centrality]] from the fields of [[social network analysis]] and [[network science]].&lt;br /&gt;
&lt;br /&gt;
It involves the understanding of social agents, the interaction among these agents, and the effect of these interactions on the social aggregate. Although the subject matter and methodologies in social science differ from those in natural science or computer science, several of the approaches used in contemporary social simulation originated from fields such as physics and artificial intelligence. Some of the approaches that originated in this field have been imported into the natural sciences, such as measures of network centrality from the fields of social network analysis and network science.&lt;br /&gt;
&lt;br /&gt;
它涉及理解社会行为主体和它们的相互作用，以及这些相互作用如何影响社会总体(--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） social aggregate--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|讨论]]） 我觉得这样翻译是ok的)。虽然社会科学的主题和方法不同于自然科学或计算机科学，但当代社会仿真模拟中使用的一些方法起源于物理学和人工智能等领域。这一领域的一些方法，如来自社会网络分析和网络科学领域的网络中心性度量方法等，早已被引入到自然科学中。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In relevant literature, computational sociology is often related to the study of [[social complexity]].&amp;lt;ref&amp;gt;{{cite journal|last=Casti |first=J |year=1999 |title=The Computer as Laboratory: Toward a Theory of Complex Adaptive Systems |journal=Complexity |volume=4 |issue=5 |pages=12–14 |doi=10.1002/(SICI)1099-0526(199905/06)4:5&amp;lt;12::AID-CPLX3&amp;gt;3.0.CO;2-4}}&amp;lt;/ref&amp;gt; Social complexity concepts such as [[complex systems]], [[non-linear]] interconnection among macro and micro process, and [[emergence]], have entered the vocabulary of computational sociology.&amp;lt;ref&amp;gt;{{cite journal|last=Goldspink |first=C |year=2002 |title=Methodological Implications of Complex Systems Approaches to Sociality: Simulation as a Foundation for Knowledge |url=http://jasss.soc.surrey.ac.uk/5/1/3.html |publisher=Journal of Artificial Societies and Social Simulation |volume=5 |issue=1}}&amp;lt;/ref&amp;gt; A practical and well-known example is the construction of a computational model in the form of an &amp;quot;[[artificial society]]&amp;quot;, by which researchers can analyze the structure of a [[Social structure|social system]].&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;Generative&amp;quot;&amp;gt;{{cite book|last=Epstein |first=Joshua |year=2007 |title=Generative Social Science: Studies in Agent-Based Computational Modeling |location=Princeton, NJ |publisher=Princeton University Press|url=https://www.researchgate.net/publication/283615593}}&lt;br /&gt;
&lt;br /&gt;
In relevant literature, computational sociology is often related to the study of social complexity. Social complexity concepts such as complex systems, non-linear interconnection among macro and micro process, and emergence, have entered the vocabulary of computational sociology. A practical and well-known example is the construction of a computational model in the form of an &amp;quot;artificial society&amp;quot;, by which researchers can analyze the structure of a social system.&lt;br /&gt;
&lt;br /&gt;
在相关文献中，计算社会学经常与社会复杂性的研究有关。复杂系统、宏观和微观过程之间的非线性关联、涌现等社会复杂性概念已经进入计算社会学的词汇。一个实际而著名的例子是建立“'''人工社会 Artificial Society'''”的计算模型，通过它研究人员可以分析一个社会系统的结构。 &lt;br /&gt;
&lt;br /&gt;
While editing this lead/intro, please keep your text ABOVE this line - this will make it easier to automatically insert the lede into other articles - thanks!  &lt;br /&gt;
&lt;br /&gt;
While editing this lead/intro, please keep your text ABOVE this line - this will make it easier to automatically insert the lede into other articles - thanks!  &lt;br /&gt;
&lt;br /&gt;
当编辑这个引导 / 介绍，请保持你的文本以上这一行-这将使它更容易自动插入到其他文章的莱德-谢谢！&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;&amp;lt;/onlyinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;&amp;lt;/onlyinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
-- / 只包括&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==History 历史==&lt;br /&gt;
&lt;br /&gt;
{{see also|Sociology and complexity science}}&lt;br /&gt;
&lt;br /&gt;
[[File:Complexity-map-with-sociolo.png|thumb|right|300px|Historical map of research paradigms and associated scientists in [[sociology and complexity science]].]]&lt;br /&gt;
&lt;br /&gt;
Historical map of research paradigms and associated scientists in [[sociology and complexity science.]]&lt;br /&gt;
&lt;br /&gt;
【图1：Historical map of research paradigms and associated scientists in [[sociology and complexity science＋社会学和复杂性中的研究范式和科学家的历史地图】&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Background 背景===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In the past four decades, computational sociology has been introduced and gaining popularity {{According to whom|date=June 2017}}.  This has been used primarily for modeling or building explanations of social processes and are depending on the emergence of complex behavior from simple activities.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;&amp;gt;Salgado, Mauricio, and Nigel Gilbert. &amp;quot;[http://epubs.surrey.ac.uk/749319/1/Emergence%20and%20Communication%20-%20V3%201.pdf Emergence and communication in computational sociology].&amp;quot; Journal for the Theory of Social Behaviour 43.1 (2013): 87-110.&amp;lt;/ref&amp;gt;  The idea behind emergence is that properties of any bigger system do not always have to be properties of the components that the system is made of.&amp;lt;ref&amp;gt;Macy, Michael W., and Robert Willer. &amp;quot;[http://sct.uab.cat/lsds/sites/sct.uab.cat.lsds/files/FROM%20FACTORS%20TO%20ACTORS%20(Macy%20and%20Willer%202002).pdf From factors to actors: computational sociology and agent-based modeling].&amp;quot; Annual review of sociology 28.1 (2002): 143-166.&amp;lt;/ref&amp;gt;  The people responsible for the introduction of the idea of emergence are Alexander, Morgan, and Broad, who were classical emergentists.  The time at which these emergentists came up with this concept and method was during the time of the early twentieth century.  The aim of this method was to find a good enough accommodation between two different and extreme ontologies, which were reductionist materialism and dualism.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;/&amp;gt; &lt;br /&gt;
&lt;br /&gt;
In the past four decades, computational sociology has been introduced and gaining popularity.  This has been used primarily for modeling or building explanations of social processes and are depending on the emergence of complex behavior from simple activities.  The idea behind emergence is that properties of any bigger system do not always have to be properties of the components that the system is made of.  The people responsible for the introduction of the idea of emergence are Alexander, Morgan, and Broad, who were classical emergentists.  The time at which these emergentists came up with this concept and method was during the time of the early twentieth century.  The aim of this method was to find a good enough accommodation between two different and extreme ontologies, which were reductionist materialism and dualism. &lt;br /&gt;
&lt;br /&gt;
在过去的四十年里，计算社会学诞生并且越来越受欢迎。这主要用于建模或构建社会过程的解释，并且依赖于从简单活动中'''涌现 Emergence'''的复杂行为。涌现背后的思想是，任何较大系统不总是必须和组成系统的部分具有一样的性质。引入涌现思想的人是亚历山大 Alexander、摩根 Morgan和布罗德 Broad，他们都是'''经典涌现主义者 Classical Emergentists'''。经典涌现主义者提出这个概念和方法的时间是在二十世纪初期。这种方法的目的是在还原论的唯物主义和二元论这两种不同的本体论之间找到一个足够好的调和。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
While emergence has had a valuable and important role with the foundation of Computational Sociology, there are those who do not necessarily agree.  One major leader in the field, Epstein, doubted the use because there were aspects that are unexplainable.  Epstein put up a claim against emergentism, in which he says it &amp;quot;is precisely the generative sufficiency of the parts that constitutes the whole's explanation&amp;quot;.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
While emergence has had a valuable and important role with the foundation of Computational Sociology, there are those who do not necessarily agree.  One major leader in the field, Epstein, doubted the use because there were aspects that are unexplainable.  Epstein put up a claim against emergentism, in which he says it &amp;quot;is precisely the generative sufficiency of the parts that constitutes the whole's explanation&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
虽然涌现在计算社会学的建立上发挥了宝贵而重要的作用，但也有人不太同意。该领域的一个主要人物爱泼斯坦 Epstein对这种&amp;lt;font color='red'&amp;gt;用法&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;概念&amp;lt;/font&amp;gt;持怀疑态度，因为有些方面是这个&amp;lt;font color='red'&amp;gt;用法&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;概念&amp;lt;/font&amp;gt;无法解释的。爱泼斯坦提出了一种反对“涌现主义”的观点，他表示:“&amp;lt;font color=='red'&amp;gt;正是这些部分的有生成意义的充分性构成了对整体的解释&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;  正是这些部分所产生的充分性构成了对整体的解释&amp;lt;/font&amp;gt;”。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Agent-based models have had a historical influence on Computational Sociology.   These models first came around in the 1960s, and were used to simulate control and feedback processes in organizations, cities, etc.  During the 1970s, the application introduced the use of individuals as the main units for the analyses and used bottom-up strategies for modeling behaviors.  The last wave occurred in the 1980s.  At this time, the models were still bottom-up; the only difference is that the agents interact interdependently.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Agent-based models have had a historical influence on Computational Sociology. These models first came around in the 1960s, and were used to simulate control and feedback processes in organizations, cities, etc.  During the 1970s, the application introduced the use of individuals as the main units for the analyses and used bottom-up strategies for modeling behaviors.  The last wave occurred in the 1980s.  At this time, the models were still bottom-up; the only difference is that the agents interact interdependently.&lt;br /&gt;
&lt;br /&gt;
'''基于主体的模型 Agent-based Models'''对计算社会学有着历史性的影响。这些模型最早出现在20世纪60年代，用于仿真模拟组织、城市等系统的控制和反馈过程。在20世纪70年代，&amp;lt;font color='red'&amp;gt;应用程序&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; ABM模型&amp;lt;/font&amp;gt;引入个体作为主要的分析单元，并使用自下而上的策略来对行为建模。最后一波浪潮发生在20世纪80年代。那时，模型仍然是自下而上的; 唯一的区别是主体之间具有互相依赖和相互作用。&lt;br /&gt;
&lt;br /&gt;
===Systems theory and structural functionalism 系统理论和结构功能主义===&lt;br /&gt;
&lt;br /&gt;
{{main|Systems theory|Structural functionalism}}&lt;br /&gt;
&lt;br /&gt;
In the post-war era, [[Vannevar Bush]]'s [[differential analyser]], [[John von Neumann]]'s [[Von Neumann cellular automata|cellular automata]], [[Norbert Wiener]]'s [[cybernetics]], and [[Claude Shannon]]'s [[information theory]] became influential paradigms for modeling and understanding complexity in technical systems. In response, scientists in disciplines such as physics, biology, electronics, and economics began to articulate a [[systems theory|general theory of systems]] in which all natural and physical phenomena are manifestations of interrelated elements in a system that has common patterns and properties. Following [[Émile Durkheim]]'s call to analyze complex modern society ''[[sui generis]]'',&amp;lt;ref&amp;gt;{{cite book|first=Émile |last=Durkheim |title=The Division of Labor in Society |location=New York, NY |publisher=Macmillan}}&amp;lt;/ref&amp;gt; post-war structural functionalist sociologists such as [[Talcott Parsons]] seized upon these theories of systematic and hierarchical interaction among constituent components to attempt to generate grand unified sociological theories, such as the [[AGIL paradigm]].&amp;lt;ref name=&amp;quot;Bailey&amp;quot;&amp;gt;{{cite book|first1=Kenneth D. |last1=Bailey |editor=Jonathan H. Turner |chapter=Systems Theory |title=Handbook of Sociological Theory |publisher=Springer Science |year=2006 |location=New York, NY |isbn=978-0-387-32458-6 |pages=379–404}}&amp;lt;/ref&amp;gt; Sociologists such as [[George Homans]] argued that sociological theories should be formalized into hierarchical structures of propositions and precise terminology from which other propositions and hypotheses could be derived and operationalized into empirical studies.&amp;lt;ref name=&amp;quot;Blackwell&amp;quot;&amp;gt;{{cite encyclopedia|year=2007 |title=Computational Sociology |last=Bainbridge |first=William Sims |encyclopedia=Blackwell Encyclopedia of Sociology |publisher=Blackwell Reference Online |url=http://www.sociologyencyclopedia.com/subscriber/tocnode?id=g9781405124331_chunk_g97814051243319_ss1-85 |doi=10.1111/b.9781405124331.2007.x |hdl=10138/224218 |editor=Ritzer, George|isbn=978-1-4051-2433-1|hdl-access=free }}&amp;lt;/ref&amp;gt; Because computer algorithms and programs had been used as early as 1956 to test and validate mathematical theorems, such as the [[four color theorem]],&amp;lt;ref&amp;gt;{{cite book|last=Crevier |first=D. |year=1993 |title=AI: The Tumultuous History of the Search for Artificial Intelligence |url=https://archive.org/details/aitumultuoushist00crev |url-access=registration |publisher=Basic Books |location=New York, NY}}&amp;lt;/ref&amp;gt; some scholars anticipated that similar computational approaches could &amp;quot;solve&amp;quot; and &amp;quot;prove&amp;quot; analogously formalized problems and theorems of social structures and dynamics.&lt;br /&gt;
&lt;br /&gt;
In the post-war era, Vannevar Bush's differential analyser, John von Neumann's cellular automata, Norbert Wiener's cybernetics, and Claude Shannon's information theory became influential paradigms for modeling and understanding complexity in technical systems. In response, scientists in disciplines such as physics, biology, electronics, and economics began to articulate a general theory of systems in which all natural and physical phenomena are manifestations of interrelated elements in a system that has common patterns and properties. Following Émile Durkheim's call to analyze complex modern society sui generis, post-war structural functionalist sociologists such as Talcott Parsons seized upon these theories of systematic and hierarchical interaction among constituent components to attempt to generate grand unified sociological theories, such as the AGIL paradigm. Sociologists such as George Homans argued that sociological theories should be formalized into hierarchical structures of propositions and precise terminology from which other propositions and hypotheses could be derived and operationalized into empirical studies. Because computer algorithms and programs had been used as early as 1956 to test and validate mathematical theorems, such as the four color theorem, some scholars anticipated that similar computational approaches could &amp;quot;solve&amp;quot; and &amp;quot;prove&amp;quot; analogously formalized problems and theorems of social structures and dynamics.&lt;br /&gt;
&lt;br /&gt;
战后时期，范内瓦·布什（Vannevar Bush）的'''微分分析机 Differential Analyser''' 、冯·诺伊曼（John von Neumann）的'''元胞自动机 Cellular Automata'''、 维纳（Norbert Wiener）的'''控制论 Cybernetics'''和克劳德·香农（Claude Shannon）的'''信息论 Information Theory'''成为技术系统中建模和理解复杂性的重要范式。物理学、生物学、电子学和经济学等学科的科学家开始阐述系统的一般理论，即所有自然和物理现象都是具有共同模式和属性的系统中相互关联的元素的表现。&amp;lt;font color='red'&amp;gt;按照 &amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 沿着&amp;lt;/font&amp;gt;涂尔干（Émile Durkheim）分析特定的复杂现代社会&lt;br /&gt;
&lt;br /&gt;
（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]）Following Émile Durkheim's call to analyze complex modern society sui generis）&lt;br /&gt;
  --~~克劳德·香农（Claude Shannon）  这些同样去括号&lt;br /&gt;
&lt;br /&gt;
的&amp;lt;font color='red'&amp;gt;要求&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 思路&amp;lt;/font&amp;gt;，战后结构功能主义社会学家如帕森斯（Talcott Parsons）利用这些组成部分之间系统&amp;lt;font color='blue'&amp;gt;化&amp;lt;/font&amp;gt;和&amp;lt;font color='red'&amp;gt;等级&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 层次化&amp;lt;/font&amp;gt;相互作用的理论，试图产生大统一的社会学理论，如 AGIL 范式。霍曼斯（George Homans）等社会学家认为，社会学理论应该被构建为具有&amp;lt;font color='blue'&amp;gt;逻辑&amp;lt;/font&amp;gt;命题和精确术语的&amp;lt;font color='red'&amp;gt;等级&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 层次化&amp;lt;/font&amp;gt;结构，并且从中可以得出能够在实证研究中被操作化的其他命题和假设。由于早在1956年计算机算法和程序就已经被用来测试和验证数学定理（如'''四色定理Four Color Theorem'''），&amp;lt;font color='red'&amp;gt;一些学者预计相似的计算方法可以“解决”和“证明”类似的社会结构和动态的问题和定理。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 一些学者预计相似的计算方法可以“解释”和“证明”关于社会结构和演变的类似形式化的问题和定理。&amp;lt;/font&amp;gt;&lt;br /&gt;
--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|讨论]]formalized应该也要翻译出来，computational证明的是形式化定理)&lt;br /&gt;
&lt;br /&gt;
===Macrosimulation and microsimulation 宏观模拟和微观模拟===&lt;br /&gt;
&lt;br /&gt;
{{main|System dynamics|Microsimulation}}&lt;br /&gt;
&lt;br /&gt;
By the late 1960s and early 1970s, social scientists used increasingly available computing technology to perform macro-simulations of control and feedback processes in organizations, industries, cities, and global populations. These models used differential equations to predict population distributions as holistic functions of other systematic factors such as inventory control, urban traffic, migration, and disease transmission.&amp;lt;ref&amp;gt;{{cite book|first=Jay |last=Forrester |year=1971 |title=World Dynamics |location=Cambridge, MA |publisher=MIT Press}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|doi=10.1287/opre.26.2.237|title=Using Simulation to Develop and Validate Analytic Models: Some Case Studies |first1=Edward J. |last1=Ignall |first2=Peter |last2=Kolesar |first3=Warren E. |last3=Walker |journal=Operations Research |volume=26 |issue=2 |year=1978 |pages=237–253}}&amp;lt;/ref&amp;gt; Although simulations of social systems received substantial attention in the mid-1970s after the [[Club of Rome]] published reports predicting that policies promoting exponential economic growth would eventually bring global environmental catastrophe,&amp;lt;ref&amp;gt;{{cite book|title=The Dynamics of Growth in a Finite World |last1=Meadows |first1=DL |last2=Behrens |first2=WW |last3=Meadows |first3=DH |last4=Naill |first4=RF |last5= Randers |first5=J |last6=Zahn |first6=EK |year=1974 |location=Cambridge, MA |publisher=MIT Press}}&amp;lt;/ref&amp;gt; the inconvenient conclusions led many authors to seek to discredit the models, attempting to make the researchers themselves appear unscientific.&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;/&amp;gt;&amp;lt;ref&amp;gt;{{cite news|title=Computer View of Disaster Is Rebutted |newspaper=The New York Times |date=October 18, 1974|url=https://www.nytimes.com/1974/10/18/archives/computer-view-of-disaster-is-rebutted.html?_r=0}}&amp;lt;/ref&amp;gt; Hoping to avoid the same fate, many social scientists turned their attention toward micro-simulation models to make forecasts and study policy effects by modeling aggregate changes in state of individual-level entities rather than the changes in distribution at the population level.&amp;lt;ref&amp;gt;{{cite journal|doi=10.1016/0167-2681(90)90038-F|title=From engineering to microsimulation : An autobiographical reflection |journal=Journal of Economic Behavior &amp;amp; Organization |year=1990 |volume=14 |issue=1 |pages=5–27 |first=Guy H. |last=Orcutt}}&amp;lt;/ref&amp;gt; However, these micro-simulation models did not permit individuals to interact or adapt and were not intended for basic theoretical research.&amp;lt;ref name=&amp;quot;MW&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
By the late 1960s and early 1970s, social scientists used increasingly available computing technology to perform macro-simulations of control and feedback processes in organizations, industries, cities, and global populations. These models used differential equations to predict population distributions as holistic functions of other systematic factors such as inventory control, urban traffic, migration, and disease transmission. Although simulations of social systems received substantial attention in the mid-1970s after the Club of Rome published reports predicting that policies promoting exponential economic growth would eventually bring global environmental catastrophe, the inconvenient conclusions led many authors to seek to discredit the models, attempting to make the researchers themselves appear unscientific. Hoping to avoid the same fate, many social scientists turned their attention toward micro-simulation models to make forecasts and study policy effects by modeling aggregate changes in state of individual-level entities rather than the changes in distribution at the population level. However, these micro-simulation models did not permit individuals to interact or adapt and were not intended for basic theoretical research.&lt;br /&gt;
&lt;br /&gt;
截至20世纪60年代末70年代初，社会科学家越来越多地使用已有的计算技术，&amp;lt;s&amp;gt;在&amp;lt;/s&amp;gt;&amp;lt;font color='blue'&amp;gt;对&amp;lt;/font&amp;gt;组织、工业、城市和全球人口&amp;lt;s&amp;gt;中&amp;lt;/s&amp;gt;进行&amp;lt;font color='blue'&amp;gt;包含&amp;lt;/font&amp;gt;控制和反馈过程的'''宏观模拟 Macrosimulation''' 。这些模型使用微分方程作为其他系统因素的整体函数来预测人口分布，这些系统因素包括&amp;lt;font color='red'&amp;gt;库存&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 财产&amp;lt;/font&amp;gt;控制、城市交通、人口迁移和疾病传播等。&amp;lt;font color='red'&amp;gt;20世纪70年代中期，'''罗马俱乐部 Club of Rome''' 发表报告预测，促进指数式经济增长的政策最终将导致全球环境灾难，这个悲观的结论导致许多研究者试图反驳这些模型，并试图让研究显得不那么科学。&amp;lt;/font&amp;gt;&lt;br /&gt;
  （--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） 根据意思，inconvenient译为悲观的，因为这个结论预示了悲观的未来，所以令指出这一点的科学家们感到inconvenient）&lt;br /&gt;
  （--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟树|讨论]]） inconvenient的翻译没问题，不过好像缺失了Although simulations of social systems received substantial attention）&lt;br /&gt;
&amp;lt;font color='blue'&amp;gt; 20世纪70年代中期，尽管对社会系统的仿真获得了巨大的关注，但在'''罗马俱乐部 Club of Rome''' 发布预测报告称促进指数式经济增长的政策最终将导致全球环境灾难，这个悲观的结论导致许多研究者尝试抹黑这些(仿真)模型，并试图让(这些模型的)研究者自身显得不那么科学。&amp;lt;/font&amp;gt;&lt;br /&gt;
为了避免同样的情况，许多社会科学家将注意力转向'''微观模拟 Microsimulation'''模型。这些模型通过模拟个体状态的总体变化而不是总体人口级别的&amp;lt;font color='blue'&amp;gt;分布&amp;lt;/font&amp;gt;变化来进行预测和研究政策的效果。然而，这些微观模拟模型并不允许个体相互作用或适应、变化（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]）变化是根据适应（adapt）加上去的，不知道是否合理--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|讨论]]）我觉得ok），研究者也不打算将它们用于基础理论研究。&lt;br /&gt;
&lt;br /&gt;
===Cellular automata and agent-based modeling 元胞自动机和基于主体建模===&lt;br /&gt;
&lt;br /&gt;
{{main|Cellular automata|agent-based modeling}}&lt;br /&gt;
&lt;br /&gt;
The 1970s and 1980s were also a time when physicists and mathematicians were attempting to model and analyze how simple component units, such as atoms, give rise to global properties, such as complex material properties at low temperatures, in magnetic materials, and within turbulent flows.&amp;lt;ref&amp;gt;{{cite book|title=Cellular automata machines: a new environment for modeling |url=https://archive.org/details/cellularautomata00toff |url-access=registration |first1=Tommaso |last1=Toffoli |first2=Norman |last2=Margolus | author2-link = Norman Margolus |year=1987 |publisher=MIT Press |location=Cambridge, MA}}&amp;lt;/ref&amp;gt; Using cellular automata, scientists were able to specify systems consisting of a grid of cells in which each cell only occupied some finite states and changes between states were solely governed by the states of immediate neighbors. Along with advances in [[artificial intelligence]] and [[microcomputer]] power, these methods contributed to the development of &amp;quot;[[chaos theory]]&amp;quot; and &amp;quot;[[complex systems|complexity theory]]&amp;quot; which, in turn, renewed interest in understanding complex physical and social systems across disciplinary boundaries.&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;/&amp;gt; Research organizations explicitly dedicated to the interdisciplinary study of complexity were also founded in this era: the [[Santa Fe Institute]] was established in 1984 by scientists based at [[Los Alamos National Laboratory]] and the BACH group at the [[University of Michigan]] likewise started in the mid-1980s.&lt;br /&gt;
&lt;br /&gt;
The 1970s and 1980s were also a time when physicists and mathematicians were attempting to model and analyze how simple component units, such as atoms, give rise to global properties, such as complex material properties at low temperatures, in magnetic materials, and within turbulent flows. Using cellular automata, scientists were able to specify systems consisting of a grid of cells in which each cell only occupied some finite states and changes between states were solely governed by the states of immediate neighbors. Along with advances in artificial intelligence and microcomputer power, these methods contributed to the development of &amp;quot;chaos theory&amp;quot; and &amp;quot;complexity theory&amp;quot; which, in turn, renewed interest in understanding complex physical and social systems across disciplinary boundaries. Research organizations explicitly dedicated to the interdisciplinary study of complexity were also founded in this era: the Santa Fe Institute was established in 1984 by scientists based at Los Alamos National Laboratory and the BACH group at the University of Michigan likewise started in the mid-1980s.&lt;br /&gt;
&lt;br /&gt;
20世纪70年代和80年代，物理学家和数学家也在试图模拟和分析简单的组成单位如何产生整体特性，比如低温环境中原子在磁性材料和湍流中&amp;lt;font color='blue'&amp;gt;(表现出的)&amp;lt;/font&amp;gt;的复杂材料特性。使用'''元胞自动机 Cellular Automata'''，科学家们能够指定由元胞网格组成的系统，其中每个元胞只占据一些有限的状态，状态之间的变化完全由相邻元胞的状态控制。随着人工智能和微型计算机能力的进步，这些方法促进了“混沌理论”和“复杂性理论”的发展，这反过来又重新引起了人们对跨学科的复杂物理和社会系统的兴趣。明确致力于跨学科复杂性研究的机构也是在这个时代成立的: 圣菲研究所是由美国洛斯阿拉莫斯国家实验室（Los Alamos National Laboratory）的科学家于1984年建立的，密歇根大学的 BACH 小组也是在20世纪80年代中期建立的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This cellular automata paradigm gave rise to a third wave of social simulation emphasizing agent-based modeling. Like micro-simulations, these models emphasized bottom-up designs but adopted four key assumptions that diverged from microsimulation: autonomy, interdependency, simple rules, and adaptive behavior.&amp;lt;ref name=&amp;quot;MW&amp;quot;/&amp;gt; Agent-based models are less concerned with predictive accuracy and instead emphasize theoretical development.&amp;lt;ref&amp;gt;{{cite journal |title=A simulation of the structure of academic science |journal=Sociological Research Online |volume=2 |issue=2 |pages=1–15 |year=1997 |first=Nigel |last=Gilbert |url=http://www.socresonline.org.uk/socresonline/2/2/3.html |doi=10.5153/sro.85 |access-date=2009-12-16 |archive-url=https://web.archive.org/web/19980524062306/http://www.socresonline.org.uk/socresonline/2/2/3.html |archive-date=1998-05-24 |url-status=dead }}&amp;lt;/ref&amp;gt; In 1981, mathematician and political scientist [[Robert Axelrod]] and evolutionary biologist [[W.D. Hamilton]] published a major paper in ''[[Science (journal)|Science]]'' titled &amp;quot;The Evolution of Cooperation&amp;quot; which used an agent-based modeling approach to demonstrate how social cooperation based upon reciprocity can be established and stabilized in a [[prisoner's dilemma]] game when agents followed simple rules of self-interest.&amp;lt;ref&amp;gt;{{cite journal|title=The Evolution of Cooperation |first1=Robert |last1=Axelrod |first2=William D. |last2=Hamilton |journal=Science |volume=211 |issue=4489 |pages=1390–1396 |doi=10.1126/science.7466396|pmid=7466396 |date=March 27, 1981|bibcode=1981Sci...211.1390A }}&amp;lt;/ref&amp;gt; Axelrod and Hamilton demonstrated that individual agents following a simple rule set of (1) cooperate on the first turn and (2) thereafter replicate the partner's previous action were able to develop &amp;quot;norms&amp;quot; of cooperation and sanctioning in the absence of canonical sociological constructs such as demographics, values, religion, and culture as preconditions or mediators of cooperation.&amp;lt;ref name=&amp;quot;Cooperation&amp;quot;/&amp;gt; Throughout the 1990s, scholars like [[William Sims Bainbridge]], [[Kathleen Carley]], [[Michael Macy]],  and [[John Skvoretz]] developed multi-agent-based models of [[generalized reciprocity]], [[prejudice]], [[social influence]], and organizational [[information processing]]. In 1999, [[Nigel Gilbert]] published the first textbook on Social Simulation: ''Simulation for the social scientist'' and established its most relevant journal: the [[Journal of Artificial Societies and Social Simulation]].&lt;br /&gt;
&lt;br /&gt;
This cellular automata paradigm gave rise to a third wave of social simulation emphasizing agent-based modeling. Like micro-simulations, these models emphasized bottom-up designs but adopted four key assumptions that diverged from microsimulation: autonomy, interdependency, simple rules, and adaptive behavior. In 1981, mathematician and political scientist Robert Axelrod and evolutionary biologist W.D. Hamilton published a major paper in Science titled &amp;quot;The Evolution of Cooperation&amp;quot; which used an agent-based modeling approach to demonstrate how social cooperation based upon reciprocity can be established and stabilized in a prisoner's dilemma game when agents followed simple rules of self-interest. Axelrod and Hamilton demonstrated that individual agents following a simple rule set of (1) cooperate on the first turn and (2) thereafter replicate the partner's previous action were able to develop &amp;quot;norms&amp;quot; of cooperation and sanctioning in the absence of canonical sociological constructs such as demographics, values, religion, and culture as preconditions or mediators of cooperation. Throughout the 1990s, scholars like William Sims Bainbridge, Kathleen Carley, Michael Macy,  and John Skvoretz developed multi-agent-based models of generalized reciprocity, prejudice, social influence, and organizational information processing. In 1999, Nigel Gilbert published the first textbook on Social Simulation: Simulation for the social scientist and established its most relevant journal: the Journal of Artificial Societies and Social Simulation.&lt;br /&gt;
&lt;br /&gt;
元胞自动机范式引发了强调'''基于主体建模 Agent-based Modeling'''的第三次社会模拟浪潮。与微观模拟一样，这些模型强调自下而上的设计，但采用了与微观模拟不同的四个关键假设: '''自主性 Autonomy'''、'''相互依赖性 Interdependency'''、'''简单规则 Simple Rules'''和'''适应性行为 Adaptive Behavior'''。1981年，数学家、政治学家阿克塞尔罗德（Robert Axelrod）和进化生物学家汉密尔顿（W.D. Hamilton）在《科学》杂志上发表了一篇名为《合作的进化》（The Evolution of Cooperation）的重要论文，该论文采用基于主体建模方法，论证了在一个囚徒困境中，当主体遵循简单的自利规则（rules of self-interest）时，互惠的社会合作是如何建立和稳定的。阿克塞尔罗德和汉密尔顿证明，主体遵循这样一套简单的规则: (1)在第一轮进行合作，(2)在其后重复伙伴以前的行动，能够在没有人口学差异、价值观、宗教和文化等社会规范作为合作的先决条件或中介的情况下制定合作和制裁的“规范”。整个20世纪90年代，像威廉·希姆斯·本布里奇（William Sims Bainbridge），Kathleen Carley，Michael Macy 和 John Skvoretz 这样的学者开发了&amp;lt;s&amp;gt;基于多主体的&amp;lt;/s&amp;gt;&amp;lt;font color='blue'&amp;gt;关于&amp;lt;/font&amp;gt;广义互惠、偏见、社会影响和组织信息处理模型&amp;lt;font color='blue'&amp;gt;的多主体模型&amp;lt;/font&amp;gt;。1999年，吉尔伯特（Nigel Gilbert）出版了第一本关于社会模拟&amp;lt;font color='blue'&amp;gt;的教科书&amp;lt;/font&amp;gt;: 《写给社会科学家的仿真模拟（Simulation for the social scientist）》&amp;lt;s&amp;gt;的教科书&amp;lt;/s&amp;gt;，并建立了它最相关的杂志: 人工社会和社会模拟杂志（the Journal of Artificial Societies and Social Simulation）。&lt;br /&gt;
&lt;br /&gt;
===Data mining and social network analysis 数据挖掘和社会网络分析===&lt;br /&gt;
&lt;br /&gt;
{{main|Data mining|Social network analysis}}&lt;br /&gt;
&lt;br /&gt;
--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） 少一段原文 &lt;br /&gt;
Independent from developments in computational models of social systems, social network analysis emerged in the 1970s and 1980s from advances in graph theory, statistics, and studies of social structure as a distinct analytical method and was articulated and employed by sociologists like James S. Coleman, Harrison White, Linton Freeman, J. Clyde Mitchell, Mark Granovetter, Ronald Burt, and Barry Wellman.[22] The increasing pervasiveness of computing and telecommunication technologies throughout the 1980s and 1990s demanded analytical techniques, such as network analysis and multilevel modeling, that could scale to increasingly complex and large data sets. The most recent wave of computational sociology, rather than employing simulations, uses network analysis and advanced statistical techniques to analyze large-scale computer databases of electronic proxies for behavioral data. Electronic records such as email and instant message records, hyperlinks on the World Wide Web, mobile phone usage, and discussion on Usenet allow social scientists to directly observe and analyze social behavior at multiple points in time and multiple levels of analysis without the constraints of traditional empirical methods such as interviews, participant observation, or survey instruments.[23] Continued improvements in machine learning algorithms likewise have permitted social scientists and entrepreneurs to use novel techniques to identify latent and meaningful patterns of social interaction and evolution in large electronic datasets.[24][25]&lt;br /&gt;
&lt;br /&gt;
Independent from developments in computational models of social systems, social network analysis emerged in the 1970s and 1980s from advances in graph theory, statistics, and studies of social structure as a distinct analytical method and was articulated and employed by sociologists like [[James Samuel Coleman|James S. Coleman]], [[Harrison White]], [[Linton Freeman]], [[J. Clyde Mitchell]], [[Mark Granovetter]], [[Ronald Burt]], and [[Barry Wellman]].&amp;lt;ref&amp;gt;{{cite book|title=The Development of Social Network Analysis: A Study in the Sociology of Science |first=Linton C. |last=Freeman |publisher=Empirical Press |location=Vancouver, BC |year=2004}}&amp;lt;/ref&amp;gt; The increasing pervasiveness of computing and telecommunication technologies throughout the 1980s and 1990s demanded analytical techniques, such as [[network theory|network analysis]] and [[multilevel modeling]], that could scale to increasingly complex and large data sets. The most recent wave of computational sociology, rather than employing simulations, uses network analysis and advanced statistical techniques to analyze large-scale computer databases of electronic proxies for behavioral data. Electronic records such as email and instant message records, hyperlinks on the [[World Wide Web]], mobile phone usage, and discussion on [[Usenet]] allow social scientists to directly observe and analyze social behavior at multiple points in time and multiple levels of analysis without the constraints of traditional empirical methods such as interviews, participant observation, or survey instruments.&amp;lt;ref&amp;gt;{{cite journal|title=Life in the network: the coming age of computational social science|first9=J|last10=Gutmann|first10=M.|last11=Jebara|first11=T.|last12=King|first12=G.|last13=Macy|first13=M.|last14=Roy|first14=D.|last15=Van Alstyne|first15=M.|last9=Fowler|first8=N|last8=Contractor|first7=N|last7=Christakis|first6=D|last6=Brewer|first5=AL|last5=Barabasi|first4=S |journal=Science|last4=Aral |date=February 6, 2009|first3=L |volume=323|pmid=19197046 |issue=5915|last3=Adamic |pages=721–723|pmc=2745217 |doi=10.1126/science.1167742 |first1=David |last1=Lazer |first2=Alex |last2=Pentland |display-authors=8}}&amp;lt;/ref&amp;gt; Continued improvements in [[machine learning]] algorithms likewise have permitted social scientists and entrepreneurs to use novel techniques to identify latent and meaningful patterns of social interaction and evolution in large electronic datasets.&amp;lt;ref&amp;gt;{{cite journal|first1=Jaideep |last1=Srivastava |first2=Robert |last2=Cooley |first3=Mukund |last3=Deshpande |first4=Pang-Ning |last4=Tan |journal=Proceedings of the ACM Conference on Knowledge Discovery and Data Mining |title=Web usage mining: discovery and applications of usage patterns from Web data|volume=1 |year=2000 |pages=12–23 |doi=10.1145/846183.846188|issue=2}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|doi=10.1016/S0169-7552(98)00110-X|title=The anatomy of a large-scale hypertextual Web search engine |first1=Sergey |last1=Brin |first2=Lawrence |last2=Page |journal=Computer Networks and ISDN Systems |volume=30 |issue=1–7 |pages=107–117 |date=April 1998|citeseerx=10.1.1.115.5930 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Independent from developments in computational models of social systems, social network analysis emerged in the 1970s and 1980s from advances in graph theory, statistics, and studies of social structure as a distinct analytical method and was articulated and employed by sociologists like James S. Coleman, Harrison White, Linton Freeman, J. Clyde Mitchell, Mark Granovetter, Ronald Burt, and Barry Wellman. The increasing pervasiveness of computing and telecommunication technologies throughout the 1980s and 1990s demanded analytical techniques, such as network analysis and multilevel modeling, that could scale to increasingly complex and large data sets. The most recent wave of computational sociology, rather than employing simulations, uses network analysis and advanced statistical techniques to analyze large-scale computer databases of electronic proxies for behavioral data. Electronic records such as email and instant message records, hyperlinks on the World Wide Web, mobile phone usage, and discussion on Usenet allow social scientists to directly observe and analyze social behavior at multiple points in time and multiple levels of analysis without the constraints of traditional empirical methods such as interviews, participant observation, or survey instruments. Continued improvements in machine learning algorithms likewise have permitted social scientists and entrepreneurs to use novel techniques to identify latent and meaningful patterns of social interaction and evolution in large electronic datasets.&lt;br /&gt;
&lt;br /&gt;
'''社会网络分析 Social Network Analysis'''独立于社会系统计算模型的发展，在20世纪70年代和80年代出现于图论、统计学和社会结构的研究中，它作为一种独特的分析方法被社会学家如 James s. Coleman，Harrison White，Linton Freeman，J. Clyde Mitchell，Mark Granovetter，Ronald Burt 和 Barry Wellman 等阐述和采用。在整个1980年代和1990年代，计算和通信技术日益普及，这要求采用诸如网络分析和多级建模等分析技术，这些技术可以扩展到日益复杂和庞大的数据集中。最近的计算社会学没有使用模拟，而是使用网络分析和先进的统计技术来分析大规模计算机数据库中电子代理的行为数据。电子记录，如电子邮件和即时消息记录，万维网上的超链接，移动电话数据，以及 Usenet 上的讨论，使社会科学家能够直接观察社会行为并在多个时间点和多个层次的分析行为，并且不受传统的实证方法，如访谈、观察（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]）为了通顺，删除研究对象/被试：participants）或调查工具的限制。机器学习算法的不断改进同样使得社会科学家和企业家能够使用新技术来识别大型电子数据集中潜在但有意义的社会互动和演化模式。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:Tripletsnew2012.png|thumb|right|Narrative network of US Elections 2012&amp;lt;ref name=&amp;quot;ReferenceA&amp;quot;&amp;gt;{{cite journal|title=Automated analysis of the US presidential elections using Big Data and network analysis|author1=S Sudhahar|author2=GA Veltri|author3=N Cristianini|journal=Big Data &amp;amp; Society|volume=2|issue=1|pages=1–28|year=2015|doi=10.1177/2053951715572916|doi-access=free}}&amp;lt;/ref&amp;gt;]]&lt;br /&gt;
&lt;br /&gt;
Narrative network of US Elections 2012&lt;br /&gt;
&lt;br /&gt;
【图2：Narrative network of US Elections 2012 + 2012年美国大选叙事网络】&lt;br /&gt;
&lt;br /&gt;
The automatic parsing of textual corpora has enabled the extraction of actors and their relational networks on a vast scale, turning textual data into network data.  The resulting networks, which can contain thousands of nodes, are then analysed by using tools from Network theory to identify the key actors, the key communities or parties, and general properties such as robustness or structural stability of the overall network, or centrality of certain nodes.&amp;lt;ref&amp;gt;{{cite journal|title=Network analysis of narrative content in large corpora|author1=S Sudhahar|author2=G De Fazio|author3=R Franzosi|author4=N Cristianini|journal=Natural Language Engineering|volume=21|issue=1|pages=1–32|year=2013|doi=10.1017/S1351324913000247 |url=https://research-information.bristol.ac.uk/files/129621186/Network_Analysis_of_Narrative_Content_in_Large_Corpora.pdf}}&amp;lt;/ref&amp;gt; This automates the approach introduced by quantitative narrative analysis,&amp;lt;ref&amp;gt;{{cite book|title=Quantitative Narrative Analysis|last=Franzosi|first=Roberto|publisher=Emory University|year=2010}}&amp;lt;/ref&amp;gt; whereby subject-verb-object triplets are identified with pairs of actors linked by an action, or pairs formed by actor-object.&amp;lt;ref name=&amp;quot;ReferenceA&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The automatic parsing of textual corpora has enabled the extraction of actors and their relational networks on a vast scale, turning textual data into network data.  The resulting networks, which can contain thousands of nodes, are then analysed by using tools from Network theory to identify the key actors, the key communities or parties, and general properties such as robustness or structural stability of the overall network, or centrality of certain nodes. This automates the approach introduced by quantitative narrative analysis, whereby subject-verb-object triplets are identified with pairs of actors linked by an action, or pairs formed by actor-object.&lt;br /&gt;
&lt;br /&gt;
文本语料库的自动解析使对参与者及其关系网络的大规模提取成为可能，它将文本数据转换为网络数据。由此产生的网络可以包含数千个'''节点 Nodes'''，然后利用网络理论中的工具对其进行分析，以确定关键参与者、关键群体，以及网络的总体特性如稳健性、结构稳定性，或某些节点的'''中心性 Centrality'''等。这使'''定量叙事分析Quantitative Narrative Analysis'''引入的方法得以自动化，据此，主语-动词-宾语三元组被看作由动作连接的成对行为者，或者由行为者-宾语形成的成对行为者。&lt;br /&gt;
&lt;br /&gt;
===Computational content analysis 计算机内容分析 （名词翻译可吗？）===&lt;br /&gt;
&lt;br /&gt;
[[Content analysis]] has been a traditional part of social sciences and media studies for a long time. The automation of content analysis has allowed a &amp;quot;[[big data]]&amp;quot; revolution to take place in that field, with studies in social media and newspaper content that include millions of news items. [[Gender bias]], [[readability]], content similarity, reader preferences, and even mood have been analyzed based on [[text mining]] methods over millions of documents.&amp;lt;ref&amp;gt;{{cite journal|author1=I. Flaounas|author2=M. Turchi|author3=O. Ali|author4=N. Fyson|author5=T. De Bie|author6=N. Mosdell|author7=J. Lewis|author8=N. Cristianini|title=The Structure of EU Mediasphere|journal=PLOS One|volume=5|issue=12|pages=e14243|year=2010|doi=10.1371/journal.pone.0014243|url=https://orca-mwe.cf.ac.uk/50732/1/Flaounas%202010.pdf|pmid=21170383|pmc=2999531|bibcode=2010PLoSO...514243F}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|title=Nowcasting Events from the Social Web with Statistical Learning|author1=V Lampos|author2=N Cristianini|journal=ACM Transactions on Intelligent Systems and Technology |volume=3|issue=4|page=72|doi=10.1145/2337542.2337557|year=2012|url=http://www.lampos.net/sites/default/files/papers/lampos2012nowcasting.pdf}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite conference|title=NOAM: news outlets analysis and monitoring system|author1=I. Flaounas|author2=O. Ali|author3=M. Turchi|author4=T Snowsill|author5=F Nicart|author6=T De Bie|author7=N Cristianini|conference=Proc. of the 2011 ACM SIGMOD international conference on Management of data|year=2011|url=http://www.tijldebie.net/system/files/SIGMOD_11_demo_Ilias.pdf|doi=10.1145/1989323.1989474}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite book|author=N Cristianini|title=''Combinatorial Pattern Matching''|pages=2–13|year=2011|volume=6661|series= Lecture Notes in Computer Science|isbn=978-3-642-21457-8|doi=10.1007/978-3-642-21458-5_2|chapter=Automatic Discovery of Patterns in Media Content|citeseerx=10.1.1.653.9525}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite journal|last=Lansdall-Welfare|first=Thomas|last2=Sudhahar|first2=Saatviga|last3=Thompson|first3=James|last4=Lewis|first4=Justin|last5=Team|first5=FindMyPast Newspaper|last6=Cristianini|first6=Nello|date=2017-01-09|title=Content analysis of 150 years of British periodicals|url=http://www.pnas.org/content/early/2017/01/03/1606380114|journal=Proceedings of the National Academy of Sciences|volume=114|issue=4|language=en|pages=E457–E465|doi=10.1073/pnas.1606380114|issn=0027-8424|pmid=28069962|pmc=5278459}}&amp;lt;/ref&amp;gt; The analysis of readability, gender bias and topic bias was demonstrated in Flaounas et al.&amp;lt;ref&amp;gt;{{cite journal|author1=I. Flaounas|author2=O. Ali|author3=M. Turchi|author4=T. Lansdall-Welfare|author5=T. De Bie|author6=N. Mosdell|author7=J. Lewis|author8=N. Cristianini|title=Research methods in the age of digital journalism|journal=Digital Journalism|year=2012|doi=10.1080/21670811.2012.714928|volume=1|pages=102–116}}&amp;lt;/ref&amp;gt; showing how different topics have different gender biases and levels of readability; the possibility to detect mood shifts in a vast population by analysing Twitter content was demonstrated as well.&amp;lt;ref&amp;gt;{{cite conference|title=Effects of the Recession on Public Mood in the UK|author=T Lansdall-Welfare|author2=V Lampos|author3=N Cristianini|series=Mining Social Network Dynamics (MSND) session on Social Media Applications|doi=10.1145/2187980.2188264|conference=Proceedings of the 21st International Conference on World Wide Web|pages=1221–1226|location=New York, NY, USA|url=http://www.cs.bris.ac.uk/Publications/Papers/2001521.pdf}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Content analysis has been a traditional part of social sciences and media studies for a long time. The automation of content analysis has allowed a &amp;quot;big data&amp;quot; revolution to take place in that field, with studies in social media and newspaper content that include millions of news items. Gender bias, readability, content similarity, reader preferences, and even mood have been analyzed based on text mining methods over millions of documents. The analysis of readability, gender bias and topic bias was demonstrated in Flaounas et al. showing how different topics have different gender biases and levels of readability; the possibility to detect mood shifts in a vast population by analysing Twitter content was demonstrated as well.&lt;br /&gt;
&lt;br /&gt;
长期以来，内容分析一直是社会科学和媒体研究的传统方法。内容分析的自动化使得这一领域发生了一场“大数据”革命，这些研究中，社交媒体和报纸内容包括了数百万条的新闻。基于文本挖掘方法，'''性别偏差Gender Bias'''、'''可读性 Readability'''、'''内容相似度 Content Similarity'''、'''读者偏好 Reader Preferences'''，甚至是'''情绪 Mood'''的数以百万计的文档都可以被分析。Flaounas等人对可读性、性别偏差和'''话题偏差 Topic Bias'''为主要研究对象，展示了不同的话题如何有不同水平的性别偏差和可读性; 展示了通过分析推特内容来检测人群情绪变化的可能性。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The analysis of vast quantities of historical newspaper content has been pioneered by Dzogang et al.,&amp;lt;ref&amp;gt;{{Cite journal|last=Dzogang|first=Fabon|last2=Lansdall-Welfare|first2=Thomas|last3=Team|first3=FindMyPast Newspaper|last4=Cristianini|first4=Nello|date=2016-11-08|title=Discovering Periodic Patterns in Historical News|journal=PLOS One|volume=11|issue=11|pages=e0165736|doi=10.1371/journal.pone.0165736|issn=1932-6203|pmc=5100883|pmid=27824911|bibcode=2016PLoSO..1165736D}}&amp;lt;/ref&amp;gt; which showed how periodic structures can be automatically discovered in historical newspapers. A similar analysis was performed on social media, again revealing strongly periodic structures.&amp;lt;ref&amp;gt;[https://core.ac.uk/download/pdf/83929129.pdf Seasonal Fluctuations in Collective Mood Revealed by Wikipedia Searches and Twitter Posts] F Dzogang, T Lansdall-Welfare, N Cristianini - 2016 IEEE International Conference on Data Mining, Workshop on ''Data Mining'' in Human Activity Analysis&lt;br /&gt;
&lt;br /&gt;
The analysis of vast quantities of historical newspaper content has been pioneered by Dzogang et al., which showed how periodic structures can be automatically discovered in historical newspapers. A similar analysis was performed on social media, again revealing strongly periodic structures.&amp;lt;ref&amp;gt;[https://core.ac.uk/download/pdf/83929129.pdf Seasonal Fluctuations in Collective Mood Revealed by Wikipedia Searches and Twitter Posts] F Dzogang, T Lansdall-Welfare, N Cristianini - 2016 IEEE International Conference on Data Mining, Workshop on Data Mining in Human Activity Analysis&lt;br /&gt;
&lt;br /&gt;
对大量历史报纸内容的分析是由 Dzogang 等人率先进行的，他们展示了如何在历史报纸中自动发现'''周期结构 Periodic Structures'''。一个类似的社交媒体上进行的分析，也揭示了强烈的周期性结构。 参考文献[ https://core.ac.uk/download/pdf/83929129.pdf 维基百科搜索和推特帖子揭示的集体情绪的季节性波动] f Dzogang，t Lansdall-Welfare，n Cristianini-2016 IEEE International Conference on Data Mining, Workshop on Data Mining in Human Activity Analysis&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
==Challenges 挑战==&lt;br /&gt;
&lt;br /&gt;
Computational sociology, as with any field of study, faces a set of challenges.&amp;lt;ref name=&amp;quot;MCSS&amp;quot;&amp;gt;Conte, Rosaria, et al. &amp;quot;[https://link.springer.com/content/pdf/10.1140%252Fepjst%252Fe2012-01697-8.pdf Manifesto of computational social science].&amp;quot; The European Physical Journal Special Topics 214.1 (2012): 325-346.&amp;lt;/ref&amp;gt; These challenges need to be handled meaningfully so as to make the maximum impact on society.&lt;br /&gt;
&lt;br /&gt;
Computational sociology, as with any field of study, faces a set of challenges. These challenges need to be handled meaningfully so as to make the maximum impact on society.&lt;br /&gt;
&lt;br /&gt;
计算社会学和其他研究领域一样面临着一系列的挑战。必须有意义地处理这些挑战（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） meaningfully怎么翻译才比较通顺？），才能对社会产生最大的影响。&lt;br /&gt;
  &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Levels and their interactions 层级和层级的交互关系===&lt;br /&gt;
&lt;br /&gt;
Each society that is formed tends to be in one level or the other and there exists tendencies of interactions between and across these levels. Levels need not only be micro-level or macro-level in nature. There can be intermediate levels in which a society exists say - groups, networks, communities etc.&amp;lt;ref name=&amp;quot;MCSS&amp;quot; /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Each society that is formed tends to be in one level or the other and there exists tendencies of interactions between and across these levels. Levels need not only be micro-level or macro-level in nature. There can be intermediate levels in which a society exists say - groups, networks, communities etc.&lt;br /&gt;
&lt;br /&gt;
形成的每个社会都处于某种层次上，并且这些层次之间有相互作用的倾向。社会中的级别不仅可以分为微观或宏观的层次，还可以存在中间的层次，比如群体、网络、社区等。&lt;br /&gt;
（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） 合并了英文的原句）&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The question however arises as to how to identify these levels and how they come into existence? And once they are in existence how do they interact within themselves and with other levels?&lt;br /&gt;
&lt;br /&gt;
The question however arises as to how to identify these levels and how they come into existence? And once they are in existence how do they interact within themselves and with other levels?&lt;br /&gt;
&lt;br /&gt;
然而问题是，这些层次是如何确定的以及如何产生的？并且，一旦它们产生了，它们如何在自身内部以及与其他层次相互作用？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
If we view entities (agents) as nodes and the connections between them as the edges, we see the formation of networks. The connections in these networks do not come about based on just objective relationships between the entities, rather they are decided upon by factors chosen by the participating entities.&amp;lt;ref&amp;gt;{{cite journal|last1=Egu´ıluz|first1=V. M.|last2=Zimmermann|first2=M. G.|last3=Cela-Conde|first3=C. J.|last4=San Miguel|first4=M.|title=American Journal of Sociology|issue=2005|pages=110, 977}}&amp;lt;/ref&amp;gt; The challenge with this process is that, it is difficult to identify when a set of entities will form a network. These networks may be of trust networks, co-operation networks, dependence networks etc. There have been cases where heterogeneous set of entities have shown to form strong and meaningful networks among themselves.&amp;lt;ref&amp;gt;{{cite journal|last1=Sichman|first1=J. S.|last2=Conte|first2=R.|title=Computational &amp;amp; Mathematical Organization Theory|issue=2002|pages=8(2)}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Ehrhardt|first1=G.|last2=Marsili|first2=M.|last3=Vega-Redondo|first3=F.|title=Physical Review E|issue=2006|pages=74(3)}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
If we view entities (agents) as nodes and the connections between them as the edges, we see the formation of networks. The connections in these networks do not come about based on just objective relationships between the entities, rather they are decided upon by factors chosen by the participating entities. The challenge with this process is that, it is difficult to identify when a set of entities will form a network. These networks may be of trust networks, co-operation networks, dependence networks etc. There have been cases where heterogeneous set of entities have shown to form strong and meaningful networks among themselves.&lt;br /&gt;
&lt;br /&gt;
如果我们把'''实体 Entities'''（'''主体 Agents'''）看作节点，把它们之间的连接看作边，我们就看到了网络的形成。这些网络中的连接并非只是基于实体之间的客观关系，而是由实体选择的因素决定的。这个过程的困难之处在于，很难确定一组实体何时形成网络。这些网络可以是信任网络、合作网络、依赖网络等。在一些情况下，异质的实体集在它们之间形成了强大而有意义的网络。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
As discussed previously, societies fall into levels and in one such level, the individual level, a micro-macro link&amp;lt;ref&amp;gt;Billari, Francesco C. [https://books.google.com/books?hl=en&amp;amp;lr=&amp;amp;id=Tc8iL0b-OycC&amp;amp;oi=fnd&amp;amp;pg=PA1&amp;amp;dq=%22Agent-based+computational+modelling:+applications+in+demography,+social,+economic+and+environmental+sciences%22&amp;amp;ots=6MNVK7JP-e&amp;amp;sig=-o_iS9zCK3r-t1eHn3554UVadUs Agent-based computational modelling: applications in demography, social, economic and environmental sciences]. Taylor &amp;amp; Francis, 2006.&amp;lt;/ref&amp;gt; refers to the interactions which create higher-levels. There are a set of questions that needs to be answered regarding these Micro-Macro links. How they are formed? When do they converge? What is the feedback pushed to the lower levels and how are they pushed?&lt;br /&gt;
&lt;br /&gt;
As discussed previously, societies fall into levels and in one such level, the individual level, a micro-macro link refers to the interactions which create higher-levels. There are a set of questions that needs to be answered regarding these Micro-Macro links. How they are formed? When do they converge? What is the feedback pushed to the lower levels and how are they pushed?&lt;br /&gt;
&lt;br /&gt;
正如前面所讨论的，社会分为不同层次。在其中的一个层次：个体层次中，'''微观-宏观联系 Micro-macro Link'''指的是创造更高层次的相互作用。关于微观-宏观链接有一系列问题等待回答。它们是如何形成的？它们什么时候汇聚？什么反馈被推到了较低的层次，以及它们是如何被推到较低层次的？ &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Another major challenge in this category concerns the validity of information and their sources. In recent years there has been a boom in information gathering and processing. However, little attention was paid to the spread of false information between the societies. Tracing back the sources and finding ownership of such information is difficult.&lt;br /&gt;
&lt;br /&gt;
Another major challenge in this category concerns the validity of information and their sources. In recent years there has been a boom in information gathering and processing. However, little attention was paid to the spread of false information between the societies. Tracing back the sources and finding ownership of such information is difficult.&lt;br /&gt;
&lt;br /&gt;
这一分类的另一个主要挑战涉及信息的有效性及其来源。近年来，信息收集和处理有着蓬勃的发展。但人们很少注意到社会之间虚假信息的传播。追溯资料来源并找到这些资料的所有者是很困难的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Culture modeling 文化建模===&lt;br /&gt;
&lt;br /&gt;
The evolution of the networks and levels in the society brings about cultural diversity.&amp;lt;ref&amp;gt;{{cite journal|last1=Centola|first1=D.|last2=Gonz´alez-Avella|first2=J. C.|last3=Egu´ıluz|first3=V. M.|last4=San Miguel|first4=M.|title=Journal of Conflict Resolution|issue=2007|pages=51}}&amp;lt;/ref&amp;gt; A thought which arises however is that, when people tend to interact and become more accepting of other cultures and beliefs, how is it that diversity still persists? Why is there no convergence? A major challenge is how to model these diversities. Are there external factors like mass media, locality of societies etc. which influence the evolution or persistence of cultural diversities?{{Citation needed|reason=Sounds just like personal thoughts|date=May 2017}}&lt;br /&gt;
&lt;br /&gt;
The evolution of the networks and levels in the society brings about cultural diversity. A thought which arises however is that, when people tend to interact and become more accepting of other cultures and beliefs, how is it that diversity still persists? Why is there no convergence? A major challenge is how to model these diversities. Are there external factors like mass media, locality of societies etc. which influence the evolution or persistence of cultural diversities?&lt;br /&gt;
&lt;br /&gt;
社会网络和层次的演变带来了文化的多样性。然而人们会想，当人们倾向于相互作用，变得更能接受其他文化和信仰时，为什么多样性仍然存在？为什么人们没有趋同？一个主要的挑战是如何为这些多样性建立模型。是否存在大众传媒、社会地域性等外部因素，这些因素影响文化多样性的演化或保持？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Experimentation and evaluation 实验和评估===&lt;br /&gt;
&lt;br /&gt;
Any study or modelling when combined with experimentation needs to be able to address the questions being asked. [[Computational social science]] deals with large scale data and the challenge becomes much more evident as the scale grows. How would one design informative simulations on a large scale? And even if a large scale simulation is brought up, how is the evaluation supposed to be performed?&lt;br /&gt;
&lt;br /&gt;
Any study or modelling when combined with experimentation needs to be able to address the questions being asked. Computational social science deals with large scale data and the challenge becomes much more evident as the scale grows. How would one design informative simulations on a large scale? And even if a large scale simulation is brought up, how is the evaluation supposed to be performed?&lt;br /&gt;
&lt;br /&gt;
任何与实验结合的研究或建模都需要能够解决所提出的问题。计算社会科学处理大规模数据，并且数据规模越大建模的挑战就越明显。如何在一个大规模的数据集里设计信息仿真模型？并且，即使提出了一个大规模的仿真模型，应该如何对它进行评估？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Model choice and model complexities 模型选择和模型复杂性===&lt;br /&gt;
&lt;br /&gt;
Another challenge is identifying the models that would best fit the data and the complexities of these models. These models would help us predict how societies might evolve over time and provide possible explanations on how things work.&amp;lt;ref&amp;gt;Weisberg, Michael. [http://www.academia.edu/download/30604870/lessmorefinal.pdf When less is more: Tradeoffs and idealization in model building]. Diss. Stanford University, 2003.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Another challenge is identifying the models that would best fit the data and the complexities of these models. These models would help us predict how societies might evolve over time and provide possible explanations on how things work.&lt;br /&gt;
&lt;br /&gt;
另一个挑战是确定最适合数据的模型，以及最合适的'''模型复杂性 Model Complexities'''。这些模型将帮助我们预测随着时间的推移社会将如何演变，并为事物如何运动和变化提供可能的解释。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====Generative models 生成模型====&lt;br /&gt;
&lt;br /&gt;
Generative models helps us to perform extensive qualitative analysis in a controlled fashion. A model proposed by Epstein, is the agent-based simulation, which talks about identifying an initial set of heterogeneous entities (agents) and observe their evolution and growth based on simple local rules.&amp;lt;ref&amp;gt;Epstein, Joshua M. [https://www.researchgate.net/profile/Eric_Jones14/publication/283615593_Book_Review_-_Generative_Social_Science_Studies_in_Agent-Based_Computational_Modeling/links/5641398808aebaaea1f70216.pdf Generative social science: Studies in agent-based computational modeling]. Princeton University Press, 2006.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Generative models helps us to perform extensive qualitative analysis in a controlled fashion. A model proposed by Epstein, is the agent-based simulation, which talks about identifying an initial set of heterogeneous entities (agents) and observe their evolution and growth based on simple local rules.&lt;br /&gt;
&lt;br /&gt;
'''生成模型 Generative Models'''帮助我们以一种受控的方式进行广泛的定性分析。爱泼斯坦（Epstein）提出的一个基于主体的模型，就是探讨如何识别异质实体(主体)的'''初始集 Initial Set'''，并根据简单的局部规则观察它们的演化和增长。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
But what are these local rules? How does one identify them for a set of heterogeneous agents? Evaluation and impact of these rules state a whole new set of difficulties.&lt;br /&gt;
&lt;br /&gt;
But what are these local rules? How does one identify them for a set of heterogeneous agents? Evaluation and impact of these rules state a whole new set of difficulties.&lt;br /&gt;
&lt;br /&gt;
但是这些局部规则是什么呢？如何识别一组异质实体？这些规则的评估和影响都是新出现的困难之处。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====Heterogeneous or ensemble models 异质模型和组合模型====&lt;br /&gt;
&lt;br /&gt;
Integrating simple models which perform better on individual tasks to form a Hybrid model is an approach that can be looked into{{Citation needed|reason=unsupported claims|date=May 2017}}. These models can offer better performance and understanding of the data. However the trade-off of identifying and having a deep understanding of the interactions between these simple models arises when one needs to come up with one combined, well performing model. Also, coming up with tools and applications to help analyse and visualize the data based on these hybrid models is another added challenge.&lt;br /&gt;
&lt;br /&gt;
Integrating simple models which perform better on individual tasks to form a Hybrid model is an approach that can be looked into. These models can offer better performance and understanding of the data. However the trade-off of identifying and having a deep understanding of the interactions between these simple models arises when one needs to come up with one combined, well performing model. Also, coming up with tools and applications to help analyse and visualize the data based on these hybrid models is another added challenge.&lt;br /&gt;
&lt;br /&gt;
集成在单个任务中表现良好的简单模型并形成'''混合模型 Hybrid model'''是一种可以继续考虑的方法。这些模型有更好的性能并可以对数据提供更好的理解。然而，当需要提出一个整合的、性能良好的模型时，识别简单模型和深入理解模型之间相互作用的权衡问题就出现了。此外，另一个挑战是开发工具和应用程序来帮助分析和可视化基于这些混合模型的数据。&lt;br /&gt;
&lt;br /&gt;
==Impact 影响==&lt;br /&gt;
&lt;br /&gt;
Computational sociology can bring impacts to science, technology and society.&amp;lt;ref name=&amp;quot;MCSS&amp;quot; /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Computational sociology can bring impacts to science, technology and society.&lt;br /&gt;
&lt;br /&gt;
计算社会学可以给科学、技术和社会带来影响。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Impact on science 对科学的影响===&lt;br /&gt;
&lt;br /&gt;
In order for the study of computational sociology to be effective, there has to be valuable innovations. These innovation can be of the form of new data analytics tools, better models and algorithms. The advent of such innovation will be a boon for the scientific community in large. {{Citation needed|reason=citation for claim on innovation and the type of innovation|date=May 2017}}&lt;br /&gt;
&lt;br /&gt;
In order for the study of computational sociology to be effective, there has to be valuable innovations. These innovation can be of the form of new data analytics tools, better models and algorithms. The advent of such innovation will be a boon for the scientific community in large. &lt;br /&gt;
&lt;br /&gt;
为了使计算社会学的研究有效，必须有一些有价值的创新。这些创新可以是新形式的数据分析工具，或更好的模型和算法。这些创新的出现将为整个科学界带来益处。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Impact on society 对社会的影响===&lt;br /&gt;
&lt;br /&gt;
One of the major challenges of computational sociology is the modelling of social processes {{Citation needed|reason=to support the claim for need of modeling of social processes|date=May 2017}}. Various law and policy makers would be able to see efficient and effective paths to issue new guidelines and the mass in general would be able to evaluate and gain fair understanding of the options presented in front of them enabling an open and well balanced decision process. {{Citation needed|reason=unsupported claims|date=May 2017}}.&lt;br /&gt;
&lt;br /&gt;
One of the major challenges of computational sociology is the modelling of social processes . Various law and policy makers would be able to see efficient and effective paths to issue new guidelines and the mass in general would be able to evaluate and gain fair understanding of the options presented in front of them enabling an open and well balanced decision process. &lt;br /&gt;
&lt;br /&gt;
计算社会学的主要挑战之一是对社会过程的建模。各种法律和政策制定者将能够得到发布新指导方针的快速有效的方法，广大群众将能够评价和更好地理解各种备选方案，从而实现决策进程的公开和平衡。&lt;br /&gt;
&lt;br /&gt;
==Journals and academic publications 期刊和学术出版物==&lt;br /&gt;
&lt;br /&gt;
The most relevant journal of the discipline is the [[Journal of Artificial Societies and Social Simulation]].&lt;br /&gt;
&lt;br /&gt;
The most relevant journal of the discipline is the Journal of Artificial Societies and Social Simulation.&lt;br /&gt;
&lt;br /&gt;
该学科最相关的期刊是《人工社会与社会模拟（the Journal of Artificial Societies and Social Simulation）》。&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20100611121626/http://www.ccsr.uiuc.edu/web/Journals/Journals.html Complexity Research Journal List], from UIUC, IL 复杂研究期刊列表（资料来自伊利诺伊大学香槟分校）&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20100611091342/http://www.ccsr.uiuc.edu/web/Groups/Groups.html Related Research Groups], from UIUC, IL 相关研究组（资料来自伊利诺伊大学香槟分校）&lt;br /&gt;
&lt;br /&gt;
==Associations, conferences and workshops 协会、会议及工作坊==&lt;br /&gt;
&lt;br /&gt;
*[http://www.casos.cs.cmu.edu/naacsos/ North American Association for Computational Social and Organization Sciences]&lt;br /&gt;
&lt;br /&gt;
*[http://www.essa.eu.org/ ESSA: European Social Simulation Association]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Academic programs, departments and degrees 学术课程、院系和学位==&lt;br /&gt;
&lt;br /&gt;
* [http://mediapatterns.enm.bris.ac.uk/ University of Bristol &amp;quot;Mediapatterns&amp;quot; project]&lt;br /&gt;
&lt;br /&gt;
* [http://www.cos.cs.cmu.edu/ Carnegie Mellon University], [http://www.casos.cs.cmu.edu PhD program] in Computation, Organizations and Society (COS)&lt;br /&gt;
&lt;br /&gt;
* [http://www.uchicago.edu University of Chicago]&lt;br /&gt;
&lt;br /&gt;
** [https://macss.uchicago.edu/ Certificate, MA and PhD in Computational Social Sciences]&lt;br /&gt;
&lt;br /&gt;
* [http://www.gmu.edu George Mason University]&lt;br /&gt;
&lt;br /&gt;
** PhD program in [http://css.gmu.edu CSS (Computational Social Sciences)]&lt;br /&gt;
&lt;br /&gt;
** MA program in [http://mais.gmu.edu/programs/la-mais-css Master's of Interdisciplinary Studies, CSS emphasis]&lt;br /&gt;
&lt;br /&gt;
* [http://www.pdx.edu/sysc/program-systems-science-phd-program Portland State], PhD program in Systems Science&lt;br /&gt;
&lt;br /&gt;
* [http://www.pdx.edu/sysc/program-systems-science-masters-program Portland State], MS program in Systems Science&lt;br /&gt;
&lt;br /&gt;
* [http://www.ucd.ie University College Dublin], &lt;br /&gt;
&lt;br /&gt;
** PhD Program in [http://www.ucd.ie/geary/postgraduatetraining/cscs Complex Systems and Computational Social Science]&lt;br /&gt;
&lt;br /&gt;
** MSc in [https://sisweb.ucd.ie/usis/!W_HU_MENU.P_PUBLISH?p_tag=PROG&amp;amp;MAJR=W390 Social Data Analytics] &lt;br /&gt;
&lt;br /&gt;
** BSc in [https://www.myucd.ie/courses/social-sciences/computational-social-science Computational Social Science] &lt;br /&gt;
&lt;br /&gt;
* [https://archive.is/20121215023745/http://hcs.ucla.edu/courses.htm UCLA], Minor in Human Complex Systems&lt;br /&gt;
&lt;br /&gt;
* [http://www.cs.ucla.edu/~cyber/ UCLA], Major in Computational &amp;amp; Systems Biology (including behavioral sciences)&lt;br /&gt;
&lt;br /&gt;
* [http://cscs.umich.edu/education/undergrad/undergrad.html Univ. of Michigan], Minor in Complex Systems&lt;br /&gt;
&lt;br /&gt;
* [http://www.pdx.edu/sysc/resources-other-systems-science-programs Systems Sciences Programs List], Portland State.  List of other worldwide related programs.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Centers and institutes 中心和机构==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===North America 北美===&lt;br /&gt;
&lt;br /&gt;
* [http://cnets.indiana.edu/ Center for Complex Networks and Systems Research], Indiana University, Bloomington, IN, USA.&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20110430200327/http://www.ccsr.uiuc.edu/ Center for Complex Systems Research], University of Illinois at Urbana-Champaign, IL, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://socialcomplexity.gmu.edu/ Center for Social Complexity], George Mason University, Fairfax, VA, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.asu.edu/clas/csdc/ Center for Social Dynamics and Complexity], Arizona State University, Tempe, AZ, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.cscs.umich.edu/ Center of the Study of Complex Systems], University of Michigan, Ann Arbor, MI, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://hcs.ucla.edu/ Human Complex Systems], University of California Los Angeles, Los Angeles, CA, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.iq.harvard.edu/ Institute for Quantitative Social Science], Harvard University, Boston, MA, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.nico.northwestern.edu/ Northwestern Institute on Complex Systems (NICO)], Northwestern University, Evanston, IL USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.santafe.edu/ Santa Fe Institute], Santa Fe, NM, USA.&lt;br /&gt;
&lt;br /&gt;
* Duke Network Analysis Center, [[Duke University]], Durham, NC, USA&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===South America 南美===&lt;br /&gt;
&lt;br /&gt;
* [http://www5.each.usp.br/mestrado-academico-em-modelagem-de-sistemas-complexos/ Modelagem de Sistemas Complexos], University of São Paulo - EACH, São Paulo, SP, Brazil&lt;br /&gt;
&lt;br /&gt;
* [http://inct.cnpq.br/web/inct-sc Instituto Nacional de Ciência e Tecnologia de Sistemas Complexos], Centro Brasileiro de Pesquisas Físicas, Rio de Janeiro, RJ, Brazil&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Europe 欧洲===&lt;br /&gt;
&lt;br /&gt;
* [http://cfpm.org Centre for Policy Modelling], Manchester, UK.&lt;br /&gt;
&lt;br /&gt;
* [http://cress.soc.surrey.ac.uk/ Centre for Research in Social Simulation], University of Surrey, UK.&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20130425014018/http://dl.ucd.ie/ UCD Dynamics Lab- Centre for Computational Social Science], Geary Institute for Public Policy, University College Dublin, Ireland.&lt;br /&gt;
&lt;br /&gt;
* [http://www.rug.nl/research/gcscs/ Groningen Center for Social Complexity Studies (GCSCS)], Groningen, NL.&lt;br /&gt;
&lt;br /&gt;
* [http://www.soms.ethz.ch/ Chair of Sociology, in particular of Modeling and Simulation (SOMS)], Zürich, Switzerland.&lt;br /&gt;
&lt;br /&gt;
* [http://www.eco.unibs.it/gecs/ Research Group on Experimental and Computational Sociology (GECS)], Brescia, IT.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Asia 亚洲===&lt;br /&gt;
&lt;br /&gt;
* [http://bandungfe.net Bandung Fe Institute, Centre for Complexity in Surya University], Bandung, Indonesia.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== See also 参见==&lt;br /&gt;
&lt;br /&gt;
* [[Artificial society]] 人工社会&lt;br /&gt;
&lt;br /&gt;
* [[Simulated reality]] 虚拟现实&lt;br /&gt;
&lt;br /&gt;
* [[Social simulation]] 社会仿真&lt;br /&gt;
&lt;br /&gt;
* [[Agent-based social simulation]] 基于主体的社会仿真&lt;br /&gt;
&lt;br /&gt;
* [[Social complexity]] 社会复杂性&lt;br /&gt;
&lt;br /&gt;
* [[Computational economics]] 计算经济学&lt;br /&gt;
&lt;br /&gt;
* [[Computational epidemiology]] 计算流行病学&lt;br /&gt;
&lt;br /&gt;
* [[Cliodynamics]] 历史动力学&lt;br /&gt;
&lt;br /&gt;
* [[Predictive analytics]] 预测分析&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&lt;br /&gt;
{{reflist|35em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==External links 外部链接==&lt;br /&gt;
&lt;br /&gt;
*[http://cress.soc.surrey.ac.uk/s4ss/ On-line book &amp;quot;Simulation for the Social Scientist&amp;quot; by Nigel Gilbert and Klaus G. Troitzsch, 1999, second edition 2005 社会科学家的仿真建模 电子书 作者：Nigel Gilbert and Klaus G. Troitzsch 第二版（2005年版）]&lt;br /&gt;
&lt;br /&gt;
*[http://jasss.soc.surrey.ac.uk/JASSS.html Journal of Artificial Societies and Social Simulation 人工社会和社会建模仿真期刊]&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20110516072744/http://cmol.nbi.dk/models/ Agent based models for social networks, interactive java applets 基于主体的社会网络模型，交互式 java 小程序]&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20090827052722/http://www.personal.kent.edu/~bcastel3/ Sociology and Complexity Science Website 社会学与复杂性科学网站]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:Subfields of sociology]]&lt;br /&gt;
&lt;br /&gt;
Category:Subfields of sociology&lt;br /&gt;
&lt;br /&gt;
范畴: 社会学的子领域&lt;br /&gt;
&lt;br /&gt;
[[Category:Complex systems theory]]&lt;br /&gt;
&lt;br /&gt;
Category:Complex systems theory&lt;br /&gt;
&lt;br /&gt;
范畴: 复杂系统理论&lt;br /&gt;
&lt;br /&gt;
[[Category:Methods in sociology]]&lt;br /&gt;
&lt;br /&gt;
Category:Methods in sociology&lt;br /&gt;
&lt;br /&gt;
范畴: 社会学方法&lt;br /&gt;
&lt;br /&gt;
[[Category:Computational fields of study]]&lt;br /&gt;
&lt;br /&gt;
Category:Computational fields of study&lt;br /&gt;
&lt;br /&gt;
类别: 研究的计算领域&lt;br /&gt;
&lt;br /&gt;
&amp;lt;noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;small&amp;gt;This page was moved from [[wikipedia:en:Computational sociology]]. Its edit history can be viewed at [[社会计算/edithistory]]&amp;lt;/small&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:待整理页面]]&lt;br /&gt;
&lt;br /&gt;
== 编者推荐 ==&lt;br /&gt;
=== 书籍推荐 ===&lt;br /&gt;
====[https://e.jd.com/30159646.html 社会计算的基本方法与应用]====&lt;br /&gt;
这是中科院自动化所的王飞跃老师关于社会计算的专著，从利用计算技术解决社会问题的角度介绍社会计算。阅读难度可能较高。&lt;br /&gt;
&lt;br /&gt;
=== 集智推荐 ===&lt;br /&gt;
====[https://campus.swarma.org/course/1028 2019 International Conference of Social Computing]====&lt;br /&gt;
本课程是2019年8月26日、27日的2019 International Conference of Social Computing记录。教师团队由芝加哥大学社会学系James Evans教授，Science University of Gottingen傅晓明教授，清华大学罗家德教授，电子科技大学周涛教授等多位老师组成。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://campus.swarma.org/course/1016 复杂系统与社会计算研讨会]====&lt;br /&gt;
本课程是，2019年10月27日北京计算科学研究中心主办的复杂系统与社会计算研讨会活动记录。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://pattern.swarma.org/path?id=12 计算社会科学入门路径]====&lt;br /&gt;
计算社会科学诞生至今，已有将近10年。在自然科学领域已经广泛应用大数据、分布式计算等方式提高研究质量的今天，社会科学领域涉及到的核心数据仍然被少数机构所拥有并创造着巨大的价值。本文将从计算社会科学的发展历史，常用方法，以及前沿问题来给大家粗略地展示计算社会科学的脉络。&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E7%A4%BE%E4%BC%9A%E8%AE%A1%E7%AE%97&amp;diff=11182</id>
		<title>社会计算</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E7%A4%BE%E4%BC%9A%E8%AE%A1%E7%AE%97&amp;diff=11182"/>
		<updated>2020-07-26T10:05:32Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：/* Macrosimulation and microsimulation 宏观模拟和微观模拟 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;#重定向 [[社会计算]]&lt;br /&gt;
此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。&lt;br /&gt;
{{sociology}}&amp;lt;onlyinclude&amp;gt;&amp;lt;!-- &lt;br /&gt;
&lt;br /&gt;
&amp;lt;onlyinclude&amp;gt;&amp;lt;!-- &lt;br /&gt;
&lt;br /&gt;
只包括! -- &lt;br /&gt;
&lt;br /&gt;
While editing this lead/intro, please keep your text BELOW this line - this will make it easier to automatically insert the lede into other articles --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
  While editing this lead/intro, please keep your text BELOW this line - this will make it easier to automatically insert the lede into other articles --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
当编辑这个导语 / 介绍，请保持你的文本下面这行-这将使它更容易自动插入到其他文章的莱德-&lt;br /&gt;
&lt;br /&gt;
'''Computational sociology''' is a branch of [[sociology]] that uses computationally intensive methods to analyze and model social phenomena. Using [[computer simulation]]s, [[artificial intelligence]], complex statistical methods, and analytic approaches like [[social network analysis]], computational sociology develops and tests theories of complex social processes through bottom-up modeling of social interactions.&amp;lt;ref name=&amp;quot;MW&amp;quot;&amp;gt;{{cite journal|doi=10.1146/annurev.soc.28.110601.141117|title=From Factors to Actors: Computational Sociology and Agent-Based Modeling |first1=Michael W. |last1=Macy |first2=Robert |last2=Willer |journal=Annual Review of Sociology |volume=28 |pages=143–166 |jstor=3069238|year=2002}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Computational sociology is a branch of sociology that uses computationally intensive methods to analyze and model social phenomena. Using computer simulations, artificial intelligence, complex statistical methods, and analytic approaches like social network analysis, computational sociology develops and tests theories of complex social processes through bottom-up modeling of social interactions.&lt;br /&gt;
&lt;br /&gt;
'''计算社会学 Computational Sociology''' 是社会学的一个分支，它使用计算密集型方法来分析和模拟社会现象。&amp;lt;font color='red'&amp;gt;计算社会学通过使用计算机模拟、人工智能、复杂统计方法以及社会网络分析等分析方法自下而上地建立社会互动模型，是建立并检验复杂社会过程的理论。&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;  借助计算机模拟、人工智能、复杂统计方法以及社会网络分析等分析方法，计算社会学通过自下而上地建立社会互动模型来发展和检验关于复杂社会过程的理论。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
It involves the understanding of social agents, the interaction among these agents, and the effect of these interactions on the social aggregate.&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;&amp;gt;{{cite book|last1=Gilbert |first1=Nigel |last2=Troitzsch |first2=Klaus |year=2005 |title=Simulation for Social Scientists |edition=2 |chapter=Simulation and social science |publisher=Open University Press |chapter-url=http://cress.soc.surrey.ac.uk/s4ss/}}&amp;lt;/ref&amp;gt; Although the subject matter and methodologies in [[social science]] differ from those in [[natural science]] or [[computer science]], several of the approaches used in contemporary [[social simulation]] originated from fields such as [[physics]] and [[artificial intelligence]].&amp;lt;ref name=&amp;quot;Artificial Societies&amp;quot;&amp;gt;{{cite book|last1=Epstein |first1=Joshua M. |last2=Axtell |first2=Robert |year=1996 |title=Growing Artificial Societies: Social Science from the Bottom Up |location=Washington DC |publisher=Brookings Institution Press|url=https://archive.org/details/growingartificia00epst|url-access=registration |isbn=978-0262050531 }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;Cooperation&amp;quot;&amp;gt;{{cite book|last1=Axelrod |first1=Robert |year=1997 |title=The Complexity of Cooperation: Agent-Based Models of Competition and Collaboration |location=Princeton, NJ |publisher=Princeton University Press}}&amp;lt;/ref&amp;gt; Some of the approaches that originated in this field have been imported into the natural sciences, such as measures of [[centrality|network centrality]] from the fields of [[social network analysis]] and [[network science]].&lt;br /&gt;
&lt;br /&gt;
It involves the understanding of social agents, the interaction among these agents, and the effect of these interactions on the social aggregate. Although the subject matter and methodologies in social science differ from those in natural science or computer science, several of the approaches used in contemporary social simulation originated from fields such as physics and artificial intelligence. Some of the approaches that originated in this field have been imported into the natural sciences, such as measures of network centrality from the fields of social network analysis and network science.&lt;br /&gt;
&lt;br /&gt;
它涉及理解社会行为主体和它们的相互作用，以及这些相互作用如何影响社会总体(--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） social aggregate--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|讨论]]） 我觉得这样翻译是ok的)。虽然社会科学的主题和方法不同于自然科学或计算机科学，但当代社会仿真模拟中使用的一些方法起源于物理学和人工智能等领域。这一领域的一些方法，如来自社会网络分析和网络科学领域的网络中心性度量方法等，早已被引入到自然科学中。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In relevant literature, computational sociology is often related to the study of [[social complexity]].&amp;lt;ref&amp;gt;{{cite journal|last=Casti |first=J |year=1999 |title=The Computer as Laboratory: Toward a Theory of Complex Adaptive Systems |journal=Complexity |volume=4 |issue=5 |pages=12–14 |doi=10.1002/(SICI)1099-0526(199905/06)4:5&amp;lt;12::AID-CPLX3&amp;gt;3.0.CO;2-4}}&amp;lt;/ref&amp;gt; Social complexity concepts such as [[complex systems]], [[non-linear]] interconnection among macro and micro process, and [[emergence]], have entered the vocabulary of computational sociology.&amp;lt;ref&amp;gt;{{cite journal|last=Goldspink |first=C |year=2002 |title=Methodological Implications of Complex Systems Approaches to Sociality: Simulation as a Foundation for Knowledge |url=http://jasss.soc.surrey.ac.uk/5/1/3.html |publisher=Journal of Artificial Societies and Social Simulation |volume=5 |issue=1}}&amp;lt;/ref&amp;gt; A practical and well-known example is the construction of a computational model in the form of an &amp;quot;[[artificial society]]&amp;quot;, by which researchers can analyze the structure of a [[Social structure|social system]].&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;Generative&amp;quot;&amp;gt;{{cite book|last=Epstein |first=Joshua |year=2007 |title=Generative Social Science: Studies in Agent-Based Computational Modeling |location=Princeton, NJ |publisher=Princeton University Press|url=https://www.researchgate.net/publication/283615593}}&lt;br /&gt;
&lt;br /&gt;
In relevant literature, computational sociology is often related to the study of social complexity. Social complexity concepts such as complex systems, non-linear interconnection among macro and micro process, and emergence, have entered the vocabulary of computational sociology. A practical and well-known example is the construction of a computational model in the form of an &amp;quot;artificial society&amp;quot;, by which researchers can analyze the structure of a social system.&lt;br /&gt;
&lt;br /&gt;
在相关文献中，计算社会学经常与社会复杂性的研究有关。复杂系统、宏观和微观过程之间的非线性关联、涌现等社会复杂性概念已经进入计算社会学的词汇。一个实际而著名的例子是建立“'''人工社会 Artificial Society'''”的计算模型，通过它研究人员可以分析一个社会系统的结构。 &lt;br /&gt;
&lt;br /&gt;
While editing this lead/intro, please keep your text ABOVE this line - this will make it easier to automatically insert the lede into other articles - thanks!  &lt;br /&gt;
&lt;br /&gt;
While editing this lead/intro, please keep your text ABOVE this line - this will make it easier to automatically insert the lede into other articles - thanks!  &lt;br /&gt;
&lt;br /&gt;
当编辑这个引导 / 介绍，请保持你的文本以上这一行-这将使它更容易自动插入到其他文章的莱德-谢谢！&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;&amp;lt;/onlyinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;&amp;lt;/onlyinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
-- / 只包括&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==History 历史==&lt;br /&gt;
&lt;br /&gt;
{{see also|Sociology and complexity science}}&lt;br /&gt;
&lt;br /&gt;
[[File:Complexity-map-with-sociolo.png|thumb|right|300px|Historical map of research paradigms and associated scientists in [[sociology and complexity science]].]]&lt;br /&gt;
&lt;br /&gt;
Historical map of research paradigms and associated scientists in [[sociology and complexity science.]]&lt;br /&gt;
&lt;br /&gt;
【图1：Historical map of research paradigms and associated scientists in [[sociology and complexity science＋社会学和复杂性中的研究范式和科学家的历史地图】&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Background 背景===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In the past four decades, computational sociology has been introduced and gaining popularity {{According to whom|date=June 2017}}.  This has been used primarily for modeling or building explanations of social processes and are depending on the emergence of complex behavior from simple activities.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;&amp;gt;Salgado, Mauricio, and Nigel Gilbert. &amp;quot;[http://epubs.surrey.ac.uk/749319/1/Emergence%20and%20Communication%20-%20V3%201.pdf Emergence and communication in computational sociology].&amp;quot; Journal for the Theory of Social Behaviour 43.1 (2013): 87-110.&amp;lt;/ref&amp;gt;  The idea behind emergence is that properties of any bigger system do not always have to be properties of the components that the system is made of.&amp;lt;ref&amp;gt;Macy, Michael W., and Robert Willer. &amp;quot;[http://sct.uab.cat/lsds/sites/sct.uab.cat.lsds/files/FROM%20FACTORS%20TO%20ACTORS%20(Macy%20and%20Willer%202002).pdf From factors to actors: computational sociology and agent-based modeling].&amp;quot; Annual review of sociology 28.1 (2002): 143-166.&amp;lt;/ref&amp;gt;  The people responsible for the introduction of the idea of emergence are Alexander, Morgan, and Broad, who were classical emergentists.  The time at which these emergentists came up with this concept and method was during the time of the early twentieth century.  The aim of this method was to find a good enough accommodation between two different and extreme ontologies, which were reductionist materialism and dualism.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;/&amp;gt; &lt;br /&gt;
&lt;br /&gt;
In the past four decades, computational sociology has been introduced and gaining popularity.  This has been used primarily for modeling or building explanations of social processes and are depending on the emergence of complex behavior from simple activities.  The idea behind emergence is that properties of any bigger system do not always have to be properties of the components that the system is made of.  The people responsible for the introduction of the idea of emergence are Alexander, Morgan, and Broad, who were classical emergentists.  The time at which these emergentists came up with this concept and method was during the time of the early twentieth century.  The aim of this method was to find a good enough accommodation between two different and extreme ontologies, which were reductionist materialism and dualism. &lt;br /&gt;
&lt;br /&gt;
在过去的四十年里，计算社会学诞生并且越来越受欢迎。这主要用于建模或构建社会过程的解释，并且依赖于从简单活动中'''涌现 Emergence'''的复杂行为。涌现背后的思想是，任何较大系统不总是必须和组成系统的部分具有一样的性质。引入涌现思想的人是亚历山大 Alexander、摩根 Morgan和布罗德 Broad，他们都是'''经典涌现主义者 Classical Emergentists'''。经典涌现主义者提出这个概念和方法的时间是在二十世纪初期。这种方法的目的是在还原论的唯物主义和二元论这两种不同的本体论之间找到一个足够好的调和。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
While emergence has had a valuable and important role with the foundation of Computational Sociology, there are those who do not necessarily agree.  One major leader in the field, Epstein, doubted the use because there were aspects that are unexplainable.  Epstein put up a claim against emergentism, in which he says it &amp;quot;is precisely the generative sufficiency of the parts that constitutes the whole's explanation&amp;quot;.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
While emergence has had a valuable and important role with the foundation of Computational Sociology, there are those who do not necessarily agree.  One major leader in the field, Epstein, doubted the use because there were aspects that are unexplainable.  Epstein put up a claim against emergentism, in which he says it &amp;quot;is precisely the generative sufficiency of the parts that constitutes the whole's explanation&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
虽然涌现在计算社会学的建立上发挥了宝贵而重要的作用，但也有人不太同意。该领域的一个主要人物爱泼斯坦 Epstein对这种&amp;lt;font color='red'&amp;gt;用法&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;概念&amp;lt;/font&amp;gt;持怀疑态度，因为有些方面是这个&amp;lt;font color='red'&amp;gt;用法&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;概念&amp;lt;/font&amp;gt;无法解释的。爱泼斯坦提出了一种反对“涌现主义”的观点，他表示:“&amp;lt;font color=='red'&amp;gt;正是这些部分的有生成意义的充分性构成了对整体的解释&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;  正是这些部分所产生的充分性构成了对整体的解释&amp;lt;/font&amp;gt;”。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Agent-based models have had a historical influence on Computational Sociology.   These models first came around in the 1960s, and were used to simulate control and feedback processes in organizations, cities, etc.  During the 1970s, the application introduced the use of individuals as the main units for the analyses and used bottom-up strategies for modeling behaviors.  The last wave occurred in the 1980s.  At this time, the models were still bottom-up; the only difference is that the agents interact interdependently.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Agent-based models have had a historical influence on Computational Sociology. These models first came around in the 1960s, and were used to simulate control and feedback processes in organizations, cities, etc.  During the 1970s, the application introduced the use of individuals as the main units for the analyses and used bottom-up strategies for modeling behaviors.  The last wave occurred in the 1980s.  At this time, the models were still bottom-up; the only difference is that the agents interact interdependently.&lt;br /&gt;
&lt;br /&gt;
'''基于主体的模型 Agent-based Models'''对计算社会学有着历史性的影响。这些模型最早出现在20世纪60年代，用于仿真模拟组织、城市等系统的控制和反馈过程。在20世纪70年代，&amp;lt;font color='red'&amp;gt;应用程序&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; ABM模型&amp;lt;/font&amp;gt;引入个体作为主要的分析单元，并使用自下而上的策略来对行为建模。最后一波浪潮发生在20世纪80年代。那时，模型仍然是自下而上的; 唯一的区别是主体之间具有互相依赖和相互作用。&lt;br /&gt;
&lt;br /&gt;
===Systems theory and structural functionalism 系统理论和结构功能主义===&lt;br /&gt;
&lt;br /&gt;
{{main|Systems theory|Structural functionalism}}&lt;br /&gt;
&lt;br /&gt;
In the post-war era, [[Vannevar Bush]]'s [[differential analyser]], [[John von Neumann]]'s [[Von Neumann cellular automata|cellular automata]], [[Norbert Wiener]]'s [[cybernetics]], and [[Claude Shannon]]'s [[information theory]] became influential paradigms for modeling and understanding complexity in technical systems. In response, scientists in disciplines such as physics, biology, electronics, and economics began to articulate a [[systems theory|general theory of systems]] in which all natural and physical phenomena are manifestations of interrelated elements in a system that has common patterns and properties. Following [[Émile Durkheim]]'s call to analyze complex modern society ''[[sui generis]]'',&amp;lt;ref&amp;gt;{{cite book|first=Émile |last=Durkheim |title=The Division of Labor in Society |location=New York, NY |publisher=Macmillan}}&amp;lt;/ref&amp;gt; post-war structural functionalist sociologists such as [[Talcott Parsons]] seized upon these theories of systematic and hierarchical interaction among constituent components to attempt to generate grand unified sociological theories, such as the [[AGIL paradigm]].&amp;lt;ref name=&amp;quot;Bailey&amp;quot;&amp;gt;{{cite book|first1=Kenneth D. |last1=Bailey |editor=Jonathan H. Turner |chapter=Systems Theory |title=Handbook of Sociological Theory |publisher=Springer Science |year=2006 |location=New York, NY |isbn=978-0-387-32458-6 |pages=379–404}}&amp;lt;/ref&amp;gt; Sociologists such as [[George Homans]] argued that sociological theories should be formalized into hierarchical structures of propositions and precise terminology from which other propositions and hypotheses could be derived and operationalized into empirical studies.&amp;lt;ref name=&amp;quot;Blackwell&amp;quot;&amp;gt;{{cite encyclopedia|year=2007 |title=Computational Sociology |last=Bainbridge |first=William Sims |encyclopedia=Blackwell Encyclopedia of Sociology |publisher=Blackwell Reference Online |url=http://www.sociologyencyclopedia.com/subscriber/tocnode?id=g9781405124331_chunk_g97814051243319_ss1-85 |doi=10.1111/b.9781405124331.2007.x |hdl=10138/224218 |editor=Ritzer, George|isbn=978-1-4051-2433-1|hdl-access=free }}&amp;lt;/ref&amp;gt; Because computer algorithms and programs had been used as early as 1956 to test and validate mathematical theorems, such as the [[four color theorem]],&amp;lt;ref&amp;gt;{{cite book|last=Crevier |first=D. |year=1993 |title=AI: The Tumultuous History of the Search for Artificial Intelligence |url=https://archive.org/details/aitumultuoushist00crev |url-access=registration |publisher=Basic Books |location=New York, NY}}&amp;lt;/ref&amp;gt; some scholars anticipated that similar computational approaches could &amp;quot;solve&amp;quot; and &amp;quot;prove&amp;quot; analogously formalized problems and theorems of social structures and dynamics.&lt;br /&gt;
&lt;br /&gt;
In the post-war era, Vannevar Bush's differential analyser, John von Neumann's cellular automata, Norbert Wiener's cybernetics, and Claude Shannon's information theory became influential paradigms for modeling and understanding complexity in technical systems. In response, scientists in disciplines such as physics, biology, electronics, and economics began to articulate a general theory of systems in which all natural and physical phenomena are manifestations of interrelated elements in a system that has common patterns and properties. Following Émile Durkheim's call to analyze complex modern society sui generis, post-war structural functionalist sociologists such as Talcott Parsons seized upon these theories of systematic and hierarchical interaction among constituent components to attempt to generate grand unified sociological theories, such as the AGIL paradigm. Sociologists such as George Homans argued that sociological theories should be formalized into hierarchical structures of propositions and precise terminology from which other propositions and hypotheses could be derived and operationalized into empirical studies. Because computer algorithms and programs had been used as early as 1956 to test and validate mathematical theorems, such as the four color theorem, some scholars anticipated that similar computational approaches could &amp;quot;solve&amp;quot; and &amp;quot;prove&amp;quot; analogously formalized problems and theorems of social structures and dynamics.&lt;br /&gt;
&lt;br /&gt;
战后时期，范内瓦·布什（Vannevar Bush）的'''微分分析机 Differential Analyser''' 、冯·诺伊曼（John von Neumann）的'''元胞自动机 Cellular Automata'''、 维纳（Norbert Wiener）的'''控制论 Cybernetics'''和克劳德·香农（Claude Shannon）的'''信息论 Information Theory'''成为技术系统中建模和理解复杂性的重要范式。物理学、生物学、电子学和经济学等学科的科学家开始阐述系统的一般理论，即所有自然和物理现象都是具有共同模式和属性的系统中相互关联的元素的表现。&amp;lt;font color='red'&amp;gt;按照 &amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 沿着&amp;lt;/font&amp;gt;涂尔干（Émile Durkheim）分析特定的复杂现代社会&lt;br /&gt;
&lt;br /&gt;
（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]）Following Émile Durkheim's call to analyze complex modern society sui generis）&lt;br /&gt;
  --~~克劳德·香农（Claude Shannon）  这些同样去括号&lt;br /&gt;
&lt;br /&gt;
的&amp;lt;font color='red'&amp;gt;要求&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 思路&amp;lt;/font&amp;gt;，战后结构功能主义社会学家如帕森斯（Talcott Parsons）利用这些组成部分之间系统&amp;lt;font color='blue'&amp;gt;化&amp;lt;/font&amp;gt;和&amp;lt;font color='red'&amp;gt;等级&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 层次化&amp;lt;/font&amp;gt;相互作用的理论，试图产生大统一的社会学理论，如 AGIL 范式。霍曼斯（George Homans）等社会学家认为，社会学理论应该被构建为具有&amp;lt;font color='blue'&amp;gt;逻辑&amp;lt;/font&amp;gt;命题和精确术语的&amp;lt;font color='red'&amp;gt;等级&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 层次化&amp;lt;/font&amp;gt;结构，并且从中可以得出能够在实证研究中被操作化的其他命题和假设。由于早在1956年计算机算法和程序就已经被用来测试和验证数学定理（如'''四色定理Four Color Theorem'''），&amp;lt;font color='red'&amp;gt;一些学者预计相似的计算方法可以“解决”和“证明”类似的社会结构和动态的问题和定理。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 一些学者预计相似的计算方法可以“解释”和“证明”关于社会结构和演变的类似形式化的问题和定理。&amp;lt;/font&amp;gt;&lt;br /&gt;
--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|讨论]]formalized应该也要翻译出来，computational证明的是形式化定理)&lt;br /&gt;
&lt;br /&gt;
===Macrosimulation and microsimulation 宏观模拟和微观模拟===&lt;br /&gt;
&lt;br /&gt;
{{main|System dynamics|Microsimulation}}&lt;br /&gt;
&lt;br /&gt;
By the late 1960s and early 1970s, social scientists used increasingly available computing technology to perform macro-simulations of control and feedback processes in organizations, industries, cities, and global populations. These models used differential equations to predict population distributions as holistic functions of other systematic factors such as inventory control, urban traffic, migration, and disease transmission.&amp;lt;ref&amp;gt;{{cite book|first=Jay |last=Forrester |year=1971 |title=World Dynamics |location=Cambridge, MA |publisher=MIT Press}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|doi=10.1287/opre.26.2.237|title=Using Simulation to Develop and Validate Analytic Models: Some Case Studies |first1=Edward J. |last1=Ignall |first2=Peter |last2=Kolesar |first3=Warren E. |last3=Walker |journal=Operations Research |volume=26 |issue=2 |year=1978 |pages=237–253}}&amp;lt;/ref&amp;gt; Although simulations of social systems received substantial attention in the mid-1970s after the [[Club of Rome]] published reports predicting that policies promoting exponential economic growth would eventually bring global environmental catastrophe,&amp;lt;ref&amp;gt;{{cite book|title=The Dynamics of Growth in a Finite World |last1=Meadows |first1=DL |last2=Behrens |first2=WW |last3=Meadows |first3=DH |last4=Naill |first4=RF |last5= Randers |first5=J |last6=Zahn |first6=EK |year=1974 |location=Cambridge, MA |publisher=MIT Press}}&amp;lt;/ref&amp;gt; the inconvenient conclusions led many authors to seek to discredit the models, attempting to make the researchers themselves appear unscientific.&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;/&amp;gt;&amp;lt;ref&amp;gt;{{cite news|title=Computer View of Disaster Is Rebutted |newspaper=The New York Times |date=October 18, 1974|url=https://www.nytimes.com/1974/10/18/archives/computer-view-of-disaster-is-rebutted.html?_r=0}}&amp;lt;/ref&amp;gt; Hoping to avoid the same fate, many social scientists turned their attention toward micro-simulation models to make forecasts and study policy effects by modeling aggregate changes in state of individual-level entities rather than the changes in distribution at the population level.&amp;lt;ref&amp;gt;{{cite journal|doi=10.1016/0167-2681(90)90038-F|title=From engineering to microsimulation : An autobiographical reflection |journal=Journal of Economic Behavior &amp;amp; Organization |year=1990 |volume=14 |issue=1 |pages=5–27 |first=Guy H. |last=Orcutt}}&amp;lt;/ref&amp;gt; However, these micro-simulation models did not permit individuals to interact or adapt and were not intended for basic theoretical research.&amp;lt;ref name=&amp;quot;MW&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
By the late 1960s and early 1970s, social scientists used increasingly available computing technology to perform macro-simulations of control and feedback processes in organizations, industries, cities, and global populations. These models used differential equations to predict population distributions as holistic functions of other systematic factors such as inventory control, urban traffic, migration, and disease transmission. Although simulations of social systems received substantial attention in the mid-1970s after the Club of Rome published reports predicting that policies promoting exponential economic growth would eventually bring global environmental catastrophe, the inconvenient conclusions led many authors to seek to discredit the models, attempting to make the researchers themselves appear unscientific. Hoping to avoid the same fate, many social scientists turned their attention toward micro-simulation models to make forecasts and study policy effects by modeling aggregate changes in state of individual-level entities rather than the changes in distribution at the population level. However, these micro-simulation models did not permit individuals to interact or adapt and were not intended for basic theoretical research.&lt;br /&gt;
&lt;br /&gt;
截至20世纪60年代末70年代初，社会科学家越来越多地使用已有的计算技术，&amp;lt;s&amp;gt;在&amp;lt;/s&amp;gt;&amp;lt;font color='blue'&amp;gt;对&amp;lt;/font&amp;gt;组织、工业、城市和全球人口&amp;lt;s&amp;gt;中&amp;lt;/s&amp;gt;进行&amp;lt;font color='blue'&amp;gt;包含&amp;lt;/font&amp;gt;控制和反馈过程的'''宏观模拟 Macrosimulation''' 。这些模型使用微分方程作为其他系统因素的整体函数来预测人口分布，这些系统因素包括&amp;lt;font color='red'&amp;gt;库存&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 财产&amp;lt;/font&amp;gt;控制、城市交通、人口迁移和疾病传播等。&amp;lt;font color='red'&amp;gt;20世纪70年代中期，'''罗马俱乐部 Club of Rome''' 发表报告预测，促进指数式经济增长的政策最终将导致全球环境灾难，这个悲观的结论导致许多研究者试图反驳这些模型，并试图让研究显得不那么科学。&amp;lt;/font&amp;gt;&lt;br /&gt;
  （--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） 根据意思，inconvenient译为悲观的，因为这个结论预示了悲观的未来，所以令指出这一点的科学家们感到inconvenient）&lt;br /&gt;
  （--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟树|讨论]]） inconvenient的翻译没问题，不过好像缺失了Although simulations of social systems received substantial attention）&lt;br /&gt;
&amp;lt;font color='blue'&amp;gt; 20世纪70年代中期，尽管对社会系统的仿真获得了巨大的关注，但在'''罗马俱乐部 Club of Rome''' 发布预测报告称促进指数式经济增长的政策最终将导致全球环境灾难，这个悲观的结论导致许多研究者尝试抹黑这些(仿真)模型，并试图让(这些模型的)研究者自身显得不那么科学。&amp;lt;/font&amp;gt;&lt;br /&gt;
为了避免同样的情况，许多社会科学家将注意力转向'''微观模拟 Microsimulation'''模型。这些模型通过模拟个体状态的总体变化而不是总体人口级别的&amp;lt;font color='blue'&amp;gt;分布&amp;lt;/font&amp;gt;变化来进行预测和研究政策的效果。然而，这些微观模拟模型并不允许个体相互作用或适应、变化（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]）变化是根据适应（adapt）加上去的，不知道是否合理--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|讨论]]）我觉得ok），研究者也不打算将它们用于基础理论研究。&lt;br /&gt;
&lt;br /&gt;
===Cellular automata and agent-based modeling 元胞自动机和基于主体建模===&lt;br /&gt;
&lt;br /&gt;
{{main|Cellular automata|agent-based modeling}}&lt;br /&gt;
&lt;br /&gt;
The 1970s and 1980s were also a time when physicists and mathematicians were attempting to model and analyze how simple component units, such as atoms, give rise to global properties, such as complex material properties at low temperatures, in magnetic materials, and within turbulent flows.&amp;lt;ref&amp;gt;{{cite book|title=Cellular automata machines: a new environment for modeling |url=https://archive.org/details/cellularautomata00toff |url-access=registration |first1=Tommaso |last1=Toffoli |first2=Norman |last2=Margolus | author2-link = Norman Margolus |year=1987 |publisher=MIT Press |location=Cambridge, MA}}&amp;lt;/ref&amp;gt; Using cellular automata, scientists were able to specify systems consisting of a grid of cells in which each cell only occupied some finite states and changes between states were solely governed by the states of immediate neighbors. Along with advances in [[artificial intelligence]] and [[microcomputer]] power, these methods contributed to the development of &amp;quot;[[chaos theory]]&amp;quot; and &amp;quot;[[complex systems|complexity theory]]&amp;quot; which, in turn, renewed interest in understanding complex physical and social systems across disciplinary boundaries.&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;/&amp;gt; Research organizations explicitly dedicated to the interdisciplinary study of complexity were also founded in this era: the [[Santa Fe Institute]] was established in 1984 by scientists based at [[Los Alamos National Laboratory]] and the BACH group at the [[University of Michigan]] likewise started in the mid-1980s.&lt;br /&gt;
&lt;br /&gt;
The 1970s and 1980s were also a time when physicists and mathematicians were attempting to model and analyze how simple component units, such as atoms, give rise to global properties, such as complex material properties at low temperatures, in magnetic materials, and within turbulent flows. Using cellular automata, scientists were able to specify systems consisting of a grid of cells in which each cell only occupied some finite states and changes between states were solely governed by the states of immediate neighbors. Along with advances in artificial intelligence and microcomputer power, these methods contributed to the development of &amp;quot;chaos theory&amp;quot; and &amp;quot;complexity theory&amp;quot; which, in turn, renewed interest in understanding complex physical and social systems across disciplinary boundaries. Research organizations explicitly dedicated to the interdisciplinary study of complexity were also founded in this era: the Santa Fe Institute was established in 1984 by scientists based at Los Alamos National Laboratory and the BACH group at the University of Michigan likewise started in the mid-1980s.&lt;br /&gt;
&lt;br /&gt;
20世纪70年代和80年代，物理学家和数学家也在试图模拟和分析简单的组成单位如何产生整体特性，比如低温环境中原子在磁性材料和湍流中的复杂材料特性。使用'''元胞自动机 Cellular Automata'''，科学家们能够指定由元胞网格组成的系统，其中每个元胞只占据一些有限的状态，状态之间的变化完全由相邻元胞的状态控制。随着人工智能和微型计算机能力的进步，这些方法促进了“混沌理论”和“复杂性理论”的发展，这反过来又重新引起了人们对跨学科的复杂物理和社会系统的兴趣。明确致力于跨学科复杂性研究的机构也是在这个时代成立的: 圣菲研究所是由美国洛斯阿拉莫斯国家实验室（Los Alamos National Laboratory）的科学家于1984年建立的，密歇根大学的 BACH 小组也是在20世纪80年代中期建立的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This cellular automata paradigm gave rise to a third wave of social simulation emphasizing agent-based modeling. Like micro-simulations, these models emphasized bottom-up designs but adopted four key assumptions that diverged from microsimulation: autonomy, interdependency, simple rules, and adaptive behavior.&amp;lt;ref name=&amp;quot;MW&amp;quot;/&amp;gt; Agent-based models are less concerned with predictive accuracy and instead emphasize theoretical development.&amp;lt;ref&amp;gt;{{cite journal |title=A simulation of the structure of academic science |journal=Sociological Research Online |volume=2 |issue=2 |pages=1–15 |year=1997 |first=Nigel |last=Gilbert |url=http://www.socresonline.org.uk/socresonline/2/2/3.html |doi=10.5153/sro.85 |access-date=2009-12-16 |archive-url=https://web.archive.org/web/19980524062306/http://www.socresonline.org.uk/socresonline/2/2/3.html |archive-date=1998-05-24 |url-status=dead }}&amp;lt;/ref&amp;gt; In 1981, mathematician and political scientist [[Robert Axelrod]] and evolutionary biologist [[W.D. Hamilton]] published a major paper in ''[[Science (journal)|Science]]'' titled &amp;quot;The Evolution of Cooperation&amp;quot; which used an agent-based modeling approach to demonstrate how social cooperation based upon reciprocity can be established and stabilized in a [[prisoner's dilemma]] game when agents followed simple rules of self-interest.&amp;lt;ref&amp;gt;{{cite journal|title=The Evolution of Cooperation |first1=Robert |last1=Axelrod |first2=William D. |last2=Hamilton |journal=Science |volume=211 |issue=4489 |pages=1390–1396 |doi=10.1126/science.7466396|pmid=7466396 |date=March 27, 1981|bibcode=1981Sci...211.1390A }}&amp;lt;/ref&amp;gt; Axelrod and Hamilton demonstrated that individual agents following a simple rule set of (1) cooperate on the first turn and (2) thereafter replicate the partner's previous action were able to develop &amp;quot;norms&amp;quot; of cooperation and sanctioning in the absence of canonical sociological constructs such as demographics, values, religion, and culture as preconditions or mediators of cooperation.&amp;lt;ref name=&amp;quot;Cooperation&amp;quot;/&amp;gt; Throughout the 1990s, scholars like [[William Sims Bainbridge]], [[Kathleen Carley]], [[Michael Macy]],  and [[John Skvoretz]] developed multi-agent-based models of [[generalized reciprocity]], [[prejudice]], [[social influence]], and organizational [[information processing]]. In 1999, [[Nigel Gilbert]] published the first textbook on Social Simulation: ''Simulation for the social scientist'' and established its most relevant journal: the [[Journal of Artificial Societies and Social Simulation]].&lt;br /&gt;
&lt;br /&gt;
This cellular automata paradigm gave rise to a third wave of social simulation emphasizing agent-based modeling. Like micro-simulations, these models emphasized bottom-up designs but adopted four key assumptions that diverged from microsimulation: autonomy, interdependency, simple rules, and adaptive behavior. In 1981, mathematician and political scientist Robert Axelrod and evolutionary biologist W.D. Hamilton published a major paper in Science titled &amp;quot;The Evolution of Cooperation&amp;quot; which used an agent-based modeling approach to demonstrate how social cooperation based upon reciprocity can be established and stabilized in a prisoner's dilemma game when agents followed simple rules of self-interest. Axelrod and Hamilton demonstrated that individual agents following a simple rule set of (1) cooperate on the first turn and (2) thereafter replicate the partner's previous action were able to develop &amp;quot;norms&amp;quot; of cooperation and sanctioning in the absence of canonical sociological constructs such as demographics, values, religion, and culture as preconditions or mediators of cooperation. Throughout the 1990s, scholars like William Sims Bainbridge, Kathleen Carley, Michael Macy,  and John Skvoretz developed multi-agent-based models of generalized reciprocity, prejudice, social influence, and organizational information processing. In 1999, Nigel Gilbert published the first textbook on Social Simulation: Simulation for the social scientist and established its most relevant journal: the Journal of Artificial Societies and Social Simulation.&lt;br /&gt;
&lt;br /&gt;
元胞自动机范式引发了强调'''基于主体建模 Agent-based Modeling'''的第三次社会模拟浪潮。与微观模拟一样，这些模型强调自下而上的设计，但采用了与微观模拟不同的四个关键假设: '''自主性 Autonomy'''、'''相互依赖性 Interdependency'''、'''简单规则 Simple Rules'''和'''适应性行为 Adaptive Behavior'''。1981年，数学家、政治学家阿克塞尔罗德（Robert Axelrod）和进化生物学家汉密尔顿（W.D. Hamilton）在《科学》杂志上发表了一篇名为《合作的进化》（The Evolution of Cooperation）的重要论文，该论文采用基于主体建模方法，论证了在一个囚徒困境中，当主体遵循简单的自利规则时，互惠的社会合作是如何建立和稳定的。阿克塞尔罗德和汉密尔顿证明，主体遵循这样一套简单的规则: (1)在第一轮进行合作，(2)在其后重复伙伴以前的行动，能够在没有人口学差异、价值观、宗教和文化等社会规范作为合作的先决条件或中介的情况下制定合作和制裁的“规范”。整个20世纪90年代，像威廉·希姆斯·本布里奇（William Sims Bainbridge），Kathleen Carley，Michael Macy 和 John Skvoretz 这样的学者开发了基于多主体的广义互惠、偏见、社会影响和组织信息处理模型。1999年，吉尔伯特（Nigel Gilbert）出版了第一本关于社会模拟: 写给社会科学家的仿真模拟（Simulation for the social scientist）的教科书，并建立了它最相关的杂志: 人工社会和社会模拟杂志（the Journal of Artificial Societies and Social Simulation）。&lt;br /&gt;
&lt;br /&gt;
===Data mining and social network analysis 数据挖掘和社会网络分析===&lt;br /&gt;
&lt;br /&gt;
{{main|Data mining|Social network analysis}}&lt;br /&gt;
&lt;br /&gt;
--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） 少一段原文 &lt;br /&gt;
Independent from developments in computational models of social systems, social network analysis emerged in the 1970s and 1980s from advances in graph theory, statistics, and studies of social structure as a distinct analytical method and was articulated and employed by sociologists like James S. Coleman, Harrison White, Linton Freeman, J. Clyde Mitchell, Mark Granovetter, Ronald Burt, and Barry Wellman.[22] The increasing pervasiveness of computing and telecommunication technologies throughout the 1980s and 1990s demanded analytical techniques, such as network analysis and multilevel modeling, that could scale to increasingly complex and large data sets. The most recent wave of computational sociology, rather than employing simulations, uses network analysis and advanced statistical techniques to analyze large-scale computer databases of electronic proxies for behavioral data. Electronic records such as email and instant message records, hyperlinks on the World Wide Web, mobile phone usage, and discussion on Usenet allow social scientists to directly observe and analyze social behavior at multiple points in time and multiple levels of analysis without the constraints of traditional empirical methods such as interviews, participant observation, or survey instruments.[23] Continued improvements in machine learning algorithms likewise have permitted social scientists and entrepreneurs to use novel techniques to identify latent and meaningful patterns of social interaction and evolution in large electronic datasets.[24][25]&lt;br /&gt;
&lt;br /&gt;
Independent from developments in computational models of social systems, social network analysis emerged in the 1970s and 1980s from advances in graph theory, statistics, and studies of social structure as a distinct analytical method and was articulated and employed by sociologists like [[James Samuel Coleman|James S. Coleman]], [[Harrison White]], [[Linton Freeman]], [[J. Clyde Mitchell]], [[Mark Granovetter]], [[Ronald Burt]], and [[Barry Wellman]].&amp;lt;ref&amp;gt;{{cite book|title=The Development of Social Network Analysis: A Study in the Sociology of Science |first=Linton C. |last=Freeman |publisher=Empirical Press |location=Vancouver, BC |year=2004}}&amp;lt;/ref&amp;gt; The increasing pervasiveness of computing and telecommunication technologies throughout the 1980s and 1990s demanded analytical techniques, such as [[network theory|network analysis]] and [[multilevel modeling]], that could scale to increasingly complex and large data sets. The most recent wave of computational sociology, rather than employing simulations, uses network analysis and advanced statistical techniques to analyze large-scale computer databases of electronic proxies for behavioral data. Electronic records such as email and instant message records, hyperlinks on the [[World Wide Web]], mobile phone usage, and discussion on [[Usenet]] allow social scientists to directly observe and analyze social behavior at multiple points in time and multiple levels of analysis without the constraints of traditional empirical methods such as interviews, participant observation, or survey instruments.&amp;lt;ref&amp;gt;{{cite journal|title=Life in the network: the coming age of computational social science|first9=J|last10=Gutmann|first10=M.|last11=Jebara|first11=T.|last12=King|first12=G.|last13=Macy|first13=M.|last14=Roy|first14=D.|last15=Van Alstyne|first15=M.|last9=Fowler|first8=N|last8=Contractor|first7=N|last7=Christakis|first6=D|last6=Brewer|first5=AL|last5=Barabasi|first4=S |journal=Science|last4=Aral |date=February 6, 2009|first3=L |volume=323|pmid=19197046 |issue=5915|last3=Adamic |pages=721–723|pmc=2745217 |doi=10.1126/science.1167742 |first1=David |last1=Lazer |first2=Alex |last2=Pentland |display-authors=8}}&amp;lt;/ref&amp;gt; Continued improvements in [[machine learning]] algorithms likewise have permitted social scientists and entrepreneurs to use novel techniques to identify latent and meaningful patterns of social interaction and evolution in large electronic datasets.&amp;lt;ref&amp;gt;{{cite journal|first1=Jaideep |last1=Srivastava |first2=Robert |last2=Cooley |first3=Mukund |last3=Deshpande |first4=Pang-Ning |last4=Tan |journal=Proceedings of the ACM Conference on Knowledge Discovery and Data Mining |title=Web usage mining: discovery and applications of usage patterns from Web data|volume=1 |year=2000 |pages=12–23 |doi=10.1145/846183.846188|issue=2}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|doi=10.1016/S0169-7552(98)00110-X|title=The anatomy of a large-scale hypertextual Web search engine |first1=Sergey |last1=Brin |first2=Lawrence |last2=Page |journal=Computer Networks and ISDN Systems |volume=30 |issue=1–7 |pages=107–117 |date=April 1998|citeseerx=10.1.1.115.5930 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Independent from developments in computational models of social systems, social network analysis emerged in the 1970s and 1980s from advances in graph theory, statistics, and studies of social structure as a distinct analytical method and was articulated and employed by sociologists like James S. Coleman, Harrison White, Linton Freeman, J. Clyde Mitchell, Mark Granovetter, Ronald Burt, and Barry Wellman. The increasing pervasiveness of computing and telecommunication technologies throughout the 1980s and 1990s demanded analytical techniques, such as network analysis and multilevel modeling, that could scale to increasingly complex and large data sets. The most recent wave of computational sociology, rather than employing simulations, uses network analysis and advanced statistical techniques to analyze large-scale computer databases of electronic proxies for behavioral data. Electronic records such as email and instant message records, hyperlinks on the World Wide Web, mobile phone usage, and discussion on Usenet allow social scientists to directly observe and analyze social behavior at multiple points in time and multiple levels of analysis without the constraints of traditional empirical methods such as interviews, participant observation, or survey instruments. Continued improvements in machine learning algorithms likewise have permitted social scientists and entrepreneurs to use novel techniques to identify latent and meaningful patterns of social interaction and evolution in large electronic datasets.&lt;br /&gt;
&lt;br /&gt;
'''社会网络分析 Social Network Analysis'''独立于社会系统计算模型的发展，在20世纪70年代和80年代出现于图论、统计学和社会结构的研究中，它作为一种独特的分析方法被社会学家如 James s. Coleman，Harrison White，Linton Freeman，J. Clyde Mitchell，Mark Granovetter，Ronald Burt 和 Barry Wellman 等阐述和采用。在整个1980年代和1990年代，计算和通信技术日益普及，这要求采用诸如网络分析和多级建模等分析技术，这些技术可以扩展到日益复杂和庞大的数据集中。最近的计算社会学没有使用模拟，而是使用网络分析和先进的统计技术来分析大规模计算机数据库中电子代理的行为数据。电子记录，如电子邮件和即时消息记录，万维网上的超链接，移动电话数据，以及 Usenet 上的讨论，使社会科学家能够直接观察社会行为并在多个时间点和多个层次的分析行为，并且不受传统的实证方法，如访谈、观察（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]）为了通顺，删除研究对象/被试：participants）或调查工具的限制。机器学习算法的不断改进同样使得社会科学家和企业家能够使用新技术来识别大型电子数据集中潜在但有意义的社会互动和演化模式。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:Tripletsnew2012.png|thumb|right|Narrative network of US Elections 2012&amp;lt;ref name=&amp;quot;ReferenceA&amp;quot;&amp;gt;{{cite journal|title=Automated analysis of the US presidential elections using Big Data and network analysis|author1=S Sudhahar|author2=GA Veltri|author3=N Cristianini|journal=Big Data &amp;amp; Society|volume=2|issue=1|pages=1–28|year=2015|doi=10.1177/2053951715572916|doi-access=free}}&amp;lt;/ref&amp;gt;]]&lt;br /&gt;
&lt;br /&gt;
Narrative network of US Elections 2012&lt;br /&gt;
&lt;br /&gt;
【图2：Narrative network of US Elections 2012 + 2012年美国大选叙事网络】&lt;br /&gt;
&lt;br /&gt;
The automatic parsing of textual corpora has enabled the extraction of actors and their relational networks on a vast scale, turning textual data into network data.  The resulting networks, which can contain thousands of nodes, are then analysed by using tools from Network theory to identify the key actors, the key communities or parties, and general properties such as robustness or structural stability of the overall network, or centrality of certain nodes.&amp;lt;ref&amp;gt;{{cite journal|title=Network analysis of narrative content in large corpora|author1=S Sudhahar|author2=G De Fazio|author3=R Franzosi|author4=N Cristianini|journal=Natural Language Engineering|volume=21|issue=1|pages=1–32|year=2013|doi=10.1017/S1351324913000247 |url=https://research-information.bristol.ac.uk/files/129621186/Network_Analysis_of_Narrative_Content_in_Large_Corpora.pdf}}&amp;lt;/ref&amp;gt; This automates the approach introduced by quantitative narrative analysis,&amp;lt;ref&amp;gt;{{cite book|title=Quantitative Narrative Analysis|last=Franzosi|first=Roberto|publisher=Emory University|year=2010}}&amp;lt;/ref&amp;gt; whereby subject-verb-object triplets are identified with pairs of actors linked by an action, or pairs formed by actor-object.&amp;lt;ref name=&amp;quot;ReferenceA&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The automatic parsing of textual corpora has enabled the extraction of actors and their relational networks on a vast scale, turning textual data into network data.  The resulting networks, which can contain thousands of nodes, are then analysed by using tools from Network theory to identify the key actors, the key communities or parties, and general properties such as robustness or structural stability of the overall network, or centrality of certain nodes. This automates the approach introduced by quantitative narrative analysis, whereby subject-verb-object triplets are identified with pairs of actors linked by an action, or pairs formed by actor-object.&lt;br /&gt;
&lt;br /&gt;
文本语料库的自动解析使对参与者及其关系网络的大规模提取成为可能，它将文本数据转换为网络数据。由此产生的网络可以包含数千个'''节点 Nodes'''，然后利用网络理论中的工具对其进行分析，以确定关键参与者、关键群体，以及网络的总体特性如稳健性、结构稳定性，或某些节点的'''中心性 Centrality'''等。这使'''定量叙事分析Quantitative Narrative Analysis'''引入的方法得以自动化，据此，主语-动词-宾语三元组被看作由动作连接的成对行为者，或者由行为者-宾语形成的成对行为者。&lt;br /&gt;
&lt;br /&gt;
===Computational content analysis 计算机内容分析 （名词翻译可吗？）===&lt;br /&gt;
&lt;br /&gt;
[[Content analysis]] has been a traditional part of social sciences and media studies for a long time. The automation of content analysis has allowed a &amp;quot;[[big data]]&amp;quot; revolution to take place in that field, with studies in social media and newspaper content that include millions of news items. [[Gender bias]], [[readability]], content similarity, reader preferences, and even mood have been analyzed based on [[text mining]] methods over millions of documents.&amp;lt;ref&amp;gt;{{cite journal|author1=I. Flaounas|author2=M. Turchi|author3=O. Ali|author4=N. Fyson|author5=T. De Bie|author6=N. Mosdell|author7=J. Lewis|author8=N. Cristianini|title=The Structure of EU Mediasphere|journal=PLOS One|volume=5|issue=12|pages=e14243|year=2010|doi=10.1371/journal.pone.0014243|url=https://orca-mwe.cf.ac.uk/50732/1/Flaounas%202010.pdf|pmid=21170383|pmc=2999531|bibcode=2010PLoSO...514243F}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|title=Nowcasting Events from the Social Web with Statistical Learning|author1=V Lampos|author2=N Cristianini|journal=ACM Transactions on Intelligent Systems and Technology |volume=3|issue=4|page=72|doi=10.1145/2337542.2337557|year=2012|url=http://www.lampos.net/sites/default/files/papers/lampos2012nowcasting.pdf}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite conference|title=NOAM: news outlets analysis and monitoring system|author1=I. Flaounas|author2=O. Ali|author3=M. Turchi|author4=T Snowsill|author5=F Nicart|author6=T De Bie|author7=N Cristianini|conference=Proc. of the 2011 ACM SIGMOD international conference on Management of data|year=2011|url=http://www.tijldebie.net/system/files/SIGMOD_11_demo_Ilias.pdf|doi=10.1145/1989323.1989474}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite book|author=N Cristianini|title=''Combinatorial Pattern Matching''|pages=2–13|year=2011|volume=6661|series= Lecture Notes in Computer Science|isbn=978-3-642-21457-8|doi=10.1007/978-3-642-21458-5_2|chapter=Automatic Discovery of Patterns in Media Content|citeseerx=10.1.1.653.9525}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite journal|last=Lansdall-Welfare|first=Thomas|last2=Sudhahar|first2=Saatviga|last3=Thompson|first3=James|last4=Lewis|first4=Justin|last5=Team|first5=FindMyPast Newspaper|last6=Cristianini|first6=Nello|date=2017-01-09|title=Content analysis of 150 years of British periodicals|url=http://www.pnas.org/content/early/2017/01/03/1606380114|journal=Proceedings of the National Academy of Sciences|volume=114|issue=4|language=en|pages=E457–E465|doi=10.1073/pnas.1606380114|issn=0027-8424|pmid=28069962|pmc=5278459}}&amp;lt;/ref&amp;gt; The analysis of readability, gender bias and topic bias was demonstrated in Flaounas et al.&amp;lt;ref&amp;gt;{{cite journal|author1=I. Flaounas|author2=O. Ali|author3=M. Turchi|author4=T. Lansdall-Welfare|author5=T. De Bie|author6=N. Mosdell|author7=J. Lewis|author8=N. Cristianini|title=Research methods in the age of digital journalism|journal=Digital Journalism|year=2012|doi=10.1080/21670811.2012.714928|volume=1|pages=102–116}}&amp;lt;/ref&amp;gt; showing how different topics have different gender biases and levels of readability; the possibility to detect mood shifts in a vast population by analysing Twitter content was demonstrated as well.&amp;lt;ref&amp;gt;{{cite conference|title=Effects of the Recession on Public Mood in the UK|author=T Lansdall-Welfare|author2=V Lampos|author3=N Cristianini|series=Mining Social Network Dynamics (MSND) session on Social Media Applications|doi=10.1145/2187980.2188264|conference=Proceedings of the 21st International Conference on World Wide Web|pages=1221–1226|location=New York, NY, USA|url=http://www.cs.bris.ac.uk/Publications/Papers/2001521.pdf}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Content analysis has been a traditional part of social sciences and media studies for a long time. The automation of content analysis has allowed a &amp;quot;big data&amp;quot; revolution to take place in that field, with studies in social media and newspaper content that include millions of news items. Gender bias, readability, content similarity, reader preferences, and even mood have been analyzed based on text mining methods over millions of documents. The analysis of readability, gender bias and topic bias was demonstrated in Flaounas et al. showing how different topics have different gender biases and levels of readability; the possibility to detect mood shifts in a vast population by analysing Twitter content was demonstrated as well.&lt;br /&gt;
&lt;br /&gt;
长期以来，内容分析一直是社会科学和媒体研究的传统方法。内容分析的自动化使得这一领域发生了一场“大数据”革命，这些研究中，社交媒体和报纸内容包括了数百万条的新闻。基于文本挖掘方法，'''性别偏差Gender Bias'''、'''可读性 Readability'''、'''内容相似度 Content Similarity'''、'''读者偏好 Reader Preferences'''，甚至是'''情绪 Mood'''的数以百万计的文档都可以被分析。Flaounas等人对可读性、性别偏差和'''话题偏差 Topic Bias'''为主要研究对象，展示了不同的话题如何有不同水平的性别偏差和可读性; 展示了通过分析推特内容来检测人群情绪变化的可能性。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The analysis of vast quantities of historical newspaper content has been pioneered by Dzogang et al.,&amp;lt;ref&amp;gt;{{Cite journal|last=Dzogang|first=Fabon|last2=Lansdall-Welfare|first2=Thomas|last3=Team|first3=FindMyPast Newspaper|last4=Cristianini|first4=Nello|date=2016-11-08|title=Discovering Periodic Patterns in Historical News|journal=PLOS One|volume=11|issue=11|pages=e0165736|doi=10.1371/journal.pone.0165736|issn=1932-6203|pmc=5100883|pmid=27824911|bibcode=2016PLoSO..1165736D}}&amp;lt;/ref&amp;gt; which showed how periodic structures can be automatically discovered in historical newspapers. A similar analysis was performed on social media, again revealing strongly periodic structures.&amp;lt;ref&amp;gt;[https://core.ac.uk/download/pdf/83929129.pdf Seasonal Fluctuations in Collective Mood Revealed by Wikipedia Searches and Twitter Posts] F Dzogang, T Lansdall-Welfare, N Cristianini - 2016 IEEE International Conference on Data Mining, Workshop on ''Data Mining'' in Human Activity Analysis&lt;br /&gt;
&lt;br /&gt;
The analysis of vast quantities of historical newspaper content has been pioneered by Dzogang et al., which showed how periodic structures can be automatically discovered in historical newspapers. A similar analysis was performed on social media, again revealing strongly periodic structures.&amp;lt;ref&amp;gt;[https://core.ac.uk/download/pdf/83929129.pdf Seasonal Fluctuations in Collective Mood Revealed by Wikipedia Searches and Twitter Posts] F Dzogang, T Lansdall-Welfare, N Cristianini - 2016 IEEE International Conference on Data Mining, Workshop on Data Mining in Human Activity Analysis&lt;br /&gt;
&lt;br /&gt;
对大量历史报纸内容的分析是由 Dzogang 等人率先进行的，他们展示了如何在历史报纸中自动发现'''周期结构 Periodic Structures'''。一个类似的社交媒体上进行的分析，也揭示了强烈的周期性结构。 参考文献[ https://core.ac.uk/download/pdf/83929129.pdf 维基百科搜索和推特帖子揭示的集体情绪的季节性波动] f Dzogang，t Lansdall-Welfare，n Cristianini-2016 IEEE International Conference on Data Mining, Workshop on Data Mining in Human Activity Analysis&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
==Challenges 挑战==&lt;br /&gt;
&lt;br /&gt;
Computational sociology, as with any field of study, faces a set of challenges.&amp;lt;ref name=&amp;quot;MCSS&amp;quot;&amp;gt;Conte, Rosaria, et al. &amp;quot;[https://link.springer.com/content/pdf/10.1140%252Fepjst%252Fe2012-01697-8.pdf Manifesto of computational social science].&amp;quot; The European Physical Journal Special Topics 214.1 (2012): 325-346.&amp;lt;/ref&amp;gt; These challenges need to be handled meaningfully so as to make the maximum impact on society.&lt;br /&gt;
&lt;br /&gt;
Computational sociology, as with any field of study, faces a set of challenges. These challenges need to be handled meaningfully so as to make the maximum impact on society.&lt;br /&gt;
&lt;br /&gt;
计算社会学和其他研究领域一样面临着一系列的挑战。必须有意义地处理这些挑战（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） meaningfully怎么翻译才比较通顺？），才能对社会产生最大的影响。&lt;br /&gt;
  &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Levels and their interactions 层级和层级的交互关系===&lt;br /&gt;
&lt;br /&gt;
Each society that is formed tends to be in one level or the other and there exists tendencies of interactions between and across these levels. Levels need not only be micro-level or macro-level in nature. There can be intermediate levels in which a society exists say - groups, networks, communities etc.&amp;lt;ref name=&amp;quot;MCSS&amp;quot; /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Each society that is formed tends to be in one level or the other and there exists tendencies of interactions between and across these levels. Levels need not only be micro-level or macro-level in nature. There can be intermediate levels in which a society exists say - groups, networks, communities etc.&lt;br /&gt;
&lt;br /&gt;
形成的每个社会都处于某种层次上，并且这些层次之间有相互作用的倾向。社会中的级别不仅可以分为微观或宏观的层次，还可以存在中间的层次，比如群体、网络、社区等。&lt;br /&gt;
（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） 合并了英文的原句）&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The question however arises as to how to identify these levels and how they come into existence? And once they are in existence how do they interact within themselves and with other levels?&lt;br /&gt;
&lt;br /&gt;
The question however arises as to how to identify these levels and how they come into existence? And once they are in existence how do they interact within themselves and with other levels?&lt;br /&gt;
&lt;br /&gt;
然而问题是，这些层次是如何确定的以及如何产生的？并且，一旦它们产生了，它们如何在自身内部以及与其他层次相互作用？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
If we view entities (agents) as nodes and the connections between them as the edges, we see the formation of networks. The connections in these networks do not come about based on just objective relationships between the entities, rather they are decided upon by factors chosen by the participating entities.&amp;lt;ref&amp;gt;{{cite journal|last1=Egu´ıluz|first1=V. M.|last2=Zimmermann|first2=M. G.|last3=Cela-Conde|first3=C. J.|last4=San Miguel|first4=M.|title=American Journal of Sociology|issue=2005|pages=110, 977}}&amp;lt;/ref&amp;gt; The challenge with this process is that, it is difficult to identify when a set of entities will form a network. These networks may be of trust networks, co-operation networks, dependence networks etc. There have been cases where heterogeneous set of entities have shown to form strong and meaningful networks among themselves.&amp;lt;ref&amp;gt;{{cite journal|last1=Sichman|first1=J. S.|last2=Conte|first2=R.|title=Computational &amp;amp; Mathematical Organization Theory|issue=2002|pages=8(2)}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Ehrhardt|first1=G.|last2=Marsili|first2=M.|last3=Vega-Redondo|first3=F.|title=Physical Review E|issue=2006|pages=74(3)}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
If we view entities (agents) as nodes and the connections between them as the edges, we see the formation of networks. The connections in these networks do not come about based on just objective relationships between the entities, rather they are decided upon by factors chosen by the participating entities. The challenge with this process is that, it is difficult to identify when a set of entities will form a network. These networks may be of trust networks, co-operation networks, dependence networks etc. There have been cases where heterogeneous set of entities have shown to form strong and meaningful networks among themselves.&lt;br /&gt;
&lt;br /&gt;
如果我们把'''实体 Entities'''（'''主体 Agents'''）看作节点，把它们之间的连接看作边，我们就看到了网络的形成。这些网络中的连接并非只是基于实体之间的客观关系，而是由实体选择的因素决定的。这个过程的困难之处在于，很难确定一组实体何时形成网络。这些网络可以是信任网络、合作网络、依赖网络等。在一些情况下，异质的实体集在它们之间形成了强大而有意义的网络。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
As discussed previously, societies fall into levels and in one such level, the individual level, a micro-macro link&amp;lt;ref&amp;gt;Billari, Francesco C. [https://books.google.com/books?hl=en&amp;amp;lr=&amp;amp;id=Tc8iL0b-OycC&amp;amp;oi=fnd&amp;amp;pg=PA1&amp;amp;dq=%22Agent-based+computational+modelling:+applications+in+demography,+social,+economic+and+environmental+sciences%22&amp;amp;ots=6MNVK7JP-e&amp;amp;sig=-o_iS9zCK3r-t1eHn3554UVadUs Agent-based computational modelling: applications in demography, social, economic and environmental sciences]. Taylor &amp;amp; Francis, 2006.&amp;lt;/ref&amp;gt; refers to the interactions which create higher-levels. There are a set of questions that needs to be answered regarding these Micro-Macro links. How they are formed? When do they converge? What is the feedback pushed to the lower levels and how are they pushed?&lt;br /&gt;
&lt;br /&gt;
As discussed previously, societies fall into levels and in one such level, the individual level, a micro-macro link refers to the interactions which create higher-levels. There are a set of questions that needs to be answered regarding these Micro-Macro links. How they are formed? When do they converge? What is the feedback pushed to the lower levels and how are they pushed?&lt;br /&gt;
&lt;br /&gt;
正如前面所讨论的，社会分为不同层次。在其中的一个层次：个体层次中，'''微观-宏观联系 Micro-macro Link'''指的是创造更高层次的相互作用。关于微观-宏观链接有一系列问题等待回答。它们是如何形成的？它们什么时候汇聚？什么反馈被推到了较低的层次，以及它们是如何被推到较低层次的？ &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Another major challenge in this category concerns the validity of information and their sources. In recent years there has been a boom in information gathering and processing. However, little attention was paid to the spread of false information between the societies. Tracing back the sources and finding ownership of such information is difficult.&lt;br /&gt;
&lt;br /&gt;
Another major challenge in this category concerns the validity of information and their sources. In recent years there has been a boom in information gathering and processing. However, little attention was paid to the spread of false information between the societies. Tracing back the sources and finding ownership of such information is difficult.&lt;br /&gt;
&lt;br /&gt;
这一分类的另一个主要挑战涉及信息的有效性及其来源。近年来，信息收集和处理有着蓬勃的发展。但人们很少注意到社会之间虚假信息的传播。追溯资料来源并找到这些资料的所有者是很困难的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Culture modeling 文化建模===&lt;br /&gt;
&lt;br /&gt;
The evolution of the networks and levels in the society brings about cultural diversity.&amp;lt;ref&amp;gt;{{cite journal|last1=Centola|first1=D.|last2=Gonz´alez-Avella|first2=J. C.|last3=Egu´ıluz|first3=V. M.|last4=San Miguel|first4=M.|title=Journal of Conflict Resolution|issue=2007|pages=51}}&amp;lt;/ref&amp;gt; A thought which arises however is that, when people tend to interact and become more accepting of other cultures and beliefs, how is it that diversity still persists? Why is there no convergence? A major challenge is how to model these diversities. Are there external factors like mass media, locality of societies etc. which influence the evolution or persistence of cultural diversities?{{Citation needed|reason=Sounds just like personal thoughts|date=May 2017}}&lt;br /&gt;
&lt;br /&gt;
The evolution of the networks and levels in the society brings about cultural diversity. A thought which arises however is that, when people tend to interact and become more accepting of other cultures and beliefs, how is it that diversity still persists? Why is there no convergence? A major challenge is how to model these diversities. Are there external factors like mass media, locality of societies etc. which influence the evolution or persistence of cultural diversities?&lt;br /&gt;
&lt;br /&gt;
社会网络和层次的演变带来了文化的多样性。然而人们会想，当人们倾向于相互作用，变得更能接受其他文化和信仰时，为什么多样性仍然存在？为什么人们没有趋同？一个主要的挑战是如何为这些多样性建立模型。是否存在大众传媒、社会地域性等外部因素，这些因素影响文化多样性的演化或保持？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Experimentation and evaluation 实验和评估===&lt;br /&gt;
&lt;br /&gt;
Any study or modelling when combined with experimentation needs to be able to address the questions being asked. [[Computational social science]] deals with large scale data and the challenge becomes much more evident as the scale grows. How would one design informative simulations on a large scale? And even if a large scale simulation is brought up, how is the evaluation supposed to be performed?&lt;br /&gt;
&lt;br /&gt;
Any study or modelling when combined with experimentation needs to be able to address the questions being asked. Computational social science deals with large scale data and the challenge becomes much more evident as the scale grows. How would one design informative simulations on a large scale? And even if a large scale simulation is brought up, how is the evaluation supposed to be performed?&lt;br /&gt;
&lt;br /&gt;
任何与实验结合的研究或建模都需要能够解决所提出的问题。计算社会科学处理大规模数据，并且数据规模越大建模的挑战就越明显。如何在一个大规模的数据集里设计信息仿真模型？并且，即使提出了一个大规模的仿真模型，应该如何对它进行评估？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Model choice and model complexities 模型选择和模型复杂性===&lt;br /&gt;
&lt;br /&gt;
Another challenge is identifying the models that would best fit the data and the complexities of these models. These models would help us predict how societies might evolve over time and provide possible explanations on how things work.&amp;lt;ref&amp;gt;Weisberg, Michael. [http://www.academia.edu/download/30604870/lessmorefinal.pdf When less is more: Tradeoffs and idealization in model building]. Diss. Stanford University, 2003.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Another challenge is identifying the models that would best fit the data and the complexities of these models. These models would help us predict how societies might evolve over time and provide possible explanations on how things work.&lt;br /&gt;
&lt;br /&gt;
另一个挑战是确定最适合数据的模型，以及最合适的'''模型复杂性 Model Complexities'''。这些模型将帮助我们预测随着时间的推移社会将如何演变，并为事物如何运动和变化提供可能的解释。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====Generative models 生成模型====&lt;br /&gt;
&lt;br /&gt;
Generative models helps us to perform extensive qualitative analysis in a controlled fashion. A model proposed by Epstein, is the agent-based simulation, which talks about identifying an initial set of heterogeneous entities (agents) and observe their evolution and growth based on simple local rules.&amp;lt;ref&amp;gt;Epstein, Joshua M. [https://www.researchgate.net/profile/Eric_Jones14/publication/283615593_Book_Review_-_Generative_Social_Science_Studies_in_Agent-Based_Computational_Modeling/links/5641398808aebaaea1f70216.pdf Generative social science: Studies in agent-based computational modeling]. Princeton University Press, 2006.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Generative models helps us to perform extensive qualitative analysis in a controlled fashion. A model proposed by Epstein, is the agent-based simulation, which talks about identifying an initial set of heterogeneous entities (agents) and observe their evolution and growth based on simple local rules.&lt;br /&gt;
&lt;br /&gt;
'''生成模型 Generative Models'''帮助我们以一种受控的方式进行广泛的定性分析。爱泼斯坦（Epstein）提出的一个基于主体的模型，就是探讨如何识别异质实体(主体)的'''初始集 Initial Set'''，并根据简单的局部规则观察它们的演化和增长。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
But what are these local rules? How does one identify them for a set of heterogeneous agents? Evaluation and impact of these rules state a whole new set of difficulties.&lt;br /&gt;
&lt;br /&gt;
But what are these local rules? How does one identify them for a set of heterogeneous agents? Evaluation and impact of these rules state a whole new set of difficulties.&lt;br /&gt;
&lt;br /&gt;
但是这些局部规则是什么呢？如何识别一组异质实体？这些规则的评估和影响都是新出现的困难之处。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====Heterogeneous or ensemble models 异质模型和组合模型====&lt;br /&gt;
&lt;br /&gt;
Integrating simple models which perform better on individual tasks to form a Hybrid model is an approach that can be looked into{{Citation needed|reason=unsupported claims|date=May 2017}}. These models can offer better performance and understanding of the data. However the trade-off of identifying and having a deep understanding of the interactions between these simple models arises when one needs to come up with one combined, well performing model. Also, coming up with tools and applications to help analyse and visualize the data based on these hybrid models is another added challenge.&lt;br /&gt;
&lt;br /&gt;
Integrating simple models which perform better on individual tasks to form a Hybrid model is an approach that can be looked into. These models can offer better performance and understanding of the data. However the trade-off of identifying and having a deep understanding of the interactions between these simple models arises when one needs to come up with one combined, well performing model. Also, coming up with tools and applications to help analyse and visualize the data based on these hybrid models is another added challenge.&lt;br /&gt;
&lt;br /&gt;
集成在单个任务中表现良好的简单模型并形成'''混合模型 Hybrid model'''是一种可以继续考虑的方法。这些模型有更好的性能并可以对数据提供更好的理解。然而，当需要提出一个整合的、性能良好的模型时，识别简单模型和深入理解模型之间相互作用的权衡问题就出现了。此外，另一个挑战是开发工具和应用程序来帮助分析和可视化基于这些混合模型的数据。&lt;br /&gt;
&lt;br /&gt;
==Impact 影响==&lt;br /&gt;
&lt;br /&gt;
Computational sociology can bring impacts to science, technology and society.&amp;lt;ref name=&amp;quot;MCSS&amp;quot; /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Computational sociology can bring impacts to science, technology and society.&lt;br /&gt;
&lt;br /&gt;
计算社会学可以给科学、技术和社会带来影响。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Impact on science 对科学的影响===&lt;br /&gt;
&lt;br /&gt;
In order for the study of computational sociology to be effective, there has to be valuable innovations. These innovation can be of the form of new data analytics tools, better models and algorithms. The advent of such innovation will be a boon for the scientific community in large. {{Citation needed|reason=citation for claim on innovation and the type of innovation|date=May 2017}}&lt;br /&gt;
&lt;br /&gt;
In order for the study of computational sociology to be effective, there has to be valuable innovations. These innovation can be of the form of new data analytics tools, better models and algorithms. The advent of such innovation will be a boon for the scientific community in large. &lt;br /&gt;
&lt;br /&gt;
为了使计算社会学的研究有效，必须有一些有价值的创新。这些创新可以是新形式的数据分析工具，或更好的模型和算法。这些创新的出现将为整个科学界带来益处。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Impact on society 对社会的影响===&lt;br /&gt;
&lt;br /&gt;
One of the major challenges of computational sociology is the modelling of social processes {{Citation needed|reason=to support the claim for need of modeling of social processes|date=May 2017}}. Various law and policy makers would be able to see efficient and effective paths to issue new guidelines and the mass in general would be able to evaluate and gain fair understanding of the options presented in front of them enabling an open and well balanced decision process. {{Citation needed|reason=unsupported claims|date=May 2017}}.&lt;br /&gt;
&lt;br /&gt;
One of the major challenges of computational sociology is the modelling of social processes . Various law and policy makers would be able to see efficient and effective paths to issue new guidelines and the mass in general would be able to evaluate and gain fair understanding of the options presented in front of them enabling an open and well balanced decision process. &lt;br /&gt;
&lt;br /&gt;
计算社会学的主要挑战之一是对社会过程的建模。各种法律和政策制定者将能够得到发布新指导方针的快速有效的方法，广大群众将能够评价和更好地理解各种备选方案，从而实现决策进程的公开和平衡。&lt;br /&gt;
&lt;br /&gt;
==Journals and academic publications 期刊和学术出版物==&lt;br /&gt;
&lt;br /&gt;
The most relevant journal of the discipline is the [[Journal of Artificial Societies and Social Simulation]].&lt;br /&gt;
&lt;br /&gt;
The most relevant journal of the discipline is the Journal of Artificial Societies and Social Simulation.&lt;br /&gt;
&lt;br /&gt;
该学科最相关的期刊是《人工社会与社会模拟（the Journal of Artificial Societies and Social Simulation）》。&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20100611121626/http://www.ccsr.uiuc.edu/web/Journals/Journals.html Complexity Research Journal List], from UIUC, IL 复杂研究期刊列表（资料来自伊利诺伊大学香槟分校）&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20100611091342/http://www.ccsr.uiuc.edu/web/Groups/Groups.html Related Research Groups], from UIUC, IL 相关研究组（资料来自伊利诺伊大学香槟分校）&lt;br /&gt;
&lt;br /&gt;
==Associations, conferences and workshops 协会、会议及工作坊==&lt;br /&gt;
&lt;br /&gt;
*[http://www.casos.cs.cmu.edu/naacsos/ North American Association for Computational Social and Organization Sciences]&lt;br /&gt;
&lt;br /&gt;
*[http://www.essa.eu.org/ ESSA: European Social Simulation Association]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Academic programs, departments and degrees 学术课程、院系和学位==&lt;br /&gt;
&lt;br /&gt;
* [http://mediapatterns.enm.bris.ac.uk/ University of Bristol &amp;quot;Mediapatterns&amp;quot; project]&lt;br /&gt;
&lt;br /&gt;
* [http://www.cos.cs.cmu.edu/ Carnegie Mellon University], [http://www.casos.cs.cmu.edu PhD program] in Computation, Organizations and Society (COS)&lt;br /&gt;
&lt;br /&gt;
* [http://www.uchicago.edu University of Chicago]&lt;br /&gt;
&lt;br /&gt;
** [https://macss.uchicago.edu/ Certificate, MA and PhD in Computational Social Sciences]&lt;br /&gt;
&lt;br /&gt;
* [http://www.gmu.edu George Mason University]&lt;br /&gt;
&lt;br /&gt;
** PhD program in [http://css.gmu.edu CSS (Computational Social Sciences)]&lt;br /&gt;
&lt;br /&gt;
** MA program in [http://mais.gmu.edu/programs/la-mais-css Master's of Interdisciplinary Studies, CSS emphasis]&lt;br /&gt;
&lt;br /&gt;
* [http://www.pdx.edu/sysc/program-systems-science-phd-program Portland State], PhD program in Systems Science&lt;br /&gt;
&lt;br /&gt;
* [http://www.pdx.edu/sysc/program-systems-science-masters-program Portland State], MS program in Systems Science&lt;br /&gt;
&lt;br /&gt;
* [http://www.ucd.ie University College Dublin], &lt;br /&gt;
&lt;br /&gt;
** PhD Program in [http://www.ucd.ie/geary/postgraduatetraining/cscs Complex Systems and Computational Social Science]&lt;br /&gt;
&lt;br /&gt;
** MSc in [https://sisweb.ucd.ie/usis/!W_HU_MENU.P_PUBLISH?p_tag=PROG&amp;amp;MAJR=W390 Social Data Analytics] &lt;br /&gt;
&lt;br /&gt;
** BSc in [https://www.myucd.ie/courses/social-sciences/computational-social-science Computational Social Science] &lt;br /&gt;
&lt;br /&gt;
* [https://archive.is/20121215023745/http://hcs.ucla.edu/courses.htm UCLA], Minor in Human Complex Systems&lt;br /&gt;
&lt;br /&gt;
* [http://www.cs.ucla.edu/~cyber/ UCLA], Major in Computational &amp;amp; Systems Biology (including behavioral sciences)&lt;br /&gt;
&lt;br /&gt;
* [http://cscs.umich.edu/education/undergrad/undergrad.html Univ. of Michigan], Minor in Complex Systems&lt;br /&gt;
&lt;br /&gt;
* [http://www.pdx.edu/sysc/resources-other-systems-science-programs Systems Sciences Programs List], Portland State.  List of other worldwide related programs.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Centers and institutes 中心和机构==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===North America 北美===&lt;br /&gt;
&lt;br /&gt;
* [http://cnets.indiana.edu/ Center for Complex Networks and Systems Research], Indiana University, Bloomington, IN, USA.&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20110430200327/http://www.ccsr.uiuc.edu/ Center for Complex Systems Research], University of Illinois at Urbana-Champaign, IL, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://socialcomplexity.gmu.edu/ Center for Social Complexity], George Mason University, Fairfax, VA, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.asu.edu/clas/csdc/ Center for Social Dynamics and Complexity], Arizona State University, Tempe, AZ, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.cscs.umich.edu/ Center of the Study of Complex Systems], University of Michigan, Ann Arbor, MI, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://hcs.ucla.edu/ Human Complex Systems], University of California Los Angeles, Los Angeles, CA, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.iq.harvard.edu/ Institute for Quantitative Social Science], Harvard University, Boston, MA, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.nico.northwestern.edu/ Northwestern Institute on Complex Systems (NICO)], Northwestern University, Evanston, IL USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.santafe.edu/ Santa Fe Institute], Santa Fe, NM, USA.&lt;br /&gt;
&lt;br /&gt;
* Duke Network Analysis Center, [[Duke University]], Durham, NC, USA&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===South America 南美===&lt;br /&gt;
&lt;br /&gt;
* [http://www5.each.usp.br/mestrado-academico-em-modelagem-de-sistemas-complexos/ Modelagem de Sistemas Complexos], University of São Paulo - EACH, São Paulo, SP, Brazil&lt;br /&gt;
&lt;br /&gt;
* [http://inct.cnpq.br/web/inct-sc Instituto Nacional de Ciência e Tecnologia de Sistemas Complexos], Centro Brasileiro de Pesquisas Físicas, Rio de Janeiro, RJ, Brazil&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Europe 欧洲===&lt;br /&gt;
&lt;br /&gt;
* [http://cfpm.org Centre for Policy Modelling], Manchester, UK.&lt;br /&gt;
&lt;br /&gt;
* [http://cress.soc.surrey.ac.uk/ Centre for Research in Social Simulation], University of Surrey, UK.&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20130425014018/http://dl.ucd.ie/ UCD Dynamics Lab- Centre for Computational Social Science], Geary Institute for Public Policy, University College Dublin, Ireland.&lt;br /&gt;
&lt;br /&gt;
* [http://www.rug.nl/research/gcscs/ Groningen Center for Social Complexity Studies (GCSCS)], Groningen, NL.&lt;br /&gt;
&lt;br /&gt;
* [http://www.soms.ethz.ch/ Chair of Sociology, in particular of Modeling and Simulation (SOMS)], Zürich, Switzerland.&lt;br /&gt;
&lt;br /&gt;
* [http://www.eco.unibs.it/gecs/ Research Group on Experimental and Computational Sociology (GECS)], Brescia, IT.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Asia 亚洲===&lt;br /&gt;
&lt;br /&gt;
* [http://bandungfe.net Bandung Fe Institute, Centre for Complexity in Surya University], Bandung, Indonesia.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== See also 参见==&lt;br /&gt;
&lt;br /&gt;
* [[Artificial society]] 人工社会&lt;br /&gt;
&lt;br /&gt;
* [[Simulated reality]] 虚拟现实&lt;br /&gt;
&lt;br /&gt;
* [[Social simulation]] 社会仿真&lt;br /&gt;
&lt;br /&gt;
* [[Agent-based social simulation]] 基于主体的社会仿真&lt;br /&gt;
&lt;br /&gt;
* [[Social complexity]] 社会复杂性&lt;br /&gt;
&lt;br /&gt;
* [[Computational economics]] 计算经济学&lt;br /&gt;
&lt;br /&gt;
* [[Computational epidemiology]] 计算流行病学&lt;br /&gt;
&lt;br /&gt;
* [[Cliodynamics]] 历史动力学&lt;br /&gt;
&lt;br /&gt;
* [[Predictive analytics]] 预测分析&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&lt;br /&gt;
{{reflist|35em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==External links 外部链接==&lt;br /&gt;
&lt;br /&gt;
*[http://cress.soc.surrey.ac.uk/s4ss/ On-line book &amp;quot;Simulation for the Social Scientist&amp;quot; by Nigel Gilbert and Klaus G. Troitzsch, 1999, second edition 2005 社会科学家的仿真建模 电子书 作者：Nigel Gilbert and Klaus G. Troitzsch 第二版（2005年版）]&lt;br /&gt;
&lt;br /&gt;
*[http://jasss.soc.surrey.ac.uk/JASSS.html Journal of Artificial Societies and Social Simulation 人工社会和社会建模仿真期刊]&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20110516072744/http://cmol.nbi.dk/models/ Agent based models for social networks, interactive java applets 基于主体的社会网络模型，交互式 java 小程序]&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20090827052722/http://www.personal.kent.edu/~bcastel3/ Sociology and Complexity Science Website 社会学与复杂性科学网站]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:Subfields of sociology]]&lt;br /&gt;
&lt;br /&gt;
Category:Subfields of sociology&lt;br /&gt;
&lt;br /&gt;
范畴: 社会学的子领域&lt;br /&gt;
&lt;br /&gt;
[[Category:Complex systems theory]]&lt;br /&gt;
&lt;br /&gt;
Category:Complex systems theory&lt;br /&gt;
&lt;br /&gt;
范畴: 复杂系统理论&lt;br /&gt;
&lt;br /&gt;
[[Category:Methods in sociology]]&lt;br /&gt;
&lt;br /&gt;
Category:Methods in sociology&lt;br /&gt;
&lt;br /&gt;
范畴: 社会学方法&lt;br /&gt;
&lt;br /&gt;
[[Category:Computational fields of study]]&lt;br /&gt;
&lt;br /&gt;
Category:Computational fields of study&lt;br /&gt;
&lt;br /&gt;
类别: 研究的计算领域&lt;br /&gt;
&lt;br /&gt;
&amp;lt;noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;small&amp;gt;This page was moved from [[wikipedia:en:Computational sociology]]. Its edit history can be viewed at [[社会计算/edithistory]]&amp;lt;/small&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:待整理页面]]&lt;br /&gt;
&lt;br /&gt;
== 编者推荐 ==&lt;br /&gt;
=== 书籍推荐 ===&lt;br /&gt;
====[https://e.jd.com/30159646.html 社会计算的基本方法与应用]====&lt;br /&gt;
这是中科院自动化所的王飞跃老师关于社会计算的专著，从利用计算技术解决社会问题的角度介绍社会计算。阅读难度可能较高。&lt;br /&gt;
&lt;br /&gt;
=== 集智推荐 ===&lt;br /&gt;
====[https://campus.swarma.org/course/1028 2019 International Conference of Social Computing]====&lt;br /&gt;
本课程是2019年8月26日、27日的2019 International Conference of Social Computing记录。教师团队由芝加哥大学社会学系James Evans教授，Science University of Gottingen傅晓明教授，清华大学罗家德教授，电子科技大学周涛教授等多位老师组成。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://campus.swarma.org/course/1016 复杂系统与社会计算研讨会]====&lt;br /&gt;
本课程是，2019年10月27日北京计算科学研究中心主办的复杂系统与社会计算研讨会活动记录。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://pattern.swarma.org/path?id=12 计算社会科学入门路径]====&lt;br /&gt;
计算社会科学诞生至今，已有将近10年。在自然科学领域已经广泛应用大数据、分布式计算等方式提高研究质量的今天，社会科学领域涉及到的核心数据仍然被少数机构所拥有并创造着巨大的价值。本文将从计算社会科学的发展历史，常用方法，以及前沿问题来给大家粗略地展示计算社会科学的脉络。&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E7%A4%BE%E4%BC%9A%E8%AE%A1%E7%AE%97&amp;diff=11179</id>
		<title>社会计算</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E7%A4%BE%E4%BC%9A%E8%AE%A1%E7%AE%97&amp;diff=11179"/>
		<updated>2020-07-26T10:03:17Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：/* Macrosimulation and microsimulation 宏观模拟和微观模拟 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;#重定向 [[社会计算]]&lt;br /&gt;
此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。&lt;br /&gt;
{{sociology}}&amp;lt;onlyinclude&amp;gt;&amp;lt;!-- &lt;br /&gt;
&lt;br /&gt;
&amp;lt;onlyinclude&amp;gt;&amp;lt;!-- &lt;br /&gt;
&lt;br /&gt;
只包括! -- &lt;br /&gt;
&lt;br /&gt;
While editing this lead/intro, please keep your text BELOW this line - this will make it easier to automatically insert the lede into other articles --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
  While editing this lead/intro, please keep your text BELOW this line - this will make it easier to automatically insert the lede into other articles --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
当编辑这个导语 / 介绍，请保持你的文本下面这行-这将使它更容易自动插入到其他文章的莱德-&lt;br /&gt;
&lt;br /&gt;
'''Computational sociology''' is a branch of [[sociology]] that uses computationally intensive methods to analyze and model social phenomena. Using [[computer simulation]]s, [[artificial intelligence]], complex statistical methods, and analytic approaches like [[social network analysis]], computational sociology develops and tests theories of complex social processes through bottom-up modeling of social interactions.&amp;lt;ref name=&amp;quot;MW&amp;quot;&amp;gt;{{cite journal|doi=10.1146/annurev.soc.28.110601.141117|title=From Factors to Actors: Computational Sociology and Agent-Based Modeling |first1=Michael W. |last1=Macy |first2=Robert |last2=Willer |journal=Annual Review of Sociology |volume=28 |pages=143–166 |jstor=3069238|year=2002}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Computational sociology is a branch of sociology that uses computationally intensive methods to analyze and model social phenomena. Using computer simulations, artificial intelligence, complex statistical methods, and analytic approaches like social network analysis, computational sociology develops and tests theories of complex social processes through bottom-up modeling of social interactions.&lt;br /&gt;
&lt;br /&gt;
'''计算社会学 Computational Sociology''' 是社会学的一个分支，它使用计算密集型方法来分析和模拟社会现象。&amp;lt;font color='red'&amp;gt;计算社会学通过使用计算机模拟、人工智能、复杂统计方法以及社会网络分析等分析方法自下而上地建立社会互动模型，是建立并检验复杂社会过程的理论。&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;  借助计算机模拟、人工智能、复杂统计方法以及社会网络分析等分析方法，计算社会学通过自下而上地建立社会互动模型来发展和检验关于复杂社会过程的理论。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
It involves the understanding of social agents, the interaction among these agents, and the effect of these interactions on the social aggregate.&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;&amp;gt;{{cite book|last1=Gilbert |first1=Nigel |last2=Troitzsch |first2=Klaus |year=2005 |title=Simulation for Social Scientists |edition=2 |chapter=Simulation and social science |publisher=Open University Press |chapter-url=http://cress.soc.surrey.ac.uk/s4ss/}}&amp;lt;/ref&amp;gt; Although the subject matter and methodologies in [[social science]] differ from those in [[natural science]] or [[computer science]], several of the approaches used in contemporary [[social simulation]] originated from fields such as [[physics]] and [[artificial intelligence]].&amp;lt;ref name=&amp;quot;Artificial Societies&amp;quot;&amp;gt;{{cite book|last1=Epstein |first1=Joshua M. |last2=Axtell |first2=Robert |year=1996 |title=Growing Artificial Societies: Social Science from the Bottom Up |location=Washington DC |publisher=Brookings Institution Press|url=https://archive.org/details/growingartificia00epst|url-access=registration |isbn=978-0262050531 }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;Cooperation&amp;quot;&amp;gt;{{cite book|last1=Axelrod |first1=Robert |year=1997 |title=The Complexity of Cooperation: Agent-Based Models of Competition and Collaboration |location=Princeton, NJ |publisher=Princeton University Press}}&amp;lt;/ref&amp;gt; Some of the approaches that originated in this field have been imported into the natural sciences, such as measures of [[centrality|network centrality]] from the fields of [[social network analysis]] and [[network science]].&lt;br /&gt;
&lt;br /&gt;
It involves the understanding of social agents, the interaction among these agents, and the effect of these interactions on the social aggregate. Although the subject matter and methodologies in social science differ from those in natural science or computer science, several of the approaches used in contemporary social simulation originated from fields such as physics and artificial intelligence. Some of the approaches that originated in this field have been imported into the natural sciences, such as measures of network centrality from the fields of social network analysis and network science.&lt;br /&gt;
&lt;br /&gt;
它涉及理解社会行为主体和它们的相互作用，以及这些相互作用如何影响社会总体(--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） social aggregate--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|讨论]]） 我觉得这样翻译是ok的)。虽然社会科学的主题和方法不同于自然科学或计算机科学，但当代社会仿真模拟中使用的一些方法起源于物理学和人工智能等领域。这一领域的一些方法，如来自社会网络分析和网络科学领域的网络中心性度量方法等，早已被引入到自然科学中。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In relevant literature, computational sociology is often related to the study of [[social complexity]].&amp;lt;ref&amp;gt;{{cite journal|last=Casti |first=J |year=1999 |title=The Computer as Laboratory: Toward a Theory of Complex Adaptive Systems |journal=Complexity |volume=4 |issue=5 |pages=12–14 |doi=10.1002/(SICI)1099-0526(199905/06)4:5&amp;lt;12::AID-CPLX3&amp;gt;3.0.CO;2-4}}&amp;lt;/ref&amp;gt; Social complexity concepts such as [[complex systems]], [[non-linear]] interconnection among macro and micro process, and [[emergence]], have entered the vocabulary of computational sociology.&amp;lt;ref&amp;gt;{{cite journal|last=Goldspink |first=C |year=2002 |title=Methodological Implications of Complex Systems Approaches to Sociality: Simulation as a Foundation for Knowledge |url=http://jasss.soc.surrey.ac.uk/5/1/3.html |publisher=Journal of Artificial Societies and Social Simulation |volume=5 |issue=1}}&amp;lt;/ref&amp;gt; A practical and well-known example is the construction of a computational model in the form of an &amp;quot;[[artificial society]]&amp;quot;, by which researchers can analyze the structure of a [[Social structure|social system]].&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;Generative&amp;quot;&amp;gt;{{cite book|last=Epstein |first=Joshua |year=2007 |title=Generative Social Science: Studies in Agent-Based Computational Modeling |location=Princeton, NJ |publisher=Princeton University Press|url=https://www.researchgate.net/publication/283615593}}&lt;br /&gt;
&lt;br /&gt;
In relevant literature, computational sociology is often related to the study of social complexity. Social complexity concepts such as complex systems, non-linear interconnection among macro and micro process, and emergence, have entered the vocabulary of computational sociology. A practical and well-known example is the construction of a computational model in the form of an &amp;quot;artificial society&amp;quot;, by which researchers can analyze the structure of a social system.&lt;br /&gt;
&lt;br /&gt;
在相关文献中，计算社会学经常与社会复杂性的研究有关。复杂系统、宏观和微观过程之间的非线性关联、涌现等社会复杂性概念已经进入计算社会学的词汇。一个实际而著名的例子是建立“'''人工社会 Artificial Society'''”的计算模型，通过它研究人员可以分析一个社会系统的结构。 &lt;br /&gt;
&lt;br /&gt;
While editing this lead/intro, please keep your text ABOVE this line - this will make it easier to automatically insert the lede into other articles - thanks!  &lt;br /&gt;
&lt;br /&gt;
While editing this lead/intro, please keep your text ABOVE this line - this will make it easier to automatically insert the lede into other articles - thanks!  &lt;br /&gt;
&lt;br /&gt;
当编辑这个引导 / 介绍，请保持你的文本以上这一行-这将使它更容易自动插入到其他文章的莱德-谢谢！&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;&amp;lt;/onlyinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;&amp;lt;/onlyinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
-- / 只包括&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==History 历史==&lt;br /&gt;
&lt;br /&gt;
{{see also|Sociology and complexity science}}&lt;br /&gt;
&lt;br /&gt;
[[File:Complexity-map-with-sociolo.png|thumb|right|300px|Historical map of research paradigms and associated scientists in [[sociology and complexity science]].]]&lt;br /&gt;
&lt;br /&gt;
Historical map of research paradigms and associated scientists in [[sociology and complexity science.]]&lt;br /&gt;
&lt;br /&gt;
【图1：Historical map of research paradigms and associated scientists in [[sociology and complexity science＋社会学和复杂性中的研究范式和科学家的历史地图】&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Background 背景===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In the past four decades, computational sociology has been introduced and gaining popularity {{According to whom|date=June 2017}}.  This has been used primarily for modeling or building explanations of social processes and are depending on the emergence of complex behavior from simple activities.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;&amp;gt;Salgado, Mauricio, and Nigel Gilbert. &amp;quot;[http://epubs.surrey.ac.uk/749319/1/Emergence%20and%20Communication%20-%20V3%201.pdf Emergence and communication in computational sociology].&amp;quot; Journal for the Theory of Social Behaviour 43.1 (2013): 87-110.&amp;lt;/ref&amp;gt;  The idea behind emergence is that properties of any bigger system do not always have to be properties of the components that the system is made of.&amp;lt;ref&amp;gt;Macy, Michael W., and Robert Willer. &amp;quot;[http://sct.uab.cat/lsds/sites/sct.uab.cat.lsds/files/FROM%20FACTORS%20TO%20ACTORS%20(Macy%20and%20Willer%202002).pdf From factors to actors: computational sociology and agent-based modeling].&amp;quot; Annual review of sociology 28.1 (2002): 143-166.&amp;lt;/ref&amp;gt;  The people responsible for the introduction of the idea of emergence are Alexander, Morgan, and Broad, who were classical emergentists.  The time at which these emergentists came up with this concept and method was during the time of the early twentieth century.  The aim of this method was to find a good enough accommodation between two different and extreme ontologies, which were reductionist materialism and dualism.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;/&amp;gt; &lt;br /&gt;
&lt;br /&gt;
In the past four decades, computational sociology has been introduced and gaining popularity.  This has been used primarily for modeling or building explanations of social processes and are depending on the emergence of complex behavior from simple activities.  The idea behind emergence is that properties of any bigger system do not always have to be properties of the components that the system is made of.  The people responsible for the introduction of the idea of emergence are Alexander, Morgan, and Broad, who were classical emergentists.  The time at which these emergentists came up with this concept and method was during the time of the early twentieth century.  The aim of this method was to find a good enough accommodation between two different and extreme ontologies, which were reductionist materialism and dualism. &lt;br /&gt;
&lt;br /&gt;
在过去的四十年里，计算社会学诞生并且越来越受欢迎。这主要用于建模或构建社会过程的解释，并且依赖于从简单活动中'''涌现 Emergence'''的复杂行为。涌现背后的思想是，任何较大系统不总是必须和组成系统的部分具有一样的性质。引入涌现思想的人是亚历山大 Alexander、摩根 Morgan和布罗德 Broad，他们都是'''经典涌现主义者 Classical Emergentists'''。经典涌现主义者提出这个概念和方法的时间是在二十世纪初期。这种方法的目的是在还原论的唯物主义和二元论这两种不同的本体论之间找到一个足够好的调和。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
While emergence has had a valuable and important role with the foundation of Computational Sociology, there are those who do not necessarily agree.  One major leader in the field, Epstein, doubted the use because there were aspects that are unexplainable.  Epstein put up a claim against emergentism, in which he says it &amp;quot;is precisely the generative sufficiency of the parts that constitutes the whole's explanation&amp;quot;.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
While emergence has had a valuable and important role with the foundation of Computational Sociology, there are those who do not necessarily agree.  One major leader in the field, Epstein, doubted the use because there were aspects that are unexplainable.  Epstein put up a claim against emergentism, in which he says it &amp;quot;is precisely the generative sufficiency of the parts that constitutes the whole's explanation&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
虽然涌现在计算社会学的建立上发挥了宝贵而重要的作用，但也有人不太同意。该领域的一个主要人物爱泼斯坦 Epstein对这种&amp;lt;font color='red'&amp;gt;用法&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;概念&amp;lt;/font&amp;gt;持怀疑态度，因为有些方面是这个&amp;lt;font color='red'&amp;gt;用法&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;概念&amp;lt;/font&amp;gt;无法解释的。爱泼斯坦提出了一种反对“涌现主义”的观点，他表示:“&amp;lt;font color=='red'&amp;gt;正是这些部分的有生成意义的充分性构成了对整体的解释&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;  正是这些部分所产生的充分性构成了对整体的解释&amp;lt;/font&amp;gt;”。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Agent-based models have had a historical influence on Computational Sociology.   These models first came around in the 1960s, and were used to simulate control and feedback processes in organizations, cities, etc.  During the 1970s, the application introduced the use of individuals as the main units for the analyses and used bottom-up strategies for modeling behaviors.  The last wave occurred in the 1980s.  At this time, the models were still bottom-up; the only difference is that the agents interact interdependently.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Agent-based models have had a historical influence on Computational Sociology. These models first came around in the 1960s, and were used to simulate control and feedback processes in organizations, cities, etc.  During the 1970s, the application introduced the use of individuals as the main units for the analyses and used bottom-up strategies for modeling behaviors.  The last wave occurred in the 1980s.  At this time, the models were still bottom-up; the only difference is that the agents interact interdependently.&lt;br /&gt;
&lt;br /&gt;
'''基于主体的模型 Agent-based Models'''对计算社会学有着历史性的影响。这些模型最早出现在20世纪60年代，用于仿真模拟组织、城市等系统的控制和反馈过程。在20世纪70年代，&amp;lt;font color='red'&amp;gt;应用程序&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; ABM模型&amp;lt;/font&amp;gt;引入个体作为主要的分析单元，并使用自下而上的策略来对行为建模。最后一波浪潮发生在20世纪80年代。那时，模型仍然是自下而上的; 唯一的区别是主体之间具有互相依赖和相互作用。&lt;br /&gt;
&lt;br /&gt;
===Systems theory and structural functionalism 系统理论和结构功能主义===&lt;br /&gt;
&lt;br /&gt;
{{main|Systems theory|Structural functionalism}}&lt;br /&gt;
&lt;br /&gt;
In the post-war era, [[Vannevar Bush]]'s [[differential analyser]], [[John von Neumann]]'s [[Von Neumann cellular automata|cellular automata]], [[Norbert Wiener]]'s [[cybernetics]], and [[Claude Shannon]]'s [[information theory]] became influential paradigms for modeling and understanding complexity in technical systems. In response, scientists in disciplines such as physics, biology, electronics, and economics began to articulate a [[systems theory|general theory of systems]] in which all natural and physical phenomena are manifestations of interrelated elements in a system that has common patterns and properties. Following [[Émile Durkheim]]'s call to analyze complex modern society ''[[sui generis]]'',&amp;lt;ref&amp;gt;{{cite book|first=Émile |last=Durkheim |title=The Division of Labor in Society |location=New York, NY |publisher=Macmillan}}&amp;lt;/ref&amp;gt; post-war structural functionalist sociologists such as [[Talcott Parsons]] seized upon these theories of systematic and hierarchical interaction among constituent components to attempt to generate grand unified sociological theories, such as the [[AGIL paradigm]].&amp;lt;ref name=&amp;quot;Bailey&amp;quot;&amp;gt;{{cite book|first1=Kenneth D. |last1=Bailey |editor=Jonathan H. Turner |chapter=Systems Theory |title=Handbook of Sociological Theory |publisher=Springer Science |year=2006 |location=New York, NY |isbn=978-0-387-32458-6 |pages=379–404}}&amp;lt;/ref&amp;gt; Sociologists such as [[George Homans]] argued that sociological theories should be formalized into hierarchical structures of propositions and precise terminology from which other propositions and hypotheses could be derived and operationalized into empirical studies.&amp;lt;ref name=&amp;quot;Blackwell&amp;quot;&amp;gt;{{cite encyclopedia|year=2007 |title=Computational Sociology |last=Bainbridge |first=William Sims |encyclopedia=Blackwell Encyclopedia of Sociology |publisher=Blackwell Reference Online |url=http://www.sociologyencyclopedia.com/subscriber/tocnode?id=g9781405124331_chunk_g97814051243319_ss1-85 |doi=10.1111/b.9781405124331.2007.x |hdl=10138/224218 |editor=Ritzer, George|isbn=978-1-4051-2433-1|hdl-access=free }}&amp;lt;/ref&amp;gt; Because computer algorithms and programs had been used as early as 1956 to test and validate mathematical theorems, such as the [[four color theorem]],&amp;lt;ref&amp;gt;{{cite book|last=Crevier |first=D. |year=1993 |title=AI: The Tumultuous History of the Search for Artificial Intelligence |url=https://archive.org/details/aitumultuoushist00crev |url-access=registration |publisher=Basic Books |location=New York, NY}}&amp;lt;/ref&amp;gt; some scholars anticipated that similar computational approaches could &amp;quot;solve&amp;quot; and &amp;quot;prove&amp;quot; analogously formalized problems and theorems of social structures and dynamics.&lt;br /&gt;
&lt;br /&gt;
In the post-war era, Vannevar Bush's differential analyser, John von Neumann's cellular automata, Norbert Wiener's cybernetics, and Claude Shannon's information theory became influential paradigms for modeling and understanding complexity in technical systems. In response, scientists in disciplines such as physics, biology, electronics, and economics began to articulate a general theory of systems in which all natural and physical phenomena are manifestations of interrelated elements in a system that has common patterns and properties. Following Émile Durkheim's call to analyze complex modern society sui generis, post-war structural functionalist sociologists such as Talcott Parsons seized upon these theories of systematic and hierarchical interaction among constituent components to attempt to generate grand unified sociological theories, such as the AGIL paradigm. Sociologists such as George Homans argued that sociological theories should be formalized into hierarchical structures of propositions and precise terminology from which other propositions and hypotheses could be derived and operationalized into empirical studies. Because computer algorithms and programs had been used as early as 1956 to test and validate mathematical theorems, such as the four color theorem, some scholars anticipated that similar computational approaches could &amp;quot;solve&amp;quot; and &amp;quot;prove&amp;quot; analogously formalized problems and theorems of social structures and dynamics.&lt;br /&gt;
&lt;br /&gt;
战后时期，范内瓦·布什（Vannevar Bush）的'''微分分析机 Differential Analyser''' 、冯·诺伊曼（John von Neumann）的'''元胞自动机 Cellular Automata'''、 维纳（Norbert Wiener）的'''控制论 Cybernetics'''和克劳德·香农（Claude Shannon）的'''信息论 Information Theory'''成为技术系统中建模和理解复杂性的重要范式。物理学、生物学、电子学和经济学等学科的科学家开始阐述系统的一般理论，即所有自然和物理现象都是具有共同模式和属性的系统中相互关联的元素的表现。&amp;lt;font color='red'&amp;gt;按照 &amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 沿着&amp;lt;/font&amp;gt;涂尔干（Émile Durkheim）分析特定的复杂现代社会&lt;br /&gt;
&lt;br /&gt;
（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]）Following Émile Durkheim's call to analyze complex modern society sui generis）&lt;br /&gt;
  --~~克劳德·香农（Claude Shannon）  这些同样去括号&lt;br /&gt;
&lt;br /&gt;
的&amp;lt;font color='red'&amp;gt;要求&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 思路&amp;lt;/font&amp;gt;，战后结构功能主义社会学家如帕森斯（Talcott Parsons）利用这些组成部分之间系统&amp;lt;font color='blue'&amp;gt;化&amp;lt;/font&amp;gt;和&amp;lt;font color='red'&amp;gt;等级&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 层次化&amp;lt;/font&amp;gt;相互作用的理论，试图产生大统一的社会学理论，如 AGIL 范式。霍曼斯（George Homans）等社会学家认为，社会学理论应该被构建为具有&amp;lt;font color='blue'&amp;gt;逻辑&amp;lt;/font&amp;gt;命题和精确术语的&amp;lt;font color='red'&amp;gt;等级&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 层次化&amp;lt;/font&amp;gt;结构，并且从中可以得出能够在实证研究中被操作化的其他命题和假设。由于早在1956年计算机算法和程序就已经被用来测试和验证数学定理（如'''四色定理Four Color Theorem'''），&amp;lt;font color='red'&amp;gt;一些学者预计相似的计算方法可以“解决”和“证明”类似的社会结构和动态的问题和定理。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 一些学者预计相似的计算方法可以“解释”和“证明”关于社会结构和演变的类似形式化的问题和定理。&amp;lt;/font&amp;gt;&lt;br /&gt;
--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|讨论]]formalized应该也要翻译出来，computational证明的是形式化定理)&lt;br /&gt;
&lt;br /&gt;
===Macrosimulation and microsimulation 宏观模拟和微观模拟===&lt;br /&gt;
&lt;br /&gt;
{{main|System dynamics|Microsimulation}}&lt;br /&gt;
&lt;br /&gt;
By the late 1960s and early 1970s, social scientists used increasingly available computing technology to perform macro-simulations of control and feedback processes in organizations, industries, cities, and global populations. These models used differential equations to predict population distributions as holistic functions of other systematic factors such as inventory control, urban traffic, migration, and disease transmission.&amp;lt;ref&amp;gt;{{cite book|first=Jay |last=Forrester |year=1971 |title=World Dynamics |location=Cambridge, MA |publisher=MIT Press}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|doi=10.1287/opre.26.2.237|title=Using Simulation to Develop and Validate Analytic Models: Some Case Studies |first1=Edward J. |last1=Ignall |first2=Peter |last2=Kolesar |first3=Warren E. |last3=Walker |journal=Operations Research |volume=26 |issue=2 |year=1978 |pages=237–253}}&amp;lt;/ref&amp;gt; Although simulations of social systems received substantial attention in the mid-1970s after the [[Club of Rome]] published reports predicting that policies promoting exponential economic growth would eventually bring global environmental catastrophe,&amp;lt;ref&amp;gt;{{cite book|title=The Dynamics of Growth in a Finite World |last1=Meadows |first1=DL |last2=Behrens |first2=WW |last3=Meadows |first3=DH |last4=Naill |first4=RF |last5= Randers |first5=J |last6=Zahn |first6=EK |year=1974 |location=Cambridge, MA |publisher=MIT Press}}&amp;lt;/ref&amp;gt; the inconvenient conclusions led many authors to seek to discredit the models, attempting to make the researchers themselves appear unscientific.&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;/&amp;gt;&amp;lt;ref&amp;gt;{{cite news|title=Computer View of Disaster Is Rebutted |newspaper=The New York Times |date=October 18, 1974|url=https://www.nytimes.com/1974/10/18/archives/computer-view-of-disaster-is-rebutted.html?_r=0}}&amp;lt;/ref&amp;gt; Hoping to avoid the same fate, many social scientists turned their attention toward micro-simulation models to make forecasts and study policy effects by modeling aggregate changes in state of individual-level entities rather than the changes in distribution at the population level.&amp;lt;ref&amp;gt;{{cite journal|doi=10.1016/0167-2681(90)90038-F|title=From engineering to microsimulation : An autobiographical reflection |journal=Journal of Economic Behavior &amp;amp; Organization |year=1990 |volume=14 |issue=1 |pages=5–27 |first=Guy H. |last=Orcutt}}&amp;lt;/ref&amp;gt; However, these micro-simulation models did not permit individuals to interact or adapt and were not intended for basic theoretical research.&amp;lt;ref name=&amp;quot;MW&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
By the late 1960s and early 1970s, social scientists used increasingly available computing technology to perform macro-simulations of control and feedback processes in organizations, industries, cities, and global populations. These models used differential equations to predict population distributions as holistic functions of other systematic factors such as inventory control, urban traffic, migration, and disease transmission. Although simulations of social systems received substantial attention in the mid-1970s after the Club of Rome published reports predicting that policies promoting exponential economic growth would eventually bring global environmental catastrophe, the inconvenient conclusions led many authors to seek to discredit the models, attempting to make the researchers themselves appear unscientific. Hoping to avoid the same fate, many social scientists turned their attention toward micro-simulation models to make forecasts and study policy effects by modeling aggregate changes in state of individual-level entities rather than the changes in distribution at the population level. However, these micro-simulation models did not permit individuals to interact or adapt and were not intended for basic theoretical research.&lt;br /&gt;
&lt;br /&gt;
截至20世纪60年代末70年代初，社会科学家越来越多地使用已有的计算技术，&amp;lt;s&amp;gt;在&amp;lt;/s&amp;gt;&amp;lt;font color='blue'&amp;gt;对&amp;lt;/font&amp;gt;组织、工业、城市和全球人口&amp;lt;s&amp;gt;中&amp;lt;/s&amp;gt;进行&amp;lt;font color='blue'&amp;gt;包含&amp;lt;/font&amp;gt;控制和反馈过程的'''宏观模拟 Macrosimulation''' 。这些模型使用微分方程作为其他系统因素的整体函数来预测人口分布，这些系统因素包括&amp;lt;font color='red'&amp;gt;库存&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 财产&amp;lt;/font&amp;gt;控制、城市交通、人口迁移和疾病传播等。&amp;lt;font color='red'&amp;gt;20世纪70年代中期，'''罗马俱乐部 Club of Rome''' 发表报告预测，促进指数式经济增长的政策最终将导致全球环境灾难，这个悲观的结论导致许多研究者试图反驳这些模型，并试图让研究显得不那么科学。&amp;lt;/font&amp;gt;&lt;br /&gt;
  （--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） 根据意思，inconvenient译为悲观的，因为这个结论预示了悲观的未来，所以令指出这一点的科学家们感到inconvenient）&lt;br /&gt;
  （--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟树|讨论]]） inconvenient的翻译没问题，不过好像缺失了Although simulations of social systems received substantial attention）&lt;br /&gt;
&amp;lt;font color='blue'&amp;gt; 20世纪70年代中期，尽管对社会系统的仿真获得了巨大的关注，但在'''罗马俱乐部 Club of Rome''' 发布预测报告称促进指数式经济增长的政策最终将导致全球环境灾难，这个悲观的结论导致许多研究者尝试抹黑这些(仿真)模型，并试图让(这些模型的)研究者自身显得不那么科学。&amp;lt;/font&amp;gt;&lt;br /&gt;
为了避免同样的情况，许多社会科学家将注意力转向'''微观模拟 Microsimulation'''模型。这些模型通过模拟个体状态的总体变化而不是总体人口级别的变化来进行预测和研究政策的效果。然而，这些微观模拟模型并不允许个体相互作用或适应、变化（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]）变化是根据适应（adapt）加上去的，不知道是否合理），研究者也不打算将它们用于基础理论研究。&lt;br /&gt;
&lt;br /&gt;
===Cellular automata and agent-based modeling 元胞自动机和基于主体建模===&lt;br /&gt;
&lt;br /&gt;
{{main|Cellular automata|agent-based modeling}}&lt;br /&gt;
&lt;br /&gt;
The 1970s and 1980s were also a time when physicists and mathematicians were attempting to model and analyze how simple component units, such as atoms, give rise to global properties, such as complex material properties at low temperatures, in magnetic materials, and within turbulent flows.&amp;lt;ref&amp;gt;{{cite book|title=Cellular automata machines: a new environment for modeling |url=https://archive.org/details/cellularautomata00toff |url-access=registration |first1=Tommaso |last1=Toffoli |first2=Norman |last2=Margolus | author2-link = Norman Margolus |year=1987 |publisher=MIT Press |location=Cambridge, MA}}&amp;lt;/ref&amp;gt; Using cellular automata, scientists were able to specify systems consisting of a grid of cells in which each cell only occupied some finite states and changes between states were solely governed by the states of immediate neighbors. Along with advances in [[artificial intelligence]] and [[microcomputer]] power, these methods contributed to the development of &amp;quot;[[chaos theory]]&amp;quot; and &amp;quot;[[complex systems|complexity theory]]&amp;quot; which, in turn, renewed interest in understanding complex physical and social systems across disciplinary boundaries.&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;/&amp;gt; Research organizations explicitly dedicated to the interdisciplinary study of complexity were also founded in this era: the [[Santa Fe Institute]] was established in 1984 by scientists based at [[Los Alamos National Laboratory]] and the BACH group at the [[University of Michigan]] likewise started in the mid-1980s.&lt;br /&gt;
&lt;br /&gt;
The 1970s and 1980s were also a time when physicists and mathematicians were attempting to model and analyze how simple component units, such as atoms, give rise to global properties, such as complex material properties at low temperatures, in magnetic materials, and within turbulent flows. Using cellular automata, scientists were able to specify systems consisting of a grid of cells in which each cell only occupied some finite states and changes between states were solely governed by the states of immediate neighbors. Along with advances in artificial intelligence and microcomputer power, these methods contributed to the development of &amp;quot;chaos theory&amp;quot; and &amp;quot;complexity theory&amp;quot; which, in turn, renewed interest in understanding complex physical and social systems across disciplinary boundaries. Research organizations explicitly dedicated to the interdisciplinary study of complexity were also founded in this era: the Santa Fe Institute was established in 1984 by scientists based at Los Alamos National Laboratory and the BACH group at the University of Michigan likewise started in the mid-1980s.&lt;br /&gt;
&lt;br /&gt;
20世纪70年代和80年代，物理学家和数学家也在试图模拟和分析简单的组成单位如何产生整体特性，比如低温环境中原子在磁性材料和湍流中的复杂材料特性。使用'''元胞自动机 Cellular Automata'''，科学家们能够指定由元胞网格组成的系统，其中每个元胞只占据一些有限的状态，状态之间的变化完全由相邻元胞的状态控制。随着人工智能和微型计算机能力的进步，这些方法促进了“混沌理论”和“复杂性理论”的发展，这反过来又重新引起了人们对跨学科的复杂物理和社会系统的兴趣。明确致力于跨学科复杂性研究的机构也是在这个时代成立的: 圣菲研究所是由美国洛斯阿拉莫斯国家实验室（Los Alamos National Laboratory）的科学家于1984年建立的，密歇根大学的 BACH 小组也是在20世纪80年代中期建立的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This cellular automata paradigm gave rise to a third wave of social simulation emphasizing agent-based modeling. Like micro-simulations, these models emphasized bottom-up designs but adopted four key assumptions that diverged from microsimulation: autonomy, interdependency, simple rules, and adaptive behavior.&amp;lt;ref name=&amp;quot;MW&amp;quot;/&amp;gt; Agent-based models are less concerned with predictive accuracy and instead emphasize theoretical development.&amp;lt;ref&amp;gt;{{cite journal |title=A simulation of the structure of academic science |journal=Sociological Research Online |volume=2 |issue=2 |pages=1–15 |year=1997 |first=Nigel |last=Gilbert |url=http://www.socresonline.org.uk/socresonline/2/2/3.html |doi=10.5153/sro.85 |access-date=2009-12-16 |archive-url=https://web.archive.org/web/19980524062306/http://www.socresonline.org.uk/socresonline/2/2/3.html |archive-date=1998-05-24 |url-status=dead }}&amp;lt;/ref&amp;gt; In 1981, mathematician and political scientist [[Robert Axelrod]] and evolutionary biologist [[W.D. Hamilton]] published a major paper in ''[[Science (journal)|Science]]'' titled &amp;quot;The Evolution of Cooperation&amp;quot; which used an agent-based modeling approach to demonstrate how social cooperation based upon reciprocity can be established and stabilized in a [[prisoner's dilemma]] game when agents followed simple rules of self-interest.&amp;lt;ref&amp;gt;{{cite journal|title=The Evolution of Cooperation |first1=Robert |last1=Axelrod |first2=William D. |last2=Hamilton |journal=Science |volume=211 |issue=4489 |pages=1390–1396 |doi=10.1126/science.7466396|pmid=7466396 |date=March 27, 1981|bibcode=1981Sci...211.1390A }}&amp;lt;/ref&amp;gt; Axelrod and Hamilton demonstrated that individual agents following a simple rule set of (1) cooperate on the first turn and (2) thereafter replicate the partner's previous action were able to develop &amp;quot;norms&amp;quot; of cooperation and sanctioning in the absence of canonical sociological constructs such as demographics, values, religion, and culture as preconditions or mediators of cooperation.&amp;lt;ref name=&amp;quot;Cooperation&amp;quot;/&amp;gt; Throughout the 1990s, scholars like [[William Sims Bainbridge]], [[Kathleen Carley]], [[Michael Macy]],  and [[John Skvoretz]] developed multi-agent-based models of [[generalized reciprocity]], [[prejudice]], [[social influence]], and organizational [[information processing]]. In 1999, [[Nigel Gilbert]] published the first textbook on Social Simulation: ''Simulation for the social scientist'' and established its most relevant journal: the [[Journal of Artificial Societies and Social Simulation]].&lt;br /&gt;
&lt;br /&gt;
This cellular automata paradigm gave rise to a third wave of social simulation emphasizing agent-based modeling. Like micro-simulations, these models emphasized bottom-up designs but adopted four key assumptions that diverged from microsimulation: autonomy, interdependency, simple rules, and adaptive behavior. In 1981, mathematician and political scientist Robert Axelrod and evolutionary biologist W.D. Hamilton published a major paper in Science titled &amp;quot;The Evolution of Cooperation&amp;quot; which used an agent-based modeling approach to demonstrate how social cooperation based upon reciprocity can be established and stabilized in a prisoner's dilemma game when agents followed simple rules of self-interest. Axelrod and Hamilton demonstrated that individual agents following a simple rule set of (1) cooperate on the first turn and (2) thereafter replicate the partner's previous action were able to develop &amp;quot;norms&amp;quot; of cooperation and sanctioning in the absence of canonical sociological constructs such as demographics, values, religion, and culture as preconditions or mediators of cooperation. Throughout the 1990s, scholars like William Sims Bainbridge, Kathleen Carley, Michael Macy,  and John Skvoretz developed multi-agent-based models of generalized reciprocity, prejudice, social influence, and organizational information processing. In 1999, Nigel Gilbert published the first textbook on Social Simulation: Simulation for the social scientist and established its most relevant journal: the Journal of Artificial Societies and Social Simulation.&lt;br /&gt;
&lt;br /&gt;
元胞自动机范式引发了强调'''基于主体建模 Agent-based Modeling'''的第三次社会模拟浪潮。与微观模拟一样，这些模型强调自下而上的设计，但采用了与微观模拟不同的四个关键假设: '''自主性 Autonomy'''、'''相互依赖性 Interdependency'''、'''简单规则 Simple Rules'''和'''适应性行为 Adaptive Behavior'''。1981年，数学家、政治学家阿克塞尔罗德（Robert Axelrod）和进化生物学家汉密尔顿（W.D. Hamilton）在《科学》杂志上发表了一篇名为《合作的进化》（The Evolution of Cooperation）的重要论文，该论文采用基于主体建模方法，论证了在一个囚徒困境中，当主体遵循简单的自利规则时，互惠的社会合作是如何建立和稳定的。阿克塞尔罗德和汉密尔顿证明，主体遵循这样一套简单的规则: (1)在第一轮进行合作，(2)在其后重复伙伴以前的行动，能够在没有人口学差异、价值观、宗教和文化等社会规范作为合作的先决条件或中介的情况下制定合作和制裁的“规范”。整个20世纪90年代，像威廉·希姆斯·本布里奇（William Sims Bainbridge），Kathleen Carley，Michael Macy 和 John Skvoretz 这样的学者开发了基于多主体的广义互惠、偏见、社会影响和组织信息处理模型。1999年，吉尔伯特（Nigel Gilbert）出版了第一本关于社会模拟: 写给社会科学家的仿真模拟（Simulation for the social scientist）的教科书，并建立了它最相关的杂志: 人工社会和社会模拟杂志（the Journal of Artificial Societies and Social Simulation）。&lt;br /&gt;
&lt;br /&gt;
===Data mining and social network analysis 数据挖掘和社会网络分析===&lt;br /&gt;
&lt;br /&gt;
{{main|Data mining|Social network analysis}}&lt;br /&gt;
&lt;br /&gt;
--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） 少一段原文 &lt;br /&gt;
Independent from developments in computational models of social systems, social network analysis emerged in the 1970s and 1980s from advances in graph theory, statistics, and studies of social structure as a distinct analytical method and was articulated and employed by sociologists like James S. Coleman, Harrison White, Linton Freeman, J. Clyde Mitchell, Mark Granovetter, Ronald Burt, and Barry Wellman.[22] The increasing pervasiveness of computing and telecommunication technologies throughout the 1980s and 1990s demanded analytical techniques, such as network analysis and multilevel modeling, that could scale to increasingly complex and large data sets. The most recent wave of computational sociology, rather than employing simulations, uses network analysis and advanced statistical techniques to analyze large-scale computer databases of electronic proxies for behavioral data. Electronic records such as email and instant message records, hyperlinks on the World Wide Web, mobile phone usage, and discussion on Usenet allow social scientists to directly observe and analyze social behavior at multiple points in time and multiple levels of analysis without the constraints of traditional empirical methods such as interviews, participant observation, or survey instruments.[23] Continued improvements in machine learning algorithms likewise have permitted social scientists and entrepreneurs to use novel techniques to identify latent and meaningful patterns of social interaction and evolution in large electronic datasets.[24][25]&lt;br /&gt;
&lt;br /&gt;
Independent from developments in computational models of social systems, social network analysis emerged in the 1970s and 1980s from advances in graph theory, statistics, and studies of social structure as a distinct analytical method and was articulated and employed by sociologists like [[James Samuel Coleman|James S. Coleman]], [[Harrison White]], [[Linton Freeman]], [[J. Clyde Mitchell]], [[Mark Granovetter]], [[Ronald Burt]], and [[Barry Wellman]].&amp;lt;ref&amp;gt;{{cite book|title=The Development of Social Network Analysis: A Study in the Sociology of Science |first=Linton C. |last=Freeman |publisher=Empirical Press |location=Vancouver, BC |year=2004}}&amp;lt;/ref&amp;gt; The increasing pervasiveness of computing and telecommunication technologies throughout the 1980s and 1990s demanded analytical techniques, such as [[network theory|network analysis]] and [[multilevel modeling]], that could scale to increasingly complex and large data sets. The most recent wave of computational sociology, rather than employing simulations, uses network analysis and advanced statistical techniques to analyze large-scale computer databases of electronic proxies for behavioral data. Electronic records such as email and instant message records, hyperlinks on the [[World Wide Web]], mobile phone usage, and discussion on [[Usenet]] allow social scientists to directly observe and analyze social behavior at multiple points in time and multiple levels of analysis without the constraints of traditional empirical methods such as interviews, participant observation, or survey instruments.&amp;lt;ref&amp;gt;{{cite journal|title=Life in the network: the coming age of computational social science|first9=J|last10=Gutmann|first10=M.|last11=Jebara|first11=T.|last12=King|first12=G.|last13=Macy|first13=M.|last14=Roy|first14=D.|last15=Van Alstyne|first15=M.|last9=Fowler|first8=N|last8=Contractor|first7=N|last7=Christakis|first6=D|last6=Brewer|first5=AL|last5=Barabasi|first4=S |journal=Science|last4=Aral |date=February 6, 2009|first3=L |volume=323|pmid=19197046 |issue=5915|last3=Adamic |pages=721–723|pmc=2745217 |doi=10.1126/science.1167742 |first1=David |last1=Lazer |first2=Alex |last2=Pentland |display-authors=8}}&amp;lt;/ref&amp;gt; Continued improvements in [[machine learning]] algorithms likewise have permitted social scientists and entrepreneurs to use novel techniques to identify latent and meaningful patterns of social interaction and evolution in large electronic datasets.&amp;lt;ref&amp;gt;{{cite journal|first1=Jaideep |last1=Srivastava |first2=Robert |last2=Cooley |first3=Mukund |last3=Deshpande |first4=Pang-Ning |last4=Tan |journal=Proceedings of the ACM Conference on Knowledge Discovery and Data Mining |title=Web usage mining: discovery and applications of usage patterns from Web data|volume=1 |year=2000 |pages=12–23 |doi=10.1145/846183.846188|issue=2}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|doi=10.1016/S0169-7552(98)00110-X|title=The anatomy of a large-scale hypertextual Web search engine |first1=Sergey |last1=Brin |first2=Lawrence |last2=Page |journal=Computer Networks and ISDN Systems |volume=30 |issue=1–7 |pages=107–117 |date=April 1998|citeseerx=10.1.1.115.5930 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Independent from developments in computational models of social systems, social network analysis emerged in the 1970s and 1980s from advances in graph theory, statistics, and studies of social structure as a distinct analytical method and was articulated and employed by sociologists like James S. Coleman, Harrison White, Linton Freeman, J. Clyde Mitchell, Mark Granovetter, Ronald Burt, and Barry Wellman. The increasing pervasiveness of computing and telecommunication technologies throughout the 1980s and 1990s demanded analytical techniques, such as network analysis and multilevel modeling, that could scale to increasingly complex and large data sets. The most recent wave of computational sociology, rather than employing simulations, uses network analysis and advanced statistical techniques to analyze large-scale computer databases of electronic proxies for behavioral data. Electronic records such as email and instant message records, hyperlinks on the World Wide Web, mobile phone usage, and discussion on Usenet allow social scientists to directly observe and analyze social behavior at multiple points in time and multiple levels of analysis without the constraints of traditional empirical methods such as interviews, participant observation, or survey instruments. Continued improvements in machine learning algorithms likewise have permitted social scientists and entrepreneurs to use novel techniques to identify latent and meaningful patterns of social interaction and evolution in large electronic datasets.&lt;br /&gt;
&lt;br /&gt;
'''社会网络分析 Social Network Analysis'''独立于社会系统计算模型的发展，在20世纪70年代和80年代出现于图论、统计学和社会结构的研究中，它作为一种独特的分析方法被社会学家如 James s. Coleman，Harrison White，Linton Freeman，J. Clyde Mitchell，Mark Granovetter，Ronald Burt 和 Barry Wellman 等阐述和采用。在整个1980年代和1990年代，计算和通信技术日益普及，这要求采用诸如网络分析和多级建模等分析技术，这些技术可以扩展到日益复杂和庞大的数据集中。最近的计算社会学没有使用模拟，而是使用网络分析和先进的统计技术来分析大规模计算机数据库中电子代理的行为数据。电子记录，如电子邮件和即时消息记录，万维网上的超链接，移动电话数据，以及 Usenet 上的讨论，使社会科学家能够直接观察社会行为并在多个时间点和多个层次的分析行为，并且不受传统的实证方法，如访谈、观察（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]）为了通顺，删除研究对象/被试：participants）或调查工具的限制。机器学习算法的不断改进同样使得社会科学家和企业家能够使用新技术来识别大型电子数据集中潜在但有意义的社会互动和演化模式。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:Tripletsnew2012.png|thumb|right|Narrative network of US Elections 2012&amp;lt;ref name=&amp;quot;ReferenceA&amp;quot;&amp;gt;{{cite journal|title=Automated analysis of the US presidential elections using Big Data and network analysis|author1=S Sudhahar|author2=GA Veltri|author3=N Cristianini|journal=Big Data &amp;amp; Society|volume=2|issue=1|pages=1–28|year=2015|doi=10.1177/2053951715572916|doi-access=free}}&amp;lt;/ref&amp;gt;]]&lt;br /&gt;
&lt;br /&gt;
Narrative network of US Elections 2012&lt;br /&gt;
&lt;br /&gt;
【图2：Narrative network of US Elections 2012 + 2012年美国大选叙事网络】&lt;br /&gt;
&lt;br /&gt;
The automatic parsing of textual corpora has enabled the extraction of actors and their relational networks on a vast scale, turning textual data into network data.  The resulting networks, which can contain thousands of nodes, are then analysed by using tools from Network theory to identify the key actors, the key communities or parties, and general properties such as robustness or structural stability of the overall network, or centrality of certain nodes.&amp;lt;ref&amp;gt;{{cite journal|title=Network analysis of narrative content in large corpora|author1=S Sudhahar|author2=G De Fazio|author3=R Franzosi|author4=N Cristianini|journal=Natural Language Engineering|volume=21|issue=1|pages=1–32|year=2013|doi=10.1017/S1351324913000247 |url=https://research-information.bristol.ac.uk/files/129621186/Network_Analysis_of_Narrative_Content_in_Large_Corpora.pdf}}&amp;lt;/ref&amp;gt; This automates the approach introduced by quantitative narrative analysis,&amp;lt;ref&amp;gt;{{cite book|title=Quantitative Narrative Analysis|last=Franzosi|first=Roberto|publisher=Emory University|year=2010}}&amp;lt;/ref&amp;gt; whereby subject-verb-object triplets are identified with pairs of actors linked by an action, or pairs formed by actor-object.&amp;lt;ref name=&amp;quot;ReferenceA&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The automatic parsing of textual corpora has enabled the extraction of actors and their relational networks on a vast scale, turning textual data into network data.  The resulting networks, which can contain thousands of nodes, are then analysed by using tools from Network theory to identify the key actors, the key communities or parties, and general properties such as robustness or structural stability of the overall network, or centrality of certain nodes. This automates the approach introduced by quantitative narrative analysis, whereby subject-verb-object triplets are identified with pairs of actors linked by an action, or pairs formed by actor-object.&lt;br /&gt;
&lt;br /&gt;
文本语料库的自动解析使对参与者及其关系网络的大规模提取成为可能，它将文本数据转换为网络数据。由此产生的网络可以包含数千个'''节点 Nodes'''，然后利用网络理论中的工具对其进行分析，以确定关键参与者、关键群体，以及网络的总体特性如稳健性、结构稳定性，或某些节点的'''中心性 Centrality'''等。这使'''定量叙事分析Quantitative Narrative Analysis'''引入的方法得以自动化，据此，主语-动词-宾语三元组被看作由动作连接的成对行为者，或者由行为者-宾语形成的成对行为者。&lt;br /&gt;
&lt;br /&gt;
===Computational content analysis 计算机内容分析 （名词翻译可吗？）===&lt;br /&gt;
&lt;br /&gt;
[[Content analysis]] has been a traditional part of social sciences and media studies for a long time. The automation of content analysis has allowed a &amp;quot;[[big data]]&amp;quot; revolution to take place in that field, with studies in social media and newspaper content that include millions of news items. [[Gender bias]], [[readability]], content similarity, reader preferences, and even mood have been analyzed based on [[text mining]] methods over millions of documents.&amp;lt;ref&amp;gt;{{cite journal|author1=I. Flaounas|author2=M. Turchi|author3=O. Ali|author4=N. Fyson|author5=T. De Bie|author6=N. Mosdell|author7=J. Lewis|author8=N. Cristianini|title=The Structure of EU Mediasphere|journal=PLOS One|volume=5|issue=12|pages=e14243|year=2010|doi=10.1371/journal.pone.0014243|url=https://orca-mwe.cf.ac.uk/50732/1/Flaounas%202010.pdf|pmid=21170383|pmc=2999531|bibcode=2010PLoSO...514243F}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|title=Nowcasting Events from the Social Web with Statistical Learning|author1=V Lampos|author2=N Cristianini|journal=ACM Transactions on Intelligent Systems and Technology |volume=3|issue=4|page=72|doi=10.1145/2337542.2337557|year=2012|url=http://www.lampos.net/sites/default/files/papers/lampos2012nowcasting.pdf}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite conference|title=NOAM: news outlets analysis and monitoring system|author1=I. Flaounas|author2=O. Ali|author3=M. Turchi|author4=T Snowsill|author5=F Nicart|author6=T De Bie|author7=N Cristianini|conference=Proc. of the 2011 ACM SIGMOD international conference on Management of data|year=2011|url=http://www.tijldebie.net/system/files/SIGMOD_11_demo_Ilias.pdf|doi=10.1145/1989323.1989474}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite book|author=N Cristianini|title=''Combinatorial Pattern Matching''|pages=2–13|year=2011|volume=6661|series= Lecture Notes in Computer Science|isbn=978-3-642-21457-8|doi=10.1007/978-3-642-21458-5_2|chapter=Automatic Discovery of Patterns in Media Content|citeseerx=10.1.1.653.9525}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite journal|last=Lansdall-Welfare|first=Thomas|last2=Sudhahar|first2=Saatviga|last3=Thompson|first3=James|last4=Lewis|first4=Justin|last5=Team|first5=FindMyPast Newspaper|last6=Cristianini|first6=Nello|date=2017-01-09|title=Content analysis of 150 years of British periodicals|url=http://www.pnas.org/content/early/2017/01/03/1606380114|journal=Proceedings of the National Academy of Sciences|volume=114|issue=4|language=en|pages=E457–E465|doi=10.1073/pnas.1606380114|issn=0027-8424|pmid=28069962|pmc=5278459}}&amp;lt;/ref&amp;gt; The analysis of readability, gender bias and topic bias was demonstrated in Flaounas et al.&amp;lt;ref&amp;gt;{{cite journal|author1=I. Flaounas|author2=O. Ali|author3=M. Turchi|author4=T. Lansdall-Welfare|author5=T. De Bie|author6=N. Mosdell|author7=J. Lewis|author8=N. Cristianini|title=Research methods in the age of digital journalism|journal=Digital Journalism|year=2012|doi=10.1080/21670811.2012.714928|volume=1|pages=102–116}}&amp;lt;/ref&amp;gt; showing how different topics have different gender biases and levels of readability; the possibility to detect mood shifts in a vast population by analysing Twitter content was demonstrated as well.&amp;lt;ref&amp;gt;{{cite conference|title=Effects of the Recession on Public Mood in the UK|author=T Lansdall-Welfare|author2=V Lampos|author3=N Cristianini|series=Mining Social Network Dynamics (MSND) session on Social Media Applications|doi=10.1145/2187980.2188264|conference=Proceedings of the 21st International Conference on World Wide Web|pages=1221–1226|location=New York, NY, USA|url=http://www.cs.bris.ac.uk/Publications/Papers/2001521.pdf}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Content analysis has been a traditional part of social sciences and media studies for a long time. The automation of content analysis has allowed a &amp;quot;big data&amp;quot; revolution to take place in that field, with studies in social media and newspaper content that include millions of news items. Gender bias, readability, content similarity, reader preferences, and even mood have been analyzed based on text mining methods over millions of documents. The analysis of readability, gender bias and topic bias was demonstrated in Flaounas et al. showing how different topics have different gender biases and levels of readability; the possibility to detect mood shifts in a vast population by analysing Twitter content was demonstrated as well.&lt;br /&gt;
&lt;br /&gt;
长期以来，内容分析一直是社会科学和媒体研究的传统方法。内容分析的自动化使得这一领域发生了一场“大数据”革命，这些研究中，社交媒体和报纸内容包括了数百万条的新闻。基于文本挖掘方法，'''性别偏差Gender Bias'''、'''可读性 Readability'''、'''内容相似度 Content Similarity'''、'''读者偏好 Reader Preferences'''，甚至是'''情绪 Mood'''的数以百万计的文档都可以被分析。Flaounas等人对可读性、性别偏差和'''话题偏差 Topic Bias'''为主要研究对象，展示了不同的话题如何有不同水平的性别偏差和可读性; 展示了通过分析推特内容来检测人群情绪变化的可能性。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The analysis of vast quantities of historical newspaper content has been pioneered by Dzogang et al.,&amp;lt;ref&amp;gt;{{Cite journal|last=Dzogang|first=Fabon|last2=Lansdall-Welfare|first2=Thomas|last3=Team|first3=FindMyPast Newspaper|last4=Cristianini|first4=Nello|date=2016-11-08|title=Discovering Periodic Patterns in Historical News|journal=PLOS One|volume=11|issue=11|pages=e0165736|doi=10.1371/journal.pone.0165736|issn=1932-6203|pmc=5100883|pmid=27824911|bibcode=2016PLoSO..1165736D}}&amp;lt;/ref&amp;gt; which showed how periodic structures can be automatically discovered in historical newspapers. A similar analysis was performed on social media, again revealing strongly periodic structures.&amp;lt;ref&amp;gt;[https://core.ac.uk/download/pdf/83929129.pdf Seasonal Fluctuations in Collective Mood Revealed by Wikipedia Searches and Twitter Posts] F Dzogang, T Lansdall-Welfare, N Cristianini - 2016 IEEE International Conference on Data Mining, Workshop on ''Data Mining'' in Human Activity Analysis&lt;br /&gt;
&lt;br /&gt;
The analysis of vast quantities of historical newspaper content has been pioneered by Dzogang et al., which showed how periodic structures can be automatically discovered in historical newspapers. A similar analysis was performed on social media, again revealing strongly periodic structures.&amp;lt;ref&amp;gt;[https://core.ac.uk/download/pdf/83929129.pdf Seasonal Fluctuations in Collective Mood Revealed by Wikipedia Searches and Twitter Posts] F Dzogang, T Lansdall-Welfare, N Cristianini - 2016 IEEE International Conference on Data Mining, Workshop on Data Mining in Human Activity Analysis&lt;br /&gt;
&lt;br /&gt;
对大量历史报纸内容的分析是由 Dzogang 等人率先进行的，他们展示了如何在历史报纸中自动发现'''周期结构 Periodic Structures'''。一个类似的社交媒体上进行的分析，也揭示了强烈的周期性结构。 参考文献[ https://core.ac.uk/download/pdf/83929129.pdf 维基百科搜索和推特帖子揭示的集体情绪的季节性波动] f Dzogang，t Lansdall-Welfare，n Cristianini-2016 IEEE International Conference on Data Mining, Workshop on Data Mining in Human Activity Analysis&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
==Challenges 挑战==&lt;br /&gt;
&lt;br /&gt;
Computational sociology, as with any field of study, faces a set of challenges.&amp;lt;ref name=&amp;quot;MCSS&amp;quot;&amp;gt;Conte, Rosaria, et al. &amp;quot;[https://link.springer.com/content/pdf/10.1140%252Fepjst%252Fe2012-01697-8.pdf Manifesto of computational social science].&amp;quot; The European Physical Journal Special Topics 214.1 (2012): 325-346.&amp;lt;/ref&amp;gt; These challenges need to be handled meaningfully so as to make the maximum impact on society.&lt;br /&gt;
&lt;br /&gt;
Computational sociology, as with any field of study, faces a set of challenges. These challenges need to be handled meaningfully so as to make the maximum impact on society.&lt;br /&gt;
&lt;br /&gt;
计算社会学和其他研究领域一样面临着一系列的挑战。必须有意义地处理这些挑战（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） meaningfully怎么翻译才比较通顺？），才能对社会产生最大的影响。&lt;br /&gt;
  &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Levels and their interactions 层级和层级的交互关系===&lt;br /&gt;
&lt;br /&gt;
Each society that is formed tends to be in one level or the other and there exists tendencies of interactions between and across these levels. Levels need not only be micro-level or macro-level in nature. There can be intermediate levels in which a society exists say - groups, networks, communities etc.&amp;lt;ref name=&amp;quot;MCSS&amp;quot; /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Each society that is formed tends to be in one level or the other and there exists tendencies of interactions between and across these levels. Levels need not only be micro-level or macro-level in nature. There can be intermediate levels in which a society exists say - groups, networks, communities etc.&lt;br /&gt;
&lt;br /&gt;
形成的每个社会都处于某种层次上，并且这些层次之间有相互作用的倾向。社会中的级别不仅可以分为微观或宏观的层次，还可以存在中间的层次，比如群体、网络、社区等。&lt;br /&gt;
（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） 合并了英文的原句）&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The question however arises as to how to identify these levels and how they come into existence? And once they are in existence how do they interact within themselves and with other levels?&lt;br /&gt;
&lt;br /&gt;
The question however arises as to how to identify these levels and how they come into existence? And once they are in existence how do they interact within themselves and with other levels?&lt;br /&gt;
&lt;br /&gt;
然而问题是，这些层次是如何确定的以及如何产生的？并且，一旦它们产生了，它们如何在自身内部以及与其他层次相互作用？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
If we view entities (agents) as nodes and the connections between them as the edges, we see the formation of networks. The connections in these networks do not come about based on just objective relationships between the entities, rather they are decided upon by factors chosen by the participating entities.&amp;lt;ref&amp;gt;{{cite journal|last1=Egu´ıluz|first1=V. M.|last2=Zimmermann|first2=M. G.|last3=Cela-Conde|first3=C. J.|last4=San Miguel|first4=M.|title=American Journal of Sociology|issue=2005|pages=110, 977}}&amp;lt;/ref&amp;gt; The challenge with this process is that, it is difficult to identify when a set of entities will form a network. These networks may be of trust networks, co-operation networks, dependence networks etc. There have been cases where heterogeneous set of entities have shown to form strong and meaningful networks among themselves.&amp;lt;ref&amp;gt;{{cite journal|last1=Sichman|first1=J. S.|last2=Conte|first2=R.|title=Computational &amp;amp; Mathematical Organization Theory|issue=2002|pages=8(2)}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Ehrhardt|first1=G.|last2=Marsili|first2=M.|last3=Vega-Redondo|first3=F.|title=Physical Review E|issue=2006|pages=74(3)}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
If we view entities (agents) as nodes and the connections between them as the edges, we see the formation of networks. The connections in these networks do not come about based on just objective relationships between the entities, rather they are decided upon by factors chosen by the participating entities. The challenge with this process is that, it is difficult to identify when a set of entities will form a network. These networks may be of trust networks, co-operation networks, dependence networks etc. There have been cases where heterogeneous set of entities have shown to form strong and meaningful networks among themselves.&lt;br /&gt;
&lt;br /&gt;
如果我们把'''实体 Entities'''（'''主体 Agents'''）看作节点，把它们之间的连接看作边，我们就看到了网络的形成。这些网络中的连接并非只是基于实体之间的客观关系，而是由实体选择的因素决定的。这个过程的困难之处在于，很难确定一组实体何时形成网络。这些网络可以是信任网络、合作网络、依赖网络等。在一些情况下，异质的实体集在它们之间形成了强大而有意义的网络。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
As discussed previously, societies fall into levels and in one such level, the individual level, a micro-macro link&amp;lt;ref&amp;gt;Billari, Francesco C. [https://books.google.com/books?hl=en&amp;amp;lr=&amp;amp;id=Tc8iL0b-OycC&amp;amp;oi=fnd&amp;amp;pg=PA1&amp;amp;dq=%22Agent-based+computational+modelling:+applications+in+demography,+social,+economic+and+environmental+sciences%22&amp;amp;ots=6MNVK7JP-e&amp;amp;sig=-o_iS9zCK3r-t1eHn3554UVadUs Agent-based computational modelling: applications in demography, social, economic and environmental sciences]. Taylor &amp;amp; Francis, 2006.&amp;lt;/ref&amp;gt; refers to the interactions which create higher-levels. There are a set of questions that needs to be answered regarding these Micro-Macro links. How they are formed? When do they converge? What is the feedback pushed to the lower levels and how are they pushed?&lt;br /&gt;
&lt;br /&gt;
As discussed previously, societies fall into levels and in one such level, the individual level, a micro-macro link refers to the interactions which create higher-levels. There are a set of questions that needs to be answered regarding these Micro-Macro links. How they are formed? When do they converge? What is the feedback pushed to the lower levels and how are they pushed?&lt;br /&gt;
&lt;br /&gt;
正如前面所讨论的，社会分为不同层次。在其中的一个层次：个体层次中，'''微观-宏观联系 Micro-macro Link'''指的是创造更高层次的相互作用。关于微观-宏观链接有一系列问题等待回答。它们是如何形成的？它们什么时候汇聚？什么反馈被推到了较低的层次，以及它们是如何被推到较低层次的？ &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Another major challenge in this category concerns the validity of information and their sources. In recent years there has been a boom in information gathering and processing. However, little attention was paid to the spread of false information between the societies. Tracing back the sources and finding ownership of such information is difficult.&lt;br /&gt;
&lt;br /&gt;
Another major challenge in this category concerns the validity of information and their sources. In recent years there has been a boom in information gathering and processing. However, little attention was paid to the spread of false information between the societies. Tracing back the sources and finding ownership of such information is difficult.&lt;br /&gt;
&lt;br /&gt;
这一分类的另一个主要挑战涉及信息的有效性及其来源。近年来，信息收集和处理有着蓬勃的发展。但人们很少注意到社会之间虚假信息的传播。追溯资料来源并找到这些资料的所有者是很困难的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Culture modeling 文化建模===&lt;br /&gt;
&lt;br /&gt;
The evolution of the networks and levels in the society brings about cultural diversity.&amp;lt;ref&amp;gt;{{cite journal|last1=Centola|first1=D.|last2=Gonz´alez-Avella|first2=J. C.|last3=Egu´ıluz|first3=V. M.|last4=San Miguel|first4=M.|title=Journal of Conflict Resolution|issue=2007|pages=51}}&amp;lt;/ref&amp;gt; A thought which arises however is that, when people tend to interact and become more accepting of other cultures and beliefs, how is it that diversity still persists? Why is there no convergence? A major challenge is how to model these diversities. Are there external factors like mass media, locality of societies etc. which influence the evolution or persistence of cultural diversities?{{Citation needed|reason=Sounds just like personal thoughts|date=May 2017}}&lt;br /&gt;
&lt;br /&gt;
The evolution of the networks and levels in the society brings about cultural diversity. A thought which arises however is that, when people tend to interact and become more accepting of other cultures and beliefs, how is it that diversity still persists? Why is there no convergence? A major challenge is how to model these diversities. Are there external factors like mass media, locality of societies etc. which influence the evolution or persistence of cultural diversities?&lt;br /&gt;
&lt;br /&gt;
社会网络和层次的演变带来了文化的多样性。然而人们会想，当人们倾向于相互作用，变得更能接受其他文化和信仰时，为什么多样性仍然存在？为什么人们没有趋同？一个主要的挑战是如何为这些多样性建立模型。是否存在大众传媒、社会地域性等外部因素，这些因素影响文化多样性的演化或保持？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Experimentation and evaluation 实验和评估===&lt;br /&gt;
&lt;br /&gt;
Any study or modelling when combined with experimentation needs to be able to address the questions being asked. [[Computational social science]] deals with large scale data and the challenge becomes much more evident as the scale grows. How would one design informative simulations on a large scale? And even if a large scale simulation is brought up, how is the evaluation supposed to be performed?&lt;br /&gt;
&lt;br /&gt;
Any study or modelling when combined with experimentation needs to be able to address the questions being asked. Computational social science deals with large scale data and the challenge becomes much more evident as the scale grows. How would one design informative simulations on a large scale? And even if a large scale simulation is brought up, how is the evaluation supposed to be performed?&lt;br /&gt;
&lt;br /&gt;
任何与实验结合的研究或建模都需要能够解决所提出的问题。计算社会科学处理大规模数据，并且数据规模越大建模的挑战就越明显。如何在一个大规模的数据集里设计信息仿真模型？并且，即使提出了一个大规模的仿真模型，应该如何对它进行评估？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Model choice and model complexities 模型选择和模型复杂性===&lt;br /&gt;
&lt;br /&gt;
Another challenge is identifying the models that would best fit the data and the complexities of these models. These models would help us predict how societies might evolve over time and provide possible explanations on how things work.&amp;lt;ref&amp;gt;Weisberg, Michael. [http://www.academia.edu/download/30604870/lessmorefinal.pdf When less is more: Tradeoffs and idealization in model building]. Diss. Stanford University, 2003.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Another challenge is identifying the models that would best fit the data and the complexities of these models. These models would help us predict how societies might evolve over time and provide possible explanations on how things work.&lt;br /&gt;
&lt;br /&gt;
另一个挑战是确定最适合数据的模型，以及最合适的'''模型复杂性 Model Complexities'''。这些模型将帮助我们预测随着时间的推移社会将如何演变，并为事物如何运动和变化提供可能的解释。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====Generative models 生成模型====&lt;br /&gt;
&lt;br /&gt;
Generative models helps us to perform extensive qualitative analysis in a controlled fashion. A model proposed by Epstein, is the agent-based simulation, which talks about identifying an initial set of heterogeneous entities (agents) and observe their evolution and growth based on simple local rules.&amp;lt;ref&amp;gt;Epstein, Joshua M. [https://www.researchgate.net/profile/Eric_Jones14/publication/283615593_Book_Review_-_Generative_Social_Science_Studies_in_Agent-Based_Computational_Modeling/links/5641398808aebaaea1f70216.pdf Generative social science: Studies in agent-based computational modeling]. Princeton University Press, 2006.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Generative models helps us to perform extensive qualitative analysis in a controlled fashion. A model proposed by Epstein, is the agent-based simulation, which talks about identifying an initial set of heterogeneous entities (agents) and observe their evolution and growth based on simple local rules.&lt;br /&gt;
&lt;br /&gt;
'''生成模型 Generative Models'''帮助我们以一种受控的方式进行广泛的定性分析。爱泼斯坦（Epstein）提出的一个基于主体的模型，就是探讨如何识别异质实体(主体)的'''初始集 Initial Set'''，并根据简单的局部规则观察它们的演化和增长。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
But what are these local rules? How does one identify them for a set of heterogeneous agents? Evaluation and impact of these rules state a whole new set of difficulties.&lt;br /&gt;
&lt;br /&gt;
But what are these local rules? How does one identify them for a set of heterogeneous agents? Evaluation and impact of these rules state a whole new set of difficulties.&lt;br /&gt;
&lt;br /&gt;
但是这些局部规则是什么呢？如何识别一组异质实体？这些规则的评估和影响都是新出现的困难之处。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====Heterogeneous or ensemble models 异质模型和组合模型====&lt;br /&gt;
&lt;br /&gt;
Integrating simple models which perform better on individual tasks to form a Hybrid model is an approach that can be looked into{{Citation needed|reason=unsupported claims|date=May 2017}}. These models can offer better performance and understanding of the data. However the trade-off of identifying and having a deep understanding of the interactions between these simple models arises when one needs to come up with one combined, well performing model. Also, coming up with tools and applications to help analyse and visualize the data based on these hybrid models is another added challenge.&lt;br /&gt;
&lt;br /&gt;
Integrating simple models which perform better on individual tasks to form a Hybrid model is an approach that can be looked into. These models can offer better performance and understanding of the data. However the trade-off of identifying and having a deep understanding of the interactions between these simple models arises when one needs to come up with one combined, well performing model. Also, coming up with tools and applications to help analyse and visualize the data based on these hybrid models is another added challenge.&lt;br /&gt;
&lt;br /&gt;
集成在单个任务中表现良好的简单模型并形成'''混合模型 Hybrid model'''是一种可以继续考虑的方法。这些模型有更好的性能并可以对数据提供更好的理解。然而，当需要提出一个整合的、性能良好的模型时，识别简单模型和深入理解模型之间相互作用的权衡问题就出现了。此外，另一个挑战是开发工具和应用程序来帮助分析和可视化基于这些混合模型的数据。&lt;br /&gt;
&lt;br /&gt;
==Impact 影响==&lt;br /&gt;
&lt;br /&gt;
Computational sociology can bring impacts to science, technology and society.&amp;lt;ref name=&amp;quot;MCSS&amp;quot; /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Computational sociology can bring impacts to science, technology and society.&lt;br /&gt;
&lt;br /&gt;
计算社会学可以给科学、技术和社会带来影响。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Impact on science 对科学的影响===&lt;br /&gt;
&lt;br /&gt;
In order for the study of computational sociology to be effective, there has to be valuable innovations. These innovation can be of the form of new data analytics tools, better models and algorithms. The advent of such innovation will be a boon for the scientific community in large. {{Citation needed|reason=citation for claim on innovation and the type of innovation|date=May 2017}}&lt;br /&gt;
&lt;br /&gt;
In order for the study of computational sociology to be effective, there has to be valuable innovations. These innovation can be of the form of new data analytics tools, better models and algorithms. The advent of such innovation will be a boon for the scientific community in large. &lt;br /&gt;
&lt;br /&gt;
为了使计算社会学的研究有效，必须有一些有价值的创新。这些创新可以是新形式的数据分析工具，或更好的模型和算法。这些创新的出现将为整个科学界带来益处。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Impact on society 对社会的影响===&lt;br /&gt;
&lt;br /&gt;
One of the major challenges of computational sociology is the modelling of social processes {{Citation needed|reason=to support the claim for need of modeling of social processes|date=May 2017}}. Various law and policy makers would be able to see efficient and effective paths to issue new guidelines and the mass in general would be able to evaluate and gain fair understanding of the options presented in front of them enabling an open and well balanced decision process. {{Citation needed|reason=unsupported claims|date=May 2017}}.&lt;br /&gt;
&lt;br /&gt;
One of the major challenges of computational sociology is the modelling of social processes . Various law and policy makers would be able to see efficient and effective paths to issue new guidelines and the mass in general would be able to evaluate and gain fair understanding of the options presented in front of them enabling an open and well balanced decision process. &lt;br /&gt;
&lt;br /&gt;
计算社会学的主要挑战之一是对社会过程的建模。各种法律和政策制定者将能够得到发布新指导方针的快速有效的方法，广大群众将能够评价和更好地理解各种备选方案，从而实现决策进程的公开和平衡。&lt;br /&gt;
&lt;br /&gt;
==Journals and academic publications 期刊和学术出版物==&lt;br /&gt;
&lt;br /&gt;
The most relevant journal of the discipline is the [[Journal of Artificial Societies and Social Simulation]].&lt;br /&gt;
&lt;br /&gt;
The most relevant journal of the discipline is the Journal of Artificial Societies and Social Simulation.&lt;br /&gt;
&lt;br /&gt;
该学科最相关的期刊是《人工社会与社会模拟（the Journal of Artificial Societies and Social Simulation）》。&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20100611121626/http://www.ccsr.uiuc.edu/web/Journals/Journals.html Complexity Research Journal List], from UIUC, IL 复杂研究期刊列表（资料来自伊利诺伊大学香槟分校）&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20100611091342/http://www.ccsr.uiuc.edu/web/Groups/Groups.html Related Research Groups], from UIUC, IL 相关研究组（资料来自伊利诺伊大学香槟分校）&lt;br /&gt;
&lt;br /&gt;
==Associations, conferences and workshops 协会、会议及工作坊==&lt;br /&gt;
&lt;br /&gt;
*[http://www.casos.cs.cmu.edu/naacsos/ North American Association for Computational Social and Organization Sciences]&lt;br /&gt;
&lt;br /&gt;
*[http://www.essa.eu.org/ ESSA: European Social Simulation Association]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Academic programs, departments and degrees 学术课程、院系和学位==&lt;br /&gt;
&lt;br /&gt;
* [http://mediapatterns.enm.bris.ac.uk/ University of Bristol &amp;quot;Mediapatterns&amp;quot; project]&lt;br /&gt;
&lt;br /&gt;
* [http://www.cos.cs.cmu.edu/ Carnegie Mellon University], [http://www.casos.cs.cmu.edu PhD program] in Computation, Organizations and Society (COS)&lt;br /&gt;
&lt;br /&gt;
* [http://www.uchicago.edu University of Chicago]&lt;br /&gt;
&lt;br /&gt;
** [https://macss.uchicago.edu/ Certificate, MA and PhD in Computational Social Sciences]&lt;br /&gt;
&lt;br /&gt;
* [http://www.gmu.edu George Mason University]&lt;br /&gt;
&lt;br /&gt;
** PhD program in [http://css.gmu.edu CSS (Computational Social Sciences)]&lt;br /&gt;
&lt;br /&gt;
** MA program in [http://mais.gmu.edu/programs/la-mais-css Master's of Interdisciplinary Studies, CSS emphasis]&lt;br /&gt;
&lt;br /&gt;
* [http://www.pdx.edu/sysc/program-systems-science-phd-program Portland State], PhD program in Systems Science&lt;br /&gt;
&lt;br /&gt;
* [http://www.pdx.edu/sysc/program-systems-science-masters-program Portland State], MS program in Systems Science&lt;br /&gt;
&lt;br /&gt;
* [http://www.ucd.ie University College Dublin], &lt;br /&gt;
&lt;br /&gt;
** PhD Program in [http://www.ucd.ie/geary/postgraduatetraining/cscs Complex Systems and Computational Social Science]&lt;br /&gt;
&lt;br /&gt;
** MSc in [https://sisweb.ucd.ie/usis/!W_HU_MENU.P_PUBLISH?p_tag=PROG&amp;amp;MAJR=W390 Social Data Analytics] &lt;br /&gt;
&lt;br /&gt;
** BSc in [https://www.myucd.ie/courses/social-sciences/computational-social-science Computational Social Science] &lt;br /&gt;
&lt;br /&gt;
* [https://archive.is/20121215023745/http://hcs.ucla.edu/courses.htm UCLA], Minor in Human Complex Systems&lt;br /&gt;
&lt;br /&gt;
* [http://www.cs.ucla.edu/~cyber/ UCLA], Major in Computational &amp;amp; Systems Biology (including behavioral sciences)&lt;br /&gt;
&lt;br /&gt;
* [http://cscs.umich.edu/education/undergrad/undergrad.html Univ. of Michigan], Minor in Complex Systems&lt;br /&gt;
&lt;br /&gt;
* [http://www.pdx.edu/sysc/resources-other-systems-science-programs Systems Sciences Programs List], Portland State.  List of other worldwide related programs.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Centers and institutes 中心和机构==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===North America 北美===&lt;br /&gt;
&lt;br /&gt;
* [http://cnets.indiana.edu/ Center for Complex Networks and Systems Research], Indiana University, Bloomington, IN, USA.&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20110430200327/http://www.ccsr.uiuc.edu/ Center for Complex Systems Research], University of Illinois at Urbana-Champaign, IL, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://socialcomplexity.gmu.edu/ Center for Social Complexity], George Mason University, Fairfax, VA, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.asu.edu/clas/csdc/ Center for Social Dynamics and Complexity], Arizona State University, Tempe, AZ, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.cscs.umich.edu/ Center of the Study of Complex Systems], University of Michigan, Ann Arbor, MI, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://hcs.ucla.edu/ Human Complex Systems], University of California Los Angeles, Los Angeles, CA, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.iq.harvard.edu/ Institute for Quantitative Social Science], Harvard University, Boston, MA, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.nico.northwestern.edu/ Northwestern Institute on Complex Systems (NICO)], Northwestern University, Evanston, IL USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.santafe.edu/ Santa Fe Institute], Santa Fe, NM, USA.&lt;br /&gt;
&lt;br /&gt;
* Duke Network Analysis Center, [[Duke University]], Durham, NC, USA&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===South America 南美===&lt;br /&gt;
&lt;br /&gt;
* [http://www5.each.usp.br/mestrado-academico-em-modelagem-de-sistemas-complexos/ Modelagem de Sistemas Complexos], University of São Paulo - EACH, São Paulo, SP, Brazil&lt;br /&gt;
&lt;br /&gt;
* [http://inct.cnpq.br/web/inct-sc Instituto Nacional de Ciência e Tecnologia de Sistemas Complexos], Centro Brasileiro de Pesquisas Físicas, Rio de Janeiro, RJ, Brazil&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Europe 欧洲===&lt;br /&gt;
&lt;br /&gt;
* [http://cfpm.org Centre for Policy Modelling], Manchester, UK.&lt;br /&gt;
&lt;br /&gt;
* [http://cress.soc.surrey.ac.uk/ Centre for Research in Social Simulation], University of Surrey, UK.&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20130425014018/http://dl.ucd.ie/ UCD Dynamics Lab- Centre for Computational Social Science], Geary Institute for Public Policy, University College Dublin, Ireland.&lt;br /&gt;
&lt;br /&gt;
* [http://www.rug.nl/research/gcscs/ Groningen Center for Social Complexity Studies (GCSCS)], Groningen, NL.&lt;br /&gt;
&lt;br /&gt;
* [http://www.soms.ethz.ch/ Chair of Sociology, in particular of Modeling and Simulation (SOMS)], Zürich, Switzerland.&lt;br /&gt;
&lt;br /&gt;
* [http://www.eco.unibs.it/gecs/ Research Group on Experimental and Computational Sociology (GECS)], Brescia, IT.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Asia 亚洲===&lt;br /&gt;
&lt;br /&gt;
* [http://bandungfe.net Bandung Fe Institute, Centre for Complexity in Surya University], Bandung, Indonesia.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== See also 参见==&lt;br /&gt;
&lt;br /&gt;
* [[Artificial society]] 人工社会&lt;br /&gt;
&lt;br /&gt;
* [[Simulated reality]] 虚拟现实&lt;br /&gt;
&lt;br /&gt;
* [[Social simulation]] 社会仿真&lt;br /&gt;
&lt;br /&gt;
* [[Agent-based social simulation]] 基于主体的社会仿真&lt;br /&gt;
&lt;br /&gt;
* [[Social complexity]] 社会复杂性&lt;br /&gt;
&lt;br /&gt;
* [[Computational economics]] 计算经济学&lt;br /&gt;
&lt;br /&gt;
* [[Computational epidemiology]] 计算流行病学&lt;br /&gt;
&lt;br /&gt;
* [[Cliodynamics]] 历史动力学&lt;br /&gt;
&lt;br /&gt;
* [[Predictive analytics]] 预测分析&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&lt;br /&gt;
{{reflist|35em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==External links 外部链接==&lt;br /&gt;
&lt;br /&gt;
*[http://cress.soc.surrey.ac.uk/s4ss/ On-line book &amp;quot;Simulation for the Social Scientist&amp;quot; by Nigel Gilbert and Klaus G. Troitzsch, 1999, second edition 2005 社会科学家的仿真建模 电子书 作者：Nigel Gilbert and Klaus G. Troitzsch 第二版（2005年版）]&lt;br /&gt;
&lt;br /&gt;
*[http://jasss.soc.surrey.ac.uk/JASSS.html Journal of Artificial Societies and Social Simulation 人工社会和社会建模仿真期刊]&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20110516072744/http://cmol.nbi.dk/models/ Agent based models for social networks, interactive java applets 基于主体的社会网络模型，交互式 java 小程序]&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20090827052722/http://www.personal.kent.edu/~bcastel3/ Sociology and Complexity Science Website 社会学与复杂性科学网站]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:Subfields of sociology]]&lt;br /&gt;
&lt;br /&gt;
Category:Subfields of sociology&lt;br /&gt;
&lt;br /&gt;
范畴: 社会学的子领域&lt;br /&gt;
&lt;br /&gt;
[[Category:Complex systems theory]]&lt;br /&gt;
&lt;br /&gt;
Category:Complex systems theory&lt;br /&gt;
&lt;br /&gt;
范畴: 复杂系统理论&lt;br /&gt;
&lt;br /&gt;
[[Category:Methods in sociology]]&lt;br /&gt;
&lt;br /&gt;
Category:Methods in sociology&lt;br /&gt;
&lt;br /&gt;
范畴: 社会学方法&lt;br /&gt;
&lt;br /&gt;
[[Category:Computational fields of study]]&lt;br /&gt;
&lt;br /&gt;
Category:Computational fields of study&lt;br /&gt;
&lt;br /&gt;
类别: 研究的计算领域&lt;br /&gt;
&lt;br /&gt;
&amp;lt;noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;small&amp;gt;This page was moved from [[wikipedia:en:Computational sociology]]. Its edit history can be viewed at [[社会计算/edithistory]]&amp;lt;/small&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:待整理页面]]&lt;br /&gt;
&lt;br /&gt;
== 编者推荐 ==&lt;br /&gt;
=== 书籍推荐 ===&lt;br /&gt;
====[https://e.jd.com/30159646.html 社会计算的基本方法与应用]====&lt;br /&gt;
这是中科院自动化所的王飞跃老师关于社会计算的专著，从利用计算技术解决社会问题的角度介绍社会计算。阅读难度可能较高。&lt;br /&gt;
&lt;br /&gt;
=== 集智推荐 ===&lt;br /&gt;
====[https://campus.swarma.org/course/1028 2019 International Conference of Social Computing]====&lt;br /&gt;
本课程是2019年8月26日、27日的2019 International Conference of Social Computing记录。教师团队由芝加哥大学社会学系James Evans教授，Science University of Gottingen傅晓明教授，清华大学罗家德教授，电子科技大学周涛教授等多位老师组成。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://campus.swarma.org/course/1016 复杂系统与社会计算研讨会]====&lt;br /&gt;
本课程是，2019年10月27日北京计算科学研究中心主办的复杂系统与社会计算研讨会活动记录。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://pattern.swarma.org/path?id=12 计算社会科学入门路径]====&lt;br /&gt;
计算社会科学诞生至今，已有将近10年。在自然科学领域已经广泛应用大数据、分布式计算等方式提高研究质量的今天，社会科学领域涉及到的核心数据仍然被少数机构所拥有并创造着巨大的价值。本文将从计算社会科学的发展历史，常用方法，以及前沿问题来给大家粗略地展示计算社会科学的脉络。&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E7%A4%BE%E4%BC%9A%E8%AE%A1%E7%AE%97&amp;diff=11178</id>
		<title>社会计算</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E7%A4%BE%E4%BC%9A%E8%AE%A1%E7%AE%97&amp;diff=11178"/>
		<updated>2020-07-26T09:58:02Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;#重定向 [[社会计算]]&lt;br /&gt;
此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。&lt;br /&gt;
{{sociology}}&amp;lt;onlyinclude&amp;gt;&amp;lt;!-- &lt;br /&gt;
&lt;br /&gt;
&amp;lt;onlyinclude&amp;gt;&amp;lt;!-- &lt;br /&gt;
&lt;br /&gt;
只包括! -- &lt;br /&gt;
&lt;br /&gt;
While editing this lead/intro, please keep your text BELOW this line - this will make it easier to automatically insert the lede into other articles --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
  While editing this lead/intro, please keep your text BELOW this line - this will make it easier to automatically insert the lede into other articles --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
当编辑这个导语 / 介绍，请保持你的文本下面这行-这将使它更容易自动插入到其他文章的莱德-&lt;br /&gt;
&lt;br /&gt;
'''Computational sociology''' is a branch of [[sociology]] that uses computationally intensive methods to analyze and model social phenomena. Using [[computer simulation]]s, [[artificial intelligence]], complex statistical methods, and analytic approaches like [[social network analysis]], computational sociology develops and tests theories of complex social processes through bottom-up modeling of social interactions.&amp;lt;ref name=&amp;quot;MW&amp;quot;&amp;gt;{{cite journal|doi=10.1146/annurev.soc.28.110601.141117|title=From Factors to Actors: Computational Sociology and Agent-Based Modeling |first1=Michael W. |last1=Macy |first2=Robert |last2=Willer |journal=Annual Review of Sociology |volume=28 |pages=143–166 |jstor=3069238|year=2002}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Computational sociology is a branch of sociology that uses computationally intensive methods to analyze and model social phenomena. Using computer simulations, artificial intelligence, complex statistical methods, and analytic approaches like social network analysis, computational sociology develops and tests theories of complex social processes through bottom-up modeling of social interactions.&lt;br /&gt;
&lt;br /&gt;
'''计算社会学 Computational Sociology''' 是社会学的一个分支，它使用计算密集型方法来分析和模拟社会现象。&amp;lt;font color='red'&amp;gt;计算社会学通过使用计算机模拟、人工智能、复杂统计方法以及社会网络分析等分析方法自下而上地建立社会互动模型，是建立并检验复杂社会过程的理论。&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;  借助计算机模拟、人工智能、复杂统计方法以及社会网络分析等分析方法，计算社会学通过自下而上地建立社会互动模型来发展和检验关于复杂社会过程的理论。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
It involves the understanding of social agents, the interaction among these agents, and the effect of these interactions on the social aggregate.&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;&amp;gt;{{cite book|last1=Gilbert |first1=Nigel |last2=Troitzsch |first2=Klaus |year=2005 |title=Simulation for Social Scientists |edition=2 |chapter=Simulation and social science |publisher=Open University Press |chapter-url=http://cress.soc.surrey.ac.uk/s4ss/}}&amp;lt;/ref&amp;gt; Although the subject matter and methodologies in [[social science]] differ from those in [[natural science]] or [[computer science]], several of the approaches used in contemporary [[social simulation]] originated from fields such as [[physics]] and [[artificial intelligence]].&amp;lt;ref name=&amp;quot;Artificial Societies&amp;quot;&amp;gt;{{cite book|last1=Epstein |first1=Joshua M. |last2=Axtell |first2=Robert |year=1996 |title=Growing Artificial Societies: Social Science from the Bottom Up |location=Washington DC |publisher=Brookings Institution Press|url=https://archive.org/details/growingartificia00epst|url-access=registration |isbn=978-0262050531 }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;Cooperation&amp;quot;&amp;gt;{{cite book|last1=Axelrod |first1=Robert |year=1997 |title=The Complexity of Cooperation: Agent-Based Models of Competition and Collaboration |location=Princeton, NJ |publisher=Princeton University Press}}&amp;lt;/ref&amp;gt; Some of the approaches that originated in this field have been imported into the natural sciences, such as measures of [[centrality|network centrality]] from the fields of [[social network analysis]] and [[network science]].&lt;br /&gt;
&lt;br /&gt;
It involves the understanding of social agents, the interaction among these agents, and the effect of these interactions on the social aggregate. Although the subject matter and methodologies in social science differ from those in natural science or computer science, several of the approaches used in contemporary social simulation originated from fields such as physics and artificial intelligence. Some of the approaches that originated in this field have been imported into the natural sciences, such as measures of network centrality from the fields of social network analysis and network science.&lt;br /&gt;
&lt;br /&gt;
它涉及理解社会行为主体和它们的相互作用，以及这些相互作用如何影响社会总体(--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） social aggregate--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|讨论]]） 我觉得这样翻译是ok的)。虽然社会科学的主题和方法不同于自然科学或计算机科学，但当代社会仿真模拟中使用的一些方法起源于物理学和人工智能等领域。这一领域的一些方法，如来自社会网络分析和网络科学领域的网络中心性度量方法等，早已被引入到自然科学中。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In relevant literature, computational sociology is often related to the study of [[social complexity]].&amp;lt;ref&amp;gt;{{cite journal|last=Casti |first=J |year=1999 |title=The Computer as Laboratory: Toward a Theory of Complex Adaptive Systems |journal=Complexity |volume=4 |issue=5 |pages=12–14 |doi=10.1002/(SICI)1099-0526(199905/06)4:5&amp;lt;12::AID-CPLX3&amp;gt;3.0.CO;2-4}}&amp;lt;/ref&amp;gt; Social complexity concepts such as [[complex systems]], [[non-linear]] interconnection among macro and micro process, and [[emergence]], have entered the vocabulary of computational sociology.&amp;lt;ref&amp;gt;{{cite journal|last=Goldspink |first=C |year=2002 |title=Methodological Implications of Complex Systems Approaches to Sociality: Simulation as a Foundation for Knowledge |url=http://jasss.soc.surrey.ac.uk/5/1/3.html |publisher=Journal of Artificial Societies and Social Simulation |volume=5 |issue=1}}&amp;lt;/ref&amp;gt; A practical and well-known example is the construction of a computational model in the form of an &amp;quot;[[artificial society]]&amp;quot;, by which researchers can analyze the structure of a [[Social structure|social system]].&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;Generative&amp;quot;&amp;gt;{{cite book|last=Epstein |first=Joshua |year=2007 |title=Generative Social Science: Studies in Agent-Based Computational Modeling |location=Princeton, NJ |publisher=Princeton University Press|url=https://www.researchgate.net/publication/283615593}}&lt;br /&gt;
&lt;br /&gt;
In relevant literature, computational sociology is often related to the study of social complexity. Social complexity concepts such as complex systems, non-linear interconnection among macro and micro process, and emergence, have entered the vocabulary of computational sociology. A practical and well-known example is the construction of a computational model in the form of an &amp;quot;artificial society&amp;quot;, by which researchers can analyze the structure of a social system.&lt;br /&gt;
&lt;br /&gt;
在相关文献中，计算社会学经常与社会复杂性的研究有关。复杂系统、宏观和微观过程之间的非线性关联、涌现等社会复杂性概念已经进入计算社会学的词汇。一个实际而著名的例子是建立“'''人工社会 Artificial Society'''”的计算模型，通过它研究人员可以分析一个社会系统的结构。 &lt;br /&gt;
&lt;br /&gt;
While editing this lead/intro, please keep your text ABOVE this line - this will make it easier to automatically insert the lede into other articles - thanks!  &lt;br /&gt;
&lt;br /&gt;
While editing this lead/intro, please keep your text ABOVE this line - this will make it easier to automatically insert the lede into other articles - thanks!  &lt;br /&gt;
&lt;br /&gt;
当编辑这个引导 / 介绍，请保持你的文本以上这一行-这将使它更容易自动插入到其他文章的莱德-谢谢！&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;&amp;lt;/onlyinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;&amp;lt;/onlyinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
-- / 只包括&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==History 历史==&lt;br /&gt;
&lt;br /&gt;
{{see also|Sociology and complexity science}}&lt;br /&gt;
&lt;br /&gt;
[[File:Complexity-map-with-sociolo.png|thumb|right|300px|Historical map of research paradigms and associated scientists in [[sociology and complexity science]].]]&lt;br /&gt;
&lt;br /&gt;
Historical map of research paradigms and associated scientists in [[sociology and complexity science.]]&lt;br /&gt;
&lt;br /&gt;
【图1：Historical map of research paradigms and associated scientists in [[sociology and complexity science＋社会学和复杂性中的研究范式和科学家的历史地图】&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Background 背景===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In the past four decades, computational sociology has been introduced and gaining popularity {{According to whom|date=June 2017}}.  This has been used primarily for modeling or building explanations of social processes and are depending on the emergence of complex behavior from simple activities.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;&amp;gt;Salgado, Mauricio, and Nigel Gilbert. &amp;quot;[http://epubs.surrey.ac.uk/749319/1/Emergence%20and%20Communication%20-%20V3%201.pdf Emergence and communication in computational sociology].&amp;quot; Journal for the Theory of Social Behaviour 43.1 (2013): 87-110.&amp;lt;/ref&amp;gt;  The idea behind emergence is that properties of any bigger system do not always have to be properties of the components that the system is made of.&amp;lt;ref&amp;gt;Macy, Michael W., and Robert Willer. &amp;quot;[http://sct.uab.cat/lsds/sites/sct.uab.cat.lsds/files/FROM%20FACTORS%20TO%20ACTORS%20(Macy%20and%20Willer%202002).pdf From factors to actors: computational sociology and agent-based modeling].&amp;quot; Annual review of sociology 28.1 (2002): 143-166.&amp;lt;/ref&amp;gt;  The people responsible for the introduction of the idea of emergence are Alexander, Morgan, and Broad, who were classical emergentists.  The time at which these emergentists came up with this concept and method was during the time of the early twentieth century.  The aim of this method was to find a good enough accommodation between two different and extreme ontologies, which were reductionist materialism and dualism.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;/&amp;gt; &lt;br /&gt;
&lt;br /&gt;
In the past four decades, computational sociology has been introduced and gaining popularity.  This has been used primarily for modeling or building explanations of social processes and are depending on the emergence of complex behavior from simple activities.  The idea behind emergence is that properties of any bigger system do not always have to be properties of the components that the system is made of.  The people responsible for the introduction of the idea of emergence are Alexander, Morgan, and Broad, who were classical emergentists.  The time at which these emergentists came up with this concept and method was during the time of the early twentieth century.  The aim of this method was to find a good enough accommodation between two different and extreme ontologies, which were reductionist materialism and dualism. &lt;br /&gt;
&lt;br /&gt;
在过去的四十年里，计算社会学诞生并且越来越受欢迎。这主要用于建模或构建社会过程的解释，并且依赖于从简单活动中'''涌现 Emergence'''的复杂行为。涌现背后的思想是，任何较大系统不总是必须和组成系统的部分具有一样的性质。引入涌现思想的人是亚历山大 Alexander、摩根 Morgan和布罗德 Broad，他们都是'''经典涌现主义者 Classical Emergentists'''。经典涌现主义者提出这个概念和方法的时间是在二十世纪初期。这种方法的目的是在还原论的唯物主义和二元论这两种不同的本体论之间找到一个足够好的调和。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
While emergence has had a valuable and important role with the foundation of Computational Sociology, there are those who do not necessarily agree.  One major leader in the field, Epstein, doubted the use because there were aspects that are unexplainable.  Epstein put up a claim against emergentism, in which he says it &amp;quot;is precisely the generative sufficiency of the parts that constitutes the whole's explanation&amp;quot;.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
While emergence has had a valuable and important role with the foundation of Computational Sociology, there are those who do not necessarily agree.  One major leader in the field, Epstein, doubted the use because there were aspects that are unexplainable.  Epstein put up a claim against emergentism, in which he says it &amp;quot;is precisely the generative sufficiency of the parts that constitutes the whole's explanation&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
虽然涌现在计算社会学的建立上发挥了宝贵而重要的作用，但也有人不太同意。该领域的一个主要人物爱泼斯坦 Epstein对这种&amp;lt;font color='red'&amp;gt;用法&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;概念&amp;lt;/font&amp;gt;持怀疑态度，因为有些方面是这个&amp;lt;font color='red'&amp;gt;用法&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;概念&amp;lt;/font&amp;gt;无法解释的。爱泼斯坦提出了一种反对“涌现主义”的观点，他表示:“&amp;lt;font color=='red'&amp;gt;正是这些部分的有生成意义的充分性构成了对整体的解释&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;  正是这些部分所产生的充分性构成了对整体的解释&amp;lt;/font&amp;gt;”。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Agent-based models have had a historical influence on Computational Sociology.   These models first came around in the 1960s, and were used to simulate control and feedback processes in organizations, cities, etc.  During the 1970s, the application introduced the use of individuals as the main units for the analyses and used bottom-up strategies for modeling behaviors.  The last wave occurred in the 1980s.  At this time, the models were still bottom-up; the only difference is that the agents interact interdependently.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Agent-based models have had a historical influence on Computational Sociology. These models first came around in the 1960s, and were used to simulate control and feedback processes in organizations, cities, etc.  During the 1970s, the application introduced the use of individuals as the main units for the analyses and used bottom-up strategies for modeling behaviors.  The last wave occurred in the 1980s.  At this time, the models were still bottom-up; the only difference is that the agents interact interdependently.&lt;br /&gt;
&lt;br /&gt;
'''基于主体的模型 Agent-based Models'''对计算社会学有着历史性的影响。这些模型最早出现在20世纪60年代，用于仿真模拟组织、城市等系统的控制和反馈过程。在20世纪70年代，&amp;lt;font color='red'&amp;gt;应用程序&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; ABM模型&amp;lt;/font&amp;gt;引入个体作为主要的分析单元，并使用自下而上的策略来对行为建模。最后一波浪潮发生在20世纪80年代。那时，模型仍然是自下而上的; 唯一的区别是主体之间具有互相依赖和相互作用。&lt;br /&gt;
&lt;br /&gt;
===Systems theory and structural functionalism 系统理论和结构功能主义===&lt;br /&gt;
&lt;br /&gt;
{{main|Systems theory|Structural functionalism}}&lt;br /&gt;
&lt;br /&gt;
In the post-war era, [[Vannevar Bush]]'s [[differential analyser]], [[John von Neumann]]'s [[Von Neumann cellular automata|cellular automata]], [[Norbert Wiener]]'s [[cybernetics]], and [[Claude Shannon]]'s [[information theory]] became influential paradigms for modeling and understanding complexity in technical systems. In response, scientists in disciplines such as physics, biology, electronics, and economics began to articulate a [[systems theory|general theory of systems]] in which all natural and physical phenomena are manifestations of interrelated elements in a system that has common patterns and properties. Following [[Émile Durkheim]]'s call to analyze complex modern society ''[[sui generis]]'',&amp;lt;ref&amp;gt;{{cite book|first=Émile |last=Durkheim |title=The Division of Labor in Society |location=New York, NY |publisher=Macmillan}}&amp;lt;/ref&amp;gt; post-war structural functionalist sociologists such as [[Talcott Parsons]] seized upon these theories of systematic and hierarchical interaction among constituent components to attempt to generate grand unified sociological theories, such as the [[AGIL paradigm]].&amp;lt;ref name=&amp;quot;Bailey&amp;quot;&amp;gt;{{cite book|first1=Kenneth D. |last1=Bailey |editor=Jonathan H. Turner |chapter=Systems Theory |title=Handbook of Sociological Theory |publisher=Springer Science |year=2006 |location=New York, NY |isbn=978-0-387-32458-6 |pages=379–404}}&amp;lt;/ref&amp;gt; Sociologists such as [[George Homans]] argued that sociological theories should be formalized into hierarchical structures of propositions and precise terminology from which other propositions and hypotheses could be derived and operationalized into empirical studies.&amp;lt;ref name=&amp;quot;Blackwell&amp;quot;&amp;gt;{{cite encyclopedia|year=2007 |title=Computational Sociology |last=Bainbridge |first=William Sims |encyclopedia=Blackwell Encyclopedia of Sociology |publisher=Blackwell Reference Online |url=http://www.sociologyencyclopedia.com/subscriber/tocnode?id=g9781405124331_chunk_g97814051243319_ss1-85 |doi=10.1111/b.9781405124331.2007.x |hdl=10138/224218 |editor=Ritzer, George|isbn=978-1-4051-2433-1|hdl-access=free }}&amp;lt;/ref&amp;gt; Because computer algorithms and programs had been used as early as 1956 to test and validate mathematical theorems, such as the [[four color theorem]],&amp;lt;ref&amp;gt;{{cite book|last=Crevier |first=D. |year=1993 |title=AI: The Tumultuous History of the Search for Artificial Intelligence |url=https://archive.org/details/aitumultuoushist00crev |url-access=registration |publisher=Basic Books |location=New York, NY}}&amp;lt;/ref&amp;gt; some scholars anticipated that similar computational approaches could &amp;quot;solve&amp;quot; and &amp;quot;prove&amp;quot; analogously formalized problems and theorems of social structures and dynamics.&lt;br /&gt;
&lt;br /&gt;
In the post-war era, Vannevar Bush's differential analyser, John von Neumann's cellular automata, Norbert Wiener's cybernetics, and Claude Shannon's information theory became influential paradigms for modeling and understanding complexity in technical systems. In response, scientists in disciplines such as physics, biology, electronics, and economics began to articulate a general theory of systems in which all natural and physical phenomena are manifestations of interrelated elements in a system that has common patterns and properties. Following Émile Durkheim's call to analyze complex modern society sui generis, post-war structural functionalist sociologists such as Talcott Parsons seized upon these theories of systematic and hierarchical interaction among constituent components to attempt to generate grand unified sociological theories, such as the AGIL paradigm. Sociologists such as George Homans argued that sociological theories should be formalized into hierarchical structures of propositions and precise terminology from which other propositions and hypotheses could be derived and operationalized into empirical studies. Because computer algorithms and programs had been used as early as 1956 to test and validate mathematical theorems, such as the four color theorem, some scholars anticipated that similar computational approaches could &amp;quot;solve&amp;quot; and &amp;quot;prove&amp;quot; analogously formalized problems and theorems of social structures and dynamics.&lt;br /&gt;
&lt;br /&gt;
战后时期，范内瓦·布什（Vannevar Bush）的'''微分分析机 Differential Analyser''' 、冯·诺伊曼（John von Neumann）的'''元胞自动机 Cellular Automata'''、 维纳（Norbert Wiener）的'''控制论 Cybernetics'''和克劳德·香农（Claude Shannon）的'''信息论 Information Theory'''成为技术系统中建模和理解复杂性的重要范式。物理学、生物学、电子学和经济学等学科的科学家开始阐述系统的一般理论，即所有自然和物理现象都是具有共同模式和属性的系统中相互关联的元素的表现。&amp;lt;font color='red'&amp;gt;按照 &amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 沿着&amp;lt;/font&amp;gt;涂尔干（Émile Durkheim）分析特定的复杂现代社会&lt;br /&gt;
&lt;br /&gt;
（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]）Following Émile Durkheim's call to analyze complex modern society sui generis）&lt;br /&gt;
  --~~克劳德·香农（Claude Shannon）  这些同样去括号&lt;br /&gt;
&lt;br /&gt;
的&amp;lt;font color='red'&amp;gt;要求&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 思路&amp;lt;/font&amp;gt;，战后结构功能主义社会学家如帕森斯（Talcott Parsons）利用这些组成部分之间系统&amp;lt;font color='blue'&amp;gt;化&amp;lt;/font&amp;gt;和&amp;lt;font color='red'&amp;gt;等级&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 层次化&amp;lt;/font&amp;gt;相互作用的理论，试图产生大统一的社会学理论，如 AGIL 范式。霍曼斯（George Homans）等社会学家认为，社会学理论应该被构建为具有&amp;lt;font color='blue'&amp;gt;逻辑&amp;lt;/font&amp;gt;命题和精确术语的&amp;lt;font color='red'&amp;gt;等级&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 层次化&amp;lt;/font&amp;gt;结构，并且从中可以得出能够在实证研究中被操作化的其他命题和假设。由于早在1956年计算机算法和程序就已经被用来测试和验证数学定理（如'''四色定理Four Color Theorem'''），&amp;lt;font color='red'&amp;gt;一些学者预计相似的计算方法可以“解决”和“证明”类似的社会结构和动态的问题和定理。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 一些学者预计相似的计算方法可以“解释”和“证明”关于社会结构和演变的类似形式化的问题和定理。&amp;lt;/font&amp;gt;&lt;br /&gt;
--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|讨论]]formalized应该也要翻译出来，computational证明的是形式化定理)&lt;br /&gt;
&lt;br /&gt;
===Macrosimulation and microsimulation 宏观模拟和微观模拟===&lt;br /&gt;
&lt;br /&gt;
{{main|System dynamics|Microsimulation}}&lt;br /&gt;
&lt;br /&gt;
By the late 1960s and early 1970s, social scientists used increasingly available computing technology to perform macro-simulations of control and feedback processes in organizations, industries, cities, and global populations. These models used differential equations to predict population distributions as holistic functions of other systematic factors such as inventory control, urban traffic, migration, and disease transmission.&amp;lt;ref&amp;gt;{{cite book|first=Jay |last=Forrester |year=1971 |title=World Dynamics |location=Cambridge, MA |publisher=MIT Press}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|doi=10.1287/opre.26.2.237|title=Using Simulation to Develop and Validate Analytic Models: Some Case Studies |first1=Edward J. |last1=Ignall |first2=Peter |last2=Kolesar |first3=Warren E. |last3=Walker |journal=Operations Research |volume=26 |issue=2 |year=1978 |pages=237–253}}&amp;lt;/ref&amp;gt; Although simulations of social systems received substantial attention in the mid-1970s after the [[Club of Rome]] published reports predicting that policies promoting exponential economic growth would eventually bring global environmental catastrophe,&amp;lt;ref&amp;gt;{{cite book|title=The Dynamics of Growth in a Finite World |last1=Meadows |first1=DL |last2=Behrens |first2=WW |last3=Meadows |first3=DH |last4=Naill |first4=RF |last5= Randers |first5=J |last6=Zahn |first6=EK |year=1974 |location=Cambridge, MA |publisher=MIT Press}}&amp;lt;/ref&amp;gt; the inconvenient conclusions led many authors to seek to discredit the models, attempting to make the researchers themselves appear unscientific.&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;/&amp;gt;&amp;lt;ref&amp;gt;{{cite news|title=Computer View of Disaster Is Rebutted |newspaper=The New York Times |date=October 18, 1974|url=https://www.nytimes.com/1974/10/18/archives/computer-view-of-disaster-is-rebutted.html?_r=0}}&amp;lt;/ref&amp;gt; Hoping to avoid the same fate, many social scientists turned their attention toward micro-simulation models to make forecasts and study policy effects by modeling aggregate changes in state of individual-level entities rather than the changes in distribution at the population level.&amp;lt;ref&amp;gt;{{cite journal|doi=10.1016/0167-2681(90)90038-F|title=From engineering to microsimulation : An autobiographical reflection |journal=Journal of Economic Behavior &amp;amp; Organization |year=1990 |volume=14 |issue=1 |pages=5–27 |first=Guy H. |last=Orcutt}}&amp;lt;/ref&amp;gt; However, these micro-simulation models did not permit individuals to interact or adapt and were not intended for basic theoretical research.&amp;lt;ref name=&amp;quot;MW&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
By the late 1960s and early 1970s, social scientists used increasingly available computing technology to perform macro-simulations of control and feedback processes in organizations, industries, cities, and global populations. These models used differential equations to predict population distributions as holistic functions of other systematic factors such as inventory control, urban traffic, migration, and disease transmission. Although simulations of social systems received substantial attention in the mid-1970s after the Club of Rome published reports predicting that policies promoting exponential economic growth would eventually bring global environmental catastrophe, the inconvenient conclusions led many authors to seek to discredit the models, attempting to make the researchers themselves appear unscientific. Hoping to avoid the same fate, many social scientists turned their attention toward micro-simulation models to make forecasts and study policy effects by modeling aggregate changes in state of individual-level entities rather than the changes in distribution at the population level. However, these micro-simulation models did not permit individuals to interact or adapt and were not intended for basic theoretical research.&lt;br /&gt;
&lt;br /&gt;
截至20世纪60年代末70年代初，社会科学家越来越多地使用已有的计算技术，在组织、工业、城市和全球人口中进行控制和反馈过程的'''宏观模拟 Macrosimulation''' 。这些模型使用微分方程作为其他系统因素的整体函数来预测人口分布，这些系统因素包括库存控制、城市交通、人口迁移和疾病传播等。20世纪70年代中期，'''罗马俱乐部 Club of Rome''' 发表报告预测，促进指数式经济增长的政策最终将导致全球环境灾难，这个悲观的结论导致许多研究者试图反驳这些模型，并试图让研究显得不那么科学。&lt;br /&gt;
  （--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） 根据意思，inconvenient译为悲观的，因为这个结论预示了悲观的未来，所以令指出这一点的科学家们感到inconvenient）&lt;br /&gt;
为了避免同样的情况，许多社会科学家将注意力转向'''微观模拟 Microsimulation'''模型。这些模型通过模拟个体状态的总体变化而不是总体人口级别的变化来进行预测和研究政策的效果。然而，这些微观模拟模型并不允许个体相互作用或适应、变化（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]）变化是根据适应（adapt）加上去的，不知道是否合理），研究者也不打算将它们用于基础理论研究。&lt;br /&gt;
&lt;br /&gt;
===Cellular automata and agent-based modeling 元胞自动机和基于主体建模===&lt;br /&gt;
&lt;br /&gt;
{{main|Cellular automata|agent-based modeling}}&lt;br /&gt;
&lt;br /&gt;
The 1970s and 1980s were also a time when physicists and mathematicians were attempting to model and analyze how simple component units, such as atoms, give rise to global properties, such as complex material properties at low temperatures, in magnetic materials, and within turbulent flows.&amp;lt;ref&amp;gt;{{cite book|title=Cellular automata machines: a new environment for modeling |url=https://archive.org/details/cellularautomata00toff |url-access=registration |first1=Tommaso |last1=Toffoli |first2=Norman |last2=Margolus | author2-link = Norman Margolus |year=1987 |publisher=MIT Press |location=Cambridge, MA}}&amp;lt;/ref&amp;gt; Using cellular automata, scientists were able to specify systems consisting of a grid of cells in which each cell only occupied some finite states and changes between states were solely governed by the states of immediate neighbors. Along with advances in [[artificial intelligence]] and [[microcomputer]] power, these methods contributed to the development of &amp;quot;[[chaos theory]]&amp;quot; and &amp;quot;[[complex systems|complexity theory]]&amp;quot; which, in turn, renewed interest in understanding complex physical and social systems across disciplinary boundaries.&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;/&amp;gt; Research organizations explicitly dedicated to the interdisciplinary study of complexity were also founded in this era: the [[Santa Fe Institute]] was established in 1984 by scientists based at [[Los Alamos National Laboratory]] and the BACH group at the [[University of Michigan]] likewise started in the mid-1980s.&lt;br /&gt;
&lt;br /&gt;
The 1970s and 1980s were also a time when physicists and mathematicians were attempting to model and analyze how simple component units, such as atoms, give rise to global properties, such as complex material properties at low temperatures, in magnetic materials, and within turbulent flows. Using cellular automata, scientists were able to specify systems consisting of a grid of cells in which each cell only occupied some finite states and changes between states were solely governed by the states of immediate neighbors. Along with advances in artificial intelligence and microcomputer power, these methods contributed to the development of &amp;quot;chaos theory&amp;quot; and &amp;quot;complexity theory&amp;quot; which, in turn, renewed interest in understanding complex physical and social systems across disciplinary boundaries. Research organizations explicitly dedicated to the interdisciplinary study of complexity were also founded in this era: the Santa Fe Institute was established in 1984 by scientists based at Los Alamos National Laboratory and the BACH group at the University of Michigan likewise started in the mid-1980s.&lt;br /&gt;
&lt;br /&gt;
20世纪70年代和80年代，物理学家和数学家也在试图模拟和分析简单的组成单位如何产生整体特性，比如低温环境中原子在磁性材料和湍流中的复杂材料特性。使用'''元胞自动机 Cellular Automata'''，科学家们能够指定由元胞网格组成的系统，其中每个元胞只占据一些有限的状态，状态之间的变化完全由相邻元胞的状态控制。随着人工智能和微型计算机能力的进步，这些方法促进了“混沌理论”和“复杂性理论”的发展，这反过来又重新引起了人们对跨学科的复杂物理和社会系统的兴趣。明确致力于跨学科复杂性研究的机构也是在这个时代成立的: 圣菲研究所是由美国洛斯阿拉莫斯国家实验室（Los Alamos National Laboratory）的科学家于1984年建立的，密歇根大学的 BACH 小组也是在20世纪80年代中期建立的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This cellular automata paradigm gave rise to a third wave of social simulation emphasizing agent-based modeling. Like micro-simulations, these models emphasized bottom-up designs but adopted four key assumptions that diverged from microsimulation: autonomy, interdependency, simple rules, and adaptive behavior.&amp;lt;ref name=&amp;quot;MW&amp;quot;/&amp;gt; Agent-based models are less concerned with predictive accuracy and instead emphasize theoretical development.&amp;lt;ref&amp;gt;{{cite journal |title=A simulation of the structure of academic science |journal=Sociological Research Online |volume=2 |issue=2 |pages=1–15 |year=1997 |first=Nigel |last=Gilbert |url=http://www.socresonline.org.uk/socresonline/2/2/3.html |doi=10.5153/sro.85 |access-date=2009-12-16 |archive-url=https://web.archive.org/web/19980524062306/http://www.socresonline.org.uk/socresonline/2/2/3.html |archive-date=1998-05-24 |url-status=dead }}&amp;lt;/ref&amp;gt; In 1981, mathematician and political scientist [[Robert Axelrod]] and evolutionary biologist [[W.D. Hamilton]] published a major paper in ''[[Science (journal)|Science]]'' titled &amp;quot;The Evolution of Cooperation&amp;quot; which used an agent-based modeling approach to demonstrate how social cooperation based upon reciprocity can be established and stabilized in a [[prisoner's dilemma]] game when agents followed simple rules of self-interest.&amp;lt;ref&amp;gt;{{cite journal|title=The Evolution of Cooperation |first1=Robert |last1=Axelrod |first2=William D. |last2=Hamilton |journal=Science |volume=211 |issue=4489 |pages=1390–1396 |doi=10.1126/science.7466396|pmid=7466396 |date=March 27, 1981|bibcode=1981Sci...211.1390A }}&amp;lt;/ref&amp;gt; Axelrod and Hamilton demonstrated that individual agents following a simple rule set of (1) cooperate on the first turn and (2) thereafter replicate the partner's previous action were able to develop &amp;quot;norms&amp;quot; of cooperation and sanctioning in the absence of canonical sociological constructs such as demographics, values, religion, and culture as preconditions or mediators of cooperation.&amp;lt;ref name=&amp;quot;Cooperation&amp;quot;/&amp;gt; Throughout the 1990s, scholars like [[William Sims Bainbridge]], [[Kathleen Carley]], [[Michael Macy]],  and [[John Skvoretz]] developed multi-agent-based models of [[generalized reciprocity]], [[prejudice]], [[social influence]], and organizational [[information processing]]. In 1999, [[Nigel Gilbert]] published the first textbook on Social Simulation: ''Simulation for the social scientist'' and established its most relevant journal: the [[Journal of Artificial Societies and Social Simulation]].&lt;br /&gt;
&lt;br /&gt;
This cellular automata paradigm gave rise to a third wave of social simulation emphasizing agent-based modeling. Like micro-simulations, these models emphasized bottom-up designs but adopted four key assumptions that diverged from microsimulation: autonomy, interdependency, simple rules, and adaptive behavior. In 1981, mathematician and political scientist Robert Axelrod and evolutionary biologist W.D. Hamilton published a major paper in Science titled &amp;quot;The Evolution of Cooperation&amp;quot; which used an agent-based modeling approach to demonstrate how social cooperation based upon reciprocity can be established and stabilized in a prisoner's dilemma game when agents followed simple rules of self-interest. Axelrod and Hamilton demonstrated that individual agents following a simple rule set of (1) cooperate on the first turn and (2) thereafter replicate the partner's previous action were able to develop &amp;quot;norms&amp;quot; of cooperation and sanctioning in the absence of canonical sociological constructs such as demographics, values, religion, and culture as preconditions or mediators of cooperation. Throughout the 1990s, scholars like William Sims Bainbridge, Kathleen Carley, Michael Macy,  and John Skvoretz developed multi-agent-based models of generalized reciprocity, prejudice, social influence, and organizational information processing. In 1999, Nigel Gilbert published the first textbook on Social Simulation: Simulation for the social scientist and established its most relevant journal: the Journal of Artificial Societies and Social Simulation.&lt;br /&gt;
&lt;br /&gt;
元胞自动机范式引发了强调'''基于主体建模 Agent-based Modeling'''的第三次社会模拟浪潮。与微观模拟一样，这些模型强调自下而上的设计，但采用了与微观模拟不同的四个关键假设: '''自主性 Autonomy'''、'''相互依赖性 Interdependency'''、'''简单规则 Simple Rules'''和'''适应性行为 Adaptive Behavior'''。1981年，数学家、政治学家阿克塞尔罗德（Robert Axelrod）和进化生物学家汉密尔顿（W.D. Hamilton）在《科学》杂志上发表了一篇名为《合作的进化》（The Evolution of Cooperation）的重要论文，该论文采用基于主体建模方法，论证了在一个囚徒困境中，当主体遵循简单的自利规则时，互惠的社会合作是如何建立和稳定的。阿克塞尔罗德和汉密尔顿证明，主体遵循这样一套简单的规则: (1)在第一轮进行合作，(2)在其后重复伙伴以前的行动，能够在没有人口学差异、价值观、宗教和文化等社会规范作为合作的先决条件或中介的情况下制定合作和制裁的“规范”。整个20世纪90年代，像威廉·希姆斯·本布里奇（William Sims Bainbridge），Kathleen Carley，Michael Macy 和 John Skvoretz 这样的学者开发了基于多主体的广义互惠、偏见、社会影响和组织信息处理模型。1999年，吉尔伯特（Nigel Gilbert）出版了第一本关于社会模拟: 写给社会科学家的仿真模拟（Simulation for the social scientist）的教科书，并建立了它最相关的杂志: 人工社会和社会模拟杂志（the Journal of Artificial Societies and Social Simulation）。&lt;br /&gt;
&lt;br /&gt;
===Data mining and social network analysis 数据挖掘和社会网络分析===&lt;br /&gt;
&lt;br /&gt;
{{main|Data mining|Social network analysis}}&lt;br /&gt;
&lt;br /&gt;
--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） 少一段原文 &lt;br /&gt;
Independent from developments in computational models of social systems, social network analysis emerged in the 1970s and 1980s from advances in graph theory, statistics, and studies of social structure as a distinct analytical method and was articulated and employed by sociologists like James S. Coleman, Harrison White, Linton Freeman, J. Clyde Mitchell, Mark Granovetter, Ronald Burt, and Barry Wellman.[22] The increasing pervasiveness of computing and telecommunication technologies throughout the 1980s and 1990s demanded analytical techniques, such as network analysis and multilevel modeling, that could scale to increasingly complex and large data sets. The most recent wave of computational sociology, rather than employing simulations, uses network analysis and advanced statistical techniques to analyze large-scale computer databases of electronic proxies for behavioral data. Electronic records such as email and instant message records, hyperlinks on the World Wide Web, mobile phone usage, and discussion on Usenet allow social scientists to directly observe and analyze social behavior at multiple points in time and multiple levels of analysis without the constraints of traditional empirical methods such as interviews, participant observation, or survey instruments.[23] Continued improvements in machine learning algorithms likewise have permitted social scientists and entrepreneurs to use novel techniques to identify latent and meaningful patterns of social interaction and evolution in large electronic datasets.[24][25]&lt;br /&gt;
&lt;br /&gt;
Independent from developments in computational models of social systems, social network analysis emerged in the 1970s and 1980s from advances in graph theory, statistics, and studies of social structure as a distinct analytical method and was articulated and employed by sociologists like [[James Samuel Coleman|James S. Coleman]], [[Harrison White]], [[Linton Freeman]], [[J. Clyde Mitchell]], [[Mark Granovetter]], [[Ronald Burt]], and [[Barry Wellman]].&amp;lt;ref&amp;gt;{{cite book|title=The Development of Social Network Analysis: A Study in the Sociology of Science |first=Linton C. |last=Freeman |publisher=Empirical Press |location=Vancouver, BC |year=2004}}&amp;lt;/ref&amp;gt; The increasing pervasiveness of computing and telecommunication technologies throughout the 1980s and 1990s demanded analytical techniques, such as [[network theory|network analysis]] and [[multilevel modeling]], that could scale to increasingly complex and large data sets. The most recent wave of computational sociology, rather than employing simulations, uses network analysis and advanced statistical techniques to analyze large-scale computer databases of electronic proxies for behavioral data. Electronic records such as email and instant message records, hyperlinks on the [[World Wide Web]], mobile phone usage, and discussion on [[Usenet]] allow social scientists to directly observe and analyze social behavior at multiple points in time and multiple levels of analysis without the constraints of traditional empirical methods such as interviews, participant observation, or survey instruments.&amp;lt;ref&amp;gt;{{cite journal|title=Life in the network: the coming age of computational social science|first9=J|last10=Gutmann|first10=M.|last11=Jebara|first11=T.|last12=King|first12=G.|last13=Macy|first13=M.|last14=Roy|first14=D.|last15=Van Alstyne|first15=M.|last9=Fowler|first8=N|last8=Contractor|first7=N|last7=Christakis|first6=D|last6=Brewer|first5=AL|last5=Barabasi|first4=S |journal=Science|last4=Aral |date=February 6, 2009|first3=L |volume=323|pmid=19197046 |issue=5915|last3=Adamic |pages=721–723|pmc=2745217 |doi=10.1126/science.1167742 |first1=David |last1=Lazer |first2=Alex |last2=Pentland |display-authors=8}}&amp;lt;/ref&amp;gt; Continued improvements in [[machine learning]] algorithms likewise have permitted social scientists and entrepreneurs to use novel techniques to identify latent and meaningful patterns of social interaction and evolution in large electronic datasets.&amp;lt;ref&amp;gt;{{cite journal|first1=Jaideep |last1=Srivastava |first2=Robert |last2=Cooley |first3=Mukund |last3=Deshpande |first4=Pang-Ning |last4=Tan |journal=Proceedings of the ACM Conference on Knowledge Discovery and Data Mining |title=Web usage mining: discovery and applications of usage patterns from Web data|volume=1 |year=2000 |pages=12–23 |doi=10.1145/846183.846188|issue=2}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|doi=10.1016/S0169-7552(98)00110-X|title=The anatomy of a large-scale hypertextual Web search engine |first1=Sergey |last1=Brin |first2=Lawrence |last2=Page |journal=Computer Networks and ISDN Systems |volume=30 |issue=1–7 |pages=107–117 |date=April 1998|citeseerx=10.1.1.115.5930 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Independent from developments in computational models of social systems, social network analysis emerged in the 1970s and 1980s from advances in graph theory, statistics, and studies of social structure as a distinct analytical method and was articulated and employed by sociologists like James S. Coleman, Harrison White, Linton Freeman, J. Clyde Mitchell, Mark Granovetter, Ronald Burt, and Barry Wellman. The increasing pervasiveness of computing and telecommunication technologies throughout the 1980s and 1990s demanded analytical techniques, such as network analysis and multilevel modeling, that could scale to increasingly complex and large data sets. The most recent wave of computational sociology, rather than employing simulations, uses network analysis and advanced statistical techniques to analyze large-scale computer databases of electronic proxies for behavioral data. Electronic records such as email and instant message records, hyperlinks on the World Wide Web, mobile phone usage, and discussion on Usenet allow social scientists to directly observe and analyze social behavior at multiple points in time and multiple levels of analysis without the constraints of traditional empirical methods such as interviews, participant observation, or survey instruments. Continued improvements in machine learning algorithms likewise have permitted social scientists and entrepreneurs to use novel techniques to identify latent and meaningful patterns of social interaction and evolution in large electronic datasets.&lt;br /&gt;
&lt;br /&gt;
'''社会网络分析 Social Network Analysis'''独立于社会系统计算模型的发展，在20世纪70年代和80年代出现于图论、统计学和社会结构的研究中，它作为一种独特的分析方法被社会学家如 James s. Coleman，Harrison White，Linton Freeman，J. Clyde Mitchell，Mark Granovetter，Ronald Burt 和 Barry Wellman 等阐述和采用。在整个1980年代和1990年代，计算和通信技术日益普及，这要求采用诸如网络分析和多级建模等分析技术，这些技术可以扩展到日益复杂和庞大的数据集中。最近的计算社会学没有使用模拟，而是使用网络分析和先进的统计技术来分析大规模计算机数据库中电子代理的行为数据。电子记录，如电子邮件和即时消息记录，万维网上的超链接，移动电话数据，以及 Usenet 上的讨论，使社会科学家能够直接观察社会行为并在多个时间点和多个层次的分析行为，并且不受传统的实证方法，如访谈、观察（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]）为了通顺，删除研究对象/被试：participants）或调查工具的限制。机器学习算法的不断改进同样使得社会科学家和企业家能够使用新技术来识别大型电子数据集中潜在但有意义的社会互动和演化模式。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:Tripletsnew2012.png|thumb|right|Narrative network of US Elections 2012&amp;lt;ref name=&amp;quot;ReferenceA&amp;quot;&amp;gt;{{cite journal|title=Automated analysis of the US presidential elections using Big Data and network analysis|author1=S Sudhahar|author2=GA Veltri|author3=N Cristianini|journal=Big Data &amp;amp; Society|volume=2|issue=1|pages=1–28|year=2015|doi=10.1177/2053951715572916|doi-access=free}}&amp;lt;/ref&amp;gt;]]&lt;br /&gt;
&lt;br /&gt;
Narrative network of US Elections 2012&lt;br /&gt;
&lt;br /&gt;
【图2：Narrative network of US Elections 2012 + 2012年美国大选叙事网络】&lt;br /&gt;
&lt;br /&gt;
The automatic parsing of textual corpora has enabled the extraction of actors and their relational networks on a vast scale, turning textual data into network data.  The resulting networks, which can contain thousands of nodes, are then analysed by using tools from Network theory to identify the key actors, the key communities or parties, and general properties such as robustness or structural stability of the overall network, or centrality of certain nodes.&amp;lt;ref&amp;gt;{{cite journal|title=Network analysis of narrative content in large corpora|author1=S Sudhahar|author2=G De Fazio|author3=R Franzosi|author4=N Cristianini|journal=Natural Language Engineering|volume=21|issue=1|pages=1–32|year=2013|doi=10.1017/S1351324913000247 |url=https://research-information.bristol.ac.uk/files/129621186/Network_Analysis_of_Narrative_Content_in_Large_Corpora.pdf}}&amp;lt;/ref&amp;gt; This automates the approach introduced by quantitative narrative analysis,&amp;lt;ref&amp;gt;{{cite book|title=Quantitative Narrative Analysis|last=Franzosi|first=Roberto|publisher=Emory University|year=2010}}&amp;lt;/ref&amp;gt; whereby subject-verb-object triplets are identified with pairs of actors linked by an action, or pairs formed by actor-object.&amp;lt;ref name=&amp;quot;ReferenceA&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The automatic parsing of textual corpora has enabled the extraction of actors and their relational networks on a vast scale, turning textual data into network data.  The resulting networks, which can contain thousands of nodes, are then analysed by using tools from Network theory to identify the key actors, the key communities or parties, and general properties such as robustness or structural stability of the overall network, or centrality of certain nodes. This automates the approach introduced by quantitative narrative analysis, whereby subject-verb-object triplets are identified with pairs of actors linked by an action, or pairs formed by actor-object.&lt;br /&gt;
&lt;br /&gt;
文本语料库的自动解析使对参与者及其关系网络的大规模提取成为可能，它将文本数据转换为网络数据。由此产生的网络可以包含数千个'''节点 Nodes'''，然后利用网络理论中的工具对其进行分析，以确定关键参与者、关键群体，以及网络的总体特性如稳健性、结构稳定性，或某些节点的'''中心性 Centrality'''等。这使'''定量叙事分析Quantitative Narrative Analysis'''引入的方法得以自动化，据此，主语-动词-宾语三元组被看作由动作连接的成对行为者，或者由行为者-宾语形成的成对行为者。&lt;br /&gt;
&lt;br /&gt;
===Computational content analysis 计算机内容分析 （名词翻译可吗？）===&lt;br /&gt;
&lt;br /&gt;
[[Content analysis]] has been a traditional part of social sciences and media studies for a long time. The automation of content analysis has allowed a &amp;quot;[[big data]]&amp;quot; revolution to take place in that field, with studies in social media and newspaper content that include millions of news items. [[Gender bias]], [[readability]], content similarity, reader preferences, and even mood have been analyzed based on [[text mining]] methods over millions of documents.&amp;lt;ref&amp;gt;{{cite journal|author1=I. Flaounas|author2=M. Turchi|author3=O. Ali|author4=N. Fyson|author5=T. De Bie|author6=N. Mosdell|author7=J. Lewis|author8=N. Cristianini|title=The Structure of EU Mediasphere|journal=PLOS One|volume=5|issue=12|pages=e14243|year=2010|doi=10.1371/journal.pone.0014243|url=https://orca-mwe.cf.ac.uk/50732/1/Flaounas%202010.pdf|pmid=21170383|pmc=2999531|bibcode=2010PLoSO...514243F}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|title=Nowcasting Events from the Social Web with Statistical Learning|author1=V Lampos|author2=N Cristianini|journal=ACM Transactions on Intelligent Systems and Technology |volume=3|issue=4|page=72|doi=10.1145/2337542.2337557|year=2012|url=http://www.lampos.net/sites/default/files/papers/lampos2012nowcasting.pdf}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite conference|title=NOAM: news outlets analysis and monitoring system|author1=I. Flaounas|author2=O. Ali|author3=M. Turchi|author4=T Snowsill|author5=F Nicart|author6=T De Bie|author7=N Cristianini|conference=Proc. of the 2011 ACM SIGMOD international conference on Management of data|year=2011|url=http://www.tijldebie.net/system/files/SIGMOD_11_demo_Ilias.pdf|doi=10.1145/1989323.1989474}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite book|author=N Cristianini|title=''Combinatorial Pattern Matching''|pages=2–13|year=2011|volume=6661|series= Lecture Notes in Computer Science|isbn=978-3-642-21457-8|doi=10.1007/978-3-642-21458-5_2|chapter=Automatic Discovery of Patterns in Media Content|citeseerx=10.1.1.653.9525}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite journal|last=Lansdall-Welfare|first=Thomas|last2=Sudhahar|first2=Saatviga|last3=Thompson|first3=James|last4=Lewis|first4=Justin|last5=Team|first5=FindMyPast Newspaper|last6=Cristianini|first6=Nello|date=2017-01-09|title=Content analysis of 150 years of British periodicals|url=http://www.pnas.org/content/early/2017/01/03/1606380114|journal=Proceedings of the National Academy of Sciences|volume=114|issue=4|language=en|pages=E457–E465|doi=10.1073/pnas.1606380114|issn=0027-8424|pmid=28069962|pmc=5278459}}&amp;lt;/ref&amp;gt; The analysis of readability, gender bias and topic bias was demonstrated in Flaounas et al.&amp;lt;ref&amp;gt;{{cite journal|author1=I. Flaounas|author2=O. Ali|author3=M. Turchi|author4=T. Lansdall-Welfare|author5=T. De Bie|author6=N. Mosdell|author7=J. Lewis|author8=N. Cristianini|title=Research methods in the age of digital journalism|journal=Digital Journalism|year=2012|doi=10.1080/21670811.2012.714928|volume=1|pages=102–116}}&amp;lt;/ref&amp;gt; showing how different topics have different gender biases and levels of readability; the possibility to detect mood shifts in a vast population by analysing Twitter content was demonstrated as well.&amp;lt;ref&amp;gt;{{cite conference|title=Effects of the Recession on Public Mood in the UK|author=T Lansdall-Welfare|author2=V Lampos|author3=N Cristianini|series=Mining Social Network Dynamics (MSND) session on Social Media Applications|doi=10.1145/2187980.2188264|conference=Proceedings of the 21st International Conference on World Wide Web|pages=1221–1226|location=New York, NY, USA|url=http://www.cs.bris.ac.uk/Publications/Papers/2001521.pdf}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Content analysis has been a traditional part of social sciences and media studies for a long time. The automation of content analysis has allowed a &amp;quot;big data&amp;quot; revolution to take place in that field, with studies in social media and newspaper content that include millions of news items. Gender bias, readability, content similarity, reader preferences, and even mood have been analyzed based on text mining methods over millions of documents. The analysis of readability, gender bias and topic bias was demonstrated in Flaounas et al. showing how different topics have different gender biases and levels of readability; the possibility to detect mood shifts in a vast population by analysing Twitter content was demonstrated as well.&lt;br /&gt;
&lt;br /&gt;
长期以来，内容分析一直是社会科学和媒体研究的传统方法。内容分析的自动化使得这一领域发生了一场“大数据”革命，这些研究中，社交媒体和报纸内容包括了数百万条的新闻。基于文本挖掘方法，'''性别偏差Gender Bias'''、'''可读性 Readability'''、'''内容相似度 Content Similarity'''、'''读者偏好 Reader Preferences'''，甚至是'''情绪 Mood'''的数以百万计的文档都可以被分析。Flaounas等人对可读性、性别偏差和'''话题偏差 Topic Bias'''为主要研究对象，展示了不同的话题如何有不同水平的性别偏差和可读性; 展示了通过分析推特内容来检测人群情绪变化的可能性。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The analysis of vast quantities of historical newspaper content has been pioneered by Dzogang et al.,&amp;lt;ref&amp;gt;{{Cite journal|last=Dzogang|first=Fabon|last2=Lansdall-Welfare|first2=Thomas|last3=Team|first3=FindMyPast Newspaper|last4=Cristianini|first4=Nello|date=2016-11-08|title=Discovering Periodic Patterns in Historical News|journal=PLOS One|volume=11|issue=11|pages=e0165736|doi=10.1371/journal.pone.0165736|issn=1932-6203|pmc=5100883|pmid=27824911|bibcode=2016PLoSO..1165736D}}&amp;lt;/ref&amp;gt; which showed how periodic structures can be automatically discovered in historical newspapers. A similar analysis was performed on social media, again revealing strongly periodic structures.&amp;lt;ref&amp;gt;[https://core.ac.uk/download/pdf/83929129.pdf Seasonal Fluctuations in Collective Mood Revealed by Wikipedia Searches and Twitter Posts] F Dzogang, T Lansdall-Welfare, N Cristianini - 2016 IEEE International Conference on Data Mining, Workshop on ''Data Mining'' in Human Activity Analysis&lt;br /&gt;
&lt;br /&gt;
The analysis of vast quantities of historical newspaper content has been pioneered by Dzogang et al., which showed how periodic structures can be automatically discovered in historical newspapers. A similar analysis was performed on social media, again revealing strongly periodic structures.&amp;lt;ref&amp;gt;[https://core.ac.uk/download/pdf/83929129.pdf Seasonal Fluctuations in Collective Mood Revealed by Wikipedia Searches and Twitter Posts] F Dzogang, T Lansdall-Welfare, N Cristianini - 2016 IEEE International Conference on Data Mining, Workshop on Data Mining in Human Activity Analysis&lt;br /&gt;
&lt;br /&gt;
对大量历史报纸内容的分析是由 Dzogang 等人率先进行的，他们展示了如何在历史报纸中自动发现'''周期结构 Periodic Structures'''。一个类似的社交媒体上进行的分析，也揭示了强烈的周期性结构。 参考文献[ https://core.ac.uk/download/pdf/83929129.pdf 维基百科搜索和推特帖子揭示的集体情绪的季节性波动] f Dzogang，t Lansdall-Welfare，n Cristianini-2016 IEEE International Conference on Data Mining, Workshop on Data Mining in Human Activity Analysis&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
==Challenges 挑战==&lt;br /&gt;
&lt;br /&gt;
Computational sociology, as with any field of study, faces a set of challenges.&amp;lt;ref name=&amp;quot;MCSS&amp;quot;&amp;gt;Conte, Rosaria, et al. &amp;quot;[https://link.springer.com/content/pdf/10.1140%252Fepjst%252Fe2012-01697-8.pdf Manifesto of computational social science].&amp;quot; The European Physical Journal Special Topics 214.1 (2012): 325-346.&amp;lt;/ref&amp;gt; These challenges need to be handled meaningfully so as to make the maximum impact on society.&lt;br /&gt;
&lt;br /&gt;
Computational sociology, as with any field of study, faces a set of challenges. These challenges need to be handled meaningfully so as to make the maximum impact on society.&lt;br /&gt;
&lt;br /&gt;
计算社会学和其他研究领域一样面临着一系列的挑战。必须有意义地处理这些挑战（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） meaningfully怎么翻译才比较通顺？），才能对社会产生最大的影响。&lt;br /&gt;
  &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Levels and their interactions 层级和层级的交互关系===&lt;br /&gt;
&lt;br /&gt;
Each society that is formed tends to be in one level or the other and there exists tendencies of interactions between and across these levels. Levels need not only be micro-level or macro-level in nature. There can be intermediate levels in which a society exists say - groups, networks, communities etc.&amp;lt;ref name=&amp;quot;MCSS&amp;quot; /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Each society that is formed tends to be in one level or the other and there exists tendencies of interactions between and across these levels. Levels need not only be micro-level or macro-level in nature. There can be intermediate levels in which a society exists say - groups, networks, communities etc.&lt;br /&gt;
&lt;br /&gt;
形成的每个社会都处于某种层次上，并且这些层次之间有相互作用的倾向。社会中的级别不仅可以分为微观或宏观的层次，还可以存在中间的层次，比如群体、网络、社区等。&lt;br /&gt;
（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） 合并了英文的原句）&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The question however arises as to how to identify these levels and how they come into existence? And once they are in existence how do they interact within themselves and with other levels?&lt;br /&gt;
&lt;br /&gt;
The question however arises as to how to identify these levels and how they come into existence? And once they are in existence how do they interact within themselves and with other levels?&lt;br /&gt;
&lt;br /&gt;
然而问题是，这些层次是如何确定的以及如何产生的？并且，一旦它们产生了，它们如何在自身内部以及与其他层次相互作用？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
If we view entities (agents) as nodes and the connections between them as the edges, we see the formation of networks. The connections in these networks do not come about based on just objective relationships between the entities, rather they are decided upon by factors chosen by the participating entities.&amp;lt;ref&amp;gt;{{cite journal|last1=Egu´ıluz|first1=V. M.|last2=Zimmermann|first2=M. G.|last3=Cela-Conde|first3=C. J.|last4=San Miguel|first4=M.|title=American Journal of Sociology|issue=2005|pages=110, 977}}&amp;lt;/ref&amp;gt; The challenge with this process is that, it is difficult to identify when a set of entities will form a network. These networks may be of trust networks, co-operation networks, dependence networks etc. There have been cases where heterogeneous set of entities have shown to form strong and meaningful networks among themselves.&amp;lt;ref&amp;gt;{{cite journal|last1=Sichman|first1=J. S.|last2=Conte|first2=R.|title=Computational &amp;amp; Mathematical Organization Theory|issue=2002|pages=8(2)}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Ehrhardt|first1=G.|last2=Marsili|first2=M.|last3=Vega-Redondo|first3=F.|title=Physical Review E|issue=2006|pages=74(3)}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
If we view entities (agents) as nodes and the connections between them as the edges, we see the formation of networks. The connections in these networks do not come about based on just objective relationships between the entities, rather they are decided upon by factors chosen by the participating entities. The challenge with this process is that, it is difficult to identify when a set of entities will form a network. These networks may be of trust networks, co-operation networks, dependence networks etc. There have been cases where heterogeneous set of entities have shown to form strong and meaningful networks among themselves.&lt;br /&gt;
&lt;br /&gt;
如果我们把'''实体 Entities'''（'''主体 Agents'''）看作节点，把它们之间的连接看作边，我们就看到了网络的形成。这些网络中的连接并非只是基于实体之间的客观关系，而是由实体选择的因素决定的。这个过程的困难之处在于，很难确定一组实体何时形成网络。这些网络可以是信任网络、合作网络、依赖网络等。在一些情况下，异质的实体集在它们之间形成了强大而有意义的网络。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
As discussed previously, societies fall into levels and in one such level, the individual level, a micro-macro link&amp;lt;ref&amp;gt;Billari, Francesco C. [https://books.google.com/books?hl=en&amp;amp;lr=&amp;amp;id=Tc8iL0b-OycC&amp;amp;oi=fnd&amp;amp;pg=PA1&amp;amp;dq=%22Agent-based+computational+modelling:+applications+in+demography,+social,+economic+and+environmental+sciences%22&amp;amp;ots=6MNVK7JP-e&amp;amp;sig=-o_iS9zCK3r-t1eHn3554UVadUs Agent-based computational modelling: applications in demography, social, economic and environmental sciences]. Taylor &amp;amp; Francis, 2006.&amp;lt;/ref&amp;gt; refers to the interactions which create higher-levels. There are a set of questions that needs to be answered regarding these Micro-Macro links. How they are formed? When do they converge? What is the feedback pushed to the lower levels and how are they pushed?&lt;br /&gt;
&lt;br /&gt;
As discussed previously, societies fall into levels and in one such level, the individual level, a micro-macro link refers to the interactions which create higher-levels. There are a set of questions that needs to be answered regarding these Micro-Macro links. How they are formed? When do they converge? What is the feedback pushed to the lower levels and how are they pushed?&lt;br /&gt;
&lt;br /&gt;
正如前面所讨论的，社会分为不同层次。在其中的一个层次：个体层次中，'''微观-宏观联系 Micro-macro Link'''指的是创造更高层次的相互作用。关于微观-宏观链接有一系列问题等待回答。它们是如何形成的？它们什么时候汇聚？什么反馈被推到了较低的层次，以及它们是如何被推到较低层次的？ &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Another major challenge in this category concerns the validity of information and their sources. In recent years there has been a boom in information gathering and processing. However, little attention was paid to the spread of false information between the societies. Tracing back the sources and finding ownership of such information is difficult.&lt;br /&gt;
&lt;br /&gt;
Another major challenge in this category concerns the validity of information and their sources. In recent years there has been a boom in information gathering and processing. However, little attention was paid to the spread of false information between the societies. Tracing back the sources and finding ownership of such information is difficult.&lt;br /&gt;
&lt;br /&gt;
这一分类的另一个主要挑战涉及信息的有效性及其来源。近年来，信息收集和处理有着蓬勃的发展。但人们很少注意到社会之间虚假信息的传播。追溯资料来源并找到这些资料的所有者是很困难的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Culture modeling 文化建模===&lt;br /&gt;
&lt;br /&gt;
The evolution of the networks and levels in the society brings about cultural diversity.&amp;lt;ref&amp;gt;{{cite journal|last1=Centola|first1=D.|last2=Gonz´alez-Avella|first2=J. C.|last3=Egu´ıluz|first3=V. M.|last4=San Miguel|first4=M.|title=Journal of Conflict Resolution|issue=2007|pages=51}}&amp;lt;/ref&amp;gt; A thought which arises however is that, when people tend to interact and become more accepting of other cultures and beliefs, how is it that diversity still persists? Why is there no convergence? A major challenge is how to model these diversities. Are there external factors like mass media, locality of societies etc. which influence the evolution or persistence of cultural diversities?{{Citation needed|reason=Sounds just like personal thoughts|date=May 2017}}&lt;br /&gt;
&lt;br /&gt;
The evolution of the networks and levels in the society brings about cultural diversity. A thought which arises however is that, when people tend to interact and become more accepting of other cultures and beliefs, how is it that diversity still persists? Why is there no convergence? A major challenge is how to model these diversities. Are there external factors like mass media, locality of societies etc. which influence the evolution or persistence of cultural diversities?&lt;br /&gt;
&lt;br /&gt;
社会网络和层次的演变带来了文化的多样性。然而人们会想，当人们倾向于相互作用，变得更能接受其他文化和信仰时，为什么多样性仍然存在？为什么人们没有趋同？一个主要的挑战是如何为这些多样性建立模型。是否存在大众传媒、社会地域性等外部因素，这些因素影响文化多样性的演化或保持？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Experimentation and evaluation 实验和评估===&lt;br /&gt;
&lt;br /&gt;
Any study or modelling when combined with experimentation needs to be able to address the questions being asked. [[Computational social science]] deals with large scale data and the challenge becomes much more evident as the scale grows. How would one design informative simulations on a large scale? And even if a large scale simulation is brought up, how is the evaluation supposed to be performed?&lt;br /&gt;
&lt;br /&gt;
Any study or modelling when combined with experimentation needs to be able to address the questions being asked. Computational social science deals with large scale data and the challenge becomes much more evident as the scale grows. How would one design informative simulations on a large scale? And even if a large scale simulation is brought up, how is the evaluation supposed to be performed?&lt;br /&gt;
&lt;br /&gt;
任何与实验结合的研究或建模都需要能够解决所提出的问题。计算社会科学处理大规模数据，并且数据规模越大建模的挑战就越明显。如何在一个大规模的数据集里设计信息仿真模型？并且，即使提出了一个大规模的仿真模型，应该如何对它进行评估？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Model choice and model complexities 模型选择和模型复杂性===&lt;br /&gt;
&lt;br /&gt;
Another challenge is identifying the models that would best fit the data and the complexities of these models. These models would help us predict how societies might evolve over time and provide possible explanations on how things work.&amp;lt;ref&amp;gt;Weisberg, Michael. [http://www.academia.edu/download/30604870/lessmorefinal.pdf When less is more: Tradeoffs and idealization in model building]. Diss. Stanford University, 2003.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Another challenge is identifying the models that would best fit the data and the complexities of these models. These models would help us predict how societies might evolve over time and provide possible explanations on how things work.&lt;br /&gt;
&lt;br /&gt;
另一个挑战是确定最适合数据的模型，以及最合适的'''模型复杂性 Model Complexities'''。这些模型将帮助我们预测随着时间的推移社会将如何演变，并为事物如何运动和变化提供可能的解释。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====Generative models 生成模型====&lt;br /&gt;
&lt;br /&gt;
Generative models helps us to perform extensive qualitative analysis in a controlled fashion. A model proposed by Epstein, is the agent-based simulation, which talks about identifying an initial set of heterogeneous entities (agents) and observe their evolution and growth based on simple local rules.&amp;lt;ref&amp;gt;Epstein, Joshua M. [https://www.researchgate.net/profile/Eric_Jones14/publication/283615593_Book_Review_-_Generative_Social_Science_Studies_in_Agent-Based_Computational_Modeling/links/5641398808aebaaea1f70216.pdf Generative social science: Studies in agent-based computational modeling]. Princeton University Press, 2006.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Generative models helps us to perform extensive qualitative analysis in a controlled fashion. A model proposed by Epstein, is the agent-based simulation, which talks about identifying an initial set of heterogeneous entities (agents) and observe their evolution and growth based on simple local rules.&lt;br /&gt;
&lt;br /&gt;
'''生成模型 Generative Models'''帮助我们以一种受控的方式进行广泛的定性分析。爱泼斯坦（Epstein）提出的一个基于主体的模型，就是探讨如何识别异质实体(主体)的'''初始集 Initial Set'''，并根据简单的局部规则观察它们的演化和增长。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
But what are these local rules? How does one identify them for a set of heterogeneous agents? Evaluation and impact of these rules state a whole new set of difficulties.&lt;br /&gt;
&lt;br /&gt;
But what are these local rules? How does one identify them for a set of heterogeneous agents? Evaluation and impact of these rules state a whole new set of difficulties.&lt;br /&gt;
&lt;br /&gt;
但是这些局部规则是什么呢？如何识别一组异质实体？这些规则的评估和影响都是新出现的困难之处。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====Heterogeneous or ensemble models 异质模型和组合模型====&lt;br /&gt;
&lt;br /&gt;
Integrating simple models which perform better on individual tasks to form a Hybrid model is an approach that can be looked into{{Citation needed|reason=unsupported claims|date=May 2017}}. These models can offer better performance and understanding of the data. However the trade-off of identifying and having a deep understanding of the interactions between these simple models arises when one needs to come up with one combined, well performing model. Also, coming up with tools and applications to help analyse and visualize the data based on these hybrid models is another added challenge.&lt;br /&gt;
&lt;br /&gt;
Integrating simple models which perform better on individual tasks to form a Hybrid model is an approach that can be looked into. These models can offer better performance and understanding of the data. However the trade-off of identifying and having a deep understanding of the interactions between these simple models arises when one needs to come up with one combined, well performing model. Also, coming up with tools and applications to help analyse and visualize the data based on these hybrid models is another added challenge.&lt;br /&gt;
&lt;br /&gt;
集成在单个任务中表现良好的简单模型并形成'''混合模型 Hybrid model'''是一种可以继续考虑的方法。这些模型有更好的性能并可以对数据提供更好的理解。然而，当需要提出一个整合的、性能良好的模型时，识别简单模型和深入理解模型之间相互作用的权衡问题就出现了。此外，另一个挑战是开发工具和应用程序来帮助分析和可视化基于这些混合模型的数据。&lt;br /&gt;
&lt;br /&gt;
==Impact 影响==&lt;br /&gt;
&lt;br /&gt;
Computational sociology can bring impacts to science, technology and society.&amp;lt;ref name=&amp;quot;MCSS&amp;quot; /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Computational sociology can bring impacts to science, technology and society.&lt;br /&gt;
&lt;br /&gt;
计算社会学可以给科学、技术和社会带来影响。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Impact on science 对科学的影响===&lt;br /&gt;
&lt;br /&gt;
In order for the study of computational sociology to be effective, there has to be valuable innovations. These innovation can be of the form of new data analytics tools, better models and algorithms. The advent of such innovation will be a boon for the scientific community in large. {{Citation needed|reason=citation for claim on innovation and the type of innovation|date=May 2017}}&lt;br /&gt;
&lt;br /&gt;
In order for the study of computational sociology to be effective, there has to be valuable innovations. These innovation can be of the form of new data analytics tools, better models and algorithms. The advent of such innovation will be a boon for the scientific community in large. &lt;br /&gt;
&lt;br /&gt;
为了使计算社会学的研究有效，必须有一些有价值的创新。这些创新可以是新形式的数据分析工具，或更好的模型和算法。这些创新的出现将为整个科学界带来益处。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Impact on society 对社会的影响===&lt;br /&gt;
&lt;br /&gt;
One of the major challenges of computational sociology is the modelling of social processes {{Citation needed|reason=to support the claim for need of modeling of social processes|date=May 2017}}. Various law and policy makers would be able to see efficient and effective paths to issue new guidelines and the mass in general would be able to evaluate and gain fair understanding of the options presented in front of them enabling an open and well balanced decision process. {{Citation needed|reason=unsupported claims|date=May 2017}}.&lt;br /&gt;
&lt;br /&gt;
One of the major challenges of computational sociology is the modelling of social processes . Various law and policy makers would be able to see efficient and effective paths to issue new guidelines and the mass in general would be able to evaluate and gain fair understanding of the options presented in front of them enabling an open and well balanced decision process. &lt;br /&gt;
&lt;br /&gt;
计算社会学的主要挑战之一是对社会过程的建模。各种法律和政策制定者将能够得到发布新指导方针的快速有效的方法，广大群众将能够评价和更好地理解各种备选方案，从而实现决策进程的公开和平衡。&lt;br /&gt;
&lt;br /&gt;
==Journals and academic publications 期刊和学术出版物==&lt;br /&gt;
&lt;br /&gt;
The most relevant journal of the discipline is the [[Journal of Artificial Societies and Social Simulation]].&lt;br /&gt;
&lt;br /&gt;
The most relevant journal of the discipline is the Journal of Artificial Societies and Social Simulation.&lt;br /&gt;
&lt;br /&gt;
该学科最相关的期刊是《人工社会与社会模拟（the Journal of Artificial Societies and Social Simulation）》。&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20100611121626/http://www.ccsr.uiuc.edu/web/Journals/Journals.html Complexity Research Journal List], from UIUC, IL 复杂研究期刊列表（资料来自伊利诺伊大学香槟分校）&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20100611091342/http://www.ccsr.uiuc.edu/web/Groups/Groups.html Related Research Groups], from UIUC, IL 相关研究组（资料来自伊利诺伊大学香槟分校）&lt;br /&gt;
&lt;br /&gt;
==Associations, conferences and workshops 协会、会议及工作坊==&lt;br /&gt;
&lt;br /&gt;
*[http://www.casos.cs.cmu.edu/naacsos/ North American Association for Computational Social and Organization Sciences]&lt;br /&gt;
&lt;br /&gt;
*[http://www.essa.eu.org/ ESSA: European Social Simulation Association]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Academic programs, departments and degrees 学术课程、院系和学位==&lt;br /&gt;
&lt;br /&gt;
* [http://mediapatterns.enm.bris.ac.uk/ University of Bristol &amp;quot;Mediapatterns&amp;quot; project]&lt;br /&gt;
&lt;br /&gt;
* [http://www.cos.cs.cmu.edu/ Carnegie Mellon University], [http://www.casos.cs.cmu.edu PhD program] in Computation, Organizations and Society (COS)&lt;br /&gt;
&lt;br /&gt;
* [http://www.uchicago.edu University of Chicago]&lt;br /&gt;
&lt;br /&gt;
** [https://macss.uchicago.edu/ Certificate, MA and PhD in Computational Social Sciences]&lt;br /&gt;
&lt;br /&gt;
* [http://www.gmu.edu George Mason University]&lt;br /&gt;
&lt;br /&gt;
** PhD program in [http://css.gmu.edu CSS (Computational Social Sciences)]&lt;br /&gt;
&lt;br /&gt;
** MA program in [http://mais.gmu.edu/programs/la-mais-css Master's of Interdisciplinary Studies, CSS emphasis]&lt;br /&gt;
&lt;br /&gt;
* [http://www.pdx.edu/sysc/program-systems-science-phd-program Portland State], PhD program in Systems Science&lt;br /&gt;
&lt;br /&gt;
* [http://www.pdx.edu/sysc/program-systems-science-masters-program Portland State], MS program in Systems Science&lt;br /&gt;
&lt;br /&gt;
* [http://www.ucd.ie University College Dublin], &lt;br /&gt;
&lt;br /&gt;
** PhD Program in [http://www.ucd.ie/geary/postgraduatetraining/cscs Complex Systems and Computational Social Science]&lt;br /&gt;
&lt;br /&gt;
** MSc in [https://sisweb.ucd.ie/usis/!W_HU_MENU.P_PUBLISH?p_tag=PROG&amp;amp;MAJR=W390 Social Data Analytics] &lt;br /&gt;
&lt;br /&gt;
** BSc in [https://www.myucd.ie/courses/social-sciences/computational-social-science Computational Social Science] &lt;br /&gt;
&lt;br /&gt;
* [https://archive.is/20121215023745/http://hcs.ucla.edu/courses.htm UCLA], Minor in Human Complex Systems&lt;br /&gt;
&lt;br /&gt;
* [http://www.cs.ucla.edu/~cyber/ UCLA], Major in Computational &amp;amp; Systems Biology (including behavioral sciences)&lt;br /&gt;
&lt;br /&gt;
* [http://cscs.umich.edu/education/undergrad/undergrad.html Univ. of Michigan], Minor in Complex Systems&lt;br /&gt;
&lt;br /&gt;
* [http://www.pdx.edu/sysc/resources-other-systems-science-programs Systems Sciences Programs List], Portland State.  List of other worldwide related programs.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Centers and institutes 中心和机构==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===North America 北美===&lt;br /&gt;
&lt;br /&gt;
* [http://cnets.indiana.edu/ Center for Complex Networks and Systems Research], Indiana University, Bloomington, IN, USA.&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20110430200327/http://www.ccsr.uiuc.edu/ Center for Complex Systems Research], University of Illinois at Urbana-Champaign, IL, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://socialcomplexity.gmu.edu/ Center for Social Complexity], George Mason University, Fairfax, VA, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.asu.edu/clas/csdc/ Center for Social Dynamics and Complexity], Arizona State University, Tempe, AZ, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.cscs.umich.edu/ Center of the Study of Complex Systems], University of Michigan, Ann Arbor, MI, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://hcs.ucla.edu/ Human Complex Systems], University of California Los Angeles, Los Angeles, CA, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.iq.harvard.edu/ Institute for Quantitative Social Science], Harvard University, Boston, MA, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.nico.northwestern.edu/ Northwestern Institute on Complex Systems (NICO)], Northwestern University, Evanston, IL USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.santafe.edu/ Santa Fe Institute], Santa Fe, NM, USA.&lt;br /&gt;
&lt;br /&gt;
* Duke Network Analysis Center, [[Duke University]], Durham, NC, USA&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===South America 南美===&lt;br /&gt;
&lt;br /&gt;
* [http://www5.each.usp.br/mestrado-academico-em-modelagem-de-sistemas-complexos/ Modelagem de Sistemas Complexos], University of São Paulo - EACH, São Paulo, SP, Brazil&lt;br /&gt;
&lt;br /&gt;
* [http://inct.cnpq.br/web/inct-sc Instituto Nacional de Ciência e Tecnologia de Sistemas Complexos], Centro Brasileiro de Pesquisas Físicas, Rio de Janeiro, RJ, Brazil&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Europe 欧洲===&lt;br /&gt;
&lt;br /&gt;
* [http://cfpm.org Centre for Policy Modelling], Manchester, UK.&lt;br /&gt;
&lt;br /&gt;
* [http://cress.soc.surrey.ac.uk/ Centre for Research in Social Simulation], University of Surrey, UK.&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20130425014018/http://dl.ucd.ie/ UCD Dynamics Lab- Centre for Computational Social Science], Geary Institute for Public Policy, University College Dublin, Ireland.&lt;br /&gt;
&lt;br /&gt;
* [http://www.rug.nl/research/gcscs/ Groningen Center for Social Complexity Studies (GCSCS)], Groningen, NL.&lt;br /&gt;
&lt;br /&gt;
* [http://www.soms.ethz.ch/ Chair of Sociology, in particular of Modeling and Simulation (SOMS)], Zürich, Switzerland.&lt;br /&gt;
&lt;br /&gt;
* [http://www.eco.unibs.it/gecs/ Research Group on Experimental and Computational Sociology (GECS)], Brescia, IT.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Asia 亚洲===&lt;br /&gt;
&lt;br /&gt;
* [http://bandungfe.net Bandung Fe Institute, Centre for Complexity in Surya University], Bandung, Indonesia.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== See also 参见==&lt;br /&gt;
&lt;br /&gt;
* [[Artificial society]] 人工社会&lt;br /&gt;
&lt;br /&gt;
* [[Simulated reality]] 虚拟现实&lt;br /&gt;
&lt;br /&gt;
* [[Social simulation]] 社会仿真&lt;br /&gt;
&lt;br /&gt;
* [[Agent-based social simulation]] 基于主体的社会仿真&lt;br /&gt;
&lt;br /&gt;
* [[Social complexity]] 社会复杂性&lt;br /&gt;
&lt;br /&gt;
* [[Computational economics]] 计算经济学&lt;br /&gt;
&lt;br /&gt;
* [[Computational epidemiology]] 计算流行病学&lt;br /&gt;
&lt;br /&gt;
* [[Cliodynamics]] 历史动力学&lt;br /&gt;
&lt;br /&gt;
* [[Predictive analytics]] 预测分析&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&lt;br /&gt;
{{reflist|35em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==External links 外部链接==&lt;br /&gt;
&lt;br /&gt;
*[http://cress.soc.surrey.ac.uk/s4ss/ On-line book &amp;quot;Simulation for the Social Scientist&amp;quot; by Nigel Gilbert and Klaus G. Troitzsch, 1999, second edition 2005 社会科学家的仿真建模 电子书 作者：Nigel Gilbert and Klaus G. Troitzsch 第二版（2005年版）]&lt;br /&gt;
&lt;br /&gt;
*[http://jasss.soc.surrey.ac.uk/JASSS.html Journal of Artificial Societies and Social Simulation 人工社会和社会建模仿真期刊]&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20110516072744/http://cmol.nbi.dk/models/ Agent based models for social networks, interactive java applets 基于主体的社会网络模型，交互式 java 小程序]&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20090827052722/http://www.personal.kent.edu/~bcastel3/ Sociology and Complexity Science Website 社会学与复杂性科学网站]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:Subfields of sociology]]&lt;br /&gt;
&lt;br /&gt;
Category:Subfields of sociology&lt;br /&gt;
&lt;br /&gt;
范畴: 社会学的子领域&lt;br /&gt;
&lt;br /&gt;
[[Category:Complex systems theory]]&lt;br /&gt;
&lt;br /&gt;
Category:Complex systems theory&lt;br /&gt;
&lt;br /&gt;
范畴: 复杂系统理论&lt;br /&gt;
&lt;br /&gt;
[[Category:Methods in sociology]]&lt;br /&gt;
&lt;br /&gt;
Category:Methods in sociology&lt;br /&gt;
&lt;br /&gt;
范畴: 社会学方法&lt;br /&gt;
&lt;br /&gt;
[[Category:Computational fields of study]]&lt;br /&gt;
&lt;br /&gt;
Category:Computational fields of study&lt;br /&gt;
&lt;br /&gt;
类别: 研究的计算领域&lt;br /&gt;
&lt;br /&gt;
&amp;lt;noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;small&amp;gt;This page was moved from [[wikipedia:en:Computational sociology]]. Its edit history can be viewed at [[社会计算/edithistory]]&amp;lt;/small&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:待整理页面]]&lt;br /&gt;
&lt;br /&gt;
== 编者推荐 ==&lt;br /&gt;
=== 书籍推荐 ===&lt;br /&gt;
====[https://e.jd.com/30159646.html 社会计算的基本方法与应用]====&lt;br /&gt;
这是中科院自动化所的王飞跃老师关于社会计算的专著，从利用计算技术解决社会问题的角度介绍社会计算。阅读难度可能较高。&lt;br /&gt;
&lt;br /&gt;
=== 集智推荐 ===&lt;br /&gt;
====[https://campus.swarma.org/course/1028 2019 International Conference of Social Computing]====&lt;br /&gt;
本课程是2019年8月26日、27日的2019 International Conference of Social Computing记录。教师团队由芝加哥大学社会学系James Evans教授，Science University of Gottingen傅晓明教授，清华大学罗家德教授，电子科技大学周涛教授等多位老师组成。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://campus.swarma.org/course/1016 复杂系统与社会计算研讨会]====&lt;br /&gt;
本课程是，2019年10月27日北京计算科学研究中心主办的复杂系统与社会计算研讨会活动记录。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://pattern.swarma.org/path?id=12 计算社会科学入门路径]====&lt;br /&gt;
计算社会科学诞生至今，已有将近10年。在自然科学领域已经广泛应用大数据、分布式计算等方式提高研究质量的今天，社会科学领域涉及到的核心数据仍然被少数机构所拥有并创造着巨大的价值。本文将从计算社会科学的发展历史，常用方法，以及前沿问题来给大家粗略地展示计算社会科学的脉络。&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E7%A4%BE%E4%BC%9A%E8%AE%A1%E7%AE%97&amp;diff=11141</id>
		<title>社会计算</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E7%A4%BE%E4%BC%9A%E8%AE%A1%E7%AE%97&amp;diff=11141"/>
		<updated>2020-07-26T02:21:08Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;#重定向 [[社会计算]]&lt;br /&gt;
此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。&lt;br /&gt;
{{sociology}}&amp;lt;onlyinclude&amp;gt;&amp;lt;!-- &lt;br /&gt;
&lt;br /&gt;
&amp;lt;onlyinclude&amp;gt;&amp;lt;!-- &lt;br /&gt;
&lt;br /&gt;
只包括! -- &lt;br /&gt;
&lt;br /&gt;
While editing this lead/intro, please keep your text BELOW this line - this will make it easier to automatically insert the lede into other articles --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
  While editing this lead/intro, please keep your text BELOW this line - this will make it easier to automatically insert the lede into other articles --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
当编辑这个导语 / 介绍，请保持你的文本下面这行-这将使它更容易自动插入到其他文章的莱德-&lt;br /&gt;
&lt;br /&gt;
'''Computational sociology''' is a branch of [[sociology]] that uses computationally intensive methods to analyze and model social phenomena. Using [[computer simulation]]s, [[artificial intelligence]], complex statistical methods, and analytic approaches like [[social network analysis]], computational sociology develops and tests theories of complex social processes through bottom-up modeling of social interactions.&amp;lt;ref name=&amp;quot;MW&amp;quot;&amp;gt;{{cite journal|doi=10.1146/annurev.soc.28.110601.141117|title=From Factors to Actors: Computational Sociology and Agent-Based Modeling |first1=Michael W. |last1=Macy |first2=Robert |last2=Willer |journal=Annual Review of Sociology |volume=28 |pages=143–166 |jstor=3069238|year=2002}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Computational sociology is a branch of sociology that uses computationally intensive methods to analyze and model social phenomena. Using computer simulations, artificial intelligence, complex statistical methods, and analytic approaches like social network analysis, computational sociology develops and tests theories of complex social processes through bottom-up modeling of social interactions.&lt;br /&gt;
&lt;br /&gt;
'''计算社会学 Computational Sociology''' 是社会学的一个分支，它使用计算密集型方法来分析和模拟社会现象。&amp;lt;font color='red'&amp;gt;计算社会学通过使用计算机模拟、人工智能、复杂统计方法以及社会网络分析等分析方法自下而上地建立社会互动模型，是建立并检验复杂社会过程的理论。&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;  借助计算机模拟、人工智能、复杂统计方法以及社会网络分析等分析方法，计算社会学通过自下而上地建立社会互动模型来发展和检验关于复杂社会过程的理论。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
It involves the understanding of social agents, the interaction among these agents, and the effect of these interactions on the social aggregate.&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;&amp;gt;{{cite book|last1=Gilbert |first1=Nigel |last2=Troitzsch |first2=Klaus |year=2005 |title=Simulation for Social Scientists |edition=2 |chapter=Simulation and social science |publisher=Open University Press |chapter-url=http://cress.soc.surrey.ac.uk/s4ss/}}&amp;lt;/ref&amp;gt; Although the subject matter and methodologies in [[social science]] differ from those in [[natural science]] or [[computer science]], several of the approaches used in contemporary [[social simulation]] originated from fields such as [[physics]] and [[artificial intelligence]].&amp;lt;ref name=&amp;quot;Artificial Societies&amp;quot;&amp;gt;{{cite book|last1=Epstein |first1=Joshua M. |last2=Axtell |first2=Robert |year=1996 |title=Growing Artificial Societies: Social Science from the Bottom Up |location=Washington DC |publisher=Brookings Institution Press|url=https://archive.org/details/growingartificia00epst|url-access=registration |isbn=978-0262050531 }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;Cooperation&amp;quot;&amp;gt;{{cite book|last1=Axelrod |first1=Robert |year=1997 |title=The Complexity of Cooperation: Agent-Based Models of Competition and Collaboration |location=Princeton, NJ |publisher=Princeton University Press}}&amp;lt;/ref&amp;gt; Some of the approaches that originated in this field have been imported into the natural sciences, such as measures of [[centrality|network centrality]] from the fields of [[social network analysis]] and [[network science]].&lt;br /&gt;
&lt;br /&gt;
It involves the understanding of social agents, the interaction among these agents, and the effect of these interactions on the social aggregate. Although the subject matter and methodologies in social science differ from those in natural science or computer science, several of the approaches used in contemporary social simulation originated from fields such as physics and artificial intelligence. Some of the approaches that originated in this field have been imported into the natural sciences, such as measures of network centrality from the fields of social network analysis and network science.&lt;br /&gt;
&lt;br /&gt;
它涉及理解社会行为主体和它们的相互作用，以及这些相互作用如何影响社会总体(--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） social aggregate--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|讨论]]） 我觉得这样翻译是ok的)。虽然社会科学的主题和方法不同于自然科学或计算机科学，但当代社会仿真模拟中使用的一些方法起源于物理学和人工智能等领域。这一领域的一些方法，如来自社会网络分析和网络科学领域的网络中心性度量方法等，早已被引入到自然科学中。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In relevant literature, computational sociology is often related to the study of [[social complexity]].&amp;lt;ref&amp;gt;{{cite journal|last=Casti |first=J |year=1999 |title=The Computer as Laboratory: Toward a Theory of Complex Adaptive Systems |journal=Complexity |volume=4 |issue=5 |pages=12–14 |doi=10.1002/(SICI)1099-0526(199905/06)4:5&amp;lt;12::AID-CPLX3&amp;gt;3.0.CO;2-4}}&amp;lt;/ref&amp;gt; Social complexity concepts such as [[complex systems]], [[non-linear]] interconnection among macro and micro process, and [[emergence]], have entered the vocabulary of computational sociology.&amp;lt;ref&amp;gt;{{cite journal|last=Goldspink |first=C |year=2002 |title=Methodological Implications of Complex Systems Approaches to Sociality: Simulation as a Foundation for Knowledge |url=http://jasss.soc.surrey.ac.uk/5/1/3.html |publisher=Journal of Artificial Societies and Social Simulation |volume=5 |issue=1}}&amp;lt;/ref&amp;gt; A practical and well-known example is the construction of a computational model in the form of an &amp;quot;[[artificial society]]&amp;quot;, by which researchers can analyze the structure of a [[Social structure|social system]].&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;Generative&amp;quot;&amp;gt;{{cite book|last=Epstein |first=Joshua |year=2007 |title=Generative Social Science: Studies in Agent-Based Computational Modeling |location=Princeton, NJ |publisher=Princeton University Press|url=https://www.researchgate.net/publication/283615593}}&lt;br /&gt;
&lt;br /&gt;
In relevant literature, computational sociology is often related to the study of social complexity. Social complexity concepts such as complex systems, non-linear interconnection among macro and micro process, and emergence, have entered the vocabulary of computational sociology. A practical and well-known example is the construction of a computational model in the form of an &amp;quot;artificial society&amp;quot;, by which researchers can analyze the structure of a social system.&lt;br /&gt;
&lt;br /&gt;
在相关文献中，计算社会学经常与社会复杂性的研究有关。复杂系统、宏观和微观过程之间的非线性关联、涌现等社会复杂性概念已经进入计算社会学的词汇。一个实际而著名的例子是建立“'''人工社会 Artificial Society'''”的计算模型，通过它研究人员可以分析一个社会系统的结构。 &lt;br /&gt;
&lt;br /&gt;
While editing this lead/intro, please keep your text ABOVE this line - this will make it easier to automatically insert the lede into other articles - thanks!  &lt;br /&gt;
&lt;br /&gt;
While editing this lead/intro, please keep your text ABOVE this line - this will make it easier to automatically insert the lede into other articles - thanks!  &lt;br /&gt;
&lt;br /&gt;
当编辑这个引导 / 介绍，请保持你的文本以上这一行-这将使它更容易自动插入到其他文章的莱德-谢谢！&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;&amp;lt;/onlyinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;&amp;lt;/onlyinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
-- / 只包括&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==History 历史==&lt;br /&gt;
&lt;br /&gt;
{{see also|Sociology and complexity science}}&lt;br /&gt;
&lt;br /&gt;
[[File:Complexity-map-with-sociolo.png|thumb|right|300px|Historical map of research paradigms and associated scientists in [[sociology and complexity science]].]]&lt;br /&gt;
&lt;br /&gt;
Historical map of research paradigms and associated scientists in [[sociology and complexity science.]]&lt;br /&gt;
&lt;br /&gt;
【图1：Historical map of research paradigms and associated scientists in [[sociology and complexity science＋社会学和复杂性中的研究范式和科学家的历史地图】&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Background 背景===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In the past four decades, computational sociology has been introduced and gaining popularity {{According to whom|date=June 2017}}.  This has been used primarily for modeling or building explanations of social processes and are depending on the emergence of complex behavior from simple activities.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;&amp;gt;Salgado, Mauricio, and Nigel Gilbert. &amp;quot;[http://epubs.surrey.ac.uk/749319/1/Emergence%20and%20Communication%20-%20V3%201.pdf Emergence and communication in computational sociology].&amp;quot; Journal for the Theory of Social Behaviour 43.1 (2013): 87-110.&amp;lt;/ref&amp;gt;  The idea behind emergence is that properties of any bigger system do not always have to be properties of the components that the system is made of.&amp;lt;ref&amp;gt;Macy, Michael W., and Robert Willer. &amp;quot;[http://sct.uab.cat/lsds/sites/sct.uab.cat.lsds/files/FROM%20FACTORS%20TO%20ACTORS%20(Macy%20and%20Willer%202002).pdf From factors to actors: computational sociology and agent-based modeling].&amp;quot; Annual review of sociology 28.1 (2002): 143-166.&amp;lt;/ref&amp;gt;  The people responsible for the introduction of the idea of emergence are Alexander, Morgan, and Broad, who were classical emergentists.  The time at which these emergentists came up with this concept and method was during the time of the early twentieth century.  The aim of this method was to find a good enough accommodation between two different and extreme ontologies, which were reductionist materialism and dualism.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;/&amp;gt; &lt;br /&gt;
&lt;br /&gt;
In the past four decades, computational sociology has been introduced and gaining popularity.  This has been used primarily for modeling or building explanations of social processes and are depending on the emergence of complex behavior from simple activities.  The idea behind emergence is that properties of any bigger system do not always have to be properties of the components that the system is made of.  The people responsible for the introduction of the idea of emergence are Alexander, Morgan, and Broad, who were classical emergentists.  The time at which these emergentists came up with this concept and method was during the time of the early twentieth century.  The aim of this method was to find a good enough accommodation between two different and extreme ontologies, which were reductionist materialism and dualism. &lt;br /&gt;
&lt;br /&gt;
在过去的四十年里，计算社会学诞生并且越来越受欢迎。这主要用于建模或构建社会过程的解释，并且依赖于从简单活动中'''涌现 Emergence'''的复杂行为。涌现背后的思想是，任何较大系统不总是必须和组成系统的部分具有一样的性质。引入涌现思想的人是亚历山大 Alexander、摩根 Morgan和布罗德 Broad，他们都是'''经典涌现主义者 Classical Emergentists'''。经典涌现主义者提出这个概念和方法的时间是在二十世纪初期。这种方法的目的是在还原论的唯物主义和二元论这两种不同的本体论之间找到一个足够好的调和。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
While emergence has had a valuable and important role with the foundation of Computational Sociology, there are those who do not necessarily agree.  One major leader in the field, Epstein, doubted the use because there were aspects that are unexplainable.  Epstein put up a claim against emergentism, in which he says it &amp;quot;is precisely the generative sufficiency of the parts that constitutes the whole's explanation&amp;quot;.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
While emergence has had a valuable and important role with the foundation of Computational Sociology, there are those who do not necessarily agree.  One major leader in the field, Epstein, doubted the use because there were aspects that are unexplainable.  Epstein put up a claim against emergentism, in which he says it &amp;quot;is precisely the generative sufficiency of the parts that constitutes the whole's explanation&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
虽然涌现在计算社会学的建立上发挥了宝贵而重要的作用，但也有人不太同意。该领域的一个主要人物爱泼斯坦 Epstein对这种&amp;lt;font color='red'&amp;gt;用法&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;概念&amp;lt;/font&amp;gt;持怀疑态度，因为有些方面是这个&amp;lt;font color='red'&amp;gt;用法&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;概念&amp;lt;/font&amp;gt;无法解释的。爱泼斯坦提出了一种反对“涌现主义”的观点，他表示:“&amp;lt;font color=='red'&amp;gt;正是这些部分的有生成意义的充分性构成了对整体的解释&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;  正是这些部分所产生的充分性构成了对整体的解释&amp;lt;/font&amp;gt;”。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Agent-based models have had a historical influence on Computational Sociology.   These models first came around in the 1960s, and were used to simulate control and feedback processes in organizations, cities, etc.  During the 1970s, the application introduced the use of individuals as the main units for the analyses and used bottom-up strategies for modeling behaviors.  The last wave occurred in the 1980s.  At this time, the models were still bottom-up; the only difference is that the agents interact interdependently.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Agent-based models have had a historical influence on Computational Sociology. These models first came around in the 1960s, and were used to simulate control and feedback processes in organizations, cities, etc.  During the 1970s, the application introduced the use of individuals as the main units for the analyses and used bottom-up strategies for modeling behaviors.  The last wave occurred in the 1980s.  At this time, the models were still bottom-up; the only difference is that the agents interact interdependently.&lt;br /&gt;
&lt;br /&gt;
'''基于主体的模型 Agent-based Models'''对计算社会学有着历史性的影响。这些模型最早出现在20世纪60年代，用于仿真模拟组织、城市等系统的控制和反馈过程。在20世纪70年代，&amp;lt;font color='red'&amp;gt;应用程序&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; ABM模型&amp;lt;/font&amp;gt;引入个体作为主要的分析单元，并使用自下而上的策略来对行为建模。最后一波浪潮发生在20世纪80年代。那时，模型仍然是自下而上的; 唯一的区别是主体之间具有互相依赖和相互作用。&lt;br /&gt;
&lt;br /&gt;
===Systems theory and structural functionalism 系统理论和结构功能主义===&lt;br /&gt;
&lt;br /&gt;
{{main|Systems theory|Structural functionalism}}&lt;br /&gt;
&lt;br /&gt;
In the post-war era, [[Vannevar Bush]]'s [[differential analyser]], [[John von Neumann]]'s [[Von Neumann cellular automata|cellular automata]], [[Norbert Wiener]]'s [[cybernetics]], and [[Claude Shannon]]'s [[information theory]] became influential paradigms for modeling and understanding complexity in technical systems. In response, scientists in disciplines such as physics, biology, electronics, and economics began to articulate a [[systems theory|general theory of systems]] in which all natural and physical phenomena are manifestations of interrelated elements in a system that has common patterns and properties. Following [[Émile Durkheim]]'s call to analyze complex modern society ''[[sui generis]]'',&amp;lt;ref&amp;gt;{{cite book|first=Émile |last=Durkheim |title=The Division of Labor in Society |location=New York, NY |publisher=Macmillan}}&amp;lt;/ref&amp;gt; post-war structural functionalist sociologists such as [[Talcott Parsons]] seized upon these theories of systematic and hierarchical interaction among constituent components to attempt to generate grand unified sociological theories, such as the [[AGIL paradigm]].&amp;lt;ref name=&amp;quot;Bailey&amp;quot;&amp;gt;{{cite book|first1=Kenneth D. |last1=Bailey |editor=Jonathan H. Turner |chapter=Systems Theory |title=Handbook of Sociological Theory |publisher=Springer Science |year=2006 |location=New York, NY |isbn=978-0-387-32458-6 |pages=379–404}}&amp;lt;/ref&amp;gt; Sociologists such as [[George Homans]] argued that sociological theories should be formalized into hierarchical structures of propositions and precise terminology from which other propositions and hypotheses could be derived and operationalized into empirical studies.&amp;lt;ref name=&amp;quot;Blackwell&amp;quot;&amp;gt;{{cite encyclopedia|year=2007 |title=Computational Sociology |last=Bainbridge |first=William Sims |encyclopedia=Blackwell Encyclopedia of Sociology |publisher=Blackwell Reference Online |url=http://www.sociologyencyclopedia.com/subscriber/tocnode?id=g9781405124331_chunk_g97814051243319_ss1-85 |doi=10.1111/b.9781405124331.2007.x |hdl=10138/224218 |editor=Ritzer, George|isbn=978-1-4051-2433-1|hdl-access=free }}&amp;lt;/ref&amp;gt; Because computer algorithms and programs had been used as early as 1956 to test and validate mathematical theorems, such as the [[four color theorem]],&amp;lt;ref&amp;gt;{{cite book|last=Crevier |first=D. |year=1993 |title=AI: The Tumultuous History of the Search for Artificial Intelligence |url=https://archive.org/details/aitumultuoushist00crev |url-access=registration |publisher=Basic Books |location=New York, NY}}&amp;lt;/ref&amp;gt; some scholars anticipated that similar computational approaches could &amp;quot;solve&amp;quot; and &amp;quot;prove&amp;quot; analogously formalized problems and theorems of social structures and dynamics.&lt;br /&gt;
&lt;br /&gt;
In the post-war era, Vannevar Bush's differential analyser, John von Neumann's cellular automata, Norbert Wiener's cybernetics, and Claude Shannon's information theory became influential paradigms for modeling and understanding complexity in technical systems. In response, scientists in disciplines such as physics, biology, electronics, and economics began to articulate a general theory of systems in which all natural and physical phenomena are manifestations of interrelated elements in a system that has common patterns and properties. Following Émile Durkheim's call to analyze complex modern society sui generis, post-war structural functionalist sociologists such as Talcott Parsons seized upon these theories of systematic and hierarchical interaction among constituent components to attempt to generate grand unified sociological theories, such as the AGIL paradigm. Sociologists such as George Homans argued that sociological theories should be formalized into hierarchical structures of propositions and precise terminology from which other propositions and hypotheses could be derived and operationalized into empirical studies. Because computer algorithms and programs had been used as early as 1956 to test and validate mathematical theorems, such as the four color theorem, some scholars anticipated that similar computational approaches could &amp;quot;solve&amp;quot; and &amp;quot;prove&amp;quot; analogously formalized problems and theorems of social structures and dynamics.&lt;br /&gt;
&lt;br /&gt;
战后时期，范内瓦·布什（Vannevar Bush）的'''微分分析机 Differential Analyser''' 、冯·诺伊曼（John von Neumann）的'''元胞自动机 Cellular Automata'''、 维纳（Norbert Wiener）的'''控制论 Cybernetics'''和克劳德·香农（Claude Shannon）的'''信息论 Information Theory'''成为技术系统中建模和理解复杂性的重要范式。物理学、生物学、电子学和经济学等学科的科学家开始阐述系统的一般理论，即所有自然和物理现象都是具有共同模式和属性的系统中相互关联的元素的表现。&amp;lt;font color='red'&amp;gt;按照 &amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 沿着&amp;lt;/font&amp;gt;涂尔干（Émile Durkheim）分析特定的复杂现代社会&lt;br /&gt;
&lt;br /&gt;
（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]）Following Émile Durkheim's call to analyze complex modern society sui generis）&lt;br /&gt;
  --~~克劳德·香农（Claude Shannon）  这些同样去括号&lt;br /&gt;
&lt;br /&gt;
的&amp;lt;font color='red'&amp;gt;要求&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 思路&amp;lt;/font&amp;gt;，战后结构功能主义社会学家如帕森斯（Talcott Parsons）利用这些组成部分之间系统&amp;lt;font color='blue'&amp;gt;化&amp;lt;/font&amp;gt;和&amp;lt;font color='red'&amp;gt;等级&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 层次化&amp;lt;/font&amp;gt;相互作用的理论，试图产生大统一的社会学理论，如 AGIL 范式。霍曼斯（George Homans）等社会学家认为，社会学理论应该被构建为具有&amp;lt;font color='blue'&amp;gt;逻辑&amp;lt;/font&amp;gt;命题和精确术语的&amp;lt;font color='red'&amp;gt;等级&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 层次化&amp;lt;/font&amp;gt;结构，并且从中可以得出能够在实证研究中被操作化的其他命题和假设。由于早在1956年计算机算法和程序就已经被用来测试和验证数学定理（如'''四色定理Four Color Theorem'''），一些学者预计相似的计算方法可以“解决”和“证明”类似的社会结构和&amp;lt;font color='red'&amp;gt;动态&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 演变&amp;lt;/font&amp;gt;的&amp;lt;font color='blue'&amp;gt;形式化--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|讨论]]formalized应该也要翻译出来，computational证明的是形式化定理) &amp;lt;/font&amp;gt;问题和定理。&lt;br /&gt;
&lt;br /&gt;
===Macrosimulation and microsimulation 宏观模拟和微观模拟===&lt;br /&gt;
&lt;br /&gt;
{{main|System dynamics|Microsimulation}}&lt;br /&gt;
&lt;br /&gt;
By the late 1960s and early 1970s, social scientists used increasingly available computing technology to perform macro-simulations of control and feedback processes in organizations, industries, cities, and global populations. These models used differential equations to predict population distributions as holistic functions of other systematic factors such as inventory control, urban traffic, migration, and disease transmission.&amp;lt;ref&amp;gt;{{cite book|first=Jay |last=Forrester |year=1971 |title=World Dynamics |location=Cambridge, MA |publisher=MIT Press}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|doi=10.1287/opre.26.2.237|title=Using Simulation to Develop and Validate Analytic Models: Some Case Studies |first1=Edward J. |last1=Ignall |first2=Peter |last2=Kolesar |first3=Warren E. |last3=Walker |journal=Operations Research |volume=26 |issue=2 |year=1978 |pages=237–253}}&amp;lt;/ref&amp;gt; Although simulations of social systems received substantial attention in the mid-1970s after the [[Club of Rome]] published reports predicting that policies promoting exponential economic growth would eventually bring global environmental catastrophe,&amp;lt;ref&amp;gt;{{cite book|title=The Dynamics of Growth in a Finite World |last1=Meadows |first1=DL |last2=Behrens |first2=WW |last3=Meadows |first3=DH |last4=Naill |first4=RF |last5= Randers |first5=J |last6=Zahn |first6=EK |year=1974 |location=Cambridge, MA |publisher=MIT Press}}&amp;lt;/ref&amp;gt; the inconvenient conclusions led many authors to seek to discredit the models, attempting to make the researchers themselves appear unscientific.&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;/&amp;gt;&amp;lt;ref&amp;gt;{{cite news|title=Computer View of Disaster Is Rebutted |newspaper=The New York Times |date=October 18, 1974|url=https://www.nytimes.com/1974/10/18/archives/computer-view-of-disaster-is-rebutted.html?_r=0}}&amp;lt;/ref&amp;gt; Hoping to avoid the same fate, many social scientists turned their attention toward micro-simulation models to make forecasts and study policy effects by modeling aggregate changes in state of individual-level entities rather than the changes in distribution at the population level.&amp;lt;ref&amp;gt;{{cite journal|doi=10.1016/0167-2681(90)90038-F|title=From engineering to microsimulation : An autobiographical reflection |journal=Journal of Economic Behavior &amp;amp; Organization |year=1990 |volume=14 |issue=1 |pages=5–27 |first=Guy H. |last=Orcutt}}&amp;lt;/ref&amp;gt; However, these micro-simulation models did not permit individuals to interact or adapt and were not intended for basic theoretical research.&amp;lt;ref name=&amp;quot;MW&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
By the late 1960s and early 1970s, social scientists used increasingly available computing technology to perform macro-simulations of control and feedback processes in organizations, industries, cities, and global populations. These models used differential equations to predict population distributions as holistic functions of other systematic factors such as inventory control, urban traffic, migration, and disease transmission. Although simulations of social systems received substantial attention in the mid-1970s after the Club of Rome published reports predicting that policies promoting exponential economic growth would eventually bring global environmental catastrophe, the inconvenient conclusions led many authors to seek to discredit the models, attempting to make the researchers themselves appear unscientific. Hoping to avoid the same fate, many social scientists turned their attention toward micro-simulation models to make forecasts and study policy effects by modeling aggregate changes in state of individual-level entities rather than the changes in distribution at the population level. However, these micro-simulation models did not permit individuals to interact or adapt and were not intended for basic theoretical research.&lt;br /&gt;
&lt;br /&gt;
截至20世纪60年代末70年代初，社会科学家越来越多地使用已有的计算技术，在组织、工业、城市和全球人口中进行控制和反馈过程的'''宏观模拟 Macrosimulation''' 。这些模型使用微分方程作为其他系统因素的整体函数来预测人口分布，这些系统因素包括库存控制、城市交通、人口迁移和疾病传播等。20世纪70年代中期，'''罗马俱乐部 Club of Rome''' 发表报告预测，促进指数式经济增长的政策最终将导致全球环境灾难，这个悲观的结论导致许多研究者试图反驳这些模型，并试图让研究显得不那么科学。&lt;br /&gt;
  （--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） 根据意思，inconvenient译为悲观的，因为这个结论预示了悲观的未来，所以令指出这一点的科学家们感到inconvenient）&lt;br /&gt;
为了避免同样的情况，许多社会科学家将注意力转向'''微观模拟 Microsimulation'''模型。这些模型通过模拟个体状态的总体变化而不是总体人口级别的变化来进行预测和研究政策的效果。然而，这些微观模拟模型并不允许个体相互作用或适应、变化（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]）变化是根据适应（adapt）加上去的，不知道是否合理），研究者也不打算将它们用于基础理论研究。&lt;br /&gt;
&lt;br /&gt;
===Cellular automata and agent-based modeling 元胞自动机和基于主体建模===&lt;br /&gt;
&lt;br /&gt;
{{main|Cellular automata|agent-based modeling}}&lt;br /&gt;
&lt;br /&gt;
The 1970s and 1980s were also a time when physicists and mathematicians were attempting to model and analyze how simple component units, such as atoms, give rise to global properties, such as complex material properties at low temperatures, in magnetic materials, and within turbulent flows.&amp;lt;ref&amp;gt;{{cite book|title=Cellular automata machines: a new environment for modeling |url=https://archive.org/details/cellularautomata00toff |url-access=registration |first1=Tommaso |last1=Toffoli |first2=Norman |last2=Margolus | author2-link = Norman Margolus |year=1987 |publisher=MIT Press |location=Cambridge, MA}}&amp;lt;/ref&amp;gt; Using cellular automata, scientists were able to specify systems consisting of a grid of cells in which each cell only occupied some finite states and changes between states were solely governed by the states of immediate neighbors. Along with advances in [[artificial intelligence]] and [[microcomputer]] power, these methods contributed to the development of &amp;quot;[[chaos theory]]&amp;quot; and &amp;quot;[[complex systems|complexity theory]]&amp;quot; which, in turn, renewed interest in understanding complex physical and social systems across disciplinary boundaries.&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;/&amp;gt; Research organizations explicitly dedicated to the interdisciplinary study of complexity were also founded in this era: the [[Santa Fe Institute]] was established in 1984 by scientists based at [[Los Alamos National Laboratory]] and the BACH group at the [[University of Michigan]] likewise started in the mid-1980s.&lt;br /&gt;
&lt;br /&gt;
The 1970s and 1980s were also a time when physicists and mathematicians were attempting to model and analyze how simple component units, such as atoms, give rise to global properties, such as complex material properties at low temperatures, in magnetic materials, and within turbulent flows. Using cellular automata, scientists were able to specify systems consisting of a grid of cells in which each cell only occupied some finite states and changes between states were solely governed by the states of immediate neighbors. Along with advances in artificial intelligence and microcomputer power, these methods contributed to the development of &amp;quot;chaos theory&amp;quot; and &amp;quot;complexity theory&amp;quot; which, in turn, renewed interest in understanding complex physical and social systems across disciplinary boundaries. Research organizations explicitly dedicated to the interdisciplinary study of complexity were also founded in this era: the Santa Fe Institute was established in 1984 by scientists based at Los Alamos National Laboratory and the BACH group at the University of Michigan likewise started in the mid-1980s.&lt;br /&gt;
&lt;br /&gt;
20世纪70年代和80年代，物理学家和数学家也在试图模拟和分析简单的组成单位如何产生整体特性，比如低温环境中原子在磁性材料和湍流中的复杂材料特性。使用'''元胞自动机 Cellular Automata'''，科学家们能够指定由元胞网格组成的系统，其中每个元胞只占据一些有限的状态，状态之间的变化完全由相邻元胞的状态控制。随着人工智能和微型计算机能力的进步，这些方法促进了“混沌理论”和“复杂性理论”的发展，这反过来又重新引起了人们对跨学科的复杂物理和社会系统的兴趣。明确致力于跨学科复杂性研究的机构也是在这个时代成立的: 圣菲研究所是由美国洛斯阿拉莫斯国家实验室（Los Alamos National Laboratory）的科学家于1984年建立的，密歇根大学的 BACH 小组也是在20世纪80年代中期建立的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This cellular automata paradigm gave rise to a third wave of social simulation emphasizing agent-based modeling. Like micro-simulations, these models emphasized bottom-up designs but adopted four key assumptions that diverged from microsimulation: autonomy, interdependency, simple rules, and adaptive behavior.&amp;lt;ref name=&amp;quot;MW&amp;quot;/&amp;gt; Agent-based models are less concerned with predictive accuracy and instead emphasize theoretical development.&amp;lt;ref&amp;gt;{{cite journal |title=A simulation of the structure of academic science |journal=Sociological Research Online |volume=2 |issue=2 |pages=1–15 |year=1997 |first=Nigel |last=Gilbert |url=http://www.socresonline.org.uk/socresonline/2/2/3.html |doi=10.5153/sro.85 |access-date=2009-12-16 |archive-url=https://web.archive.org/web/19980524062306/http://www.socresonline.org.uk/socresonline/2/2/3.html |archive-date=1998-05-24 |url-status=dead }}&amp;lt;/ref&amp;gt; In 1981, mathematician and political scientist [[Robert Axelrod]] and evolutionary biologist [[W.D. Hamilton]] published a major paper in ''[[Science (journal)|Science]]'' titled &amp;quot;The Evolution of Cooperation&amp;quot; which used an agent-based modeling approach to demonstrate how social cooperation based upon reciprocity can be established and stabilized in a [[prisoner's dilemma]] game when agents followed simple rules of self-interest.&amp;lt;ref&amp;gt;{{cite journal|title=The Evolution of Cooperation |first1=Robert |last1=Axelrod |first2=William D. |last2=Hamilton |journal=Science |volume=211 |issue=4489 |pages=1390–1396 |doi=10.1126/science.7466396|pmid=7466396 |date=March 27, 1981|bibcode=1981Sci...211.1390A }}&amp;lt;/ref&amp;gt; Axelrod and Hamilton demonstrated that individual agents following a simple rule set of (1) cooperate on the first turn and (2) thereafter replicate the partner's previous action were able to develop &amp;quot;norms&amp;quot; of cooperation and sanctioning in the absence of canonical sociological constructs such as demographics, values, religion, and culture as preconditions or mediators of cooperation.&amp;lt;ref name=&amp;quot;Cooperation&amp;quot;/&amp;gt; Throughout the 1990s, scholars like [[William Sims Bainbridge]], [[Kathleen Carley]], [[Michael Macy]],  and [[John Skvoretz]] developed multi-agent-based models of [[generalized reciprocity]], [[prejudice]], [[social influence]], and organizational [[information processing]]. In 1999, [[Nigel Gilbert]] published the first textbook on Social Simulation: ''Simulation for the social scientist'' and established its most relevant journal: the [[Journal of Artificial Societies and Social Simulation]].&lt;br /&gt;
&lt;br /&gt;
This cellular automata paradigm gave rise to a third wave of social simulation emphasizing agent-based modeling. Like micro-simulations, these models emphasized bottom-up designs but adopted four key assumptions that diverged from microsimulation: autonomy, interdependency, simple rules, and adaptive behavior. In 1981, mathematician and political scientist Robert Axelrod and evolutionary biologist W.D. Hamilton published a major paper in Science titled &amp;quot;The Evolution of Cooperation&amp;quot; which used an agent-based modeling approach to demonstrate how social cooperation based upon reciprocity can be established and stabilized in a prisoner's dilemma game when agents followed simple rules of self-interest. Axelrod and Hamilton demonstrated that individual agents following a simple rule set of (1) cooperate on the first turn and (2) thereafter replicate the partner's previous action were able to develop &amp;quot;norms&amp;quot; of cooperation and sanctioning in the absence of canonical sociological constructs such as demographics, values, religion, and culture as preconditions or mediators of cooperation. Throughout the 1990s, scholars like William Sims Bainbridge, Kathleen Carley, Michael Macy,  and John Skvoretz developed multi-agent-based models of generalized reciprocity, prejudice, social influence, and organizational information processing. In 1999, Nigel Gilbert published the first textbook on Social Simulation: Simulation for the social scientist and established its most relevant journal: the Journal of Artificial Societies and Social Simulation.&lt;br /&gt;
&lt;br /&gt;
元胞自动机范式引发了强调'''基于主体建模 Agent-based Modeling'''的第三次社会模拟浪潮。与微观模拟一样，这些模型强调自下而上的设计，但采用了与微观模拟不同的四个关键假设: '''自主性 Autonomy'''、'''相互依赖性 Interdependency'''、'''简单规则 Simple Rules'''和'''适应性行为 Adaptive Behavior'''。1981年，数学家、政治学家阿克塞尔罗德（Robert Axelrod）和进化生物学家汉密尔顿（W.D. Hamilton）在《科学》杂志上发表了一篇名为《合作的进化》（The Evolution of Cooperation）的重要论文，该论文采用基于主体建模方法，论证了在一个囚徒困境中，当主体遵循简单的自利规则时，互惠的社会合作是如何建立和稳定的。阿克塞尔罗德和汉密尔顿证明，主体遵循这样一套简单的规则: (1)在第一轮进行合作，(2)在其后重复伙伴以前的行动，能够在没有人口学差异、价值观、宗教和文化等社会规范作为合作的先决条件或中介的情况下制定合作和制裁的“规范”。整个20世纪90年代，像威廉·希姆斯·本布里奇（William Sims Bainbridge），Kathleen Carley，Michael Macy 和 John Skvoretz 这样的学者开发了基于多主体的广义互惠、偏见、社会影响和组织信息处理模型。1999年，吉尔伯特（Nigel Gilbert）出版了第一本关于社会模拟: 写给社会科学家的仿真模拟（Simulation for the social scientist）的教科书，并建立了它最相关的杂志: 人工社会和社会模拟杂志（the Journal of Artificial Societies and Social Simulation）。&lt;br /&gt;
&lt;br /&gt;
===Data mining and social network analysis 数据挖掘和社会网络分析===&lt;br /&gt;
&lt;br /&gt;
{{main|Data mining|Social network analysis}}&lt;br /&gt;
&lt;br /&gt;
--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） 少一段原文 &lt;br /&gt;
Independent from developments in computational models of social systems, social network analysis emerged in the 1970s and 1980s from advances in graph theory, statistics, and studies of social structure as a distinct analytical method and was articulated and employed by sociologists like James S. Coleman, Harrison White, Linton Freeman, J. Clyde Mitchell, Mark Granovetter, Ronald Burt, and Barry Wellman.[22] The increasing pervasiveness of computing and telecommunication technologies throughout the 1980s and 1990s demanded analytical techniques, such as network analysis and multilevel modeling, that could scale to increasingly complex and large data sets. The most recent wave of computational sociology, rather than employing simulations, uses network analysis and advanced statistical techniques to analyze large-scale computer databases of electronic proxies for behavioral data. Electronic records such as email and instant message records, hyperlinks on the World Wide Web, mobile phone usage, and discussion on Usenet allow social scientists to directly observe and analyze social behavior at multiple points in time and multiple levels of analysis without the constraints of traditional empirical methods such as interviews, participant observation, or survey instruments.[23] Continued improvements in machine learning algorithms likewise have permitted social scientists and entrepreneurs to use novel techniques to identify latent and meaningful patterns of social interaction and evolution in large electronic datasets.[24][25]&lt;br /&gt;
&lt;br /&gt;
Independent from developments in computational models of social systems, social network analysis emerged in the 1970s and 1980s from advances in graph theory, statistics, and studies of social structure as a distinct analytical method and was articulated and employed by sociologists like [[James Samuel Coleman|James S. Coleman]], [[Harrison White]], [[Linton Freeman]], [[J. Clyde Mitchell]], [[Mark Granovetter]], [[Ronald Burt]], and [[Barry Wellman]].&amp;lt;ref&amp;gt;{{cite book|title=The Development of Social Network Analysis: A Study in the Sociology of Science |first=Linton C. |last=Freeman |publisher=Empirical Press |location=Vancouver, BC |year=2004}}&amp;lt;/ref&amp;gt; The increasing pervasiveness of computing and telecommunication technologies throughout the 1980s and 1990s demanded analytical techniques, such as [[network theory|network analysis]] and [[multilevel modeling]], that could scale to increasingly complex and large data sets. The most recent wave of computational sociology, rather than employing simulations, uses network analysis and advanced statistical techniques to analyze large-scale computer databases of electronic proxies for behavioral data. Electronic records such as email and instant message records, hyperlinks on the [[World Wide Web]], mobile phone usage, and discussion on [[Usenet]] allow social scientists to directly observe and analyze social behavior at multiple points in time and multiple levels of analysis without the constraints of traditional empirical methods such as interviews, participant observation, or survey instruments.&amp;lt;ref&amp;gt;{{cite journal|title=Life in the network: the coming age of computational social science|first9=J|last10=Gutmann|first10=M.|last11=Jebara|first11=T.|last12=King|first12=G.|last13=Macy|first13=M.|last14=Roy|first14=D.|last15=Van Alstyne|first15=M.|last9=Fowler|first8=N|last8=Contractor|first7=N|last7=Christakis|first6=D|last6=Brewer|first5=AL|last5=Barabasi|first4=S |journal=Science|last4=Aral |date=February 6, 2009|first3=L |volume=323|pmid=19197046 |issue=5915|last3=Adamic |pages=721–723|pmc=2745217 |doi=10.1126/science.1167742 |first1=David |last1=Lazer |first2=Alex |last2=Pentland |display-authors=8}}&amp;lt;/ref&amp;gt; Continued improvements in [[machine learning]] algorithms likewise have permitted social scientists and entrepreneurs to use novel techniques to identify latent and meaningful patterns of social interaction and evolution in large electronic datasets.&amp;lt;ref&amp;gt;{{cite journal|first1=Jaideep |last1=Srivastava |first2=Robert |last2=Cooley |first3=Mukund |last3=Deshpande |first4=Pang-Ning |last4=Tan |journal=Proceedings of the ACM Conference on Knowledge Discovery and Data Mining |title=Web usage mining: discovery and applications of usage patterns from Web data|volume=1 |year=2000 |pages=12–23 |doi=10.1145/846183.846188|issue=2}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|doi=10.1016/S0169-7552(98)00110-X|title=The anatomy of a large-scale hypertextual Web search engine |first1=Sergey |last1=Brin |first2=Lawrence |last2=Page |journal=Computer Networks and ISDN Systems |volume=30 |issue=1–7 |pages=107–117 |date=April 1998|citeseerx=10.1.1.115.5930 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Independent from developments in computational models of social systems, social network analysis emerged in the 1970s and 1980s from advances in graph theory, statistics, and studies of social structure as a distinct analytical method and was articulated and employed by sociologists like James S. Coleman, Harrison White, Linton Freeman, J. Clyde Mitchell, Mark Granovetter, Ronald Burt, and Barry Wellman. The increasing pervasiveness of computing and telecommunication technologies throughout the 1980s and 1990s demanded analytical techniques, such as network analysis and multilevel modeling, that could scale to increasingly complex and large data sets. The most recent wave of computational sociology, rather than employing simulations, uses network analysis and advanced statistical techniques to analyze large-scale computer databases of electronic proxies for behavioral data. Electronic records such as email and instant message records, hyperlinks on the World Wide Web, mobile phone usage, and discussion on Usenet allow social scientists to directly observe and analyze social behavior at multiple points in time and multiple levels of analysis without the constraints of traditional empirical methods such as interviews, participant observation, or survey instruments. Continued improvements in machine learning algorithms likewise have permitted social scientists and entrepreneurs to use novel techniques to identify latent and meaningful patterns of social interaction and evolution in large electronic datasets.&lt;br /&gt;
&lt;br /&gt;
'''社会网络分析 Social Network Analysis'''独立于社会系统计算模型的发展，在20世纪70年代和80年代出现于图论、统计学和社会结构的研究中，它作为一种独特的分析方法被社会学家如 James s. Coleman，Harrison White，Linton Freeman，J. Clyde Mitchell，Mark Granovetter，Ronald Burt 和 Barry Wellman 等阐述和采用。在整个1980年代和1990年代，计算和通信技术日益普及，这要求采用诸如网络分析和多级建模等分析技术，这些技术可以扩展到日益复杂和庞大的数据集中。最近的计算社会学没有使用模拟，而是使用网络分析和先进的统计技术来分析大规模计算机数据库中电子代理的行为数据。电子记录，如电子邮件和即时消息记录，万维网上的超链接，移动电话数据，以及 Usenet 上的讨论，使社会科学家能够直接观察社会行为并在多个时间点和多个层次的分析行为，并且不受传统的实证方法，如访谈、观察（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]）为了通顺，删除研究对象/被试：participants）或调查工具的限制。机器学习算法的不断改进同样使得社会科学家和企业家能够使用新技术来识别大型电子数据集中潜在但有意义的社会互动和演化模式。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:Tripletsnew2012.png|thumb|right|Narrative network of US Elections 2012&amp;lt;ref name=&amp;quot;ReferenceA&amp;quot;&amp;gt;{{cite journal|title=Automated analysis of the US presidential elections using Big Data and network analysis|author1=S Sudhahar|author2=GA Veltri|author3=N Cristianini|journal=Big Data &amp;amp; Society|volume=2|issue=1|pages=1–28|year=2015|doi=10.1177/2053951715572916|doi-access=free}}&amp;lt;/ref&amp;gt;]]&lt;br /&gt;
&lt;br /&gt;
Narrative network of US Elections 2012&lt;br /&gt;
&lt;br /&gt;
【图2：Narrative network of US Elections 2012 + 2012年美国大选叙事网络】&lt;br /&gt;
&lt;br /&gt;
The automatic parsing of textual corpora has enabled the extraction of actors and their relational networks on a vast scale, turning textual data into network data.  The resulting networks, which can contain thousands of nodes, are then analysed by using tools from Network theory to identify the key actors, the key communities or parties, and general properties such as robustness or structural stability of the overall network, or centrality of certain nodes.&amp;lt;ref&amp;gt;{{cite journal|title=Network analysis of narrative content in large corpora|author1=S Sudhahar|author2=G De Fazio|author3=R Franzosi|author4=N Cristianini|journal=Natural Language Engineering|volume=21|issue=1|pages=1–32|year=2013|doi=10.1017/S1351324913000247 |url=https://research-information.bristol.ac.uk/files/129621186/Network_Analysis_of_Narrative_Content_in_Large_Corpora.pdf}}&amp;lt;/ref&amp;gt; This automates the approach introduced by quantitative narrative analysis,&amp;lt;ref&amp;gt;{{cite book|title=Quantitative Narrative Analysis|last=Franzosi|first=Roberto|publisher=Emory University|year=2010}}&amp;lt;/ref&amp;gt; whereby subject-verb-object triplets are identified with pairs of actors linked by an action, or pairs formed by actor-object.&amp;lt;ref name=&amp;quot;ReferenceA&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The automatic parsing of textual corpora has enabled the extraction of actors and their relational networks on a vast scale, turning textual data into network data.  The resulting networks, which can contain thousands of nodes, are then analysed by using tools from Network theory to identify the key actors, the key communities or parties, and general properties such as robustness or structural stability of the overall network, or centrality of certain nodes. This automates the approach introduced by quantitative narrative analysis, whereby subject-verb-object triplets are identified with pairs of actors linked by an action, or pairs formed by actor-object.&lt;br /&gt;
&lt;br /&gt;
文本语料库的自动解析使对参与者及其关系网络的大规模提取成为可能，它将文本数据转换为网络数据。由此产生的网络可以包含数千个'''节点 Nodes'''，然后利用网络理论中的工具对其进行分析，以确定关键参与者、关键群体，以及网络的总体特性如稳健性、结构稳定性，或某些节点的'''中心性 Centrality'''等。这使'''定量叙事分析Quantitative Narrative Analysis'''引入的方法得以自动化，据此，主语-动词-宾语三元组被看作由动作连接的成对行为者，或者由行为者-宾语形成的成对行为者。&lt;br /&gt;
&lt;br /&gt;
===Computational content analysis 计算机内容分析 （名词翻译可吗？）===&lt;br /&gt;
&lt;br /&gt;
[[Content analysis]] has been a traditional part of social sciences and media studies for a long time. The automation of content analysis has allowed a &amp;quot;[[big data]]&amp;quot; revolution to take place in that field, with studies in social media and newspaper content that include millions of news items. [[Gender bias]], [[readability]], content similarity, reader preferences, and even mood have been analyzed based on [[text mining]] methods over millions of documents.&amp;lt;ref&amp;gt;{{cite journal|author1=I. Flaounas|author2=M. Turchi|author3=O. Ali|author4=N. Fyson|author5=T. De Bie|author6=N. Mosdell|author7=J. Lewis|author8=N. Cristianini|title=The Structure of EU Mediasphere|journal=PLOS One|volume=5|issue=12|pages=e14243|year=2010|doi=10.1371/journal.pone.0014243|url=https://orca-mwe.cf.ac.uk/50732/1/Flaounas%202010.pdf|pmid=21170383|pmc=2999531|bibcode=2010PLoSO...514243F}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|title=Nowcasting Events from the Social Web with Statistical Learning|author1=V Lampos|author2=N Cristianini|journal=ACM Transactions on Intelligent Systems and Technology |volume=3|issue=4|page=72|doi=10.1145/2337542.2337557|year=2012|url=http://www.lampos.net/sites/default/files/papers/lampos2012nowcasting.pdf}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite conference|title=NOAM: news outlets analysis and monitoring system|author1=I. Flaounas|author2=O. Ali|author3=M. Turchi|author4=T Snowsill|author5=F Nicart|author6=T De Bie|author7=N Cristianini|conference=Proc. of the 2011 ACM SIGMOD international conference on Management of data|year=2011|url=http://www.tijldebie.net/system/files/SIGMOD_11_demo_Ilias.pdf|doi=10.1145/1989323.1989474}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite book|author=N Cristianini|title=''Combinatorial Pattern Matching''|pages=2–13|year=2011|volume=6661|series= Lecture Notes in Computer Science|isbn=978-3-642-21457-8|doi=10.1007/978-3-642-21458-5_2|chapter=Automatic Discovery of Patterns in Media Content|citeseerx=10.1.1.653.9525}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite journal|last=Lansdall-Welfare|first=Thomas|last2=Sudhahar|first2=Saatviga|last3=Thompson|first3=James|last4=Lewis|first4=Justin|last5=Team|first5=FindMyPast Newspaper|last6=Cristianini|first6=Nello|date=2017-01-09|title=Content analysis of 150 years of British periodicals|url=http://www.pnas.org/content/early/2017/01/03/1606380114|journal=Proceedings of the National Academy of Sciences|volume=114|issue=4|language=en|pages=E457–E465|doi=10.1073/pnas.1606380114|issn=0027-8424|pmid=28069962|pmc=5278459}}&amp;lt;/ref&amp;gt; The analysis of readability, gender bias and topic bias was demonstrated in Flaounas et al.&amp;lt;ref&amp;gt;{{cite journal|author1=I. Flaounas|author2=O. Ali|author3=M. Turchi|author4=T. Lansdall-Welfare|author5=T. De Bie|author6=N. Mosdell|author7=J. Lewis|author8=N. Cristianini|title=Research methods in the age of digital journalism|journal=Digital Journalism|year=2012|doi=10.1080/21670811.2012.714928|volume=1|pages=102–116}}&amp;lt;/ref&amp;gt; showing how different topics have different gender biases and levels of readability; the possibility to detect mood shifts in a vast population by analysing Twitter content was demonstrated as well.&amp;lt;ref&amp;gt;{{cite conference|title=Effects of the Recession on Public Mood in the UK|author=T Lansdall-Welfare|author2=V Lampos|author3=N Cristianini|series=Mining Social Network Dynamics (MSND) session on Social Media Applications|doi=10.1145/2187980.2188264|conference=Proceedings of the 21st International Conference on World Wide Web|pages=1221–1226|location=New York, NY, USA|url=http://www.cs.bris.ac.uk/Publications/Papers/2001521.pdf}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Content analysis has been a traditional part of social sciences and media studies for a long time. The automation of content analysis has allowed a &amp;quot;big data&amp;quot; revolution to take place in that field, with studies in social media and newspaper content that include millions of news items. Gender bias, readability, content similarity, reader preferences, and even mood have been analyzed based on text mining methods over millions of documents. The analysis of readability, gender bias and topic bias was demonstrated in Flaounas et al. showing how different topics have different gender biases and levels of readability; the possibility to detect mood shifts in a vast population by analysing Twitter content was demonstrated as well.&lt;br /&gt;
&lt;br /&gt;
长期以来，内容分析一直是社会科学和媒体研究的传统方法。内容分析的自动化使得这一领域发生了一场“大数据”革命，这些研究中，社交媒体和报纸内容包括了数百万条的新闻。基于文本挖掘方法，'''性别偏差Gender Bias'''、'''可读性 Readability'''、'''内容相似度 Content Similarity'''、'''读者偏好 Reader Preferences'''，甚至是'''情绪 Mood'''的数以百万计的文档都可以被分析。Flaounas等人对可读性、性别偏差和'''话题偏差 Topic Bias'''为主要研究对象，展示了不同的话题如何有不同水平的性别偏差和可读性; 展示了通过分析推特内容来检测人群情绪变化的可能性。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The analysis of vast quantities of historical newspaper content has been pioneered by Dzogang et al.,&amp;lt;ref&amp;gt;{{Cite journal|last=Dzogang|first=Fabon|last2=Lansdall-Welfare|first2=Thomas|last3=Team|first3=FindMyPast Newspaper|last4=Cristianini|first4=Nello|date=2016-11-08|title=Discovering Periodic Patterns in Historical News|journal=PLOS One|volume=11|issue=11|pages=e0165736|doi=10.1371/journal.pone.0165736|issn=1932-6203|pmc=5100883|pmid=27824911|bibcode=2016PLoSO..1165736D}}&amp;lt;/ref&amp;gt; which showed how periodic structures can be automatically discovered in historical newspapers. A similar analysis was performed on social media, again revealing strongly periodic structures.&amp;lt;ref&amp;gt;[https://core.ac.uk/download/pdf/83929129.pdf Seasonal Fluctuations in Collective Mood Revealed by Wikipedia Searches and Twitter Posts] F Dzogang, T Lansdall-Welfare, N Cristianini - 2016 IEEE International Conference on Data Mining, Workshop on ''Data Mining'' in Human Activity Analysis&lt;br /&gt;
&lt;br /&gt;
The analysis of vast quantities of historical newspaper content has been pioneered by Dzogang et al., which showed how periodic structures can be automatically discovered in historical newspapers. A similar analysis was performed on social media, again revealing strongly periodic structures.&amp;lt;ref&amp;gt;[https://core.ac.uk/download/pdf/83929129.pdf Seasonal Fluctuations in Collective Mood Revealed by Wikipedia Searches and Twitter Posts] F Dzogang, T Lansdall-Welfare, N Cristianini - 2016 IEEE International Conference on Data Mining, Workshop on Data Mining in Human Activity Analysis&lt;br /&gt;
&lt;br /&gt;
对大量历史报纸内容的分析是由 Dzogang 等人率先进行的，他们展示了如何在历史报纸中自动发现'''周期结构 Periodic Structures'''。一个类似的社交媒体上进行的分析，也揭示了强烈的周期性结构。 参考文献[ https://core.ac.uk/download/pdf/83929129.pdf 维基百科搜索和推特帖子揭示的集体情绪的季节性波动] f Dzogang，t Lansdall-Welfare，n Cristianini-2016 IEEE International Conference on Data Mining, Workshop on Data Mining in Human Activity Analysis&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
==Challenges 挑战==&lt;br /&gt;
&lt;br /&gt;
Computational sociology, as with any field of study, faces a set of challenges.&amp;lt;ref name=&amp;quot;MCSS&amp;quot;&amp;gt;Conte, Rosaria, et al. &amp;quot;[https://link.springer.com/content/pdf/10.1140%252Fepjst%252Fe2012-01697-8.pdf Manifesto of computational social science].&amp;quot; The European Physical Journal Special Topics 214.1 (2012): 325-346.&amp;lt;/ref&amp;gt; These challenges need to be handled meaningfully so as to make the maximum impact on society.&lt;br /&gt;
&lt;br /&gt;
Computational sociology, as with any field of study, faces a set of challenges. These challenges need to be handled meaningfully so as to make the maximum impact on society.&lt;br /&gt;
&lt;br /&gt;
计算社会学和其他研究领域一样面临着一系列的挑战。必须有意义地处理这些挑战（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） meaningfully怎么翻译才比较通顺？），才能对社会产生最大的影响。&lt;br /&gt;
  &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Levels and their interactions 层级和层级的交互关系===&lt;br /&gt;
&lt;br /&gt;
Each society that is formed tends to be in one level or the other and there exists tendencies of interactions between and across these levels. Levels need not only be micro-level or macro-level in nature. There can be intermediate levels in which a society exists say - groups, networks, communities etc.&amp;lt;ref name=&amp;quot;MCSS&amp;quot; /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Each society that is formed tends to be in one level or the other and there exists tendencies of interactions between and across these levels. Levels need not only be micro-level or macro-level in nature. There can be intermediate levels in which a society exists say - groups, networks, communities etc.&lt;br /&gt;
&lt;br /&gt;
形成的每个社会都处于某种层次上，并且这些层次之间有相互作用的倾向。社会中的级别不仅可以分为微观或宏观的层次，还可以存在中间的层次，比如群体、网络、社区等。&lt;br /&gt;
（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） 合并了英文的原句）&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The question however arises as to how to identify these levels and how they come into existence? And once they are in existence how do they interact within themselves and with other levels?&lt;br /&gt;
&lt;br /&gt;
The question however arises as to how to identify these levels and how they come into existence? And once they are in existence how do they interact within themselves and with other levels?&lt;br /&gt;
&lt;br /&gt;
然而问题是，这些层次是如何确定的以及如何产生的？并且，一旦它们产生了，它们如何在自身内部以及与其他层次相互作用？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
If we view entities (agents) as nodes and the connections between them as the edges, we see the formation of networks. The connections in these networks do not come about based on just objective relationships between the entities, rather they are decided upon by factors chosen by the participating entities.&amp;lt;ref&amp;gt;{{cite journal|last1=Egu´ıluz|first1=V. M.|last2=Zimmermann|first2=M. G.|last3=Cela-Conde|first3=C. J.|last4=San Miguel|first4=M.|title=American Journal of Sociology|issue=2005|pages=110, 977}}&amp;lt;/ref&amp;gt; The challenge with this process is that, it is difficult to identify when a set of entities will form a network. These networks may be of trust networks, co-operation networks, dependence networks etc. There have been cases where heterogeneous set of entities have shown to form strong and meaningful networks among themselves.&amp;lt;ref&amp;gt;{{cite journal|last1=Sichman|first1=J. S.|last2=Conte|first2=R.|title=Computational &amp;amp; Mathematical Organization Theory|issue=2002|pages=8(2)}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Ehrhardt|first1=G.|last2=Marsili|first2=M.|last3=Vega-Redondo|first3=F.|title=Physical Review E|issue=2006|pages=74(3)}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
If we view entities (agents) as nodes and the connections between them as the edges, we see the formation of networks. The connections in these networks do not come about based on just objective relationships between the entities, rather they are decided upon by factors chosen by the participating entities. The challenge with this process is that, it is difficult to identify when a set of entities will form a network. These networks may be of trust networks, co-operation networks, dependence networks etc. There have been cases where heterogeneous set of entities have shown to form strong and meaningful networks among themselves.&lt;br /&gt;
&lt;br /&gt;
如果我们把'''实体 Entities'''（'''主体 Agents'''）看作节点，把它们之间的连接看作边，我们就看到了网络的形成。这些网络中的连接并非只是基于实体之间的客观关系，而是由实体选择的因素决定的。这个过程的困难之处在于，很难确定一组实体何时形成网络。这些网络可以是信任网络、合作网络、依赖网络等。在一些情况下，异质的实体集在它们之间形成了强大而有意义的网络。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
As discussed previously, societies fall into levels and in one such level, the individual level, a micro-macro link&amp;lt;ref&amp;gt;Billari, Francesco C. [https://books.google.com/books?hl=en&amp;amp;lr=&amp;amp;id=Tc8iL0b-OycC&amp;amp;oi=fnd&amp;amp;pg=PA1&amp;amp;dq=%22Agent-based+computational+modelling:+applications+in+demography,+social,+economic+and+environmental+sciences%22&amp;amp;ots=6MNVK7JP-e&amp;amp;sig=-o_iS9zCK3r-t1eHn3554UVadUs Agent-based computational modelling: applications in demography, social, economic and environmental sciences]. Taylor &amp;amp; Francis, 2006.&amp;lt;/ref&amp;gt; refers to the interactions which create higher-levels. There are a set of questions that needs to be answered regarding these Micro-Macro links. How they are formed? When do they converge? What is the feedback pushed to the lower levels and how are they pushed?&lt;br /&gt;
&lt;br /&gt;
As discussed previously, societies fall into levels and in one such level, the individual level, a micro-macro link refers to the interactions which create higher-levels. There are a set of questions that needs to be answered regarding these Micro-Macro links. How they are formed? When do they converge? What is the feedback pushed to the lower levels and how are they pushed?&lt;br /&gt;
&lt;br /&gt;
正如前面所讨论的，社会分为不同层次。在其中的一个层次：个体层次中，'''微观-宏观联系 Micro-macro Link'''指的是创造更高层次的相互作用。关于微观-宏观链接有一系列问题等待回答。它们是如何形成的？它们什么时候汇聚？什么反馈被推到了较低的层次，以及它们是如何被推到较低层次的？ &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Another major challenge in this category concerns the validity of information and their sources. In recent years there has been a boom in information gathering and processing. However, little attention was paid to the spread of false information between the societies. Tracing back the sources and finding ownership of such information is difficult.&lt;br /&gt;
&lt;br /&gt;
Another major challenge in this category concerns the validity of information and their sources. In recent years there has been a boom in information gathering and processing. However, little attention was paid to the spread of false information between the societies. Tracing back the sources and finding ownership of such information is difficult.&lt;br /&gt;
&lt;br /&gt;
这一分类的另一个主要挑战涉及信息的有效性及其来源。近年来，信息收集和处理有着蓬勃的发展。但人们很少注意到社会之间虚假信息的传播。追溯资料来源并找到这些资料的所有者是很困难的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Culture modeling 文化建模===&lt;br /&gt;
&lt;br /&gt;
The evolution of the networks and levels in the society brings about cultural diversity.&amp;lt;ref&amp;gt;{{cite journal|last1=Centola|first1=D.|last2=Gonz´alez-Avella|first2=J. C.|last3=Egu´ıluz|first3=V. M.|last4=San Miguel|first4=M.|title=Journal of Conflict Resolution|issue=2007|pages=51}}&amp;lt;/ref&amp;gt; A thought which arises however is that, when people tend to interact and become more accepting of other cultures and beliefs, how is it that diversity still persists? Why is there no convergence? A major challenge is how to model these diversities. Are there external factors like mass media, locality of societies etc. which influence the evolution or persistence of cultural diversities?{{Citation needed|reason=Sounds just like personal thoughts|date=May 2017}}&lt;br /&gt;
&lt;br /&gt;
The evolution of the networks and levels in the society brings about cultural diversity. A thought which arises however is that, when people tend to interact and become more accepting of other cultures and beliefs, how is it that diversity still persists? Why is there no convergence? A major challenge is how to model these diversities. Are there external factors like mass media, locality of societies etc. which influence the evolution or persistence of cultural diversities?&lt;br /&gt;
&lt;br /&gt;
社会网络和层次的演变带来了文化的多样性。然而人们会想，当人们倾向于相互作用，变得更能接受其他文化和信仰时，为什么多样性仍然存在？为什么人们没有趋同？一个主要的挑战是如何为这些多样性建立模型。是否存在大众传媒、社会地域性等外部因素，这些因素影响文化多样性的演化或保持？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Experimentation and evaluation 实验和评估===&lt;br /&gt;
&lt;br /&gt;
Any study or modelling when combined with experimentation needs to be able to address the questions being asked. [[Computational social science]] deals with large scale data and the challenge becomes much more evident as the scale grows. How would one design informative simulations on a large scale? And even if a large scale simulation is brought up, how is the evaluation supposed to be performed?&lt;br /&gt;
&lt;br /&gt;
Any study or modelling when combined with experimentation needs to be able to address the questions being asked. Computational social science deals with large scale data and the challenge becomes much more evident as the scale grows. How would one design informative simulations on a large scale? And even if a large scale simulation is brought up, how is the evaluation supposed to be performed?&lt;br /&gt;
&lt;br /&gt;
任何与实验结合的研究或建模都需要能够解决所提出的问题。计算社会科学处理大规模数据，并且数据规模越大建模的挑战就越明显。如何在一个大规模的数据集里设计信息仿真模型？并且，即使提出了一个大规模的仿真模型，应该如何对它进行评估？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Model choice and model complexities 模型选择和模型复杂性===&lt;br /&gt;
&lt;br /&gt;
Another challenge is identifying the models that would best fit the data and the complexities of these models. These models would help us predict how societies might evolve over time and provide possible explanations on how things work.&amp;lt;ref&amp;gt;Weisberg, Michael. [http://www.academia.edu/download/30604870/lessmorefinal.pdf When less is more: Tradeoffs and idealization in model building]. Diss. Stanford University, 2003.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Another challenge is identifying the models that would best fit the data and the complexities of these models. These models would help us predict how societies might evolve over time and provide possible explanations on how things work.&lt;br /&gt;
&lt;br /&gt;
另一个挑战是确定最适合数据的模型，以及最合适的'''模型复杂性 Model Complexities'''。这些模型将帮助我们预测随着时间的推移社会将如何演变，并为事物如何运动和变化提供可能的解释。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====Generative models 生成模型====&lt;br /&gt;
&lt;br /&gt;
Generative models helps us to perform extensive qualitative analysis in a controlled fashion. A model proposed by Epstein, is the agent-based simulation, which talks about identifying an initial set of heterogeneous entities (agents) and observe their evolution and growth based on simple local rules.&amp;lt;ref&amp;gt;Epstein, Joshua M. [https://www.researchgate.net/profile/Eric_Jones14/publication/283615593_Book_Review_-_Generative_Social_Science_Studies_in_Agent-Based_Computational_Modeling/links/5641398808aebaaea1f70216.pdf Generative social science: Studies in agent-based computational modeling]. Princeton University Press, 2006.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Generative models helps us to perform extensive qualitative analysis in a controlled fashion. A model proposed by Epstein, is the agent-based simulation, which talks about identifying an initial set of heterogeneous entities (agents) and observe their evolution and growth based on simple local rules.&lt;br /&gt;
&lt;br /&gt;
'''生成模型 Generative Models'''帮助我们以一种受控的方式进行广泛的定性分析。爱泼斯坦（Epstein）提出的一个基于主体的模型，就是探讨如何识别异质实体(主体)的'''初始集 Initial Set'''，并根据简单的局部规则观察它们的演化和增长。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
But what are these local rules? How does one identify them for a set of heterogeneous agents? Evaluation and impact of these rules state a whole new set of difficulties.&lt;br /&gt;
&lt;br /&gt;
But what are these local rules? How does one identify them for a set of heterogeneous agents? Evaluation and impact of these rules state a whole new set of difficulties.&lt;br /&gt;
&lt;br /&gt;
但是这些局部规则是什么呢？如何识别一组异质实体？这些规则的评估和影响都是新出现的困难之处。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====Heterogeneous or ensemble models 异质模型和组合模型====&lt;br /&gt;
&lt;br /&gt;
Integrating simple models which perform better on individual tasks to form a Hybrid model is an approach that can be looked into{{Citation needed|reason=unsupported claims|date=May 2017}}. These models can offer better performance and understanding of the data. However the trade-off of identifying and having a deep understanding of the interactions between these simple models arises when one needs to come up with one combined, well performing model. Also, coming up with tools and applications to help analyse and visualize the data based on these hybrid models is another added challenge.&lt;br /&gt;
&lt;br /&gt;
Integrating simple models which perform better on individual tasks to form a Hybrid model is an approach that can be looked into. These models can offer better performance and understanding of the data. However the trade-off of identifying and having a deep understanding of the interactions between these simple models arises when one needs to come up with one combined, well performing model. Also, coming up with tools and applications to help analyse and visualize the data based on these hybrid models is another added challenge.&lt;br /&gt;
&lt;br /&gt;
集成在单个任务中表现良好的简单模型并形成'''混合模型 Hybrid model'''是一种可以继续考虑的方法。这些模型有更好的性能并可以对数据提供更好的理解。然而，当需要提出一个整合的、性能良好的模型时，识别简单模型和深入理解模型之间相互作用的权衡问题就出现了。此外，另一个挑战是开发工具和应用程序来帮助分析和可视化基于这些混合模型的数据。&lt;br /&gt;
&lt;br /&gt;
==Impact 影响==&lt;br /&gt;
&lt;br /&gt;
Computational sociology can bring impacts to science, technology and society.&amp;lt;ref name=&amp;quot;MCSS&amp;quot; /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Computational sociology can bring impacts to science, technology and society.&lt;br /&gt;
&lt;br /&gt;
计算社会学可以给科学、技术和社会带来影响。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Impact on science 对科学的影响===&lt;br /&gt;
&lt;br /&gt;
In order for the study of computational sociology to be effective, there has to be valuable innovations. These innovation can be of the form of new data analytics tools, better models and algorithms. The advent of such innovation will be a boon for the scientific community in large. {{Citation needed|reason=citation for claim on innovation and the type of innovation|date=May 2017}}&lt;br /&gt;
&lt;br /&gt;
In order for the study of computational sociology to be effective, there has to be valuable innovations. These innovation can be of the form of new data analytics tools, better models and algorithms. The advent of such innovation will be a boon for the scientific community in large. &lt;br /&gt;
&lt;br /&gt;
为了使计算社会学的研究有效，必须有一些有价值的创新。这些创新可以是新形式的数据分析工具，或更好的模型和算法。这些创新的出现将为整个科学界带来益处。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Impact on society 对社会的影响===&lt;br /&gt;
&lt;br /&gt;
One of the major challenges of computational sociology is the modelling of social processes {{Citation needed|reason=to support the claim for need of modeling of social processes|date=May 2017}}. Various law and policy makers would be able to see efficient and effective paths to issue new guidelines and the mass in general would be able to evaluate and gain fair understanding of the options presented in front of them enabling an open and well balanced decision process. {{Citation needed|reason=unsupported claims|date=May 2017}}.&lt;br /&gt;
&lt;br /&gt;
One of the major challenges of computational sociology is the modelling of social processes . Various law and policy makers would be able to see efficient and effective paths to issue new guidelines and the mass in general would be able to evaluate and gain fair understanding of the options presented in front of them enabling an open and well balanced decision process. &lt;br /&gt;
&lt;br /&gt;
计算社会学的主要挑战之一是对社会过程的建模。各种法律和政策制定者将能够得到发布新指导方针的快速有效的方法，广大群众将能够评价和更好地理解各种备选方案，从而实现决策进程的公开和平衡。&lt;br /&gt;
&lt;br /&gt;
==Journals and academic publications 期刊和学术出版物==&lt;br /&gt;
&lt;br /&gt;
The most relevant journal of the discipline is the [[Journal of Artificial Societies and Social Simulation]].&lt;br /&gt;
&lt;br /&gt;
The most relevant journal of the discipline is the Journal of Artificial Societies and Social Simulation.&lt;br /&gt;
&lt;br /&gt;
该学科最相关的期刊是《人工社会与社会模拟（the Journal of Artificial Societies and Social Simulation）》。&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20100611121626/http://www.ccsr.uiuc.edu/web/Journals/Journals.html Complexity Research Journal List], from UIUC, IL 复杂研究期刊列表（资料来自伊利诺伊大学香槟分校）&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20100611091342/http://www.ccsr.uiuc.edu/web/Groups/Groups.html Related Research Groups], from UIUC, IL 相关研究组（资料来自伊利诺伊大学香槟分校）&lt;br /&gt;
&lt;br /&gt;
==Associations, conferences and workshops 协会、会议及工作坊==&lt;br /&gt;
&lt;br /&gt;
*[http://www.casos.cs.cmu.edu/naacsos/ North American Association for Computational Social and Organization Sciences]&lt;br /&gt;
&lt;br /&gt;
*[http://www.essa.eu.org/ ESSA: European Social Simulation Association]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Academic programs, departments and degrees 学术课程、院系和学位==&lt;br /&gt;
&lt;br /&gt;
* [http://mediapatterns.enm.bris.ac.uk/ University of Bristol &amp;quot;Mediapatterns&amp;quot; project]&lt;br /&gt;
&lt;br /&gt;
* [http://www.cos.cs.cmu.edu/ Carnegie Mellon University], [http://www.casos.cs.cmu.edu PhD program] in Computation, Organizations and Society (COS)&lt;br /&gt;
&lt;br /&gt;
* [http://www.uchicago.edu University of Chicago]&lt;br /&gt;
&lt;br /&gt;
** [https://macss.uchicago.edu/ Certificate, MA and PhD in Computational Social Sciences]&lt;br /&gt;
&lt;br /&gt;
* [http://www.gmu.edu George Mason University]&lt;br /&gt;
&lt;br /&gt;
** PhD program in [http://css.gmu.edu CSS (Computational Social Sciences)]&lt;br /&gt;
&lt;br /&gt;
** MA program in [http://mais.gmu.edu/programs/la-mais-css Master's of Interdisciplinary Studies, CSS emphasis]&lt;br /&gt;
&lt;br /&gt;
* [http://www.pdx.edu/sysc/program-systems-science-phd-program Portland State], PhD program in Systems Science&lt;br /&gt;
&lt;br /&gt;
* [http://www.pdx.edu/sysc/program-systems-science-masters-program Portland State], MS program in Systems Science&lt;br /&gt;
&lt;br /&gt;
* [http://www.ucd.ie University College Dublin], &lt;br /&gt;
&lt;br /&gt;
** PhD Program in [http://www.ucd.ie/geary/postgraduatetraining/cscs Complex Systems and Computational Social Science]&lt;br /&gt;
&lt;br /&gt;
** MSc in [https://sisweb.ucd.ie/usis/!W_HU_MENU.P_PUBLISH?p_tag=PROG&amp;amp;MAJR=W390 Social Data Analytics] &lt;br /&gt;
&lt;br /&gt;
** BSc in [https://www.myucd.ie/courses/social-sciences/computational-social-science Computational Social Science] &lt;br /&gt;
&lt;br /&gt;
* [https://archive.is/20121215023745/http://hcs.ucla.edu/courses.htm UCLA], Minor in Human Complex Systems&lt;br /&gt;
&lt;br /&gt;
* [http://www.cs.ucla.edu/~cyber/ UCLA], Major in Computational &amp;amp; Systems Biology (including behavioral sciences)&lt;br /&gt;
&lt;br /&gt;
* [http://cscs.umich.edu/education/undergrad/undergrad.html Univ. of Michigan], Minor in Complex Systems&lt;br /&gt;
&lt;br /&gt;
* [http://www.pdx.edu/sysc/resources-other-systems-science-programs Systems Sciences Programs List], Portland State.  List of other worldwide related programs.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Centers and institutes 中心和机构==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===North America 北美===&lt;br /&gt;
&lt;br /&gt;
* [http://cnets.indiana.edu/ Center for Complex Networks and Systems Research], Indiana University, Bloomington, IN, USA.&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20110430200327/http://www.ccsr.uiuc.edu/ Center for Complex Systems Research], University of Illinois at Urbana-Champaign, IL, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://socialcomplexity.gmu.edu/ Center for Social Complexity], George Mason University, Fairfax, VA, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.asu.edu/clas/csdc/ Center for Social Dynamics and Complexity], Arizona State University, Tempe, AZ, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.cscs.umich.edu/ Center of the Study of Complex Systems], University of Michigan, Ann Arbor, MI, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://hcs.ucla.edu/ Human Complex Systems], University of California Los Angeles, Los Angeles, CA, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.iq.harvard.edu/ Institute for Quantitative Social Science], Harvard University, Boston, MA, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.nico.northwestern.edu/ Northwestern Institute on Complex Systems (NICO)], Northwestern University, Evanston, IL USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.santafe.edu/ Santa Fe Institute], Santa Fe, NM, USA.&lt;br /&gt;
&lt;br /&gt;
* Duke Network Analysis Center, [[Duke University]], Durham, NC, USA&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===South America 南美===&lt;br /&gt;
&lt;br /&gt;
* [http://www5.each.usp.br/mestrado-academico-em-modelagem-de-sistemas-complexos/ Modelagem de Sistemas Complexos], University of São Paulo - EACH, São Paulo, SP, Brazil&lt;br /&gt;
&lt;br /&gt;
* [http://inct.cnpq.br/web/inct-sc Instituto Nacional de Ciência e Tecnologia de Sistemas Complexos], Centro Brasileiro de Pesquisas Físicas, Rio de Janeiro, RJ, Brazil&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Europe 欧洲===&lt;br /&gt;
&lt;br /&gt;
* [http://cfpm.org Centre for Policy Modelling], Manchester, UK.&lt;br /&gt;
&lt;br /&gt;
* [http://cress.soc.surrey.ac.uk/ Centre for Research in Social Simulation], University of Surrey, UK.&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20130425014018/http://dl.ucd.ie/ UCD Dynamics Lab- Centre for Computational Social Science], Geary Institute for Public Policy, University College Dublin, Ireland.&lt;br /&gt;
&lt;br /&gt;
* [http://www.rug.nl/research/gcscs/ Groningen Center for Social Complexity Studies (GCSCS)], Groningen, NL.&lt;br /&gt;
&lt;br /&gt;
* [http://www.soms.ethz.ch/ Chair of Sociology, in particular of Modeling and Simulation (SOMS)], Zürich, Switzerland.&lt;br /&gt;
&lt;br /&gt;
* [http://www.eco.unibs.it/gecs/ Research Group on Experimental and Computational Sociology (GECS)], Brescia, IT.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Asia 亚洲===&lt;br /&gt;
&lt;br /&gt;
* [http://bandungfe.net Bandung Fe Institute, Centre for Complexity in Surya University], Bandung, Indonesia.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== See also 参见==&lt;br /&gt;
&lt;br /&gt;
* [[Artificial society]] 人工社会&lt;br /&gt;
&lt;br /&gt;
* [[Simulated reality]] 虚拟现实&lt;br /&gt;
&lt;br /&gt;
* [[Social simulation]] 社会仿真&lt;br /&gt;
&lt;br /&gt;
* [[Agent-based social simulation]] 基于主体的社会仿真&lt;br /&gt;
&lt;br /&gt;
* [[Social complexity]] 社会复杂性&lt;br /&gt;
&lt;br /&gt;
* [[Computational economics]] 计算经济学&lt;br /&gt;
&lt;br /&gt;
* [[Computational epidemiology]] 计算流行病学&lt;br /&gt;
&lt;br /&gt;
* [[Cliodynamics]] 历史动力学&lt;br /&gt;
&lt;br /&gt;
* [[Predictive analytics]] 预测分析&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&lt;br /&gt;
{{reflist|35em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==External links 外部链接==&lt;br /&gt;
&lt;br /&gt;
*[http://cress.soc.surrey.ac.uk/s4ss/ On-line book &amp;quot;Simulation for the Social Scientist&amp;quot; by Nigel Gilbert and Klaus G. Troitzsch, 1999, second edition 2005 社会科学家的仿真建模 电子书 作者：Nigel Gilbert and Klaus G. Troitzsch 第二版（2005年版）]&lt;br /&gt;
&lt;br /&gt;
*[http://jasss.soc.surrey.ac.uk/JASSS.html Journal of Artificial Societies and Social Simulation 人工社会和社会建模仿真期刊]&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20110516072744/http://cmol.nbi.dk/models/ Agent based models for social networks, interactive java applets 基于主体的社会网络模型，交互式 java 小程序]&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20090827052722/http://www.personal.kent.edu/~bcastel3/ Sociology and Complexity Science Website 社会学与复杂性科学网站]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:Subfields of sociology]]&lt;br /&gt;
&lt;br /&gt;
Category:Subfields of sociology&lt;br /&gt;
&lt;br /&gt;
范畴: 社会学的子领域&lt;br /&gt;
&lt;br /&gt;
[[Category:Complex systems theory]]&lt;br /&gt;
&lt;br /&gt;
Category:Complex systems theory&lt;br /&gt;
&lt;br /&gt;
范畴: 复杂系统理论&lt;br /&gt;
&lt;br /&gt;
[[Category:Methods in sociology]]&lt;br /&gt;
&lt;br /&gt;
Category:Methods in sociology&lt;br /&gt;
&lt;br /&gt;
范畴: 社会学方法&lt;br /&gt;
&lt;br /&gt;
[[Category:Computational fields of study]]&lt;br /&gt;
&lt;br /&gt;
Category:Computational fields of study&lt;br /&gt;
&lt;br /&gt;
类别: 研究的计算领域&lt;br /&gt;
&lt;br /&gt;
&amp;lt;noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;small&amp;gt;This page was moved from [[wikipedia:en:Computational sociology]]. Its edit history can be viewed at [[社会计算/edithistory]]&amp;lt;/small&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:待整理页面]]&lt;br /&gt;
&lt;br /&gt;
== 编者推荐 ==&lt;br /&gt;
=== 书籍推荐 ===&lt;br /&gt;
====[https://e.jd.com/30159646.html 社会计算的基本方法与应用]====&lt;br /&gt;
这是中科院自动化所的王飞跃老师关于社会计算的专著，从利用计算技术解决社会问题的角度介绍社会计算。阅读难度可能较高。&lt;br /&gt;
&lt;br /&gt;
=== 集智推荐 ===&lt;br /&gt;
====[https://campus.swarma.org/course/1028 2019 International Conference of Social Computing]====&lt;br /&gt;
本课程是2019年8月26日、27日的2019 International Conference of Social Computing记录。教师团队由芝加哥大学社会学系James Evans教授，Science University of Gottingen傅晓明教授，清华大学罗家德教授，电子科技大学周涛教授等多位老师组成。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://campus.swarma.org/course/1016 复杂系统与社会计算研讨会]====&lt;br /&gt;
本课程是，2019年10月27日北京计算科学研究中心主办的复杂系统与社会计算研讨会活动记录。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://pattern.swarma.org/path?id=12 计算社会科学入门路径]====&lt;br /&gt;
计算社会科学诞生至今，已有将近10年。在自然科学领域已经广泛应用大数据、分布式计算等方式提高研究质量的今天，社会科学领域涉及到的核心数据仍然被少数机构所拥有并创造着巨大的价值。本文将从计算社会科学的发展历史，常用方法，以及前沿问题来给大家粗略地展示计算社会科学的脉络。&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E7%A4%BE%E4%BC%9A%E8%AE%A1%E7%AE%97&amp;diff=11140</id>
		<title>社会计算</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E7%A4%BE%E4%BC%9A%E8%AE%A1%E7%AE%97&amp;diff=11140"/>
		<updated>2020-07-26T01:03:33Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;#重定向 [[社会计算]]&lt;br /&gt;
此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。&lt;br /&gt;
{{sociology}}&amp;lt;onlyinclude&amp;gt;&amp;lt;!-- &lt;br /&gt;
&lt;br /&gt;
&amp;lt;onlyinclude&amp;gt;&amp;lt;!-- &lt;br /&gt;
&lt;br /&gt;
只包括! -- &lt;br /&gt;
&lt;br /&gt;
While editing this lead/intro, please keep your text BELOW this line - this will make it easier to automatically insert the lede into other articles --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
  While editing this lead/intro, please keep your text BELOW this line - this will make it easier to automatically insert the lede into other articles --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
当编辑这个导语 / 介绍，请保持你的文本下面这行-这将使它更容易自动插入到其他文章的莱德-&lt;br /&gt;
&lt;br /&gt;
'''Computational sociology''' is a branch of [[sociology]] that uses computationally intensive methods to analyze and model social phenomena. Using [[computer simulation]]s, [[artificial intelligence]], complex statistical methods, and analytic approaches like [[social network analysis]], computational sociology develops and tests theories of complex social processes through bottom-up modeling of social interactions.&amp;lt;ref name=&amp;quot;MW&amp;quot;&amp;gt;{{cite journal|doi=10.1146/annurev.soc.28.110601.141117|title=From Factors to Actors: Computational Sociology and Agent-Based Modeling |first1=Michael W. |last1=Macy |first2=Robert |last2=Willer |journal=Annual Review of Sociology |volume=28 |pages=143–166 |jstor=3069238|year=2002}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Computational sociology is a branch of sociology that uses computationally intensive methods to analyze and model social phenomena. Using computer simulations, artificial intelligence, complex statistical methods, and analytic approaches like social network analysis, computational sociology develops and tests theories of complex social processes through bottom-up modeling of social interactions.&lt;br /&gt;
&lt;br /&gt;
'''计算社会学 Computational Sociology''' 是社会学的一个分支，它使用计算密集型方法来分析和模拟社会现象。&amp;lt;font color='red'&amp;gt;计算社会学通过使用计算机模拟、人工智能、复杂统计方法以及社会网络分析等分析方法自下而上地建立社会互动模型，是建立并检验复杂社会过程的理论。&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;  借助计算机模拟、人工智能、复杂统计方法以及社会网络分析等分析方法，计算社会学通过自下而上地建立社会互动模型来发展和检验关于复杂社会过程的理论。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
It involves the understanding of social agents, the interaction among these agents, and the effect of these interactions on the social aggregate.&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;&amp;gt;{{cite book|last1=Gilbert |first1=Nigel |last2=Troitzsch |first2=Klaus |year=2005 |title=Simulation for Social Scientists |edition=2 |chapter=Simulation and social science |publisher=Open University Press |chapter-url=http://cress.soc.surrey.ac.uk/s4ss/}}&amp;lt;/ref&amp;gt; Although the subject matter and methodologies in [[social science]] differ from those in [[natural science]] or [[computer science]], several of the approaches used in contemporary [[social simulation]] originated from fields such as [[physics]] and [[artificial intelligence]].&amp;lt;ref name=&amp;quot;Artificial Societies&amp;quot;&amp;gt;{{cite book|last1=Epstein |first1=Joshua M. |last2=Axtell |first2=Robert |year=1996 |title=Growing Artificial Societies: Social Science from the Bottom Up |location=Washington DC |publisher=Brookings Institution Press|url=https://archive.org/details/growingartificia00epst|url-access=registration |isbn=978-0262050531 }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;Cooperation&amp;quot;&amp;gt;{{cite book|last1=Axelrod |first1=Robert |year=1997 |title=The Complexity of Cooperation: Agent-Based Models of Competition and Collaboration |location=Princeton, NJ |publisher=Princeton University Press}}&amp;lt;/ref&amp;gt; Some of the approaches that originated in this field have been imported into the natural sciences, such as measures of [[centrality|network centrality]] from the fields of [[social network analysis]] and [[network science]].&lt;br /&gt;
&lt;br /&gt;
It involves the understanding of social agents, the interaction among these agents, and the effect of these interactions on the social aggregate. Although the subject matter and methodologies in social science differ from those in natural science or computer science, several of the approaches used in contemporary social simulation originated from fields such as physics and artificial intelligence. Some of the approaches that originated in this field have been imported into the natural sciences, such as measures of network centrality from the fields of social network analysis and network science.&lt;br /&gt;
&lt;br /&gt;
它涉及理解社会行为主体和它们的相互作用，以及这些相互作用如何影响社会总体(--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） social aggregate--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|讨论]]） 我觉得这样翻译是ok的)。虽然社会科学的主题和方法不同于自然科学或计算机科学，但当代社会仿真模拟中使用的一些方法起源于物理学和人工智能等领域。这一领域的一些方法，如来自社会网络分析和网络科学领域的网络中心性度量方法等，早已被引入到自然科学中。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In relevant literature, computational sociology is often related to the study of [[social complexity]].&amp;lt;ref&amp;gt;{{cite journal|last=Casti |first=J |year=1999 |title=The Computer as Laboratory: Toward a Theory of Complex Adaptive Systems |journal=Complexity |volume=4 |issue=5 |pages=12–14 |doi=10.1002/(SICI)1099-0526(199905/06)4:5&amp;lt;12::AID-CPLX3&amp;gt;3.0.CO;2-4}}&amp;lt;/ref&amp;gt; Social complexity concepts such as [[complex systems]], [[non-linear]] interconnection among macro and micro process, and [[emergence]], have entered the vocabulary of computational sociology.&amp;lt;ref&amp;gt;{{cite journal|last=Goldspink |first=C |year=2002 |title=Methodological Implications of Complex Systems Approaches to Sociality: Simulation as a Foundation for Knowledge |url=http://jasss.soc.surrey.ac.uk/5/1/3.html |publisher=Journal of Artificial Societies and Social Simulation |volume=5 |issue=1}}&amp;lt;/ref&amp;gt; A practical and well-known example is the construction of a computational model in the form of an &amp;quot;[[artificial society]]&amp;quot;, by which researchers can analyze the structure of a [[Social structure|social system]].&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;Generative&amp;quot;&amp;gt;{{cite book|last=Epstein |first=Joshua |year=2007 |title=Generative Social Science: Studies in Agent-Based Computational Modeling |location=Princeton, NJ |publisher=Princeton University Press|url=https://www.researchgate.net/publication/283615593}}&lt;br /&gt;
&lt;br /&gt;
In relevant literature, computational sociology is often related to the study of social complexity. Social complexity concepts such as complex systems, non-linear interconnection among macro and micro process, and emergence, have entered the vocabulary of computational sociology. A practical and well-known example is the construction of a computational model in the form of an &amp;quot;artificial society&amp;quot;, by which researchers can analyze the structure of a social system.&lt;br /&gt;
&lt;br /&gt;
在相关文献中，计算社会学经常与社会复杂性的研究有关。复杂系统、宏观和微观过程之间的非线性关联、涌现等社会复杂性概念已经进入计算社会学的词汇。一个实际而著名的例子是建立“'''人工社会 Artificial Society'''”的计算模型，通过它研究人员可以分析一个社会系统的结构。 &lt;br /&gt;
&lt;br /&gt;
While editing this lead/intro, please keep your text ABOVE this line - this will make it easier to automatically insert the lede into other articles - thanks!  &lt;br /&gt;
&lt;br /&gt;
While editing this lead/intro, please keep your text ABOVE this line - this will make it easier to automatically insert the lede into other articles - thanks!  &lt;br /&gt;
&lt;br /&gt;
当编辑这个引导 / 介绍，请保持你的文本以上这一行-这将使它更容易自动插入到其他文章的莱德-谢谢！&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;&amp;lt;/onlyinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;&amp;lt;/onlyinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
-- / 只包括&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==History 历史==&lt;br /&gt;
&lt;br /&gt;
{{see also|Sociology and complexity science}}&lt;br /&gt;
&lt;br /&gt;
[[File:Complexity-map-with-sociolo.png|thumb|right|300px|Historical map of research paradigms and associated scientists in [[sociology and complexity science]].]]&lt;br /&gt;
&lt;br /&gt;
Historical map of research paradigms and associated scientists in [[sociology and complexity science.]]&lt;br /&gt;
&lt;br /&gt;
【图1：Historical map of research paradigms and associated scientists in [[sociology and complexity science＋社会学和复杂性中的研究范式和科学家的历史地图】&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Background 背景===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In the past four decades, computational sociology has been introduced and gaining popularity {{According to whom|date=June 2017}}.  This has been used primarily for modeling or building explanations of social processes and are depending on the emergence of complex behavior from simple activities.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;&amp;gt;Salgado, Mauricio, and Nigel Gilbert. &amp;quot;[http://epubs.surrey.ac.uk/749319/1/Emergence%20and%20Communication%20-%20V3%201.pdf Emergence and communication in computational sociology].&amp;quot; Journal for the Theory of Social Behaviour 43.1 (2013): 87-110.&amp;lt;/ref&amp;gt;  The idea behind emergence is that properties of any bigger system do not always have to be properties of the components that the system is made of.&amp;lt;ref&amp;gt;Macy, Michael W., and Robert Willer. &amp;quot;[http://sct.uab.cat/lsds/sites/sct.uab.cat.lsds/files/FROM%20FACTORS%20TO%20ACTORS%20(Macy%20and%20Willer%202002).pdf From factors to actors: computational sociology and agent-based modeling].&amp;quot; Annual review of sociology 28.1 (2002): 143-166.&amp;lt;/ref&amp;gt;  The people responsible for the introduction of the idea of emergence are Alexander, Morgan, and Broad, who were classical emergentists.  The time at which these emergentists came up with this concept and method was during the time of the early twentieth century.  The aim of this method was to find a good enough accommodation between two different and extreme ontologies, which were reductionist materialism and dualism.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;/&amp;gt; &lt;br /&gt;
&lt;br /&gt;
In the past four decades, computational sociology has been introduced and gaining popularity.  This has been used primarily for modeling or building explanations of social processes and are depending on the emergence of complex behavior from simple activities.  The idea behind emergence is that properties of any bigger system do not always have to be properties of the components that the system is made of.  The people responsible for the introduction of the idea of emergence are Alexander, Morgan, and Broad, who were classical emergentists.  The time at which these emergentists came up with this concept and method was during the time of the early twentieth century.  The aim of this method was to find a good enough accommodation between two different and extreme ontologies, which were reductionist materialism and dualism. &lt;br /&gt;
&lt;br /&gt;
在过去的四十年里，计算社会学诞生并且越来越受欢迎。这主要用于建模或构建社会过程的解释，并且依赖于从简单活动中'''涌现 Emergence'''的复杂行为。涌现背后的思想是，任何较大系统不总是必须和组成系统的部分具有一样的性质。引入涌现思想的人是亚历山大 Alexander、摩根 Morgan和布罗德 Broad，他们都是'''经典涌现主义者 Classical Emergentists'''。经典涌现主义者提出这个概念和方法的时间是在二十世纪初期。这种方法的目的是在还原论的唯物主义和二元论这两种不同的本体论之间找到一个足够好的调和。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
While emergence has had a valuable and important role with the foundation of Computational Sociology, there are those who do not necessarily agree.  One major leader in the field, Epstein, doubted the use because there were aspects that are unexplainable.  Epstein put up a claim against emergentism, in which he says it &amp;quot;is precisely the generative sufficiency of the parts that constitutes the whole's explanation&amp;quot;.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
While emergence has had a valuable and important role with the foundation of Computational Sociology, there are those who do not necessarily agree.  One major leader in the field, Epstein, doubted the use because there were aspects that are unexplainable.  Epstein put up a claim against emergentism, in which he says it &amp;quot;is precisely the generative sufficiency of the parts that constitutes the whole's explanation&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
虽然涌现在计算社会学的建立上发挥了宝贵而重要的作用，但也有人不太同意。该领域的一个主要人物爱泼斯坦 Epstein对这种&amp;lt;font color='red'&amp;gt;用法&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;概念&amp;lt;/font&amp;gt;持怀疑态度，因为有些方面是这个&amp;lt;font color='red'&amp;gt;用法&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;概念&amp;lt;/font&amp;gt;无法解释的。爱泼斯坦提出了一种反对“涌现主义”的观点，他表示:“&amp;lt;font color=='red'&amp;gt;正是这些部分的有生成意义的充分性构成了对整体的解释&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;  正是这些部分所产生的充分性构成了对整体的解释&amp;lt;/font&amp;gt;”。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Agent-based models have had a historical influence on Computational Sociology.   These models first came around in the 1960s, and were used to simulate control and feedback processes in organizations, cities, etc.  During the 1970s, the application introduced the use of individuals as the main units for the analyses and used bottom-up strategies for modeling behaviors.  The last wave occurred in the 1980s.  At this time, the models were still bottom-up; the only difference is that the agents interact interdependently.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Agent-based models have had a historical influence on Computational Sociology. These models first came around in the 1960s, and were used to simulate control and feedback processes in organizations, cities, etc.  During the 1970s, the application introduced the use of individuals as the main units for the analyses and used bottom-up strategies for modeling behaviors.  The last wave occurred in the 1980s.  At this time, the models were still bottom-up; the only difference is that the agents interact interdependently.&lt;br /&gt;
&lt;br /&gt;
'''基于主体的模型 Agent-based Models'''对计算社会学有着历史性的影响。这些模型最早出现在20世纪60年代，用于仿真模拟组织、城市等系统的控制和反馈过程。在20世纪70年代，&amp;lt;font color='red'&amp;gt;应用程序&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; ABM模型&amp;lt;/font&amp;gt;引入个体作为主要的分析单元，并使用自下而上的策略来对行为建模。最后一波浪潮发生在20世纪80年代。那时，模型仍然是自下而上的; 唯一的区别是主体之间具有互相依赖和相互作用。&lt;br /&gt;
&lt;br /&gt;
===Systems theory and structural functionalism 系统理论和结构功能主义===&lt;br /&gt;
&lt;br /&gt;
{{main|Systems theory|Structural functionalism}}&lt;br /&gt;
&lt;br /&gt;
In the post-war era, [[Vannevar Bush]]'s [[differential analyser]], [[John von Neumann]]'s [[Von Neumann cellular automata|cellular automata]], [[Norbert Wiener]]'s [[cybernetics]], and [[Claude Shannon]]'s [[information theory]] became influential paradigms for modeling and understanding complexity in technical systems. In response, scientists in disciplines such as physics, biology, electronics, and economics began to articulate a [[systems theory|general theory of systems]] in which all natural and physical phenomena are manifestations of interrelated elements in a system that has common patterns and properties. Following [[Émile Durkheim]]'s call to analyze complex modern society ''[[sui generis]]'',&amp;lt;ref&amp;gt;{{cite book|first=Émile |last=Durkheim |title=The Division of Labor in Society |location=New York, NY |publisher=Macmillan}}&amp;lt;/ref&amp;gt; post-war structural functionalist sociologists such as [[Talcott Parsons]] seized upon these theories of systematic and hierarchical interaction among constituent components to attempt to generate grand unified sociological theories, such as the [[AGIL paradigm]].&amp;lt;ref name=&amp;quot;Bailey&amp;quot;&amp;gt;{{cite book|first1=Kenneth D. |last1=Bailey |editor=Jonathan H. Turner |chapter=Systems Theory |title=Handbook of Sociological Theory |publisher=Springer Science |year=2006 |location=New York, NY |isbn=978-0-387-32458-6 |pages=379–404}}&amp;lt;/ref&amp;gt; Sociologists such as [[George Homans]] argued that sociological theories should be formalized into hierarchical structures of propositions and precise terminology from which other propositions and hypotheses could be derived and operationalized into empirical studies.&amp;lt;ref name=&amp;quot;Blackwell&amp;quot;&amp;gt;{{cite encyclopedia|year=2007 |title=Computational Sociology |last=Bainbridge |first=William Sims |encyclopedia=Blackwell Encyclopedia of Sociology |publisher=Blackwell Reference Online |url=http://www.sociologyencyclopedia.com/subscriber/tocnode?id=g9781405124331_chunk_g97814051243319_ss1-85 |doi=10.1111/b.9781405124331.2007.x |hdl=10138/224218 |editor=Ritzer, George|isbn=978-1-4051-2433-1|hdl-access=free }}&amp;lt;/ref&amp;gt; Because computer algorithms and programs had been used as early as 1956 to test and validate mathematical theorems, such as the [[four color theorem]],&amp;lt;ref&amp;gt;{{cite book|last=Crevier |first=D. |year=1993 |title=AI: The Tumultuous History of the Search for Artificial Intelligence |url=https://archive.org/details/aitumultuoushist00crev |url-access=registration |publisher=Basic Books |location=New York, NY}}&amp;lt;/ref&amp;gt; some scholars anticipated that similar computational approaches could &amp;quot;solve&amp;quot; and &amp;quot;prove&amp;quot; analogously formalized problems and theorems of social structures and dynamics.&lt;br /&gt;
&lt;br /&gt;
In the post-war era, Vannevar Bush's differential analyser, John von Neumann's cellular automata, Norbert Wiener's cybernetics, and Claude Shannon's information theory became influential paradigms for modeling and understanding complexity in technical systems. In response, scientists in disciplines such as physics, biology, electronics, and economics began to articulate a general theory of systems in which all natural and physical phenomena are manifestations of interrelated elements in a system that has common patterns and properties. Following Émile Durkheim's call to analyze complex modern society sui generis, post-war structural functionalist sociologists such as Talcott Parsons seized upon these theories of systematic and hierarchical interaction among constituent components to attempt to generate grand unified sociological theories, such as the AGIL paradigm. Sociologists such as George Homans argued that sociological theories should be formalized into hierarchical structures of propositions and precise terminology from which other propositions and hypotheses could be derived and operationalized into empirical studies. Because computer algorithms and programs had been used as early as 1956 to test and validate mathematical theorems, such as the four color theorem, some scholars anticipated that similar computational approaches could &amp;quot;solve&amp;quot; and &amp;quot;prove&amp;quot; analogously formalized problems and theorems of social structures and dynamics.&lt;br /&gt;
&lt;br /&gt;
战后时期，范内瓦·布什（Vannevar Bush）的'''微分分析机 Differential Analyser''' 、冯·诺伊曼（John von Neumann）的'''元胞自动机 Cellular Automata'''、 维纳（Norbert Wiener）的'''控制论 Cybernetics'''和克劳德·香农（Claude Shannon）的'''信息论 Information Theory'''成为技术系统中建模和理解复杂性的重要范式。物理学、生物学、电子学和经济学等学科的科学家开始阐述系统的一般理论，即所有自然和物理现象都是具有共同模式和属性的系统中相互关联的元素的表现。&amp;lt;font color='red'&amp;gt;按照 &amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 沿着&amp;lt;/font&amp;gt;涂尔干（Émile Durkheim）分析特定的复杂现代社会&lt;br /&gt;
&lt;br /&gt;
（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]）Following Émile Durkheim's call to analyze complex modern society sui generis）&lt;br /&gt;
  --~~克劳德·香农（Claude Shannon）  这些同样去括号&lt;br /&gt;
&lt;br /&gt;
的&amp;lt;font color='red'&amp;gt;要求&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 思路&amp;lt;/font&amp;gt;，战后结构功能主义社会学家如帕森斯（Talcott Parsons）利用这些组成部分之间系统&amp;lt;font color='blue'&amp;gt;化&amp;lt;/font&amp;gt;和&amp;lt;font color='red'&amp;gt;等级&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 层次化&amp;lt;/font&amp;gt;相互作用的理论，试图产生大统一的社会学理论，如 AGIL 范式。霍曼斯（George Homans）等社会学家认为，社会学理论应该被构建为具有&amp;lt;font color='blue'&amp;gt;逻辑&amp;lt;/font&amp;gt;命题和精确术语的&amp;lt;font color='red'&amp;gt;等级&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 层次化&amp;lt;/font&amp;gt;结构，并且从中可以得出能够在实证研究中被操作化的其他命题和假设。由于早在1956年计算机算法和程序就已经被用来测试和验证数学定理（如'''四色定理Four Color Theorem'''），一些学者预计相似的计算方法可以“解决”和“证明”类似的社会结构和&amp;lt;font color='red'&amp;gt;动态&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 演变&amp;lt;/font&amp;gt;的&amp;lt;font color='blue'&amp;gt;形式化--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|讨论]formalized应该也要翻译出来，computational证明的是形式化定理) &amp;lt;/font&amp;gt;问题和定理。&lt;br /&gt;
&lt;br /&gt;
===Macrosimulation and microsimulation 宏观模拟和微观模拟===&lt;br /&gt;
&lt;br /&gt;
{{main|System dynamics|Microsimulation}}&lt;br /&gt;
&lt;br /&gt;
By the late 1960s and early 1970s, social scientists used increasingly available computing technology to perform macro-simulations of control and feedback processes in organizations, industries, cities, and global populations. These models used differential equations to predict population distributions as holistic functions of other systematic factors such as inventory control, urban traffic, migration, and disease transmission.&amp;lt;ref&amp;gt;{{cite book|first=Jay |last=Forrester |year=1971 |title=World Dynamics |location=Cambridge, MA |publisher=MIT Press}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|doi=10.1287/opre.26.2.237|title=Using Simulation to Develop and Validate Analytic Models: Some Case Studies |first1=Edward J. |last1=Ignall |first2=Peter |last2=Kolesar |first3=Warren E. |last3=Walker |journal=Operations Research |volume=26 |issue=2 |year=1978 |pages=237–253}}&amp;lt;/ref&amp;gt; Although simulations of social systems received substantial attention in the mid-1970s after the [[Club of Rome]] published reports predicting that policies promoting exponential economic growth would eventually bring global environmental catastrophe,&amp;lt;ref&amp;gt;{{cite book|title=The Dynamics of Growth in a Finite World |last1=Meadows |first1=DL |last2=Behrens |first2=WW |last3=Meadows |first3=DH |last4=Naill |first4=RF |last5= Randers |first5=J |last6=Zahn |first6=EK |year=1974 |location=Cambridge, MA |publisher=MIT Press}}&amp;lt;/ref&amp;gt; the inconvenient conclusions led many authors to seek to discredit the models, attempting to make the researchers themselves appear unscientific.&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;/&amp;gt;&amp;lt;ref&amp;gt;{{cite news|title=Computer View of Disaster Is Rebutted |newspaper=The New York Times |date=October 18, 1974|url=https://www.nytimes.com/1974/10/18/archives/computer-view-of-disaster-is-rebutted.html?_r=0}}&amp;lt;/ref&amp;gt; Hoping to avoid the same fate, many social scientists turned their attention toward micro-simulation models to make forecasts and study policy effects by modeling aggregate changes in state of individual-level entities rather than the changes in distribution at the population level.&amp;lt;ref&amp;gt;{{cite journal|doi=10.1016/0167-2681(90)90038-F|title=From engineering to microsimulation : An autobiographical reflection |journal=Journal of Economic Behavior &amp;amp; Organization |year=1990 |volume=14 |issue=1 |pages=5–27 |first=Guy H. |last=Orcutt}}&amp;lt;/ref&amp;gt; However, these micro-simulation models did not permit individuals to interact or adapt and were not intended for basic theoretical research.&amp;lt;ref name=&amp;quot;MW&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
By the late 1960s and early 1970s, social scientists used increasingly available computing technology to perform macro-simulations of control and feedback processes in organizations, industries, cities, and global populations. These models used differential equations to predict population distributions as holistic functions of other systematic factors such as inventory control, urban traffic, migration, and disease transmission. Although simulations of social systems received substantial attention in the mid-1970s after the Club of Rome published reports predicting that policies promoting exponential economic growth would eventually bring global environmental catastrophe, the inconvenient conclusions led many authors to seek to discredit the models, attempting to make the researchers themselves appear unscientific. Hoping to avoid the same fate, many social scientists turned their attention toward micro-simulation models to make forecasts and study policy effects by modeling aggregate changes in state of individual-level entities rather than the changes in distribution at the population level. However, these micro-simulation models did not permit individuals to interact or adapt and were not intended for basic theoretical research.&lt;br /&gt;
&lt;br /&gt;
截至20世纪60年代末70年代初，社会科学家越来越多地使用已有的计算技术，在组织、工业、城市和全球人口中进行控制和反馈过程的'''宏观模拟 Macrosimulation''' 。这些模型使用微分方程作为其他系统因素的整体函数来预测人口分布，这些系统因素包括库存控制、城市交通、人口迁移和疾病传播等。20世纪70年代中期，'''罗马俱乐部 Club of Rome''' 发表报告预测，促进指数式经济增长的政策最终将导致全球环境灾难，这个悲观的结论导致许多研究者试图反驳这些模型，并试图让研究显得不那么科学。&lt;br /&gt;
  （--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） 根据意思，inconvenient译为悲观的，因为这个结论预示了悲观的未来，所以令指出这一点的科学家们感到inconvenient）&lt;br /&gt;
为了避免同样的情况，许多社会科学家将注意力转向'''微观模拟 Microsimulation'''模型。这些模型通过模拟个体状态的总体变化而不是总体人口级别的变化来进行预测和研究政策的效果。然而，这些微观模拟模型并不允许个体相互作用或适应、变化（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]）变化是根据适应（adapt）加上去的，不知道是否合理），研究者也不打算将它们用于基础理论研究。&lt;br /&gt;
&lt;br /&gt;
===Cellular automata and agent-based modeling 元胞自动机和基于主体建模===&lt;br /&gt;
&lt;br /&gt;
{{main|Cellular automata|agent-based modeling}}&lt;br /&gt;
&lt;br /&gt;
The 1970s and 1980s were also a time when physicists and mathematicians were attempting to model and analyze how simple component units, such as atoms, give rise to global properties, such as complex material properties at low temperatures, in magnetic materials, and within turbulent flows.&amp;lt;ref&amp;gt;{{cite book|title=Cellular automata machines: a new environment for modeling |url=https://archive.org/details/cellularautomata00toff |url-access=registration |first1=Tommaso |last1=Toffoli |first2=Norman |last2=Margolus | author2-link = Norman Margolus |year=1987 |publisher=MIT Press |location=Cambridge, MA}}&amp;lt;/ref&amp;gt; Using cellular automata, scientists were able to specify systems consisting of a grid of cells in which each cell only occupied some finite states and changes between states were solely governed by the states of immediate neighbors. Along with advances in [[artificial intelligence]] and [[microcomputer]] power, these methods contributed to the development of &amp;quot;[[chaos theory]]&amp;quot; and &amp;quot;[[complex systems|complexity theory]]&amp;quot; which, in turn, renewed interest in understanding complex physical and social systems across disciplinary boundaries.&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;/&amp;gt; Research organizations explicitly dedicated to the interdisciplinary study of complexity were also founded in this era: the [[Santa Fe Institute]] was established in 1984 by scientists based at [[Los Alamos National Laboratory]] and the BACH group at the [[University of Michigan]] likewise started in the mid-1980s.&lt;br /&gt;
&lt;br /&gt;
The 1970s and 1980s were also a time when physicists and mathematicians were attempting to model and analyze how simple component units, such as atoms, give rise to global properties, such as complex material properties at low temperatures, in magnetic materials, and within turbulent flows. Using cellular automata, scientists were able to specify systems consisting of a grid of cells in which each cell only occupied some finite states and changes between states were solely governed by the states of immediate neighbors. Along with advances in artificial intelligence and microcomputer power, these methods contributed to the development of &amp;quot;chaos theory&amp;quot; and &amp;quot;complexity theory&amp;quot; which, in turn, renewed interest in understanding complex physical and social systems across disciplinary boundaries. Research organizations explicitly dedicated to the interdisciplinary study of complexity were also founded in this era: the Santa Fe Institute was established in 1984 by scientists based at Los Alamos National Laboratory and the BACH group at the University of Michigan likewise started in the mid-1980s.&lt;br /&gt;
&lt;br /&gt;
20世纪70年代和80年代，物理学家和数学家也在试图模拟和分析简单的组成单位如何产生整体特性，比如低温环境中原子在磁性材料和湍流中的复杂材料特性。使用'''元胞自动机 Cellular Automata'''，科学家们能够指定由元胞网格组成的系统，其中每个元胞只占据一些有限的状态，状态之间的变化完全由相邻元胞的状态控制。随着人工智能和微型计算机能力的进步，这些方法促进了“混沌理论”和“复杂性理论”的发展，这反过来又重新引起了人们对跨学科的复杂物理和社会系统的兴趣。明确致力于跨学科复杂性研究的机构也是在这个时代成立的: 圣菲研究所是由美国洛斯阿拉莫斯国家实验室（Los Alamos National Laboratory）的科学家于1984年建立的，密歇根大学的 BACH 小组也是在20世纪80年代中期建立的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This cellular automata paradigm gave rise to a third wave of social simulation emphasizing agent-based modeling. Like micro-simulations, these models emphasized bottom-up designs but adopted four key assumptions that diverged from microsimulation: autonomy, interdependency, simple rules, and adaptive behavior.&amp;lt;ref name=&amp;quot;MW&amp;quot;/&amp;gt; Agent-based models are less concerned with predictive accuracy and instead emphasize theoretical development.&amp;lt;ref&amp;gt;{{cite journal |title=A simulation of the structure of academic science |journal=Sociological Research Online |volume=2 |issue=2 |pages=1–15 |year=1997 |first=Nigel |last=Gilbert |url=http://www.socresonline.org.uk/socresonline/2/2/3.html |doi=10.5153/sro.85 |access-date=2009-12-16 |archive-url=https://web.archive.org/web/19980524062306/http://www.socresonline.org.uk/socresonline/2/2/3.html |archive-date=1998-05-24 |url-status=dead }}&amp;lt;/ref&amp;gt; In 1981, mathematician and political scientist [[Robert Axelrod]] and evolutionary biologist [[W.D. Hamilton]] published a major paper in ''[[Science (journal)|Science]]'' titled &amp;quot;The Evolution of Cooperation&amp;quot; which used an agent-based modeling approach to demonstrate how social cooperation based upon reciprocity can be established and stabilized in a [[prisoner's dilemma]] game when agents followed simple rules of self-interest.&amp;lt;ref&amp;gt;{{cite journal|title=The Evolution of Cooperation |first1=Robert |last1=Axelrod |first2=William D. |last2=Hamilton |journal=Science |volume=211 |issue=4489 |pages=1390–1396 |doi=10.1126/science.7466396|pmid=7466396 |date=March 27, 1981|bibcode=1981Sci...211.1390A }}&amp;lt;/ref&amp;gt; Axelrod and Hamilton demonstrated that individual agents following a simple rule set of (1) cooperate on the first turn and (2) thereafter replicate the partner's previous action were able to develop &amp;quot;norms&amp;quot; of cooperation and sanctioning in the absence of canonical sociological constructs such as demographics, values, religion, and culture as preconditions or mediators of cooperation.&amp;lt;ref name=&amp;quot;Cooperation&amp;quot;/&amp;gt; Throughout the 1990s, scholars like [[William Sims Bainbridge]], [[Kathleen Carley]], [[Michael Macy]],  and [[John Skvoretz]] developed multi-agent-based models of [[generalized reciprocity]], [[prejudice]], [[social influence]], and organizational [[information processing]]. In 1999, [[Nigel Gilbert]] published the first textbook on Social Simulation: ''Simulation for the social scientist'' and established its most relevant journal: the [[Journal of Artificial Societies and Social Simulation]].&lt;br /&gt;
&lt;br /&gt;
This cellular automata paradigm gave rise to a third wave of social simulation emphasizing agent-based modeling. Like micro-simulations, these models emphasized bottom-up designs but adopted four key assumptions that diverged from microsimulation: autonomy, interdependency, simple rules, and adaptive behavior. In 1981, mathematician and political scientist Robert Axelrod and evolutionary biologist W.D. Hamilton published a major paper in Science titled &amp;quot;The Evolution of Cooperation&amp;quot; which used an agent-based modeling approach to demonstrate how social cooperation based upon reciprocity can be established and stabilized in a prisoner's dilemma game when agents followed simple rules of self-interest. Axelrod and Hamilton demonstrated that individual agents following a simple rule set of (1) cooperate on the first turn and (2) thereafter replicate the partner's previous action were able to develop &amp;quot;norms&amp;quot; of cooperation and sanctioning in the absence of canonical sociological constructs such as demographics, values, religion, and culture as preconditions or mediators of cooperation. Throughout the 1990s, scholars like William Sims Bainbridge, Kathleen Carley, Michael Macy,  and John Skvoretz developed multi-agent-based models of generalized reciprocity, prejudice, social influence, and organizational information processing. In 1999, Nigel Gilbert published the first textbook on Social Simulation: Simulation for the social scientist and established its most relevant journal: the Journal of Artificial Societies and Social Simulation.&lt;br /&gt;
&lt;br /&gt;
元胞自动机范式引发了强调'''基于主体建模 Agent-based Modeling'''的第三次社会模拟浪潮。与微观模拟一样，这些模型强调自下而上的设计，但采用了与微观模拟不同的四个关键假设: '''自主性 Autonomy'''、'''相互依赖性 Interdependency'''、'''简单规则 Simple Rules'''和'''适应性行为 Adaptive Behavior'''。1981年，数学家、政治学家阿克塞尔罗德（Robert Axelrod）和进化生物学家汉密尔顿（W.D. Hamilton）在《科学》杂志上发表了一篇名为《合作的进化》（The Evolution of Cooperation）的重要论文，该论文采用基于主体建模方法，论证了在一个囚徒困境中，当主体遵循简单的自利规则时，互惠的社会合作是如何建立和稳定的。阿克塞尔罗德和汉密尔顿证明，主体遵循这样一套简单的规则: (1)在第一轮进行合作，(2)在其后重复伙伴以前的行动，能够在没有人口学差异、价值观、宗教和文化等社会规范作为合作的先决条件或中介的情况下制定合作和制裁的“规范”。整个20世纪90年代，像威廉·希姆斯·本布里奇（William Sims Bainbridge），Kathleen Carley，Michael Macy 和 John Skvoretz 这样的学者开发了基于多主体的广义互惠、偏见、社会影响和组织信息处理模型。1999年，吉尔伯特（Nigel Gilbert）出版了第一本关于社会模拟: 写给社会科学家的仿真模拟（Simulation for the social scientist）的教科书，并建立了它最相关的杂志: 人工社会和社会模拟杂志（the Journal of Artificial Societies and Social Simulation）。&lt;br /&gt;
&lt;br /&gt;
===Data mining and social network analysis 数据挖掘和社会网络分析===&lt;br /&gt;
&lt;br /&gt;
{{main|Data mining|Social network analysis}}&lt;br /&gt;
&lt;br /&gt;
--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） 少一段原文 &lt;br /&gt;
Independent from developments in computational models of social systems, social network analysis emerged in the 1970s and 1980s from advances in graph theory, statistics, and studies of social structure as a distinct analytical method and was articulated and employed by sociologists like James S. Coleman, Harrison White, Linton Freeman, J. Clyde Mitchell, Mark Granovetter, Ronald Burt, and Barry Wellman.[22] The increasing pervasiveness of computing and telecommunication technologies throughout the 1980s and 1990s demanded analytical techniques, such as network analysis and multilevel modeling, that could scale to increasingly complex and large data sets. The most recent wave of computational sociology, rather than employing simulations, uses network analysis and advanced statistical techniques to analyze large-scale computer databases of electronic proxies for behavioral data. Electronic records such as email and instant message records, hyperlinks on the World Wide Web, mobile phone usage, and discussion on Usenet allow social scientists to directly observe and analyze social behavior at multiple points in time and multiple levels of analysis without the constraints of traditional empirical methods such as interviews, participant observation, or survey instruments.[23] Continued improvements in machine learning algorithms likewise have permitted social scientists and entrepreneurs to use novel techniques to identify latent and meaningful patterns of social interaction and evolution in large electronic datasets.[24][25]&lt;br /&gt;
&lt;br /&gt;
Independent from developments in computational models of social systems, social network analysis emerged in the 1970s and 1980s from advances in graph theory, statistics, and studies of social structure as a distinct analytical method and was articulated and employed by sociologists like [[James Samuel Coleman|James S. Coleman]], [[Harrison White]], [[Linton Freeman]], [[J. Clyde Mitchell]], [[Mark Granovetter]], [[Ronald Burt]], and [[Barry Wellman]].&amp;lt;ref&amp;gt;{{cite book|title=The Development of Social Network Analysis: A Study in the Sociology of Science |first=Linton C. |last=Freeman |publisher=Empirical Press |location=Vancouver, BC |year=2004}}&amp;lt;/ref&amp;gt; The increasing pervasiveness of computing and telecommunication technologies throughout the 1980s and 1990s demanded analytical techniques, such as [[network theory|network analysis]] and [[multilevel modeling]], that could scale to increasingly complex and large data sets. The most recent wave of computational sociology, rather than employing simulations, uses network analysis and advanced statistical techniques to analyze large-scale computer databases of electronic proxies for behavioral data. Electronic records such as email and instant message records, hyperlinks on the [[World Wide Web]], mobile phone usage, and discussion on [[Usenet]] allow social scientists to directly observe and analyze social behavior at multiple points in time and multiple levels of analysis without the constraints of traditional empirical methods such as interviews, participant observation, or survey instruments.&amp;lt;ref&amp;gt;{{cite journal|title=Life in the network: the coming age of computational social science|first9=J|last10=Gutmann|first10=M.|last11=Jebara|first11=T.|last12=King|first12=G.|last13=Macy|first13=M.|last14=Roy|first14=D.|last15=Van Alstyne|first15=M.|last9=Fowler|first8=N|last8=Contractor|first7=N|last7=Christakis|first6=D|last6=Brewer|first5=AL|last5=Barabasi|first4=S |journal=Science|last4=Aral |date=February 6, 2009|first3=L |volume=323|pmid=19197046 |issue=5915|last3=Adamic |pages=721–723|pmc=2745217 |doi=10.1126/science.1167742 |first1=David |last1=Lazer |first2=Alex |last2=Pentland |display-authors=8}}&amp;lt;/ref&amp;gt; Continued improvements in [[machine learning]] algorithms likewise have permitted social scientists and entrepreneurs to use novel techniques to identify latent and meaningful patterns of social interaction and evolution in large electronic datasets.&amp;lt;ref&amp;gt;{{cite journal|first1=Jaideep |last1=Srivastava |first2=Robert |last2=Cooley |first3=Mukund |last3=Deshpande |first4=Pang-Ning |last4=Tan |journal=Proceedings of the ACM Conference on Knowledge Discovery and Data Mining |title=Web usage mining: discovery and applications of usage patterns from Web data|volume=1 |year=2000 |pages=12–23 |doi=10.1145/846183.846188|issue=2}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|doi=10.1016/S0169-7552(98)00110-X|title=The anatomy of a large-scale hypertextual Web search engine |first1=Sergey |last1=Brin |first2=Lawrence |last2=Page |journal=Computer Networks and ISDN Systems |volume=30 |issue=1–7 |pages=107–117 |date=April 1998|citeseerx=10.1.1.115.5930 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Independent from developments in computational models of social systems, social network analysis emerged in the 1970s and 1980s from advances in graph theory, statistics, and studies of social structure as a distinct analytical method and was articulated and employed by sociologists like James S. Coleman, Harrison White, Linton Freeman, J. Clyde Mitchell, Mark Granovetter, Ronald Burt, and Barry Wellman. The increasing pervasiveness of computing and telecommunication technologies throughout the 1980s and 1990s demanded analytical techniques, such as network analysis and multilevel modeling, that could scale to increasingly complex and large data sets. The most recent wave of computational sociology, rather than employing simulations, uses network analysis and advanced statistical techniques to analyze large-scale computer databases of electronic proxies for behavioral data. Electronic records such as email and instant message records, hyperlinks on the World Wide Web, mobile phone usage, and discussion on Usenet allow social scientists to directly observe and analyze social behavior at multiple points in time and multiple levels of analysis without the constraints of traditional empirical methods such as interviews, participant observation, or survey instruments. Continued improvements in machine learning algorithms likewise have permitted social scientists and entrepreneurs to use novel techniques to identify latent and meaningful patterns of social interaction and evolution in large electronic datasets.&lt;br /&gt;
&lt;br /&gt;
'''社会网络分析 Social Network Analysis'''独立于社会系统计算模型的发展，在20世纪70年代和80年代出现于图论、统计学和社会结构的研究中，它作为一种独特的分析方法被社会学家如 James s. Coleman，Harrison White，Linton Freeman，J. Clyde Mitchell，Mark Granovetter，Ronald Burt 和 Barry Wellman 等阐述和采用。在整个1980年代和1990年代，计算和通信技术日益普及，这要求采用诸如网络分析和多级建模等分析技术，这些技术可以扩展到日益复杂和庞大的数据集中。最近的计算社会学没有使用模拟，而是使用网络分析和先进的统计技术来分析大规模计算机数据库中电子代理的行为数据。电子记录，如电子邮件和即时消息记录，万维网上的超链接，移动电话数据，以及 Usenet 上的讨论，使社会科学家能够直接观察社会行为并在多个时间点和多个层次的分析行为，并且不受传统的实证方法，如访谈、观察（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]）为了通顺，删除研究对象/被试：participants）或调查工具的限制。机器学习算法的不断改进同样使得社会科学家和企业家能够使用新技术来识别大型电子数据集中潜在但有意义的社会互动和演化模式。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:Tripletsnew2012.png|thumb|right|Narrative network of US Elections 2012&amp;lt;ref name=&amp;quot;ReferenceA&amp;quot;&amp;gt;{{cite journal|title=Automated analysis of the US presidential elections using Big Data and network analysis|author1=S Sudhahar|author2=GA Veltri|author3=N Cristianini|journal=Big Data &amp;amp; Society|volume=2|issue=1|pages=1–28|year=2015|doi=10.1177/2053951715572916|doi-access=free}}&amp;lt;/ref&amp;gt;]]&lt;br /&gt;
&lt;br /&gt;
Narrative network of US Elections 2012&lt;br /&gt;
&lt;br /&gt;
【图2：Narrative network of US Elections 2012 + 2012年美国大选叙事网络】&lt;br /&gt;
&lt;br /&gt;
The automatic parsing of textual corpora has enabled the extraction of actors and their relational networks on a vast scale, turning textual data into network data.  The resulting networks, which can contain thousands of nodes, are then analysed by using tools from Network theory to identify the key actors, the key communities or parties, and general properties such as robustness or structural stability of the overall network, or centrality of certain nodes.&amp;lt;ref&amp;gt;{{cite journal|title=Network analysis of narrative content in large corpora|author1=S Sudhahar|author2=G De Fazio|author3=R Franzosi|author4=N Cristianini|journal=Natural Language Engineering|volume=21|issue=1|pages=1–32|year=2013|doi=10.1017/S1351324913000247 |url=https://research-information.bristol.ac.uk/files/129621186/Network_Analysis_of_Narrative_Content_in_Large_Corpora.pdf}}&amp;lt;/ref&amp;gt; This automates the approach introduced by quantitative narrative analysis,&amp;lt;ref&amp;gt;{{cite book|title=Quantitative Narrative Analysis|last=Franzosi|first=Roberto|publisher=Emory University|year=2010}}&amp;lt;/ref&amp;gt; whereby subject-verb-object triplets are identified with pairs of actors linked by an action, or pairs formed by actor-object.&amp;lt;ref name=&amp;quot;ReferenceA&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The automatic parsing of textual corpora has enabled the extraction of actors and their relational networks on a vast scale, turning textual data into network data.  The resulting networks, which can contain thousands of nodes, are then analysed by using tools from Network theory to identify the key actors, the key communities or parties, and general properties such as robustness or structural stability of the overall network, or centrality of certain nodes. This automates the approach introduced by quantitative narrative analysis, whereby subject-verb-object triplets are identified with pairs of actors linked by an action, or pairs formed by actor-object.&lt;br /&gt;
&lt;br /&gt;
文本语料库的自动解析使对参与者及其关系网络的大规模提取成为可能，它将文本数据转换为网络数据。由此产生的网络可以包含数千个'''节点 Nodes'''，然后利用网络理论中的工具对其进行分析，以确定关键参与者、关键群体，以及网络的总体特性如稳健性、结构稳定性，或某些节点的'''中心性 Centrality'''等。这使'''定量叙事分析Quantitative Narrative Analysis'''引入的方法得以自动化，据此，主语-动词-宾语三元组被看作由动作连接的成对行为者，或者由行为者-宾语形成的成对行为者。&lt;br /&gt;
&lt;br /&gt;
===Computational content analysis 计算机内容分析 （名词翻译可吗？）===&lt;br /&gt;
&lt;br /&gt;
[[Content analysis]] has been a traditional part of social sciences and media studies for a long time. The automation of content analysis has allowed a &amp;quot;[[big data]]&amp;quot; revolution to take place in that field, with studies in social media and newspaper content that include millions of news items. [[Gender bias]], [[readability]], content similarity, reader preferences, and even mood have been analyzed based on [[text mining]] methods over millions of documents.&amp;lt;ref&amp;gt;{{cite journal|author1=I. Flaounas|author2=M. Turchi|author3=O. Ali|author4=N. Fyson|author5=T. De Bie|author6=N. Mosdell|author7=J. Lewis|author8=N. Cristianini|title=The Structure of EU Mediasphere|journal=PLOS One|volume=5|issue=12|pages=e14243|year=2010|doi=10.1371/journal.pone.0014243|url=https://orca-mwe.cf.ac.uk/50732/1/Flaounas%202010.pdf|pmid=21170383|pmc=2999531|bibcode=2010PLoSO...514243F}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|title=Nowcasting Events from the Social Web with Statistical Learning|author1=V Lampos|author2=N Cristianini|journal=ACM Transactions on Intelligent Systems and Technology |volume=3|issue=4|page=72|doi=10.1145/2337542.2337557|year=2012|url=http://www.lampos.net/sites/default/files/papers/lampos2012nowcasting.pdf}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite conference|title=NOAM: news outlets analysis and monitoring system|author1=I. Flaounas|author2=O. Ali|author3=M. Turchi|author4=T Snowsill|author5=F Nicart|author6=T De Bie|author7=N Cristianini|conference=Proc. of the 2011 ACM SIGMOD international conference on Management of data|year=2011|url=http://www.tijldebie.net/system/files/SIGMOD_11_demo_Ilias.pdf|doi=10.1145/1989323.1989474}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite book|author=N Cristianini|title=''Combinatorial Pattern Matching''|pages=2–13|year=2011|volume=6661|series= Lecture Notes in Computer Science|isbn=978-3-642-21457-8|doi=10.1007/978-3-642-21458-5_2|chapter=Automatic Discovery of Patterns in Media Content|citeseerx=10.1.1.653.9525}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite journal|last=Lansdall-Welfare|first=Thomas|last2=Sudhahar|first2=Saatviga|last3=Thompson|first3=James|last4=Lewis|first4=Justin|last5=Team|first5=FindMyPast Newspaper|last6=Cristianini|first6=Nello|date=2017-01-09|title=Content analysis of 150 years of British periodicals|url=http://www.pnas.org/content/early/2017/01/03/1606380114|journal=Proceedings of the National Academy of Sciences|volume=114|issue=4|language=en|pages=E457–E465|doi=10.1073/pnas.1606380114|issn=0027-8424|pmid=28069962|pmc=5278459}}&amp;lt;/ref&amp;gt; The analysis of readability, gender bias and topic bias was demonstrated in Flaounas et al.&amp;lt;ref&amp;gt;{{cite journal|author1=I. Flaounas|author2=O. Ali|author3=M. Turchi|author4=T. Lansdall-Welfare|author5=T. De Bie|author6=N. Mosdell|author7=J. Lewis|author8=N. Cristianini|title=Research methods in the age of digital journalism|journal=Digital Journalism|year=2012|doi=10.1080/21670811.2012.714928|volume=1|pages=102–116}}&amp;lt;/ref&amp;gt; showing how different topics have different gender biases and levels of readability; the possibility to detect mood shifts in a vast population by analysing Twitter content was demonstrated as well.&amp;lt;ref&amp;gt;{{cite conference|title=Effects of the Recession on Public Mood in the UK|author=T Lansdall-Welfare|author2=V Lampos|author3=N Cristianini|series=Mining Social Network Dynamics (MSND) session on Social Media Applications|doi=10.1145/2187980.2188264|conference=Proceedings of the 21st International Conference on World Wide Web|pages=1221–1226|location=New York, NY, USA|url=http://www.cs.bris.ac.uk/Publications/Papers/2001521.pdf}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Content analysis has been a traditional part of social sciences and media studies for a long time. The automation of content analysis has allowed a &amp;quot;big data&amp;quot; revolution to take place in that field, with studies in social media and newspaper content that include millions of news items. Gender bias, readability, content similarity, reader preferences, and even mood have been analyzed based on text mining methods over millions of documents. The analysis of readability, gender bias and topic bias was demonstrated in Flaounas et al. showing how different topics have different gender biases and levels of readability; the possibility to detect mood shifts in a vast population by analysing Twitter content was demonstrated as well.&lt;br /&gt;
&lt;br /&gt;
长期以来，内容分析一直是社会科学和媒体研究的传统方法。内容分析的自动化使得这一领域发生了一场“大数据”革命，这些研究中，社交媒体和报纸内容包括了数百万条的新闻。基于文本挖掘方法，'''性别偏差Gender Bias'''、'''可读性 Readability'''、'''内容相似度 Content Similarity'''、'''读者偏好 Reader Preferences'''，甚至是'''情绪 Mood'''的数以百万计的文档都可以被分析。Flaounas等人对可读性、性别偏差和'''话题偏差 Topic Bias'''为主要研究对象，展示了不同的话题如何有不同水平的性别偏差和可读性; 展示了通过分析推特内容来检测人群情绪变化的可能性。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The analysis of vast quantities of historical newspaper content has been pioneered by Dzogang et al.,&amp;lt;ref&amp;gt;{{Cite journal|last=Dzogang|first=Fabon|last2=Lansdall-Welfare|first2=Thomas|last3=Team|first3=FindMyPast Newspaper|last4=Cristianini|first4=Nello|date=2016-11-08|title=Discovering Periodic Patterns in Historical News|journal=PLOS One|volume=11|issue=11|pages=e0165736|doi=10.1371/journal.pone.0165736|issn=1932-6203|pmc=5100883|pmid=27824911|bibcode=2016PLoSO..1165736D}}&amp;lt;/ref&amp;gt; which showed how periodic structures can be automatically discovered in historical newspapers. A similar analysis was performed on social media, again revealing strongly periodic structures.&amp;lt;ref&amp;gt;[https://core.ac.uk/download/pdf/83929129.pdf Seasonal Fluctuations in Collective Mood Revealed by Wikipedia Searches and Twitter Posts] F Dzogang, T Lansdall-Welfare, N Cristianini - 2016 IEEE International Conference on Data Mining, Workshop on ''Data Mining'' in Human Activity Analysis&lt;br /&gt;
&lt;br /&gt;
The analysis of vast quantities of historical newspaper content has been pioneered by Dzogang et al., which showed how periodic structures can be automatically discovered in historical newspapers. A similar analysis was performed on social media, again revealing strongly periodic structures.&amp;lt;ref&amp;gt;[https://core.ac.uk/download/pdf/83929129.pdf Seasonal Fluctuations in Collective Mood Revealed by Wikipedia Searches and Twitter Posts] F Dzogang, T Lansdall-Welfare, N Cristianini - 2016 IEEE International Conference on Data Mining, Workshop on Data Mining in Human Activity Analysis&lt;br /&gt;
&lt;br /&gt;
对大量历史报纸内容的分析是由 Dzogang 等人率先进行的，他们展示了如何在历史报纸中自动发现'''周期结构 Periodic Structures'''。一个类似的社交媒体上进行的分析，也揭示了强烈的周期性结构。 参考文献[ https://core.ac.uk/download/pdf/83929129.pdf 维基百科搜索和推特帖子揭示的集体情绪的季节性波动] f Dzogang，t Lansdall-Welfare，n Cristianini-2016 IEEE International Conference on Data Mining, Workshop on Data Mining in Human Activity Analysis&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
==Challenges 挑战==&lt;br /&gt;
&lt;br /&gt;
Computational sociology, as with any field of study, faces a set of challenges.&amp;lt;ref name=&amp;quot;MCSS&amp;quot;&amp;gt;Conte, Rosaria, et al. &amp;quot;[https://link.springer.com/content/pdf/10.1140%252Fepjst%252Fe2012-01697-8.pdf Manifesto of computational social science].&amp;quot; The European Physical Journal Special Topics 214.1 (2012): 325-346.&amp;lt;/ref&amp;gt; These challenges need to be handled meaningfully so as to make the maximum impact on society.&lt;br /&gt;
&lt;br /&gt;
Computational sociology, as with any field of study, faces a set of challenges. These challenges need to be handled meaningfully so as to make the maximum impact on society.&lt;br /&gt;
&lt;br /&gt;
计算社会学和其他研究领域一样面临着一系列的挑战。必须有意义地处理这些挑战（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） meaningfully怎么翻译才比较通顺？），才能对社会产生最大的影响。&lt;br /&gt;
  &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Levels and their interactions 层级和层级的交互关系===&lt;br /&gt;
&lt;br /&gt;
Each society that is formed tends to be in one level or the other and there exists tendencies of interactions between and across these levels. Levels need not only be micro-level or macro-level in nature. There can be intermediate levels in which a society exists say - groups, networks, communities etc.&amp;lt;ref name=&amp;quot;MCSS&amp;quot; /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Each society that is formed tends to be in one level or the other and there exists tendencies of interactions between and across these levels. Levels need not only be micro-level or macro-level in nature. There can be intermediate levels in which a society exists say - groups, networks, communities etc.&lt;br /&gt;
&lt;br /&gt;
形成的每个社会都处于某种层次上，并且这些层次之间有相互作用的倾向。社会中的级别不仅可以分为微观或宏观的层次，还可以存在中间的层次，比如群体、网络、社区等。&lt;br /&gt;
（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） 合并了英文的原句）&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The question however arises as to how to identify these levels and how they come into existence? And once they are in existence how do they interact within themselves and with other levels?&lt;br /&gt;
&lt;br /&gt;
The question however arises as to how to identify these levels and how they come into existence? And once they are in existence how do they interact within themselves and with other levels?&lt;br /&gt;
&lt;br /&gt;
然而问题是，这些层次是如何确定的以及如何产生的？并且，一旦它们产生了，它们如何在自身内部以及与其他层次相互作用？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
If we view entities (agents) as nodes and the connections between them as the edges, we see the formation of networks. The connections in these networks do not come about based on just objective relationships between the entities, rather they are decided upon by factors chosen by the participating entities.&amp;lt;ref&amp;gt;{{cite journal|last1=Egu´ıluz|first1=V. M.|last2=Zimmermann|first2=M. G.|last3=Cela-Conde|first3=C. J.|last4=San Miguel|first4=M.|title=American Journal of Sociology|issue=2005|pages=110, 977}}&amp;lt;/ref&amp;gt; The challenge with this process is that, it is difficult to identify when a set of entities will form a network. These networks may be of trust networks, co-operation networks, dependence networks etc. There have been cases where heterogeneous set of entities have shown to form strong and meaningful networks among themselves.&amp;lt;ref&amp;gt;{{cite journal|last1=Sichman|first1=J. S.|last2=Conte|first2=R.|title=Computational &amp;amp; Mathematical Organization Theory|issue=2002|pages=8(2)}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Ehrhardt|first1=G.|last2=Marsili|first2=M.|last3=Vega-Redondo|first3=F.|title=Physical Review E|issue=2006|pages=74(3)}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
If we view entities (agents) as nodes and the connections between them as the edges, we see the formation of networks. The connections in these networks do not come about based on just objective relationships between the entities, rather they are decided upon by factors chosen by the participating entities. The challenge with this process is that, it is difficult to identify when a set of entities will form a network. These networks may be of trust networks, co-operation networks, dependence networks etc. There have been cases where heterogeneous set of entities have shown to form strong and meaningful networks among themselves.&lt;br /&gt;
&lt;br /&gt;
如果我们把'''实体 Entities'''（'''主体 Agents'''）看作节点，把它们之间的连接看作边，我们就看到了网络的形成。这些网络中的连接并非只是基于实体之间的客观关系，而是由实体选择的因素决定的。这个过程的困难之处在于，很难确定一组实体何时形成网络。这些网络可以是信任网络、合作网络、依赖网络等。在一些情况下，异质的实体集在它们之间形成了强大而有意义的网络。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
As discussed previously, societies fall into levels and in one such level, the individual level, a micro-macro link&amp;lt;ref&amp;gt;Billari, Francesco C. [https://books.google.com/books?hl=en&amp;amp;lr=&amp;amp;id=Tc8iL0b-OycC&amp;amp;oi=fnd&amp;amp;pg=PA1&amp;amp;dq=%22Agent-based+computational+modelling:+applications+in+demography,+social,+economic+and+environmental+sciences%22&amp;amp;ots=6MNVK7JP-e&amp;amp;sig=-o_iS9zCK3r-t1eHn3554UVadUs Agent-based computational modelling: applications in demography, social, economic and environmental sciences]. Taylor &amp;amp; Francis, 2006.&amp;lt;/ref&amp;gt; refers to the interactions which create higher-levels. There are a set of questions that needs to be answered regarding these Micro-Macro links. How they are formed? When do they converge? What is the feedback pushed to the lower levels and how are they pushed?&lt;br /&gt;
&lt;br /&gt;
As discussed previously, societies fall into levels and in one such level, the individual level, a micro-macro link refers to the interactions which create higher-levels. There are a set of questions that needs to be answered regarding these Micro-Macro links. How they are formed? When do they converge? What is the feedback pushed to the lower levels and how are they pushed?&lt;br /&gt;
&lt;br /&gt;
正如前面所讨论的，社会分为不同层次。在其中的一个层次：个体层次中，'''微观-宏观联系 Micro-macro Link'''指的是创造更高层次的相互作用。关于微观-宏观链接有一系列问题等待回答。它们是如何形成的？它们什么时候汇聚？什么反馈被推到了较低的层次，以及它们是如何被推到较低层次的？ &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Another major challenge in this category concerns the validity of information and their sources. In recent years there has been a boom in information gathering and processing. However, little attention was paid to the spread of false information between the societies. Tracing back the sources and finding ownership of such information is difficult.&lt;br /&gt;
&lt;br /&gt;
Another major challenge in this category concerns the validity of information and their sources. In recent years there has been a boom in information gathering and processing. However, little attention was paid to the spread of false information between the societies. Tracing back the sources and finding ownership of such information is difficult.&lt;br /&gt;
&lt;br /&gt;
这一分类的另一个主要挑战涉及信息的有效性及其来源。近年来，信息收集和处理有着蓬勃的发展。但人们很少注意到社会之间虚假信息的传播。追溯资料来源并找到这些资料的所有者是很困难的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Culture modeling 文化建模===&lt;br /&gt;
&lt;br /&gt;
The evolution of the networks and levels in the society brings about cultural diversity.&amp;lt;ref&amp;gt;{{cite journal|last1=Centola|first1=D.|last2=Gonz´alez-Avella|first2=J. C.|last3=Egu´ıluz|first3=V. M.|last4=San Miguel|first4=M.|title=Journal of Conflict Resolution|issue=2007|pages=51}}&amp;lt;/ref&amp;gt; A thought which arises however is that, when people tend to interact and become more accepting of other cultures and beliefs, how is it that diversity still persists? Why is there no convergence? A major challenge is how to model these diversities. Are there external factors like mass media, locality of societies etc. which influence the evolution or persistence of cultural diversities?{{Citation needed|reason=Sounds just like personal thoughts|date=May 2017}}&lt;br /&gt;
&lt;br /&gt;
The evolution of the networks and levels in the society brings about cultural diversity. A thought which arises however is that, when people tend to interact and become more accepting of other cultures and beliefs, how is it that diversity still persists? Why is there no convergence? A major challenge is how to model these diversities. Are there external factors like mass media, locality of societies etc. which influence the evolution or persistence of cultural diversities?&lt;br /&gt;
&lt;br /&gt;
社会网络和层次的演变带来了文化的多样性。然而人们会想，当人们倾向于相互作用，变得更能接受其他文化和信仰时，为什么多样性仍然存在？为什么人们没有趋同？一个主要的挑战是如何为这些多样性建立模型。是否存在大众传媒、社会地域性等外部因素，这些因素影响文化多样性的演化或保持？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Experimentation and evaluation 实验和评估===&lt;br /&gt;
&lt;br /&gt;
Any study or modelling when combined with experimentation needs to be able to address the questions being asked. [[Computational social science]] deals with large scale data and the challenge becomes much more evident as the scale grows. How would one design informative simulations on a large scale? And even if a large scale simulation is brought up, how is the evaluation supposed to be performed?&lt;br /&gt;
&lt;br /&gt;
Any study or modelling when combined with experimentation needs to be able to address the questions being asked. Computational social science deals with large scale data and the challenge becomes much more evident as the scale grows. How would one design informative simulations on a large scale? And even if a large scale simulation is brought up, how is the evaluation supposed to be performed?&lt;br /&gt;
&lt;br /&gt;
任何与实验结合的研究或建模都需要能够解决所提出的问题。计算社会科学处理大规模数据，并且数据规模越大建模的挑战就越明显。如何在一个大规模的数据集里设计信息仿真模型？并且，即使提出了一个大规模的仿真模型，应该如何对它进行评估？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Model choice and model complexities 模型选择和模型复杂性===&lt;br /&gt;
&lt;br /&gt;
Another challenge is identifying the models that would best fit the data and the complexities of these models. These models would help us predict how societies might evolve over time and provide possible explanations on how things work.&amp;lt;ref&amp;gt;Weisberg, Michael. [http://www.academia.edu/download/30604870/lessmorefinal.pdf When less is more: Tradeoffs and idealization in model building]. Diss. Stanford University, 2003.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Another challenge is identifying the models that would best fit the data and the complexities of these models. These models would help us predict how societies might evolve over time and provide possible explanations on how things work.&lt;br /&gt;
&lt;br /&gt;
另一个挑战是确定最适合数据的模型，以及最合适的'''模型复杂性 Model Complexities'''。这些模型将帮助我们预测随着时间的推移社会将如何演变，并为事物如何运动和变化提供可能的解释。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====Generative models 生成模型====&lt;br /&gt;
&lt;br /&gt;
Generative models helps us to perform extensive qualitative analysis in a controlled fashion. A model proposed by Epstein, is the agent-based simulation, which talks about identifying an initial set of heterogeneous entities (agents) and observe their evolution and growth based on simple local rules.&amp;lt;ref&amp;gt;Epstein, Joshua M. [https://www.researchgate.net/profile/Eric_Jones14/publication/283615593_Book_Review_-_Generative_Social_Science_Studies_in_Agent-Based_Computational_Modeling/links/5641398808aebaaea1f70216.pdf Generative social science: Studies in agent-based computational modeling]. Princeton University Press, 2006.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Generative models helps us to perform extensive qualitative analysis in a controlled fashion. A model proposed by Epstein, is the agent-based simulation, which talks about identifying an initial set of heterogeneous entities (agents) and observe their evolution and growth based on simple local rules.&lt;br /&gt;
&lt;br /&gt;
'''生成模型 Generative Models'''帮助我们以一种受控的方式进行广泛的定性分析。爱泼斯坦（Epstein）提出的一个基于主体的模型，就是探讨如何识别异质实体(主体)的'''初始集 Initial Set'''，并根据简单的局部规则观察它们的演化和增长。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
But what are these local rules? How does one identify them for a set of heterogeneous agents? Evaluation and impact of these rules state a whole new set of difficulties.&lt;br /&gt;
&lt;br /&gt;
But what are these local rules? How does one identify them for a set of heterogeneous agents? Evaluation and impact of these rules state a whole new set of difficulties.&lt;br /&gt;
&lt;br /&gt;
但是这些局部规则是什么呢？如何识别一组异质实体？这些规则的评估和影响都是新出现的困难之处。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====Heterogeneous or ensemble models 异质模型和组合模型====&lt;br /&gt;
&lt;br /&gt;
Integrating simple models which perform better on individual tasks to form a Hybrid model is an approach that can be looked into{{Citation needed|reason=unsupported claims|date=May 2017}}. These models can offer better performance and understanding of the data. However the trade-off of identifying and having a deep understanding of the interactions between these simple models arises when one needs to come up with one combined, well performing model. Also, coming up with tools and applications to help analyse and visualize the data based on these hybrid models is another added challenge.&lt;br /&gt;
&lt;br /&gt;
Integrating simple models which perform better on individual tasks to form a Hybrid model is an approach that can be looked into. These models can offer better performance and understanding of the data. However the trade-off of identifying and having a deep understanding of the interactions between these simple models arises when one needs to come up with one combined, well performing model. Also, coming up with tools and applications to help analyse and visualize the data based on these hybrid models is another added challenge.&lt;br /&gt;
&lt;br /&gt;
集成在单个任务中表现良好的简单模型并形成'''混合模型 Hybrid model'''是一种可以继续考虑的方法。这些模型有更好的性能并可以对数据提供更好的理解。然而，当需要提出一个整合的、性能良好的模型时，识别简单模型和深入理解模型之间相互作用的权衡问题就出现了。此外，另一个挑战是开发工具和应用程序来帮助分析和可视化基于这些混合模型的数据。&lt;br /&gt;
&lt;br /&gt;
==Impact 影响==&lt;br /&gt;
&lt;br /&gt;
Computational sociology can bring impacts to science, technology and society.&amp;lt;ref name=&amp;quot;MCSS&amp;quot; /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Computational sociology can bring impacts to science, technology and society.&lt;br /&gt;
&lt;br /&gt;
计算社会学可以给科学、技术和社会带来影响。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Impact on science 对科学的影响===&lt;br /&gt;
&lt;br /&gt;
In order for the study of computational sociology to be effective, there has to be valuable innovations. These innovation can be of the form of new data analytics tools, better models and algorithms. The advent of such innovation will be a boon for the scientific community in large. {{Citation needed|reason=citation for claim on innovation and the type of innovation|date=May 2017}}&lt;br /&gt;
&lt;br /&gt;
In order for the study of computational sociology to be effective, there has to be valuable innovations. These innovation can be of the form of new data analytics tools, better models and algorithms. The advent of such innovation will be a boon for the scientific community in large. &lt;br /&gt;
&lt;br /&gt;
为了使计算社会学的研究有效，必须有一些有价值的创新。这些创新可以是新形式的数据分析工具，或更好的模型和算法。这些创新的出现将为整个科学界带来益处。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Impact on society 对社会的影响===&lt;br /&gt;
&lt;br /&gt;
One of the major challenges of computational sociology is the modelling of social processes {{Citation needed|reason=to support the claim for need of modeling of social processes|date=May 2017}}. Various law and policy makers would be able to see efficient and effective paths to issue new guidelines and the mass in general would be able to evaluate and gain fair understanding of the options presented in front of them enabling an open and well balanced decision process. {{Citation needed|reason=unsupported claims|date=May 2017}}.&lt;br /&gt;
&lt;br /&gt;
One of the major challenges of computational sociology is the modelling of social processes . Various law and policy makers would be able to see efficient and effective paths to issue new guidelines and the mass in general would be able to evaluate and gain fair understanding of the options presented in front of them enabling an open and well balanced decision process. &lt;br /&gt;
&lt;br /&gt;
计算社会学的主要挑战之一是对社会过程的建模。各种法律和政策制定者将能够得到发布新指导方针的快速有效的方法，广大群众将能够评价和更好地理解各种备选方案，从而实现决策进程的公开和平衡。&lt;br /&gt;
&lt;br /&gt;
==Journals and academic publications 期刊和学术出版物==&lt;br /&gt;
&lt;br /&gt;
The most relevant journal of the discipline is the [[Journal of Artificial Societies and Social Simulation]].&lt;br /&gt;
&lt;br /&gt;
The most relevant journal of the discipline is the Journal of Artificial Societies and Social Simulation.&lt;br /&gt;
&lt;br /&gt;
该学科最相关的期刊是《人工社会与社会模拟（the Journal of Artificial Societies and Social Simulation）》。&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20100611121626/http://www.ccsr.uiuc.edu/web/Journals/Journals.html Complexity Research Journal List], from UIUC, IL 复杂研究期刊列表（资料来自伊利诺伊大学香槟分校）&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20100611091342/http://www.ccsr.uiuc.edu/web/Groups/Groups.html Related Research Groups], from UIUC, IL 相关研究组（资料来自伊利诺伊大学香槟分校）&lt;br /&gt;
&lt;br /&gt;
==Associations, conferences and workshops 协会、会议及工作坊==&lt;br /&gt;
&lt;br /&gt;
*[http://www.casos.cs.cmu.edu/naacsos/ North American Association for Computational Social and Organization Sciences]&lt;br /&gt;
&lt;br /&gt;
*[http://www.essa.eu.org/ ESSA: European Social Simulation Association]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Academic programs, departments and degrees 学术课程、院系和学位==&lt;br /&gt;
&lt;br /&gt;
* [http://mediapatterns.enm.bris.ac.uk/ University of Bristol &amp;quot;Mediapatterns&amp;quot; project]&lt;br /&gt;
&lt;br /&gt;
* [http://www.cos.cs.cmu.edu/ Carnegie Mellon University], [http://www.casos.cs.cmu.edu PhD program] in Computation, Organizations and Society (COS)&lt;br /&gt;
&lt;br /&gt;
* [http://www.uchicago.edu University of Chicago]&lt;br /&gt;
&lt;br /&gt;
** [https://macss.uchicago.edu/ Certificate, MA and PhD in Computational Social Sciences]&lt;br /&gt;
&lt;br /&gt;
* [http://www.gmu.edu George Mason University]&lt;br /&gt;
&lt;br /&gt;
** PhD program in [http://css.gmu.edu CSS (Computational Social Sciences)]&lt;br /&gt;
&lt;br /&gt;
** MA program in [http://mais.gmu.edu/programs/la-mais-css Master's of Interdisciplinary Studies, CSS emphasis]&lt;br /&gt;
&lt;br /&gt;
* [http://www.pdx.edu/sysc/program-systems-science-phd-program Portland State], PhD program in Systems Science&lt;br /&gt;
&lt;br /&gt;
* [http://www.pdx.edu/sysc/program-systems-science-masters-program Portland State], MS program in Systems Science&lt;br /&gt;
&lt;br /&gt;
* [http://www.ucd.ie University College Dublin], &lt;br /&gt;
&lt;br /&gt;
** PhD Program in [http://www.ucd.ie/geary/postgraduatetraining/cscs Complex Systems and Computational Social Science]&lt;br /&gt;
&lt;br /&gt;
** MSc in [https://sisweb.ucd.ie/usis/!W_HU_MENU.P_PUBLISH?p_tag=PROG&amp;amp;MAJR=W390 Social Data Analytics] &lt;br /&gt;
&lt;br /&gt;
** BSc in [https://www.myucd.ie/courses/social-sciences/computational-social-science Computational Social Science] &lt;br /&gt;
&lt;br /&gt;
* [https://archive.is/20121215023745/http://hcs.ucla.edu/courses.htm UCLA], Minor in Human Complex Systems&lt;br /&gt;
&lt;br /&gt;
* [http://www.cs.ucla.edu/~cyber/ UCLA], Major in Computational &amp;amp; Systems Biology (including behavioral sciences)&lt;br /&gt;
&lt;br /&gt;
* [http://cscs.umich.edu/education/undergrad/undergrad.html Univ. of Michigan], Minor in Complex Systems&lt;br /&gt;
&lt;br /&gt;
* [http://www.pdx.edu/sysc/resources-other-systems-science-programs Systems Sciences Programs List], Portland State.  List of other worldwide related programs.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Centers and institutes 中心和机构==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===North America 北美===&lt;br /&gt;
&lt;br /&gt;
* [http://cnets.indiana.edu/ Center for Complex Networks and Systems Research], Indiana University, Bloomington, IN, USA.&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20110430200327/http://www.ccsr.uiuc.edu/ Center for Complex Systems Research], University of Illinois at Urbana-Champaign, IL, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://socialcomplexity.gmu.edu/ Center for Social Complexity], George Mason University, Fairfax, VA, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.asu.edu/clas/csdc/ Center for Social Dynamics and Complexity], Arizona State University, Tempe, AZ, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.cscs.umich.edu/ Center of the Study of Complex Systems], University of Michigan, Ann Arbor, MI, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://hcs.ucla.edu/ Human Complex Systems], University of California Los Angeles, Los Angeles, CA, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.iq.harvard.edu/ Institute for Quantitative Social Science], Harvard University, Boston, MA, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.nico.northwestern.edu/ Northwestern Institute on Complex Systems (NICO)], Northwestern University, Evanston, IL USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.santafe.edu/ Santa Fe Institute], Santa Fe, NM, USA.&lt;br /&gt;
&lt;br /&gt;
* Duke Network Analysis Center, [[Duke University]], Durham, NC, USA&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===South America 南美===&lt;br /&gt;
&lt;br /&gt;
* [http://www5.each.usp.br/mestrado-academico-em-modelagem-de-sistemas-complexos/ Modelagem de Sistemas Complexos], University of São Paulo - EACH, São Paulo, SP, Brazil&lt;br /&gt;
&lt;br /&gt;
* [http://inct.cnpq.br/web/inct-sc Instituto Nacional de Ciência e Tecnologia de Sistemas Complexos], Centro Brasileiro de Pesquisas Físicas, Rio de Janeiro, RJ, Brazil&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Europe 欧洲===&lt;br /&gt;
&lt;br /&gt;
* [http://cfpm.org Centre for Policy Modelling], Manchester, UK.&lt;br /&gt;
&lt;br /&gt;
* [http://cress.soc.surrey.ac.uk/ Centre for Research in Social Simulation], University of Surrey, UK.&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20130425014018/http://dl.ucd.ie/ UCD Dynamics Lab- Centre for Computational Social Science], Geary Institute for Public Policy, University College Dublin, Ireland.&lt;br /&gt;
&lt;br /&gt;
* [http://www.rug.nl/research/gcscs/ Groningen Center for Social Complexity Studies (GCSCS)], Groningen, NL.&lt;br /&gt;
&lt;br /&gt;
* [http://www.soms.ethz.ch/ Chair of Sociology, in particular of Modeling and Simulation (SOMS)], Zürich, Switzerland.&lt;br /&gt;
&lt;br /&gt;
* [http://www.eco.unibs.it/gecs/ Research Group on Experimental and Computational Sociology (GECS)], Brescia, IT.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Asia 亚洲===&lt;br /&gt;
&lt;br /&gt;
* [http://bandungfe.net Bandung Fe Institute, Centre for Complexity in Surya University], Bandung, Indonesia.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== See also 参见==&lt;br /&gt;
&lt;br /&gt;
* [[Artificial society]] 人工社会&lt;br /&gt;
&lt;br /&gt;
* [[Simulated reality]] 虚拟现实&lt;br /&gt;
&lt;br /&gt;
* [[Social simulation]] 社会仿真&lt;br /&gt;
&lt;br /&gt;
* [[Agent-based social simulation]] 基于主体的社会仿真&lt;br /&gt;
&lt;br /&gt;
* [[Social complexity]] 社会复杂性&lt;br /&gt;
&lt;br /&gt;
* [[Computational economics]] 计算经济学&lt;br /&gt;
&lt;br /&gt;
* [[Computational epidemiology]] 计算流行病学&lt;br /&gt;
&lt;br /&gt;
* [[Cliodynamics]] 历史动力学&lt;br /&gt;
&lt;br /&gt;
* [[Predictive analytics]] 预测分析&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&lt;br /&gt;
{{reflist|35em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==External links 外部链接==&lt;br /&gt;
&lt;br /&gt;
*[http://cress.soc.surrey.ac.uk/s4ss/ On-line book &amp;quot;Simulation for the Social Scientist&amp;quot; by Nigel Gilbert and Klaus G. Troitzsch, 1999, second edition 2005 社会科学家的仿真建模 电子书 作者：Nigel Gilbert and Klaus G. Troitzsch 第二版（2005年版）]&lt;br /&gt;
&lt;br /&gt;
*[http://jasss.soc.surrey.ac.uk/JASSS.html Journal of Artificial Societies and Social Simulation 人工社会和社会建模仿真期刊]&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20110516072744/http://cmol.nbi.dk/models/ Agent based models for social networks, interactive java applets 基于主体的社会网络模型，交互式 java 小程序]&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20090827052722/http://www.personal.kent.edu/~bcastel3/ Sociology and Complexity Science Website 社会学与复杂性科学网站]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:Subfields of sociology]]&lt;br /&gt;
&lt;br /&gt;
Category:Subfields of sociology&lt;br /&gt;
&lt;br /&gt;
范畴: 社会学的子领域&lt;br /&gt;
&lt;br /&gt;
[[Category:Complex systems theory]]&lt;br /&gt;
&lt;br /&gt;
Category:Complex systems theory&lt;br /&gt;
&lt;br /&gt;
范畴: 复杂系统理论&lt;br /&gt;
&lt;br /&gt;
[[Category:Methods in sociology]]&lt;br /&gt;
&lt;br /&gt;
Category:Methods in sociology&lt;br /&gt;
&lt;br /&gt;
范畴: 社会学方法&lt;br /&gt;
&lt;br /&gt;
[[Category:Computational fields of study]]&lt;br /&gt;
&lt;br /&gt;
Category:Computational fields of study&lt;br /&gt;
&lt;br /&gt;
类别: 研究的计算领域&lt;br /&gt;
&lt;br /&gt;
&amp;lt;noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;small&amp;gt;This page was moved from [[wikipedia:en:Computational sociology]]. Its edit history can be viewed at [[社会计算/edithistory]]&amp;lt;/small&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:待整理页面]]&lt;br /&gt;
&lt;br /&gt;
== 编者推荐 ==&lt;br /&gt;
=== 书籍推荐 ===&lt;br /&gt;
====[https://e.jd.com/30159646.html 社会计算的基本方法与应用]====&lt;br /&gt;
这是中科院自动化所的王飞跃老师关于社会计算的专著，从利用计算技术解决社会问题的角度介绍社会计算。阅读难度可能较高。&lt;br /&gt;
&lt;br /&gt;
=== 集智推荐 ===&lt;br /&gt;
====[https://campus.swarma.org/course/1028 2019 International Conference of Social Computing]====&lt;br /&gt;
本课程是2019年8月26日、27日的2019 International Conference of Social Computing记录。教师团队由芝加哥大学社会学系James Evans教授，Science University of Gottingen傅晓明教授，清华大学罗家德教授，电子科技大学周涛教授等多位老师组成。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://campus.swarma.org/course/1016 复杂系统与社会计算研讨会]====&lt;br /&gt;
本课程是，2019年10月27日北京计算科学研究中心主办的复杂系统与社会计算研讨会活动记录。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://pattern.swarma.org/path?id=12 计算社会科学入门路径]====&lt;br /&gt;
计算社会科学诞生至今，已有将近10年。在自然科学领域已经广泛应用大数据、分布式计算等方式提高研究质量的今天，社会科学领域涉及到的核心数据仍然被少数机构所拥有并创造着巨大的价值。本文将从计算社会科学的发展历史，常用方法，以及前沿问题来给大家粗略地展示计算社会科学的脉络。&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E7%A4%BE%E4%BC%9A%E8%AE%A1%E7%AE%97&amp;diff=11137</id>
		<title>社会计算</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E7%A4%BE%E4%BC%9A%E8%AE%A1%E7%AE%97&amp;diff=11137"/>
		<updated>2020-07-25T05:33:26Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;#重定向 [[社会计算]]&lt;br /&gt;
此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。&lt;br /&gt;
{{sociology}}&amp;lt;onlyinclude&amp;gt;&amp;lt;!-- &lt;br /&gt;
&lt;br /&gt;
&amp;lt;onlyinclude&amp;gt;&amp;lt;!-- &lt;br /&gt;
&lt;br /&gt;
只包括! -- &lt;br /&gt;
&lt;br /&gt;
While editing this lead/intro, please keep your text BELOW this line - this will make it easier to automatically insert the lede into other articles --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
  While editing this lead/intro, please keep your text BELOW this line - this will make it easier to automatically insert the lede into other articles --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
当编辑这个导语 / 介绍，请保持你的文本下面这行-这将使它更容易自动插入到其他文章的莱德-&lt;br /&gt;
&lt;br /&gt;
'''Computational sociology''' is a branch of [[sociology]] that uses computationally intensive methods to analyze and model social phenomena. Using [[computer simulation]]s, [[artificial intelligence]], complex statistical methods, and analytic approaches like [[social network analysis]], computational sociology develops and tests theories of complex social processes through bottom-up modeling of social interactions.&amp;lt;ref name=&amp;quot;MW&amp;quot;&amp;gt;{{cite journal|doi=10.1146/annurev.soc.28.110601.141117|title=From Factors to Actors: Computational Sociology and Agent-Based Modeling |first1=Michael W. |last1=Macy |first2=Robert |last2=Willer |journal=Annual Review of Sociology |volume=28 |pages=143–166 |jstor=3069238|year=2002}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Computational sociology is a branch of sociology that uses computationally intensive methods to analyze and model social phenomena. Using computer simulations, artificial intelligence, complex statistical methods, and analytic approaches like social network analysis, computational sociology develops and tests theories of complex social processes through bottom-up modeling of social interactions.&lt;br /&gt;
&lt;br /&gt;
'''计算社会学 Computational Sociology''' 是社会学的一个分支，它使用计算密集型方法来分析和模拟社会现象。&amp;lt;font color='red'&amp;gt;计算社会学通过使用计算机模拟、人工智能、复杂统计方法以及社会网络分析等分析方法自下而上地建立社会互动模型，是建立并检验复杂社会过程的理论。&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;  借助计算机模拟、人工智能、复杂统计方法以及社会网络分析等分析方法，计算社会学通过自下而上地建立社会互动模型来发展和检验关于复杂社会过程的理论。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
It involves the understanding of social agents, the interaction among these agents, and the effect of these interactions on the social aggregate.&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;&amp;gt;{{cite book|last1=Gilbert |first1=Nigel |last2=Troitzsch |first2=Klaus |year=2005 |title=Simulation for Social Scientists |edition=2 |chapter=Simulation and social science |publisher=Open University Press |chapter-url=http://cress.soc.surrey.ac.uk/s4ss/}}&amp;lt;/ref&amp;gt; Although the subject matter and methodologies in [[social science]] differ from those in [[natural science]] or [[computer science]], several of the approaches used in contemporary [[social simulation]] originated from fields such as [[physics]] and [[artificial intelligence]].&amp;lt;ref name=&amp;quot;Artificial Societies&amp;quot;&amp;gt;{{cite book|last1=Epstein |first1=Joshua M. |last2=Axtell |first2=Robert |year=1996 |title=Growing Artificial Societies: Social Science from the Bottom Up |location=Washington DC |publisher=Brookings Institution Press|url=https://archive.org/details/growingartificia00epst|url-access=registration |isbn=978-0262050531 }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;Cooperation&amp;quot;&amp;gt;{{cite book|last1=Axelrod |first1=Robert |year=1997 |title=The Complexity of Cooperation: Agent-Based Models of Competition and Collaboration |location=Princeton, NJ |publisher=Princeton University Press}}&amp;lt;/ref&amp;gt; Some of the approaches that originated in this field have been imported into the natural sciences, such as measures of [[centrality|network centrality]] from the fields of [[social network analysis]] and [[network science]].&lt;br /&gt;
&lt;br /&gt;
It involves the understanding of social agents, the interaction among these agents, and the effect of these interactions on the social aggregate. Although the subject matter and methodologies in social science differ from those in natural science or computer science, several of the approaches used in contemporary social simulation originated from fields such as physics and artificial intelligence. Some of the approaches that originated in this field have been imported into the natural sciences, such as measures of network centrality from the fields of social network analysis and network science.&lt;br /&gt;
&lt;br /&gt;
它涉及理解社会行为主体和它们的相互作用，以及这些相互作用如何影响社会总体(--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） social aggregate--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|讨论]]） 我觉得这样翻译是ok的)。虽然社会科学的主题和方法不同于自然科学或计算机科学，但当代社会仿真模拟中使用的一些方法起源于物理学和人工智能等领域。这一领域的一些方法，如来自社会网络分析和网络科学领域的网络中心性度量方法等，早已被引入到自然科学中。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In relevant literature, computational sociology is often related to the study of [[social complexity]].&amp;lt;ref&amp;gt;{{cite journal|last=Casti |first=J |year=1999 |title=The Computer as Laboratory: Toward a Theory of Complex Adaptive Systems |journal=Complexity |volume=4 |issue=5 |pages=12–14 |doi=10.1002/(SICI)1099-0526(199905/06)4:5&amp;lt;12::AID-CPLX3&amp;gt;3.0.CO;2-4}}&amp;lt;/ref&amp;gt; Social complexity concepts such as [[complex systems]], [[non-linear]] interconnection among macro and micro process, and [[emergence]], have entered the vocabulary of computational sociology.&amp;lt;ref&amp;gt;{{cite journal|last=Goldspink |first=C |year=2002 |title=Methodological Implications of Complex Systems Approaches to Sociality: Simulation as a Foundation for Knowledge |url=http://jasss.soc.surrey.ac.uk/5/1/3.html |publisher=Journal of Artificial Societies and Social Simulation |volume=5 |issue=1}}&amp;lt;/ref&amp;gt; A practical and well-known example is the construction of a computational model in the form of an &amp;quot;[[artificial society]]&amp;quot;, by which researchers can analyze the structure of a [[Social structure|social system]].&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;Generative&amp;quot;&amp;gt;{{cite book|last=Epstein |first=Joshua |year=2007 |title=Generative Social Science: Studies in Agent-Based Computational Modeling |location=Princeton, NJ |publisher=Princeton University Press|url=https://www.researchgate.net/publication/283615593}}&lt;br /&gt;
&lt;br /&gt;
In relevant literature, computational sociology is often related to the study of social complexity. Social complexity concepts such as complex systems, non-linear interconnection among macro and micro process, and emergence, have entered the vocabulary of computational sociology. A practical and well-known example is the construction of a computational model in the form of an &amp;quot;artificial society&amp;quot;, by which researchers can analyze the structure of a social system.&lt;br /&gt;
&lt;br /&gt;
在相关文献中，计算社会学经常与社会复杂性的研究有关。复杂系统、宏观和微观过程之间的非线性关联、涌现等社会复杂性概念已经进入计算社会学的词汇。一个实际而著名的例子是建立“'''人工社会 Artificial Society'''”的计算模型，通过它研究人员可以分析一个社会系统的结构。 &lt;br /&gt;
&lt;br /&gt;
While editing this lead/intro, please keep your text ABOVE this line - this will make it easier to automatically insert the lede into other articles - thanks!  &lt;br /&gt;
&lt;br /&gt;
While editing this lead/intro, please keep your text ABOVE this line - this will make it easier to automatically insert the lede into other articles - thanks!  &lt;br /&gt;
&lt;br /&gt;
当编辑这个引导 / 介绍，请保持你的文本以上这一行-这将使它更容易自动插入到其他文章的莱德-谢谢！&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;&amp;lt;/onlyinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;&amp;lt;/onlyinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
-- / 只包括&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==History 历史==&lt;br /&gt;
&lt;br /&gt;
{{see also|Sociology and complexity science}}&lt;br /&gt;
&lt;br /&gt;
[[File:Complexity-map-with-sociolo.png|thumb|right|300px|Historical map of research paradigms and associated scientists in [[sociology and complexity science]].]]&lt;br /&gt;
&lt;br /&gt;
Historical map of research paradigms and associated scientists in [[sociology and complexity science.]]&lt;br /&gt;
&lt;br /&gt;
【图1：Historical map of research paradigms and associated scientists in [[sociology and complexity science＋社会学和复杂性中的研究范式和科学家的历史地图】&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Background 背景===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In the past four decades, computational sociology has been introduced and gaining popularity {{According to whom|date=June 2017}}.  This has been used primarily for modeling or building explanations of social processes and are depending on the emergence of complex behavior from simple activities.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;&amp;gt;Salgado, Mauricio, and Nigel Gilbert. &amp;quot;[http://epubs.surrey.ac.uk/749319/1/Emergence%20and%20Communication%20-%20V3%201.pdf Emergence and communication in computational sociology].&amp;quot; Journal for the Theory of Social Behaviour 43.1 (2013): 87-110.&amp;lt;/ref&amp;gt;  The idea behind emergence is that properties of any bigger system do not always have to be properties of the components that the system is made of.&amp;lt;ref&amp;gt;Macy, Michael W., and Robert Willer. &amp;quot;[http://sct.uab.cat/lsds/sites/sct.uab.cat.lsds/files/FROM%20FACTORS%20TO%20ACTORS%20(Macy%20and%20Willer%202002).pdf From factors to actors: computational sociology and agent-based modeling].&amp;quot; Annual review of sociology 28.1 (2002): 143-166.&amp;lt;/ref&amp;gt;  The people responsible for the introduction of the idea of emergence are Alexander, Morgan, and Broad, who were classical emergentists.  The time at which these emergentists came up with this concept and method was during the time of the early twentieth century.  The aim of this method was to find a good enough accommodation between two different and extreme ontologies, which were reductionist materialism and dualism.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;/&amp;gt; &lt;br /&gt;
&lt;br /&gt;
In the past four decades, computational sociology has been introduced and gaining popularity.  This has been used primarily for modeling or building explanations of social processes and are depending on the emergence of complex behavior from simple activities.  The idea behind emergence is that properties of any bigger system do not always have to be properties of the components that the system is made of.  The people responsible for the introduction of the idea of emergence are Alexander, Morgan, and Broad, who were classical emergentists.  The time at which these emergentists came up with this concept and method was during the time of the early twentieth century.  The aim of this method was to find a good enough accommodation between two different and extreme ontologies, which were reductionist materialism and dualism. &lt;br /&gt;
&lt;br /&gt;
在过去的四十年里，计算社会学诞生并且越来越受欢迎。这主要用于建模或构建社会过程的解释，并且依赖于从简单活动中'''涌现 Emergence'''的复杂行为。涌现背后的思想是，任何较大系统不总是必须和组成系统的部分具有一样的性质。引入涌现思想的人是亚历山大 Alexander、摩根 Morgan和布罗德 Broad，他们都是'''经典涌现主义者 Classical Emergentists'''。经典涌现主义者提出这个概念和方法的时间是在二十世纪初期。这种方法的目的是在还原论的唯物主义和二元论这两种不同的本体论之间找到一个足够好的调和。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
While emergence has had a valuable and important role with the foundation of Computational Sociology, there are those who do not necessarily agree.  One major leader in the field, Epstein, doubted the use because there were aspects that are unexplainable.  Epstein put up a claim against emergentism, in which he says it &amp;quot;is precisely the generative sufficiency of the parts that constitutes the whole's explanation&amp;quot;.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
While emergence has had a valuable and important role with the foundation of Computational Sociology, there are those who do not necessarily agree.  One major leader in the field, Epstein, doubted the use because there were aspects that are unexplainable.  Epstein put up a claim against emergentism, in which he says it &amp;quot;is precisely the generative sufficiency of the parts that constitutes the whole's explanation&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
虽然涌现在计算社会学的建立上发挥了宝贵而重要的作用，但也有人不太同意。该领域的一个主要人物爱泼斯坦 Epstein对这种&amp;lt;font color='red'&amp;gt;用法&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;概念&amp;lt;/font&amp;gt;持怀疑态度，因为有些方面是这个&amp;lt;font color='red'&amp;gt;用法&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;概念&amp;lt;/font&amp;gt;无法解释的。爱泼斯坦提出了一种反对“涌现主义”的观点，他表示:“&amp;lt;font color=='red'&amp;gt;正是这些部分的有生成意义的充分性构成了对整体的解释&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;  正是这些部分所产生的充分性构成了对整体的解释&amp;lt;/font&amp;gt;”。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Agent-based models have had a historical influence on Computational Sociology.   These models first came around in the 1960s, and were used to simulate control and feedback processes in organizations, cities, etc.  During the 1970s, the application introduced the use of individuals as the main units for the analyses and used bottom-up strategies for modeling behaviors.  The last wave occurred in the 1980s.  At this time, the models were still bottom-up; the only difference is that the agents interact interdependently.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Agent-based models have had a historical influence on Computational Sociology. These models first came around in the 1960s, and were used to simulate control and feedback processes in organizations, cities, etc.  During the 1970s, the application introduced the use of individuals as the main units for the analyses and used bottom-up strategies for modeling behaviors.  The last wave occurred in the 1980s.  At this time, the models were still bottom-up; the only difference is that the agents interact interdependently.&lt;br /&gt;
&lt;br /&gt;
'''基于主体的模型 Agent-based Models'''对计算社会学有着历史性的影响。这些模型最早出现在20世纪60年代，用于仿真模拟组织、城市等系统的控制和反馈过程。在20世纪70年代，应用程序引入个体作为主要的分析单元，并使用自下而上的策略来对行为建模。最后一波浪潮发生在20世纪80年代。那时，模型仍然是自下而上的; 唯一的区别是主体之间具有互相依赖和相互作用。&lt;br /&gt;
&lt;br /&gt;
===Systems theory and structural functionalism 系统理论和结构功能主义===&lt;br /&gt;
&lt;br /&gt;
{{main|Systems theory|Structural functionalism}}&lt;br /&gt;
&lt;br /&gt;
In the post-war era, [[Vannevar Bush]]'s [[differential analyser]], [[John von Neumann]]'s [[Von Neumann cellular automata|cellular automata]], [[Norbert Wiener]]'s [[cybernetics]], and [[Claude Shannon]]'s [[information theory]] became influential paradigms for modeling and understanding complexity in technical systems. In response, scientists in disciplines such as physics, biology, electronics, and economics began to articulate a [[systems theory|general theory of systems]] in which all natural and physical phenomena are manifestations of interrelated elements in a system that has common patterns and properties. Following [[Émile Durkheim]]'s call to analyze complex modern society ''[[sui generis]]'',&amp;lt;ref&amp;gt;{{cite book|first=Émile |last=Durkheim |title=The Division of Labor in Society |location=New York, NY |publisher=Macmillan}}&amp;lt;/ref&amp;gt; post-war structural functionalist sociologists such as [[Talcott Parsons]] seized upon these theories of systematic and hierarchical interaction among constituent components to attempt to generate grand unified sociological theories, such as the [[AGIL paradigm]].&amp;lt;ref name=&amp;quot;Bailey&amp;quot;&amp;gt;{{cite book|first1=Kenneth D. |last1=Bailey |editor=Jonathan H. Turner |chapter=Systems Theory |title=Handbook of Sociological Theory |publisher=Springer Science |year=2006 |location=New York, NY |isbn=978-0-387-32458-6 |pages=379–404}}&amp;lt;/ref&amp;gt; Sociologists such as [[George Homans]] argued that sociological theories should be formalized into hierarchical structures of propositions and precise terminology from which other propositions and hypotheses could be derived and operationalized into empirical studies.&amp;lt;ref name=&amp;quot;Blackwell&amp;quot;&amp;gt;{{cite encyclopedia|year=2007 |title=Computational Sociology |last=Bainbridge |first=William Sims |encyclopedia=Blackwell Encyclopedia of Sociology |publisher=Blackwell Reference Online |url=http://www.sociologyencyclopedia.com/subscriber/tocnode?id=g9781405124331_chunk_g97814051243319_ss1-85 |doi=10.1111/b.9781405124331.2007.x |hdl=10138/224218 |editor=Ritzer, George|isbn=978-1-4051-2433-1|hdl-access=free }}&amp;lt;/ref&amp;gt; Because computer algorithms and programs had been used as early as 1956 to test and validate mathematical theorems, such as the [[four color theorem]],&amp;lt;ref&amp;gt;{{cite book|last=Crevier |first=D. |year=1993 |title=AI: The Tumultuous History of the Search for Artificial Intelligence |url=https://archive.org/details/aitumultuoushist00crev |url-access=registration |publisher=Basic Books |location=New York, NY}}&amp;lt;/ref&amp;gt; some scholars anticipated that similar computational approaches could &amp;quot;solve&amp;quot; and &amp;quot;prove&amp;quot; analogously formalized problems and theorems of social structures and dynamics.&lt;br /&gt;
&lt;br /&gt;
In the post-war era, Vannevar Bush's differential analyser, John von Neumann's cellular automata, Norbert Wiener's cybernetics, and Claude Shannon's information theory became influential paradigms for modeling and understanding complexity in technical systems. In response, scientists in disciplines such as physics, biology, electronics, and economics began to articulate a general theory of systems in which all natural and physical phenomena are manifestations of interrelated elements in a system that has common patterns and properties. Following Émile Durkheim's call to analyze complex modern society sui generis, post-war structural functionalist sociologists such as Talcott Parsons seized upon these theories of systematic and hierarchical interaction among constituent components to attempt to generate grand unified sociological theories, such as the AGIL paradigm. Sociologists such as George Homans argued that sociological theories should be formalized into hierarchical structures of propositions and precise terminology from which other propositions and hypotheses could be derived and operationalized into empirical studies. Because computer algorithms and programs had been used as early as 1956 to test and validate mathematical theorems, such as the four color theorem, some scholars anticipated that similar computational approaches could &amp;quot;solve&amp;quot; and &amp;quot;prove&amp;quot; analogously formalized problems and theorems of social structures and dynamics.&lt;br /&gt;
&lt;br /&gt;
战后时期，范内瓦·布什（Vannevar Bush）的'''微分分析机 Differential Analyser''' 、冯·诺伊曼（John von Neumann）的'''元胞自动机 Cellular Automata'''、 维纳（Norbert Wiener）的'''控制论 Cybernetics'''和克劳德·香农（Claude Shannon）的'''信息论 Information Theory'''成为技术系统中建模和理解复杂性的重要范式。物理学、生物学、电子学和经济学等学科的科学家开始阐述系统的一般理论，即所有自然和物理现象都是具有共同模式和属性的系统中相互关联的元素的表现。&amp;lt;font color='red'&amp;gt;按照 &amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 沿着&amp;lt;/font&amp;gt;涂尔干（Émile Durkheim）分析特定的复杂现代社会&lt;br /&gt;
&lt;br /&gt;
（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]）Following Émile Durkheim's call to analyze complex modern society sui generis）&lt;br /&gt;
  --~~克劳德·香农（Claude Shannon）  这些同样去括号&lt;br /&gt;
&lt;br /&gt;
的&amp;lt;font color='red'&amp;gt;要求&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 思路&amp;lt;/font&amp;gt;，战后结构功能主义社会学家如帕森斯（Talcott Parsons）利用这些组成部分之间系统&amp;lt;font color='blue'&amp;gt;化&amp;lt;/font&amp;gt;和&amp;lt;font color='red'&amp;gt;等级&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 层次化&amp;lt;/font&amp;gt;相互作用的理论，试图产生大统一的社会学理论，如 AGIL 范式。霍曼斯（George Homans）等社会学家认为，社会学理论应该被构建为具有&amp;lt;font color='blue'&amp;gt;逻辑&amp;lt;/font&amp;gt;命题和精确术语的&amp;lt;font color='red'&amp;gt;等级&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 层次化&amp;lt;/font&amp;gt;结构，并且从中可以得出能够在实证研究中被操作化的其他命题和假设。由于早在1956年计算机算法和程序就已经被用来测试和验证数学定理（如'''四色定理Four Color Theorem'''），一些学者预计相似的计算方法可以“解决”和“证明”类似的社会结构和&amp;lt;font color='red'&amp;gt;动态&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 演变&amp;lt;/font&amp;gt;的&amp;lt;font color='blue'&amp;gt;形式化&amp;lt;/font&amp;gt;问题和定理。&lt;br /&gt;
&lt;br /&gt;
===Macrosimulation and microsimulation 宏观模拟和微观模拟===&lt;br /&gt;
&lt;br /&gt;
{{main|System dynamics|Microsimulation}}&lt;br /&gt;
&lt;br /&gt;
By the late 1960s and early 1970s, social scientists used increasingly available computing technology to perform macro-simulations of control and feedback processes in organizations, industries, cities, and global populations. These models used differential equations to predict population distributions as holistic functions of other systematic factors such as inventory control, urban traffic, migration, and disease transmission.&amp;lt;ref&amp;gt;{{cite book|first=Jay |last=Forrester |year=1971 |title=World Dynamics |location=Cambridge, MA |publisher=MIT Press}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|doi=10.1287/opre.26.2.237|title=Using Simulation to Develop and Validate Analytic Models: Some Case Studies |first1=Edward J. |last1=Ignall |first2=Peter |last2=Kolesar |first3=Warren E. |last3=Walker |journal=Operations Research |volume=26 |issue=2 |year=1978 |pages=237–253}}&amp;lt;/ref&amp;gt; Although simulations of social systems received substantial attention in the mid-1970s after the [[Club of Rome]] published reports predicting that policies promoting exponential economic growth would eventually bring global environmental catastrophe,&amp;lt;ref&amp;gt;{{cite book|title=The Dynamics of Growth in a Finite World |last1=Meadows |first1=DL |last2=Behrens |first2=WW |last3=Meadows |first3=DH |last4=Naill |first4=RF |last5= Randers |first5=J |last6=Zahn |first6=EK |year=1974 |location=Cambridge, MA |publisher=MIT Press}}&amp;lt;/ref&amp;gt; the inconvenient conclusions led many authors to seek to discredit the models, attempting to make the researchers themselves appear unscientific.&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;/&amp;gt;&amp;lt;ref&amp;gt;{{cite news|title=Computer View of Disaster Is Rebutted |newspaper=The New York Times |date=October 18, 1974|url=https://www.nytimes.com/1974/10/18/archives/computer-view-of-disaster-is-rebutted.html?_r=0}}&amp;lt;/ref&amp;gt; Hoping to avoid the same fate, many social scientists turned their attention toward micro-simulation models to make forecasts and study policy effects by modeling aggregate changes in state of individual-level entities rather than the changes in distribution at the population level.&amp;lt;ref&amp;gt;{{cite journal|doi=10.1016/0167-2681(90)90038-F|title=From engineering to microsimulation : An autobiographical reflection |journal=Journal of Economic Behavior &amp;amp; Organization |year=1990 |volume=14 |issue=1 |pages=5–27 |first=Guy H. |last=Orcutt}}&amp;lt;/ref&amp;gt; However, these micro-simulation models did not permit individuals to interact or adapt and were not intended for basic theoretical research.&amp;lt;ref name=&amp;quot;MW&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
By the late 1960s and early 1970s, social scientists used increasingly available computing technology to perform macro-simulations of control and feedback processes in organizations, industries, cities, and global populations. These models used differential equations to predict population distributions as holistic functions of other systematic factors such as inventory control, urban traffic, migration, and disease transmission. Although simulations of social systems received substantial attention in the mid-1970s after the Club of Rome published reports predicting that policies promoting exponential economic growth would eventually bring global environmental catastrophe, the inconvenient conclusions led many authors to seek to discredit the models, attempting to make the researchers themselves appear unscientific. Hoping to avoid the same fate, many social scientists turned their attention toward micro-simulation models to make forecasts and study policy effects by modeling aggregate changes in state of individual-level entities rather than the changes in distribution at the population level. However, these micro-simulation models did not permit individuals to interact or adapt and were not intended for basic theoretical research.&lt;br /&gt;
&lt;br /&gt;
截至20世纪60年代末70年代初，社会科学家越来越多地使用已有的计算技术，在组织、工业、城市和全球人口中进行控制和反馈过程的'''宏观模拟 Macrosimulation''' 。这些模型使用微分方程作为其他系统因素的整体函数来预测人口分布，这些系统因素包括库存控制、城市交通、人口迁移和疾病传播等。20世纪70年代中期，'''罗马俱乐部 Club of Rome''' 发表报告预测，促进指数式经济增长的政策最终将导致全球环境灾难，这个悲观的结论导致许多研究者试图反驳这些模型，并试图让研究显得不那么科学。&lt;br /&gt;
  （--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） 根据意思，inconvenient译为悲观的，因为这个结论预示了悲观的未来，所以令指出这一点的科学家们感到inconvenient）&lt;br /&gt;
为了避免同样的情况，许多社会科学家将注意力转向'''微观模拟 Microsimulation'''模型。这些模型通过模拟个体状态的总体变化而不是总体人口级别的变化来进行预测和研究政策的效果。然而，这些微观模拟模型并不允许个体相互作用或适应、变化（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]）变化是根据适应（adapt）加上去的，不知道是否合理），研究者也不打算将它们用于基础理论研究。&lt;br /&gt;
&lt;br /&gt;
===Cellular automata and agent-based modeling 元胞自动机和基于主体建模===&lt;br /&gt;
&lt;br /&gt;
{{main|Cellular automata|agent-based modeling}}&lt;br /&gt;
&lt;br /&gt;
The 1970s and 1980s were also a time when physicists and mathematicians were attempting to model and analyze how simple component units, such as atoms, give rise to global properties, such as complex material properties at low temperatures, in magnetic materials, and within turbulent flows.&amp;lt;ref&amp;gt;{{cite book|title=Cellular automata machines: a new environment for modeling |url=https://archive.org/details/cellularautomata00toff |url-access=registration |first1=Tommaso |last1=Toffoli |first2=Norman |last2=Margolus | author2-link = Norman Margolus |year=1987 |publisher=MIT Press |location=Cambridge, MA}}&amp;lt;/ref&amp;gt; Using cellular automata, scientists were able to specify systems consisting of a grid of cells in which each cell only occupied some finite states and changes between states were solely governed by the states of immediate neighbors. Along with advances in [[artificial intelligence]] and [[microcomputer]] power, these methods contributed to the development of &amp;quot;[[chaos theory]]&amp;quot; and &amp;quot;[[complex systems|complexity theory]]&amp;quot; which, in turn, renewed interest in understanding complex physical and social systems across disciplinary boundaries.&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;/&amp;gt; Research organizations explicitly dedicated to the interdisciplinary study of complexity were also founded in this era: the [[Santa Fe Institute]] was established in 1984 by scientists based at [[Los Alamos National Laboratory]] and the BACH group at the [[University of Michigan]] likewise started in the mid-1980s.&lt;br /&gt;
&lt;br /&gt;
The 1970s and 1980s were also a time when physicists and mathematicians were attempting to model and analyze how simple component units, such as atoms, give rise to global properties, such as complex material properties at low temperatures, in magnetic materials, and within turbulent flows. Using cellular automata, scientists were able to specify systems consisting of a grid of cells in which each cell only occupied some finite states and changes between states were solely governed by the states of immediate neighbors. Along with advances in artificial intelligence and microcomputer power, these methods contributed to the development of &amp;quot;chaos theory&amp;quot; and &amp;quot;complexity theory&amp;quot; which, in turn, renewed interest in understanding complex physical and social systems across disciplinary boundaries. Research organizations explicitly dedicated to the interdisciplinary study of complexity were also founded in this era: the Santa Fe Institute was established in 1984 by scientists based at Los Alamos National Laboratory and the BACH group at the University of Michigan likewise started in the mid-1980s.&lt;br /&gt;
&lt;br /&gt;
20世纪70年代和80年代，物理学家和数学家也在试图模拟和分析简单的组成单位如何产生整体特性，比如低温环境中原子在磁性材料和湍流中的复杂材料特性。使用'''元胞自动机 Cellular Automata'''，科学家们能够指定由元胞网格组成的系统，其中每个元胞只占据一些有限的状态，状态之间的变化完全由相邻元胞的状态控制。随着人工智能和微型计算机能力的进步，这些方法促进了“混沌理论”和“复杂性理论”的发展，这反过来又重新引起了人们对跨学科的复杂物理和社会系统的兴趣。明确致力于跨学科复杂性研究的机构也是在这个时代成立的: 圣菲研究所是由美国洛斯阿拉莫斯国家实验室（Los Alamos National Laboratory）的科学家于1984年建立的，密歇根大学的 BACH 小组也是在20世纪80年代中期建立的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This cellular automata paradigm gave rise to a third wave of social simulation emphasizing agent-based modeling. Like micro-simulations, these models emphasized bottom-up designs but adopted four key assumptions that diverged from microsimulation: autonomy, interdependency, simple rules, and adaptive behavior.&amp;lt;ref name=&amp;quot;MW&amp;quot;/&amp;gt; Agent-based models are less concerned with predictive accuracy and instead emphasize theoretical development.&amp;lt;ref&amp;gt;{{cite journal |title=A simulation of the structure of academic science |journal=Sociological Research Online |volume=2 |issue=2 |pages=1–15 |year=1997 |first=Nigel |last=Gilbert |url=http://www.socresonline.org.uk/socresonline/2/2/3.html |doi=10.5153/sro.85 |access-date=2009-12-16 |archive-url=https://web.archive.org/web/19980524062306/http://www.socresonline.org.uk/socresonline/2/2/3.html |archive-date=1998-05-24 |url-status=dead }}&amp;lt;/ref&amp;gt; In 1981, mathematician and political scientist [[Robert Axelrod]] and evolutionary biologist [[W.D. Hamilton]] published a major paper in ''[[Science (journal)|Science]]'' titled &amp;quot;The Evolution of Cooperation&amp;quot; which used an agent-based modeling approach to demonstrate how social cooperation based upon reciprocity can be established and stabilized in a [[prisoner's dilemma]] game when agents followed simple rules of self-interest.&amp;lt;ref&amp;gt;{{cite journal|title=The Evolution of Cooperation |first1=Robert |last1=Axelrod |first2=William D. |last2=Hamilton |journal=Science |volume=211 |issue=4489 |pages=1390–1396 |doi=10.1126/science.7466396|pmid=7466396 |date=March 27, 1981|bibcode=1981Sci...211.1390A }}&amp;lt;/ref&amp;gt; Axelrod and Hamilton demonstrated that individual agents following a simple rule set of (1) cooperate on the first turn and (2) thereafter replicate the partner's previous action were able to develop &amp;quot;norms&amp;quot; of cooperation and sanctioning in the absence of canonical sociological constructs such as demographics, values, religion, and culture as preconditions or mediators of cooperation.&amp;lt;ref name=&amp;quot;Cooperation&amp;quot;/&amp;gt; Throughout the 1990s, scholars like [[William Sims Bainbridge]], [[Kathleen Carley]], [[Michael Macy]],  and [[John Skvoretz]] developed multi-agent-based models of [[generalized reciprocity]], [[prejudice]], [[social influence]], and organizational [[information processing]]. In 1999, [[Nigel Gilbert]] published the first textbook on Social Simulation: ''Simulation for the social scientist'' and established its most relevant journal: the [[Journal of Artificial Societies and Social Simulation]].&lt;br /&gt;
&lt;br /&gt;
This cellular automata paradigm gave rise to a third wave of social simulation emphasizing agent-based modeling. Like micro-simulations, these models emphasized bottom-up designs but adopted four key assumptions that diverged from microsimulation: autonomy, interdependency, simple rules, and adaptive behavior. In 1981, mathematician and political scientist Robert Axelrod and evolutionary biologist W.D. Hamilton published a major paper in Science titled &amp;quot;The Evolution of Cooperation&amp;quot; which used an agent-based modeling approach to demonstrate how social cooperation based upon reciprocity can be established and stabilized in a prisoner's dilemma game when agents followed simple rules of self-interest. Axelrod and Hamilton demonstrated that individual agents following a simple rule set of (1) cooperate on the first turn and (2) thereafter replicate the partner's previous action were able to develop &amp;quot;norms&amp;quot; of cooperation and sanctioning in the absence of canonical sociological constructs such as demographics, values, religion, and culture as preconditions or mediators of cooperation. Throughout the 1990s, scholars like William Sims Bainbridge, Kathleen Carley, Michael Macy,  and John Skvoretz developed multi-agent-based models of generalized reciprocity, prejudice, social influence, and organizational information processing. In 1999, Nigel Gilbert published the first textbook on Social Simulation: Simulation for the social scientist and established its most relevant journal: the Journal of Artificial Societies and Social Simulation.&lt;br /&gt;
&lt;br /&gt;
元胞自动机范式引发了强调'''基于主体建模 Agent-based Modeling'''的第三次社会模拟浪潮。与微观模拟一样，这些模型强调自下而上的设计，但采用了与微观模拟不同的四个关键假设: '''自主性 Autonomy'''、'''相互依赖性 Interdependency'''、'''简单规则 Simple Rules'''和'''适应性行为 Adaptive Behavior'''。1981年，数学家、政治学家阿克塞尔罗德（Robert Axelrod）和进化生物学家汉密尔顿（W.D. Hamilton）在《科学》杂志上发表了一篇名为《合作的进化》（The Evolution of Cooperation）的重要论文，该论文采用基于主体建模方法，论证了在一个囚徒困境中，当主体遵循简单的自利规则时，互惠的社会合作是如何建立和稳定的。阿克塞尔罗德和汉密尔顿证明，主体遵循这样一套简单的规则: (1)在第一轮进行合作，(2)在其后重复伙伴以前的行动，能够在没有人口学差异、价值观、宗教和文化等社会规范作为合作的先决条件或中介的情况下制定合作和制裁的“规范”。整个20世纪90年代，像威廉·希姆斯·本布里奇（William Sims Bainbridge），Kathleen Carley，Michael Macy 和 John Skvoretz 这样的学者开发了基于多主体的广义互惠、偏见、社会影响和组织信息处理模型。1999年，吉尔伯特（Nigel Gilbert）出版了第一本关于社会模拟: 写给社会科学家的仿真模拟（Simulation for the social scientist）的教科书，并建立了它最相关的杂志: 人工社会和社会模拟杂志（the Journal of Artificial Societies and Social Simulation）。&lt;br /&gt;
&lt;br /&gt;
===Data mining and social network analysis 数据挖掘和社会网络分析===&lt;br /&gt;
&lt;br /&gt;
{{main|Data mining|Social network analysis}}&lt;br /&gt;
&lt;br /&gt;
--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） 少一段原文 &lt;br /&gt;
Independent from developments in computational models of social systems, social network analysis emerged in the 1970s and 1980s from advances in graph theory, statistics, and studies of social structure as a distinct analytical method and was articulated and employed by sociologists like James S. Coleman, Harrison White, Linton Freeman, J. Clyde Mitchell, Mark Granovetter, Ronald Burt, and Barry Wellman.[22] The increasing pervasiveness of computing and telecommunication technologies throughout the 1980s and 1990s demanded analytical techniques, such as network analysis and multilevel modeling, that could scale to increasingly complex and large data sets. The most recent wave of computational sociology, rather than employing simulations, uses network analysis and advanced statistical techniques to analyze large-scale computer databases of electronic proxies for behavioral data. Electronic records such as email and instant message records, hyperlinks on the World Wide Web, mobile phone usage, and discussion on Usenet allow social scientists to directly observe and analyze social behavior at multiple points in time and multiple levels of analysis without the constraints of traditional empirical methods such as interviews, participant observation, or survey instruments.[23] Continued improvements in machine learning algorithms likewise have permitted social scientists and entrepreneurs to use novel techniques to identify latent and meaningful patterns of social interaction and evolution in large electronic datasets.[24][25]&lt;br /&gt;
&lt;br /&gt;
Independent from developments in computational models of social systems, social network analysis emerged in the 1970s and 1980s from advances in graph theory, statistics, and studies of social structure as a distinct analytical method and was articulated and employed by sociologists like [[James Samuel Coleman|James S. Coleman]], [[Harrison White]], [[Linton Freeman]], [[J. Clyde Mitchell]], [[Mark Granovetter]], [[Ronald Burt]], and [[Barry Wellman]].&amp;lt;ref&amp;gt;{{cite book|title=The Development of Social Network Analysis: A Study in the Sociology of Science |first=Linton C. |last=Freeman |publisher=Empirical Press |location=Vancouver, BC |year=2004}}&amp;lt;/ref&amp;gt; The increasing pervasiveness of computing and telecommunication technologies throughout the 1980s and 1990s demanded analytical techniques, such as [[network theory|network analysis]] and [[multilevel modeling]], that could scale to increasingly complex and large data sets. The most recent wave of computational sociology, rather than employing simulations, uses network analysis and advanced statistical techniques to analyze large-scale computer databases of electronic proxies for behavioral data. Electronic records such as email and instant message records, hyperlinks on the [[World Wide Web]], mobile phone usage, and discussion on [[Usenet]] allow social scientists to directly observe and analyze social behavior at multiple points in time and multiple levels of analysis without the constraints of traditional empirical methods such as interviews, participant observation, or survey instruments.&amp;lt;ref&amp;gt;{{cite journal|title=Life in the network: the coming age of computational social science|first9=J|last10=Gutmann|first10=M.|last11=Jebara|first11=T.|last12=King|first12=G.|last13=Macy|first13=M.|last14=Roy|first14=D.|last15=Van Alstyne|first15=M.|last9=Fowler|first8=N|last8=Contractor|first7=N|last7=Christakis|first6=D|last6=Brewer|first5=AL|last5=Barabasi|first4=S |journal=Science|last4=Aral |date=February 6, 2009|first3=L |volume=323|pmid=19197046 |issue=5915|last3=Adamic |pages=721–723|pmc=2745217 |doi=10.1126/science.1167742 |first1=David |last1=Lazer |first2=Alex |last2=Pentland |display-authors=8}}&amp;lt;/ref&amp;gt; Continued improvements in [[machine learning]] algorithms likewise have permitted social scientists and entrepreneurs to use novel techniques to identify latent and meaningful patterns of social interaction and evolution in large electronic datasets.&amp;lt;ref&amp;gt;{{cite journal|first1=Jaideep |last1=Srivastava |first2=Robert |last2=Cooley |first3=Mukund |last3=Deshpande |first4=Pang-Ning |last4=Tan |journal=Proceedings of the ACM Conference on Knowledge Discovery and Data Mining |title=Web usage mining: discovery and applications of usage patterns from Web data|volume=1 |year=2000 |pages=12–23 |doi=10.1145/846183.846188|issue=2}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|doi=10.1016/S0169-7552(98)00110-X|title=The anatomy of a large-scale hypertextual Web search engine |first1=Sergey |last1=Brin |first2=Lawrence |last2=Page |journal=Computer Networks and ISDN Systems |volume=30 |issue=1–7 |pages=107–117 |date=April 1998|citeseerx=10.1.1.115.5930 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Independent from developments in computational models of social systems, social network analysis emerged in the 1970s and 1980s from advances in graph theory, statistics, and studies of social structure as a distinct analytical method and was articulated and employed by sociologists like James S. Coleman, Harrison White, Linton Freeman, J. Clyde Mitchell, Mark Granovetter, Ronald Burt, and Barry Wellman. The increasing pervasiveness of computing and telecommunication technologies throughout the 1980s and 1990s demanded analytical techniques, such as network analysis and multilevel modeling, that could scale to increasingly complex and large data sets. The most recent wave of computational sociology, rather than employing simulations, uses network analysis and advanced statistical techniques to analyze large-scale computer databases of electronic proxies for behavioral data. Electronic records such as email and instant message records, hyperlinks on the World Wide Web, mobile phone usage, and discussion on Usenet allow social scientists to directly observe and analyze social behavior at multiple points in time and multiple levels of analysis without the constraints of traditional empirical methods such as interviews, participant observation, or survey instruments. Continued improvements in machine learning algorithms likewise have permitted social scientists and entrepreneurs to use novel techniques to identify latent and meaningful patterns of social interaction and evolution in large electronic datasets.&lt;br /&gt;
&lt;br /&gt;
'''社会网络分析 Social Network Analysis'''独立于社会系统计算模型的发展，在20世纪70年代和80年代出现于图论、统计学和社会结构的研究中，它作为一种独特的分析方法被社会学家如 James s. Coleman，Harrison White，Linton Freeman，J. Clyde Mitchell，Mark Granovetter，Ronald Burt 和 Barry Wellman 等阐述和采用。在整个1980年代和1990年代，计算和通信技术日益普及，这要求采用诸如网络分析和多级建模等分析技术，这些技术可以扩展到日益复杂和庞大的数据集中。最近的计算社会学没有使用模拟，而是使用网络分析和先进的统计技术来分析大规模计算机数据库中电子代理的行为数据。电子记录，如电子邮件和即时消息记录，万维网上的超链接，移动电话数据，以及 Usenet 上的讨论，使社会科学家能够直接观察社会行为并在多个时间点和多个层次的分析行为，并且不受传统的实证方法，如访谈、观察（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]）为了通顺，删除研究对象/被试：participants）或调查工具的限制。机器学习算法的不断改进同样使得社会科学家和企业家能够使用新技术来识别大型电子数据集中潜在但有意义的社会互动和演化模式。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:Tripletsnew2012.png|thumb|right|Narrative network of US Elections 2012&amp;lt;ref name=&amp;quot;ReferenceA&amp;quot;&amp;gt;{{cite journal|title=Automated analysis of the US presidential elections using Big Data and network analysis|author1=S Sudhahar|author2=GA Veltri|author3=N Cristianini|journal=Big Data &amp;amp; Society|volume=2|issue=1|pages=1–28|year=2015|doi=10.1177/2053951715572916|doi-access=free}}&amp;lt;/ref&amp;gt;]]&lt;br /&gt;
&lt;br /&gt;
Narrative network of US Elections 2012&lt;br /&gt;
&lt;br /&gt;
【图2：Narrative network of US Elections 2012 + 2012年美国大选叙事网络】&lt;br /&gt;
&lt;br /&gt;
The automatic parsing of textual corpora has enabled the extraction of actors and their relational networks on a vast scale, turning textual data into network data.  The resulting networks, which can contain thousands of nodes, are then analysed by using tools from Network theory to identify the key actors, the key communities or parties, and general properties such as robustness or structural stability of the overall network, or centrality of certain nodes.&amp;lt;ref&amp;gt;{{cite journal|title=Network analysis of narrative content in large corpora|author1=S Sudhahar|author2=G De Fazio|author3=R Franzosi|author4=N Cristianini|journal=Natural Language Engineering|volume=21|issue=1|pages=1–32|year=2013|doi=10.1017/S1351324913000247 |url=https://research-information.bristol.ac.uk/files/129621186/Network_Analysis_of_Narrative_Content_in_Large_Corpora.pdf}}&amp;lt;/ref&amp;gt; This automates the approach introduced by quantitative narrative analysis,&amp;lt;ref&amp;gt;{{cite book|title=Quantitative Narrative Analysis|last=Franzosi|first=Roberto|publisher=Emory University|year=2010}}&amp;lt;/ref&amp;gt; whereby subject-verb-object triplets are identified with pairs of actors linked by an action, or pairs formed by actor-object.&amp;lt;ref name=&amp;quot;ReferenceA&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The automatic parsing of textual corpora has enabled the extraction of actors and their relational networks on a vast scale, turning textual data into network data.  The resulting networks, which can contain thousands of nodes, are then analysed by using tools from Network theory to identify the key actors, the key communities or parties, and general properties such as robustness or structural stability of the overall network, or centrality of certain nodes. This automates the approach introduced by quantitative narrative analysis, whereby subject-verb-object triplets are identified with pairs of actors linked by an action, or pairs formed by actor-object.&lt;br /&gt;
&lt;br /&gt;
文本语料库的自动解析使对参与者及其关系网络的大规模提取成为可能，它将文本数据转换为网络数据。由此产生的网络可以包含数千个'''节点 Nodes'''，然后利用网络理论中的工具对其进行分析，以确定关键参与者、关键群体，以及网络的总体特性如稳健性、结构稳定性，或某些节点的'''中心性 Centrality'''等。这使'''定量叙事分析Quantitative Narrative Analysis'''引入的方法得以自动化，据此，主语-动词-宾语三元组被看作由动作连接的成对行为者，或者由行为者-宾语形成的成对行为者。&lt;br /&gt;
&lt;br /&gt;
===Computational content analysis 计算机内容分析 （名词翻译可吗？）===&lt;br /&gt;
&lt;br /&gt;
[[Content analysis]] has been a traditional part of social sciences and media studies for a long time. The automation of content analysis has allowed a &amp;quot;[[big data]]&amp;quot; revolution to take place in that field, with studies in social media and newspaper content that include millions of news items. [[Gender bias]], [[readability]], content similarity, reader preferences, and even mood have been analyzed based on [[text mining]] methods over millions of documents.&amp;lt;ref&amp;gt;{{cite journal|author1=I. Flaounas|author2=M. Turchi|author3=O. Ali|author4=N. Fyson|author5=T. De Bie|author6=N. Mosdell|author7=J. Lewis|author8=N. Cristianini|title=The Structure of EU Mediasphere|journal=PLOS One|volume=5|issue=12|pages=e14243|year=2010|doi=10.1371/journal.pone.0014243|url=https://orca-mwe.cf.ac.uk/50732/1/Flaounas%202010.pdf|pmid=21170383|pmc=2999531|bibcode=2010PLoSO...514243F}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|title=Nowcasting Events from the Social Web with Statistical Learning|author1=V Lampos|author2=N Cristianini|journal=ACM Transactions on Intelligent Systems and Technology |volume=3|issue=4|page=72|doi=10.1145/2337542.2337557|year=2012|url=http://www.lampos.net/sites/default/files/papers/lampos2012nowcasting.pdf}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite conference|title=NOAM: news outlets analysis and monitoring system|author1=I. Flaounas|author2=O. Ali|author3=M. Turchi|author4=T Snowsill|author5=F Nicart|author6=T De Bie|author7=N Cristianini|conference=Proc. of the 2011 ACM SIGMOD international conference on Management of data|year=2011|url=http://www.tijldebie.net/system/files/SIGMOD_11_demo_Ilias.pdf|doi=10.1145/1989323.1989474}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite book|author=N Cristianini|title=''Combinatorial Pattern Matching''|pages=2–13|year=2011|volume=6661|series= Lecture Notes in Computer Science|isbn=978-3-642-21457-8|doi=10.1007/978-3-642-21458-5_2|chapter=Automatic Discovery of Patterns in Media Content|citeseerx=10.1.1.653.9525}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite journal|last=Lansdall-Welfare|first=Thomas|last2=Sudhahar|first2=Saatviga|last3=Thompson|first3=James|last4=Lewis|first4=Justin|last5=Team|first5=FindMyPast Newspaper|last6=Cristianini|first6=Nello|date=2017-01-09|title=Content analysis of 150 years of British periodicals|url=http://www.pnas.org/content/early/2017/01/03/1606380114|journal=Proceedings of the National Academy of Sciences|volume=114|issue=4|language=en|pages=E457–E465|doi=10.1073/pnas.1606380114|issn=0027-8424|pmid=28069962|pmc=5278459}}&amp;lt;/ref&amp;gt; The analysis of readability, gender bias and topic bias was demonstrated in Flaounas et al.&amp;lt;ref&amp;gt;{{cite journal|author1=I. Flaounas|author2=O. Ali|author3=M. Turchi|author4=T. Lansdall-Welfare|author5=T. De Bie|author6=N. Mosdell|author7=J. Lewis|author8=N. Cristianini|title=Research methods in the age of digital journalism|journal=Digital Journalism|year=2012|doi=10.1080/21670811.2012.714928|volume=1|pages=102–116}}&amp;lt;/ref&amp;gt; showing how different topics have different gender biases and levels of readability; the possibility to detect mood shifts in a vast population by analysing Twitter content was demonstrated as well.&amp;lt;ref&amp;gt;{{cite conference|title=Effects of the Recession on Public Mood in the UK|author=T Lansdall-Welfare|author2=V Lampos|author3=N Cristianini|series=Mining Social Network Dynamics (MSND) session on Social Media Applications|doi=10.1145/2187980.2188264|conference=Proceedings of the 21st International Conference on World Wide Web|pages=1221–1226|location=New York, NY, USA|url=http://www.cs.bris.ac.uk/Publications/Papers/2001521.pdf}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Content analysis has been a traditional part of social sciences and media studies for a long time. The automation of content analysis has allowed a &amp;quot;big data&amp;quot; revolution to take place in that field, with studies in social media and newspaper content that include millions of news items. Gender bias, readability, content similarity, reader preferences, and even mood have been analyzed based on text mining methods over millions of documents. The analysis of readability, gender bias and topic bias was demonstrated in Flaounas et al. showing how different topics have different gender biases and levels of readability; the possibility to detect mood shifts in a vast population by analysing Twitter content was demonstrated as well.&lt;br /&gt;
&lt;br /&gt;
长期以来，内容分析一直是社会科学和媒体研究的传统方法。内容分析的自动化使得这一领域发生了一场“大数据”革命，这些研究中，社交媒体和报纸内容包括了数百万条的新闻。基于文本挖掘方法，'''性别偏差Gender Bias'''、'''可读性 Readability'''、'''内容相似度 Content Similarity'''、'''读者偏好 Reader Preferences'''，甚至是'''情绪 Mood'''的数以百万计的文档都可以被分析。Flaounas等人对可读性、性别偏差和'''话题偏差 Topic Bias'''为主要研究对象，展示了不同的话题如何有不同水平的性别偏差和可读性; 展示了通过分析推特内容来检测人群情绪变化的可能性。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The analysis of vast quantities of historical newspaper content has been pioneered by Dzogang et al.,&amp;lt;ref&amp;gt;{{Cite journal|last=Dzogang|first=Fabon|last2=Lansdall-Welfare|first2=Thomas|last3=Team|first3=FindMyPast Newspaper|last4=Cristianini|first4=Nello|date=2016-11-08|title=Discovering Periodic Patterns in Historical News|journal=PLOS One|volume=11|issue=11|pages=e0165736|doi=10.1371/journal.pone.0165736|issn=1932-6203|pmc=5100883|pmid=27824911|bibcode=2016PLoSO..1165736D}}&amp;lt;/ref&amp;gt; which showed how periodic structures can be automatically discovered in historical newspapers. A similar analysis was performed on social media, again revealing strongly periodic structures.&amp;lt;ref&amp;gt;[https://core.ac.uk/download/pdf/83929129.pdf Seasonal Fluctuations in Collective Mood Revealed by Wikipedia Searches and Twitter Posts] F Dzogang, T Lansdall-Welfare, N Cristianini - 2016 IEEE International Conference on Data Mining, Workshop on ''Data Mining'' in Human Activity Analysis&lt;br /&gt;
&lt;br /&gt;
The analysis of vast quantities of historical newspaper content has been pioneered by Dzogang et al., which showed how periodic structures can be automatically discovered in historical newspapers. A similar analysis was performed on social media, again revealing strongly periodic structures.&amp;lt;ref&amp;gt;[https://core.ac.uk/download/pdf/83929129.pdf Seasonal Fluctuations in Collective Mood Revealed by Wikipedia Searches and Twitter Posts] F Dzogang, T Lansdall-Welfare, N Cristianini - 2016 IEEE International Conference on Data Mining, Workshop on Data Mining in Human Activity Analysis&lt;br /&gt;
&lt;br /&gt;
对大量历史报纸内容的分析是由 Dzogang 等人率先进行的，他们展示了如何在历史报纸中自动发现'''周期结构 Periodic Structures'''。一个类似的社交媒体上进行的分析，也揭示了强烈的周期性结构。 参考文献[ https://core.ac.uk/download/pdf/83929129.pdf 维基百科搜索和推特帖子揭示的集体情绪的季节性波动] f Dzogang，t Lansdall-Welfare，n Cristianini-2016 IEEE International Conference on Data Mining, Workshop on Data Mining in Human Activity Analysis&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
==Challenges 挑战==&lt;br /&gt;
&lt;br /&gt;
Computational sociology, as with any field of study, faces a set of challenges.&amp;lt;ref name=&amp;quot;MCSS&amp;quot;&amp;gt;Conte, Rosaria, et al. &amp;quot;[https://link.springer.com/content/pdf/10.1140%252Fepjst%252Fe2012-01697-8.pdf Manifesto of computational social science].&amp;quot; The European Physical Journal Special Topics 214.1 (2012): 325-346.&amp;lt;/ref&amp;gt; These challenges need to be handled meaningfully so as to make the maximum impact on society.&lt;br /&gt;
&lt;br /&gt;
Computational sociology, as with any field of study, faces a set of challenges. These challenges need to be handled meaningfully so as to make the maximum impact on society.&lt;br /&gt;
&lt;br /&gt;
计算社会学和其他研究领域一样面临着一系列的挑战。必须有意义地处理这些挑战（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） meaningfully怎么翻译才比较通顺？），才能对社会产生最大的影响。&lt;br /&gt;
  &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Levels and their interactions 层级和层级的交互关系===&lt;br /&gt;
&lt;br /&gt;
Each society that is formed tends to be in one level or the other and there exists tendencies of interactions between and across these levels. Levels need not only be micro-level or macro-level in nature. There can be intermediate levels in which a society exists say - groups, networks, communities etc.&amp;lt;ref name=&amp;quot;MCSS&amp;quot; /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Each society that is formed tends to be in one level or the other and there exists tendencies of interactions between and across these levels. Levels need not only be micro-level or macro-level in nature. There can be intermediate levels in which a society exists say - groups, networks, communities etc.&lt;br /&gt;
&lt;br /&gt;
形成的每个社会都处于某种层次上，并且这些层次之间有相互作用的倾向。社会中的级别不仅可以分为微观或宏观的层次，还可以存在中间的层次，比如群体、网络、社区等。&lt;br /&gt;
（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） 合并了英文的原句）&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The question however arises as to how to identify these levels and how they come into existence? And once they are in existence how do they interact within themselves and with other levels?&lt;br /&gt;
&lt;br /&gt;
The question however arises as to how to identify these levels and how they come into existence? And once they are in existence how do they interact within themselves and with other levels?&lt;br /&gt;
&lt;br /&gt;
然而问题是，这些层次是如何确定的以及如何产生的？并且，一旦它们产生了，它们如何在自身内部以及与其他层次相互作用？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
If we view entities (agents) as nodes and the connections between them as the edges, we see the formation of networks. The connections in these networks do not come about based on just objective relationships between the entities, rather they are decided upon by factors chosen by the participating entities.&amp;lt;ref&amp;gt;{{cite journal|last1=Egu´ıluz|first1=V. M.|last2=Zimmermann|first2=M. G.|last3=Cela-Conde|first3=C. J.|last4=San Miguel|first4=M.|title=American Journal of Sociology|issue=2005|pages=110, 977}}&amp;lt;/ref&amp;gt; The challenge with this process is that, it is difficult to identify when a set of entities will form a network. These networks may be of trust networks, co-operation networks, dependence networks etc. There have been cases where heterogeneous set of entities have shown to form strong and meaningful networks among themselves.&amp;lt;ref&amp;gt;{{cite journal|last1=Sichman|first1=J. S.|last2=Conte|first2=R.|title=Computational &amp;amp; Mathematical Organization Theory|issue=2002|pages=8(2)}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Ehrhardt|first1=G.|last2=Marsili|first2=M.|last3=Vega-Redondo|first3=F.|title=Physical Review E|issue=2006|pages=74(3)}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
If we view entities (agents) as nodes and the connections between them as the edges, we see the formation of networks. The connections in these networks do not come about based on just objective relationships between the entities, rather they are decided upon by factors chosen by the participating entities. The challenge with this process is that, it is difficult to identify when a set of entities will form a network. These networks may be of trust networks, co-operation networks, dependence networks etc. There have been cases where heterogeneous set of entities have shown to form strong and meaningful networks among themselves.&lt;br /&gt;
&lt;br /&gt;
如果我们把'''实体 Entities'''（'''主体 Agents'''）看作节点，把它们之间的连接看作边，我们就看到了网络的形成。这些网络中的连接并非只是基于实体之间的客观关系，而是由实体选择的因素决定的。这个过程的困难之处在于，很难确定一组实体何时形成网络。这些网络可以是信任网络、合作网络、依赖网络等。在一些情况下，异质的实体集在它们之间形成了强大而有意义的网络。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
As discussed previously, societies fall into levels and in one such level, the individual level, a micro-macro link&amp;lt;ref&amp;gt;Billari, Francesco C. [https://books.google.com/books?hl=en&amp;amp;lr=&amp;amp;id=Tc8iL0b-OycC&amp;amp;oi=fnd&amp;amp;pg=PA1&amp;amp;dq=%22Agent-based+computational+modelling:+applications+in+demography,+social,+economic+and+environmental+sciences%22&amp;amp;ots=6MNVK7JP-e&amp;amp;sig=-o_iS9zCK3r-t1eHn3554UVadUs Agent-based computational modelling: applications in demography, social, economic and environmental sciences]. Taylor &amp;amp; Francis, 2006.&amp;lt;/ref&amp;gt; refers to the interactions which create higher-levels. There are a set of questions that needs to be answered regarding these Micro-Macro links. How they are formed? When do they converge? What is the feedback pushed to the lower levels and how are they pushed?&lt;br /&gt;
&lt;br /&gt;
As discussed previously, societies fall into levels and in one such level, the individual level, a micro-macro link refers to the interactions which create higher-levels. There are a set of questions that needs to be answered regarding these Micro-Macro links. How they are formed? When do they converge? What is the feedback pushed to the lower levels and how are they pushed?&lt;br /&gt;
&lt;br /&gt;
正如前面所讨论的，社会分为不同层次。在其中的一个层次：个体层次中，'''微观-宏观联系 Micro-macro Link'''指的是创造更高层次的相互作用。关于微观-宏观链接有一系列问题等待回答。它们是如何形成的？它们什么时候汇聚？什么反馈被推到了较低的层次，以及它们是如何被推到较低层次的？ &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Another major challenge in this category concerns the validity of information and their sources. In recent years there has been a boom in information gathering and processing. However, little attention was paid to the spread of false information between the societies. Tracing back the sources and finding ownership of such information is difficult.&lt;br /&gt;
&lt;br /&gt;
Another major challenge in this category concerns the validity of information and their sources. In recent years there has been a boom in information gathering and processing. However, little attention was paid to the spread of false information between the societies. Tracing back the sources and finding ownership of such information is difficult.&lt;br /&gt;
&lt;br /&gt;
这一分类的另一个主要挑战涉及信息的有效性及其来源。近年来，信息收集和处理有着蓬勃的发展。但人们很少注意到社会之间虚假信息的传播。追溯资料来源并找到这些资料的所有者是很困难的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Culture modeling 文化建模===&lt;br /&gt;
&lt;br /&gt;
The evolution of the networks and levels in the society brings about cultural diversity.&amp;lt;ref&amp;gt;{{cite journal|last1=Centola|first1=D.|last2=Gonz´alez-Avella|first2=J. C.|last3=Egu´ıluz|first3=V. M.|last4=San Miguel|first4=M.|title=Journal of Conflict Resolution|issue=2007|pages=51}}&amp;lt;/ref&amp;gt; A thought which arises however is that, when people tend to interact and become more accepting of other cultures and beliefs, how is it that diversity still persists? Why is there no convergence? A major challenge is how to model these diversities. Are there external factors like mass media, locality of societies etc. which influence the evolution or persistence of cultural diversities?{{Citation needed|reason=Sounds just like personal thoughts|date=May 2017}}&lt;br /&gt;
&lt;br /&gt;
The evolution of the networks and levels in the society brings about cultural diversity. A thought which arises however is that, when people tend to interact and become more accepting of other cultures and beliefs, how is it that diversity still persists? Why is there no convergence? A major challenge is how to model these diversities. Are there external factors like mass media, locality of societies etc. which influence the evolution or persistence of cultural diversities?&lt;br /&gt;
&lt;br /&gt;
社会网络和层次的演变带来了文化的多样性。然而人们会想，当人们倾向于相互作用，变得更能接受其他文化和信仰时，为什么多样性仍然存在？为什么人们没有趋同？一个主要的挑战是如何为这些多样性建立模型。是否存在大众传媒、社会地域性等外部因素，这些因素影响文化多样性的演化或保持？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Experimentation and evaluation 实验和评估===&lt;br /&gt;
&lt;br /&gt;
Any study or modelling when combined with experimentation needs to be able to address the questions being asked. [[Computational social science]] deals with large scale data and the challenge becomes much more evident as the scale grows. How would one design informative simulations on a large scale? And even if a large scale simulation is brought up, how is the evaluation supposed to be performed?&lt;br /&gt;
&lt;br /&gt;
Any study or modelling when combined with experimentation needs to be able to address the questions being asked. Computational social science deals with large scale data and the challenge becomes much more evident as the scale grows. How would one design informative simulations on a large scale? And even if a large scale simulation is brought up, how is the evaluation supposed to be performed?&lt;br /&gt;
&lt;br /&gt;
任何与实验结合的研究或建模都需要能够解决所提出的问题。计算社会科学处理大规模数据，并且数据规模越大建模的挑战就越明显。如何在一个大规模的数据集里设计信息仿真模型？并且，即使提出了一个大规模的仿真模型，应该如何对它进行评估？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Model choice and model complexities 模型选择和模型复杂性===&lt;br /&gt;
&lt;br /&gt;
Another challenge is identifying the models that would best fit the data and the complexities of these models. These models would help us predict how societies might evolve over time and provide possible explanations on how things work.&amp;lt;ref&amp;gt;Weisberg, Michael. [http://www.academia.edu/download/30604870/lessmorefinal.pdf When less is more: Tradeoffs and idealization in model building]. Diss. Stanford University, 2003.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Another challenge is identifying the models that would best fit the data and the complexities of these models. These models would help us predict how societies might evolve over time and provide possible explanations on how things work.&lt;br /&gt;
&lt;br /&gt;
另一个挑战是确定最适合数据的模型，以及最合适的'''模型复杂性 Model Complexities'''。这些模型将帮助我们预测随着时间的推移社会将如何演变，并为事物如何运动和变化提供可能的解释。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====Generative models 生成模型====&lt;br /&gt;
&lt;br /&gt;
Generative models helps us to perform extensive qualitative analysis in a controlled fashion. A model proposed by Epstein, is the agent-based simulation, which talks about identifying an initial set of heterogeneous entities (agents) and observe their evolution and growth based on simple local rules.&amp;lt;ref&amp;gt;Epstein, Joshua M. [https://www.researchgate.net/profile/Eric_Jones14/publication/283615593_Book_Review_-_Generative_Social_Science_Studies_in_Agent-Based_Computational_Modeling/links/5641398808aebaaea1f70216.pdf Generative social science: Studies in agent-based computational modeling]. Princeton University Press, 2006.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Generative models helps us to perform extensive qualitative analysis in a controlled fashion. A model proposed by Epstein, is the agent-based simulation, which talks about identifying an initial set of heterogeneous entities (agents) and observe their evolution and growth based on simple local rules.&lt;br /&gt;
&lt;br /&gt;
'''生成模型 Generative Models'''帮助我们以一种受控的方式进行广泛的定性分析。爱泼斯坦（Epstein）提出的一个基于主体的模型，就是探讨如何识别异质实体(主体)的'''初始集 Initial Set'''，并根据简单的局部规则观察它们的演化和增长。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
But what are these local rules? How does one identify them for a set of heterogeneous agents? Evaluation and impact of these rules state a whole new set of difficulties.&lt;br /&gt;
&lt;br /&gt;
But what are these local rules? How does one identify them for a set of heterogeneous agents? Evaluation and impact of these rules state a whole new set of difficulties.&lt;br /&gt;
&lt;br /&gt;
但是这些局部规则是什么呢？如何识别一组异质实体？这些规则的评估和影响都是新出现的困难之处。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====Heterogeneous or ensemble models 异质模型和组合模型====&lt;br /&gt;
&lt;br /&gt;
Integrating simple models which perform better on individual tasks to form a Hybrid model is an approach that can be looked into{{Citation needed|reason=unsupported claims|date=May 2017}}. These models can offer better performance and understanding of the data. However the trade-off of identifying and having a deep understanding of the interactions between these simple models arises when one needs to come up with one combined, well performing model. Also, coming up with tools and applications to help analyse and visualize the data based on these hybrid models is another added challenge.&lt;br /&gt;
&lt;br /&gt;
Integrating simple models which perform better on individual tasks to form a Hybrid model is an approach that can be looked into. These models can offer better performance and understanding of the data. However the trade-off of identifying and having a deep understanding of the interactions between these simple models arises when one needs to come up with one combined, well performing model. Also, coming up with tools and applications to help analyse and visualize the data based on these hybrid models is another added challenge.&lt;br /&gt;
&lt;br /&gt;
集成在单个任务中表现良好的简单模型并形成'''混合模型 Hybrid model'''是一种可以继续考虑的方法。这些模型有更好的性能并可以对数据提供更好的理解。然而，当需要提出一个整合的、性能良好的模型时，识别简单模型和深入理解模型之间相互作用的权衡问题就出现了。此外，另一个挑战是开发工具和应用程序来帮助分析和可视化基于这些混合模型的数据。&lt;br /&gt;
&lt;br /&gt;
==Impact 影响==&lt;br /&gt;
&lt;br /&gt;
Computational sociology can bring impacts to science, technology and society.&amp;lt;ref name=&amp;quot;MCSS&amp;quot; /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Computational sociology can bring impacts to science, technology and society.&lt;br /&gt;
&lt;br /&gt;
计算社会学可以给科学、技术和社会带来影响。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Impact on science 对科学的影响===&lt;br /&gt;
&lt;br /&gt;
In order for the study of computational sociology to be effective, there has to be valuable innovations. These innovation can be of the form of new data analytics tools, better models and algorithms. The advent of such innovation will be a boon for the scientific community in large. {{Citation needed|reason=citation for claim on innovation and the type of innovation|date=May 2017}}&lt;br /&gt;
&lt;br /&gt;
In order for the study of computational sociology to be effective, there has to be valuable innovations. These innovation can be of the form of new data analytics tools, better models and algorithms. The advent of such innovation will be a boon for the scientific community in large. &lt;br /&gt;
&lt;br /&gt;
为了使计算社会学的研究有效，必须有一些有价值的创新。这些创新可以是新形式的数据分析工具，或更好的模型和算法。这些创新的出现将为整个科学界带来益处。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Impact on society 对社会的影响===&lt;br /&gt;
&lt;br /&gt;
One of the major challenges of computational sociology is the modelling of social processes {{Citation needed|reason=to support the claim for need of modeling of social processes|date=May 2017}}. Various law and policy makers would be able to see efficient and effective paths to issue new guidelines and the mass in general would be able to evaluate and gain fair understanding of the options presented in front of them enabling an open and well balanced decision process. {{Citation needed|reason=unsupported claims|date=May 2017}}.&lt;br /&gt;
&lt;br /&gt;
One of the major challenges of computational sociology is the modelling of social processes . Various law and policy makers would be able to see efficient and effective paths to issue new guidelines and the mass in general would be able to evaluate and gain fair understanding of the options presented in front of them enabling an open and well balanced decision process. &lt;br /&gt;
&lt;br /&gt;
计算社会学的主要挑战之一是对社会过程的建模。各种法律和政策制定者将能够得到发布新指导方针的快速有效的方法，广大群众将能够评价和更好地理解各种备选方案，从而实现决策进程的公开和平衡。&lt;br /&gt;
&lt;br /&gt;
==Journals and academic publications 期刊和学术出版物==&lt;br /&gt;
&lt;br /&gt;
The most relevant journal of the discipline is the [[Journal of Artificial Societies and Social Simulation]].&lt;br /&gt;
&lt;br /&gt;
The most relevant journal of the discipline is the Journal of Artificial Societies and Social Simulation.&lt;br /&gt;
&lt;br /&gt;
该学科最相关的期刊是《人工社会与社会模拟（the Journal of Artificial Societies and Social Simulation）》。&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20100611121626/http://www.ccsr.uiuc.edu/web/Journals/Journals.html Complexity Research Journal List], from UIUC, IL 复杂研究期刊列表（资料来自伊利诺伊大学香槟分校）&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20100611091342/http://www.ccsr.uiuc.edu/web/Groups/Groups.html Related Research Groups], from UIUC, IL 相关研究组（资料来自伊利诺伊大学香槟分校）&lt;br /&gt;
&lt;br /&gt;
==Associations, conferences and workshops 协会、会议及工作坊==&lt;br /&gt;
&lt;br /&gt;
*[http://www.casos.cs.cmu.edu/naacsos/ North American Association for Computational Social and Organization Sciences]&lt;br /&gt;
&lt;br /&gt;
*[http://www.essa.eu.org/ ESSA: European Social Simulation Association]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Academic programs, departments and degrees 学术课程、院系和学位==&lt;br /&gt;
&lt;br /&gt;
* [http://mediapatterns.enm.bris.ac.uk/ University of Bristol &amp;quot;Mediapatterns&amp;quot; project]&lt;br /&gt;
&lt;br /&gt;
* [http://www.cos.cs.cmu.edu/ Carnegie Mellon University], [http://www.casos.cs.cmu.edu PhD program] in Computation, Organizations and Society (COS)&lt;br /&gt;
&lt;br /&gt;
* [http://www.uchicago.edu University of Chicago]&lt;br /&gt;
&lt;br /&gt;
** [https://macss.uchicago.edu/ Certificate, MA and PhD in Computational Social Sciences]&lt;br /&gt;
&lt;br /&gt;
* [http://www.gmu.edu George Mason University]&lt;br /&gt;
&lt;br /&gt;
** PhD program in [http://css.gmu.edu CSS (Computational Social Sciences)]&lt;br /&gt;
&lt;br /&gt;
** MA program in [http://mais.gmu.edu/programs/la-mais-css Master's of Interdisciplinary Studies, CSS emphasis]&lt;br /&gt;
&lt;br /&gt;
* [http://www.pdx.edu/sysc/program-systems-science-phd-program Portland State], PhD program in Systems Science&lt;br /&gt;
&lt;br /&gt;
* [http://www.pdx.edu/sysc/program-systems-science-masters-program Portland State], MS program in Systems Science&lt;br /&gt;
&lt;br /&gt;
* [http://www.ucd.ie University College Dublin], &lt;br /&gt;
&lt;br /&gt;
** PhD Program in [http://www.ucd.ie/geary/postgraduatetraining/cscs Complex Systems and Computational Social Science]&lt;br /&gt;
&lt;br /&gt;
** MSc in [https://sisweb.ucd.ie/usis/!W_HU_MENU.P_PUBLISH?p_tag=PROG&amp;amp;MAJR=W390 Social Data Analytics] &lt;br /&gt;
&lt;br /&gt;
** BSc in [https://www.myucd.ie/courses/social-sciences/computational-social-science Computational Social Science] &lt;br /&gt;
&lt;br /&gt;
* [https://archive.is/20121215023745/http://hcs.ucla.edu/courses.htm UCLA], Minor in Human Complex Systems&lt;br /&gt;
&lt;br /&gt;
* [http://www.cs.ucla.edu/~cyber/ UCLA], Major in Computational &amp;amp; Systems Biology (including behavioral sciences)&lt;br /&gt;
&lt;br /&gt;
* [http://cscs.umich.edu/education/undergrad/undergrad.html Univ. of Michigan], Minor in Complex Systems&lt;br /&gt;
&lt;br /&gt;
* [http://www.pdx.edu/sysc/resources-other-systems-science-programs Systems Sciences Programs List], Portland State.  List of other worldwide related programs.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Centers and institutes 中心和机构==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===North America 北美===&lt;br /&gt;
&lt;br /&gt;
* [http://cnets.indiana.edu/ Center for Complex Networks and Systems Research], Indiana University, Bloomington, IN, USA.&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20110430200327/http://www.ccsr.uiuc.edu/ Center for Complex Systems Research], University of Illinois at Urbana-Champaign, IL, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://socialcomplexity.gmu.edu/ Center for Social Complexity], George Mason University, Fairfax, VA, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.asu.edu/clas/csdc/ Center for Social Dynamics and Complexity], Arizona State University, Tempe, AZ, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.cscs.umich.edu/ Center of the Study of Complex Systems], University of Michigan, Ann Arbor, MI, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://hcs.ucla.edu/ Human Complex Systems], University of California Los Angeles, Los Angeles, CA, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.iq.harvard.edu/ Institute for Quantitative Social Science], Harvard University, Boston, MA, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.nico.northwestern.edu/ Northwestern Institute on Complex Systems (NICO)], Northwestern University, Evanston, IL USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.santafe.edu/ Santa Fe Institute], Santa Fe, NM, USA.&lt;br /&gt;
&lt;br /&gt;
* Duke Network Analysis Center, [[Duke University]], Durham, NC, USA&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===South America 南美===&lt;br /&gt;
&lt;br /&gt;
* [http://www5.each.usp.br/mestrado-academico-em-modelagem-de-sistemas-complexos/ Modelagem de Sistemas Complexos], University of São Paulo - EACH, São Paulo, SP, Brazil&lt;br /&gt;
&lt;br /&gt;
* [http://inct.cnpq.br/web/inct-sc Instituto Nacional de Ciência e Tecnologia de Sistemas Complexos], Centro Brasileiro de Pesquisas Físicas, Rio de Janeiro, RJ, Brazil&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Europe 欧洲===&lt;br /&gt;
&lt;br /&gt;
* [http://cfpm.org Centre for Policy Modelling], Manchester, UK.&lt;br /&gt;
&lt;br /&gt;
* [http://cress.soc.surrey.ac.uk/ Centre for Research in Social Simulation], University of Surrey, UK.&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20130425014018/http://dl.ucd.ie/ UCD Dynamics Lab- Centre for Computational Social Science], Geary Institute for Public Policy, University College Dublin, Ireland.&lt;br /&gt;
&lt;br /&gt;
* [http://www.rug.nl/research/gcscs/ Groningen Center for Social Complexity Studies (GCSCS)], Groningen, NL.&lt;br /&gt;
&lt;br /&gt;
* [http://www.soms.ethz.ch/ Chair of Sociology, in particular of Modeling and Simulation (SOMS)], Zürich, Switzerland.&lt;br /&gt;
&lt;br /&gt;
* [http://www.eco.unibs.it/gecs/ Research Group on Experimental and Computational Sociology (GECS)], Brescia, IT.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Asia 亚洲===&lt;br /&gt;
&lt;br /&gt;
* [http://bandungfe.net Bandung Fe Institute, Centre for Complexity in Surya University], Bandung, Indonesia.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== See also 参见==&lt;br /&gt;
&lt;br /&gt;
* [[Artificial society]] 人工社会&lt;br /&gt;
&lt;br /&gt;
* [[Simulated reality]] 虚拟现实&lt;br /&gt;
&lt;br /&gt;
* [[Social simulation]] 社会仿真&lt;br /&gt;
&lt;br /&gt;
* [[Agent-based social simulation]] 基于主体的社会仿真&lt;br /&gt;
&lt;br /&gt;
* [[Social complexity]] 社会复杂性&lt;br /&gt;
&lt;br /&gt;
* [[Computational economics]] 计算经济学&lt;br /&gt;
&lt;br /&gt;
* [[Computational epidemiology]] 计算流行病学&lt;br /&gt;
&lt;br /&gt;
* [[Cliodynamics]] 历史动力学&lt;br /&gt;
&lt;br /&gt;
* [[Predictive analytics]] 预测分析&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&lt;br /&gt;
{{reflist|35em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==External links 外部链接==&lt;br /&gt;
&lt;br /&gt;
*[http://cress.soc.surrey.ac.uk/s4ss/ On-line book &amp;quot;Simulation for the Social Scientist&amp;quot; by Nigel Gilbert and Klaus G. Troitzsch, 1999, second edition 2005 社会科学家的仿真建模 电子书 作者：Nigel Gilbert and Klaus G. Troitzsch 第二版（2005年版）]&lt;br /&gt;
&lt;br /&gt;
*[http://jasss.soc.surrey.ac.uk/JASSS.html Journal of Artificial Societies and Social Simulation 人工社会和社会建模仿真期刊]&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20110516072744/http://cmol.nbi.dk/models/ Agent based models for social networks, interactive java applets 基于主体的社会网络模型，交互式 java 小程序]&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20090827052722/http://www.personal.kent.edu/~bcastel3/ Sociology and Complexity Science Website 社会学与复杂性科学网站]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:Subfields of sociology]]&lt;br /&gt;
&lt;br /&gt;
Category:Subfields of sociology&lt;br /&gt;
&lt;br /&gt;
范畴: 社会学的子领域&lt;br /&gt;
&lt;br /&gt;
[[Category:Complex systems theory]]&lt;br /&gt;
&lt;br /&gt;
Category:Complex systems theory&lt;br /&gt;
&lt;br /&gt;
范畴: 复杂系统理论&lt;br /&gt;
&lt;br /&gt;
[[Category:Methods in sociology]]&lt;br /&gt;
&lt;br /&gt;
Category:Methods in sociology&lt;br /&gt;
&lt;br /&gt;
范畴: 社会学方法&lt;br /&gt;
&lt;br /&gt;
[[Category:Computational fields of study]]&lt;br /&gt;
&lt;br /&gt;
Category:Computational fields of study&lt;br /&gt;
&lt;br /&gt;
类别: 研究的计算领域&lt;br /&gt;
&lt;br /&gt;
&amp;lt;noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;small&amp;gt;This page was moved from [[wikipedia:en:Computational sociology]]. Its edit history can be viewed at [[社会计算/edithistory]]&amp;lt;/small&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:待整理页面]]&lt;br /&gt;
&lt;br /&gt;
== 编者推荐 ==&lt;br /&gt;
=== 书籍推荐 ===&lt;br /&gt;
====[https://e.jd.com/30159646.html 社会计算的基本方法与应用]====&lt;br /&gt;
这是中科院自动化所的王飞跃老师关于社会计算的专著，从利用计算技术解决社会问题的角度介绍社会计算。阅读难度可能较高。&lt;br /&gt;
&lt;br /&gt;
=== 集智推荐 ===&lt;br /&gt;
====[https://campus.swarma.org/course/1028 2019 International Conference of Social Computing]====&lt;br /&gt;
本课程是2019年8月26日、27日的2019 International Conference of Social Computing记录。教师团队由芝加哥大学社会学系James Evans教授，Science University of Gottingen傅晓明教授，清华大学罗家德教授，电子科技大学周涛教授等多位老师组成。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://campus.swarma.org/course/1016 复杂系统与社会计算研讨会]====&lt;br /&gt;
本课程是，2019年10月27日北京计算科学研究中心主办的复杂系统与社会计算研讨会活动记录。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://pattern.swarma.org/path?id=12 计算社会科学入门路径]====&lt;br /&gt;
计算社会科学诞生至今，已有将近10年。在自然科学领域已经广泛应用大数据、分布式计算等方式提高研究质量的今天，社会科学领域涉及到的核心数据仍然被少数机构所拥有并创造着巨大的价值。本文将从计算社会科学的发展历史，常用方法，以及前沿问题来给大家粗略地展示计算社会科学的脉络。&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E7%A4%BE%E4%BC%9A%E8%AE%A1%E7%AE%97&amp;diff=11131</id>
		<title>社会计算</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E7%A4%BE%E4%BC%9A%E8%AE%A1%E7%AE%97&amp;diff=11131"/>
		<updated>2020-07-25T03:37:40Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;#重定向 [[社会计算]]&lt;br /&gt;
此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。&lt;br /&gt;
{{sociology}}&amp;lt;onlyinclude&amp;gt;&amp;lt;!-- &lt;br /&gt;
&lt;br /&gt;
&amp;lt;onlyinclude&amp;gt;&amp;lt;!-- &lt;br /&gt;
&lt;br /&gt;
只包括! -- &lt;br /&gt;
&lt;br /&gt;
While editing this lead/intro, please keep your text BELOW this line - this will make it easier to automatically insert the lede into other articles --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
  While editing this lead/intro, please keep your text BELOW this line - this will make it easier to automatically insert the lede into other articles --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
当编辑这个导语 / 介绍，请保持你的文本下面这行-这将使它更容易自动插入到其他文章的莱德-&lt;br /&gt;
&lt;br /&gt;
'''Computational sociology''' is a branch of [[sociology]] that uses computationally intensive methods to analyze and model social phenomena. Using [[computer simulation]]s, [[artificial intelligence]], complex statistical methods, and analytic approaches like [[social network analysis]], computational sociology develops and tests theories of complex social processes through bottom-up modeling of social interactions.&amp;lt;ref name=&amp;quot;MW&amp;quot;&amp;gt;{{cite journal|doi=10.1146/annurev.soc.28.110601.141117|title=From Factors to Actors: Computational Sociology and Agent-Based Modeling |first1=Michael W. |last1=Macy |first2=Robert |last2=Willer |journal=Annual Review of Sociology |volume=28 |pages=143–166 |jstor=3069238|year=2002}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Computational sociology is a branch of sociology that uses computationally intensive methods to analyze and model social phenomena. Using computer simulations, artificial intelligence, complex statistical methods, and analytic approaches like social network analysis, computational sociology develops and tests theories of complex social processes through bottom-up modeling of social interactions.&lt;br /&gt;
&lt;br /&gt;
'''计算社会学 Computational Sociology''' 是社会学的一个分支，它使用计算密集型方法来分析和模拟社会现象。&amp;lt;font color='red'&amp;gt;计算社会学通过使用计算机模拟、人工智能、复杂统计方法以及社会网络分析等分析方法自下而上地建立社会互动模型，是建立并检验复杂社会过程的理论。&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;  借助计算机模拟、人工智能、复杂统计方法以及社会网络分析等分析方法，计算社会学通过自下而上地建立社会互动模型来发展和检验关于复杂社会过程的理论。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
It involves the understanding of social agents, the interaction among these agents, and the effect of these interactions on the social aggregate.&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;&amp;gt;{{cite book|last1=Gilbert |first1=Nigel |last2=Troitzsch |first2=Klaus |year=2005 |title=Simulation for Social Scientists |edition=2 |chapter=Simulation and social science |publisher=Open University Press |chapter-url=http://cress.soc.surrey.ac.uk/s4ss/}}&amp;lt;/ref&amp;gt; Although the subject matter and methodologies in [[social science]] differ from those in [[natural science]] or [[computer science]], several of the approaches used in contemporary [[social simulation]] originated from fields such as [[physics]] and [[artificial intelligence]].&amp;lt;ref name=&amp;quot;Artificial Societies&amp;quot;&amp;gt;{{cite book|last1=Epstein |first1=Joshua M. |last2=Axtell |first2=Robert |year=1996 |title=Growing Artificial Societies: Social Science from the Bottom Up |location=Washington DC |publisher=Brookings Institution Press|url=https://archive.org/details/growingartificia00epst|url-access=registration |isbn=978-0262050531 }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;Cooperation&amp;quot;&amp;gt;{{cite book|last1=Axelrod |first1=Robert |year=1997 |title=The Complexity of Cooperation: Agent-Based Models of Competition and Collaboration |location=Princeton, NJ |publisher=Princeton University Press}}&amp;lt;/ref&amp;gt; Some of the approaches that originated in this field have been imported into the natural sciences, such as measures of [[centrality|network centrality]] from the fields of [[social network analysis]] and [[network science]].&lt;br /&gt;
&lt;br /&gt;
It involves the understanding of social agents, the interaction among these agents, and the effect of these interactions on the social aggregate. Although the subject matter and methodologies in social science differ from those in natural science or computer science, several of the approaches used in contemporary social simulation originated from fields such as physics and artificial intelligence. Some of the approaches that originated in this field have been imported into the natural sciences, such as measures of network centrality from the fields of social network analysis and network science.&lt;br /&gt;
&lt;br /&gt;
它涉及理解社会行为主体和它们的相互作用，以及这些相互作用如何影响社会总体(--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） social aggregate--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|讨论]]） 我觉得这样翻译是ok的)。虽然社会科学的主题和方法不同于自然科学或计算机科学，但当代社会仿真模拟中使用的一些方法起源于物理学和人工智能等领域。这一领域的一些方法，如来自社会网络分析和网络科学领域的网络中心性度量方法等，早已被引入到自然科学中。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In relevant literature, computational sociology is often related to the study of [[social complexity]].&amp;lt;ref&amp;gt;{{cite journal|last=Casti |first=J |year=1999 |title=The Computer as Laboratory: Toward a Theory of Complex Adaptive Systems |journal=Complexity |volume=4 |issue=5 |pages=12–14 |doi=10.1002/(SICI)1099-0526(199905/06)4:5&amp;lt;12::AID-CPLX3&amp;gt;3.0.CO;2-4}}&amp;lt;/ref&amp;gt; Social complexity concepts such as [[complex systems]], [[non-linear]] interconnection among macro and micro process, and [[emergence]], have entered the vocabulary of computational sociology.&amp;lt;ref&amp;gt;{{cite journal|last=Goldspink |first=C |year=2002 |title=Methodological Implications of Complex Systems Approaches to Sociality: Simulation as a Foundation for Knowledge |url=http://jasss.soc.surrey.ac.uk/5/1/3.html |publisher=Journal of Artificial Societies and Social Simulation |volume=5 |issue=1}}&amp;lt;/ref&amp;gt; A practical and well-known example is the construction of a computational model in the form of an &amp;quot;[[artificial society]]&amp;quot;, by which researchers can analyze the structure of a [[Social structure|social system]].&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;Generative&amp;quot;&amp;gt;{{cite book|last=Epstein |first=Joshua |year=2007 |title=Generative Social Science: Studies in Agent-Based Computational Modeling |location=Princeton, NJ |publisher=Princeton University Press|url=https://www.researchgate.net/publication/283615593}}&lt;br /&gt;
&lt;br /&gt;
In relevant literature, computational sociology is often related to the study of social complexity. Social complexity concepts such as complex systems, non-linear interconnection among macro and micro process, and emergence, have entered the vocabulary of computational sociology. A practical and well-known example is the construction of a computational model in the form of an &amp;quot;artificial society&amp;quot;, by which researchers can analyze the structure of a social system.&lt;br /&gt;
&lt;br /&gt;
在相关文献中，计算社会学经常与社会复杂性的研究有关。复杂系统、宏观和微观过程之间的非线性关联、涌现等社会复杂性概念已经进入计算社会学的词汇。一个实际而著名的例子是建立“'''人工社会 Artificial Society'''”的计算模型，通过它研究人员可以分析一个社会系统的结构。 &lt;br /&gt;
&lt;br /&gt;
While editing this lead/intro, please keep your text ABOVE this line - this will make it easier to automatically insert the lede into other articles - thanks!  &lt;br /&gt;
&lt;br /&gt;
While editing this lead/intro, please keep your text ABOVE this line - this will make it easier to automatically insert the lede into other articles - thanks!  &lt;br /&gt;
&lt;br /&gt;
当编辑这个引导 / 介绍，请保持你的文本以上这一行-这将使它更容易自动插入到其他文章的莱德-谢谢！&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;&amp;lt;/onlyinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;&amp;lt;/onlyinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
-- / 只包括&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==History 历史==&lt;br /&gt;
&lt;br /&gt;
{{see also|Sociology and complexity science}}&lt;br /&gt;
&lt;br /&gt;
[[File:Complexity-map-with-sociolo.png|thumb|right|300px|Historical map of research paradigms and associated scientists in [[sociology and complexity science]].]]&lt;br /&gt;
&lt;br /&gt;
Historical map of research paradigms and associated scientists in [[sociology and complexity science.]]&lt;br /&gt;
&lt;br /&gt;
【图1：Historical map of research paradigms and associated scientists in [[sociology and complexity science＋社会学和复杂性中的研究范式和科学家的历史地图】&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Background 背景===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In the past four decades, computational sociology has been introduced and gaining popularity {{According to whom|date=June 2017}}.  This has been used primarily for modeling or building explanations of social processes and are depending on the emergence of complex behavior from simple activities.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;&amp;gt;Salgado, Mauricio, and Nigel Gilbert. &amp;quot;[http://epubs.surrey.ac.uk/749319/1/Emergence%20and%20Communication%20-%20V3%201.pdf Emergence and communication in computational sociology].&amp;quot; Journal for the Theory of Social Behaviour 43.1 (2013): 87-110.&amp;lt;/ref&amp;gt;  The idea behind emergence is that properties of any bigger system do not always have to be properties of the components that the system is made of.&amp;lt;ref&amp;gt;Macy, Michael W., and Robert Willer. &amp;quot;[http://sct.uab.cat/lsds/sites/sct.uab.cat.lsds/files/FROM%20FACTORS%20TO%20ACTORS%20(Macy%20and%20Willer%202002).pdf From factors to actors: computational sociology and agent-based modeling].&amp;quot; Annual review of sociology 28.1 (2002): 143-166.&amp;lt;/ref&amp;gt;  The people responsible for the introduction of the idea of emergence are Alexander, Morgan, and Broad, who were classical emergentists.  The time at which these emergentists came up with this concept and method was during the time of the early twentieth century.  The aim of this method was to find a good enough accommodation between two different and extreme ontologies, which were reductionist materialism and dualism.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;/&amp;gt; &lt;br /&gt;
&lt;br /&gt;
In the past four decades, computational sociology has been introduced and gaining popularity.  This has been used primarily for modeling or building explanations of social processes and are depending on the emergence of complex behavior from simple activities.  The idea behind emergence is that properties of any bigger system do not always have to be properties of the components that the system is made of.  The people responsible for the introduction of the idea of emergence are Alexander, Morgan, and Broad, who were classical emergentists.  The time at which these emergentists came up with this concept and method was during the time of the early twentieth century.  The aim of this method was to find a good enough accommodation between two different and extreme ontologies, which were reductionist materialism and dualism. &lt;br /&gt;
&lt;br /&gt;
在过去的四十年里，计算社会学诞生并且越来越受欢迎。这主要用于建模或构建社会过程的解释，并且依赖于从简单活动中'''涌现 Emergence'''的复杂行为。涌现背后的思想是，任何较大系统不总是必须和组成系统的部分具有一样的性质。引入涌现思想的人是亚历山大 Alexander、摩根 Morgan和布罗德 Broad，他们都是'''经典涌现主义者 Classical Emergentists'''。经典涌现主义者提出这个概念和方法的时间是在二十世纪初期。这种方法的目的是在还原论的唯物主义和二元论这两种不同的本体论之间找到一个足够好的调和。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
While emergence has had a valuable and important role with the foundation of Computational Sociology, there are those who do not necessarily agree.  One major leader in the field, Epstein, doubted the use because there were aspects that are unexplainable.  Epstein put up a claim against emergentism, in which he says it &amp;quot;is precisely the generative sufficiency of the parts that constitutes the whole's explanation&amp;quot;.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
While emergence has had a valuable and important role with the foundation of Computational Sociology, there are those who do not necessarily agree.  One major leader in the field, Epstein, doubted the use because there were aspects that are unexplainable.  Epstein put up a claim against emergentism, in which he says it &amp;quot;is precisely the generative sufficiency of the parts that constitutes the whole's explanation&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
虽然涌现在计算社会学的建立上发挥了宝贵而重要的作用，但也有人不太同意。该领域的一个主要人物爱泼斯坦 Epstein对这种&amp;lt;font color='red'&amp;gt;用法&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;概念&amp;lt;/font&amp;gt;持怀疑态度，因为有些方面是这个&amp;lt;font color='red'&amp;gt;用法&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;概念&amp;lt;/font&amp;gt;无法解释的。爱泼斯坦提出了一种反对“涌现主义”的观点，他表示:“正是这些部分的有生成意义的充分性构成了对整体的解释”。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Agent-based models have had a historical influence on Computational Sociology.   These models first came around in the 1960s, and were used to simulate control and feedback processes in organizations, cities, etc.  During the 1970s, the application introduced the use of individuals as the main units for the analyses and used bottom-up strategies for modeling behaviors.  The last wave occurred in the 1980s.  At this time, the models were still bottom-up; the only difference is that the agents interact interdependently.&amp;lt;ref name=&amp;quot;EACICS&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Agent-based models have had a historical influence on Computational Sociology. These models first came around in the 1960s, and were used to simulate control and feedback processes in organizations, cities, etc.  During the 1970s, the application introduced the use of individuals as the main units for the analyses and used bottom-up strategies for modeling behaviors.  The last wave occurred in the 1980s.  At this time, the models were still bottom-up; the only difference is that the agents interact interdependently.&lt;br /&gt;
&lt;br /&gt;
'''基于主体的模型 Agent-based Models'''对计算社会学有着历史性的影响。这些模型最早出现在20世纪60年代，用于仿真模拟组织、城市等系统的控制和反馈过程。在20世纪70年代，应用程序引入个体作为主要的分析单元，并使用自下而上的策略来对行为建模。最后一波浪潮发生在20世纪80年代。那时，模型仍然是自下而上的; 唯一的区别是主体之间具有互相依赖和相互作用。&lt;br /&gt;
&lt;br /&gt;
===Systems theory and structural functionalism 系统理论和结构功能主义===&lt;br /&gt;
&lt;br /&gt;
{{main|Systems theory|Structural functionalism}}&lt;br /&gt;
&lt;br /&gt;
In the post-war era, [[Vannevar Bush]]'s [[differential analyser]], [[John von Neumann]]'s [[Von Neumann cellular automata|cellular automata]], [[Norbert Wiener]]'s [[cybernetics]], and [[Claude Shannon]]'s [[information theory]] became influential paradigms for modeling and understanding complexity in technical systems. In response, scientists in disciplines such as physics, biology, electronics, and economics began to articulate a [[systems theory|general theory of systems]] in which all natural and physical phenomena are manifestations of interrelated elements in a system that has common patterns and properties. Following [[Émile Durkheim]]'s call to analyze complex modern society ''[[sui generis]]'',&amp;lt;ref&amp;gt;{{cite book|first=Émile |last=Durkheim |title=The Division of Labor in Society |location=New York, NY |publisher=Macmillan}}&amp;lt;/ref&amp;gt; post-war structural functionalist sociologists such as [[Talcott Parsons]] seized upon these theories of systematic and hierarchical interaction among constituent components to attempt to generate grand unified sociological theories, such as the [[AGIL paradigm]].&amp;lt;ref name=&amp;quot;Bailey&amp;quot;&amp;gt;{{cite book|first1=Kenneth D. |last1=Bailey |editor=Jonathan H. Turner |chapter=Systems Theory |title=Handbook of Sociological Theory |publisher=Springer Science |year=2006 |location=New York, NY |isbn=978-0-387-32458-6 |pages=379–404}}&amp;lt;/ref&amp;gt; Sociologists such as [[George Homans]] argued that sociological theories should be formalized into hierarchical structures of propositions and precise terminology from which other propositions and hypotheses could be derived and operationalized into empirical studies.&amp;lt;ref name=&amp;quot;Blackwell&amp;quot;&amp;gt;{{cite encyclopedia|year=2007 |title=Computational Sociology |last=Bainbridge |first=William Sims |encyclopedia=Blackwell Encyclopedia of Sociology |publisher=Blackwell Reference Online |url=http://www.sociologyencyclopedia.com/subscriber/tocnode?id=g9781405124331_chunk_g97814051243319_ss1-85 |doi=10.1111/b.9781405124331.2007.x |hdl=10138/224218 |editor=Ritzer, George|isbn=978-1-4051-2433-1|hdl-access=free }}&amp;lt;/ref&amp;gt; Because computer algorithms and programs had been used as early as 1956 to test and validate mathematical theorems, such as the [[four color theorem]],&amp;lt;ref&amp;gt;{{cite book|last=Crevier |first=D. |year=1993 |title=AI: The Tumultuous History of the Search for Artificial Intelligence |url=https://archive.org/details/aitumultuoushist00crev |url-access=registration |publisher=Basic Books |location=New York, NY}}&amp;lt;/ref&amp;gt; some scholars anticipated that similar computational approaches could &amp;quot;solve&amp;quot; and &amp;quot;prove&amp;quot; analogously formalized problems and theorems of social structures and dynamics.&lt;br /&gt;
&lt;br /&gt;
In the post-war era, Vannevar Bush's differential analyser, John von Neumann's cellular automata, Norbert Wiener's cybernetics, and Claude Shannon's information theory became influential paradigms for modeling and understanding complexity in technical systems. In response, scientists in disciplines such as physics, biology, electronics, and economics began to articulate a general theory of systems in which all natural and physical phenomena are manifestations of interrelated elements in a system that has common patterns and properties. Following Émile Durkheim's call to analyze complex modern society sui generis, post-war structural functionalist sociologists such as Talcott Parsons seized upon these theories of systematic and hierarchical interaction among constituent components to attempt to generate grand unified sociological theories, such as the AGIL paradigm. Sociologists such as George Homans argued that sociological theories should be formalized into hierarchical structures of propositions and precise terminology from which other propositions and hypotheses could be derived and operationalized into empirical studies. Because computer algorithms and programs had been used as early as 1956 to test and validate mathematical theorems, such as the four color theorem, some scholars anticipated that similar computational approaches could &amp;quot;solve&amp;quot; and &amp;quot;prove&amp;quot; analogously formalized problems and theorems of social structures and dynamics.&lt;br /&gt;
&lt;br /&gt;
战后时期，范内瓦·布什（Vannevar Bush）的'''微分分析机 Differential Analyser''' 、冯·诺伊曼（John von Neumann）的'''元胞自动机 Cellular Automata'''、 维纳（Norbert Wiener）的'''控制论 Cybernetics'''和克劳德·香农（Claude Shannon）的'''信息论 Information Theory'''成为技术系统中建模和理解复杂性的重要范式。物理学、生物学、电子学和经济学等学科的科学家开始阐述系统的一般理论，即所有自然和物理现象都是具有共同模式和属性的系统中相互关联的元素的表现。按照涂尔干（Émile Durkheim）分析特定的复杂现代社会&lt;br /&gt;
&lt;br /&gt;
（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]）Following Émile Durkheim's call to analyze complex modern society sui generis）&lt;br /&gt;
  --~~克劳德·香农（Claude Shannon）  这些同样去括号&lt;br /&gt;
&lt;br /&gt;
的要求，战后结构功能主义社会学家如帕森斯（Talcott Parsons）利用这些组成部分之间系统和等级相互作用的理论，试图产生大统一的社会学理论，如 AGIL 范式。霍曼斯（George Homans）等社会学家认为，社会学理论应该被构建为具有命题和精确术语的等级结构，并且从中可以得出能够在实证研究中被操作化的其他命题和假设。由于早在1956年计算机算法和程序就已经被用来测试和验证数学定理（如'''四色定理Four Color Theorem'''），一些学者预计相似的计算方法可以“解决”和“证明”类似的社会结构和动态的问题和定理。&lt;br /&gt;
&lt;br /&gt;
===Macrosimulation and microsimulation 宏观模拟和微观模拟===&lt;br /&gt;
&lt;br /&gt;
{{main|System dynamics|Microsimulation}}&lt;br /&gt;
&lt;br /&gt;
By the late 1960s and early 1970s, social scientists used increasingly available computing technology to perform macro-simulations of control and feedback processes in organizations, industries, cities, and global populations. These models used differential equations to predict population distributions as holistic functions of other systematic factors such as inventory control, urban traffic, migration, and disease transmission.&amp;lt;ref&amp;gt;{{cite book|first=Jay |last=Forrester |year=1971 |title=World Dynamics |location=Cambridge, MA |publisher=MIT Press}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|doi=10.1287/opre.26.2.237|title=Using Simulation to Develop and Validate Analytic Models: Some Case Studies |first1=Edward J. |last1=Ignall |first2=Peter |last2=Kolesar |first3=Warren E. |last3=Walker |journal=Operations Research |volume=26 |issue=2 |year=1978 |pages=237–253}}&amp;lt;/ref&amp;gt; Although simulations of social systems received substantial attention in the mid-1970s after the [[Club of Rome]] published reports predicting that policies promoting exponential economic growth would eventually bring global environmental catastrophe,&amp;lt;ref&amp;gt;{{cite book|title=The Dynamics of Growth in a Finite World |last1=Meadows |first1=DL |last2=Behrens |first2=WW |last3=Meadows |first3=DH |last4=Naill |first4=RF |last5= Randers |first5=J |last6=Zahn |first6=EK |year=1974 |location=Cambridge, MA |publisher=MIT Press}}&amp;lt;/ref&amp;gt; the inconvenient conclusions led many authors to seek to discredit the models, attempting to make the researchers themselves appear unscientific.&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;/&amp;gt;&amp;lt;ref&amp;gt;{{cite news|title=Computer View of Disaster Is Rebutted |newspaper=The New York Times |date=October 18, 1974|url=https://www.nytimes.com/1974/10/18/archives/computer-view-of-disaster-is-rebutted.html?_r=0}}&amp;lt;/ref&amp;gt; Hoping to avoid the same fate, many social scientists turned their attention toward micro-simulation models to make forecasts and study policy effects by modeling aggregate changes in state of individual-level entities rather than the changes in distribution at the population level.&amp;lt;ref&amp;gt;{{cite journal|doi=10.1016/0167-2681(90)90038-F|title=From engineering to microsimulation : An autobiographical reflection |journal=Journal of Economic Behavior &amp;amp; Organization |year=1990 |volume=14 |issue=1 |pages=5–27 |first=Guy H. |last=Orcutt}}&amp;lt;/ref&amp;gt; However, these micro-simulation models did not permit individuals to interact or adapt and were not intended for basic theoretical research.&amp;lt;ref name=&amp;quot;MW&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
By the late 1960s and early 1970s, social scientists used increasingly available computing technology to perform macro-simulations of control and feedback processes in organizations, industries, cities, and global populations. These models used differential equations to predict population distributions as holistic functions of other systematic factors such as inventory control, urban traffic, migration, and disease transmission. Although simulations of social systems received substantial attention in the mid-1970s after the Club of Rome published reports predicting that policies promoting exponential economic growth would eventually bring global environmental catastrophe, the inconvenient conclusions led many authors to seek to discredit the models, attempting to make the researchers themselves appear unscientific. Hoping to avoid the same fate, many social scientists turned their attention toward micro-simulation models to make forecasts and study policy effects by modeling aggregate changes in state of individual-level entities rather than the changes in distribution at the population level. However, these micro-simulation models did not permit individuals to interact or adapt and were not intended for basic theoretical research.&lt;br /&gt;
&lt;br /&gt;
截至20世纪60年代末70年代初，社会科学家越来越多地使用已有的计算技术，在组织、工业、城市和全球人口中进行控制和反馈过程的'''宏观模拟 Macrosimulation''' 。这些模型使用微分方程作为其他系统因素的整体函数来预测人口分布，这些系统因素包括库存控制、城市交通、人口迁移和疾病传播等。20世纪70年代中期，'''罗马俱乐部 Club of Rome''' 发表报告预测，促进指数式经济增长的政策最终将导致全球环境灾难，这个悲观的结论导致许多研究者试图反驳这些模型，并试图让研究显得不那么科学。&lt;br /&gt;
  （--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） 根据意思，inconvenient译为悲观的，因为这个结论预示了悲观的未来，所以令指出这一点的科学家们感到inconvenient）&lt;br /&gt;
为了避免同样的情况，许多社会科学家将注意力转向'''微观模拟 Microsimulation'''模型。这些模型通过模拟个体状态的总体变化而不是总体人口级别的变化来进行预测和研究政策的效果。然而，这些微观模拟模型并不允许个体相互作用或适应、变化（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]）变化是根据适应（adapt）加上去的，不知道是否合理），研究者也不打算将它们用于基础理论研究。&lt;br /&gt;
&lt;br /&gt;
===Cellular automata and agent-based modeling 元胞自动机和基于主体建模===&lt;br /&gt;
&lt;br /&gt;
{{main|Cellular automata|agent-based modeling}}&lt;br /&gt;
&lt;br /&gt;
The 1970s and 1980s were also a time when physicists and mathematicians were attempting to model and analyze how simple component units, such as atoms, give rise to global properties, such as complex material properties at low temperatures, in magnetic materials, and within turbulent flows.&amp;lt;ref&amp;gt;{{cite book|title=Cellular automata machines: a new environment for modeling |url=https://archive.org/details/cellularautomata00toff |url-access=registration |first1=Tommaso |last1=Toffoli |first2=Norman |last2=Margolus | author2-link = Norman Margolus |year=1987 |publisher=MIT Press |location=Cambridge, MA}}&amp;lt;/ref&amp;gt; Using cellular automata, scientists were able to specify systems consisting of a grid of cells in which each cell only occupied some finite states and changes between states were solely governed by the states of immediate neighbors. Along with advances in [[artificial intelligence]] and [[microcomputer]] power, these methods contributed to the development of &amp;quot;[[chaos theory]]&amp;quot; and &amp;quot;[[complex systems|complexity theory]]&amp;quot; which, in turn, renewed interest in understanding complex physical and social systems across disciplinary boundaries.&amp;lt;ref name=&amp;quot;SfSS1&amp;quot;/&amp;gt; Research organizations explicitly dedicated to the interdisciplinary study of complexity were also founded in this era: the [[Santa Fe Institute]] was established in 1984 by scientists based at [[Los Alamos National Laboratory]] and the BACH group at the [[University of Michigan]] likewise started in the mid-1980s.&lt;br /&gt;
&lt;br /&gt;
The 1970s and 1980s were also a time when physicists and mathematicians were attempting to model and analyze how simple component units, such as atoms, give rise to global properties, such as complex material properties at low temperatures, in magnetic materials, and within turbulent flows. Using cellular automata, scientists were able to specify systems consisting of a grid of cells in which each cell only occupied some finite states and changes between states were solely governed by the states of immediate neighbors. Along with advances in artificial intelligence and microcomputer power, these methods contributed to the development of &amp;quot;chaos theory&amp;quot; and &amp;quot;complexity theory&amp;quot; which, in turn, renewed interest in understanding complex physical and social systems across disciplinary boundaries. Research organizations explicitly dedicated to the interdisciplinary study of complexity were also founded in this era: the Santa Fe Institute was established in 1984 by scientists based at Los Alamos National Laboratory and the BACH group at the University of Michigan likewise started in the mid-1980s.&lt;br /&gt;
&lt;br /&gt;
20世纪70年代和80年代，物理学家和数学家也在试图模拟和分析简单的组成单位如何产生整体特性，比如低温环境中原子在磁性材料和湍流中的复杂材料特性。使用'''元胞自动机 Cellular Automata'''，科学家们能够指定由元胞网格组成的系统，其中每个元胞只占据一些有限的状态，状态之间的变化完全由相邻元胞的状态控制。随着人工智能和微型计算机能力的进步，这些方法促进了“混沌理论”和“复杂性理论”的发展，这反过来又重新引起了人们对跨学科的复杂物理和社会系统的兴趣。明确致力于跨学科复杂性研究的机构也是在这个时代成立的: 圣菲研究所是由美国洛斯阿拉莫斯国家实验室（Los Alamos National Laboratory）的科学家于1984年建立的，密歇根大学的 BACH 小组也是在20世纪80年代中期建立的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This cellular automata paradigm gave rise to a third wave of social simulation emphasizing agent-based modeling. Like micro-simulations, these models emphasized bottom-up designs but adopted four key assumptions that diverged from microsimulation: autonomy, interdependency, simple rules, and adaptive behavior.&amp;lt;ref name=&amp;quot;MW&amp;quot;/&amp;gt; Agent-based models are less concerned with predictive accuracy and instead emphasize theoretical development.&amp;lt;ref&amp;gt;{{cite journal |title=A simulation of the structure of academic science |journal=Sociological Research Online |volume=2 |issue=2 |pages=1–15 |year=1997 |first=Nigel |last=Gilbert |url=http://www.socresonline.org.uk/socresonline/2/2/3.html |doi=10.5153/sro.85 |access-date=2009-12-16 |archive-url=https://web.archive.org/web/19980524062306/http://www.socresonline.org.uk/socresonline/2/2/3.html |archive-date=1998-05-24 |url-status=dead }}&amp;lt;/ref&amp;gt; In 1981, mathematician and political scientist [[Robert Axelrod]] and evolutionary biologist [[W.D. Hamilton]] published a major paper in ''[[Science (journal)|Science]]'' titled &amp;quot;The Evolution of Cooperation&amp;quot; which used an agent-based modeling approach to demonstrate how social cooperation based upon reciprocity can be established and stabilized in a [[prisoner's dilemma]] game when agents followed simple rules of self-interest.&amp;lt;ref&amp;gt;{{cite journal|title=The Evolution of Cooperation |first1=Robert |last1=Axelrod |first2=William D. |last2=Hamilton |journal=Science |volume=211 |issue=4489 |pages=1390–1396 |doi=10.1126/science.7466396|pmid=7466396 |date=March 27, 1981|bibcode=1981Sci...211.1390A }}&amp;lt;/ref&amp;gt; Axelrod and Hamilton demonstrated that individual agents following a simple rule set of (1) cooperate on the first turn and (2) thereafter replicate the partner's previous action were able to develop &amp;quot;norms&amp;quot; of cooperation and sanctioning in the absence of canonical sociological constructs such as demographics, values, religion, and culture as preconditions or mediators of cooperation.&amp;lt;ref name=&amp;quot;Cooperation&amp;quot;/&amp;gt; Throughout the 1990s, scholars like [[William Sims Bainbridge]], [[Kathleen Carley]], [[Michael Macy]],  and [[John Skvoretz]] developed multi-agent-based models of [[generalized reciprocity]], [[prejudice]], [[social influence]], and organizational [[information processing]]. In 1999, [[Nigel Gilbert]] published the first textbook on Social Simulation: ''Simulation for the social scientist'' and established its most relevant journal: the [[Journal of Artificial Societies and Social Simulation]].&lt;br /&gt;
&lt;br /&gt;
This cellular automata paradigm gave rise to a third wave of social simulation emphasizing agent-based modeling. Like micro-simulations, these models emphasized bottom-up designs but adopted four key assumptions that diverged from microsimulation: autonomy, interdependency, simple rules, and adaptive behavior. In 1981, mathematician and political scientist Robert Axelrod and evolutionary biologist W.D. Hamilton published a major paper in Science titled &amp;quot;The Evolution of Cooperation&amp;quot; which used an agent-based modeling approach to demonstrate how social cooperation based upon reciprocity can be established and stabilized in a prisoner's dilemma game when agents followed simple rules of self-interest. Axelrod and Hamilton demonstrated that individual agents following a simple rule set of (1) cooperate on the first turn and (2) thereafter replicate the partner's previous action were able to develop &amp;quot;norms&amp;quot; of cooperation and sanctioning in the absence of canonical sociological constructs such as demographics, values, religion, and culture as preconditions or mediators of cooperation. Throughout the 1990s, scholars like William Sims Bainbridge, Kathleen Carley, Michael Macy,  and John Skvoretz developed multi-agent-based models of generalized reciprocity, prejudice, social influence, and organizational information processing. In 1999, Nigel Gilbert published the first textbook on Social Simulation: Simulation for the social scientist and established its most relevant journal: the Journal of Artificial Societies and Social Simulation.&lt;br /&gt;
&lt;br /&gt;
元胞自动机范式引发了强调'''基于主体建模 Agent-based Modeling'''的第三次社会模拟浪潮。与微观模拟一样，这些模型强调自下而上的设计，但采用了与微观模拟不同的四个关键假设: '''自主性 Autonomy'''、'''相互依赖性 Interdependency'''、'''简单规则 Simple Rules'''和'''适应性行为 Adaptive Behavior'''。1981年，数学家、政治学家阿克塞尔罗德（Robert Axelrod）和进化生物学家汉密尔顿（W.D. Hamilton）在《科学》杂志上发表了一篇名为《合作的进化》（The Evolution of Cooperation）的重要论文，该论文采用基于主体建模方法，论证了在一个囚徒困境中，当主体遵循简单的自利规则时，互惠的社会合作是如何建立和稳定的。阿克塞尔罗德和汉密尔顿证明，主体遵循这样一套简单的规则: (1)在第一轮进行合作，(2)在其后重复伙伴以前的行动，能够在没有人口学差异、价值观、宗教和文化等社会规范作为合作的先决条件或中介的情况下制定合作和制裁的“规范”。整个20世纪90年代，像威廉·希姆斯·本布里奇（William Sims Bainbridge），Kathleen Carley，Michael Macy 和 John Skvoretz 这样的学者开发了基于多主体的广义互惠、偏见、社会影响和组织信息处理模型。1999年，吉尔伯特（Nigel Gilbert）出版了第一本关于社会模拟: 写给社会科学家的仿真模拟（Simulation for the social scientist）的教科书，并建立了它最相关的杂志: 人工社会和社会模拟杂志（the Journal of Artificial Societies and Social Simulation）。&lt;br /&gt;
&lt;br /&gt;
===Data mining and social network analysis 数据挖掘和社会网络分析===&lt;br /&gt;
&lt;br /&gt;
{{main|Data mining|Social network analysis}}&lt;br /&gt;
&lt;br /&gt;
--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） 少一段原文 &lt;br /&gt;
Independent from developments in computational models of social systems, social network analysis emerged in the 1970s and 1980s from advances in graph theory, statistics, and studies of social structure as a distinct analytical method and was articulated and employed by sociologists like James S. Coleman, Harrison White, Linton Freeman, J. Clyde Mitchell, Mark Granovetter, Ronald Burt, and Barry Wellman.[22] The increasing pervasiveness of computing and telecommunication technologies throughout the 1980s and 1990s demanded analytical techniques, such as network analysis and multilevel modeling, that could scale to increasingly complex and large data sets. The most recent wave of computational sociology, rather than employing simulations, uses network analysis and advanced statistical techniques to analyze large-scale computer databases of electronic proxies for behavioral data. Electronic records such as email and instant message records, hyperlinks on the World Wide Web, mobile phone usage, and discussion on Usenet allow social scientists to directly observe and analyze social behavior at multiple points in time and multiple levels of analysis without the constraints of traditional empirical methods such as interviews, participant observation, or survey instruments.[23] Continued improvements in machine learning algorithms likewise have permitted social scientists and entrepreneurs to use novel techniques to identify latent and meaningful patterns of social interaction and evolution in large electronic datasets.[24][25]&lt;br /&gt;
&lt;br /&gt;
Independent from developments in computational models of social systems, social network analysis emerged in the 1970s and 1980s from advances in graph theory, statistics, and studies of social structure as a distinct analytical method and was articulated and employed by sociologists like [[James Samuel Coleman|James S. Coleman]], [[Harrison White]], [[Linton Freeman]], [[J. Clyde Mitchell]], [[Mark Granovetter]], [[Ronald Burt]], and [[Barry Wellman]].&amp;lt;ref&amp;gt;{{cite book|title=The Development of Social Network Analysis: A Study in the Sociology of Science |first=Linton C. |last=Freeman |publisher=Empirical Press |location=Vancouver, BC |year=2004}}&amp;lt;/ref&amp;gt; The increasing pervasiveness of computing and telecommunication technologies throughout the 1980s and 1990s demanded analytical techniques, such as [[network theory|network analysis]] and [[multilevel modeling]], that could scale to increasingly complex and large data sets. The most recent wave of computational sociology, rather than employing simulations, uses network analysis and advanced statistical techniques to analyze large-scale computer databases of electronic proxies for behavioral data. Electronic records such as email and instant message records, hyperlinks on the [[World Wide Web]], mobile phone usage, and discussion on [[Usenet]] allow social scientists to directly observe and analyze social behavior at multiple points in time and multiple levels of analysis without the constraints of traditional empirical methods such as interviews, participant observation, or survey instruments.&amp;lt;ref&amp;gt;{{cite journal|title=Life in the network: the coming age of computational social science|first9=J|last10=Gutmann|first10=M.|last11=Jebara|first11=T.|last12=King|first12=G.|last13=Macy|first13=M.|last14=Roy|first14=D.|last15=Van Alstyne|first15=M.|last9=Fowler|first8=N|last8=Contractor|first7=N|last7=Christakis|first6=D|last6=Brewer|first5=AL|last5=Barabasi|first4=S |journal=Science|last4=Aral |date=February 6, 2009|first3=L |volume=323|pmid=19197046 |issue=5915|last3=Adamic |pages=721–723|pmc=2745217 |doi=10.1126/science.1167742 |first1=David |last1=Lazer |first2=Alex |last2=Pentland |display-authors=8}}&amp;lt;/ref&amp;gt; Continued improvements in [[machine learning]] algorithms likewise have permitted social scientists and entrepreneurs to use novel techniques to identify latent and meaningful patterns of social interaction and evolution in large electronic datasets.&amp;lt;ref&amp;gt;{{cite journal|first1=Jaideep |last1=Srivastava |first2=Robert |last2=Cooley |first3=Mukund |last3=Deshpande |first4=Pang-Ning |last4=Tan |journal=Proceedings of the ACM Conference on Knowledge Discovery and Data Mining |title=Web usage mining: discovery and applications of usage patterns from Web data|volume=1 |year=2000 |pages=12–23 |doi=10.1145/846183.846188|issue=2}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|doi=10.1016/S0169-7552(98)00110-X|title=The anatomy of a large-scale hypertextual Web search engine |first1=Sergey |last1=Brin |first2=Lawrence |last2=Page |journal=Computer Networks and ISDN Systems |volume=30 |issue=1–7 |pages=107–117 |date=April 1998|citeseerx=10.1.1.115.5930 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Independent from developments in computational models of social systems, social network analysis emerged in the 1970s and 1980s from advances in graph theory, statistics, and studies of social structure as a distinct analytical method and was articulated and employed by sociologists like James S. Coleman, Harrison White, Linton Freeman, J. Clyde Mitchell, Mark Granovetter, Ronald Burt, and Barry Wellman. The increasing pervasiveness of computing and telecommunication technologies throughout the 1980s and 1990s demanded analytical techniques, such as network analysis and multilevel modeling, that could scale to increasingly complex and large data sets. The most recent wave of computational sociology, rather than employing simulations, uses network analysis and advanced statistical techniques to analyze large-scale computer databases of electronic proxies for behavioral data. Electronic records such as email and instant message records, hyperlinks on the World Wide Web, mobile phone usage, and discussion on Usenet allow social scientists to directly observe and analyze social behavior at multiple points in time and multiple levels of analysis without the constraints of traditional empirical methods such as interviews, participant observation, or survey instruments. Continued improvements in machine learning algorithms likewise have permitted social scientists and entrepreneurs to use novel techniques to identify latent and meaningful patterns of social interaction and evolution in large electronic datasets.&lt;br /&gt;
&lt;br /&gt;
'''社会网络分析 Social Network Analysis'''独立于社会系统计算模型的发展，在20世纪70年代和80年代出现于图论、统计学和社会结构的研究中，它作为一种独特的分析方法被社会学家如 James s. Coleman，Harrison White，Linton Freeman，J. Clyde Mitchell，Mark Granovetter，Ronald Burt 和 Barry Wellman 等阐述和采用。在整个1980年代和1990年代，计算和通信技术日益普及，这要求采用诸如网络分析和多级建模等分析技术，这些技术可以扩展到日益复杂和庞大的数据集中。最近的计算社会学没有使用模拟，而是使用网络分析和先进的统计技术来分析大规模计算机数据库中电子代理的行为数据。电子记录，如电子邮件和即时消息记录，万维网上的超链接，移动电话数据，以及 Usenet 上的讨论，使社会科学家能够直接观察社会行为并在多个时间点和多个层次的分析行为，并且不受传统的实证方法，如访谈、观察（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]）为了通顺，删除研究对象/被试：participants）或调查工具的限制。机器学习算法的不断改进同样使得社会科学家和企业家能够使用新技术来识别大型电子数据集中潜在但有意义的社会互动和演化模式。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:Tripletsnew2012.png|thumb|right|Narrative network of US Elections 2012&amp;lt;ref name=&amp;quot;ReferenceA&amp;quot;&amp;gt;{{cite journal|title=Automated analysis of the US presidential elections using Big Data and network analysis|author1=S Sudhahar|author2=GA Veltri|author3=N Cristianini|journal=Big Data &amp;amp; Society|volume=2|issue=1|pages=1–28|year=2015|doi=10.1177/2053951715572916|doi-access=free}}&amp;lt;/ref&amp;gt;]]&lt;br /&gt;
&lt;br /&gt;
Narrative network of US Elections 2012&lt;br /&gt;
&lt;br /&gt;
【图2：Narrative network of US Elections 2012 + 2012年美国大选叙事网络】&lt;br /&gt;
&lt;br /&gt;
The automatic parsing of textual corpora has enabled the extraction of actors and their relational networks on a vast scale, turning textual data into network data.  The resulting networks, which can contain thousands of nodes, are then analysed by using tools from Network theory to identify the key actors, the key communities or parties, and general properties such as robustness or structural stability of the overall network, or centrality of certain nodes.&amp;lt;ref&amp;gt;{{cite journal|title=Network analysis of narrative content in large corpora|author1=S Sudhahar|author2=G De Fazio|author3=R Franzosi|author4=N Cristianini|journal=Natural Language Engineering|volume=21|issue=1|pages=1–32|year=2013|doi=10.1017/S1351324913000247 |url=https://research-information.bristol.ac.uk/files/129621186/Network_Analysis_of_Narrative_Content_in_Large_Corpora.pdf}}&amp;lt;/ref&amp;gt; This automates the approach introduced by quantitative narrative analysis,&amp;lt;ref&amp;gt;{{cite book|title=Quantitative Narrative Analysis|last=Franzosi|first=Roberto|publisher=Emory University|year=2010}}&amp;lt;/ref&amp;gt; whereby subject-verb-object triplets are identified with pairs of actors linked by an action, or pairs formed by actor-object.&amp;lt;ref name=&amp;quot;ReferenceA&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The automatic parsing of textual corpora has enabled the extraction of actors and their relational networks on a vast scale, turning textual data into network data.  The resulting networks, which can contain thousands of nodes, are then analysed by using tools from Network theory to identify the key actors, the key communities or parties, and general properties such as robustness or structural stability of the overall network, or centrality of certain nodes. This automates the approach introduced by quantitative narrative analysis, whereby subject-verb-object triplets are identified with pairs of actors linked by an action, or pairs formed by actor-object.&lt;br /&gt;
&lt;br /&gt;
文本语料库的自动解析使对参与者及其关系网络的大规模提取成为可能，它将文本数据转换为网络数据。由此产生的网络可以包含数千个'''节点 Nodes'''，然后利用网络理论中的工具对其进行分析，以确定关键参与者、关键群体，以及网络的总体特性如稳健性、结构稳定性，或某些节点的'''中心性 Centrality'''等。这使'''定量叙事分析Quantitative Narrative Analysis'''引入的方法得以自动化，据此，主语-动词-宾语三元组被看作由动作连接的成对行为者，或者由行为者-宾语形成的成对行为者。&lt;br /&gt;
&lt;br /&gt;
===Computational content analysis 计算机内容分析 （名词翻译可吗？）===&lt;br /&gt;
&lt;br /&gt;
[[Content analysis]] has been a traditional part of social sciences and media studies for a long time. The automation of content analysis has allowed a &amp;quot;[[big data]]&amp;quot; revolution to take place in that field, with studies in social media and newspaper content that include millions of news items. [[Gender bias]], [[readability]], content similarity, reader preferences, and even mood have been analyzed based on [[text mining]] methods over millions of documents.&amp;lt;ref&amp;gt;{{cite journal|author1=I. Flaounas|author2=M. Turchi|author3=O. Ali|author4=N. Fyson|author5=T. De Bie|author6=N. Mosdell|author7=J. Lewis|author8=N. Cristianini|title=The Structure of EU Mediasphere|journal=PLOS One|volume=5|issue=12|pages=e14243|year=2010|doi=10.1371/journal.pone.0014243|url=https://orca-mwe.cf.ac.uk/50732/1/Flaounas%202010.pdf|pmid=21170383|pmc=2999531|bibcode=2010PLoSO...514243F}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|title=Nowcasting Events from the Social Web with Statistical Learning|author1=V Lampos|author2=N Cristianini|journal=ACM Transactions on Intelligent Systems and Technology |volume=3|issue=4|page=72|doi=10.1145/2337542.2337557|year=2012|url=http://www.lampos.net/sites/default/files/papers/lampos2012nowcasting.pdf}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite conference|title=NOAM: news outlets analysis and monitoring system|author1=I. Flaounas|author2=O. Ali|author3=M. Turchi|author4=T Snowsill|author5=F Nicart|author6=T De Bie|author7=N Cristianini|conference=Proc. of the 2011 ACM SIGMOD international conference on Management of data|year=2011|url=http://www.tijldebie.net/system/files/SIGMOD_11_demo_Ilias.pdf|doi=10.1145/1989323.1989474}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite book|author=N Cristianini|title=''Combinatorial Pattern Matching''|pages=2–13|year=2011|volume=6661|series= Lecture Notes in Computer Science|isbn=978-3-642-21457-8|doi=10.1007/978-3-642-21458-5_2|chapter=Automatic Discovery of Patterns in Media Content|citeseerx=10.1.1.653.9525}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite journal|last=Lansdall-Welfare|first=Thomas|last2=Sudhahar|first2=Saatviga|last3=Thompson|first3=James|last4=Lewis|first4=Justin|last5=Team|first5=FindMyPast Newspaper|last6=Cristianini|first6=Nello|date=2017-01-09|title=Content analysis of 150 years of British periodicals|url=http://www.pnas.org/content/early/2017/01/03/1606380114|journal=Proceedings of the National Academy of Sciences|volume=114|issue=4|language=en|pages=E457–E465|doi=10.1073/pnas.1606380114|issn=0027-8424|pmid=28069962|pmc=5278459}}&amp;lt;/ref&amp;gt; The analysis of readability, gender bias and topic bias was demonstrated in Flaounas et al.&amp;lt;ref&amp;gt;{{cite journal|author1=I. Flaounas|author2=O. Ali|author3=M. Turchi|author4=T. Lansdall-Welfare|author5=T. De Bie|author6=N. Mosdell|author7=J. Lewis|author8=N. Cristianini|title=Research methods in the age of digital journalism|journal=Digital Journalism|year=2012|doi=10.1080/21670811.2012.714928|volume=1|pages=102–116}}&amp;lt;/ref&amp;gt; showing how different topics have different gender biases and levels of readability; the possibility to detect mood shifts in a vast population by analysing Twitter content was demonstrated as well.&amp;lt;ref&amp;gt;{{cite conference|title=Effects of the Recession on Public Mood in the UK|author=T Lansdall-Welfare|author2=V Lampos|author3=N Cristianini|series=Mining Social Network Dynamics (MSND) session on Social Media Applications|doi=10.1145/2187980.2188264|conference=Proceedings of the 21st International Conference on World Wide Web|pages=1221–1226|location=New York, NY, USA|url=http://www.cs.bris.ac.uk/Publications/Papers/2001521.pdf}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Content analysis has been a traditional part of social sciences and media studies for a long time. The automation of content analysis has allowed a &amp;quot;big data&amp;quot; revolution to take place in that field, with studies in social media and newspaper content that include millions of news items. Gender bias, readability, content similarity, reader preferences, and even mood have been analyzed based on text mining methods over millions of documents. The analysis of readability, gender bias and topic bias was demonstrated in Flaounas et al. showing how different topics have different gender biases and levels of readability; the possibility to detect mood shifts in a vast population by analysing Twitter content was demonstrated as well.&lt;br /&gt;
&lt;br /&gt;
长期以来，内容分析一直是社会科学和媒体研究的传统方法。内容分析的自动化使得这一领域发生了一场“大数据”革命，这些研究中，社交媒体和报纸内容包括了数百万条的新闻。基于文本挖掘方法，'''性别偏差Gender Bias'''、'''可读性 Readability'''、'''内容相似度 Content Similarity'''、'''读者偏好 Reader Preferences'''，甚至是'''情绪 Mood'''的数以百万计的文档都可以被分析。Flaounas等人对可读性、性别偏差和'''话题偏差 Topic Bias'''为主要研究对象，展示了不同的话题如何有不同水平的性别偏差和可读性; 展示了通过分析推特内容来检测人群情绪变化的可能性。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The analysis of vast quantities of historical newspaper content has been pioneered by Dzogang et al.,&amp;lt;ref&amp;gt;{{Cite journal|last=Dzogang|first=Fabon|last2=Lansdall-Welfare|first2=Thomas|last3=Team|first3=FindMyPast Newspaper|last4=Cristianini|first4=Nello|date=2016-11-08|title=Discovering Periodic Patterns in Historical News|journal=PLOS One|volume=11|issue=11|pages=e0165736|doi=10.1371/journal.pone.0165736|issn=1932-6203|pmc=5100883|pmid=27824911|bibcode=2016PLoSO..1165736D}}&amp;lt;/ref&amp;gt; which showed how periodic structures can be automatically discovered in historical newspapers. A similar analysis was performed on social media, again revealing strongly periodic structures.&amp;lt;ref&amp;gt;[https://core.ac.uk/download/pdf/83929129.pdf Seasonal Fluctuations in Collective Mood Revealed by Wikipedia Searches and Twitter Posts] F Dzogang, T Lansdall-Welfare, N Cristianini - 2016 IEEE International Conference on Data Mining, Workshop on ''Data Mining'' in Human Activity Analysis&lt;br /&gt;
&lt;br /&gt;
The analysis of vast quantities of historical newspaper content has been pioneered by Dzogang et al., which showed how periodic structures can be automatically discovered in historical newspapers. A similar analysis was performed on social media, again revealing strongly periodic structures.&amp;lt;ref&amp;gt;[https://core.ac.uk/download/pdf/83929129.pdf Seasonal Fluctuations in Collective Mood Revealed by Wikipedia Searches and Twitter Posts] F Dzogang, T Lansdall-Welfare, N Cristianini - 2016 IEEE International Conference on Data Mining, Workshop on Data Mining in Human Activity Analysis&lt;br /&gt;
&lt;br /&gt;
对大量历史报纸内容的分析是由 Dzogang 等人率先进行的，他们展示了如何在历史报纸中自动发现'''周期结构 Periodic Structures'''。一个类似的社交媒体上进行的分析，也揭示了强烈的周期性结构。 参考文献[ https://core.ac.uk/download/pdf/83929129.pdf 维基百科搜索和推特帖子揭示的集体情绪的季节性波动] f Dzogang，t Lansdall-Welfare，n Cristianini-2016 IEEE International Conference on Data Mining, Workshop on Data Mining in Human Activity Analysis&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
==Challenges 挑战==&lt;br /&gt;
&lt;br /&gt;
Computational sociology, as with any field of study, faces a set of challenges.&amp;lt;ref name=&amp;quot;MCSS&amp;quot;&amp;gt;Conte, Rosaria, et al. &amp;quot;[https://link.springer.com/content/pdf/10.1140%252Fepjst%252Fe2012-01697-8.pdf Manifesto of computational social science].&amp;quot; The European Physical Journal Special Topics 214.1 (2012): 325-346.&amp;lt;/ref&amp;gt; These challenges need to be handled meaningfully so as to make the maximum impact on society.&lt;br /&gt;
&lt;br /&gt;
Computational sociology, as with any field of study, faces a set of challenges. These challenges need to be handled meaningfully so as to make the maximum impact on society.&lt;br /&gt;
&lt;br /&gt;
计算社会学和其他研究领域一样面临着一系列的挑战。必须有意义地处理这些挑战（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） meaningfully怎么翻译才比较通顺？），才能对社会产生最大的影响。&lt;br /&gt;
  &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Levels and their interactions 层级和层级的交互关系===&lt;br /&gt;
&lt;br /&gt;
Each society that is formed tends to be in one level or the other and there exists tendencies of interactions between and across these levels. Levels need not only be micro-level or macro-level in nature. There can be intermediate levels in which a society exists say - groups, networks, communities etc.&amp;lt;ref name=&amp;quot;MCSS&amp;quot; /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Each society that is formed tends to be in one level or the other and there exists tendencies of interactions between and across these levels. Levels need not only be micro-level or macro-level in nature. There can be intermediate levels in which a society exists say - groups, networks, communities etc.&lt;br /&gt;
&lt;br /&gt;
形成的每个社会都处于某种层次上，并且这些层次之间有相互作用的倾向。社会中的级别不仅可以分为微观或宏观的层次，还可以存在中间的层次，比如群体、网络、社区等。&lt;br /&gt;
（--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|讨论]]） 合并了英文的原句）&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The question however arises as to how to identify these levels and how they come into existence? And once they are in existence how do they interact within themselves and with other levels?&lt;br /&gt;
&lt;br /&gt;
The question however arises as to how to identify these levels and how they come into existence? And once they are in existence how do they interact within themselves and with other levels?&lt;br /&gt;
&lt;br /&gt;
然而问题是，这些层次是如何确定的以及如何产生的？并且，一旦它们产生了，它们如何在自身内部以及与其他层次相互作用？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
If we view entities (agents) as nodes and the connections between them as the edges, we see the formation of networks. The connections in these networks do not come about based on just objective relationships between the entities, rather they are decided upon by factors chosen by the participating entities.&amp;lt;ref&amp;gt;{{cite journal|last1=Egu´ıluz|first1=V. M.|last2=Zimmermann|first2=M. G.|last3=Cela-Conde|first3=C. J.|last4=San Miguel|first4=M.|title=American Journal of Sociology|issue=2005|pages=110, 977}}&amp;lt;/ref&amp;gt; The challenge with this process is that, it is difficult to identify when a set of entities will form a network. These networks may be of trust networks, co-operation networks, dependence networks etc. There have been cases where heterogeneous set of entities have shown to form strong and meaningful networks among themselves.&amp;lt;ref&amp;gt;{{cite journal|last1=Sichman|first1=J. S.|last2=Conte|first2=R.|title=Computational &amp;amp; Mathematical Organization Theory|issue=2002|pages=8(2)}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Ehrhardt|first1=G.|last2=Marsili|first2=M.|last3=Vega-Redondo|first3=F.|title=Physical Review E|issue=2006|pages=74(3)}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
If we view entities (agents) as nodes and the connections between them as the edges, we see the formation of networks. The connections in these networks do not come about based on just objective relationships between the entities, rather they are decided upon by factors chosen by the participating entities. The challenge with this process is that, it is difficult to identify when a set of entities will form a network. These networks may be of trust networks, co-operation networks, dependence networks etc. There have been cases where heterogeneous set of entities have shown to form strong and meaningful networks among themselves.&lt;br /&gt;
&lt;br /&gt;
如果我们把'''实体 Entities'''（'''主体 Agents'''）看作节点，把它们之间的连接看作边，我们就看到了网络的形成。这些网络中的连接并非只是基于实体之间的客观关系，而是由实体选择的因素决定的。这个过程的困难之处在于，很难确定一组实体何时形成网络。这些网络可以是信任网络、合作网络、依赖网络等。在一些情况下，异质的实体集在它们之间形成了强大而有意义的网络。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
As discussed previously, societies fall into levels and in one such level, the individual level, a micro-macro link&amp;lt;ref&amp;gt;Billari, Francesco C. [https://books.google.com/books?hl=en&amp;amp;lr=&amp;amp;id=Tc8iL0b-OycC&amp;amp;oi=fnd&amp;amp;pg=PA1&amp;amp;dq=%22Agent-based+computational+modelling:+applications+in+demography,+social,+economic+and+environmental+sciences%22&amp;amp;ots=6MNVK7JP-e&amp;amp;sig=-o_iS9zCK3r-t1eHn3554UVadUs Agent-based computational modelling: applications in demography, social, economic and environmental sciences]. Taylor &amp;amp; Francis, 2006.&amp;lt;/ref&amp;gt; refers to the interactions which create higher-levels. There are a set of questions that needs to be answered regarding these Micro-Macro links. How they are formed? When do they converge? What is the feedback pushed to the lower levels and how are they pushed?&lt;br /&gt;
&lt;br /&gt;
As discussed previously, societies fall into levels and in one such level, the individual level, a micro-macro link refers to the interactions which create higher-levels. There are a set of questions that needs to be answered regarding these Micro-Macro links. How they are formed? When do they converge? What is the feedback pushed to the lower levels and how are they pushed?&lt;br /&gt;
&lt;br /&gt;
正如前面所讨论的，社会分为不同层次。在其中的一个层次：个体层次中，'''微观-宏观联系 Micro-macro Link'''指的是创造更高层次的相互作用。关于微观-宏观链接有一系列问题等待回答。它们是如何形成的？它们什么时候汇聚？什么反馈被推到了较低的层次，以及它们是如何被推到较低层次的？ &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Another major challenge in this category concerns the validity of information and their sources. In recent years there has been a boom in information gathering and processing. However, little attention was paid to the spread of false information between the societies. Tracing back the sources and finding ownership of such information is difficult.&lt;br /&gt;
&lt;br /&gt;
Another major challenge in this category concerns the validity of information and their sources. In recent years there has been a boom in information gathering and processing. However, little attention was paid to the spread of false information between the societies. Tracing back the sources and finding ownership of such information is difficult.&lt;br /&gt;
&lt;br /&gt;
这一分类的另一个主要挑战涉及信息的有效性及其来源。近年来，信息收集和处理有着蓬勃的发展。但人们很少注意到社会之间虚假信息的传播。追溯资料来源并找到这些资料的所有者是很困难的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Culture modeling 文化建模===&lt;br /&gt;
&lt;br /&gt;
The evolution of the networks and levels in the society brings about cultural diversity.&amp;lt;ref&amp;gt;{{cite journal|last1=Centola|first1=D.|last2=Gonz´alez-Avella|first2=J. C.|last3=Egu´ıluz|first3=V. M.|last4=San Miguel|first4=M.|title=Journal of Conflict Resolution|issue=2007|pages=51}}&amp;lt;/ref&amp;gt; A thought which arises however is that, when people tend to interact and become more accepting of other cultures and beliefs, how is it that diversity still persists? Why is there no convergence? A major challenge is how to model these diversities. Are there external factors like mass media, locality of societies etc. which influence the evolution or persistence of cultural diversities?{{Citation needed|reason=Sounds just like personal thoughts|date=May 2017}}&lt;br /&gt;
&lt;br /&gt;
The evolution of the networks and levels in the society brings about cultural diversity. A thought which arises however is that, when people tend to interact and become more accepting of other cultures and beliefs, how is it that diversity still persists? Why is there no convergence? A major challenge is how to model these diversities. Are there external factors like mass media, locality of societies etc. which influence the evolution or persistence of cultural diversities?&lt;br /&gt;
&lt;br /&gt;
社会网络和层次的演变带来了文化的多样性。然而人们会想，当人们倾向于相互作用，变得更能接受其他文化和信仰时，为什么多样性仍然存在？为什么人们没有趋同？一个主要的挑战是如何为这些多样性建立模型。是否存在大众传媒、社会地域性等外部因素，这些因素影响文化多样性的演化或保持？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Experimentation and evaluation 实验和评估===&lt;br /&gt;
&lt;br /&gt;
Any study or modelling when combined with experimentation needs to be able to address the questions being asked. [[Computational social science]] deals with large scale data and the challenge becomes much more evident as the scale grows. How would one design informative simulations on a large scale? And even if a large scale simulation is brought up, how is the evaluation supposed to be performed?&lt;br /&gt;
&lt;br /&gt;
Any study or modelling when combined with experimentation needs to be able to address the questions being asked. Computational social science deals with large scale data and the challenge becomes much more evident as the scale grows. How would one design informative simulations on a large scale? And even if a large scale simulation is brought up, how is the evaluation supposed to be performed?&lt;br /&gt;
&lt;br /&gt;
任何与实验结合的研究或建模都需要能够解决所提出的问题。计算社会科学处理大规模数据，并且数据规模越大建模的挑战就越明显。如何在一个大规模的数据集里设计信息仿真模型？并且，即使提出了一个大规模的仿真模型，应该如何对它进行评估？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Model choice and model complexities 模型选择和模型复杂性===&lt;br /&gt;
&lt;br /&gt;
Another challenge is identifying the models that would best fit the data and the complexities of these models. These models would help us predict how societies might evolve over time and provide possible explanations on how things work.&amp;lt;ref&amp;gt;Weisberg, Michael. [http://www.academia.edu/download/30604870/lessmorefinal.pdf When less is more: Tradeoffs and idealization in model building]. Diss. Stanford University, 2003.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Another challenge is identifying the models that would best fit the data and the complexities of these models. These models would help us predict how societies might evolve over time and provide possible explanations on how things work.&lt;br /&gt;
&lt;br /&gt;
另一个挑战是确定最适合数据的模型，以及最合适的'''模型复杂性 Model Complexities'''。这些模型将帮助我们预测随着时间的推移社会将如何演变，并为事物如何运动和变化提供可能的解释。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====Generative models 生成模型====&lt;br /&gt;
&lt;br /&gt;
Generative models helps us to perform extensive qualitative analysis in a controlled fashion. A model proposed by Epstein, is the agent-based simulation, which talks about identifying an initial set of heterogeneous entities (agents) and observe their evolution and growth based on simple local rules.&amp;lt;ref&amp;gt;Epstein, Joshua M. [https://www.researchgate.net/profile/Eric_Jones14/publication/283615593_Book_Review_-_Generative_Social_Science_Studies_in_Agent-Based_Computational_Modeling/links/5641398808aebaaea1f70216.pdf Generative social science: Studies in agent-based computational modeling]. Princeton University Press, 2006.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Generative models helps us to perform extensive qualitative analysis in a controlled fashion. A model proposed by Epstein, is the agent-based simulation, which talks about identifying an initial set of heterogeneous entities (agents) and observe their evolution and growth based on simple local rules.&lt;br /&gt;
&lt;br /&gt;
'''生成模型 Generative Models'''帮助我们以一种受控的方式进行广泛的定性分析。爱泼斯坦（Epstein）提出的一个基于主体的模型，就是探讨如何识别异质实体(主体)的'''初始集 Initial Set'''，并根据简单的局部规则观察它们的演化和增长。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
But what are these local rules? How does one identify them for a set of heterogeneous agents? Evaluation and impact of these rules state a whole new set of difficulties.&lt;br /&gt;
&lt;br /&gt;
But what are these local rules? How does one identify them for a set of heterogeneous agents? Evaluation and impact of these rules state a whole new set of difficulties.&lt;br /&gt;
&lt;br /&gt;
但是这些局部规则是什么呢？如何识别一组异质实体？这些规则的评估和影响都是新出现的困难之处。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====Heterogeneous or ensemble models 异质模型和组合模型====&lt;br /&gt;
&lt;br /&gt;
Integrating simple models which perform better on individual tasks to form a Hybrid model is an approach that can be looked into{{Citation needed|reason=unsupported claims|date=May 2017}}. These models can offer better performance and understanding of the data. However the trade-off of identifying and having a deep understanding of the interactions between these simple models arises when one needs to come up with one combined, well performing model. Also, coming up with tools and applications to help analyse and visualize the data based on these hybrid models is another added challenge.&lt;br /&gt;
&lt;br /&gt;
Integrating simple models which perform better on individual tasks to form a Hybrid model is an approach that can be looked into. These models can offer better performance and understanding of the data. However the trade-off of identifying and having a deep understanding of the interactions between these simple models arises when one needs to come up with one combined, well performing model. Also, coming up with tools and applications to help analyse and visualize the data based on these hybrid models is another added challenge.&lt;br /&gt;
&lt;br /&gt;
集成在单个任务中表现良好的简单模型并形成'''混合模型 Hybrid model'''是一种可以继续考虑的方法。这些模型有更好的性能并可以对数据提供更好的理解。然而，当需要提出一个整合的、性能良好的模型时，识别简单模型和深入理解模型之间相互作用的权衡问题就出现了。此外，另一个挑战是开发工具和应用程序来帮助分析和可视化基于这些混合模型的数据。&lt;br /&gt;
&lt;br /&gt;
==Impact 影响==&lt;br /&gt;
&lt;br /&gt;
Computational sociology can bring impacts to science, technology and society.&amp;lt;ref name=&amp;quot;MCSS&amp;quot; /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Computational sociology can bring impacts to science, technology and society.&lt;br /&gt;
&lt;br /&gt;
计算社会学可以给科学、技术和社会带来影响。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Impact on science 对科学的影响===&lt;br /&gt;
&lt;br /&gt;
In order for the study of computational sociology to be effective, there has to be valuable innovations. These innovation can be of the form of new data analytics tools, better models and algorithms. The advent of such innovation will be a boon for the scientific community in large. {{Citation needed|reason=citation for claim on innovation and the type of innovation|date=May 2017}}&lt;br /&gt;
&lt;br /&gt;
In order for the study of computational sociology to be effective, there has to be valuable innovations. These innovation can be of the form of new data analytics tools, better models and algorithms. The advent of such innovation will be a boon for the scientific community in large. &lt;br /&gt;
&lt;br /&gt;
为了使计算社会学的研究有效，必须有一些有价值的创新。这些创新可以是新形式的数据分析工具，或更好的模型和算法。这些创新的出现将为整个科学界带来益处。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Impact on society 对社会的影响===&lt;br /&gt;
&lt;br /&gt;
One of the major challenges of computational sociology is the modelling of social processes {{Citation needed|reason=to support the claim for need of modeling of social processes|date=May 2017}}. Various law and policy makers would be able to see efficient and effective paths to issue new guidelines and the mass in general would be able to evaluate and gain fair understanding of the options presented in front of them enabling an open and well balanced decision process. {{Citation needed|reason=unsupported claims|date=May 2017}}.&lt;br /&gt;
&lt;br /&gt;
One of the major challenges of computational sociology is the modelling of social processes . Various law and policy makers would be able to see efficient and effective paths to issue new guidelines and the mass in general would be able to evaluate and gain fair understanding of the options presented in front of them enabling an open and well balanced decision process. &lt;br /&gt;
&lt;br /&gt;
计算社会学的主要挑战之一是对社会过程的建模。各种法律和政策制定者将能够得到发布新指导方针的快速有效的方法，广大群众将能够评价和更好地理解各种备选方案，从而实现决策进程的公开和平衡。&lt;br /&gt;
&lt;br /&gt;
==Journals and academic publications 期刊和学术出版物==&lt;br /&gt;
&lt;br /&gt;
The most relevant journal of the discipline is the [[Journal of Artificial Societies and Social Simulation]].&lt;br /&gt;
&lt;br /&gt;
The most relevant journal of the discipline is the Journal of Artificial Societies and Social Simulation.&lt;br /&gt;
&lt;br /&gt;
该学科最相关的期刊是《人工社会与社会模拟（the Journal of Artificial Societies and Social Simulation）》。&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20100611121626/http://www.ccsr.uiuc.edu/web/Journals/Journals.html Complexity Research Journal List], from UIUC, IL 复杂研究期刊列表（资料来自伊利诺伊大学香槟分校）&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20100611091342/http://www.ccsr.uiuc.edu/web/Groups/Groups.html Related Research Groups], from UIUC, IL 相关研究组（资料来自伊利诺伊大学香槟分校）&lt;br /&gt;
&lt;br /&gt;
==Associations, conferences and workshops 协会、会议及工作坊==&lt;br /&gt;
&lt;br /&gt;
*[http://www.casos.cs.cmu.edu/naacsos/ North American Association for Computational Social and Organization Sciences]&lt;br /&gt;
&lt;br /&gt;
*[http://www.essa.eu.org/ ESSA: European Social Simulation Association]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Academic programs, departments and degrees 学术课程、院系和学位==&lt;br /&gt;
&lt;br /&gt;
* [http://mediapatterns.enm.bris.ac.uk/ University of Bristol &amp;quot;Mediapatterns&amp;quot; project]&lt;br /&gt;
&lt;br /&gt;
* [http://www.cos.cs.cmu.edu/ Carnegie Mellon University], [http://www.casos.cs.cmu.edu PhD program] in Computation, Organizations and Society (COS)&lt;br /&gt;
&lt;br /&gt;
* [http://www.uchicago.edu University of Chicago]&lt;br /&gt;
&lt;br /&gt;
** [https://macss.uchicago.edu/ Certificate, MA and PhD in Computational Social Sciences]&lt;br /&gt;
&lt;br /&gt;
* [http://www.gmu.edu George Mason University]&lt;br /&gt;
&lt;br /&gt;
** PhD program in [http://css.gmu.edu CSS (Computational Social Sciences)]&lt;br /&gt;
&lt;br /&gt;
** MA program in [http://mais.gmu.edu/programs/la-mais-css Master's of Interdisciplinary Studies, CSS emphasis]&lt;br /&gt;
&lt;br /&gt;
* [http://www.pdx.edu/sysc/program-systems-science-phd-program Portland State], PhD program in Systems Science&lt;br /&gt;
&lt;br /&gt;
* [http://www.pdx.edu/sysc/program-systems-science-masters-program Portland State], MS program in Systems Science&lt;br /&gt;
&lt;br /&gt;
* [http://www.ucd.ie University College Dublin], &lt;br /&gt;
&lt;br /&gt;
** PhD Program in [http://www.ucd.ie/geary/postgraduatetraining/cscs Complex Systems and Computational Social Science]&lt;br /&gt;
&lt;br /&gt;
** MSc in [https://sisweb.ucd.ie/usis/!W_HU_MENU.P_PUBLISH?p_tag=PROG&amp;amp;MAJR=W390 Social Data Analytics] &lt;br /&gt;
&lt;br /&gt;
** BSc in [https://www.myucd.ie/courses/social-sciences/computational-social-science Computational Social Science] &lt;br /&gt;
&lt;br /&gt;
* [https://archive.is/20121215023745/http://hcs.ucla.edu/courses.htm UCLA], Minor in Human Complex Systems&lt;br /&gt;
&lt;br /&gt;
* [http://www.cs.ucla.edu/~cyber/ UCLA], Major in Computational &amp;amp; Systems Biology (including behavioral sciences)&lt;br /&gt;
&lt;br /&gt;
* [http://cscs.umich.edu/education/undergrad/undergrad.html Univ. of Michigan], Minor in Complex Systems&lt;br /&gt;
&lt;br /&gt;
* [http://www.pdx.edu/sysc/resources-other-systems-science-programs Systems Sciences Programs List], Portland State.  List of other worldwide related programs.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Centers and institutes 中心和机构==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===North America 北美===&lt;br /&gt;
&lt;br /&gt;
* [http://cnets.indiana.edu/ Center for Complex Networks and Systems Research], Indiana University, Bloomington, IN, USA.&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20110430200327/http://www.ccsr.uiuc.edu/ Center for Complex Systems Research], University of Illinois at Urbana-Champaign, IL, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://socialcomplexity.gmu.edu/ Center for Social Complexity], George Mason University, Fairfax, VA, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.asu.edu/clas/csdc/ Center for Social Dynamics and Complexity], Arizona State University, Tempe, AZ, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.cscs.umich.edu/ Center of the Study of Complex Systems], University of Michigan, Ann Arbor, MI, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://hcs.ucla.edu/ Human Complex Systems], University of California Los Angeles, Los Angeles, CA, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.iq.harvard.edu/ Institute for Quantitative Social Science], Harvard University, Boston, MA, USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.nico.northwestern.edu/ Northwestern Institute on Complex Systems (NICO)], Northwestern University, Evanston, IL USA.&lt;br /&gt;
&lt;br /&gt;
* [http://www.santafe.edu/ Santa Fe Institute], Santa Fe, NM, USA.&lt;br /&gt;
&lt;br /&gt;
* Duke Network Analysis Center, [[Duke University]], Durham, NC, USA&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===South America 南美===&lt;br /&gt;
&lt;br /&gt;
* [http://www5.each.usp.br/mestrado-academico-em-modelagem-de-sistemas-complexos/ Modelagem de Sistemas Complexos], University of São Paulo - EACH, São Paulo, SP, Brazil&lt;br /&gt;
&lt;br /&gt;
* [http://inct.cnpq.br/web/inct-sc Instituto Nacional de Ciência e Tecnologia de Sistemas Complexos], Centro Brasileiro de Pesquisas Físicas, Rio de Janeiro, RJ, Brazil&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Europe 欧洲===&lt;br /&gt;
&lt;br /&gt;
* [http://cfpm.org Centre for Policy Modelling], Manchester, UK.&lt;br /&gt;
&lt;br /&gt;
* [http://cress.soc.surrey.ac.uk/ Centre for Research in Social Simulation], University of Surrey, UK.&lt;br /&gt;
&lt;br /&gt;
* [https://web.archive.org/web/20130425014018/http://dl.ucd.ie/ UCD Dynamics Lab- Centre for Computational Social Science], Geary Institute for Public Policy, University College Dublin, Ireland.&lt;br /&gt;
&lt;br /&gt;
* [http://www.rug.nl/research/gcscs/ Groningen Center for Social Complexity Studies (GCSCS)], Groningen, NL.&lt;br /&gt;
&lt;br /&gt;
* [http://www.soms.ethz.ch/ Chair of Sociology, in particular of Modeling and Simulation (SOMS)], Zürich, Switzerland.&lt;br /&gt;
&lt;br /&gt;
* [http://www.eco.unibs.it/gecs/ Research Group on Experimental and Computational Sociology (GECS)], Brescia, IT.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Asia 亚洲===&lt;br /&gt;
&lt;br /&gt;
* [http://bandungfe.net Bandung Fe Institute, Centre for Complexity in Surya University], Bandung, Indonesia.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== See also 参见==&lt;br /&gt;
&lt;br /&gt;
* [[Artificial society]] 人工社会&lt;br /&gt;
&lt;br /&gt;
* [[Simulated reality]] 虚拟现实&lt;br /&gt;
&lt;br /&gt;
* [[Social simulation]] 社会仿真&lt;br /&gt;
&lt;br /&gt;
* [[Agent-based social simulation]] 基于主体的社会仿真&lt;br /&gt;
&lt;br /&gt;
* [[Social complexity]] 社会复杂性&lt;br /&gt;
&lt;br /&gt;
* [[Computational economics]] 计算经济学&lt;br /&gt;
&lt;br /&gt;
* [[Computational epidemiology]] 计算流行病学&lt;br /&gt;
&lt;br /&gt;
* [[Cliodynamics]] 历史动力学&lt;br /&gt;
&lt;br /&gt;
* [[Predictive analytics]] 预测分析&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&lt;br /&gt;
{{reflist|35em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==External links 外部链接==&lt;br /&gt;
&lt;br /&gt;
*[http://cress.soc.surrey.ac.uk/s4ss/ On-line book &amp;quot;Simulation for the Social Scientist&amp;quot; by Nigel Gilbert and Klaus G. Troitzsch, 1999, second edition 2005 社会科学家的仿真建模 电子书 作者：Nigel Gilbert and Klaus G. Troitzsch 第二版（2005年版）]&lt;br /&gt;
&lt;br /&gt;
*[http://jasss.soc.surrey.ac.uk/JASSS.html Journal of Artificial Societies and Social Simulation 人工社会和社会建模仿真期刊]&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20110516072744/http://cmol.nbi.dk/models/ Agent based models for social networks, interactive java applets 基于主体的社会网络模型，交互式 java 小程序]&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20090827052722/http://www.personal.kent.edu/~bcastel3/ Sociology and Complexity Science Website 社会学与复杂性科学网站]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:Subfields of sociology]]&lt;br /&gt;
&lt;br /&gt;
Category:Subfields of sociology&lt;br /&gt;
&lt;br /&gt;
范畴: 社会学的子领域&lt;br /&gt;
&lt;br /&gt;
[[Category:Complex systems theory]]&lt;br /&gt;
&lt;br /&gt;
Category:Complex systems theory&lt;br /&gt;
&lt;br /&gt;
范畴: 复杂系统理论&lt;br /&gt;
&lt;br /&gt;
[[Category:Methods in sociology]]&lt;br /&gt;
&lt;br /&gt;
Category:Methods in sociology&lt;br /&gt;
&lt;br /&gt;
范畴: 社会学方法&lt;br /&gt;
&lt;br /&gt;
[[Category:Computational fields of study]]&lt;br /&gt;
&lt;br /&gt;
Category:Computational fields of study&lt;br /&gt;
&lt;br /&gt;
类别: 研究的计算领域&lt;br /&gt;
&lt;br /&gt;
&amp;lt;noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;small&amp;gt;This page was moved from [[wikipedia:en:Computational sociology]]. Its edit history can be viewed at [[社会计算/edithistory]]&amp;lt;/small&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:待整理页面]]&lt;br /&gt;
&lt;br /&gt;
== 编者推荐 ==&lt;br /&gt;
=== 书籍推荐 ===&lt;br /&gt;
====[https://e.jd.com/30159646.html 社会计算的基本方法与应用]====&lt;br /&gt;
这是中科院自动化所的王飞跃老师关于社会计算的专著，从利用计算技术解决社会问题的角度介绍社会计算。阅读难度可能较高。&lt;br /&gt;
&lt;br /&gt;
=== 集智推荐 ===&lt;br /&gt;
====[https://campus.swarma.org/course/1028 2019 International Conference of Social Computing]====&lt;br /&gt;
本课程是2019年8月26日、27日的2019 International Conference of Social Computing记录。教师团队由芝加哥大学社会学系James Evans教授，Science University of Gottingen傅晓明教授，清华大学罗家德教授，电子科技大学周涛教授等多位老师组成。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://campus.swarma.org/course/1016 复杂系统与社会计算研讨会]====&lt;br /&gt;
本课程是，2019年10月27日北京计算科学研究中心主办的复杂系统与社会计算研讨会活动记录。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://pattern.swarma.org/path?id=12 计算社会科学入门路径]====&lt;br /&gt;
计算社会科学诞生至今，已有将近10年。在自然科学领域已经广泛应用大数据、分布式计算等方式提高研究质量的今天，社会科学领域涉及到的核心数据仍然被少数机构所拥有并创造着巨大的价值。本文将从计算社会科学的发展历史，常用方法，以及前沿问题来给大家粗略地展示计算社会科学的脉络。&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E9%9D%9E%E7%BA%BF%E6%80%A7%E7%B3%BB%E7%BB%9F&amp;diff=10743</id>
		<title>非线性系统</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E9%9D%9E%E7%BA%BF%E6%80%A7%E7%B3%BB%E7%BB%9F&amp;diff=10743"/>
		<updated>2020-07-19T05:21:14Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。{{Redirect|Nonlinear dynamics|the journal|Nonlinear Dynamics (journal)}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Complex systems}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{About|&amp;quot;nonlinearity&amp;quot; in mathematics, physics and other sciences|video and film editing|Non-linear editing system|other uses|Nonlinearity (disambiguation)}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In [[mathematics]] and [[science]], a '''nonlinear system''' is a [[system]] in which the change of the output is not [[proportionality (mathematics)|proportional]] to the change of the input.&amp;lt;ref&amp;gt;{{Cite news|url=https://news.mit.edu/2010/explained-linear-0226|title=Explained: Linear and nonlinear systems|work=MIT News|access-date=2018-06-30}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite web|url=https://www.birmingham.ac.uk/research/activity/mathematics/applied-maths/nonlinear-systems.aspx|title=Nonlinear systems, Applied Mathematics - University of Birmingham|website=www.birmingham.ac.uk|language=en-gb|access-date=2018-06-30}}&amp;lt;/ref&amp;gt; Nonlinear problems are of interest to [[engineer]]s, [[biologist]]s,&amp;lt;ref&amp;gt;{{Citation|date=2007|pages=181–276|publisher=Springer Berlin Heidelberg|language=en|doi=10.1007/978-3-540-34153-6_7|isbn=9783540341529|title = The Nonlinear Universe|series = The Frontiers Collection|chapter = Nonlinear Biology}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last=Korenberg|first=Michael J.|last2=Hunter|first2=Ian W.|date=March 1996|title=The identification of nonlinear biological systems: Volterra kernel approaches|journal=Annals of Biomedical Engineering|language=en|volume=24|issue=2|pages=250–268|doi=10.1007/bf02667354|issn=0090-6964}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last=Mosconi|first=Francesco|last2=Julou|first2=Thomas|last3=Desprat|first3=Nicolas|last4=Sinha|first4=Deepak Kumar|last5=Allemand|first5=Jean-François|last6=Vincent Croquette|last7=Bensimon|first7=David|date=2008|title=Some nonlinear challenges in biology|url=http://stacks.iop.org/0951-7715/21/i=8/a=T03|journal=Nonlinearity|language=en|volume=21|issue=8|pages=T131|doi=10.1088/0951-7715/21/8/T03|issn=0951-7715|bibcode=2008Nonli..21..131M}}&amp;lt;/ref&amp;gt; [[physicist]]s,&amp;lt;ref&amp;gt;{{cite journal|last1=Gintautas|first1=V.|title=Resonant forcing of nonlinear systems of differential equations|journal=Chaos|date=2008|volume=18|issue=3|pages=033118|doi=10.1063/1.2964200|pmid=19045456|arxiv=0803.2252|bibcode=2008Chaos..18c3118G}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Stephenson|first1=C.|last2=et.|first2=al.|title=Topological properties of a self-assembled electrical network via ab initio calculation|journal=Sci. Rep.|volume=7|pages=41621|date=2017|doi=10.1038/srep41621|pmid=28155863|pmc=5290745|bibcode=2017NatSR...741621S}}&amp;lt;/ref&amp;gt; [[mathematician]]s, and many other [[scientist]]s because most systems are inherently nonlinear in nature.&amp;lt;ref&amp;gt;{{cite book|last1=de Canete|first1=Javier, Cipriano Galindo, and Inmaculada Garcia-Moral|title=System Engineering and Automation: An Interactive Educational Approach|date=2011|publisher=Springer|location=Berlin|isbn=978-3642202292|page=46|url=https://books.google.com/?id=h8rCQYXGGY8C&amp;amp;pg=PA46&amp;amp;lpg=PA46&amp;amp;dq=most+systems+are+inherently+nonlinear+in+nature#v=onepage&amp;amp;q=most%20systems%20are%20inherently%20nonlinear%20in%20nature&amp;amp;f=false|accessdate=20 January 2018}}&amp;lt;/ref&amp;gt; Nonlinear [[dynamical system]]s, describing changes in variables over time, may appear chaotic, unpredictable, or counterintuitive, contrasting with much simpler [[linear system]]s.&lt;br /&gt;
&lt;br /&gt;
In mathematics and science, a nonlinear system is a system in which the change of the output is not proportional to the change of the input. Nonlinear problems are of interest to engineers, biologists, physicists, mathematicians, and many other scientists because most systems are inherently nonlinear in nature. Nonlinear dynamical systems, describing changes in variables over time, may appear chaotic, unpredictable, or counterintuitive, contrasting with much simpler linear systems.&lt;br /&gt;
&lt;br /&gt;
在数学及科学中，'''非线性系统 Nonlinear System'''是一种输出的变化与输入的变化不成比例的系统。大多数系统在本质上是非线性的，因而非线性问题引起了工程师、生物学家、物理学家、数学家和许多其他科学家的兴趣。描述变量随时间变化的非线性动力系统与较之简单得多的线性系统相比，可能显得混沌、不可预测或违反直觉。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Typically, the behavior of a nonlinear system is described in mathematics by a '''nonlinear system of equations''', which is a set of simultaneous [[equation]]s in which the unknowns (or the unknown functions in the case of [[differential equation]]s) appear as variables of a [[polynomial]] of degree higher than one or in the argument of a [[function (mathematics)|function]] which is not a polynomial of degree one.&lt;br /&gt;
&lt;br /&gt;
Typically, the behavior of a nonlinear system is described in mathematics by a nonlinear system of equations, which is a set of simultaneous equations in which the unknowns (or the unknown functions in the case of differential equations) appear as variables of a polynomial of degree higher than one or in the argument of a function which is not a polynomial of degree one.&lt;br /&gt;
&lt;br /&gt;
通常，非线性系统的行为在数学上是由一组非线性联立方程来描述的，其中未知数（或微分方程中的未知函数）作为一个高于一次的多项式的变量出现，或者作为一个不是一次多项式的函数的论元出现。__[[用户:Dorr|Dorr]]（[[用户讨论:Dorr|讨论]]）后半句不知如何翻译&lt;br /&gt;
&lt;br /&gt;
&amp;lt;font color='blue'&amp;gt;通常，非线性系统的行为在数学上被描述为一组非线性的联立方程组，其中未知数（或微分方程中的未知函数）作为一个高于一次的多项式变量出现，或者作为一个非一次多项式函数的参数出现。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In other words, in a nonlinear system of equations, the equation(s) to be solved cannot be written as a [[linear combination]] of the unknown [[variable (mathematics)|variables]] or [[function (mathematics)|functions]] that appear in them. Systems can be defined as nonlinear, regardless of whether known linear functions appear in the equations. In particular, a differential equation is ''linear'' if it is linear in terms of the unknown function and its derivatives, even if nonlinear in terms of the other variables appearing in it.&lt;br /&gt;
&lt;br /&gt;
In other words, in a nonlinear system of equations, the equation(s) to be solved cannot be written as a linear combination of the unknown variables or functions that appear in them. Systems can be defined as nonlinear, regardless of whether known linear functions appear in the equations. In particular, a differential equation is linear if it is linear in terms of the unknown function and its derivatives, even if nonlinear in terms of the other variables appearing in it.&lt;br /&gt;
&lt;br /&gt;
换句话说，在非线性方程系统中，&amp;lt;font color='red'&amp;gt;要求解&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;待解&amp;lt;/font&amp;gt; 的方程不能被写成未知变量或函数的线性组合。无论方程中是否有已知的线性函数，系统都可以被定义为非线性。特别是当一个微分方程的未知函数及其导数是线性的，即使其他变量是非线性的，也称该方程是线性的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
As nonlinear dynamical equations are difficult to solve, nonlinear systems are commonly approximated by linear equations ([[linearization]]). This works well up to some accuracy and some range for the input values, but some interesting phenomena such as [[soliton]]s, [[chaos theory|chaos]],&amp;lt;ref&amp;gt;[http://ocw.mit.edu/OcwWeb/Earth--Atmospheric--and-Planetary-Sciences/12-006JFall-2006/CourseHome/index.htm Nonlinear Dynamics I: Chaos] {{webarchive|url=https://web.archive.org/web/20080212045134/http://ocw.mit.edu/OcwWeb/Earth--Atmospheric--and-Planetary-Sciences/12-006JFall-2006/CourseHome/index.htm |date=2008-02-12}} at [http://ocw.mit.edu/OcwWeb/index.htm MIT's OpenCourseWare]&amp;lt;/ref&amp;gt; and [[mathematical singularity|singularities]] are hidden by linearization. It follows that some aspects of the dynamic behavior of a nonlinear system can appear to be counterintuitive, unpredictable or even chaotic. Although such chaotic behavior may resemble [[randomness|random]] behavior, it is in fact not random. For example, some aspects of the weather are seen to be chaotic, where simple changes in one part of the system produce complex effects throughout. This nonlinearity is one of the reasons why accurate long-term forecasts are impossible with current technology.&lt;br /&gt;
&lt;br /&gt;
As nonlinear dynamical equations are difficult to solve, nonlinear systems are commonly approximated by linear equations (linearization). This works well up to some accuracy and some range for the input values, but some interesting phenomena such as solitons, chaos, and singularities are hidden by linearization. It follows that some aspects of the dynamic behavior of a nonlinear system can appear to be counterintuitive, unpredictable or even chaotic. Although such chaotic behavior may resemble random behavior, it is in fact not random. For example, some aspects of the weather are seen to be chaotic, where simple changes in one part of the system produce complex effects throughout. This nonlinearity is one of the reasons why accurate long-term forecasts are impossible with current technology.&lt;br /&gt;
&lt;br /&gt;
由于非线性动力学方程难以求解，通常用线性&amp;lt;font color='red'&amp;gt;&amp;lt;s&amp;gt;化&amp;lt;/s&amp;gt;(这种解法是线性化(linearization)，此处还是按linear来翻吧)&amp;lt;/font&amp;gt;方程来近似非线性系统（'''线性化 Linearization'''）。&amp;lt;font color='red'&amp;gt;这种方法在一定的精度和范围对输入值效果很好&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;这种方法对于一定范围的输入和某些精度要求下的效果不错&amp;lt;/font&amp;gt;，但一些有趣的现象如'''孤子 Soliton'''、'''混沌 Chaos'''和'''奇异性 Singularity'''在线性化后被隐藏。因此，非线性系统的动态行为在某些方面可能看起来违反直觉、不可预测、甚至混沌。尽管这种混沌行为可能感觉很像随机行为，但它实际上并不是随机的。例如，天气的某些方面被认为是混沌的，其系统某部分的微小扰动就会产生复杂的&amp;lt;font color='blue'&amp;gt;整体(throughout)&amp;lt;/font&amp;gt;影响。这种非线性是目前技术无法进行精确长期预测的原因之一。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Some authors use the term '''nonlinear science''' for the study of nonlinear systems. This term is disputed by others:&lt;br /&gt;
&lt;br /&gt;
Some authors use the term nonlinear science for the study of nonlinear systems. This term is disputed by others:&lt;br /&gt;
&lt;br /&gt;
有些作者用非线性科学这一术语来研究非线性系统。这一术语引起了其他人的争议:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{quote|Using a term like nonlinear science is like referring to the bulk of zoology as the study of [[negation|non]]-elephant animals.|[[Stanislaw Ulam]]&amp;lt;ref&amp;gt;{{cite journal|last1=Campbell|first1=David K.|title=Nonlinear physics: Fresh breather|journal=Nature|date=25 November 2004|volume=432|issue=7016|pages=455–456|doi=10.1038/432455a|pmid=15565139|url=https://zenodo.org/record/1134179|language=en|issn=0028-0836|bibcode=2004Natur.432..455C}}&amp;lt;/ref&amp;gt;}}&lt;br /&gt;
&lt;br /&gt;
“使用‘非线性科学’这样的术语，就如同把动物学里大部分对象称作‘非大象动物’研究一样可笑。”&lt;br /&gt;
&lt;br /&gt;
——'''斯塔尼斯拉夫·乌拉姆 Stanislaw Ulam'''&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Definition 定义==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In [[mathematics]], a [[linear map]] (or ''linear function'') &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; is one which satisfies both of the following properties:&lt;br /&gt;
&lt;br /&gt;
In mathematics, a linear map (or linear function) &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; is one which satisfies both of the following properties:&lt;br /&gt;
&lt;br /&gt;
在数学中，线性映射（或线性函数）&amp;lt;math&amp;gt;f (x)&amp;lt;/math&amp;gt;满足以下两个性质:&lt;br /&gt;
&lt;br /&gt;
*Additivity or [[superposition Principle]]: &amp;lt;math&amp;gt;\textstyle f(x + y) = f(x) + f(y);&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
*Homogeneity: &amp;lt;math&amp;gt;\textstyle f(\alpha x) = \alpha f(x).&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*'''可加性 Additivity'''（'''叠加性 Superposition principle'''）: &amp;lt;math&amp;gt;\textstyle f(x + y) = f(x) + f(y);&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
*'''齐次性 Homogeneity''': &amp;lt;math&amp;gt;\textstyle f(\alpha x) = \alpha f(x).&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Additivity implies homogeneity for any [[rational number|rational]] ''α'', and, for [[continuous function]]s, for any [[real number|real]] ''α''. For a [[complex number|complex]] ''α'', homogeneity does not follow from additivity. For example, an [[antilinear map]] is additive but not homogeneous. The conditions of additivity and homogeneity are often combined in the superposition principle&lt;br /&gt;
&lt;br /&gt;
Additivity implies homogeneity for any rational α, and, for continuous functions, for any real α. For a complex α, homogeneity does not follow from additivity. For example, an antilinear map is additive but not homogeneous. The conditions of additivity and homogeneity are often combined in the superposition principle:&lt;br /&gt;
&lt;br /&gt;
当α是有理数或实数，且&amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt;是连续函数时，由可加性可以推出齐次性。但当α是复数时，可加性不能导出齐次性。例如，反线性映射是可加的，但不是齐次的。可加性和齐次性条件经常组合，称为叠加原理：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;f(\alpha x + \beta y) = \alpha f(x) + \beta f(y)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
An equation written as&lt;br /&gt;
&lt;br /&gt;
对一个写成&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;f(x) = C&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
is called '''linear''' if &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; is a linear map (as defined above) and '''nonlinear''' otherwise. The equation is called ''homogeneous'' if &amp;lt;math&amp;gt;C = 0&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
is called linear if &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; is a linear map (as defined above) and nonlinear otherwise. The equation is called homogeneous if &amp;lt;math&amp;gt;C = 0&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
的方程，若 &amp;lt;math&amp;gt; f (x) &amp;lt;/math&amp;gt; 是线性映射（如上定义） ，则称其为'''线性的 Linear'''，否则称为'''非线性的 Nonlinear'''。若&amp;lt;math&amp;gt;C = 0&amp;lt;/math&amp;gt;，该方程称为是齐次的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The definition &amp;lt;math&amp;gt;f(x) = C&amp;lt;/math&amp;gt; is very general in that &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; can be any sensible mathematical object (number, vector, function, etc.), and the function &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; can literally be any [[map (mathematics)|mapping]], including integration or differentiation with associated constraints (such as [[boundary values]]). If &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; contains [[derivative|differentiation]] with respect to &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt;, the result will be a [[differential equation]].&lt;br /&gt;
&lt;br /&gt;
The definition &amp;lt;math&amp;gt;f(x) = C&amp;lt;/math&amp;gt; is very general in that &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; can be any sensible mathematical object (number, vector, function, etc.), and the function &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; can literally be any mapping, including integration or differentiation with associated constraints (such as boundary values). If &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; contains differentiation with respect to &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt;, the result will be a differential equation.&lt;br /&gt;
&lt;br /&gt;
定义 &amp;lt;math&amp;gt;f(x) = C&amp;lt;/math&amp;gt; 是非常具有一般性的，因为 &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; 可以是任意&amp;lt;font color='red'&amp;gt;可感知&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 合理 &amp;lt;/font&amp;gt;的数学对象（数字、向量、函数等），函数 &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; 实际上可以是任意映射，包括有相关约束（如给定边界值）的积分或微分。若 &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; 包含对 &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; 的微分运算，则该方程为微分方程。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===相关概念辨析===&lt;br /&gt;
'''线性Linear'''、'''非线性Nonlinear'''、'''亚线性 Sublinear'''、'''超线性 Superlinear'''：描述量与量之间的一种变化关系，例如&amp;lt;math&amp;gt;y=a+b*x^n&amp;lt;/math&amp;gt;，其中&amp;lt;math&amp;gt;n&amp;gt;1&amp;lt;/math&amp;gt;。当&amp;lt;math&amp;gt;n=1&amp;lt;/math&amp;gt;时，表示为线性关系；&amp;lt;math&amp;gt;n\neq 1&amp;lt;/math&amp;gt;时，表示为非线性关系；当&amp;lt;math&amp;gt;0&amp;lt;n&amp;lt;1&amp;lt;/math&amp;gt;时，表示为亚线性关系；当&amp;lt;math&amp;gt;n&amp;gt;1&amp;lt;/math&amp;gt;时，表示为超线性关系。&lt;br /&gt;
&lt;br /&gt;
亚线性与超线性属于非线性变化关系范畴。当两个变量之间存在亚线性关系时，其典型特性是因变量的变化速率会随着自变量的增大而减小，即其一阶导数会随着自变量的增大而减小；两个变量之间存在超线性关系时，其典型特性是因变量的变化速率会随着自变量的增大而增大，即其一阶导数会随着自变量的增大而增大。&lt;br /&gt;
&lt;br /&gt;
在线性系统中，整体等于部分和，描述线性系统的方程满足叠加原理，作用的总和正好等于每一部分作用相加的代数和，这意味着每一部分作用都是独立的、互不相关的；而在普遍存在的非线性系统中，作用的总和不等于每一部分作用相加的代数和，因为系统内部要素之间存在着复杂的非线性相互作用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Nonlinear algebraic equations 非线性代数方程==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Algebraic equation|System of polynomial equations}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Nonlinear [[algebraic equation]]s, which are also called ''[[polynomial equation]]s'', are defined by equating [[polynomial]]s (of degree greater than one) to zero. For example,&lt;br /&gt;
&lt;br /&gt;
Nonlinear algebraic equations, which are also called polynomial equations, are defined by equating polynomials (of degree greater than one) to zero. For example,&lt;br /&gt;
&lt;br /&gt;
非线性'''代数方程 Algebraic Equation'''，又称'''多项式方程 Polynomial Equation'''，由某多项式（次数大于1）等于零定义。例如：&lt;br /&gt;
&lt;br /&gt;
 &lt;br /&gt;
&amp;lt;math&amp;gt;x^2 + x - 1 = 0\,.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
For a single polynomial equation, [[root-finding algorithm]]s can be used to find solutions to the equation (i.e., sets of values for the variables that satisfy the equation). However, systems of algebraic equations are more complicated; their study is one motivation for the field of [[algebraic geometry]], a difficult branch of modern mathematics. It is even difficult to decide whether a given algebraic system has complex solutions (see [[Hilbert's Nullstellensatz]]). Nevertheless, in the case of the systems with a finite number of complex solutions, these [[systems of polynomial equations]] are now well understood and efficient methods exist for solving them.&amp;lt;ref&amp;gt;{{cite journal |last1= Lazard |first1= D. |title= Thirty years of Polynomial System Solving, and now? |doi= 10.1016/j.jsc.2008.03.004 |journal= Journal of Symbolic Computation |volume= 44 |issue= 3 |pages= 222–231 |year= 2009 |pmid= |pmc=}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
For a single polynomial equation, root-finding algorithms can be used to find solutions to the equation (i.e., sets of values for the variables that satisfy the equation). However, systems of algebraic equations are more complicated; their study is one motivation for the field of algebraic geometry, a difficult branch of modern mathematics. It is even difficult to decide whether a given algebraic system has complex solutions (see Hilbert's Nullstellensatz). Nevertheless, in the case of the systems with a finite number of complex solutions, these systems of polynomial equations are now well understood and efficient methods exist for solving them.&lt;br /&gt;
&lt;br /&gt;
对于一个单一的多项式方程，'''求根算法 Root-finding Algorithms'''可用于其求解（即找到满足该方程的变量的值集）。而代数方程组则相对复杂，其研究是现代数学的较难分支——'''代数几何 Algebraic Geometry'''领域的动力之一。甚至很难判断一个给定的代数系统是否有复数解（见'''希尔伯特零点定律  Hilbert's Nullstellensatz'''）。不过，对于具有有限个复数解的系统的多项式方程组，我们现在已经有了充分的理解，并且找到了有效的求解方法。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Nonlinear recurrence relations 非线性递推关系==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A nonlinear [[recurrence relation]] defines successive terms of a [[sequence]] as a nonlinear function of preceding terms. Examples of nonlinear recurrence relations are the [[logistic map]] and the relations that define the various [[Hofstadter sequence]]s. Nonlinear discrete models that represent a wide class of nonlinear recurrence relationships include the NARMAX (Nonlinear Autoregressive Moving Average with eXogenous inputs) model and the related [[nonlinear system identification]] and analysis procedures.&amp;lt;ref name=&amp;quot;SAB1&amp;quot;&amp;gt;Billings S.A. &amp;quot;Nonlinear System Identification: NARMAX Methods in the Time, Frequency, and Spatio-Temporal Domains&amp;quot;. Wiley, 2013&amp;lt;/ref&amp;gt; These approaches can be used to study a wide class of complex nonlinear behaviors in the time, frequency, and spatio-temporal domains.&lt;br /&gt;
&lt;br /&gt;
A nonlinear recurrence relation defines successive terms of a sequence as a nonlinear function of preceding terms. Examples of nonlinear recurrence relations are the logistic map and the relations that define the various Hofstadter sequences. Nonlinear discrete models that represent a wide class of nonlinear recurrence relationships include the NARMAX (Nonlinear Autoregressive Moving Average with eXogenous inputs) model and the related nonlinear system identification and analysis procedures. These approaches can be used to study a wide class of complex nonlinear behaviors in the time, frequency, and spatio-temporal domains.&lt;br /&gt;
&lt;br /&gt;
非线性递归关系中，序列的连续项被定义为其前项的非线性函数。非线性递归关系的例子有 [[logistic 映射]]和定义各种'''霍夫斯塔特序列 Hofstadter Sequences''' 的关系。非线性离散模型代表了一类广泛的非线性递归关系，包括 NARMAX（外部输入非线性自回归移动平均）模型和相关的非线性系统辨识和分析程序。这些方法可用于研究时域、频域和时空域的广泛复杂非线性行为。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Nonlinear differential equations 非线性微分方程==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A [[simultaneous equations|system]] of [[differential equation]]s is said to be nonlinear if it is not a [[linear system]]. Problems involving nonlinear differential equations are extremely diverse, and methods of solution or analysis are problem dependent. Examples of nonlinear differential equations are the [[Navier–Stokes equations]] in fluid dynamics and the [[Lotka–Volterra equation]]s in biology.&lt;br /&gt;
&lt;br /&gt;
A system of differential equations is said to be nonlinear if it is not a linear system. Problems involving nonlinear differential equations are extremely diverse, and methods of solution or analysis are problem dependent. Examples of nonlinear differential equations are the Navier–Stokes equations in fluid dynamics and the Lotka–Volterra equations in biology.&lt;br /&gt;
&lt;br /&gt;
若一个微分方程组不是线性系统，则称其为非线性的。涉及非线性微分方程的问题非常多样，对不同问题的解决或分析方法也不相同。非线性微分方程的例子有流体力学中的 '''纳维-斯托克斯方程 Navier-Stokes Equations'''和生物学中的'''洛特卡－沃尔泰拉方程 Lotka-Volterra Equations'''。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
One of the greatest difficulties of nonlinear problems is that it is not generally possible to combine known solutions into new solutions. In linear problems, for example, a family of [[linearly independent]] solutions can be used to construct general solutions through the [[superposition principle]]. A good example of this is one-dimensional heat transport with [[Dirichlet boundary conditions]], the solution of which can be written as a time-dependent linear combination of sinusoids of differing frequencies; this makes solutions very flexible. It is often possible to find several very specific solutions to nonlinear equations, however the lack of a superposition principle prevents the construction of new solutions.&lt;br /&gt;
&lt;br /&gt;
One of the greatest difficulties of nonlinear problems is that it is not generally possible to combine known solutions into new solutions. In linear problems, for example, a family of linearly independent solutions can be used to construct general solutions through the superposition principle. A good example of this is one-dimensional heat transport with Dirichlet boundary conditions, the solution of which can be written as a time-dependent linear combination of sinusoids of differing frequencies; this makes solutions very flexible. It is often possible to find several very specific solutions to nonlinear equations, however the lack of a superposition principle prevents the construction of new solutions.&lt;br /&gt;
&lt;br /&gt;
非线性问题最大的困难之一是通常不可能将已知的解组合成新的解。例如，在线性问题中，可以根据叠加原理以一族线性独立的解构造通解。一个很好的例子是带有'''狄利克雷边界条件 Dirichlet Boundary Conditions'''的一维热传导问题，其解&amp;lt;font color='red'&amp;gt;&amp;lt;s&amp;gt;（随时间变化）&amp;lt;/s&amp;gt;&amp;lt;/font&amp;gt;可以写成&amp;lt;font color='blue'&amp;gt;（随时间变化）&amp;lt;/font&amp;gt;不同频率的正弦波的线性组合，这使得解非常灵活。而对非线性方程，通常可以找到几个非常特殊的解，但是此时叠加原理不适用，故无法构造新的解。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Ordinary differential equations 常微分方程===&lt;br /&gt;
&lt;br /&gt;
First order [[ordinary differential equation]]s are often exactly solvable by [[separation of variables]], especially for autonomous equations. For example, the nonlinear equation&lt;br /&gt;
&lt;br /&gt;
First order ordinary differential equations are often exactly solvable by separation of variables, especially for autonomous equations. For example, the nonlinear equation&lt;br /&gt;
&lt;br /&gt;
一阶常微分方程，尤其是自治（自主）方程，通常可以用'''分离变量法  Separation of Variables'''来精确求解。例如，非线性方程&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{d u}{d x} = -u^2&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
has &amp;lt;math&amp;gt;u=\frac{1}{x+C}&amp;lt;/math&amp;gt; as a general solution (and also ''u'' = 0 as a particular solution, corresponding to the limit of the general solution when ''C'' tends to infinity). The equation is nonlinear because it may be written as&lt;br /&gt;
&lt;br /&gt;
has &amp;lt;math&amp;gt;u=\frac{1}{x+C}&amp;lt;/math&amp;gt; as a general solution (and also u = 0 as a particular solution, corresponding to the limit of the general solution when C tends to infinity). The equation is nonlinear because it may be written as&lt;br /&gt;
&lt;br /&gt;
将 &amp;lt;math&amp;gt;u=\frac{1}{x+C}&amp;lt;/math&amp;gt; 作为一般解（也有特解 ''u'' = 0，对应于 ''C'' 趋于无穷时的一般解的极限)。该方程是非线性的，因为它可以改写成&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{du}{d x} + u^2=0&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
and the left-hand side of the equation is not a linear function of ''u'' and its derivatives. Note that if the ''u''&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt; term were replaced with ''u'', the problem would be linear (the [[exponential decay]] problem).&lt;br /&gt;
&lt;br /&gt;
and the left-hand side of the equation is not a linear function of u and its derivatives. Note that if the u&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt; term were replaced with u, the problem would be linear (the exponential decay problem).&lt;br /&gt;
&lt;br /&gt;
方程的左边不是 ''u'' 及其导数的线性函数。注意，若将 ''u''&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt; 项替换为''u''，该问题将变为线性的（'''指数衰减 Exponential Decay'''问题）。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Second and higher order ordinary differential equations (more generally, systems of nonlinear equations) rarely yield [[closed-form expression|closed-form]] solutions, though implicit solutions and solutions involving [[nonelementary integral]]s are encountered.&lt;br /&gt;
&lt;br /&gt;
Second and higher order ordinary differential equations (more generally, systems of nonlinear equations) rarely yield closed-form solutions, though implicit solutions and solutions involving nonelementary integrals are encountered.&lt;br /&gt;
&lt;br /&gt;
二阶和高阶常微分方程（更一般地说，非线性方程组）很少能产生封闭解，而隐式解和非初等函数积分形式的解较为常见。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Common methods for the qualitative analysis of nonlinear ordinary differential equations include:&lt;br /&gt;
&lt;br /&gt;
Common methods for the qualitative analysis of nonlinear ordinary differential equations include:&lt;br /&gt;
&lt;br /&gt;
非线性常微分方程定性分析的常用方法包括:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*Examination of any [[conserved quantities]], especially in [[Hamiltonian system]]s&lt;br /&gt;
&lt;br /&gt;
*检查是否有任意'''守恒量 Conserved Quantities'''（特别是在'''哈密顿系统 Hamiltonian System'''中）&lt;br /&gt;
&lt;br /&gt;
*Examination of dissipative quantities (see [[Lyapunov function]]) analogous to conserved quantities&lt;br /&gt;
&lt;br /&gt;
*检查是否有类似守恒量的耗散量（见'''李亚普诺夫函数 Lyapunov Function'''）&lt;br /&gt;
&lt;br /&gt;
*Linearization via [[Taylor expansion]]&lt;br /&gt;
&lt;br /&gt;
*基于'''泰勒展开 Taylor Expansion'''的线性化&lt;br /&gt;
&lt;br /&gt;
*Change of variables into something easier to study&lt;br /&gt;
&lt;br /&gt;
*将变量进行代换以便更好的进行研究&lt;br /&gt;
&lt;br /&gt;
*[[Bifurcation theory]]&lt;br /&gt;
&lt;br /&gt;
*'''分岔理论 Bifurcation Theory'''&lt;br /&gt;
&lt;br /&gt;
*[[Perturbation theory|Perturbation]] methods (can be applied to algebraic equations too)&lt;br /&gt;
&lt;br /&gt;
*'''摄动理论 Perturbation Theory'''（也可应用于代数方程）&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Partial differential equations 偏微分方程===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{main|Nonlinear partial differential equation}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{See also|List of nonlinear partial differential equations}}&lt;br /&gt;
&lt;br /&gt;
参见：非线性偏微分列表&lt;br /&gt;
&lt;br /&gt;
The most common basic approach to studying nonlinear [[partial differential equation]]s is to change the variables (or otherwise transform the problem) so that the resulting problem is simpler (possibly even linear). Sometimes, the equation may be transformed into one or more [[ordinary differential equation]]s, as seen in [[separation of variables]], which is always useful whether or not the resulting ordinary differential equation(s) is solvable.&lt;br /&gt;
&lt;br /&gt;
The most common basic approach to studying nonlinear partial differential equations is to change the variables (or otherwise transform the problem) so that the resulting problem is simpler (possibly even linear). Sometimes, the equation may be transformed into one or more ordinary differential equations, as seen in separation of variables, which is always useful whether or not the resulting ordinary differential equation(s) is solvable.&lt;br /&gt;
&lt;br /&gt;
研究非线性偏微分方程最常用的基本方法是变量代换（或转换问题），使变换后的问题更简单（甚至可能变为线性的）。有时可以将此类方程转化成一或多个常微分方程（如同分离变量法所示），此时不论得到的常微分方程是否可解，对研究问题总是有用的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Another common (though less mathematic) tactic, often seen in fluid and heat mechanics, is to use [[scale analysis (mathematics)|scale analysis]] to simplify a general, natural equation in a certain specific [[boundary value problem]]. For example, the (very) nonlinear [[Navier-Stokes equations]] can be simplified into one linear partial differential equation in the case of transient, laminar, one dimensional flow in a circular pipe; the scale analysis provides conditions under which the flow is laminar and one dimensional and also yields the simplified equation.&lt;br /&gt;
&lt;br /&gt;
Another common (though less mathematic) tactic, often seen in fluid and heat mechanics, is to use scale analysis to simplify a general, natural equation in a certain specific boundary value problem. For example, the (very) nonlinear Navier-Stokes equations can be simplified into one linear partial differential equation in the case of transient, laminar, one dimensional flow in a circular pipe; the scale analysis provides conditions under which the flow is laminar and one dimensional and also yields the simplified equation.&lt;br /&gt;
&lt;br /&gt;
另一个流体力学和热力学中常见的策略（虽然不是数学上的）是利用'''尺度分析 Scale Analysis'''来在某一特定边界条件下简化一般自然方程。例如，在描述圆管内一维层流的&amp;lt;font color='red'&amp;gt;暂态&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 瞬态 &amp;lt;/font&amp;gt;时，非线性的纳维－斯托克斯方程可以简化为一个线性的偏微分方程; 尺度分析提供了层流和一维流动的条件，也产生了简化的方程。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Other methods include examining the [[method of characteristics|characteristics]] and using the methods outlined above for ordinary differential equations.&lt;br /&gt;
&lt;br /&gt;
Other methods include examining the characteristics and using the methods outlined above for ordinary differential equations.&lt;br /&gt;
&lt;br /&gt;
其他方法包括检查特征线法及前面所述研究常微分方程的方法。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Pendula 摆===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Pendulum (mathematics)}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:PendulumLayout.svg.png|thumb|图一：Illustration of a pendulum 摆图解|right|200px]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:PendulumLinearizations.png|thumb|图二：Linearizations of a pendulum 摆的线性化|right|200px]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A classic, extensively studied nonlinear problem is the dynamics of a [[pendulum (mathematics)|pendulum]] under the influence of [[gravity]]. Using [[Lagrangian mechanics]], it may be shown&amp;lt;ref&amp;gt;[http://www.damtp.cam.ac.uk/user/tong/dynamics.html David Tong: Lectures on Classical Dynamics]&amp;lt;/ref&amp;gt; that the motion of a pendulum can be described by the [[dimensionless]] nonlinear equation&lt;br /&gt;
&lt;br /&gt;
A classic, extensively studied nonlinear problem is the dynamics of a pendulum under the influence of gravity. Using Lagrangian mechanics, it may be shown that the motion of a pendulum can be described by the dimensionless nonlinear equation&lt;br /&gt;
&lt;br /&gt;
一个经典的被广泛研究的非线性问题是重力影响下的摆的动力学。利用'''拉格朗日力学 Lagrangian Mechanics'''，可以证明摆的运动可以用无量纲的非线性方程&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{d^2 \theta}{d t^2} + \sin(\theta) = 0&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
where gravity points &amp;quot;downwards&amp;quot; and &amp;lt;math&amp;gt;\theta&amp;lt;/math&amp;gt; is the angle the pendulum forms with its rest position, as shown in the figure at right. One approach to &amp;quot;solving&amp;quot; this equation is to use &amp;lt;math&amp;gt;d\theta/dt&amp;lt;/math&amp;gt; as an [[integrating factor]], which would eventually yield&lt;br /&gt;
&lt;br /&gt;
where gravity points &amp;quot;downwards&amp;quot; and &amp;lt;math&amp;gt;\theta&amp;lt;/math&amp;gt; is the angle the pendulum forms with its rest position, as shown in the figure at right. One approach to &amp;quot;solving&amp;quot; this equation is to use &amp;lt;math&amp;gt;d\theta/dt&amp;lt;/math&amp;gt; as an integrating factor, which would eventually yield&lt;br /&gt;
&lt;br /&gt;
描述，其中重力指向“下方”，&amp;lt;math&amp;gt;\theta&amp;lt;/math&amp;gt; 是摆与其静止位置形成的角度，如右图所示。“解”这个方程的方法之一是用 &amp;lt;math&amp;gt;d\theta/dt&amp;lt;/math&amp;gt; 作为'''积分因子 Integrating Factor'''，最终得&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\int{\frac{d \theta}{\sqrt{C_0 + 2 \cos(\theta)}}} = t + C_1&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
which is an implicit solution involving an [[elliptic integral]]. This &amp;quot;solution&amp;quot; generally does not have many uses because most of the nature of the solution is hidden in the [[nonelementary integral]] (nonelementary unless &amp;lt;math&amp;gt;C_0 = 2&amp;lt;/math&amp;gt;).&lt;br /&gt;
&lt;br /&gt;
which is an implicit solution involving an elliptic integral. This &amp;quot;solution&amp;quot; generally does not have many uses because most of the nature of the solution is hidden in the nonelementary integral (nonelementary unless &amp;lt;math&amp;gt;C_0 = 2&amp;lt;/math&amp;gt;).&lt;br /&gt;
&lt;br /&gt;
这是一个含'''椭圆积分 Elliptic Integral'''的隐式解。这个“解”通常没什么用，因为这个解的大部分性质都隐藏在非初等函数积分中（除非&amp;lt;math&amp;gt;C_0 = 2&amp;lt;/math&amp;gt;，否则是非初等的）。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Another way to approach the problem is to linearize any nonlinearities (the sine function term in this case) at the various points of interest through [[Taylor expansion]]s. For example, the linearization at &amp;lt;math&amp;gt;\theta = 0&amp;lt;/math&amp;gt;, called the small angle approximation, is&lt;br /&gt;
&lt;br /&gt;
Another way to approach the problem is to linearize any nonlinearities (the sine function term in this case) at the various points of interest through Taylor expansions. For example, the linearization at &amp;lt;math&amp;gt;\theta = 0&amp;lt;/math&amp;gt;, called the small angle approximation, is&lt;br /&gt;
&lt;br /&gt;
另一种解决这个问题的方法是利用泰勒展开将任意非线性项（此时为正弦函数项)在某些感兴趣的点线性化。例如，在&amp;lt;math&amp;gt;\theta = 0&amp;lt;/math&amp;gt; 的点附近线性化（称为小角度近似）为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{d^2 \theta}{d t^2} + \theta = 0&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
since &amp;lt;math&amp;gt;\sin(\theta) \approx \theta&amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt;\theta \approx 0&amp;lt;/math&amp;gt;. This is a [[simple harmonic oscillator]] corresponding to oscillations of the pendulum near the bottom of its path. Another linearization would be at &amp;lt;math&amp;gt;\theta = \pi&amp;lt;/math&amp;gt;, corresponding to the pendulum being straight up:&lt;br /&gt;
&lt;br /&gt;
since &amp;lt;math&amp;gt;\sin(\theta) \approx \theta&amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt;\theta \approx 0&amp;lt;/math&amp;gt;. This is a simple harmonic oscillator corresponding to oscillations of the pendulum near the bottom of its path. Another linearization would be at &amp;lt;math&amp;gt;\theta = \pi&amp;lt;/math&amp;gt;, corresponding to the pendulum being straight up:&lt;br /&gt;
&lt;br /&gt;
因为 &amp;lt;math&amp;gt;\theta \approx 0&amp;lt;/math&amp;gt; 时，有 &amp;lt;math&amp;gt;\sin(\theta) \approx \theta&amp;lt;/math&amp;gt;。这是一个'''简谐振子 Simple Harmonic Oscillator''' ，对应于摆在其路径底部附近的摆动。另一种线性化方法是在 &amp;lt;math&amp;gt;\theta = \pi&amp;lt;/math&amp;gt;附近线性化，对应于运动到最高点的摆:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{d^2 \theta}{d t^2} + \pi - \theta = 0&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
since &amp;lt;math&amp;gt;\sin(\theta) \approx \pi - \theta&amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt;\theta \approx \pi&amp;lt;/math&amp;gt;. The solution to this problem involves [[hyperbolic sinusoid]]s, and note that unlike the small angle approximation, this approximation is unstable, meaning that &amp;lt;math&amp;gt;|\theta|&amp;lt;/math&amp;gt; will usually grow without limit, though bounded solutions are possible. This corresponds to the difficulty of balancing a pendulum upright, it is literally an unstable state.&lt;br /&gt;
&lt;br /&gt;
since &amp;lt;math&amp;gt;\sin(\theta) \approx \pi - \theta&amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt;\theta \approx \pi&amp;lt;/math&amp;gt;. The solution to this problem involves hyperbolic sinusoids, and note that unlike the small angle approximation, this approximation is unstable, meaning that &amp;lt;math&amp;gt;|\theta|&amp;lt;/math&amp;gt; will usually grow without limit, though bounded solutions are possible. This corresponds to the difficulty of balancing a pendulum upright, it is literally an unstable state.&lt;br /&gt;
&lt;br /&gt;
因为 &amp;lt;math&amp;gt;\theta \approx \pi&amp;lt;/math&amp;gt; 时，有 &amp;lt;math&amp;gt;\sin(\theta) \approx \pi - \theta&amp;lt;/math&amp;gt;。这个问题的解含双曲正弦曲线；注意到不同于小角度近似，它是不稳定的，这意味着 &amp;lt;math&amp;gt;|\theta|&amp;lt;/math&amp;gt; 通常会无限增长（但解也有可能是有界的）。这就解释了摆在最高点达到平衡的困难，此时实际上是一种不稳定的状态。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
One more interesting linearization is possible around &amp;lt;math&amp;gt;\theta = \pi/2&amp;lt;/math&amp;gt;, around which &amp;lt;math&amp;gt;\sin(\theta) \approx 1&amp;lt;/math&amp;gt;:&lt;br /&gt;
&lt;br /&gt;
One more interesting linearization is possible around &amp;lt;math&amp;gt;\theta = \pi/2&amp;lt;/math&amp;gt;, around which &amp;lt;math&amp;gt;\sin(\theta) \approx 1&amp;lt;/math&amp;gt;:&lt;br /&gt;
&lt;br /&gt;
一个更有趣的线性化可能是在 &amp;lt;math&amp;gt;\theta = \pi/2&amp;lt;/math&amp;gt;附近，此时 &amp;lt;math&amp;gt;\sin(\theta) \approx 1&amp;lt;/math&amp;gt;:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{d^2 \theta}{d t^2} + 1 = 0.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This corresponds to a free fall problem. A very useful qualitative picture of the pendulum's dynamics may be obtained by piecing together such linearizations, as seen in the figure at right. Other techniques may be used to find (exact) [[phase portrait]]s and approximate periods.&lt;br /&gt;
&lt;br /&gt;
This corresponds to a free fall problem. A very useful qualitative picture of the pendulum's dynamics may be obtained by piecing together such linearizations, as seen in the figure at right. Other techniques may be used to find (exact) phase portraits and approximate periods.&lt;br /&gt;
&lt;br /&gt;
这相当于一个自由落体问题。把这样线性化的结果合在一起看，就能得到有关摆的运动的非常有用的图像，如右图所示。利用其他方法寻找（精确的）'''相图  Phase Portrait'''和估计周期。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Types of nonlinear dynamic behaviors 非线性动力学行为的类型==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Amplitude death]] – any oscillations present in the system cease due to some kind of interaction with other system or feedback by the same system&lt;br /&gt;
&lt;br /&gt;
*'''振幅死亡 Amplitude Death'''——系统内的某振荡因系统的自回馈或与其他系统的某种相互作用而停止的现象&lt;br /&gt;
&lt;br /&gt;
*[[Chaos theory|Chaos]] – values of a system cannot be predicted indefinitely far into the future, and fluctuations are [[aperiodic]]&lt;br /&gt;
&lt;br /&gt;
*'''混沌 Chaos'''——系统内的值无法无限期地预测到遥远的未来；波动是非周期性的&lt;br /&gt;
&lt;br /&gt;
*[[Multistability]] – the presence of two or more stable states&lt;br /&gt;
&lt;br /&gt;
*'''多稳态 Multistability'''——两或多个稳态的存在&lt;br /&gt;
&lt;br /&gt;
*[[Soliton]]s – self-reinforcing solitary waves&lt;br /&gt;
&lt;br /&gt;
*'''孤波 Soliton'''s——自增强的孤立波&lt;br /&gt;
&lt;br /&gt;
*[[Limit cycle|Limit cycles]] – asymptotic periodic orbits to which destabilized fixed points are attracted. &lt;br /&gt;
&lt;br /&gt;
*'''极限环 Limit Cycles'''——吸引不稳定不动点的渐近周期轨道&lt;br /&gt;
&lt;br /&gt;
*[[Self-oscillation|Self-oscillations]] - feedback oscillations taking place in open dissipative physical systems.&lt;br /&gt;
&lt;br /&gt;
*'''自激振荡 Self-oscillations'''——开放耗散物理系统中的反馈振荡&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Examples of nonlinear equations 非线性方程的例子==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Div col|colwidth=25em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Algebraic Riccati equation]] 代数黎卡提方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Ball and beam]] system 球杆系统&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Bellman equation]] for optimal policy 最佳策略的贝尔曼方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Boltzmann equation]] 玻尔兹曼方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Colebrook equation]] 科尔布鲁克方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[General relativity]] 广义相对论&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Ginzburg–Landau theory]] 金兹堡-朗道方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Ishimori equation]] 石森方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Kadomtsev–Petviashvili equation]] 卡东穆塞夫-彼得韦亚斯维利方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Korteweg–de Vries equation]] kdV方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Landau–Lifshitz–Gilbert equation]] 朗道-利夫希兹-吉尔伯特方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Liénard equation]] 林纳德方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Navier–Stokes equations]] of [[fluid dynamics]] 流体力学的纳维－斯托克斯方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Nonlinear optics]] 非线性光学&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Nonlinear Schrödinger equation]] 非线性薛定谔方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Power-flow study]] 功率流研究&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Richards equation]] for unsaturated water flow 未饱和层水流的理查氏方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Self-balancing unicycle]] 自平衡独轮车&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Sine-Gordon equation]] 正弦-戈尔登方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Van der Pol oscillator]] 范德波尔振荡器&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Vlasov equation]] 弗拉索夫方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Div col end}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==See also 参见==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Aleksandr Mikhailovich Lyapunov]] 亚历山大·李亚普诺夫&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Dynamical system]] 动态系统&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Feedback]] 反馈&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Initial condition]] 初始条件&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Interaction]] 相互作用&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Linear system]] 线性系统&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Mode coupling]] 模式耦合&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Vector soliton]] 矢量孤子&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Volterra series]] 沃尔泰拉级数&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==References 参考资料==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Reflist|35em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Further reading 进一步阅读==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Refbegin|35em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*{{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| author= [[Diederich Hinrichsen]] and Anthony J. Pritchard&lt;br /&gt;
&lt;br /&gt;
| author= Diederich Hinrichsen and Anthony J. Pritchard&lt;br /&gt;
&lt;br /&gt;
作者 Diederich Hinrichsen 和 Anthony j. Pritchard&lt;br /&gt;
&lt;br /&gt;
| year= 2005&lt;br /&gt;
&lt;br /&gt;
| year= 2005&lt;br /&gt;
&lt;br /&gt;
2005年&lt;br /&gt;
&lt;br /&gt;
| title= Mathematical Systems Theory I - Modelling, State Space Analysis, Stability and Robustness&lt;br /&gt;
&lt;br /&gt;
| title= Mathematical Systems Theory I - Modelling, State Space Analysis, Stability and Robustness&lt;br /&gt;
&lt;br /&gt;
数学系统理论 i-建模，状态空间分析，稳定性和鲁棒性&lt;br /&gt;
&lt;br /&gt;
| publisher= Springer Verlag&lt;br /&gt;
&lt;br /&gt;
| publisher= Springer Verlag&lt;br /&gt;
&lt;br /&gt;
出版商 Springer Verlag&lt;br /&gt;
&lt;br /&gt;
| isbn=9783540441250&lt;br /&gt;
&lt;br /&gt;
| isbn=9783540441250&lt;br /&gt;
&lt;br /&gt;
9783540441250&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last= Jordan&lt;br /&gt;
&lt;br /&gt;
| last= Jordan&lt;br /&gt;
&lt;br /&gt;
最后一个乔丹&lt;br /&gt;
&lt;br /&gt;
| first= D. W.&lt;br /&gt;
&lt;br /&gt;
| first= D. W.&lt;br /&gt;
&lt;br /&gt;
首先是 D.w。&lt;br /&gt;
&lt;br /&gt;
| last2= Smith&lt;br /&gt;
&lt;br /&gt;
| last2= Smith&lt;br /&gt;
&lt;br /&gt;
最后2个史密斯&lt;br /&gt;
&lt;br /&gt;
| first2= P.&lt;br /&gt;
&lt;br /&gt;
| first2= P.&lt;br /&gt;
&lt;br /&gt;
| first2 p.&lt;br /&gt;
&lt;br /&gt;
| year= 2007&lt;br /&gt;
&lt;br /&gt;
| year= 2007&lt;br /&gt;
&lt;br /&gt;
2007年&lt;br /&gt;
&lt;br /&gt;
| edition= fourth&lt;br /&gt;
&lt;br /&gt;
| edition= fourth&lt;br /&gt;
&lt;br /&gt;
第四版&lt;br /&gt;
&lt;br /&gt;
| title= Nonlinear Ordinary Differential Equations&lt;br /&gt;
&lt;br /&gt;
| title= Nonlinear Ordinary Differential Equations&lt;br /&gt;
&lt;br /&gt;
非线性常微分方程&lt;br /&gt;
&lt;br /&gt;
| publisher= Oxford University Press&lt;br /&gt;
&lt;br /&gt;
| publisher= Oxford University Press&lt;br /&gt;
&lt;br /&gt;
牛津大学出版社&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-19-920824-1&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-19-920824-1&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-19-920824-1]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last= Khalil&lt;br /&gt;
&lt;br /&gt;
| last= Khalil&lt;br /&gt;
&lt;br /&gt;
最后的哈利勒&lt;br /&gt;
&lt;br /&gt;
| first= Hassan K.&lt;br /&gt;
&lt;br /&gt;
| first= Hassan K.&lt;br /&gt;
&lt;br /&gt;
首先是哈桑 · k。&lt;br /&gt;
&lt;br /&gt;
| year= 2001&lt;br /&gt;
&lt;br /&gt;
| year= 2001&lt;br /&gt;
&lt;br /&gt;
2001年&lt;br /&gt;
&lt;br /&gt;
| title= Nonlinear Systems&lt;br /&gt;
&lt;br /&gt;
| title= Nonlinear Systems&lt;br /&gt;
&lt;br /&gt;
非线性系统&lt;br /&gt;
&lt;br /&gt;
| publisher= Prentice Hall&lt;br /&gt;
&lt;br /&gt;
| publisher= Prentice Hall&lt;br /&gt;
&lt;br /&gt;
出版商 Prentice Hall&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-13-067389-3&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-13-067389-3&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-13-067389-3]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last= Kreyszig&lt;br /&gt;
&lt;br /&gt;
| last= Kreyszig&lt;br /&gt;
&lt;br /&gt;
| last= Kreyszig&lt;br /&gt;
&lt;br /&gt;
| first= Erwin&lt;br /&gt;
&lt;br /&gt;
| first= Erwin&lt;br /&gt;
&lt;br /&gt;
首先是欧文&lt;br /&gt;
&lt;br /&gt;
| authorlink= Erwin Kreyszig&lt;br /&gt;
&lt;br /&gt;
| authorlink= Erwin Kreyszig&lt;br /&gt;
&lt;br /&gt;
作者 / 链接 Erwin Kreyszig&lt;br /&gt;
&lt;br /&gt;
| year= 1998&lt;br /&gt;
&lt;br /&gt;
| year= 1998&lt;br /&gt;
&lt;br /&gt;
1998年&lt;br /&gt;
&lt;br /&gt;
| title= Advanced Engineering Mathematics&lt;br /&gt;
&lt;br /&gt;
| title= Advanced Engineering Mathematics&lt;br /&gt;
&lt;br /&gt;
高等工程数学&lt;br /&gt;
&lt;br /&gt;
| url= https://archive.org/details/advancedengineer0008krey&lt;br /&gt;
&lt;br /&gt;
| url= https://archive.org/details/advancedengineer0008krey&lt;br /&gt;
&lt;br /&gt;
Https://archive.org/details/advancedengineer0008krey&lt;br /&gt;
&lt;br /&gt;
| url-access= registration&lt;br /&gt;
&lt;br /&gt;
| url-access= registration&lt;br /&gt;
&lt;br /&gt;
访问注册&lt;br /&gt;
&lt;br /&gt;
| publisher= Wiley&lt;br /&gt;
&lt;br /&gt;
| publisher= Wiley&lt;br /&gt;
&lt;br /&gt;
出版商 Wiley&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-471-15496-9&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-471-15496-9&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-471-15496-9]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last= Sontag&lt;br /&gt;
&lt;br /&gt;
| last= Sontag&lt;br /&gt;
&lt;br /&gt;
最后一个桑塔格&lt;br /&gt;
&lt;br /&gt;
| first= Eduardo&lt;br /&gt;
&lt;br /&gt;
| first= Eduardo&lt;br /&gt;
&lt;br /&gt;
首先是爱德华多&lt;br /&gt;
&lt;br /&gt;
| authorlink= Eduardo D. Sontag&lt;br /&gt;
&lt;br /&gt;
| authorlink= Eduardo D. Sontag&lt;br /&gt;
&lt;br /&gt;
作者: Eduardo d. Sontag&lt;br /&gt;
&lt;br /&gt;
| year= 1998&lt;br /&gt;
&lt;br /&gt;
| year= 1998&lt;br /&gt;
&lt;br /&gt;
1998年&lt;br /&gt;
&lt;br /&gt;
| title= Mathematical Control Theory: Deterministic Finite Dimensional Systems. Second Edition&lt;br /&gt;
&lt;br /&gt;
| title= Mathematical Control Theory: Deterministic Finite Dimensional Systems. Second Edition&lt;br /&gt;
&lt;br /&gt;
数学控制理论: 确定性有限维系统。第二版&lt;br /&gt;
&lt;br /&gt;
| publisher= Springer&lt;br /&gt;
&lt;br /&gt;
| publisher= Springer&lt;br /&gt;
&lt;br /&gt;
出版商斯普林格&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-387-98489-6&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-387-98489-6&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-387-98489-6]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
{{Refend}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==External links 外部链接==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[http://www.dodccrp.org/ Command and Control Research Program (CCRP)]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[http://necsi.edu/guide/concepts/linearnonlinear.html New England Complex Systems Institute: Concepts in Complex Systems]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[http://ocw.mit.edu/courses/mathematics/18-353j-nonlinear-dynamics-i-chaos-fall-2012/ Nonlinear Dynamics I: Chaos] at [http://ocw.mit.edu/OcwWeb/index.htm MIT's OpenCourseWare]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[http://www.hedengren.net/research/models.htm Nonlinear Model Library]{{snd}} (in [[MATLAB]]) a Database of Physical Systems&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[http://cnls.lanl.gov/ The Center for Nonlinear Studies at Los Alamos National Laboratory]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Systems science}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Differential equations topics}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Authority control}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
[https://campus.swarma.org/ 集智学园]课程：[https://campus.swarma.org/course/697 非线性动力学与混沌]&lt;br /&gt;
&lt;br /&gt;
非线性动力学和混沌理论是系统发展的，从一阶微分方程及其分岔开始，然后是相平面分析，极限环和它们的分岔，最终得到Lorenz方程，混沌，迭代映射，周期倍增，重整化，分形和奇怪吸引。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
此系列课程由[[斯蒂文·斯特罗加茨 Steven H. Strogatz]]主持，内容包括机械振动，激光，生物节律，超导电路，昆虫爆发，化学振荡器，遗传控制系统，混沌水轮，甚至是使用混乱发送秘密信息的技术。在每种情况下，科学背景都在初级阶段进行解释，并与数学理论紧密结合。&lt;br /&gt;
&lt;br /&gt;
[[Category:Nonlinear systems| ]]&lt;br /&gt;
&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
[[Category:Dynamical systems]]&lt;br /&gt;
&lt;br /&gt;
Category:Dynamical systems&lt;br /&gt;
&lt;br /&gt;
类别: 动力系统&lt;br /&gt;
&lt;br /&gt;
[[Category:Concepts in physics]]&lt;br /&gt;
&lt;br /&gt;
Category:Concepts in physics&lt;br /&gt;
&lt;br /&gt;
分类: 物理概念&lt;br /&gt;
&lt;br /&gt;
&amp;lt;noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;small&amp;gt;This page was moved from [[wikipedia:en:Nonlinear system]]. Its edit history can be viewed at [[非线性系统/edithistory]]&amp;lt;/small&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:待整理页面]]&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E9%9D%9E%E7%BA%BF%E6%80%A7%E7%B3%BB%E7%BB%9F&amp;diff=10618</id>
		<title>非线性系统</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E9%9D%9E%E7%BA%BF%E6%80%A7%E7%B3%BB%E7%BB%9F&amp;diff=10618"/>
		<updated>2020-07-18T03:37:31Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。{{Redirect|Nonlinear dynamics|the journal|Nonlinear Dynamics (journal)}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Complex systems}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{About|&amp;quot;nonlinearity&amp;quot; in mathematics, physics and other sciences|video and film editing|Non-linear editing system|other uses|Nonlinearity (disambiguation)}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In [[mathematics]] and [[science]], a '''nonlinear system''' is a [[system]] in which the change of the output is not [[proportionality (mathematics)|proportional]] to the change of the input.&amp;lt;ref&amp;gt;{{Cite news|url=https://news.mit.edu/2010/explained-linear-0226|title=Explained: Linear and nonlinear systems|work=MIT News|access-date=2018-06-30}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite web|url=https://www.birmingham.ac.uk/research/activity/mathematics/applied-maths/nonlinear-systems.aspx|title=Nonlinear systems, Applied Mathematics - University of Birmingham|website=www.birmingham.ac.uk|language=en-gb|access-date=2018-06-30}}&amp;lt;/ref&amp;gt; Nonlinear problems are of interest to [[engineer]]s, [[biologist]]s,&amp;lt;ref&amp;gt;{{Citation|date=2007|pages=181–276|publisher=Springer Berlin Heidelberg|language=en|doi=10.1007/978-3-540-34153-6_7|isbn=9783540341529|title = The Nonlinear Universe|series = The Frontiers Collection|chapter = Nonlinear Biology}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last=Korenberg|first=Michael J.|last2=Hunter|first2=Ian W.|date=March 1996|title=The identification of nonlinear biological systems: Volterra kernel approaches|journal=Annals of Biomedical Engineering|language=en|volume=24|issue=2|pages=250–268|doi=10.1007/bf02667354|issn=0090-6964}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last=Mosconi|first=Francesco|last2=Julou|first2=Thomas|last3=Desprat|first3=Nicolas|last4=Sinha|first4=Deepak Kumar|last5=Allemand|first5=Jean-François|last6=Vincent Croquette|last7=Bensimon|first7=David|date=2008|title=Some nonlinear challenges in biology|url=http://stacks.iop.org/0951-7715/21/i=8/a=T03|journal=Nonlinearity|language=en|volume=21|issue=8|pages=T131|doi=10.1088/0951-7715/21/8/T03|issn=0951-7715|bibcode=2008Nonli..21..131M}}&amp;lt;/ref&amp;gt; [[physicist]]s,&amp;lt;ref&amp;gt;{{cite journal|last1=Gintautas|first1=V.|title=Resonant forcing of nonlinear systems of differential equations|journal=Chaos|date=2008|volume=18|issue=3|pages=033118|doi=10.1063/1.2964200|pmid=19045456|arxiv=0803.2252|bibcode=2008Chaos..18c3118G}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Stephenson|first1=C.|last2=et.|first2=al.|title=Topological properties of a self-assembled electrical network via ab initio calculation|journal=Sci. Rep.|volume=7|pages=41621|date=2017|doi=10.1038/srep41621|pmid=28155863|pmc=5290745|bibcode=2017NatSR...741621S}}&amp;lt;/ref&amp;gt; [[mathematician]]s, and many other [[scientist]]s because most systems are inherently nonlinear in nature.&amp;lt;ref&amp;gt;{{cite book|last1=de Canete|first1=Javier, Cipriano Galindo, and Inmaculada Garcia-Moral|title=System Engineering and Automation: An Interactive Educational Approach|date=2011|publisher=Springer|location=Berlin|isbn=978-3642202292|page=46|url=https://books.google.com/?id=h8rCQYXGGY8C&amp;amp;pg=PA46&amp;amp;lpg=PA46&amp;amp;dq=most+systems+are+inherently+nonlinear+in+nature#v=onepage&amp;amp;q=most%20systems%20are%20inherently%20nonlinear%20in%20nature&amp;amp;f=false|accessdate=20 January 2018}}&amp;lt;/ref&amp;gt; Nonlinear [[dynamical system]]s, describing changes in variables over time, may appear chaotic, unpredictable, or counterintuitive, contrasting with much simpler [[linear system]]s.&lt;br /&gt;
&lt;br /&gt;
In mathematics and science, a nonlinear system is a system in which the change of the output is not proportional to the change of the input. Nonlinear problems are of interest to engineers, biologists, physicists, mathematicians, and many other scientists because most systems are inherently nonlinear in nature. Nonlinear dynamical systems, describing changes in variables over time, may appear chaotic, unpredictable, or counterintuitive, contrasting with much simpler linear systems.&lt;br /&gt;
&lt;br /&gt;
在数学及科学中，'''非线性系统 Nonlinear System'''是一种输出的变化与输入的变化不成比例的系统。大多数系统在本质上是非线性的，因而非线性问题引起了工程师、生物学家、物理学家、数学家和许多其他科学家的兴趣。描述变量随时间变化的非线性动力系统与较之简单得多的线性系统相比，可能显得混沌、不可预测或违反直觉。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Typically, the behavior of a nonlinear system is described in mathematics by a '''nonlinear system of equations''', which is a set of simultaneous [[equation]]s in which the unknowns (or the unknown functions in the case of [[differential equation]]s) appear as variables of a [[polynomial]] of degree higher than one or in the argument of a [[function (mathematics)|function]] which is not a polynomial of degree one.&lt;br /&gt;
&lt;br /&gt;
Typically, the behavior of a nonlinear system is described in mathematics by a nonlinear system of equations, which is a set of simultaneous equations in which the unknowns (or the unknown functions in the case of differential equations) appear as variables of a polynomial of degree higher than one or in the argument of a function which is not a polynomial of degree one.&lt;br /&gt;
&lt;br /&gt;
通常，非线性系统的行为在数学上是由一组非线性联立方程来描述的，其中未知数（或微分方程中的未知函数）作为一个高于一次的多项式的变量出现，或者作为一个不是一次多项式的函数的论元出现。__[[用户:Dorr|Dorr]]（[[用户讨论:Dorr|讨论]]）后半句不知如何翻译&lt;br /&gt;
&lt;br /&gt;
&amp;lt;font color='blue'&amp;gt;通常，非线性系统的行为在数学上被描述为一组非线性的联立方程组，其中未知数（或微分方程中的未知函数）作为一个高于一次的多项式变量出现，或者作为一个非一次多项式函数的参数出现。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In other words, in a nonlinear system of equations, the equation(s) to be solved cannot be written as a [[linear combination]] of the unknown [[variable (mathematics)|variables]] or [[function (mathematics)|functions]] that appear in them. Systems can be defined as nonlinear, regardless of whether known linear functions appear in the equations. In particular, a differential equation is ''linear'' if it is linear in terms of the unknown function and its derivatives, even if nonlinear in terms of the other variables appearing in it.&lt;br /&gt;
&lt;br /&gt;
In other words, in a nonlinear system of equations, the equation(s) to be solved cannot be written as a linear combination of the unknown variables or functions that appear in them. Systems can be defined as nonlinear, regardless of whether known linear functions appear in the equations. In particular, a differential equation is linear if it is linear in terms of the unknown function and its derivatives, even if nonlinear in terms of the other variables appearing in it.&lt;br /&gt;
&lt;br /&gt;
换句话说，在非线性方程系统中，&amp;lt;font color='red'&amp;gt;要求解&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;待解&amp;lt;/font&amp;gt; 的方程不能被写成未知变量或函数的线性组合。无论方程中是否有已知的线性函数，系统都可以被定义为非线性。特别是当一个微分方程的未知函数及其导数是线性的，即使其他变量是非线性的，也称该方程是线性的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
As nonlinear dynamical equations are difficult to solve, nonlinear systems are commonly approximated by linear equations ([[linearization]]). This works well up to some accuracy and some range for the input values, but some interesting phenomena such as [[soliton]]s, [[chaos theory|chaos]],&amp;lt;ref&amp;gt;[http://ocw.mit.edu/OcwWeb/Earth--Atmospheric--and-Planetary-Sciences/12-006JFall-2006/CourseHome/index.htm Nonlinear Dynamics I: Chaos] {{webarchive|url=https://web.archive.org/web/20080212045134/http://ocw.mit.edu/OcwWeb/Earth--Atmospheric--and-Planetary-Sciences/12-006JFall-2006/CourseHome/index.htm |date=2008-02-12}} at [http://ocw.mit.edu/OcwWeb/index.htm MIT's OpenCourseWare]&amp;lt;/ref&amp;gt; and [[mathematical singularity|singularities]] are hidden by linearization. It follows that some aspects of the dynamic behavior of a nonlinear system can appear to be counterintuitive, unpredictable or even chaotic. Although such chaotic behavior may resemble [[randomness|random]] behavior, it is in fact not random. For example, some aspects of the weather are seen to be chaotic, where simple changes in one part of the system produce complex effects throughout. This nonlinearity is one of the reasons why accurate long-term forecasts are impossible with current technology.&lt;br /&gt;
&lt;br /&gt;
As nonlinear dynamical equations are difficult to solve, nonlinear systems are commonly approximated by linear equations (linearization). This works well up to some accuracy and some range for the input values, but some interesting phenomena such as solitons, chaos, and singularities are hidden by linearization. It follows that some aspects of the dynamic behavior of a nonlinear system can appear to be counterintuitive, unpredictable or even chaotic. Although such chaotic behavior may resemble random behavior, it is in fact not random. For example, some aspects of the weather are seen to be chaotic, where simple changes in one part of the system produce complex effects throughout. This nonlinearity is one of the reasons why accurate long-term forecasts are impossible with current technology.&lt;br /&gt;
&lt;br /&gt;
由于非线性动力学方程难以求解，通常用线性&amp;lt;font color='red'&amp;gt;&amp;lt;s&amp;gt;化&amp;lt;/s&amp;gt;(这种解法是线性化(linearization)，此处还是按linear来翻吧)&amp;lt;/font&amp;gt;方程来近似非线性系统（'''线性化 Linearization'''）。&amp;lt;font color='red'&amp;gt;这种方法在一定的精度和范围对输入值效果很好&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;这种方法对于一定范围的输入和某些精度要求下的效果不错&amp;lt;/font&amp;gt;，但一些有趣的现象如'''孤子 Soliton'''、'''混沌 Chaos'''和'''奇异性 Singularity'''在线性化后被隐藏。因此，非线性系统的动态行为在某些方面可能看起来违反直觉、不可预测、甚至混沌。尽管这种混沌行为可能感觉很像随机行为，但它实际上并不是随机的。例如，天气的某些方面被认为是混沌的，其系统某部分的微小扰动就会产生复杂的&amp;lt;font color='blue'&amp;gt;整体(throughout)&amp;lt;/font&amp;gt;影响。这种非线性是目前技术无法进行精确长期预测的原因之一。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Some authors use the term '''nonlinear science''' for the study of nonlinear systems. This term is disputed by others:&lt;br /&gt;
&lt;br /&gt;
Some authors use the term nonlinear science for the study of nonlinear systems. This term is disputed by others:&lt;br /&gt;
&lt;br /&gt;
有些作者用非线性科学这一术语来研究非线性系统。这一术语引起了其他人的争议:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{quote|Using a term like nonlinear science is like referring to the bulk of zoology as the study of [[negation|non]]-elephant animals.|[[Stanislaw Ulam]]&amp;lt;ref&amp;gt;{{cite journal|last1=Campbell|first1=David K.|title=Nonlinear physics: Fresh breather|journal=Nature|date=25 November 2004|volume=432|issue=7016|pages=455–456|doi=10.1038/432455a|pmid=15565139|url=https://zenodo.org/record/1134179|language=en|issn=0028-0836|bibcode=2004Natur.432..455C}}&amp;lt;/ref&amp;gt;}}&lt;br /&gt;
&lt;br /&gt;
“使用‘非线性科学’这样的术语，就如同把动物学里大部分对象称作‘非大象动物’研究一样可笑。”&lt;br /&gt;
&lt;br /&gt;
——'''斯塔尼斯拉夫·乌拉姆 Stanislaw Ulam'''&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Definition 定义==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In [[mathematics]], a [[linear map]] (or ''linear function'') &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; is one which satisfies both of the following properties:&lt;br /&gt;
&lt;br /&gt;
In mathematics, a linear map (or linear function) &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; is one which satisfies both of the following properties:&lt;br /&gt;
&lt;br /&gt;
在数学中，线性映射（或线性函数）&amp;lt;math&amp;gt;f (x)&amp;lt;/math&amp;gt;满足以下两个性质:&lt;br /&gt;
&lt;br /&gt;
*Additivity or [[superposition Principle]]: &amp;lt;math&amp;gt;\textstyle f(x + y) = f(x) + f(y);&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
*Homogeneity: &amp;lt;math&amp;gt;\textstyle f(\alpha x) = \alpha f(x).&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*'''可加性 Additivity'''（'''叠加性 Superposition principle'''）: &amp;lt;math&amp;gt;\textstyle f(x + y) = f(x) + f(y);&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
*'''齐次性 Homogeneity''': &amp;lt;math&amp;gt;\textstyle f(\alpha x) = \alpha f(x).&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Additivity implies homogeneity for any [[rational number|rational]] ''α'', and, for [[continuous function]]s, for any [[real number|real]] ''α''. For a [[complex number|complex]] ''α'', homogeneity does not follow from additivity. For example, an [[antilinear map]] is additive but not homogeneous. The conditions of additivity and homogeneity are often combined in the superposition principle&lt;br /&gt;
&lt;br /&gt;
Additivity implies homogeneity for any rational α, and, for continuous functions, for any real α. For a complex α, homogeneity does not follow from additivity. For example, an antilinear map is additive but not homogeneous. The conditions of additivity and homogeneity are often combined in the superposition principle:&lt;br /&gt;
&lt;br /&gt;
当α是有理数或实数，且&amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt;是连续函数时，由可加性可以推出齐次性。但当α是复数时，可加性不能导出齐次性。例如，反线性映射是可加的，但不是齐次的。可加性和齐次性条件经常组合，称为叠加原理：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;f(\alpha x + \beta y) = \alpha f(x) + \beta f(y)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
An equation written as&lt;br /&gt;
&lt;br /&gt;
对一个写成&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;f(x) = C&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
is called '''linear''' if &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; is a linear map (as defined above) and '''nonlinear''' otherwise. The equation is called ''homogeneous'' if &amp;lt;math&amp;gt;C = 0&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
is called linear if &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; is a linear map (as defined above) and nonlinear otherwise. The equation is called homogeneous if &amp;lt;math&amp;gt;C = 0&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
的方程，若 &amp;lt;math&amp;gt; f (x) &amp;lt;/math&amp;gt; 是线性映射（如上定义） ，则称其为'''线性的 Linear'''，否则称为'''非线性的 Nonlinear'''。若&amp;lt;math&amp;gt;C = 0&amp;lt;/math&amp;gt;，该方程称为是齐次的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The definition &amp;lt;math&amp;gt;f(x) = C&amp;lt;/math&amp;gt; is very general in that &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; can be any sensible mathematical object (number, vector, function, etc.), and the function &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; can literally be any [[map (mathematics)|mapping]], including integration or differentiation with associated constraints (such as [[boundary values]]). If &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; contains [[derivative|differentiation]] with respect to &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt;, the result will be a [[differential equation]].&lt;br /&gt;
&lt;br /&gt;
The definition &amp;lt;math&amp;gt;f(x) = C&amp;lt;/math&amp;gt; is very general in that &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; can be any sensible mathematical object (number, vector, function, etc.), and the function &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; can literally be any mapping, including integration or differentiation with associated constraints (such as boundary values). If &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; contains differentiation with respect to &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt;, the result will be a differential equation.&lt;br /&gt;
&lt;br /&gt;
定义 &amp;lt;math&amp;gt;f(x) = C&amp;lt;/math&amp;gt; 是非常具有一般性的，因为 &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; 可以是任意&amp;lt;font color='red'&amp;gt;可感知&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt; 合理 &amp;lt;/font&amp;gt;的数学对象（数字、向量、函数等），函数 &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; 实际上可以是任意映射，包括有相关约束（如给定边界值）的积分或微分。若 &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; 包含对 &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; 的微分运算，则该方程为微分方程。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===相关概念辨析===&lt;br /&gt;
'''线性Linear'''、'''非线性Nonlinear'''、'''亚线性 Sublinear'''、'''超线性 Superlinear'''：描述量与量之间的一种变化关系，例如&amp;lt;math&amp;gt;y=a+b*x^n&amp;lt;/math&amp;gt;，其中&amp;lt;math&amp;gt;n&amp;gt;1&amp;lt;/math&amp;gt;。当&amp;lt;math&amp;gt;n=1&amp;lt;/math&amp;gt;时，表示为线性关系；&amp;lt;math&amp;gt;n\neq 1&amp;lt;/math&amp;gt;时，表示为非线性关系；当&amp;lt;math&amp;gt;0&amp;lt;n&amp;lt;1&amp;lt;/math&amp;gt;时，表示为亚线性关系；当&amp;lt;math&amp;gt;n&amp;gt;1&amp;lt;/math&amp;gt;时，表示为超线性关系。&lt;br /&gt;
&lt;br /&gt;
亚线性与超线性属于非线性变化关系范畴。当两个变量之间存在亚线性关系时，其典型特性是因变量的变化速率会随着自变量的增大而减小，即其一阶导数会随着自变量的增大而减小；两个变量之间存在超线性关系时，其典型特性是因变量的变化速率会随着自变量的增大而增大，即其一阶导数会随着自变量的增大而增大。&lt;br /&gt;
&lt;br /&gt;
在线性系统中，整体等于部分和，描述线性系统的方程满足叠加原理，作用的总和正好等于每一部分作用相加的代数和，这意味着每一部分作用都是独立的、互不相关的；而在普遍存在的非线性系统中，作用的总和不等于每一部分作用相加的代数和，因为系统内部要素之间存在着复杂的非线性相互作用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Nonlinear algebraic equations 非线性代数方程==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Algebraic equation|System of polynomial equations}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Nonlinear [[algebraic equation]]s, which are also called ''[[polynomial equation]]s'', are defined by equating [[polynomial]]s (of degree greater than one) to zero. For example,&lt;br /&gt;
&lt;br /&gt;
Nonlinear algebraic equations, which are also called polynomial equations, are defined by equating polynomials (of degree greater than one) to zero. For example,&lt;br /&gt;
&lt;br /&gt;
非线性'''代数方程 Algebraic Equation'''，又称'''多项式方程 Polynomial Equation'''，由某多项式（次数大于1）等于零定义。例如：&lt;br /&gt;
&lt;br /&gt;
 &lt;br /&gt;
&amp;lt;math&amp;gt;x^2 + x - 1 = 0\,.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
For a single polynomial equation, [[root-finding algorithm]]s can be used to find solutions to the equation (i.e., sets of values for the variables that satisfy the equation). However, systems of algebraic equations are more complicated; their study is one motivation for the field of [[algebraic geometry]], a difficult branch of modern mathematics. It is even difficult to decide whether a given algebraic system has complex solutions (see [[Hilbert's Nullstellensatz]]). Nevertheless, in the case of the systems with a finite number of complex solutions, these [[systems of polynomial equations]] are now well understood and efficient methods exist for solving them.&amp;lt;ref&amp;gt;{{cite journal |last1= Lazard |first1= D. |title= Thirty years of Polynomial System Solving, and now? |doi= 10.1016/j.jsc.2008.03.004 |journal= Journal of Symbolic Computation |volume= 44 |issue= 3 |pages= 222–231 |year= 2009 |pmid= |pmc=}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
For a single polynomial equation, root-finding algorithms can be used to find solutions to the equation (i.e., sets of values for the variables that satisfy the equation). However, systems of algebraic equations are more complicated; their study is one motivation for the field of algebraic geometry, a difficult branch of modern mathematics. It is even difficult to decide whether a given algebraic system has complex solutions (see Hilbert's Nullstellensatz). Nevertheless, in the case of the systems with a finite number of complex solutions, these systems of polynomial equations are now well understood and efficient methods exist for solving them.&lt;br /&gt;
&lt;br /&gt;
对于一个单一的多项式方程，'''求根算法 Root-finding Algorithms'''可用于其求解（即找到满足该方程的变量的值集）。而代数方程组则相对复杂，其研究是现代数学的较难分支——'''代数几何 Algebraic Geometry'''领域的动力之一。甚至很难判断一个给定的代数系统是否有复数解（见'''希尔伯特零点定律  Hilbert's Nullstellensatz'''）。不过，对于具有有限个复数解的系统的多项式方程组，我们现在已经有了充分的理解，并且找到了有效的求解方法。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Nonlinear recurrence relations 非线性递推关系==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A nonlinear [[recurrence relation]] defines successive terms of a [[sequence]] as a nonlinear function of preceding terms. Examples of nonlinear recurrence relations are the [[logistic map]] and the relations that define the various [[Hofstadter sequence]]s. Nonlinear discrete models that represent a wide class of nonlinear recurrence relationships include the NARMAX (Nonlinear Autoregressive Moving Average with eXogenous inputs) model and the related [[nonlinear system identification]] and analysis procedures.&amp;lt;ref name=&amp;quot;SAB1&amp;quot;&amp;gt;Billings S.A. &amp;quot;Nonlinear System Identification: NARMAX Methods in the Time, Frequency, and Spatio-Temporal Domains&amp;quot;. Wiley, 2013&amp;lt;/ref&amp;gt; These approaches can be used to study a wide class of complex nonlinear behaviors in the time, frequency, and spatio-temporal domains.&lt;br /&gt;
&lt;br /&gt;
A nonlinear recurrence relation defines successive terms of a sequence as a nonlinear function of preceding terms. Examples of nonlinear recurrence relations are the logistic map and the relations that define the various Hofstadter sequences. Nonlinear discrete models that represent a wide class of nonlinear recurrence relationships include the NARMAX (Nonlinear Autoregressive Moving Average with eXogenous inputs) model and the related nonlinear system identification and analysis procedures. These approaches can be used to study a wide class of complex nonlinear behaviors in the time, frequency, and spatio-temporal domains.&lt;br /&gt;
&lt;br /&gt;
非线性递归关系中，序列的连续项被定义为其前项的非线性函数。非线性递归关系的例子有 [[logistic 映射]]和定义各种'''霍夫斯塔特序列 Hofstadter Sequences''' 的关系。非线性离散模型代表了一类广泛的非线性递归关系，包括 NARMAX（外部输入非线性自回归移动平均）模型和相关的非线性系统辨识和分析程序。这些方法可用于研究时域、频域和时空域的广泛复杂非线性行为。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Nonlinear differential equations 非线性微分方程==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A [[simultaneous equations|system]] of [[differential equation]]s is said to be nonlinear if it is not a [[linear system]]. Problems involving nonlinear differential equations are extremely diverse, and methods of solution or analysis are problem dependent. Examples of nonlinear differential equations are the [[Navier–Stokes equations]] in fluid dynamics and the [[Lotka–Volterra equation]]s in biology.&lt;br /&gt;
&lt;br /&gt;
A system of differential equations is said to be nonlinear if it is not a linear system. Problems involving nonlinear differential equations are extremely diverse, and methods of solution or analysis are problem dependent. Examples of nonlinear differential equations are the Navier–Stokes equations in fluid dynamics and the Lotka–Volterra equations in biology.&lt;br /&gt;
&lt;br /&gt;
若一个微分方程组不是线性系统，则称其为非线性的。涉及非线性微分方程的问题非常多样，对不同问题的解决或分析方法也不相同。非线性微分方程的例子有流体力学中的 '''纳维-斯托克斯方程 Navier-Stokes Equations'''和生物学中的'''洛特卡－沃尔泰拉方程 Lotka-Volterra Equations'''。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
One of the greatest difficulties of nonlinear problems is that it is not generally possible to combine known solutions into new solutions. In linear problems, for example, a family of [[linearly independent]] solutions can be used to construct general solutions through the [[superposition principle]]. A good example of this is one-dimensional heat transport with [[Dirichlet boundary conditions]], the solution of which can be written as a time-dependent linear combination of sinusoids of differing frequencies; this makes solutions very flexible. It is often possible to find several very specific solutions to nonlinear equations, however the lack of a superposition principle prevents the construction of new solutions.&lt;br /&gt;
&lt;br /&gt;
One of the greatest difficulties of nonlinear problems is that it is not generally possible to combine known solutions into new solutions. In linear problems, for example, a family of linearly independent solutions can be used to construct general solutions through the superposition principle. A good example of this is one-dimensional heat transport with Dirichlet boundary conditions, the solution of which can be written as a time-dependent linear combination of sinusoids of differing frequencies; this makes solutions very flexible. It is often possible to find several very specific solutions to nonlinear equations, however the lack of a superposition principle prevents the construction of new solutions.&lt;br /&gt;
&lt;br /&gt;
非线性问题最大的困难之一是通常不可能将已知的解组合成新的解。例如，在线性问题中，可以根据叠加原理以一族线性独立的解构造通解。一个很好的例子是带有'''狄利克雷边界条件 Dirichlet Boundary Conditions'''的一维热传导问题，其解（随时间变化）可以写成不同频率的正弦波的线性组合，这使得解非常灵活。而对非线性方程，通常可以找到几个非常特殊的解，但是此时叠加原理不适用，故无法构造新的解。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Ordinary differential equations 常微分方程===&lt;br /&gt;
&lt;br /&gt;
First order [[ordinary differential equation]]s are often exactly solvable by [[separation of variables]], especially for autonomous equations. For example, the nonlinear equation&lt;br /&gt;
&lt;br /&gt;
First order ordinary differential equations are often exactly solvable by separation of variables, especially for autonomous equations. For example, the nonlinear equation&lt;br /&gt;
&lt;br /&gt;
一阶常微分方程，尤其是自治方程，通常可以用'''分离变量法  Separation of Variables'''来精确求解。例如，非线性方程&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{d u}{d x} = -u^2&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
has &amp;lt;math&amp;gt;u=\frac{1}{x+C}&amp;lt;/math&amp;gt; as a general solution (and also ''u'' = 0 as a particular solution, corresponding to the limit of the general solution when ''C'' tends to infinity). The equation is nonlinear because it may be written as&lt;br /&gt;
&lt;br /&gt;
has &amp;lt;math&amp;gt;u=\frac{1}{x+C}&amp;lt;/math&amp;gt; as a general solution (and also u = 0 as a particular solution, corresponding to the limit of the general solution when C tends to infinity). The equation is nonlinear because it may be written as&lt;br /&gt;
&lt;br /&gt;
将 &amp;lt;math&amp;gt;u=\frac{1}{x+C}&amp;lt;/math&amp;gt; 作为一般解（也有特解 ''u'' = 0，对应于 ''C'' 趋于无穷时的一般解的极限)。该方程是非线性的，因为它可以改写成&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{du}{d x} + u^2=0&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
and the left-hand side of the equation is not a linear function of ''u'' and its derivatives. Note that if the ''u''&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt; term were replaced with ''u'', the problem would be linear (the [[exponential decay]] problem).&lt;br /&gt;
&lt;br /&gt;
and the left-hand side of the equation is not a linear function of u and its derivatives. Note that if the u&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt; term were replaced with u, the problem would be linear (the exponential decay problem).&lt;br /&gt;
&lt;br /&gt;
方程的左边不是 ''u'' 及其导数的线性函数。注意，若将 ''u''&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt; 项替换为''u''，该问题将变为线性的（'''指数衰减 Exponential Decay'''问题）。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Second and higher order ordinary differential equations (more generally, systems of nonlinear equations) rarely yield [[closed-form expression|closed-form]] solutions, though implicit solutions and solutions involving [[nonelementary integral]]s are encountered.&lt;br /&gt;
&lt;br /&gt;
Second and higher order ordinary differential equations (more generally, systems of nonlinear equations) rarely yield closed-form solutions, though implicit solutions and solutions involving nonelementary integrals are encountered.&lt;br /&gt;
&lt;br /&gt;
二阶和高阶常微分方程（更一般地说，非线性方程组）很少能产生封闭解，而隐式解和非初等函数积分形式的解较为常见。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Common methods for the qualitative analysis of nonlinear ordinary differential equations include:&lt;br /&gt;
&lt;br /&gt;
Common methods for the qualitative analysis of nonlinear ordinary differential equations include:&lt;br /&gt;
&lt;br /&gt;
非线性常微分方程定性分析的常用方法包括:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*Examination of any [[conserved quantities]], especially in [[Hamiltonian system]]s&lt;br /&gt;
&lt;br /&gt;
*检查是否有任意'''守恒量 Conserved Quantities'''（特别是在'''哈密顿系统 Hamiltonian System'''中）&lt;br /&gt;
&lt;br /&gt;
*Examination of dissipative quantities (see [[Lyapunov function]]) analogous to conserved quantities&lt;br /&gt;
&lt;br /&gt;
*检查是否有类似守恒量的耗散量（见'''李亚普诺夫函数 Lyapunov Function'''）&lt;br /&gt;
&lt;br /&gt;
*Linearization via [[Taylor expansion]]&lt;br /&gt;
&lt;br /&gt;
*基于'''泰勒展开 Taylor Expansion'''的线性化&lt;br /&gt;
&lt;br /&gt;
*Change of variables into something easier to study&lt;br /&gt;
&lt;br /&gt;
*将变量进行代换以便更好的进行研究&lt;br /&gt;
&lt;br /&gt;
*[[Bifurcation theory]]&lt;br /&gt;
&lt;br /&gt;
*'''分岔理论 Bifurcation Theory'''&lt;br /&gt;
&lt;br /&gt;
*[[Perturbation theory|Perturbation]] methods (can be applied to algebraic equations too)&lt;br /&gt;
&lt;br /&gt;
*'''摄动理论 Perturbation Theory'''（也可应用于代数方程）&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Partial differential equations 偏微分方程===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{main|Nonlinear partial differential equation}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{See also|List of nonlinear partial differential equations}}&lt;br /&gt;
&lt;br /&gt;
参见：非线性偏微分列表&lt;br /&gt;
&lt;br /&gt;
The most common basic approach to studying nonlinear [[partial differential equation]]s is to change the variables (or otherwise transform the problem) so that the resulting problem is simpler (possibly even linear). Sometimes, the equation may be transformed into one or more [[ordinary differential equation]]s, as seen in [[separation of variables]], which is always useful whether or not the resulting ordinary differential equation(s) is solvable.&lt;br /&gt;
&lt;br /&gt;
The most common basic approach to studying nonlinear partial differential equations is to change the variables (or otherwise transform the problem) so that the resulting problem is simpler (possibly even linear). Sometimes, the equation may be transformed into one or more ordinary differential equations, as seen in separation of variables, which is always useful whether or not the resulting ordinary differential equation(s) is solvable.&lt;br /&gt;
&lt;br /&gt;
研究非线性偏微分方程最常用的基本方法是变量代换（或转换问题），使变换后的问题更简单（甚至可能变为线性的）。有时可以将此类方程转化成一或多个常微分方程（如同分离变量法所示），此时不论得到的常微分方程是否可解，对研究问题总是有用的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Another common (though less mathematic) tactic, often seen in fluid and heat mechanics, is to use [[scale analysis (mathematics)|scale analysis]] to simplify a general, natural equation in a certain specific [[boundary value problem]]. For example, the (very) nonlinear [[Navier-Stokes equations]] can be simplified into one linear partial differential equation in the case of transient, laminar, one dimensional flow in a circular pipe; the scale analysis provides conditions under which the flow is laminar and one dimensional and also yields the simplified equation.&lt;br /&gt;
&lt;br /&gt;
Another common (though less mathematic) tactic, often seen in fluid and heat mechanics, is to use scale analysis to simplify a general, natural equation in a certain specific boundary value problem. For example, the (very) nonlinear Navier-Stokes equations can be simplified into one linear partial differential equation in the case of transient, laminar, one dimensional flow in a circular pipe; the scale analysis provides conditions under which the flow is laminar and one dimensional and also yields the simplified equation.&lt;br /&gt;
&lt;br /&gt;
另一个流体力学和热力学中常见的策略（虽然不是数学上的）是利用'''尺度分析 Scale Analysis'''来在某一特定边界条件下简化一般自然方程。例如，在描述圆管内一维层流的暂态时，非线性的纳维－斯托克斯方程可以简化为一个线性的偏微分方程; 尺度分析提供了层流和一维流动的条件，也产生了简化的方程。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Other methods include examining the [[method of characteristics|characteristics]] and using the methods outlined above for ordinary differential equations.&lt;br /&gt;
&lt;br /&gt;
Other methods include examining the characteristics and using the methods outlined above for ordinary differential equations.&lt;br /&gt;
&lt;br /&gt;
其他方法包括检查特征线法及前面所述研究常微分方程的方法。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Pendula 摆===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Pendulum (mathematics)}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:PendulumLayout.svg.png|thumb|图一：Illustration of a pendulum 摆图解|right|200px]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:PendulumLinearizations.png|thumb|图二：Linearizations of a pendulum 摆的线性化|right|200px]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A classic, extensively studied nonlinear problem is the dynamics of a [[pendulum (mathematics)|pendulum]] under the influence of [[gravity]]. Using [[Lagrangian mechanics]], it may be shown&amp;lt;ref&amp;gt;[http://www.damtp.cam.ac.uk/user/tong/dynamics.html David Tong: Lectures on Classical Dynamics]&amp;lt;/ref&amp;gt; that the motion of a pendulum can be described by the [[dimensionless]] nonlinear equation&lt;br /&gt;
&lt;br /&gt;
A classic, extensively studied nonlinear problem is the dynamics of a pendulum under the influence of gravity. Using Lagrangian mechanics, it may be shown that the motion of a pendulum can be described by the dimensionless nonlinear equation&lt;br /&gt;
&lt;br /&gt;
一个经典的被广泛研究的非线性问题是重力影响下的摆的动力学。利用'''拉格朗日力学 Lagrangian Mechanics'''，可以证明摆的运动可以用无量纲的非线性方程&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{d^2 \theta}{d t^2} + \sin(\theta) = 0&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
where gravity points &amp;quot;downwards&amp;quot; and &amp;lt;math&amp;gt;\theta&amp;lt;/math&amp;gt; is the angle the pendulum forms with its rest position, as shown in the figure at right. One approach to &amp;quot;solving&amp;quot; this equation is to use &amp;lt;math&amp;gt;d\theta/dt&amp;lt;/math&amp;gt; as an [[integrating factor]], which would eventually yield&lt;br /&gt;
&lt;br /&gt;
where gravity points &amp;quot;downwards&amp;quot; and &amp;lt;math&amp;gt;\theta&amp;lt;/math&amp;gt; is the angle the pendulum forms with its rest position, as shown in the figure at right. One approach to &amp;quot;solving&amp;quot; this equation is to use &amp;lt;math&amp;gt;d\theta/dt&amp;lt;/math&amp;gt; as an integrating factor, which would eventually yield&lt;br /&gt;
&lt;br /&gt;
描述，其中重力指向“下方”，&amp;lt;math&amp;gt;\theta&amp;lt;/math&amp;gt; 是摆与其静止位置形成的角度，如右图所示。“解”这个方程的方法之一是用 &amp;lt;math&amp;gt;d\theta/dt&amp;lt;/math&amp;gt; 作为'''积分因子 Integrating Factor'''，最终得&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\int{\frac{d \theta}{\sqrt{C_0 + 2 \cos(\theta)}}} = t + C_1&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
which is an implicit solution involving an [[elliptic integral]]. This &amp;quot;solution&amp;quot; generally does not have many uses because most of the nature of the solution is hidden in the [[nonelementary integral]] (nonelementary unless &amp;lt;math&amp;gt;C_0 = 2&amp;lt;/math&amp;gt;).&lt;br /&gt;
&lt;br /&gt;
which is an implicit solution involving an elliptic integral. This &amp;quot;solution&amp;quot; generally does not have many uses because most of the nature of the solution is hidden in the nonelementary integral (nonelementary unless &amp;lt;math&amp;gt;C_0 = 2&amp;lt;/math&amp;gt;).&lt;br /&gt;
&lt;br /&gt;
这是一个含'''椭圆积分 Elliptic Integral'''的隐式解。这个“解”通常没什么用，因为这个解的大部分性质都隐藏在非初等函数积分中（除非&amp;lt;math&amp;gt;C_0 = 2&amp;lt;/math&amp;gt;，否则是非初等的）。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Another way to approach the problem is to linearize any nonlinearities (the sine function term in this case) at the various points of interest through [[Taylor expansion]]s. For example, the linearization at &amp;lt;math&amp;gt;\theta = 0&amp;lt;/math&amp;gt;, called the small angle approximation, is&lt;br /&gt;
&lt;br /&gt;
Another way to approach the problem is to linearize any nonlinearities (the sine function term in this case) at the various points of interest through Taylor expansions. For example, the linearization at &amp;lt;math&amp;gt;\theta = 0&amp;lt;/math&amp;gt;, called the small angle approximation, is&lt;br /&gt;
&lt;br /&gt;
另一种解决这个问题的方法是利用泰勒展开将任意非线性项（此时为正弦函数项)在某些感兴趣的点线性化。例如，在&amp;lt;math&amp;gt;\theta = 0&amp;lt;/math&amp;gt; 的点附近线性化（称为小角度近似）为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{d^2 \theta}{d t^2} + \theta = 0&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
since &amp;lt;math&amp;gt;\sin(\theta) \approx \theta&amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt;\theta \approx 0&amp;lt;/math&amp;gt;. This is a [[simple harmonic oscillator]] corresponding to oscillations of the pendulum near the bottom of its path. Another linearization would be at &amp;lt;math&amp;gt;\theta = \pi&amp;lt;/math&amp;gt;, corresponding to the pendulum being straight up:&lt;br /&gt;
&lt;br /&gt;
since &amp;lt;math&amp;gt;\sin(\theta) \approx \theta&amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt;\theta \approx 0&amp;lt;/math&amp;gt;. This is a simple harmonic oscillator corresponding to oscillations of the pendulum near the bottom of its path. Another linearization would be at &amp;lt;math&amp;gt;\theta = \pi&amp;lt;/math&amp;gt;, corresponding to the pendulum being straight up:&lt;br /&gt;
&lt;br /&gt;
因为 &amp;lt;math&amp;gt;\theta \approx 0&amp;lt;/math&amp;gt; 时，有 &amp;lt;math&amp;gt;\sin(\theta) \approx \theta&amp;lt;/math&amp;gt;。这是一个'''简谐振子 Simple Harmonic Oscillator''' ，对应于摆在其路径底部附近的摆动。另一种线性化方法是在 &amp;lt;math&amp;gt;\theta = \pi&amp;lt;/math&amp;gt;附近线性化，对应于运动到最高点的摆:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{d^2 \theta}{d t^2} + \pi - \theta = 0&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
since &amp;lt;math&amp;gt;\sin(\theta) \approx \pi - \theta&amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt;\theta \approx \pi&amp;lt;/math&amp;gt;. The solution to this problem involves [[hyperbolic sinusoid]]s, and note that unlike the small angle approximation, this approximation is unstable, meaning that &amp;lt;math&amp;gt;|\theta|&amp;lt;/math&amp;gt; will usually grow without limit, though bounded solutions are possible. This corresponds to the difficulty of balancing a pendulum upright, it is literally an unstable state.&lt;br /&gt;
&lt;br /&gt;
since &amp;lt;math&amp;gt;\sin(\theta) \approx \pi - \theta&amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt;\theta \approx \pi&amp;lt;/math&amp;gt;. The solution to this problem involves hyperbolic sinusoids, and note that unlike the small angle approximation, this approximation is unstable, meaning that &amp;lt;math&amp;gt;|\theta|&amp;lt;/math&amp;gt; will usually grow without limit, though bounded solutions are possible. This corresponds to the difficulty of balancing a pendulum upright, it is literally an unstable state.&lt;br /&gt;
&lt;br /&gt;
因为 &amp;lt;math&amp;gt;\theta \approx \pi&amp;lt;/math&amp;gt; 时，有 &amp;lt;math&amp;gt;\sin(\theta) \approx \pi - \theta&amp;lt;/math&amp;gt;。这个问题的解含双曲正弦曲线；注意到不同于小角度近似，它是不稳定的，这意味着 &amp;lt;math&amp;gt;|\theta|&amp;lt;/math&amp;gt; 通常会无限增长（但解也有可能是有界的）。这就解释了摆在最高点达到平衡的困难，此时实际上是一种不稳定的状态。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
One more interesting linearization is possible around &amp;lt;math&amp;gt;\theta = \pi/2&amp;lt;/math&amp;gt;, around which &amp;lt;math&amp;gt;\sin(\theta) \approx 1&amp;lt;/math&amp;gt;:&lt;br /&gt;
&lt;br /&gt;
One more interesting linearization is possible around &amp;lt;math&amp;gt;\theta = \pi/2&amp;lt;/math&amp;gt;, around which &amp;lt;math&amp;gt;\sin(\theta) \approx 1&amp;lt;/math&amp;gt;:&lt;br /&gt;
&lt;br /&gt;
一个更有趣的线性化可能是在 &amp;lt;math&amp;gt;\theta = \pi/2&amp;lt;/math&amp;gt;附近，此时 &amp;lt;math&amp;gt;\sin(\theta) \approx 1&amp;lt;/math&amp;gt;:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{d^2 \theta}{d t^2} + 1 = 0.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This corresponds to a free fall problem. A very useful qualitative picture of the pendulum's dynamics may be obtained by piecing together such linearizations, as seen in the figure at right. Other techniques may be used to find (exact) [[phase portrait]]s and approximate periods.&lt;br /&gt;
&lt;br /&gt;
This corresponds to a free fall problem. A very useful qualitative picture of the pendulum's dynamics may be obtained by piecing together such linearizations, as seen in the figure at right. Other techniques may be used to find (exact) phase portraits and approximate periods.&lt;br /&gt;
&lt;br /&gt;
这相当于一个自由落体问题。把这样线性化的结果合在一起看，就能得到有关摆的运动的非常有用的图像，如右图所示。利用其他方法寻找（精确的）'''相图  Phase Portrait'''和估计周期。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Types of nonlinear dynamic behaviors 非线性动力学行为的类型==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Amplitude death]] – any oscillations present in the system cease due to some kind of interaction with other system or feedback by the same system&lt;br /&gt;
&lt;br /&gt;
*'''振幅死亡 Amplitude Death'''——系统内的某振荡因系统的自回馈或与其他系统的某种相互作用而停止的现象&lt;br /&gt;
&lt;br /&gt;
*[[Chaos theory|Chaos]] – values of a system cannot be predicted indefinitely far into the future, and fluctuations are [[aperiodic]]&lt;br /&gt;
&lt;br /&gt;
*'''混沌 Chaos'''——系统内的值无法无限期地预测到遥远的未来；波动是非周期性的&lt;br /&gt;
&lt;br /&gt;
*[[Multistability]] – the presence of two or more stable states&lt;br /&gt;
&lt;br /&gt;
*'''多稳态 Multistability'''——两或多个稳态的存在&lt;br /&gt;
&lt;br /&gt;
*[[Soliton]]s – self-reinforcing solitary waves&lt;br /&gt;
&lt;br /&gt;
*'''孤波 Soliton'''s——自增强的孤立波&lt;br /&gt;
&lt;br /&gt;
*[[Limit cycle|Limit cycles]] – asymptotic periodic orbits to which destabilized fixed points are attracted. &lt;br /&gt;
&lt;br /&gt;
*'''极限环 Limit Cycles'''——吸引不稳定不动点的渐近周期轨道&lt;br /&gt;
&lt;br /&gt;
*[[Self-oscillation|Self-oscillations]] - feedback oscillations taking place in open dissipative physical systems.&lt;br /&gt;
&lt;br /&gt;
*'''自激振荡 Self-oscillations'''——开放耗散物理系统中的反馈振荡&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Examples of nonlinear equations 非线性方程的例子==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Div col|colwidth=25em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Algebraic Riccati equation]] 代数黎卡提方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Ball and beam]] system 球杆系统&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Bellman equation]] for optimal policy 最佳策略的贝尔曼方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Boltzmann equation]] 玻尔兹曼方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Colebrook equation]] 科尔布鲁克方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[General relativity]] 广义相对论&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Ginzburg–Landau theory]] 金兹堡-朗道方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Ishimori equation]] 石森方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Kadomtsev–Petviashvili equation]] 卡东穆塞夫-彼得韦亚斯维利方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Korteweg–de Vries equation]] kdV方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Landau–Lifshitz–Gilbert equation]] 朗道-利夫希兹-吉尔伯特方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Liénard equation]] 林纳德方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Navier–Stokes equations]] of [[fluid dynamics]] 流体力学的纳维－斯托克斯方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Nonlinear optics]] 非线性光学&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Nonlinear Schrödinger equation]] 非线性薛定谔方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Power-flow study]] 功率流研究&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Richards equation]] for unsaturated water flow 未饱和层水流的理查氏方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Self-balancing unicycle]] 自平衡独轮车&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Sine-Gordon equation]] 正弦-戈尔登方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Van der Pol oscillator]] 范德波尔振荡器&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Vlasov equation]] 弗拉索夫方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Div col end}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==See also 参见==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Aleksandr Mikhailovich Lyapunov]] 亚历山大·李亚普诺夫&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Dynamical system]] 动态系统&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Feedback]] 反馈&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Initial condition]] 初始条件&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Interaction]] 相互作用&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Linear system]] 线性系统&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Mode coupling]] 模式耦合&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Vector soliton]] 矢量孤子&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Volterra series]] 沃尔泰拉级数&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==References 参考资料==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Reflist|35em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Further reading 进一步阅读==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Refbegin|35em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*{{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| author= [[Diederich Hinrichsen]] and Anthony J. Pritchard&lt;br /&gt;
&lt;br /&gt;
| author= Diederich Hinrichsen and Anthony J. Pritchard&lt;br /&gt;
&lt;br /&gt;
作者 Diederich Hinrichsen 和 Anthony j. Pritchard&lt;br /&gt;
&lt;br /&gt;
| year= 2005&lt;br /&gt;
&lt;br /&gt;
| year= 2005&lt;br /&gt;
&lt;br /&gt;
2005年&lt;br /&gt;
&lt;br /&gt;
| title= Mathematical Systems Theory I - Modelling, State Space Analysis, Stability and Robustness&lt;br /&gt;
&lt;br /&gt;
| title= Mathematical Systems Theory I - Modelling, State Space Analysis, Stability and Robustness&lt;br /&gt;
&lt;br /&gt;
数学系统理论 i-建模，状态空间分析，稳定性和鲁棒性&lt;br /&gt;
&lt;br /&gt;
| publisher= Springer Verlag&lt;br /&gt;
&lt;br /&gt;
| publisher= Springer Verlag&lt;br /&gt;
&lt;br /&gt;
出版商 Springer Verlag&lt;br /&gt;
&lt;br /&gt;
| isbn=9783540441250&lt;br /&gt;
&lt;br /&gt;
| isbn=9783540441250&lt;br /&gt;
&lt;br /&gt;
9783540441250&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last= Jordan&lt;br /&gt;
&lt;br /&gt;
| last= Jordan&lt;br /&gt;
&lt;br /&gt;
最后一个乔丹&lt;br /&gt;
&lt;br /&gt;
| first= D. W.&lt;br /&gt;
&lt;br /&gt;
| first= D. W.&lt;br /&gt;
&lt;br /&gt;
首先是 D.w。&lt;br /&gt;
&lt;br /&gt;
| last2= Smith&lt;br /&gt;
&lt;br /&gt;
| last2= Smith&lt;br /&gt;
&lt;br /&gt;
最后2个史密斯&lt;br /&gt;
&lt;br /&gt;
| first2= P.&lt;br /&gt;
&lt;br /&gt;
| first2= P.&lt;br /&gt;
&lt;br /&gt;
| first2 p.&lt;br /&gt;
&lt;br /&gt;
| year= 2007&lt;br /&gt;
&lt;br /&gt;
| year= 2007&lt;br /&gt;
&lt;br /&gt;
2007年&lt;br /&gt;
&lt;br /&gt;
| edition= fourth&lt;br /&gt;
&lt;br /&gt;
| edition= fourth&lt;br /&gt;
&lt;br /&gt;
第四版&lt;br /&gt;
&lt;br /&gt;
| title= Nonlinear Ordinary Differential Equations&lt;br /&gt;
&lt;br /&gt;
| title= Nonlinear Ordinary Differential Equations&lt;br /&gt;
&lt;br /&gt;
非线性常微分方程&lt;br /&gt;
&lt;br /&gt;
| publisher= Oxford University Press&lt;br /&gt;
&lt;br /&gt;
| publisher= Oxford University Press&lt;br /&gt;
&lt;br /&gt;
牛津大学出版社&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-19-920824-1&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-19-920824-1&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-19-920824-1]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last= Khalil&lt;br /&gt;
&lt;br /&gt;
| last= Khalil&lt;br /&gt;
&lt;br /&gt;
最后的哈利勒&lt;br /&gt;
&lt;br /&gt;
| first= Hassan K.&lt;br /&gt;
&lt;br /&gt;
| first= Hassan K.&lt;br /&gt;
&lt;br /&gt;
首先是哈桑 · k。&lt;br /&gt;
&lt;br /&gt;
| year= 2001&lt;br /&gt;
&lt;br /&gt;
| year= 2001&lt;br /&gt;
&lt;br /&gt;
2001年&lt;br /&gt;
&lt;br /&gt;
| title= Nonlinear Systems&lt;br /&gt;
&lt;br /&gt;
| title= Nonlinear Systems&lt;br /&gt;
&lt;br /&gt;
非线性系统&lt;br /&gt;
&lt;br /&gt;
| publisher= Prentice Hall&lt;br /&gt;
&lt;br /&gt;
| publisher= Prentice Hall&lt;br /&gt;
&lt;br /&gt;
出版商 Prentice Hall&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-13-067389-3&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-13-067389-3&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-13-067389-3]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last= Kreyszig&lt;br /&gt;
&lt;br /&gt;
| last= Kreyszig&lt;br /&gt;
&lt;br /&gt;
| last= Kreyszig&lt;br /&gt;
&lt;br /&gt;
| first= Erwin&lt;br /&gt;
&lt;br /&gt;
| first= Erwin&lt;br /&gt;
&lt;br /&gt;
首先是欧文&lt;br /&gt;
&lt;br /&gt;
| authorlink= Erwin Kreyszig&lt;br /&gt;
&lt;br /&gt;
| authorlink= Erwin Kreyszig&lt;br /&gt;
&lt;br /&gt;
作者 / 链接 Erwin Kreyszig&lt;br /&gt;
&lt;br /&gt;
| year= 1998&lt;br /&gt;
&lt;br /&gt;
| year= 1998&lt;br /&gt;
&lt;br /&gt;
1998年&lt;br /&gt;
&lt;br /&gt;
| title= Advanced Engineering Mathematics&lt;br /&gt;
&lt;br /&gt;
| title= Advanced Engineering Mathematics&lt;br /&gt;
&lt;br /&gt;
高等工程数学&lt;br /&gt;
&lt;br /&gt;
| url= https://archive.org/details/advancedengineer0008krey&lt;br /&gt;
&lt;br /&gt;
| url= https://archive.org/details/advancedengineer0008krey&lt;br /&gt;
&lt;br /&gt;
Https://archive.org/details/advancedengineer0008krey&lt;br /&gt;
&lt;br /&gt;
| url-access= registration&lt;br /&gt;
&lt;br /&gt;
| url-access= registration&lt;br /&gt;
&lt;br /&gt;
访问注册&lt;br /&gt;
&lt;br /&gt;
| publisher= Wiley&lt;br /&gt;
&lt;br /&gt;
| publisher= Wiley&lt;br /&gt;
&lt;br /&gt;
出版商 Wiley&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-471-15496-9&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-471-15496-9&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-471-15496-9]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last= Sontag&lt;br /&gt;
&lt;br /&gt;
| last= Sontag&lt;br /&gt;
&lt;br /&gt;
最后一个桑塔格&lt;br /&gt;
&lt;br /&gt;
| first= Eduardo&lt;br /&gt;
&lt;br /&gt;
| first= Eduardo&lt;br /&gt;
&lt;br /&gt;
首先是爱德华多&lt;br /&gt;
&lt;br /&gt;
| authorlink= Eduardo D. Sontag&lt;br /&gt;
&lt;br /&gt;
| authorlink= Eduardo D. Sontag&lt;br /&gt;
&lt;br /&gt;
作者: Eduardo d. Sontag&lt;br /&gt;
&lt;br /&gt;
| year= 1998&lt;br /&gt;
&lt;br /&gt;
| year= 1998&lt;br /&gt;
&lt;br /&gt;
1998年&lt;br /&gt;
&lt;br /&gt;
| title= Mathematical Control Theory: Deterministic Finite Dimensional Systems. Second Edition&lt;br /&gt;
&lt;br /&gt;
| title= Mathematical Control Theory: Deterministic Finite Dimensional Systems. Second Edition&lt;br /&gt;
&lt;br /&gt;
数学控制理论: 确定性有限维系统。第二版&lt;br /&gt;
&lt;br /&gt;
| publisher= Springer&lt;br /&gt;
&lt;br /&gt;
| publisher= Springer&lt;br /&gt;
&lt;br /&gt;
出版商斯普林格&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-387-98489-6&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-387-98489-6&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-387-98489-6]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
{{Refend}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==External links 外部链接==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[http://www.dodccrp.org/ Command and Control Research Program (CCRP)]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[http://necsi.edu/guide/concepts/linearnonlinear.html New England Complex Systems Institute: Concepts in Complex Systems]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[http://ocw.mit.edu/courses/mathematics/18-353j-nonlinear-dynamics-i-chaos-fall-2012/ Nonlinear Dynamics I: Chaos] at [http://ocw.mit.edu/OcwWeb/index.htm MIT's OpenCourseWare]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[http://www.hedengren.net/research/models.htm Nonlinear Model Library]{{snd}} (in [[MATLAB]]) a Database of Physical Systems&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[http://cnls.lanl.gov/ The Center for Nonlinear Studies at Los Alamos National Laboratory]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Systems science}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Differential equations topics}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Authority control}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
[https://campus.swarma.org/ 集智学园]课程：[https://campus.swarma.org/course/697 非线性动力学与混沌]&lt;br /&gt;
&lt;br /&gt;
非线性动力学和混沌理论是系统发展的，从一阶微分方程及其分岔开始，然后是相平面分析，极限环和它们的分岔，最终得到Lorenz方程，混沌，迭代映射，周期倍增，重整化，分形和奇怪吸引。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
此系列课程由[[斯蒂文·斯特罗加茨 Steven H. Strogatz]]主持，内容包括机械振动，激光，生物节律，超导电路，昆虫爆发，化学振荡器，遗传控制系统，混沌水轮，甚至是使用混乱发送秘密信息的技术。在每种情况下，科学背景都在初级阶段进行解释，并与数学理论紧密结合。&lt;br /&gt;
&lt;br /&gt;
[[Category:Nonlinear systems| ]]&lt;br /&gt;
&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
[[Category:Dynamical systems]]&lt;br /&gt;
&lt;br /&gt;
Category:Dynamical systems&lt;br /&gt;
&lt;br /&gt;
类别: 动力系统&lt;br /&gt;
&lt;br /&gt;
[[Category:Concepts in physics]]&lt;br /&gt;
&lt;br /&gt;
Category:Concepts in physics&lt;br /&gt;
&lt;br /&gt;
分类: 物理概念&lt;br /&gt;
&lt;br /&gt;
&amp;lt;noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;small&amp;gt;This page was moved from [[wikipedia:en:Nonlinear system]]. Its edit history can be viewed at [[非线性系统/edithistory]]&amp;lt;/small&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:待整理页面]]&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E9%9D%9E%E7%BA%BF%E6%80%A7%E7%B3%BB%E7%BB%9F&amp;diff=10617</id>
		<title>非线性系统</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E9%9D%9E%E7%BA%BF%E6%80%A7%E7%B3%BB%E7%BB%9F&amp;diff=10617"/>
		<updated>2020-07-18T03:34:18Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。{{Redirect|Nonlinear dynamics|the journal|Nonlinear Dynamics (journal)}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Complex systems}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{About|&amp;quot;nonlinearity&amp;quot; in mathematics, physics and other sciences|video and film editing|Non-linear editing system|other uses|Nonlinearity (disambiguation)}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In [[mathematics]] and [[science]], a '''nonlinear system''' is a [[system]] in which the change of the output is not [[proportionality (mathematics)|proportional]] to the change of the input.&amp;lt;ref&amp;gt;{{Cite news|url=https://news.mit.edu/2010/explained-linear-0226|title=Explained: Linear and nonlinear systems|work=MIT News|access-date=2018-06-30}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite web|url=https://www.birmingham.ac.uk/research/activity/mathematics/applied-maths/nonlinear-systems.aspx|title=Nonlinear systems, Applied Mathematics - University of Birmingham|website=www.birmingham.ac.uk|language=en-gb|access-date=2018-06-30}}&amp;lt;/ref&amp;gt; Nonlinear problems are of interest to [[engineer]]s, [[biologist]]s,&amp;lt;ref&amp;gt;{{Citation|date=2007|pages=181–276|publisher=Springer Berlin Heidelberg|language=en|doi=10.1007/978-3-540-34153-6_7|isbn=9783540341529|title = The Nonlinear Universe|series = The Frontiers Collection|chapter = Nonlinear Biology}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last=Korenberg|first=Michael J.|last2=Hunter|first2=Ian W.|date=March 1996|title=The identification of nonlinear biological systems: Volterra kernel approaches|journal=Annals of Biomedical Engineering|language=en|volume=24|issue=2|pages=250–268|doi=10.1007/bf02667354|issn=0090-6964}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last=Mosconi|first=Francesco|last2=Julou|first2=Thomas|last3=Desprat|first3=Nicolas|last4=Sinha|first4=Deepak Kumar|last5=Allemand|first5=Jean-François|last6=Vincent Croquette|last7=Bensimon|first7=David|date=2008|title=Some nonlinear challenges in biology|url=http://stacks.iop.org/0951-7715/21/i=8/a=T03|journal=Nonlinearity|language=en|volume=21|issue=8|pages=T131|doi=10.1088/0951-7715/21/8/T03|issn=0951-7715|bibcode=2008Nonli..21..131M}}&amp;lt;/ref&amp;gt; [[physicist]]s,&amp;lt;ref&amp;gt;{{cite journal|last1=Gintautas|first1=V.|title=Resonant forcing of nonlinear systems of differential equations|journal=Chaos|date=2008|volume=18|issue=3|pages=033118|doi=10.1063/1.2964200|pmid=19045456|arxiv=0803.2252|bibcode=2008Chaos..18c3118G}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Stephenson|first1=C.|last2=et.|first2=al.|title=Topological properties of a self-assembled electrical network via ab initio calculation|journal=Sci. Rep.|volume=7|pages=41621|date=2017|doi=10.1038/srep41621|pmid=28155863|pmc=5290745|bibcode=2017NatSR...741621S}}&amp;lt;/ref&amp;gt; [[mathematician]]s, and many other [[scientist]]s because most systems are inherently nonlinear in nature.&amp;lt;ref&amp;gt;{{cite book|last1=de Canete|first1=Javier, Cipriano Galindo, and Inmaculada Garcia-Moral|title=System Engineering and Automation: An Interactive Educational Approach|date=2011|publisher=Springer|location=Berlin|isbn=978-3642202292|page=46|url=https://books.google.com/?id=h8rCQYXGGY8C&amp;amp;pg=PA46&amp;amp;lpg=PA46&amp;amp;dq=most+systems+are+inherently+nonlinear+in+nature#v=onepage&amp;amp;q=most%20systems%20are%20inherently%20nonlinear%20in%20nature&amp;amp;f=false|accessdate=20 January 2018}}&amp;lt;/ref&amp;gt; Nonlinear [[dynamical system]]s, describing changes in variables over time, may appear chaotic, unpredictable, or counterintuitive, contrasting with much simpler [[linear system]]s.&lt;br /&gt;
&lt;br /&gt;
In mathematics and science, a nonlinear system is a system in which the change of the output is not proportional to the change of the input. Nonlinear problems are of interest to engineers, biologists, physicists, mathematicians, and many other scientists because most systems are inherently nonlinear in nature. Nonlinear dynamical systems, describing changes in variables over time, may appear chaotic, unpredictable, or counterintuitive, contrasting with much simpler linear systems.&lt;br /&gt;
&lt;br /&gt;
在数学及科学中，'''非线性系统 Nonlinear System'''是一种输出的变化与输入的变化不成比例的系统。大多数系统在本质上是非线性的，因而非线性问题引起了工程师、生物学家、物理学家、数学家和许多其他科学家的兴趣。描述变量随时间变化的非线性动力系统与较之简单得多的线性系统相比，可能显得混沌、不可预测或违反直觉。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Typically, the behavior of a nonlinear system is described in mathematics by a '''nonlinear system of equations''', which is a set of simultaneous [[equation]]s in which the unknowns (or the unknown functions in the case of [[differential equation]]s) appear as variables of a [[polynomial]] of degree higher than one or in the argument of a [[function (mathematics)|function]] which is not a polynomial of degree one.&lt;br /&gt;
&lt;br /&gt;
Typically, the behavior of a nonlinear system is described in mathematics by a nonlinear system of equations, which is a set of simultaneous equations in which the unknowns (or the unknown functions in the case of differential equations) appear as variables of a polynomial of degree higher than one or in the argument of a function which is not a polynomial of degree one.&lt;br /&gt;
&lt;br /&gt;
通常，非线性系统的行为在数学上是由一组非线性联立方程来描述的，其中未知数（或微分方程中的未知函数）作为一个高于一次的多项式的变量出现，或者作为一个不是一次多项式的函数的论元出现。__[[用户:Dorr|Dorr]]（[[用户讨论:Dorr|讨论]]）后半句不知如何翻译&lt;br /&gt;
&lt;br /&gt;
&amp;lt;font color='blue'&amp;gt;通常，非线性系统的行为在数学上被描述为一组非线性的联立方程组，其中未知数（或微分方程中的未知函数）作为一个高于一次的多项式变量出现，或者作为一个非一次多项式函数的参数出现。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In other words, in a nonlinear system of equations, the equation(s) to be solved cannot be written as a [[linear combination]] of the unknown [[variable (mathematics)|variables]] or [[function (mathematics)|functions]] that appear in them. Systems can be defined as nonlinear, regardless of whether known linear functions appear in the equations. In particular, a differential equation is ''linear'' if it is linear in terms of the unknown function and its derivatives, even if nonlinear in terms of the other variables appearing in it.&lt;br /&gt;
&lt;br /&gt;
In other words, in a nonlinear system of equations, the equation(s) to be solved cannot be written as a linear combination of the unknown variables or functions that appear in them. Systems can be defined as nonlinear, regardless of whether known linear functions appear in the equations. In particular, a differential equation is linear if it is linear in terms of the unknown function and its derivatives, even if nonlinear in terms of the other variables appearing in it.&lt;br /&gt;
&lt;br /&gt;
换句话说，在非线性方程系统中，&amp;lt;font color='red'&amp;gt;要求解&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;待解&amp;lt;/font&amp;gt; 的方程不能被写成未知变量或函数的线性组合。无论方程中是否有已知的线性函数，系统都可以被定义为非线性。特别是当一个微分方程的未知函数及其导数是线性的，即使其他变量是非线性的，也称该方程是线性的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
As nonlinear dynamical equations are difficult to solve, nonlinear systems are commonly approximated by linear equations ([[linearization]]). This works well up to some accuracy and some range for the input values, but some interesting phenomena such as [[soliton]]s, [[chaos theory|chaos]],&amp;lt;ref&amp;gt;[http://ocw.mit.edu/OcwWeb/Earth--Atmospheric--and-Planetary-Sciences/12-006JFall-2006/CourseHome/index.htm Nonlinear Dynamics I: Chaos] {{webarchive|url=https://web.archive.org/web/20080212045134/http://ocw.mit.edu/OcwWeb/Earth--Atmospheric--and-Planetary-Sciences/12-006JFall-2006/CourseHome/index.htm |date=2008-02-12}} at [http://ocw.mit.edu/OcwWeb/index.htm MIT's OpenCourseWare]&amp;lt;/ref&amp;gt; and [[mathematical singularity|singularities]] are hidden by linearization. It follows that some aspects of the dynamic behavior of a nonlinear system can appear to be counterintuitive, unpredictable or even chaotic. Although such chaotic behavior may resemble [[randomness|random]] behavior, it is in fact not random. For example, some aspects of the weather are seen to be chaotic, where simple changes in one part of the system produce complex effects throughout. This nonlinearity is one of the reasons why accurate long-term forecasts are impossible with current technology.&lt;br /&gt;
&lt;br /&gt;
As nonlinear dynamical equations are difficult to solve, nonlinear systems are commonly approximated by linear equations (linearization). This works well up to some accuracy and some range for the input values, but some interesting phenomena such as solitons, chaos, and singularities are hidden by linearization. It follows that some aspects of the dynamic behavior of a nonlinear system can appear to be counterintuitive, unpredictable or even chaotic. Although such chaotic behavior may resemble random behavior, it is in fact not random. For example, some aspects of the weather are seen to be chaotic, where simple changes in one part of the system produce complex effects throughout. This nonlinearity is one of the reasons why accurate long-term forecasts are impossible with current technology.&lt;br /&gt;
&lt;br /&gt;
由于非线性动力学方程难以求解，通常用线性&amp;lt;font color='red'&amp;gt;&amp;lt;s&amp;gt;化&amp;lt;/s&amp;gt;(这种解法是线性化(linearization)，此处还是按linear来翻吧)&amp;lt;/font&amp;gt;方程来近似非线性系统（'''线性化 Linearization'''）。&amp;lt;font color='red'&amp;gt;这种方法在一定的精度和范围对输入值效果很好&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;这种方法对于一定范围的输入和某些精度要求下的效果不错&amp;lt;/font&amp;gt;，但一些有趣的现象如'''孤子 Soliton'''、'''混沌 Chaos'''和'''奇异性 Singularity'''在线性化后被隐藏。因此，非线性系统的动态行为在某些方面可能看起来违反直觉、不可预测、甚至混沌。尽管这种混沌行为可能感觉很像随机行为，但它实际上并不是随机的。例如，天气的某些方面被认为是混沌的，其系统某部分的微小扰动就会产生复杂的&amp;lt;font color='blue'&amp;gt;整体(throughout)&amp;lt;/font&amp;gt;影响。这种非线性是目前技术无法进行精确长期预测的原因之一。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Some authors use the term '''nonlinear science''' for the study of nonlinear systems. This term is disputed by others:&lt;br /&gt;
&lt;br /&gt;
Some authors use the term nonlinear science for the study of nonlinear systems. This term is disputed by others:&lt;br /&gt;
&lt;br /&gt;
有些作者用非线性科学这一术语来研究非线性系统。这一术语引起了其他人的争议:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{quote|Using a term like nonlinear science is like referring to the bulk of zoology as the study of [[negation|non]]-elephant animals.|[[Stanislaw Ulam]]&amp;lt;ref&amp;gt;{{cite journal|last1=Campbell|first1=David K.|title=Nonlinear physics: Fresh breather|journal=Nature|date=25 November 2004|volume=432|issue=7016|pages=455–456|doi=10.1038/432455a|pmid=15565139|url=https://zenodo.org/record/1134179|language=en|issn=0028-0836|bibcode=2004Natur.432..455C}}&amp;lt;/ref&amp;gt;}}&lt;br /&gt;
&lt;br /&gt;
“使用‘非线性科学’这样的术语，就如同把动物学里大部分对象称作‘非大象动物’研究一样可笑。”&lt;br /&gt;
&lt;br /&gt;
——'''斯塔尼斯拉夫·乌拉姆 Stanislaw Ulam'''&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Definition 定义==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In [[mathematics]], a [[linear map]] (or ''linear function'') &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; is one which satisfies both of the following properties:&lt;br /&gt;
&lt;br /&gt;
In mathematics, a linear map (or linear function) &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; is one which satisfies both of the following properties:&lt;br /&gt;
&lt;br /&gt;
在数学中，线性映射（或线性函数）&amp;lt;math&amp;gt;f (x)&amp;lt;/math&amp;gt;满足以下两个性质:&lt;br /&gt;
&lt;br /&gt;
*Additivity or [[superposition Principle]]: &amp;lt;math&amp;gt;\textstyle f(x + y) = f(x) + f(y);&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
*Homogeneity: &amp;lt;math&amp;gt;\textstyle f(\alpha x) = \alpha f(x).&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*'''可加性 Additivity'''（'''叠加性 Superposition principle'''）: &amp;lt;math&amp;gt;\textstyle f(x + y) = f(x) + f(y);&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
*'''齐次性 Homogeneity''': &amp;lt;math&amp;gt;\textstyle f(\alpha x) = \alpha f(x).&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Additivity implies homogeneity for any [[rational number|rational]] ''α'', and, for [[continuous function]]s, for any [[real number|real]] ''α''. For a [[complex number|complex]] ''α'', homogeneity does not follow from additivity. For example, an [[antilinear map]] is additive but not homogeneous. The conditions of additivity and homogeneity are often combined in the superposition principle&lt;br /&gt;
&lt;br /&gt;
Additivity implies homogeneity for any rational α, and, for continuous functions, for any real α. For a complex α, homogeneity does not follow from additivity. For example, an antilinear map is additive but not homogeneous. The conditions of additivity and homogeneity are often combined in the superposition principle:&lt;br /&gt;
&lt;br /&gt;
当α是有理数或实数，且&amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt;是连续函数时，由可加性可以推出齐次性。但当α是复数时，可加性不能导出齐次性。例如，反线性映射是可加的，但不是齐次的。可加性和齐次性条件经常组合，称为叠加原理：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;f(\alpha x + \beta y) = \alpha f(x) + \beta f(y)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
An equation written as&lt;br /&gt;
&lt;br /&gt;
对一个写成&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;f(x) = C&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
is called '''linear''' if &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; is a linear map (as defined above) and '''nonlinear''' otherwise. The equation is called ''homogeneous'' if &amp;lt;math&amp;gt;C = 0&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
is called linear if &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; is a linear map (as defined above) and nonlinear otherwise. The equation is called homogeneous if &amp;lt;math&amp;gt;C = 0&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
的方程，若 &amp;lt;math&amp;gt; f (x) &amp;lt;/math&amp;gt; 是线性映射（如上定义） ，则称其为'''线性的 Linear'''，否则称为'''非线性的 Nonlinear'''。若&amp;lt;math&amp;gt;C = 0&amp;lt;/math&amp;gt;，该方程称为是齐次的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The definition &amp;lt;math&amp;gt;f(x) = C&amp;lt;/math&amp;gt; is very general in that &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; can be any sensible mathematical object (number, vector, function, etc.), and the function &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; can literally be any [[map (mathematics)|mapping]], including integration or differentiation with associated constraints (such as [[boundary values]]). If &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; contains [[derivative|differentiation]] with respect to &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt;, the result will be a [[differential equation]].&lt;br /&gt;
&lt;br /&gt;
The definition &amp;lt;math&amp;gt;f(x) = C&amp;lt;/math&amp;gt; is very general in that &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; can be any sensible mathematical object (number, vector, function, etc.), and the function &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; can literally be any mapping, including integration or differentiation with associated constraints (such as boundary values). If &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; contains differentiation with respect to &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt;, the result will be a differential equation.&lt;br /&gt;
&lt;br /&gt;
定义 &amp;lt;math&amp;gt;f(x) = C&amp;lt;/math&amp;gt; 是非常具有一般性的，因为 &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; 可以是任意可感知的数学对象（数字、向量、函数等），函数 &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; 实际上可以是任意映射，包括有相关约束（如给定边界值）的积分或微分。若 &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; 包含对 &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; 的微分运算，则该方程为微分方程。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===相关概念辨析===&lt;br /&gt;
'''线性Linear'''、'''非线性Nonlinear'''、'''亚线性 Sublinear'''、'''超线性 Superlinear'''：描述量与量之间的一种变化关系，例如&amp;lt;math&amp;gt;y=a+b*x^n&amp;lt;/math&amp;gt;，其中&amp;lt;math&amp;gt;n&amp;gt;1&amp;lt;/math&amp;gt;。当&amp;lt;math&amp;gt;n=1&amp;lt;/math&amp;gt;时，表示为线性关系；&amp;lt;math&amp;gt;n\neq 1&amp;lt;/math&amp;gt;时，表示为非线性关系；当&amp;lt;math&amp;gt;0&amp;lt;n&amp;lt;1&amp;lt;/math&amp;gt;时，表示为亚线性关系；当&amp;lt;math&amp;gt;n&amp;gt;1&amp;lt;/math&amp;gt;时，表示为超线性关系。&lt;br /&gt;
&lt;br /&gt;
亚线性与超线性属于非线性变化关系范畴。当两个变量之间存在亚线性关系时，其典型特性是因变量的变化速率会随着自变量的增大而减小，即其一阶导数会随着自变量的增大而减小；两个变量之间存在超线性关系时，其典型特性是因变量的变化速率会随着自变量的增大而增大，即其一阶导数会随着自变量的增大而增大。&lt;br /&gt;
&lt;br /&gt;
在线性系统中，整体等于部分和，描述线性系统的方程满足叠加原理，作用的总和正好等于每一部分作用相加的代数和，这意味着每一部分作用都是独立的、互不相关的；而在普遍存在的非线性系统中，作用的总和不等于每一部分作用相加的代数和，因为系统内部要素之间存在着复杂的非线性相互作用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Nonlinear algebraic equations 非线性代数方程==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Algebraic equation|System of polynomial equations}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Nonlinear [[algebraic equation]]s, which are also called ''[[polynomial equation]]s'', are defined by equating [[polynomial]]s (of degree greater than one) to zero. For example,&lt;br /&gt;
&lt;br /&gt;
Nonlinear algebraic equations, which are also called polynomial equations, are defined by equating polynomials (of degree greater than one) to zero. For example,&lt;br /&gt;
&lt;br /&gt;
非线性'''代数方程 Algebraic Equation'''，又称'''多项式方程 Polynomial Equation'''，由某多项式（次数大于1）等于零定义。例如：&lt;br /&gt;
&lt;br /&gt;
 &lt;br /&gt;
&amp;lt;math&amp;gt;x^2 + x - 1 = 0\,.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
For a single polynomial equation, [[root-finding algorithm]]s can be used to find solutions to the equation (i.e., sets of values for the variables that satisfy the equation). However, systems of algebraic equations are more complicated; their study is one motivation for the field of [[algebraic geometry]], a difficult branch of modern mathematics. It is even difficult to decide whether a given algebraic system has complex solutions (see [[Hilbert's Nullstellensatz]]). Nevertheless, in the case of the systems with a finite number of complex solutions, these [[systems of polynomial equations]] are now well understood and efficient methods exist for solving them.&amp;lt;ref&amp;gt;{{cite journal |last1= Lazard |first1= D. |title= Thirty years of Polynomial System Solving, and now? |doi= 10.1016/j.jsc.2008.03.004 |journal= Journal of Symbolic Computation |volume= 44 |issue= 3 |pages= 222–231 |year= 2009 |pmid= |pmc=}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
For a single polynomial equation, root-finding algorithms can be used to find solutions to the equation (i.e., sets of values for the variables that satisfy the equation). However, systems of algebraic equations are more complicated; their study is one motivation for the field of algebraic geometry, a difficult branch of modern mathematics. It is even difficult to decide whether a given algebraic system has complex solutions (see Hilbert's Nullstellensatz). Nevertheless, in the case of the systems with a finite number of complex solutions, these systems of polynomial equations are now well understood and efficient methods exist for solving them.&lt;br /&gt;
&lt;br /&gt;
对于一个单一的多项式方程，'''求根算法 Root-finding Algorithms'''可用于其求解（即找到满足该方程的变量的值集）。而代数方程组则相对复杂，其研究是现代数学的较难分支——'''代数几何 Algebraic Geometry'''领域的动力之一。甚至很难判断一个给定的代数系统是否有复数解（见'''希尔伯特零点定律  Hilbert's Nullstellensatz'''）。不过，对于具有有限个复数解的系统的多项式方程组，我们现在已经有了充分的理解，并且找到了有效的求解方法。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Nonlinear recurrence relations 非线性递推关系==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A nonlinear [[recurrence relation]] defines successive terms of a [[sequence]] as a nonlinear function of preceding terms. Examples of nonlinear recurrence relations are the [[logistic map]] and the relations that define the various [[Hofstadter sequence]]s. Nonlinear discrete models that represent a wide class of nonlinear recurrence relationships include the NARMAX (Nonlinear Autoregressive Moving Average with eXogenous inputs) model and the related [[nonlinear system identification]] and analysis procedures.&amp;lt;ref name=&amp;quot;SAB1&amp;quot;&amp;gt;Billings S.A. &amp;quot;Nonlinear System Identification: NARMAX Methods in the Time, Frequency, and Spatio-Temporal Domains&amp;quot;. Wiley, 2013&amp;lt;/ref&amp;gt; These approaches can be used to study a wide class of complex nonlinear behaviors in the time, frequency, and spatio-temporal domains.&lt;br /&gt;
&lt;br /&gt;
A nonlinear recurrence relation defines successive terms of a sequence as a nonlinear function of preceding terms. Examples of nonlinear recurrence relations are the logistic map and the relations that define the various Hofstadter sequences. Nonlinear discrete models that represent a wide class of nonlinear recurrence relationships include the NARMAX (Nonlinear Autoregressive Moving Average with eXogenous inputs) model and the related nonlinear system identification and analysis procedures. These approaches can be used to study a wide class of complex nonlinear behaviors in the time, frequency, and spatio-temporal domains.&lt;br /&gt;
&lt;br /&gt;
非线性递归关系中，序列的连续项被定义为其前项的非线性函数。非线性递归关系的例子有 [[logistic 映射]]和定义各种'''霍夫斯塔特序列 Hofstadter Sequences''' 的关系。非线性离散模型代表了一类广泛的非线性递归关系，包括 NARMAX（外部输入非线性自回归移动平均）模型和相关的非线性系统辨识和分析程序。这些方法可用于研究时域、频域和时空域的广泛复杂非线性行为。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Nonlinear differential equations 非线性微分方程==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A [[simultaneous equations|system]] of [[differential equation]]s is said to be nonlinear if it is not a [[linear system]]. Problems involving nonlinear differential equations are extremely diverse, and methods of solution or analysis are problem dependent. Examples of nonlinear differential equations are the [[Navier–Stokes equations]] in fluid dynamics and the [[Lotka–Volterra equation]]s in biology.&lt;br /&gt;
&lt;br /&gt;
A system of differential equations is said to be nonlinear if it is not a linear system. Problems involving nonlinear differential equations are extremely diverse, and methods of solution or analysis are problem dependent. Examples of nonlinear differential equations are the Navier–Stokes equations in fluid dynamics and the Lotka–Volterra equations in biology.&lt;br /&gt;
&lt;br /&gt;
若一个微分方程组不是线性系统，则称其为非线性的。涉及非线性微分方程的问题非常多样，对不同问题的解决或分析方法也不相同。非线性微分方程的例子有流体力学中的 '''纳维-斯托克斯方程 Navier-Stokes Equations'''和生物学中的'''洛特卡－沃尔泰拉方程 Lotka-Volterra Equations'''。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
One of the greatest difficulties of nonlinear problems is that it is not generally possible to combine known solutions into new solutions. In linear problems, for example, a family of [[linearly independent]] solutions can be used to construct general solutions through the [[superposition principle]]. A good example of this is one-dimensional heat transport with [[Dirichlet boundary conditions]], the solution of which can be written as a time-dependent linear combination of sinusoids of differing frequencies; this makes solutions very flexible. It is often possible to find several very specific solutions to nonlinear equations, however the lack of a superposition principle prevents the construction of new solutions.&lt;br /&gt;
&lt;br /&gt;
One of the greatest difficulties of nonlinear problems is that it is not generally possible to combine known solutions into new solutions. In linear problems, for example, a family of linearly independent solutions can be used to construct general solutions through the superposition principle. A good example of this is one-dimensional heat transport with Dirichlet boundary conditions, the solution of which can be written as a time-dependent linear combination of sinusoids of differing frequencies; this makes solutions very flexible. It is often possible to find several very specific solutions to nonlinear equations, however the lack of a superposition principle prevents the construction of new solutions.&lt;br /&gt;
&lt;br /&gt;
非线性问题最大的困难之一是通常不可能将已知的解组合成新的解。例如，在线性问题中，可以根据叠加原理以一族线性独立的解构造通解。一个很好的例子是带有'''狄利克雷边界条件 Dirichlet Boundary Conditions'''的一维热传导问题，其解（随时间变化）可以写成不同频率的正弦波的线性组合，这使得解非常灵活。而对非线性方程，通常可以找到几个非常特殊的解，但是此时叠加原理不适用，故无法构造新的解。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Ordinary differential equations 常微分方程===&lt;br /&gt;
&lt;br /&gt;
First order [[ordinary differential equation]]s are often exactly solvable by [[separation of variables]], especially for autonomous equations. For example, the nonlinear equation&lt;br /&gt;
&lt;br /&gt;
First order ordinary differential equations are often exactly solvable by separation of variables, especially for autonomous equations. For example, the nonlinear equation&lt;br /&gt;
&lt;br /&gt;
一阶常微分方程，尤其是自治方程，通常可以用'''分离变量法  Separation of Variables'''来精确求解。例如，非线性方程&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{d u}{d x} = -u^2&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
has &amp;lt;math&amp;gt;u=\frac{1}{x+C}&amp;lt;/math&amp;gt; as a general solution (and also ''u'' = 0 as a particular solution, corresponding to the limit of the general solution when ''C'' tends to infinity). The equation is nonlinear because it may be written as&lt;br /&gt;
&lt;br /&gt;
has &amp;lt;math&amp;gt;u=\frac{1}{x+C}&amp;lt;/math&amp;gt; as a general solution (and also u = 0 as a particular solution, corresponding to the limit of the general solution when C tends to infinity). The equation is nonlinear because it may be written as&lt;br /&gt;
&lt;br /&gt;
将 &amp;lt;math&amp;gt;u=\frac{1}{x+C}&amp;lt;/math&amp;gt; 作为一般解（也有特解 ''u'' = 0，对应于 ''C'' 趋于无穷时的一般解的极限)。该方程是非线性的，因为它可以改写成&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{du}{d x} + u^2=0&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
and the left-hand side of the equation is not a linear function of ''u'' and its derivatives. Note that if the ''u''&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt; term were replaced with ''u'', the problem would be linear (the [[exponential decay]] problem).&lt;br /&gt;
&lt;br /&gt;
and the left-hand side of the equation is not a linear function of u and its derivatives. Note that if the u&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt; term were replaced with u, the problem would be linear (the exponential decay problem).&lt;br /&gt;
&lt;br /&gt;
方程的左边不是 ''u'' 及其导数的线性函数。注意，若将 ''u''&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt; 项替换为''u''，该问题将变为线性的（'''指数衰减 Exponential Decay'''问题）。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Second and higher order ordinary differential equations (more generally, systems of nonlinear equations) rarely yield [[closed-form expression|closed-form]] solutions, though implicit solutions and solutions involving [[nonelementary integral]]s are encountered.&lt;br /&gt;
&lt;br /&gt;
Second and higher order ordinary differential equations (more generally, systems of nonlinear equations) rarely yield closed-form solutions, though implicit solutions and solutions involving nonelementary integrals are encountered.&lt;br /&gt;
&lt;br /&gt;
二阶和高阶常微分方程（更一般地说，非线性方程组）很少能产生封闭解，而隐式解和非初等函数积分形式的解较为常见。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Common methods for the qualitative analysis of nonlinear ordinary differential equations include:&lt;br /&gt;
&lt;br /&gt;
Common methods for the qualitative analysis of nonlinear ordinary differential equations include:&lt;br /&gt;
&lt;br /&gt;
非线性常微分方程定性分析的常用方法包括:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*Examination of any [[conserved quantities]], especially in [[Hamiltonian system]]s&lt;br /&gt;
&lt;br /&gt;
*检查是否有任意'''守恒量 Conserved Quantities'''（特别是在'''哈密顿系统 Hamiltonian System'''中）&lt;br /&gt;
&lt;br /&gt;
*Examination of dissipative quantities (see [[Lyapunov function]]) analogous to conserved quantities&lt;br /&gt;
&lt;br /&gt;
*检查是否有类似守恒量的耗散量（见'''李亚普诺夫函数 Lyapunov Function'''）&lt;br /&gt;
&lt;br /&gt;
*Linearization via [[Taylor expansion]]&lt;br /&gt;
&lt;br /&gt;
*基于'''泰勒展开 Taylor Expansion'''的线性化&lt;br /&gt;
&lt;br /&gt;
*Change of variables into something easier to study&lt;br /&gt;
&lt;br /&gt;
*将变量进行代换以便更好的进行研究&lt;br /&gt;
&lt;br /&gt;
*[[Bifurcation theory]]&lt;br /&gt;
&lt;br /&gt;
*'''分岔理论 Bifurcation Theory'''&lt;br /&gt;
&lt;br /&gt;
*[[Perturbation theory|Perturbation]] methods (can be applied to algebraic equations too)&lt;br /&gt;
&lt;br /&gt;
*'''摄动理论 Perturbation Theory'''（也可应用于代数方程）&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Partial differential equations 偏微分方程===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{main|Nonlinear partial differential equation}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{See also|List of nonlinear partial differential equations}}&lt;br /&gt;
&lt;br /&gt;
参见：非线性偏微分列表&lt;br /&gt;
&lt;br /&gt;
The most common basic approach to studying nonlinear [[partial differential equation]]s is to change the variables (or otherwise transform the problem) so that the resulting problem is simpler (possibly even linear). Sometimes, the equation may be transformed into one or more [[ordinary differential equation]]s, as seen in [[separation of variables]], which is always useful whether or not the resulting ordinary differential equation(s) is solvable.&lt;br /&gt;
&lt;br /&gt;
The most common basic approach to studying nonlinear partial differential equations is to change the variables (or otherwise transform the problem) so that the resulting problem is simpler (possibly even linear). Sometimes, the equation may be transformed into one or more ordinary differential equations, as seen in separation of variables, which is always useful whether or not the resulting ordinary differential equation(s) is solvable.&lt;br /&gt;
&lt;br /&gt;
研究非线性偏微分方程最常用的基本方法是变量代换（或转换问题），使变换后的问题更简单（甚至可能变为线性的）。有时可以将此类方程转化成一或多个常微分方程（如同分离变量法所示），此时不论得到的常微分方程是否可解，对研究问题总是有用的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Another common (though less mathematic) tactic, often seen in fluid and heat mechanics, is to use [[scale analysis (mathematics)|scale analysis]] to simplify a general, natural equation in a certain specific [[boundary value problem]]. For example, the (very) nonlinear [[Navier-Stokes equations]] can be simplified into one linear partial differential equation in the case of transient, laminar, one dimensional flow in a circular pipe; the scale analysis provides conditions under which the flow is laminar and one dimensional and also yields the simplified equation.&lt;br /&gt;
&lt;br /&gt;
Another common (though less mathematic) tactic, often seen in fluid and heat mechanics, is to use scale analysis to simplify a general, natural equation in a certain specific boundary value problem. For example, the (very) nonlinear Navier-Stokes equations can be simplified into one linear partial differential equation in the case of transient, laminar, one dimensional flow in a circular pipe; the scale analysis provides conditions under which the flow is laminar and one dimensional and also yields the simplified equation.&lt;br /&gt;
&lt;br /&gt;
另一个流体力学和热力学中常见的策略（虽然不是数学上的）是利用'''尺度分析 Scale Analysis'''来在某一特定边界条件下简化一般自然方程。例如，在描述圆管内一维层流的暂态时，非线性的纳维－斯托克斯方程可以简化为一个线性的偏微分方程; 尺度分析提供了层流和一维流动的条件，也产生了简化的方程。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Other methods include examining the [[method of characteristics|characteristics]] and using the methods outlined above for ordinary differential equations.&lt;br /&gt;
&lt;br /&gt;
Other methods include examining the characteristics and using the methods outlined above for ordinary differential equations.&lt;br /&gt;
&lt;br /&gt;
其他方法包括检查特征线法及前面所述研究常微分方程的方法。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Pendula 摆===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Pendulum (mathematics)}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:PendulumLayout.svg.png|thumb|图一：Illustration of a pendulum 摆图解|right|200px]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:PendulumLinearizations.png|thumb|图二：Linearizations of a pendulum 摆的线性化|right|200px]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A classic, extensively studied nonlinear problem is the dynamics of a [[pendulum (mathematics)|pendulum]] under the influence of [[gravity]]. Using [[Lagrangian mechanics]], it may be shown&amp;lt;ref&amp;gt;[http://www.damtp.cam.ac.uk/user/tong/dynamics.html David Tong: Lectures on Classical Dynamics]&amp;lt;/ref&amp;gt; that the motion of a pendulum can be described by the [[dimensionless]] nonlinear equation&lt;br /&gt;
&lt;br /&gt;
A classic, extensively studied nonlinear problem is the dynamics of a pendulum under the influence of gravity. Using Lagrangian mechanics, it may be shown that the motion of a pendulum can be described by the dimensionless nonlinear equation&lt;br /&gt;
&lt;br /&gt;
一个经典的被广泛研究的非线性问题是重力影响下的摆的动力学。利用'''拉格朗日力学 Lagrangian Mechanics'''，可以证明摆的运动可以用无量纲的非线性方程&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{d^2 \theta}{d t^2} + \sin(\theta) = 0&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
where gravity points &amp;quot;downwards&amp;quot; and &amp;lt;math&amp;gt;\theta&amp;lt;/math&amp;gt; is the angle the pendulum forms with its rest position, as shown in the figure at right. One approach to &amp;quot;solving&amp;quot; this equation is to use &amp;lt;math&amp;gt;d\theta/dt&amp;lt;/math&amp;gt; as an [[integrating factor]], which would eventually yield&lt;br /&gt;
&lt;br /&gt;
where gravity points &amp;quot;downwards&amp;quot; and &amp;lt;math&amp;gt;\theta&amp;lt;/math&amp;gt; is the angle the pendulum forms with its rest position, as shown in the figure at right. One approach to &amp;quot;solving&amp;quot; this equation is to use &amp;lt;math&amp;gt;d\theta/dt&amp;lt;/math&amp;gt; as an integrating factor, which would eventually yield&lt;br /&gt;
&lt;br /&gt;
描述，其中重力指向“下方”，&amp;lt;math&amp;gt;\theta&amp;lt;/math&amp;gt; 是摆与其静止位置形成的角度，如右图所示。“解”这个方程的方法之一是用 &amp;lt;math&amp;gt;d\theta/dt&amp;lt;/math&amp;gt; 作为'''积分因子 Integrating Factor'''，最终得&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\int{\frac{d \theta}{\sqrt{C_0 + 2 \cos(\theta)}}} = t + C_1&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
which is an implicit solution involving an [[elliptic integral]]. This &amp;quot;solution&amp;quot; generally does not have many uses because most of the nature of the solution is hidden in the [[nonelementary integral]] (nonelementary unless &amp;lt;math&amp;gt;C_0 = 2&amp;lt;/math&amp;gt;).&lt;br /&gt;
&lt;br /&gt;
which is an implicit solution involving an elliptic integral. This &amp;quot;solution&amp;quot; generally does not have many uses because most of the nature of the solution is hidden in the nonelementary integral (nonelementary unless &amp;lt;math&amp;gt;C_0 = 2&amp;lt;/math&amp;gt;).&lt;br /&gt;
&lt;br /&gt;
这是一个含'''椭圆积分 Elliptic Integral'''的隐式解。这个“解”通常没什么用，因为这个解的大部分性质都隐藏在非初等函数积分中（除非&amp;lt;math&amp;gt;C_0 = 2&amp;lt;/math&amp;gt;，否则是非初等的）。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Another way to approach the problem is to linearize any nonlinearities (the sine function term in this case) at the various points of interest through [[Taylor expansion]]s. For example, the linearization at &amp;lt;math&amp;gt;\theta = 0&amp;lt;/math&amp;gt;, called the small angle approximation, is&lt;br /&gt;
&lt;br /&gt;
Another way to approach the problem is to linearize any nonlinearities (the sine function term in this case) at the various points of interest through Taylor expansions. For example, the linearization at &amp;lt;math&amp;gt;\theta = 0&amp;lt;/math&amp;gt;, called the small angle approximation, is&lt;br /&gt;
&lt;br /&gt;
另一种解决这个问题的方法是利用泰勒展开将任意非线性项（此时为正弦函数项)在某些感兴趣的点线性化。例如，在&amp;lt;math&amp;gt;\theta = 0&amp;lt;/math&amp;gt; 的点附近线性化（称为小角度近似）为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{d^2 \theta}{d t^2} + \theta = 0&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
since &amp;lt;math&amp;gt;\sin(\theta) \approx \theta&amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt;\theta \approx 0&amp;lt;/math&amp;gt;. This is a [[simple harmonic oscillator]] corresponding to oscillations of the pendulum near the bottom of its path. Another linearization would be at &amp;lt;math&amp;gt;\theta = \pi&amp;lt;/math&amp;gt;, corresponding to the pendulum being straight up:&lt;br /&gt;
&lt;br /&gt;
since &amp;lt;math&amp;gt;\sin(\theta) \approx \theta&amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt;\theta \approx 0&amp;lt;/math&amp;gt;. This is a simple harmonic oscillator corresponding to oscillations of the pendulum near the bottom of its path. Another linearization would be at &amp;lt;math&amp;gt;\theta = \pi&amp;lt;/math&amp;gt;, corresponding to the pendulum being straight up:&lt;br /&gt;
&lt;br /&gt;
因为 &amp;lt;math&amp;gt;\theta \approx 0&amp;lt;/math&amp;gt; 时，有 &amp;lt;math&amp;gt;\sin(\theta) \approx \theta&amp;lt;/math&amp;gt;。这是一个'''简谐振子 Simple Harmonic Oscillator''' ，对应于摆在其路径底部附近的摆动。另一种线性化方法是在 &amp;lt;math&amp;gt;\theta = \pi&amp;lt;/math&amp;gt;附近线性化，对应于运动到最高点的摆:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{d^2 \theta}{d t^2} + \pi - \theta = 0&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
since &amp;lt;math&amp;gt;\sin(\theta) \approx \pi - \theta&amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt;\theta \approx \pi&amp;lt;/math&amp;gt;. The solution to this problem involves [[hyperbolic sinusoid]]s, and note that unlike the small angle approximation, this approximation is unstable, meaning that &amp;lt;math&amp;gt;|\theta|&amp;lt;/math&amp;gt; will usually grow without limit, though bounded solutions are possible. This corresponds to the difficulty of balancing a pendulum upright, it is literally an unstable state.&lt;br /&gt;
&lt;br /&gt;
since &amp;lt;math&amp;gt;\sin(\theta) \approx \pi - \theta&amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt;\theta \approx \pi&amp;lt;/math&amp;gt;. The solution to this problem involves hyperbolic sinusoids, and note that unlike the small angle approximation, this approximation is unstable, meaning that &amp;lt;math&amp;gt;|\theta|&amp;lt;/math&amp;gt; will usually grow without limit, though bounded solutions are possible. This corresponds to the difficulty of balancing a pendulum upright, it is literally an unstable state.&lt;br /&gt;
&lt;br /&gt;
因为 &amp;lt;math&amp;gt;\theta \approx \pi&amp;lt;/math&amp;gt; 时，有 &amp;lt;math&amp;gt;\sin(\theta) \approx \pi - \theta&amp;lt;/math&amp;gt;。这个问题的解含双曲正弦曲线；注意到不同于小角度近似，它是不稳定的，这意味着 &amp;lt;math&amp;gt;|\theta|&amp;lt;/math&amp;gt; 通常会无限增长（但解也有可能是有界的）。这就解释了摆在最高点达到平衡的困难，此时实际上是一种不稳定的状态。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
One more interesting linearization is possible around &amp;lt;math&amp;gt;\theta = \pi/2&amp;lt;/math&amp;gt;, around which &amp;lt;math&amp;gt;\sin(\theta) \approx 1&amp;lt;/math&amp;gt;:&lt;br /&gt;
&lt;br /&gt;
One more interesting linearization is possible around &amp;lt;math&amp;gt;\theta = \pi/2&amp;lt;/math&amp;gt;, around which &amp;lt;math&amp;gt;\sin(\theta) \approx 1&amp;lt;/math&amp;gt;:&lt;br /&gt;
&lt;br /&gt;
一个更有趣的线性化可能是在 &amp;lt;math&amp;gt;\theta = \pi/2&amp;lt;/math&amp;gt;附近，此时 &amp;lt;math&amp;gt;\sin(\theta) \approx 1&amp;lt;/math&amp;gt;:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{d^2 \theta}{d t^2} + 1 = 0.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This corresponds to a free fall problem. A very useful qualitative picture of the pendulum's dynamics may be obtained by piecing together such linearizations, as seen in the figure at right. Other techniques may be used to find (exact) [[phase portrait]]s and approximate periods.&lt;br /&gt;
&lt;br /&gt;
This corresponds to a free fall problem. A very useful qualitative picture of the pendulum's dynamics may be obtained by piecing together such linearizations, as seen in the figure at right. Other techniques may be used to find (exact) phase portraits and approximate periods.&lt;br /&gt;
&lt;br /&gt;
这相当于一个自由落体问题。把这样线性化的结果合在一起看，就能得到有关摆的运动的非常有用的图像，如右图所示。利用其他方法寻找（精确的）'''相图  Phase Portrait'''和估计周期。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Types of nonlinear dynamic behaviors 非线性动力学行为的类型==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Amplitude death]] – any oscillations present in the system cease due to some kind of interaction with other system or feedback by the same system&lt;br /&gt;
&lt;br /&gt;
*'''振幅死亡 Amplitude Death'''——系统内的某振荡因系统的自回馈或与其他系统的某种相互作用而停止的现象&lt;br /&gt;
&lt;br /&gt;
*[[Chaos theory|Chaos]] – values of a system cannot be predicted indefinitely far into the future, and fluctuations are [[aperiodic]]&lt;br /&gt;
&lt;br /&gt;
*'''混沌 Chaos'''——系统内的值无法无限期地预测到遥远的未来；波动是非周期性的&lt;br /&gt;
&lt;br /&gt;
*[[Multistability]] – the presence of two or more stable states&lt;br /&gt;
&lt;br /&gt;
*'''多稳态 Multistability'''——两或多个稳态的存在&lt;br /&gt;
&lt;br /&gt;
*[[Soliton]]s – self-reinforcing solitary waves&lt;br /&gt;
&lt;br /&gt;
*'''孤波 Soliton'''s——自增强的孤立波&lt;br /&gt;
&lt;br /&gt;
*[[Limit cycle|Limit cycles]] – asymptotic periodic orbits to which destabilized fixed points are attracted. &lt;br /&gt;
&lt;br /&gt;
*'''极限环 Limit Cycles'''——吸引不稳定不动点的渐近周期轨道&lt;br /&gt;
&lt;br /&gt;
*[[Self-oscillation|Self-oscillations]] - feedback oscillations taking place in open dissipative physical systems.&lt;br /&gt;
&lt;br /&gt;
*'''自激振荡 Self-oscillations'''——开放耗散物理系统中的反馈振荡&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Examples of nonlinear equations 非线性方程的例子==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Div col|colwidth=25em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Algebraic Riccati equation]] 代数黎卡提方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Ball and beam]] system 球杆系统&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Bellman equation]] for optimal policy 最佳策略的贝尔曼方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Boltzmann equation]] 玻尔兹曼方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Colebrook equation]] 科尔布鲁克方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[General relativity]] 广义相对论&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Ginzburg–Landau theory]] 金兹堡-朗道方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Ishimori equation]] 石森方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Kadomtsev–Petviashvili equation]] 卡东穆塞夫-彼得韦亚斯维利方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Korteweg–de Vries equation]] kdV方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Landau–Lifshitz–Gilbert equation]] 朗道-利夫希兹-吉尔伯特方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Liénard equation]] 林纳德方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Navier–Stokes equations]] of [[fluid dynamics]] 流体力学的纳维－斯托克斯方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Nonlinear optics]] 非线性光学&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Nonlinear Schrödinger equation]] 非线性薛定谔方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Power-flow study]] 功率流研究&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Richards equation]] for unsaturated water flow 未饱和层水流的理查氏方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Self-balancing unicycle]] 自平衡独轮车&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Sine-Gordon equation]] 正弦-戈尔登方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Van der Pol oscillator]] 范德波尔振荡器&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Vlasov equation]] 弗拉索夫方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Div col end}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==See also 参见==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Aleksandr Mikhailovich Lyapunov]] 亚历山大·李亚普诺夫&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Dynamical system]] 动态系统&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Feedback]] 反馈&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Initial condition]] 初始条件&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Interaction]] 相互作用&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Linear system]] 线性系统&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Mode coupling]] 模式耦合&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Vector soliton]] 矢量孤子&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Volterra series]] 沃尔泰拉级数&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==References 参考资料==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Reflist|35em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Further reading 进一步阅读==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Refbegin|35em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*{{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| author= [[Diederich Hinrichsen]] and Anthony J. Pritchard&lt;br /&gt;
&lt;br /&gt;
| author= Diederich Hinrichsen and Anthony J. Pritchard&lt;br /&gt;
&lt;br /&gt;
作者 Diederich Hinrichsen 和 Anthony j. Pritchard&lt;br /&gt;
&lt;br /&gt;
| year= 2005&lt;br /&gt;
&lt;br /&gt;
| year= 2005&lt;br /&gt;
&lt;br /&gt;
2005年&lt;br /&gt;
&lt;br /&gt;
| title= Mathematical Systems Theory I - Modelling, State Space Analysis, Stability and Robustness&lt;br /&gt;
&lt;br /&gt;
| title= Mathematical Systems Theory I - Modelling, State Space Analysis, Stability and Robustness&lt;br /&gt;
&lt;br /&gt;
数学系统理论 i-建模，状态空间分析，稳定性和鲁棒性&lt;br /&gt;
&lt;br /&gt;
| publisher= Springer Verlag&lt;br /&gt;
&lt;br /&gt;
| publisher= Springer Verlag&lt;br /&gt;
&lt;br /&gt;
出版商 Springer Verlag&lt;br /&gt;
&lt;br /&gt;
| isbn=9783540441250&lt;br /&gt;
&lt;br /&gt;
| isbn=9783540441250&lt;br /&gt;
&lt;br /&gt;
9783540441250&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last= Jordan&lt;br /&gt;
&lt;br /&gt;
| last= Jordan&lt;br /&gt;
&lt;br /&gt;
最后一个乔丹&lt;br /&gt;
&lt;br /&gt;
| first= D. W.&lt;br /&gt;
&lt;br /&gt;
| first= D. W.&lt;br /&gt;
&lt;br /&gt;
首先是 D.w。&lt;br /&gt;
&lt;br /&gt;
| last2= Smith&lt;br /&gt;
&lt;br /&gt;
| last2= Smith&lt;br /&gt;
&lt;br /&gt;
最后2个史密斯&lt;br /&gt;
&lt;br /&gt;
| first2= P.&lt;br /&gt;
&lt;br /&gt;
| first2= P.&lt;br /&gt;
&lt;br /&gt;
| first2 p.&lt;br /&gt;
&lt;br /&gt;
| year= 2007&lt;br /&gt;
&lt;br /&gt;
| year= 2007&lt;br /&gt;
&lt;br /&gt;
2007年&lt;br /&gt;
&lt;br /&gt;
| edition= fourth&lt;br /&gt;
&lt;br /&gt;
| edition= fourth&lt;br /&gt;
&lt;br /&gt;
第四版&lt;br /&gt;
&lt;br /&gt;
| title= Nonlinear Ordinary Differential Equations&lt;br /&gt;
&lt;br /&gt;
| title= Nonlinear Ordinary Differential Equations&lt;br /&gt;
&lt;br /&gt;
非线性常微分方程&lt;br /&gt;
&lt;br /&gt;
| publisher= Oxford University Press&lt;br /&gt;
&lt;br /&gt;
| publisher= Oxford University Press&lt;br /&gt;
&lt;br /&gt;
牛津大学出版社&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-19-920824-1&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-19-920824-1&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-19-920824-1]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last= Khalil&lt;br /&gt;
&lt;br /&gt;
| last= Khalil&lt;br /&gt;
&lt;br /&gt;
最后的哈利勒&lt;br /&gt;
&lt;br /&gt;
| first= Hassan K.&lt;br /&gt;
&lt;br /&gt;
| first= Hassan K.&lt;br /&gt;
&lt;br /&gt;
首先是哈桑 · k。&lt;br /&gt;
&lt;br /&gt;
| year= 2001&lt;br /&gt;
&lt;br /&gt;
| year= 2001&lt;br /&gt;
&lt;br /&gt;
2001年&lt;br /&gt;
&lt;br /&gt;
| title= Nonlinear Systems&lt;br /&gt;
&lt;br /&gt;
| title= Nonlinear Systems&lt;br /&gt;
&lt;br /&gt;
非线性系统&lt;br /&gt;
&lt;br /&gt;
| publisher= Prentice Hall&lt;br /&gt;
&lt;br /&gt;
| publisher= Prentice Hall&lt;br /&gt;
&lt;br /&gt;
出版商 Prentice Hall&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-13-067389-3&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-13-067389-3&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-13-067389-3]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last= Kreyszig&lt;br /&gt;
&lt;br /&gt;
| last= Kreyszig&lt;br /&gt;
&lt;br /&gt;
| last= Kreyszig&lt;br /&gt;
&lt;br /&gt;
| first= Erwin&lt;br /&gt;
&lt;br /&gt;
| first= Erwin&lt;br /&gt;
&lt;br /&gt;
首先是欧文&lt;br /&gt;
&lt;br /&gt;
| authorlink= Erwin Kreyszig&lt;br /&gt;
&lt;br /&gt;
| authorlink= Erwin Kreyszig&lt;br /&gt;
&lt;br /&gt;
作者 / 链接 Erwin Kreyszig&lt;br /&gt;
&lt;br /&gt;
| year= 1998&lt;br /&gt;
&lt;br /&gt;
| year= 1998&lt;br /&gt;
&lt;br /&gt;
1998年&lt;br /&gt;
&lt;br /&gt;
| title= Advanced Engineering Mathematics&lt;br /&gt;
&lt;br /&gt;
| title= Advanced Engineering Mathematics&lt;br /&gt;
&lt;br /&gt;
高等工程数学&lt;br /&gt;
&lt;br /&gt;
| url= https://archive.org/details/advancedengineer0008krey&lt;br /&gt;
&lt;br /&gt;
| url= https://archive.org/details/advancedengineer0008krey&lt;br /&gt;
&lt;br /&gt;
Https://archive.org/details/advancedengineer0008krey&lt;br /&gt;
&lt;br /&gt;
| url-access= registration&lt;br /&gt;
&lt;br /&gt;
| url-access= registration&lt;br /&gt;
&lt;br /&gt;
访问注册&lt;br /&gt;
&lt;br /&gt;
| publisher= Wiley&lt;br /&gt;
&lt;br /&gt;
| publisher= Wiley&lt;br /&gt;
&lt;br /&gt;
出版商 Wiley&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-471-15496-9&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-471-15496-9&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-471-15496-9]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last= Sontag&lt;br /&gt;
&lt;br /&gt;
| last= Sontag&lt;br /&gt;
&lt;br /&gt;
最后一个桑塔格&lt;br /&gt;
&lt;br /&gt;
| first= Eduardo&lt;br /&gt;
&lt;br /&gt;
| first= Eduardo&lt;br /&gt;
&lt;br /&gt;
首先是爱德华多&lt;br /&gt;
&lt;br /&gt;
| authorlink= Eduardo D. Sontag&lt;br /&gt;
&lt;br /&gt;
| authorlink= Eduardo D. Sontag&lt;br /&gt;
&lt;br /&gt;
作者: Eduardo d. Sontag&lt;br /&gt;
&lt;br /&gt;
| year= 1998&lt;br /&gt;
&lt;br /&gt;
| year= 1998&lt;br /&gt;
&lt;br /&gt;
1998年&lt;br /&gt;
&lt;br /&gt;
| title= Mathematical Control Theory: Deterministic Finite Dimensional Systems. Second Edition&lt;br /&gt;
&lt;br /&gt;
| title= Mathematical Control Theory: Deterministic Finite Dimensional Systems. Second Edition&lt;br /&gt;
&lt;br /&gt;
数学控制理论: 确定性有限维系统。第二版&lt;br /&gt;
&lt;br /&gt;
| publisher= Springer&lt;br /&gt;
&lt;br /&gt;
| publisher= Springer&lt;br /&gt;
&lt;br /&gt;
出版商斯普林格&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-387-98489-6&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-387-98489-6&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-387-98489-6]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
{{Refend}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==External links 外部链接==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[http://www.dodccrp.org/ Command and Control Research Program (CCRP)]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[http://necsi.edu/guide/concepts/linearnonlinear.html New England Complex Systems Institute: Concepts in Complex Systems]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[http://ocw.mit.edu/courses/mathematics/18-353j-nonlinear-dynamics-i-chaos-fall-2012/ Nonlinear Dynamics I: Chaos] at [http://ocw.mit.edu/OcwWeb/index.htm MIT's OpenCourseWare]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[http://www.hedengren.net/research/models.htm Nonlinear Model Library]{{snd}} (in [[MATLAB]]) a Database of Physical Systems&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[http://cnls.lanl.gov/ The Center for Nonlinear Studies at Los Alamos National Laboratory]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Systems science}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Differential equations topics}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Authority control}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
[https://campus.swarma.org/ 集智学园]课程：[https://campus.swarma.org/course/697 非线性动力学与混沌]&lt;br /&gt;
&lt;br /&gt;
非线性动力学和混沌理论是系统发展的，从一阶微分方程及其分岔开始，然后是相平面分析，极限环和它们的分岔，最终得到Lorenz方程，混沌，迭代映射，周期倍增，重整化，分形和奇怪吸引。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
此系列课程由[[斯蒂文·斯特罗加茨 Steven H. Strogatz]]主持，内容包括机械振动，激光，生物节律，超导电路，昆虫爆发，化学振荡器，遗传控制系统，混沌水轮，甚至是使用混乱发送秘密信息的技术。在每种情况下，科学背景都在初级阶段进行解释，并与数学理论紧密结合。&lt;br /&gt;
&lt;br /&gt;
[[Category:Nonlinear systems| ]]&lt;br /&gt;
&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
[[Category:Dynamical systems]]&lt;br /&gt;
&lt;br /&gt;
Category:Dynamical systems&lt;br /&gt;
&lt;br /&gt;
类别: 动力系统&lt;br /&gt;
&lt;br /&gt;
[[Category:Concepts in physics]]&lt;br /&gt;
&lt;br /&gt;
Category:Concepts in physics&lt;br /&gt;
&lt;br /&gt;
分类: 物理概念&lt;br /&gt;
&lt;br /&gt;
&amp;lt;noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;small&amp;gt;This page was moved from [[wikipedia:en:Nonlinear system]]. Its edit history can be viewed at [[非线性系统/edithistory]]&amp;lt;/small&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:待整理页面]]&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E9%9D%9E%E7%BA%BF%E6%80%A7%E7%B3%BB%E7%BB%9F&amp;diff=10616</id>
		<title>非线性系统</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E9%9D%9E%E7%BA%BF%E6%80%A7%E7%B3%BB%E7%BB%9F&amp;diff=10616"/>
		<updated>2020-07-18T03:32:35Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。{{Redirect|Nonlinear dynamics|the journal|Nonlinear Dynamics (journal)}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Complex systems}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{About|&amp;quot;nonlinearity&amp;quot; in mathematics, physics and other sciences|video and film editing|Non-linear editing system|other uses|Nonlinearity (disambiguation)}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In [[mathematics]] and [[science]], a '''nonlinear system''' is a [[system]] in which the change of the output is not [[proportionality (mathematics)|proportional]] to the change of the input.&amp;lt;ref&amp;gt;{{Cite news|url=https://news.mit.edu/2010/explained-linear-0226|title=Explained: Linear and nonlinear systems|work=MIT News|access-date=2018-06-30}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite web|url=https://www.birmingham.ac.uk/research/activity/mathematics/applied-maths/nonlinear-systems.aspx|title=Nonlinear systems, Applied Mathematics - University of Birmingham|website=www.birmingham.ac.uk|language=en-gb|access-date=2018-06-30}}&amp;lt;/ref&amp;gt; Nonlinear problems are of interest to [[engineer]]s, [[biologist]]s,&amp;lt;ref&amp;gt;{{Citation|date=2007|pages=181–276|publisher=Springer Berlin Heidelberg|language=en|doi=10.1007/978-3-540-34153-6_7|isbn=9783540341529|title = The Nonlinear Universe|series = The Frontiers Collection|chapter = Nonlinear Biology}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last=Korenberg|first=Michael J.|last2=Hunter|first2=Ian W.|date=March 1996|title=The identification of nonlinear biological systems: Volterra kernel approaches|journal=Annals of Biomedical Engineering|language=en|volume=24|issue=2|pages=250–268|doi=10.1007/bf02667354|issn=0090-6964}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last=Mosconi|first=Francesco|last2=Julou|first2=Thomas|last3=Desprat|first3=Nicolas|last4=Sinha|first4=Deepak Kumar|last5=Allemand|first5=Jean-François|last6=Vincent Croquette|last7=Bensimon|first7=David|date=2008|title=Some nonlinear challenges in biology|url=http://stacks.iop.org/0951-7715/21/i=8/a=T03|journal=Nonlinearity|language=en|volume=21|issue=8|pages=T131|doi=10.1088/0951-7715/21/8/T03|issn=0951-7715|bibcode=2008Nonli..21..131M}}&amp;lt;/ref&amp;gt; [[physicist]]s,&amp;lt;ref&amp;gt;{{cite journal|last1=Gintautas|first1=V.|title=Resonant forcing of nonlinear systems of differential equations|journal=Chaos|date=2008|volume=18|issue=3|pages=033118|doi=10.1063/1.2964200|pmid=19045456|arxiv=0803.2252|bibcode=2008Chaos..18c3118G}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Stephenson|first1=C.|last2=et.|first2=al.|title=Topological properties of a self-assembled electrical network via ab initio calculation|journal=Sci. Rep.|volume=7|pages=41621|date=2017|doi=10.1038/srep41621|pmid=28155863|pmc=5290745|bibcode=2017NatSR...741621S}}&amp;lt;/ref&amp;gt; [[mathematician]]s, and many other [[scientist]]s because most systems are inherently nonlinear in nature.&amp;lt;ref&amp;gt;{{cite book|last1=de Canete|first1=Javier, Cipriano Galindo, and Inmaculada Garcia-Moral|title=System Engineering and Automation: An Interactive Educational Approach|date=2011|publisher=Springer|location=Berlin|isbn=978-3642202292|page=46|url=https://books.google.com/?id=h8rCQYXGGY8C&amp;amp;pg=PA46&amp;amp;lpg=PA46&amp;amp;dq=most+systems+are+inherently+nonlinear+in+nature#v=onepage&amp;amp;q=most%20systems%20are%20inherently%20nonlinear%20in%20nature&amp;amp;f=false|accessdate=20 January 2018}}&amp;lt;/ref&amp;gt; Nonlinear [[dynamical system]]s, describing changes in variables over time, may appear chaotic, unpredictable, or counterintuitive, contrasting with much simpler [[linear system]]s.&lt;br /&gt;
&lt;br /&gt;
In mathematics and science, a nonlinear system is a system in which the change of the output is not proportional to the change of the input. Nonlinear problems are of interest to engineers, biologists, physicists, mathematicians, and many other scientists because most systems are inherently nonlinear in nature. Nonlinear dynamical systems, describing changes in variables over time, may appear chaotic, unpredictable, or counterintuitive, contrasting with much simpler linear systems.&lt;br /&gt;
&lt;br /&gt;
在数学及科学中，'''非线性系统 Nonlinear System'''是一种输出的变化与输入的变化不成比例的系统。大多数系统在本质上是非线性的，因而非线性问题引起了工程师、生物学家、物理学家、数学家和许多其他科学家的兴趣。描述变量随时间变化的非线性动力系统与较之简单得多的线性系统相比，可能显得混沌、不可预测或违反直觉。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Typically, the behavior of a nonlinear system is described in mathematics by a '''nonlinear system of equations''', which is a set of simultaneous [[equation]]s in which the unknowns (or the unknown functions in the case of [[differential equation]]s) appear as variables of a [[polynomial]] of degree higher than one or in the argument of a [[function (mathematics)|function]] which is not a polynomial of degree one.&lt;br /&gt;
&lt;br /&gt;
Typically, the behavior of a nonlinear system is described in mathematics by a nonlinear system of equations, which is a set of simultaneous equations in which the unknowns (or the unknown functions in the case of differential equations) appear as variables of a polynomial of degree higher than one or in the argument of a function which is not a polynomial of degree one.&lt;br /&gt;
&lt;br /&gt;
通常，非线性系统的行为在数学上是由一组非线性联立方程来描述的，其中未知数（或微分方程中的未知函数）作为一个高于一次的多项式的变量出现，或者作为一个不是一次多项式的函数的论元出现。__[[用户:Dorr|Dorr]]（[[用户讨论:Dorr|讨论]]）后半句不知如何翻译&lt;br /&gt;
&lt;br /&gt;
&amp;lt;font color='blue'&amp;gt;通常，非线性系统的行为在数学上被描述为一组非线性的联立方程组，其中未知数（或微分方程中的未知函数）作为一个高于一次的多项式变量出现，或者作为一个非一次多项式函数的参数出现。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In other words, in a nonlinear system of equations, the equation(s) to be solved cannot be written as a [[linear combination]] of the unknown [[variable (mathematics)|variables]] or [[function (mathematics)|functions]] that appear in them. Systems can be defined as nonlinear, regardless of whether known linear functions appear in the equations. In particular, a differential equation is ''linear'' if it is linear in terms of the unknown function and its derivatives, even if nonlinear in terms of the other variables appearing in it.&lt;br /&gt;
&lt;br /&gt;
In other words, in a nonlinear system of equations, the equation(s) to be solved cannot be written as a linear combination of the unknown variables or functions that appear in them. Systems can be defined as nonlinear, regardless of whether known linear functions appear in the equations. In particular, a differential equation is linear if it is linear in terms of the unknown function and its derivatives, even if nonlinear in terms of the other variables appearing in it.&lt;br /&gt;
&lt;br /&gt;
换句话说，在非线性方程系统中，&amp;lt;font color='red'&amp;gt;要求解&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;待解&amp;lt;/font&amp;gt; 的方程不能被写成未知变量或函数的线性组合。无论方程中是否有已知的线性函数，系统都可以被定义为非线性。特别是当一个微分方程的未知函数及其导数是线性的，即使其他变量是非线性的，也称该方程是线性的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
As nonlinear dynamical equations are difficult to solve, nonlinear systems are commonly approximated by linear equations ([[linearization]]). This works well up to some accuracy and some range for the input values, but some interesting phenomena such as [[soliton]]s, [[chaos theory|chaos]],&amp;lt;ref&amp;gt;[http://ocw.mit.edu/OcwWeb/Earth--Atmospheric--and-Planetary-Sciences/12-006JFall-2006/CourseHome/index.htm Nonlinear Dynamics I: Chaos] {{webarchive|url=https://web.archive.org/web/20080212045134/http://ocw.mit.edu/OcwWeb/Earth--Atmospheric--and-Planetary-Sciences/12-006JFall-2006/CourseHome/index.htm |date=2008-02-12}} at [http://ocw.mit.edu/OcwWeb/index.htm MIT's OpenCourseWare]&amp;lt;/ref&amp;gt; and [[mathematical singularity|singularities]] are hidden by linearization. It follows that some aspects of the dynamic behavior of a nonlinear system can appear to be counterintuitive, unpredictable or even chaotic. Although such chaotic behavior may resemble [[randomness|random]] behavior, it is in fact not random. For example, some aspects of the weather are seen to be chaotic, where simple changes in one part of the system produce complex effects throughout. This nonlinearity is one of the reasons why accurate long-term forecasts are impossible with current technology.&lt;br /&gt;
&lt;br /&gt;
As nonlinear dynamical equations are difficult to solve, nonlinear systems are commonly approximated by linear equations (linearization). This works well up to some accuracy and some range for the input values, but some interesting phenomena such as solitons, chaos, and singularities are hidden by linearization. It follows that some aspects of the dynamic behavior of a nonlinear system can appear to be counterintuitive, unpredictable or even chaotic. Although such chaotic behavior may resemble random behavior, it is in fact not random. For example, some aspects of the weather are seen to be chaotic, where simple changes in one part of the system produce complex effects throughout. This nonlinearity is one of the reasons why accurate long-term forecasts are impossible with current technology.&lt;br /&gt;
&lt;br /&gt;
由于非线性动力学方程难以求解，通常用线性&amp;lt;font color='red'&amp;gt;&amp;lt;s&amp;gt;化&amp;lt;/s&amp;gt;(这种解法是线性化(linearization)，此处还是按linear来翻吧)&amp;lt;/font&amp;gt;方程来近似非线性系统（'''线性化 Linearization'''）。&amp;lt;font color='red'&amp;gt;这种方法在一定的精度和范围对输入值效果很好&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;这种方法对于一定范围的输入和某些精度要求下的效果不错&amp;lt;/blue&amp;gt;，但一些有趣的现象如'''孤子 Soliton'''、'''混沌 Chaos'''和'''奇异性 Singularity'''在线性化后被隐藏。因此，非线性系统的动态行为在某些方面可能看起来违反直觉、不可预测、甚至混沌。尽管这种混沌行为可能感觉很像随机行为，但它实际上并不是随机的。例如，天气的某些方面被认为是混沌的，其系统某部分的微小扰动就会产生复杂的&amp;lt;font color='blue'&amp;gt;整体(throughout)&amp;lt;/font&amp;gt;影响。这种非线性是目前技术无法进行精确长期预测的原因之一。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Some authors use the term '''nonlinear science''' for the study of nonlinear systems. This term is disputed by others:&lt;br /&gt;
&lt;br /&gt;
Some authors use the term nonlinear science for the study of nonlinear systems. This term is disputed by others:&lt;br /&gt;
&lt;br /&gt;
有些作者用非线性科学这一术语来研究非线性系统。这一术语引起了其他人的争议:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{quote|Using a term like nonlinear science is like referring to the bulk of zoology as the study of [[negation|non]]-elephant animals.|[[Stanislaw Ulam]]&amp;lt;ref&amp;gt;{{cite journal|last1=Campbell|first1=David K.|title=Nonlinear physics: Fresh breather|journal=Nature|date=25 November 2004|volume=432|issue=7016|pages=455–456|doi=10.1038/432455a|pmid=15565139|url=https://zenodo.org/record/1134179|language=en|issn=0028-0836|bibcode=2004Natur.432..455C}}&amp;lt;/ref&amp;gt;}}&lt;br /&gt;
&lt;br /&gt;
“使用‘非线性科学’这样的术语，就如同把动物学里大部分对象称作‘非大象动物’研究一样可笑。”&lt;br /&gt;
&lt;br /&gt;
——'''斯塔尼斯拉夫·乌拉姆 Stanislaw Ulam'''&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Definition 定义==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In [[mathematics]], a [[linear map]] (or ''linear function'') &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; is one which satisfies both of the following properties:&lt;br /&gt;
&lt;br /&gt;
In mathematics, a linear map (or linear function) &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; is one which satisfies both of the following properties:&lt;br /&gt;
&lt;br /&gt;
在数学中，线性映射（或线性函数）&amp;lt;math&amp;gt;f (x)&amp;lt;/math&amp;gt;满足以下两个性质:&lt;br /&gt;
&lt;br /&gt;
*Additivity or [[superposition Principle]]: &amp;lt;math&amp;gt;\textstyle f(x + y) = f(x) + f(y);&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
*Homogeneity: &amp;lt;math&amp;gt;\textstyle f(\alpha x) = \alpha f(x).&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*'''可加性 Additivity'''（'''叠加性 Superposition principle'''）: &amp;lt;math&amp;gt;\textstyle f(x + y) = f(x) + f(y);&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
*'''齐次性 Homogeneity''': &amp;lt;math&amp;gt;\textstyle f(\alpha x) = \alpha f(x).&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Additivity implies homogeneity for any [[rational number|rational]] ''α'', and, for [[continuous function]]s, for any [[real number|real]] ''α''. For a [[complex number|complex]] ''α'', homogeneity does not follow from additivity. For example, an [[antilinear map]] is additive but not homogeneous. The conditions of additivity and homogeneity are often combined in the superposition principle&lt;br /&gt;
&lt;br /&gt;
Additivity implies homogeneity for any rational α, and, for continuous functions, for any real α. For a complex α, homogeneity does not follow from additivity. For example, an antilinear map is additive but not homogeneous. The conditions of additivity and homogeneity are often combined in the superposition principle:&lt;br /&gt;
&lt;br /&gt;
当α是有理数或实数，且&amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt;是连续函数时，由可加性可以推出齐次性。但当α是复数时，可加性不能导出齐次性。例如，反线性映射是可加的，但不是齐次的。可加性和齐次性条件经常组合，称为叠加原理：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;f(\alpha x + \beta y) = \alpha f(x) + \beta f(y)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
An equation written as&lt;br /&gt;
&lt;br /&gt;
对一个写成&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;f(x) = C&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
is called '''linear''' if &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; is a linear map (as defined above) and '''nonlinear''' otherwise. The equation is called ''homogeneous'' if &amp;lt;math&amp;gt;C = 0&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
is called linear if &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; is a linear map (as defined above) and nonlinear otherwise. The equation is called homogeneous if &amp;lt;math&amp;gt;C = 0&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
的方程，若 &amp;lt;math&amp;gt; f (x) &amp;lt;/math&amp;gt; 是线性映射（如上定义） ，则称其为'''线性的 Linear'''，否则称为'''非线性的 Nonlinear'''。若&amp;lt;math&amp;gt;C = 0&amp;lt;/math&amp;gt;，该方程称为是齐次的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The definition &amp;lt;math&amp;gt;f(x) = C&amp;lt;/math&amp;gt; is very general in that &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; can be any sensible mathematical object (number, vector, function, etc.), and the function &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; can literally be any [[map (mathematics)|mapping]], including integration or differentiation with associated constraints (such as [[boundary values]]). If &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; contains [[derivative|differentiation]] with respect to &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt;, the result will be a [[differential equation]].&lt;br /&gt;
&lt;br /&gt;
The definition &amp;lt;math&amp;gt;f(x) = C&amp;lt;/math&amp;gt; is very general in that &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; can be any sensible mathematical object (number, vector, function, etc.), and the function &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; can literally be any mapping, including integration or differentiation with associated constraints (such as boundary values). If &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; contains differentiation with respect to &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt;, the result will be a differential equation.&lt;br /&gt;
&lt;br /&gt;
定义 &amp;lt;math&amp;gt;f(x) = C&amp;lt;/math&amp;gt; 是非常具有一般性的，因为 &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; 可以是任意可感知的数学对象（数字、向量、函数等），函数 &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; 实际上可以是任意映射，包括有相关约束（如给定边界值）的积分或微分。若 &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; 包含对 &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; 的微分运算，则该方程为微分方程。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===相关概念辨析===&lt;br /&gt;
'''线性Linear'''、'''非线性Nonlinear'''、'''亚线性 Sublinear'''、'''超线性 Superlinear'''：描述量与量之间的一种变化关系，例如&amp;lt;math&amp;gt;y=a+b*x^n&amp;lt;/math&amp;gt;，其中&amp;lt;math&amp;gt;n&amp;gt;1&amp;lt;/math&amp;gt;。当&amp;lt;math&amp;gt;n=1&amp;lt;/math&amp;gt;时，表示为线性关系；&amp;lt;math&amp;gt;n\neq 1&amp;lt;/math&amp;gt;时，表示为非线性关系；当&amp;lt;math&amp;gt;0&amp;lt;n&amp;lt;1&amp;lt;/math&amp;gt;时，表示为亚线性关系；当&amp;lt;math&amp;gt;n&amp;gt;1&amp;lt;/math&amp;gt;时，表示为超线性关系。&lt;br /&gt;
&lt;br /&gt;
亚线性与超线性属于非线性变化关系范畴。当两个变量之间存在亚线性关系时，其典型特性是因变量的变化速率会随着自变量的增大而减小，即其一阶导数会随着自变量的增大而减小；两个变量之间存在超线性关系时，其典型特性是因变量的变化速率会随着自变量的增大而增大，即其一阶导数会随着自变量的增大而增大。&lt;br /&gt;
&lt;br /&gt;
在线性系统中，整体等于部分和，描述线性系统的方程满足叠加原理，作用的总和正好等于每一部分作用相加的代数和，这意味着每一部分作用都是独立的、互不相关的；而在普遍存在的非线性系统中，作用的总和不等于每一部分作用相加的代数和，因为系统内部要素之间存在着复杂的非线性相互作用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Nonlinear algebraic equations 非线性代数方程==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Algebraic equation|System of polynomial equations}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Nonlinear [[algebraic equation]]s, which are also called ''[[polynomial equation]]s'', are defined by equating [[polynomial]]s (of degree greater than one) to zero. For example,&lt;br /&gt;
&lt;br /&gt;
Nonlinear algebraic equations, which are also called polynomial equations, are defined by equating polynomials (of degree greater than one) to zero. For example,&lt;br /&gt;
&lt;br /&gt;
非线性'''代数方程 Algebraic Equation'''，又称'''多项式方程 Polynomial Equation'''，由某多项式（次数大于1）等于零定义。例如：&lt;br /&gt;
&lt;br /&gt;
 &lt;br /&gt;
&amp;lt;math&amp;gt;x^2 + x - 1 = 0\,.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
For a single polynomial equation, [[root-finding algorithm]]s can be used to find solutions to the equation (i.e., sets of values for the variables that satisfy the equation). However, systems of algebraic equations are more complicated; their study is one motivation for the field of [[algebraic geometry]], a difficult branch of modern mathematics. It is even difficult to decide whether a given algebraic system has complex solutions (see [[Hilbert's Nullstellensatz]]). Nevertheless, in the case of the systems with a finite number of complex solutions, these [[systems of polynomial equations]] are now well understood and efficient methods exist for solving them.&amp;lt;ref&amp;gt;{{cite journal |last1= Lazard |first1= D. |title= Thirty years of Polynomial System Solving, and now? |doi= 10.1016/j.jsc.2008.03.004 |journal= Journal of Symbolic Computation |volume= 44 |issue= 3 |pages= 222–231 |year= 2009 |pmid= |pmc=}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
For a single polynomial equation, root-finding algorithms can be used to find solutions to the equation (i.e., sets of values for the variables that satisfy the equation). However, systems of algebraic equations are more complicated; their study is one motivation for the field of algebraic geometry, a difficult branch of modern mathematics. It is even difficult to decide whether a given algebraic system has complex solutions (see Hilbert's Nullstellensatz). Nevertheless, in the case of the systems with a finite number of complex solutions, these systems of polynomial equations are now well understood and efficient methods exist for solving them.&lt;br /&gt;
&lt;br /&gt;
对于一个单一的多项式方程，'''求根算法 Root-finding Algorithms'''可用于其求解（即找到满足该方程的变量的值集）。而代数方程组则相对复杂，其研究是现代数学的较难分支——'''代数几何 Algebraic Geometry'''领域的动力之一。甚至很难判断一个给定的代数系统是否有复数解（见'''希尔伯特零点定律  Hilbert's Nullstellensatz'''）。不过，对于具有有限个复数解的系统的多项式方程组，我们现在已经有了充分的理解，并且找到了有效的求解方法。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Nonlinear recurrence relations 非线性递推关系==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A nonlinear [[recurrence relation]] defines successive terms of a [[sequence]] as a nonlinear function of preceding terms. Examples of nonlinear recurrence relations are the [[logistic map]] and the relations that define the various [[Hofstadter sequence]]s. Nonlinear discrete models that represent a wide class of nonlinear recurrence relationships include the NARMAX (Nonlinear Autoregressive Moving Average with eXogenous inputs) model and the related [[nonlinear system identification]] and analysis procedures.&amp;lt;ref name=&amp;quot;SAB1&amp;quot;&amp;gt;Billings S.A. &amp;quot;Nonlinear System Identification: NARMAX Methods in the Time, Frequency, and Spatio-Temporal Domains&amp;quot;. Wiley, 2013&amp;lt;/ref&amp;gt; These approaches can be used to study a wide class of complex nonlinear behaviors in the time, frequency, and spatio-temporal domains.&lt;br /&gt;
&lt;br /&gt;
A nonlinear recurrence relation defines successive terms of a sequence as a nonlinear function of preceding terms. Examples of nonlinear recurrence relations are the logistic map and the relations that define the various Hofstadter sequences. Nonlinear discrete models that represent a wide class of nonlinear recurrence relationships include the NARMAX (Nonlinear Autoregressive Moving Average with eXogenous inputs) model and the related nonlinear system identification and analysis procedures. These approaches can be used to study a wide class of complex nonlinear behaviors in the time, frequency, and spatio-temporal domains.&lt;br /&gt;
&lt;br /&gt;
非线性递归关系中，序列的连续项被定义为其前项的非线性函数。非线性递归关系的例子有 [[logistic 映射]]和定义各种'''霍夫斯塔特序列 Hofstadter Sequences''' 的关系。非线性离散模型代表了一类广泛的非线性递归关系，包括 NARMAX（外部输入非线性自回归移动平均）模型和相关的非线性系统辨识和分析程序。这些方法可用于研究时域、频域和时空域的广泛复杂非线性行为。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Nonlinear differential equations 非线性微分方程==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A [[simultaneous equations|system]] of [[differential equation]]s is said to be nonlinear if it is not a [[linear system]]. Problems involving nonlinear differential equations are extremely diverse, and methods of solution or analysis are problem dependent. Examples of nonlinear differential equations are the [[Navier–Stokes equations]] in fluid dynamics and the [[Lotka–Volterra equation]]s in biology.&lt;br /&gt;
&lt;br /&gt;
A system of differential equations is said to be nonlinear if it is not a linear system. Problems involving nonlinear differential equations are extremely diverse, and methods of solution or analysis are problem dependent. Examples of nonlinear differential equations are the Navier–Stokes equations in fluid dynamics and the Lotka–Volterra equations in biology.&lt;br /&gt;
&lt;br /&gt;
若一个微分方程组不是线性系统，则称其为非线性的。涉及非线性微分方程的问题非常多样，对不同问题的解决或分析方法也不相同。非线性微分方程的例子有流体力学中的 '''纳维-斯托克斯方程 Navier-Stokes Equations'''和生物学中的'''洛特卡－沃尔泰拉方程 Lotka-Volterra Equations'''。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
One of the greatest difficulties of nonlinear problems is that it is not generally possible to combine known solutions into new solutions. In linear problems, for example, a family of [[linearly independent]] solutions can be used to construct general solutions through the [[superposition principle]]. A good example of this is one-dimensional heat transport with [[Dirichlet boundary conditions]], the solution of which can be written as a time-dependent linear combination of sinusoids of differing frequencies; this makes solutions very flexible. It is often possible to find several very specific solutions to nonlinear equations, however the lack of a superposition principle prevents the construction of new solutions.&lt;br /&gt;
&lt;br /&gt;
One of the greatest difficulties of nonlinear problems is that it is not generally possible to combine known solutions into new solutions. In linear problems, for example, a family of linearly independent solutions can be used to construct general solutions through the superposition principle. A good example of this is one-dimensional heat transport with Dirichlet boundary conditions, the solution of which can be written as a time-dependent linear combination of sinusoids of differing frequencies; this makes solutions very flexible. It is often possible to find several very specific solutions to nonlinear equations, however the lack of a superposition principle prevents the construction of new solutions.&lt;br /&gt;
&lt;br /&gt;
非线性问题最大的困难之一是通常不可能将已知的解组合成新的解。例如，在线性问题中，可以根据叠加原理以一族线性独立的解构造通解。一个很好的例子是带有'''狄利克雷边界条件 Dirichlet Boundary Conditions'''的一维热传导问题，其解（随时间变化）可以写成不同频率的正弦波的线性组合，这使得解非常灵活。而对非线性方程，通常可以找到几个非常特殊的解，但是此时叠加原理不适用，故无法构造新的解。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Ordinary differential equations 常微分方程===&lt;br /&gt;
&lt;br /&gt;
First order [[ordinary differential equation]]s are often exactly solvable by [[separation of variables]], especially for autonomous equations. For example, the nonlinear equation&lt;br /&gt;
&lt;br /&gt;
First order ordinary differential equations are often exactly solvable by separation of variables, especially for autonomous equations. For example, the nonlinear equation&lt;br /&gt;
&lt;br /&gt;
一阶常微分方程，尤其是自治方程，通常可以用'''分离变量法  Separation of Variables'''来精确求解。例如，非线性方程&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{d u}{d x} = -u^2&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
has &amp;lt;math&amp;gt;u=\frac{1}{x+C}&amp;lt;/math&amp;gt; as a general solution (and also ''u'' = 0 as a particular solution, corresponding to the limit of the general solution when ''C'' tends to infinity). The equation is nonlinear because it may be written as&lt;br /&gt;
&lt;br /&gt;
has &amp;lt;math&amp;gt;u=\frac{1}{x+C}&amp;lt;/math&amp;gt; as a general solution (and also u = 0 as a particular solution, corresponding to the limit of the general solution when C tends to infinity). The equation is nonlinear because it may be written as&lt;br /&gt;
&lt;br /&gt;
将 &amp;lt;math&amp;gt;u=\frac{1}{x+C}&amp;lt;/math&amp;gt; 作为一般解（也有特解 ''u'' = 0，对应于 ''C'' 趋于无穷时的一般解的极限)。该方程是非线性的，因为它可以改写成&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{du}{d x} + u^2=0&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
and the left-hand side of the equation is not a linear function of ''u'' and its derivatives. Note that if the ''u''&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt; term were replaced with ''u'', the problem would be linear (the [[exponential decay]] problem).&lt;br /&gt;
&lt;br /&gt;
and the left-hand side of the equation is not a linear function of u and its derivatives. Note that if the u&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt; term were replaced with u, the problem would be linear (the exponential decay problem).&lt;br /&gt;
&lt;br /&gt;
方程的左边不是 ''u'' 及其导数的线性函数。注意，若将 ''u''&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt; 项替换为''u''，该问题将变为线性的（'''指数衰减 Exponential Decay'''问题）。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Second and higher order ordinary differential equations (more generally, systems of nonlinear equations) rarely yield [[closed-form expression|closed-form]] solutions, though implicit solutions and solutions involving [[nonelementary integral]]s are encountered.&lt;br /&gt;
&lt;br /&gt;
Second and higher order ordinary differential equations (more generally, systems of nonlinear equations) rarely yield closed-form solutions, though implicit solutions and solutions involving nonelementary integrals are encountered.&lt;br /&gt;
&lt;br /&gt;
二阶和高阶常微分方程（更一般地说，非线性方程组）很少能产生封闭解，而隐式解和非初等函数积分形式的解较为常见。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Common methods for the qualitative analysis of nonlinear ordinary differential equations include:&lt;br /&gt;
&lt;br /&gt;
Common methods for the qualitative analysis of nonlinear ordinary differential equations include:&lt;br /&gt;
&lt;br /&gt;
非线性常微分方程定性分析的常用方法包括:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*Examination of any [[conserved quantities]], especially in [[Hamiltonian system]]s&lt;br /&gt;
&lt;br /&gt;
*检查是否有任意'''守恒量 Conserved Quantities'''（特别是在'''哈密顿系统 Hamiltonian System'''中）&lt;br /&gt;
&lt;br /&gt;
*Examination of dissipative quantities (see [[Lyapunov function]]) analogous to conserved quantities&lt;br /&gt;
&lt;br /&gt;
*检查是否有类似守恒量的耗散量（见'''李亚普诺夫函数 Lyapunov Function'''）&lt;br /&gt;
&lt;br /&gt;
*Linearization via [[Taylor expansion]]&lt;br /&gt;
&lt;br /&gt;
*基于'''泰勒展开 Taylor Expansion'''的线性化&lt;br /&gt;
&lt;br /&gt;
*Change of variables into something easier to study&lt;br /&gt;
&lt;br /&gt;
*将变量进行代换以便更好的进行研究&lt;br /&gt;
&lt;br /&gt;
*[[Bifurcation theory]]&lt;br /&gt;
&lt;br /&gt;
*'''分岔理论 Bifurcation Theory'''&lt;br /&gt;
&lt;br /&gt;
*[[Perturbation theory|Perturbation]] methods (can be applied to algebraic equations too)&lt;br /&gt;
&lt;br /&gt;
*'''摄动理论 Perturbation Theory'''（也可应用于代数方程）&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Partial differential equations 偏微分方程===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{main|Nonlinear partial differential equation}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{See also|List of nonlinear partial differential equations}}&lt;br /&gt;
&lt;br /&gt;
参见：非线性偏微分列表&lt;br /&gt;
&lt;br /&gt;
The most common basic approach to studying nonlinear [[partial differential equation]]s is to change the variables (or otherwise transform the problem) so that the resulting problem is simpler (possibly even linear). Sometimes, the equation may be transformed into one or more [[ordinary differential equation]]s, as seen in [[separation of variables]], which is always useful whether or not the resulting ordinary differential equation(s) is solvable.&lt;br /&gt;
&lt;br /&gt;
The most common basic approach to studying nonlinear partial differential equations is to change the variables (or otherwise transform the problem) so that the resulting problem is simpler (possibly even linear). Sometimes, the equation may be transformed into one or more ordinary differential equations, as seen in separation of variables, which is always useful whether or not the resulting ordinary differential equation(s) is solvable.&lt;br /&gt;
&lt;br /&gt;
研究非线性偏微分方程最常用的基本方法是变量代换（或转换问题），使变换后的问题更简单（甚至可能变为线性的）。有时可以将此类方程转化成一或多个常微分方程（如同分离变量法所示），此时不论得到的常微分方程是否可解，对研究问题总是有用的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Another common (though less mathematic) tactic, often seen in fluid and heat mechanics, is to use [[scale analysis (mathematics)|scale analysis]] to simplify a general, natural equation in a certain specific [[boundary value problem]]. For example, the (very) nonlinear [[Navier-Stokes equations]] can be simplified into one linear partial differential equation in the case of transient, laminar, one dimensional flow in a circular pipe; the scale analysis provides conditions under which the flow is laminar and one dimensional and also yields the simplified equation.&lt;br /&gt;
&lt;br /&gt;
Another common (though less mathematic) tactic, often seen in fluid and heat mechanics, is to use scale analysis to simplify a general, natural equation in a certain specific boundary value problem. For example, the (very) nonlinear Navier-Stokes equations can be simplified into one linear partial differential equation in the case of transient, laminar, one dimensional flow in a circular pipe; the scale analysis provides conditions under which the flow is laminar and one dimensional and also yields the simplified equation.&lt;br /&gt;
&lt;br /&gt;
另一个流体力学和热力学中常见的策略（虽然不是数学上的）是利用'''尺度分析 Scale Analysis'''来在某一特定边界条件下简化一般自然方程。例如，在描述圆管内一维层流的暂态时，非线性的纳维－斯托克斯方程可以简化为一个线性的偏微分方程; 尺度分析提供了层流和一维流动的条件，也产生了简化的方程。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Other methods include examining the [[method of characteristics|characteristics]] and using the methods outlined above for ordinary differential equations.&lt;br /&gt;
&lt;br /&gt;
Other methods include examining the characteristics and using the methods outlined above for ordinary differential equations.&lt;br /&gt;
&lt;br /&gt;
其他方法包括检查特征线法及前面所述研究常微分方程的方法。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Pendula 摆===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Pendulum (mathematics)}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:PendulumLayout.svg.png|thumb|图一：Illustration of a pendulum 摆图解|right|200px]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:PendulumLinearizations.png|thumb|图二：Linearizations of a pendulum 摆的线性化|right|200px]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A classic, extensively studied nonlinear problem is the dynamics of a [[pendulum (mathematics)|pendulum]] under the influence of [[gravity]]. Using [[Lagrangian mechanics]], it may be shown&amp;lt;ref&amp;gt;[http://www.damtp.cam.ac.uk/user/tong/dynamics.html David Tong: Lectures on Classical Dynamics]&amp;lt;/ref&amp;gt; that the motion of a pendulum can be described by the [[dimensionless]] nonlinear equation&lt;br /&gt;
&lt;br /&gt;
A classic, extensively studied nonlinear problem is the dynamics of a pendulum under the influence of gravity. Using Lagrangian mechanics, it may be shown that the motion of a pendulum can be described by the dimensionless nonlinear equation&lt;br /&gt;
&lt;br /&gt;
一个经典的被广泛研究的非线性问题是重力影响下的摆的动力学。利用'''拉格朗日力学 Lagrangian Mechanics'''，可以证明摆的运动可以用无量纲的非线性方程&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{d^2 \theta}{d t^2} + \sin(\theta) = 0&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
where gravity points &amp;quot;downwards&amp;quot; and &amp;lt;math&amp;gt;\theta&amp;lt;/math&amp;gt; is the angle the pendulum forms with its rest position, as shown in the figure at right. One approach to &amp;quot;solving&amp;quot; this equation is to use &amp;lt;math&amp;gt;d\theta/dt&amp;lt;/math&amp;gt; as an [[integrating factor]], which would eventually yield&lt;br /&gt;
&lt;br /&gt;
where gravity points &amp;quot;downwards&amp;quot; and &amp;lt;math&amp;gt;\theta&amp;lt;/math&amp;gt; is the angle the pendulum forms with its rest position, as shown in the figure at right. One approach to &amp;quot;solving&amp;quot; this equation is to use &amp;lt;math&amp;gt;d\theta/dt&amp;lt;/math&amp;gt; as an integrating factor, which would eventually yield&lt;br /&gt;
&lt;br /&gt;
描述，其中重力指向“下方”，&amp;lt;math&amp;gt;\theta&amp;lt;/math&amp;gt; 是摆与其静止位置形成的角度，如右图所示。“解”这个方程的方法之一是用 &amp;lt;math&amp;gt;d\theta/dt&amp;lt;/math&amp;gt; 作为'''积分因子 Integrating Factor'''，最终得&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\int{\frac{d \theta}{\sqrt{C_0 + 2 \cos(\theta)}}} = t + C_1&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
which is an implicit solution involving an [[elliptic integral]]. This &amp;quot;solution&amp;quot; generally does not have many uses because most of the nature of the solution is hidden in the [[nonelementary integral]] (nonelementary unless &amp;lt;math&amp;gt;C_0 = 2&amp;lt;/math&amp;gt;).&lt;br /&gt;
&lt;br /&gt;
which is an implicit solution involving an elliptic integral. This &amp;quot;solution&amp;quot; generally does not have many uses because most of the nature of the solution is hidden in the nonelementary integral (nonelementary unless &amp;lt;math&amp;gt;C_0 = 2&amp;lt;/math&amp;gt;).&lt;br /&gt;
&lt;br /&gt;
这是一个含'''椭圆积分 Elliptic Integral'''的隐式解。这个“解”通常没什么用，因为这个解的大部分性质都隐藏在非初等函数积分中（除非&amp;lt;math&amp;gt;C_0 = 2&amp;lt;/math&amp;gt;，否则是非初等的）。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Another way to approach the problem is to linearize any nonlinearities (the sine function term in this case) at the various points of interest through [[Taylor expansion]]s. For example, the linearization at &amp;lt;math&amp;gt;\theta = 0&amp;lt;/math&amp;gt;, called the small angle approximation, is&lt;br /&gt;
&lt;br /&gt;
Another way to approach the problem is to linearize any nonlinearities (the sine function term in this case) at the various points of interest through Taylor expansions. For example, the linearization at &amp;lt;math&amp;gt;\theta = 0&amp;lt;/math&amp;gt;, called the small angle approximation, is&lt;br /&gt;
&lt;br /&gt;
另一种解决这个问题的方法是利用泰勒展开将任意非线性项（此时为正弦函数项)在某些感兴趣的点线性化。例如，在&amp;lt;math&amp;gt;\theta = 0&amp;lt;/math&amp;gt; 的点附近线性化（称为小角度近似）为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{d^2 \theta}{d t^2} + \theta = 0&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
since &amp;lt;math&amp;gt;\sin(\theta) \approx \theta&amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt;\theta \approx 0&amp;lt;/math&amp;gt;. This is a [[simple harmonic oscillator]] corresponding to oscillations of the pendulum near the bottom of its path. Another linearization would be at &amp;lt;math&amp;gt;\theta = \pi&amp;lt;/math&amp;gt;, corresponding to the pendulum being straight up:&lt;br /&gt;
&lt;br /&gt;
since &amp;lt;math&amp;gt;\sin(\theta) \approx \theta&amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt;\theta \approx 0&amp;lt;/math&amp;gt;. This is a simple harmonic oscillator corresponding to oscillations of the pendulum near the bottom of its path. Another linearization would be at &amp;lt;math&amp;gt;\theta = \pi&amp;lt;/math&amp;gt;, corresponding to the pendulum being straight up:&lt;br /&gt;
&lt;br /&gt;
因为 &amp;lt;math&amp;gt;\theta \approx 0&amp;lt;/math&amp;gt; 时，有 &amp;lt;math&amp;gt;\sin(\theta) \approx \theta&amp;lt;/math&amp;gt;。这是一个'''简谐振子 Simple Harmonic Oscillator''' ，对应于摆在其路径底部附近的摆动。另一种线性化方法是在 &amp;lt;math&amp;gt;\theta = \pi&amp;lt;/math&amp;gt;附近线性化，对应于运动到最高点的摆:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{d^2 \theta}{d t^2} + \pi - \theta = 0&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
since &amp;lt;math&amp;gt;\sin(\theta) \approx \pi - \theta&amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt;\theta \approx \pi&amp;lt;/math&amp;gt;. The solution to this problem involves [[hyperbolic sinusoid]]s, and note that unlike the small angle approximation, this approximation is unstable, meaning that &amp;lt;math&amp;gt;|\theta|&amp;lt;/math&amp;gt; will usually grow without limit, though bounded solutions are possible. This corresponds to the difficulty of balancing a pendulum upright, it is literally an unstable state.&lt;br /&gt;
&lt;br /&gt;
since &amp;lt;math&amp;gt;\sin(\theta) \approx \pi - \theta&amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt;\theta \approx \pi&amp;lt;/math&amp;gt;. The solution to this problem involves hyperbolic sinusoids, and note that unlike the small angle approximation, this approximation is unstable, meaning that &amp;lt;math&amp;gt;|\theta|&amp;lt;/math&amp;gt; will usually grow without limit, though bounded solutions are possible. This corresponds to the difficulty of balancing a pendulum upright, it is literally an unstable state.&lt;br /&gt;
&lt;br /&gt;
因为 &amp;lt;math&amp;gt;\theta \approx \pi&amp;lt;/math&amp;gt; 时，有 &amp;lt;math&amp;gt;\sin(\theta) \approx \pi - \theta&amp;lt;/math&amp;gt;。这个问题的解含双曲正弦曲线；注意到不同于小角度近似，它是不稳定的，这意味着 &amp;lt;math&amp;gt;|\theta|&amp;lt;/math&amp;gt; 通常会无限增长（但解也有可能是有界的）。这就解释了摆在最高点达到平衡的困难，此时实际上是一种不稳定的状态。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
One more interesting linearization is possible around &amp;lt;math&amp;gt;\theta = \pi/2&amp;lt;/math&amp;gt;, around which &amp;lt;math&amp;gt;\sin(\theta) \approx 1&amp;lt;/math&amp;gt;:&lt;br /&gt;
&lt;br /&gt;
One more interesting linearization is possible around &amp;lt;math&amp;gt;\theta = \pi/2&amp;lt;/math&amp;gt;, around which &amp;lt;math&amp;gt;\sin(\theta) \approx 1&amp;lt;/math&amp;gt;:&lt;br /&gt;
&lt;br /&gt;
一个更有趣的线性化可能是在 &amp;lt;math&amp;gt;\theta = \pi/2&amp;lt;/math&amp;gt;附近，此时 &amp;lt;math&amp;gt;\sin(\theta) \approx 1&amp;lt;/math&amp;gt;:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{d^2 \theta}{d t^2} + 1 = 0.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This corresponds to a free fall problem. A very useful qualitative picture of the pendulum's dynamics may be obtained by piecing together such linearizations, as seen in the figure at right. Other techniques may be used to find (exact) [[phase portrait]]s and approximate periods.&lt;br /&gt;
&lt;br /&gt;
This corresponds to a free fall problem. A very useful qualitative picture of the pendulum's dynamics may be obtained by piecing together such linearizations, as seen in the figure at right. Other techniques may be used to find (exact) phase portraits and approximate periods.&lt;br /&gt;
&lt;br /&gt;
这相当于一个自由落体问题。把这样线性化的结果合在一起看，就能得到有关摆的运动的非常有用的图像，如右图所示。利用其他方法寻找（精确的）'''相图  Phase Portrait'''和估计周期。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Types of nonlinear dynamic behaviors 非线性动力学行为的类型==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Amplitude death]] – any oscillations present in the system cease due to some kind of interaction with other system or feedback by the same system&lt;br /&gt;
&lt;br /&gt;
*'''振幅死亡 Amplitude Death'''——系统内的某振荡因系统的自回馈或与其他系统的某种相互作用而停止的现象&lt;br /&gt;
&lt;br /&gt;
*[[Chaos theory|Chaos]] – values of a system cannot be predicted indefinitely far into the future, and fluctuations are [[aperiodic]]&lt;br /&gt;
&lt;br /&gt;
*'''混沌 Chaos'''——系统内的值无法无限期地预测到遥远的未来；波动是非周期性的&lt;br /&gt;
&lt;br /&gt;
*[[Multistability]] – the presence of two or more stable states&lt;br /&gt;
&lt;br /&gt;
*'''多稳态 Multistability'''——两或多个稳态的存在&lt;br /&gt;
&lt;br /&gt;
*[[Soliton]]s – self-reinforcing solitary waves&lt;br /&gt;
&lt;br /&gt;
*'''孤波 Soliton'''s——自增强的孤立波&lt;br /&gt;
&lt;br /&gt;
*[[Limit cycle|Limit cycles]] – asymptotic periodic orbits to which destabilized fixed points are attracted. &lt;br /&gt;
&lt;br /&gt;
*'''极限环 Limit Cycles'''——吸引不稳定不动点的渐近周期轨道&lt;br /&gt;
&lt;br /&gt;
*[[Self-oscillation|Self-oscillations]] - feedback oscillations taking place in open dissipative physical systems.&lt;br /&gt;
&lt;br /&gt;
*'''自激振荡 Self-oscillations'''——开放耗散物理系统中的反馈振荡&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Examples of nonlinear equations 非线性方程的例子==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Div col|colwidth=25em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Algebraic Riccati equation]] 代数黎卡提方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Ball and beam]] system 球杆系统&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Bellman equation]] for optimal policy 最佳策略的贝尔曼方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Boltzmann equation]] 玻尔兹曼方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Colebrook equation]] 科尔布鲁克方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[General relativity]] 广义相对论&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Ginzburg–Landau theory]] 金兹堡-朗道方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Ishimori equation]] 石森方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Kadomtsev–Petviashvili equation]] 卡东穆塞夫-彼得韦亚斯维利方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Korteweg–de Vries equation]] kdV方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Landau–Lifshitz–Gilbert equation]] 朗道-利夫希兹-吉尔伯特方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Liénard equation]] 林纳德方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Navier–Stokes equations]] of [[fluid dynamics]] 流体力学的纳维－斯托克斯方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Nonlinear optics]] 非线性光学&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Nonlinear Schrödinger equation]] 非线性薛定谔方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Power-flow study]] 功率流研究&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Richards equation]] for unsaturated water flow 未饱和层水流的理查氏方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Self-balancing unicycle]] 自平衡独轮车&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Sine-Gordon equation]] 正弦-戈尔登方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Van der Pol oscillator]] 范德波尔振荡器&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Vlasov equation]] 弗拉索夫方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Div col end}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==See also 参见==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Aleksandr Mikhailovich Lyapunov]] 亚历山大·李亚普诺夫&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Dynamical system]] 动态系统&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Feedback]] 反馈&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Initial condition]] 初始条件&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Interaction]] 相互作用&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Linear system]] 线性系统&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Mode coupling]] 模式耦合&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Vector soliton]] 矢量孤子&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Volterra series]] 沃尔泰拉级数&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==References 参考资料==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Reflist|35em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Further reading 进一步阅读==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Refbegin|35em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*{{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| author= [[Diederich Hinrichsen]] and Anthony J. Pritchard&lt;br /&gt;
&lt;br /&gt;
| author= Diederich Hinrichsen and Anthony J. Pritchard&lt;br /&gt;
&lt;br /&gt;
作者 Diederich Hinrichsen 和 Anthony j. Pritchard&lt;br /&gt;
&lt;br /&gt;
| year= 2005&lt;br /&gt;
&lt;br /&gt;
| year= 2005&lt;br /&gt;
&lt;br /&gt;
2005年&lt;br /&gt;
&lt;br /&gt;
| title= Mathematical Systems Theory I - Modelling, State Space Analysis, Stability and Robustness&lt;br /&gt;
&lt;br /&gt;
| title= Mathematical Systems Theory I - Modelling, State Space Analysis, Stability and Robustness&lt;br /&gt;
&lt;br /&gt;
数学系统理论 i-建模，状态空间分析，稳定性和鲁棒性&lt;br /&gt;
&lt;br /&gt;
| publisher= Springer Verlag&lt;br /&gt;
&lt;br /&gt;
| publisher= Springer Verlag&lt;br /&gt;
&lt;br /&gt;
出版商 Springer Verlag&lt;br /&gt;
&lt;br /&gt;
| isbn=9783540441250&lt;br /&gt;
&lt;br /&gt;
| isbn=9783540441250&lt;br /&gt;
&lt;br /&gt;
9783540441250&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last= Jordan&lt;br /&gt;
&lt;br /&gt;
| last= Jordan&lt;br /&gt;
&lt;br /&gt;
最后一个乔丹&lt;br /&gt;
&lt;br /&gt;
| first= D. W.&lt;br /&gt;
&lt;br /&gt;
| first= D. W.&lt;br /&gt;
&lt;br /&gt;
首先是 D.w。&lt;br /&gt;
&lt;br /&gt;
| last2= Smith&lt;br /&gt;
&lt;br /&gt;
| last2= Smith&lt;br /&gt;
&lt;br /&gt;
最后2个史密斯&lt;br /&gt;
&lt;br /&gt;
| first2= P.&lt;br /&gt;
&lt;br /&gt;
| first2= P.&lt;br /&gt;
&lt;br /&gt;
| first2 p.&lt;br /&gt;
&lt;br /&gt;
| year= 2007&lt;br /&gt;
&lt;br /&gt;
| year= 2007&lt;br /&gt;
&lt;br /&gt;
2007年&lt;br /&gt;
&lt;br /&gt;
| edition= fourth&lt;br /&gt;
&lt;br /&gt;
| edition= fourth&lt;br /&gt;
&lt;br /&gt;
第四版&lt;br /&gt;
&lt;br /&gt;
| title= Nonlinear Ordinary Differential Equations&lt;br /&gt;
&lt;br /&gt;
| title= Nonlinear Ordinary Differential Equations&lt;br /&gt;
&lt;br /&gt;
非线性常微分方程&lt;br /&gt;
&lt;br /&gt;
| publisher= Oxford University Press&lt;br /&gt;
&lt;br /&gt;
| publisher= Oxford University Press&lt;br /&gt;
&lt;br /&gt;
牛津大学出版社&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-19-920824-1&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-19-920824-1&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-19-920824-1]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last= Khalil&lt;br /&gt;
&lt;br /&gt;
| last= Khalil&lt;br /&gt;
&lt;br /&gt;
最后的哈利勒&lt;br /&gt;
&lt;br /&gt;
| first= Hassan K.&lt;br /&gt;
&lt;br /&gt;
| first= Hassan K.&lt;br /&gt;
&lt;br /&gt;
首先是哈桑 · k。&lt;br /&gt;
&lt;br /&gt;
| year= 2001&lt;br /&gt;
&lt;br /&gt;
| year= 2001&lt;br /&gt;
&lt;br /&gt;
2001年&lt;br /&gt;
&lt;br /&gt;
| title= Nonlinear Systems&lt;br /&gt;
&lt;br /&gt;
| title= Nonlinear Systems&lt;br /&gt;
&lt;br /&gt;
非线性系统&lt;br /&gt;
&lt;br /&gt;
| publisher= Prentice Hall&lt;br /&gt;
&lt;br /&gt;
| publisher= Prentice Hall&lt;br /&gt;
&lt;br /&gt;
出版商 Prentice Hall&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-13-067389-3&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-13-067389-3&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-13-067389-3]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last= Kreyszig&lt;br /&gt;
&lt;br /&gt;
| last= Kreyszig&lt;br /&gt;
&lt;br /&gt;
| last= Kreyszig&lt;br /&gt;
&lt;br /&gt;
| first= Erwin&lt;br /&gt;
&lt;br /&gt;
| first= Erwin&lt;br /&gt;
&lt;br /&gt;
首先是欧文&lt;br /&gt;
&lt;br /&gt;
| authorlink= Erwin Kreyszig&lt;br /&gt;
&lt;br /&gt;
| authorlink= Erwin Kreyszig&lt;br /&gt;
&lt;br /&gt;
作者 / 链接 Erwin Kreyszig&lt;br /&gt;
&lt;br /&gt;
| year= 1998&lt;br /&gt;
&lt;br /&gt;
| year= 1998&lt;br /&gt;
&lt;br /&gt;
1998年&lt;br /&gt;
&lt;br /&gt;
| title= Advanced Engineering Mathematics&lt;br /&gt;
&lt;br /&gt;
| title= Advanced Engineering Mathematics&lt;br /&gt;
&lt;br /&gt;
高等工程数学&lt;br /&gt;
&lt;br /&gt;
| url= https://archive.org/details/advancedengineer0008krey&lt;br /&gt;
&lt;br /&gt;
| url= https://archive.org/details/advancedengineer0008krey&lt;br /&gt;
&lt;br /&gt;
Https://archive.org/details/advancedengineer0008krey&lt;br /&gt;
&lt;br /&gt;
| url-access= registration&lt;br /&gt;
&lt;br /&gt;
| url-access= registration&lt;br /&gt;
&lt;br /&gt;
访问注册&lt;br /&gt;
&lt;br /&gt;
| publisher= Wiley&lt;br /&gt;
&lt;br /&gt;
| publisher= Wiley&lt;br /&gt;
&lt;br /&gt;
出版商 Wiley&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-471-15496-9&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-471-15496-9&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-471-15496-9]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last= Sontag&lt;br /&gt;
&lt;br /&gt;
| last= Sontag&lt;br /&gt;
&lt;br /&gt;
最后一个桑塔格&lt;br /&gt;
&lt;br /&gt;
| first= Eduardo&lt;br /&gt;
&lt;br /&gt;
| first= Eduardo&lt;br /&gt;
&lt;br /&gt;
首先是爱德华多&lt;br /&gt;
&lt;br /&gt;
| authorlink= Eduardo D. Sontag&lt;br /&gt;
&lt;br /&gt;
| authorlink= Eduardo D. Sontag&lt;br /&gt;
&lt;br /&gt;
作者: Eduardo d. Sontag&lt;br /&gt;
&lt;br /&gt;
| year= 1998&lt;br /&gt;
&lt;br /&gt;
| year= 1998&lt;br /&gt;
&lt;br /&gt;
1998年&lt;br /&gt;
&lt;br /&gt;
| title= Mathematical Control Theory: Deterministic Finite Dimensional Systems. Second Edition&lt;br /&gt;
&lt;br /&gt;
| title= Mathematical Control Theory: Deterministic Finite Dimensional Systems. Second Edition&lt;br /&gt;
&lt;br /&gt;
数学控制理论: 确定性有限维系统。第二版&lt;br /&gt;
&lt;br /&gt;
| publisher= Springer&lt;br /&gt;
&lt;br /&gt;
| publisher= Springer&lt;br /&gt;
&lt;br /&gt;
出版商斯普林格&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-387-98489-6&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-387-98489-6&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-387-98489-6]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
{{Refend}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==External links 外部链接==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[http://www.dodccrp.org/ Command and Control Research Program (CCRP)]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[http://necsi.edu/guide/concepts/linearnonlinear.html New England Complex Systems Institute: Concepts in Complex Systems]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[http://ocw.mit.edu/courses/mathematics/18-353j-nonlinear-dynamics-i-chaos-fall-2012/ Nonlinear Dynamics I: Chaos] at [http://ocw.mit.edu/OcwWeb/index.htm MIT's OpenCourseWare]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[http://www.hedengren.net/research/models.htm Nonlinear Model Library]{{snd}} (in [[MATLAB]]) a Database of Physical Systems&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[http://cnls.lanl.gov/ The Center for Nonlinear Studies at Los Alamos National Laboratory]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Systems science}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Differential equations topics}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Authority control}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
[https://campus.swarma.org/ 集智学园]课程：[https://campus.swarma.org/course/697 非线性动力学与混沌]&lt;br /&gt;
&lt;br /&gt;
非线性动力学和混沌理论是系统发展的，从一阶微分方程及其分岔开始，然后是相平面分析，极限环和它们的分岔，最终得到Lorenz方程，混沌，迭代映射，周期倍增，重整化，分形和奇怪吸引。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
此系列课程由[[斯蒂文·斯特罗加茨 Steven H. Strogatz]]主持，内容包括机械振动，激光，生物节律，超导电路，昆虫爆发，化学振荡器，遗传控制系统，混沌水轮，甚至是使用混乱发送秘密信息的技术。在每种情况下，科学背景都在初级阶段进行解释，并与数学理论紧密结合。&lt;br /&gt;
&lt;br /&gt;
[[Category:Nonlinear systems| ]]&lt;br /&gt;
&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
[[Category:Dynamical systems]]&lt;br /&gt;
&lt;br /&gt;
Category:Dynamical systems&lt;br /&gt;
&lt;br /&gt;
类别: 动力系统&lt;br /&gt;
&lt;br /&gt;
[[Category:Concepts in physics]]&lt;br /&gt;
&lt;br /&gt;
Category:Concepts in physics&lt;br /&gt;
&lt;br /&gt;
分类: 物理概念&lt;br /&gt;
&lt;br /&gt;
&amp;lt;noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;small&amp;gt;This page was moved from [[wikipedia:en:Nonlinear system]]. Its edit history can be viewed at [[非线性系统/edithistory]]&amp;lt;/small&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:待整理页面]]&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E9%9D%9E%E7%BA%BF%E6%80%A7%E7%B3%BB%E7%BB%9F&amp;diff=10613</id>
		<title>非线性系统</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E9%9D%9E%E7%BA%BF%E6%80%A7%E7%B3%BB%E7%BB%9F&amp;diff=10613"/>
		<updated>2020-07-18T02:59:03Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。{{Redirect|Nonlinear dynamics|the journal|Nonlinear Dynamics (journal)}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Complex systems}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{About|&amp;quot;nonlinearity&amp;quot; in mathematics, physics and other sciences|video and film editing|Non-linear editing system|other uses|Nonlinearity (disambiguation)}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In [[mathematics]] and [[science]], a '''nonlinear system''' is a [[system]] in which the change of the output is not [[proportionality (mathematics)|proportional]] to the change of the input.&amp;lt;ref&amp;gt;{{Cite news|url=https://news.mit.edu/2010/explained-linear-0226|title=Explained: Linear and nonlinear systems|work=MIT News|access-date=2018-06-30}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite web|url=https://www.birmingham.ac.uk/research/activity/mathematics/applied-maths/nonlinear-systems.aspx|title=Nonlinear systems, Applied Mathematics - University of Birmingham|website=www.birmingham.ac.uk|language=en-gb|access-date=2018-06-30}}&amp;lt;/ref&amp;gt; Nonlinear problems are of interest to [[engineer]]s, [[biologist]]s,&amp;lt;ref&amp;gt;{{Citation|date=2007|pages=181–276|publisher=Springer Berlin Heidelberg|language=en|doi=10.1007/978-3-540-34153-6_7|isbn=9783540341529|title = The Nonlinear Universe|series = The Frontiers Collection|chapter = Nonlinear Biology}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last=Korenberg|first=Michael J.|last2=Hunter|first2=Ian W.|date=March 1996|title=The identification of nonlinear biological systems: Volterra kernel approaches|journal=Annals of Biomedical Engineering|language=en|volume=24|issue=2|pages=250–268|doi=10.1007/bf02667354|issn=0090-6964}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last=Mosconi|first=Francesco|last2=Julou|first2=Thomas|last3=Desprat|first3=Nicolas|last4=Sinha|first4=Deepak Kumar|last5=Allemand|first5=Jean-François|last6=Vincent Croquette|last7=Bensimon|first7=David|date=2008|title=Some nonlinear challenges in biology|url=http://stacks.iop.org/0951-7715/21/i=8/a=T03|journal=Nonlinearity|language=en|volume=21|issue=8|pages=T131|doi=10.1088/0951-7715/21/8/T03|issn=0951-7715|bibcode=2008Nonli..21..131M}}&amp;lt;/ref&amp;gt; [[physicist]]s,&amp;lt;ref&amp;gt;{{cite journal|last1=Gintautas|first1=V.|title=Resonant forcing of nonlinear systems of differential equations|journal=Chaos|date=2008|volume=18|issue=3|pages=033118|doi=10.1063/1.2964200|pmid=19045456|arxiv=0803.2252|bibcode=2008Chaos..18c3118G}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Stephenson|first1=C.|last2=et.|first2=al.|title=Topological properties of a self-assembled electrical network via ab initio calculation|journal=Sci. Rep.|volume=7|pages=41621|date=2017|doi=10.1038/srep41621|pmid=28155863|pmc=5290745|bibcode=2017NatSR...741621S}}&amp;lt;/ref&amp;gt; [[mathematician]]s, and many other [[scientist]]s because most systems are inherently nonlinear in nature.&amp;lt;ref&amp;gt;{{cite book|last1=de Canete|first1=Javier, Cipriano Galindo, and Inmaculada Garcia-Moral|title=System Engineering and Automation: An Interactive Educational Approach|date=2011|publisher=Springer|location=Berlin|isbn=978-3642202292|page=46|url=https://books.google.com/?id=h8rCQYXGGY8C&amp;amp;pg=PA46&amp;amp;lpg=PA46&amp;amp;dq=most+systems+are+inherently+nonlinear+in+nature#v=onepage&amp;amp;q=most%20systems%20are%20inherently%20nonlinear%20in%20nature&amp;amp;f=false|accessdate=20 January 2018}}&amp;lt;/ref&amp;gt; Nonlinear [[dynamical system]]s, describing changes in variables over time, may appear chaotic, unpredictable, or counterintuitive, contrasting with much simpler [[linear system]]s.&lt;br /&gt;
&lt;br /&gt;
In mathematics and science, a nonlinear system is a system in which the change of the output is not proportional to the change of the input. Nonlinear problems are of interest to engineers, biologists, physicists, mathematicians, and many other scientists because most systems are inherently nonlinear in nature. Nonlinear dynamical systems, describing changes in variables over time, may appear chaotic, unpredictable, or counterintuitive, contrasting with much simpler linear systems.&lt;br /&gt;
&lt;br /&gt;
在数学及科学中，'''非线性系统 Nonlinear System'''是一种输出的变化与输入的变化不成比例的系统。大多数系统在本质上是非线性的，因而非线性问题引起了工程师、生物学家、物理学家、数学家和许多其他科学家的兴趣。描述变量随时间变化的非线性动力系统与较之简单得多的线性系统相比，可能显得混沌、不可预测或违反直觉。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Typically, the behavior of a nonlinear system is described in mathematics by a '''nonlinear system of equations''', which is a set of simultaneous [[equation]]s in which the unknowns (or the unknown functions in the case of [[differential equation]]s) appear as variables of a [[polynomial]] of degree higher than one or in the argument of a [[function (mathematics)|function]] which is not a polynomial of degree one.&lt;br /&gt;
&lt;br /&gt;
Typically, the behavior of a nonlinear system is described in mathematics by a nonlinear system of equations, which is a set of simultaneous equations in which the unknowns (or the unknown functions in the case of differential equations) appear as variables of a polynomial of degree higher than one or in the argument of a function which is not a polynomial of degree one.&lt;br /&gt;
&lt;br /&gt;
通常，非线性系统的行为在数学上是由一组非线性联立方程来描述的，其中未知数（或微分方程中的未知函数）作为一个高于一次的多项式的变量出现，或者作为一个不是一次多项式的函数的论元出现。__[[用户:Dorr|Dorr]]（[[用户讨论:Dorr|讨论]]）后半句不知如何翻译&lt;br /&gt;
&lt;br /&gt;
&amp;lt;font color='blue'&amp;gt;通常，非线性系统的行为在数学上被描述为一组非线性的联立方程组，其中未知数（或微分方程中的未知函数）作为一个高于一次的多项式变量出现，或者作为一个非一次多项式函数的参数出现。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In other words, in a nonlinear system of equations, the equation(s) to be solved cannot be written as a [[linear combination]] of the unknown [[variable (mathematics)|variables]] or [[function (mathematics)|functions]] that appear in them. Systems can be defined as nonlinear, regardless of whether known linear functions appear in the equations. In particular, a differential equation is ''linear'' if it is linear in terms of the unknown function and its derivatives, even if nonlinear in terms of the other variables appearing in it.&lt;br /&gt;
&lt;br /&gt;
In other words, in a nonlinear system of equations, the equation(s) to be solved cannot be written as a linear combination of the unknown variables or functions that appear in them. Systems can be defined as nonlinear, regardless of whether known linear functions appear in the equations. In particular, a differential equation is linear if it is linear in terms of the unknown function and its derivatives, even if nonlinear in terms of the other variables appearing in it.&lt;br /&gt;
&lt;br /&gt;
换句话说，在非线性方程系统中，&amp;lt;font color='red'&amp;gt;要求解&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;待解&amp;lt;/font&amp;gt; 的方程不能被写成未知变量或函数的线性组合。无论方程中是否有已知的线性函数，系统都可以被定义为非线性。特别是当一个微分方程的未知函数及其导数是线性的，即使其他变量是非线性的，也称该方程是线性的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
As nonlinear dynamical equations are difficult to solve, nonlinear systems are commonly approximated by linear equations ([[linearization]]). This works well up to some accuracy and some range for the input values, but some interesting phenomena such as [[soliton]]s, [[chaos theory|chaos]],&amp;lt;ref&amp;gt;[http://ocw.mit.edu/OcwWeb/Earth--Atmospheric--and-Planetary-Sciences/12-006JFall-2006/CourseHome/index.htm Nonlinear Dynamics I: Chaos] {{webarchive|url=https://web.archive.org/web/20080212045134/http://ocw.mit.edu/OcwWeb/Earth--Atmospheric--and-Planetary-Sciences/12-006JFall-2006/CourseHome/index.htm |date=2008-02-12}} at [http://ocw.mit.edu/OcwWeb/index.htm MIT's OpenCourseWare]&amp;lt;/ref&amp;gt; and [[mathematical singularity|singularities]] are hidden by linearization. It follows that some aspects of the dynamic behavior of a nonlinear system can appear to be counterintuitive, unpredictable or even chaotic. Although such chaotic behavior may resemble [[randomness|random]] behavior, it is in fact not random. For example, some aspects of the weather are seen to be chaotic, where simple changes in one part of the system produce complex effects throughout. This nonlinearity is one of the reasons why accurate long-term forecasts are impossible with current technology.&lt;br /&gt;
&lt;br /&gt;
As nonlinear dynamical equations are difficult to solve, nonlinear systems are commonly approximated by linear equations (linearization). This works well up to some accuracy and some range for the input values, but some interesting phenomena such as solitons, chaos, and singularities are hidden by linearization. It follows that some aspects of the dynamic behavior of a nonlinear system can appear to be counterintuitive, unpredictable or even chaotic. Although such chaotic behavior may resemble random behavior, it is in fact not random. For example, some aspects of the weather are seen to be chaotic, where simple changes in one part of the system produce complex effects throughout. This nonlinearity is one of the reasons why accurate long-term forecasts are impossible with current technology.&lt;br /&gt;
&lt;br /&gt;
由于非线性动力学方程难以求解，通常用线性&amp;lt;font color='red'&amp;gt;&amp;lt;s&amp;gt;化&amp;lt;s&amp;gt;(这种解法是线性化(linearization)，此处还是按linear来翻吧)&amp;lt;/font&amp;gt;方程来近似非线性系统（'''线性化 Linearization'''）。&amp;lt;font color='red'&amp;gt;这种方法在一定的精度和范围对输入值效果很好&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;这种方法对于一定范围的输入和某些精度要求下的效果不错&amp;lt;/blue&amp;gt;，但一些有趣的现象如'''孤子 Soliton'''、'''混沌 Chaos'''和'''奇异性 Singularity'''在线性化后被隐藏。因此，非线性系统的动态行为在某些方面可能看起来违反直觉、不可预测、甚至混沌。尽管这种混沌行为可能感觉很像随机行为，但它实际上并不是随机的。例如，天气的某些方面被认为是混沌的，其系统某部分的微小扰动就会产生复杂的影响。这种非线性是目前技术无法进行精确长期预测的原因之一。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Some authors use the term '''nonlinear science''' for the study of nonlinear systems. This term is disputed by others:&lt;br /&gt;
&lt;br /&gt;
Some authors use the term nonlinear science for the study of nonlinear systems. This term is disputed by others:&lt;br /&gt;
&lt;br /&gt;
有些作者用非线性科学这一术语来研究非线性系统。这一术语引起了其他人的争议:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{quote|Using a term like nonlinear science is like referring to the bulk of zoology as the study of [[negation|non]]-elephant animals.|[[Stanislaw Ulam]]&amp;lt;ref&amp;gt;{{cite journal|last1=Campbell|first1=David K.|title=Nonlinear physics: Fresh breather|journal=Nature|date=25 November 2004|volume=432|issue=7016|pages=455–456|doi=10.1038/432455a|pmid=15565139|url=https://zenodo.org/record/1134179|language=en|issn=0028-0836|bibcode=2004Natur.432..455C}}&amp;lt;/ref&amp;gt;}}&lt;br /&gt;
&lt;br /&gt;
“使用‘非线性科学’这样的术语，就如同把动物学里大部分对象称作‘非大象动物’研究一样可笑。”&lt;br /&gt;
&lt;br /&gt;
——'''斯塔尼斯拉夫·乌拉姆 Stanislaw Ulam'''&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Definition 定义==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In [[mathematics]], a [[linear map]] (or ''linear function'') &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; is one which satisfies both of the following properties:&lt;br /&gt;
&lt;br /&gt;
In mathematics, a linear map (or linear function) &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; is one which satisfies both of the following properties:&lt;br /&gt;
&lt;br /&gt;
在数学中，线性映射（或线性函数）&amp;lt;math&amp;gt;f (x)&amp;lt;/math&amp;gt;满足以下两个性质:&lt;br /&gt;
&lt;br /&gt;
*Additivity or [[superposition Principle]]: &amp;lt;math&amp;gt;\textstyle f(x + y) = f(x) + f(y);&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
*Homogeneity: &amp;lt;math&amp;gt;\textstyle f(\alpha x) = \alpha f(x).&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*'''可加性 Additivity'''（'''叠加性 Superposition principle'''）: &amp;lt;math&amp;gt;\textstyle f(x + y) = f(x) + f(y);&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
*'''齐次性 Homogeneity''': &amp;lt;math&amp;gt;\textstyle f(\alpha x) = \alpha f(x).&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Additivity implies homogeneity for any [[rational number|rational]] ''α'', and, for [[continuous function]]s, for any [[real number|real]] ''α''. For a [[complex number|complex]] ''α'', homogeneity does not follow from additivity. For example, an [[antilinear map]] is additive but not homogeneous. The conditions of additivity and homogeneity are often combined in the superposition principle&lt;br /&gt;
&lt;br /&gt;
Additivity implies homogeneity for any rational α, and, for continuous functions, for any real α. For a complex α, homogeneity does not follow from additivity. For example, an antilinear map is additive but not homogeneous. The conditions of additivity and homogeneity are often combined in the superposition principle:&lt;br /&gt;
&lt;br /&gt;
当α是有理数或实数，且&amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt;是连续函数时，由可加性可以推出齐次性。但当α是复数时，可加性不能导出齐次性。例如，反线性映射是可加的，但不是齐次的。可加性和齐次性条件经常组合，称为叠加原理：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;f(\alpha x + \beta y) = \alpha f(x) + \beta f(y)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
An equation written as&lt;br /&gt;
&lt;br /&gt;
对一个写成&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;f(x) = C&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
is called '''linear''' if &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; is a linear map (as defined above) and '''nonlinear''' otherwise. The equation is called ''homogeneous'' if &amp;lt;math&amp;gt;C = 0&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
is called linear if &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; is a linear map (as defined above) and nonlinear otherwise. The equation is called homogeneous if &amp;lt;math&amp;gt;C = 0&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
的方程，若 &amp;lt;math&amp;gt; f (x) &amp;lt;/math&amp;gt; 是线性映射（如上定义） ，则称其为'''线性的 Linear'''，否则称为'''非线性的 Nonlinear'''。若&amp;lt;math&amp;gt;C = 0&amp;lt;/math&amp;gt;，该方程称为是齐次的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The definition &amp;lt;math&amp;gt;f(x) = C&amp;lt;/math&amp;gt; is very general in that &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; can be any sensible mathematical object (number, vector, function, etc.), and the function &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; can literally be any [[map (mathematics)|mapping]], including integration or differentiation with associated constraints (such as [[boundary values]]). If &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; contains [[derivative|differentiation]] with respect to &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt;, the result will be a [[differential equation]].&lt;br /&gt;
&lt;br /&gt;
The definition &amp;lt;math&amp;gt;f(x) = C&amp;lt;/math&amp;gt; is very general in that &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; can be any sensible mathematical object (number, vector, function, etc.), and the function &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; can literally be any mapping, including integration or differentiation with associated constraints (such as boundary values). If &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; contains differentiation with respect to &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt;, the result will be a differential equation.&lt;br /&gt;
&lt;br /&gt;
定义 &amp;lt;math&amp;gt;f(x) = C&amp;lt;/math&amp;gt; 是非常具有一般性的，因为 &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; 可以是任意可感知的数学对象（数字、向量、函数等），函数 &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; 实际上可以是任意映射，包括有相关约束（如给定边界值）的积分或微分。若 &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; 包含对 &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; 的微分运算，则该方程为微分方程。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===相关概念辨析===&lt;br /&gt;
'''线性Linear'''、'''非线性Nonlinear'''、'''亚线性 Sublinear'''、'''超线性 Superlinear'''：描述量与量之间的一种变化关系，例如&amp;lt;math&amp;gt;y=a+b*x^n&amp;lt;/math&amp;gt;，其中&amp;lt;math&amp;gt;n&amp;gt;1&amp;lt;/math&amp;gt;。当&amp;lt;math&amp;gt;n=1&amp;lt;/math&amp;gt;时，表示为线性关系；&amp;lt;math&amp;gt;n\neq 1&amp;lt;/math&amp;gt;时，表示为非线性关系；当&amp;lt;math&amp;gt;0&amp;lt;n&amp;lt;1&amp;lt;/math&amp;gt;时，表示为亚线性关系；当&amp;lt;math&amp;gt;n&amp;gt;1&amp;lt;/math&amp;gt;时，表示为超线性关系。&lt;br /&gt;
&lt;br /&gt;
亚线性与超线性属于非线性变化关系范畴。当两个变量之间存在亚线性关系时，其典型特性是因变量的变化速率会随着自变量的增大而减小，即其一阶导数会随着自变量的增大而减小；两个变量之间存在超线性关系时，其典型特性是因变量的变化速率会随着自变量的增大而增大，即其一阶导数会随着自变量的增大而增大。&lt;br /&gt;
&lt;br /&gt;
在线性系统中，整体等于部分和，描述线性系统的方程满足叠加原理，作用的总和正好等于每一部分作用相加的代数和，这意味着每一部分作用都是独立的、互不相关的；而在普遍存在的非线性系统中，作用的总和不等于每一部分作用相加的代数和，因为系统内部要素之间存在着复杂的非线性相互作用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Nonlinear algebraic equations 非线性代数方程==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Algebraic equation|System of polynomial equations}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Nonlinear [[algebraic equation]]s, which are also called ''[[polynomial equation]]s'', are defined by equating [[polynomial]]s (of degree greater than one) to zero. For example,&lt;br /&gt;
&lt;br /&gt;
Nonlinear algebraic equations, which are also called polynomial equations, are defined by equating polynomials (of degree greater than one) to zero. For example,&lt;br /&gt;
&lt;br /&gt;
非线性'''代数方程 Algebraic Equation'''，又称'''多项式方程 Polynomial Equation'''，由某多项式（次数大于1）等于零定义。例如：&lt;br /&gt;
&lt;br /&gt;
 &lt;br /&gt;
&amp;lt;math&amp;gt;x^2 + x - 1 = 0\,.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
For a single polynomial equation, [[root-finding algorithm]]s can be used to find solutions to the equation (i.e., sets of values for the variables that satisfy the equation). However, systems of algebraic equations are more complicated; their study is one motivation for the field of [[algebraic geometry]], a difficult branch of modern mathematics. It is even difficult to decide whether a given algebraic system has complex solutions (see [[Hilbert's Nullstellensatz]]). Nevertheless, in the case of the systems with a finite number of complex solutions, these [[systems of polynomial equations]] are now well understood and efficient methods exist for solving them.&amp;lt;ref&amp;gt;{{cite journal |last1= Lazard |first1= D. |title= Thirty years of Polynomial System Solving, and now? |doi= 10.1016/j.jsc.2008.03.004 |journal= Journal of Symbolic Computation |volume= 44 |issue= 3 |pages= 222–231 |year= 2009 |pmid= |pmc=}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
For a single polynomial equation, root-finding algorithms can be used to find solutions to the equation (i.e., sets of values for the variables that satisfy the equation). However, systems of algebraic equations are more complicated; their study is one motivation for the field of algebraic geometry, a difficult branch of modern mathematics. It is even difficult to decide whether a given algebraic system has complex solutions (see Hilbert's Nullstellensatz). Nevertheless, in the case of the systems with a finite number of complex solutions, these systems of polynomial equations are now well understood and efficient methods exist for solving them.&lt;br /&gt;
&lt;br /&gt;
对于一个单一的多项式方程，'''求根算法 Root-finding Algorithms'''可用于其求解（即找到满足该方程的变量的值集）。而代数方程组则相对复杂，其研究是现代数学的较难分支——'''代数几何 Algebraic Geometry'''领域的动力之一。甚至很难判断一个给定的代数系统是否有复数解（见'''希尔伯特零点定律  Hilbert's Nullstellensatz'''）。不过，对于具有有限个复数解的系统的多项式方程组，我们现在已经有了充分的理解，并且找到了有效的求解方法。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Nonlinear recurrence relations 非线性递推关系==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A nonlinear [[recurrence relation]] defines successive terms of a [[sequence]] as a nonlinear function of preceding terms. Examples of nonlinear recurrence relations are the [[logistic map]] and the relations that define the various [[Hofstadter sequence]]s. Nonlinear discrete models that represent a wide class of nonlinear recurrence relationships include the NARMAX (Nonlinear Autoregressive Moving Average with eXogenous inputs) model and the related [[nonlinear system identification]] and analysis procedures.&amp;lt;ref name=&amp;quot;SAB1&amp;quot;&amp;gt;Billings S.A. &amp;quot;Nonlinear System Identification: NARMAX Methods in the Time, Frequency, and Spatio-Temporal Domains&amp;quot;. Wiley, 2013&amp;lt;/ref&amp;gt; These approaches can be used to study a wide class of complex nonlinear behaviors in the time, frequency, and spatio-temporal domains.&lt;br /&gt;
&lt;br /&gt;
A nonlinear recurrence relation defines successive terms of a sequence as a nonlinear function of preceding terms. Examples of nonlinear recurrence relations are the logistic map and the relations that define the various Hofstadter sequences. Nonlinear discrete models that represent a wide class of nonlinear recurrence relationships include the NARMAX (Nonlinear Autoregressive Moving Average with eXogenous inputs) model and the related nonlinear system identification and analysis procedures. These approaches can be used to study a wide class of complex nonlinear behaviors in the time, frequency, and spatio-temporal domains.&lt;br /&gt;
&lt;br /&gt;
非线性递归关系中，序列的连续项被定义为其前项的非线性函数。非线性递归关系的例子有 [[logistic 映射]]和定义各种'''霍夫斯塔特序列 Hofstadter Sequences''' 的关系。非线性离散模型代表了一类广泛的非线性递归关系，包括 NARMAX（外部输入非线性自回归移动平均）模型和相关的非线性系统辨识和分析程序。这些方法可用于研究时域、频域和时空域的广泛复杂非线性行为。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Nonlinear differential equations 非线性微分方程==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A [[simultaneous equations|system]] of [[differential equation]]s is said to be nonlinear if it is not a [[linear system]]. Problems involving nonlinear differential equations are extremely diverse, and methods of solution or analysis are problem dependent. Examples of nonlinear differential equations are the [[Navier–Stokes equations]] in fluid dynamics and the [[Lotka–Volterra equation]]s in biology.&lt;br /&gt;
&lt;br /&gt;
A system of differential equations is said to be nonlinear if it is not a linear system. Problems involving nonlinear differential equations are extremely diverse, and methods of solution or analysis are problem dependent. Examples of nonlinear differential equations are the Navier–Stokes equations in fluid dynamics and the Lotka–Volterra equations in biology.&lt;br /&gt;
&lt;br /&gt;
若一个微分方程组不是线性系统，则称其为非线性的。涉及非线性微分方程的问题非常多样，对不同问题的解决或分析方法也不相同。非线性微分方程的例子有流体力学中的 '''纳维-斯托克斯方程 Navier-Stokes Equations'''和生物学中的'''洛特卡－沃尔泰拉方程 Lotka-Volterra Equations'''。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
One of the greatest difficulties of nonlinear problems is that it is not generally possible to combine known solutions into new solutions. In linear problems, for example, a family of [[linearly independent]] solutions can be used to construct general solutions through the [[superposition principle]]. A good example of this is one-dimensional heat transport with [[Dirichlet boundary conditions]], the solution of which can be written as a time-dependent linear combination of sinusoids of differing frequencies; this makes solutions very flexible. It is often possible to find several very specific solutions to nonlinear equations, however the lack of a superposition principle prevents the construction of new solutions.&lt;br /&gt;
&lt;br /&gt;
One of the greatest difficulties of nonlinear problems is that it is not generally possible to combine known solutions into new solutions. In linear problems, for example, a family of linearly independent solutions can be used to construct general solutions through the superposition principle. A good example of this is one-dimensional heat transport with Dirichlet boundary conditions, the solution of which can be written as a time-dependent linear combination of sinusoids of differing frequencies; this makes solutions very flexible. It is often possible to find several very specific solutions to nonlinear equations, however the lack of a superposition principle prevents the construction of new solutions.&lt;br /&gt;
&lt;br /&gt;
非线性问题最大的困难之一是通常不可能将已知的解组合成新的解。例如，在线性问题中，可以根据叠加原理以一族线性独立的解构造通解。一个很好的例子是带有'''狄利克雷边界条件 Dirichlet Boundary Conditions'''的一维热传导问题，其解（随时间变化）可以写成不同频率的正弦波的线性组合，这使得解非常灵活。而对非线性方程，通常可以找到几个非常特殊的解，但是此时叠加原理不适用，故无法构造新的解。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Ordinary differential equations 常微分方程===&lt;br /&gt;
&lt;br /&gt;
First order [[ordinary differential equation]]s are often exactly solvable by [[separation of variables]], especially for autonomous equations. For example, the nonlinear equation&lt;br /&gt;
&lt;br /&gt;
First order ordinary differential equations are often exactly solvable by separation of variables, especially for autonomous equations. For example, the nonlinear equation&lt;br /&gt;
&lt;br /&gt;
一阶常微分方程，尤其是自治方程，通常可以用'''分离变量法  Separation of Variables'''来精确求解。例如，非线性方程&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{d u}{d x} = -u^2&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
has &amp;lt;math&amp;gt;u=\frac{1}{x+C}&amp;lt;/math&amp;gt; as a general solution (and also ''u'' = 0 as a particular solution, corresponding to the limit of the general solution when ''C'' tends to infinity). The equation is nonlinear because it may be written as&lt;br /&gt;
&lt;br /&gt;
has &amp;lt;math&amp;gt;u=\frac{1}{x+C}&amp;lt;/math&amp;gt; as a general solution (and also u = 0 as a particular solution, corresponding to the limit of the general solution when C tends to infinity). The equation is nonlinear because it may be written as&lt;br /&gt;
&lt;br /&gt;
将 &amp;lt;math&amp;gt;u=\frac{1}{x+C}&amp;lt;/math&amp;gt; 作为一般解（也有特解 ''u'' = 0，对应于 ''C'' 趋于无穷时的一般解的极限)。该方程是非线性的，因为它可以改写成&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{du}{d x} + u^2=0&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
and the left-hand side of the equation is not a linear function of ''u'' and its derivatives. Note that if the ''u''&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt; term were replaced with ''u'', the problem would be linear (the [[exponential decay]] problem).&lt;br /&gt;
&lt;br /&gt;
and the left-hand side of the equation is not a linear function of u and its derivatives. Note that if the u&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt; term were replaced with u, the problem would be linear (the exponential decay problem).&lt;br /&gt;
&lt;br /&gt;
方程的左边不是 ''u'' 及其导数的线性函数。注意，若将 ''u''&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt; 项替换为''u''，该问题将变为线性的（'''指数衰减 Exponential Decay'''问题）。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Second and higher order ordinary differential equations (more generally, systems of nonlinear equations) rarely yield [[closed-form expression|closed-form]] solutions, though implicit solutions and solutions involving [[nonelementary integral]]s are encountered.&lt;br /&gt;
&lt;br /&gt;
Second and higher order ordinary differential equations (more generally, systems of nonlinear equations) rarely yield closed-form solutions, though implicit solutions and solutions involving nonelementary integrals are encountered.&lt;br /&gt;
&lt;br /&gt;
二阶和高阶常微分方程（更一般地说，非线性方程组）很少能产生封闭解，而隐式解和非初等函数积分形式的解较为常见。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Common methods for the qualitative analysis of nonlinear ordinary differential equations include:&lt;br /&gt;
&lt;br /&gt;
Common methods for the qualitative analysis of nonlinear ordinary differential equations include:&lt;br /&gt;
&lt;br /&gt;
非线性常微分方程定性分析的常用方法包括:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*Examination of any [[conserved quantities]], especially in [[Hamiltonian system]]s&lt;br /&gt;
&lt;br /&gt;
*检查是否有任意'''守恒量 Conserved Quantities'''（特别是在'''哈密顿系统 Hamiltonian System'''中）&lt;br /&gt;
&lt;br /&gt;
*Examination of dissipative quantities (see [[Lyapunov function]]) analogous to conserved quantities&lt;br /&gt;
&lt;br /&gt;
*检查是否有类似守恒量的耗散量（见'''李亚普诺夫函数 Lyapunov Function'''）&lt;br /&gt;
&lt;br /&gt;
*Linearization via [[Taylor expansion]]&lt;br /&gt;
&lt;br /&gt;
*基于'''泰勒展开 Taylor Expansion'''的线性化&lt;br /&gt;
&lt;br /&gt;
*Change of variables into something easier to study&lt;br /&gt;
&lt;br /&gt;
*将变量进行代换以便更好的进行研究&lt;br /&gt;
&lt;br /&gt;
*[[Bifurcation theory]]&lt;br /&gt;
&lt;br /&gt;
*'''分岔理论 Bifurcation Theory'''&lt;br /&gt;
&lt;br /&gt;
*[[Perturbation theory|Perturbation]] methods (can be applied to algebraic equations too)&lt;br /&gt;
&lt;br /&gt;
*'''摄动理论 Perturbation Theory'''（也可应用于代数方程）&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Partial differential equations 偏微分方程===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{main|Nonlinear partial differential equation}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{See also|List of nonlinear partial differential equations}}&lt;br /&gt;
&lt;br /&gt;
参见：非线性偏微分列表&lt;br /&gt;
&lt;br /&gt;
The most common basic approach to studying nonlinear [[partial differential equation]]s is to change the variables (or otherwise transform the problem) so that the resulting problem is simpler (possibly even linear). Sometimes, the equation may be transformed into one or more [[ordinary differential equation]]s, as seen in [[separation of variables]], which is always useful whether or not the resulting ordinary differential equation(s) is solvable.&lt;br /&gt;
&lt;br /&gt;
The most common basic approach to studying nonlinear partial differential equations is to change the variables (or otherwise transform the problem) so that the resulting problem is simpler (possibly even linear). Sometimes, the equation may be transformed into one or more ordinary differential equations, as seen in separation of variables, which is always useful whether or not the resulting ordinary differential equation(s) is solvable.&lt;br /&gt;
&lt;br /&gt;
研究非线性偏微分方程最常用的基本方法是变量代换（或转换问题），使变换后的问题更简单（甚至可能变为线性的）。有时可以将此类方程转化成一或多个常微分方程（如同分离变量法所示），此时不论得到的常微分方程是否可解，对研究问题总是有用的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Another common (though less mathematic) tactic, often seen in fluid and heat mechanics, is to use [[scale analysis (mathematics)|scale analysis]] to simplify a general, natural equation in a certain specific [[boundary value problem]]. For example, the (very) nonlinear [[Navier-Stokes equations]] can be simplified into one linear partial differential equation in the case of transient, laminar, one dimensional flow in a circular pipe; the scale analysis provides conditions under which the flow is laminar and one dimensional and also yields the simplified equation.&lt;br /&gt;
&lt;br /&gt;
Another common (though less mathematic) tactic, often seen in fluid and heat mechanics, is to use scale analysis to simplify a general, natural equation in a certain specific boundary value problem. For example, the (very) nonlinear Navier-Stokes equations can be simplified into one linear partial differential equation in the case of transient, laminar, one dimensional flow in a circular pipe; the scale analysis provides conditions under which the flow is laminar and one dimensional and also yields the simplified equation.&lt;br /&gt;
&lt;br /&gt;
另一个流体力学和热力学中常见的策略（虽然不是数学上的）是利用'''尺度分析 Scale Analysis'''来在某一特定边界条件下简化一般自然方程。例如，在描述圆管内一维层流的暂态时，非线性的纳维－斯托克斯方程可以简化为一个线性的偏微分方程; 尺度分析提供了层流和一维流动的条件，也产生了简化的方程。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Other methods include examining the [[method of characteristics|characteristics]] and using the methods outlined above for ordinary differential equations.&lt;br /&gt;
&lt;br /&gt;
Other methods include examining the characteristics and using the methods outlined above for ordinary differential equations.&lt;br /&gt;
&lt;br /&gt;
其他方法包括检查特征线法及前面所述研究常微分方程的方法。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Pendula 摆===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Pendulum (mathematics)}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:PendulumLayout.svg.png|thumb|图一：Illustration of a pendulum 摆图解|right|200px]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:PendulumLinearizations.png|thumb|图二：Linearizations of a pendulum 摆的线性化|right|200px]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A classic, extensively studied nonlinear problem is the dynamics of a [[pendulum (mathematics)|pendulum]] under the influence of [[gravity]]. Using [[Lagrangian mechanics]], it may be shown&amp;lt;ref&amp;gt;[http://www.damtp.cam.ac.uk/user/tong/dynamics.html David Tong: Lectures on Classical Dynamics]&amp;lt;/ref&amp;gt; that the motion of a pendulum can be described by the [[dimensionless]] nonlinear equation&lt;br /&gt;
&lt;br /&gt;
A classic, extensively studied nonlinear problem is the dynamics of a pendulum under the influence of gravity. Using Lagrangian mechanics, it may be shown that the motion of a pendulum can be described by the dimensionless nonlinear equation&lt;br /&gt;
&lt;br /&gt;
一个经典的被广泛研究的非线性问题是重力影响下的摆的动力学。利用'''拉格朗日力学 Lagrangian Mechanics'''，可以证明摆的运动可以用无量纲的非线性方程&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{d^2 \theta}{d t^2} + \sin(\theta) = 0&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
where gravity points &amp;quot;downwards&amp;quot; and &amp;lt;math&amp;gt;\theta&amp;lt;/math&amp;gt; is the angle the pendulum forms with its rest position, as shown in the figure at right. One approach to &amp;quot;solving&amp;quot; this equation is to use &amp;lt;math&amp;gt;d\theta/dt&amp;lt;/math&amp;gt; as an [[integrating factor]], which would eventually yield&lt;br /&gt;
&lt;br /&gt;
where gravity points &amp;quot;downwards&amp;quot; and &amp;lt;math&amp;gt;\theta&amp;lt;/math&amp;gt; is the angle the pendulum forms with its rest position, as shown in the figure at right. One approach to &amp;quot;solving&amp;quot; this equation is to use &amp;lt;math&amp;gt;d\theta/dt&amp;lt;/math&amp;gt; as an integrating factor, which would eventually yield&lt;br /&gt;
&lt;br /&gt;
描述，其中重力指向“下方”，&amp;lt;math&amp;gt;\theta&amp;lt;/math&amp;gt; 是摆与其静止位置形成的角度，如右图所示。“解”这个方程的方法之一是用 &amp;lt;math&amp;gt;d\theta/dt&amp;lt;/math&amp;gt; 作为'''积分因子 Integrating Factor'''，最终得&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\int{\frac{d \theta}{\sqrt{C_0 + 2 \cos(\theta)}}} = t + C_1&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
which is an implicit solution involving an [[elliptic integral]]. This &amp;quot;solution&amp;quot; generally does not have many uses because most of the nature of the solution is hidden in the [[nonelementary integral]] (nonelementary unless &amp;lt;math&amp;gt;C_0 = 2&amp;lt;/math&amp;gt;).&lt;br /&gt;
&lt;br /&gt;
which is an implicit solution involving an elliptic integral. This &amp;quot;solution&amp;quot; generally does not have many uses because most of the nature of the solution is hidden in the nonelementary integral (nonelementary unless &amp;lt;math&amp;gt;C_0 = 2&amp;lt;/math&amp;gt;).&lt;br /&gt;
&lt;br /&gt;
这是一个含'''椭圆积分 Elliptic Integral'''的隐式解。这个“解”通常没什么用，因为这个解的大部分性质都隐藏在非初等函数积分中（除非&amp;lt;math&amp;gt;C_0 = 2&amp;lt;/math&amp;gt;，否则是非初等的）。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Another way to approach the problem is to linearize any nonlinearities (the sine function term in this case) at the various points of interest through [[Taylor expansion]]s. For example, the linearization at &amp;lt;math&amp;gt;\theta = 0&amp;lt;/math&amp;gt;, called the small angle approximation, is&lt;br /&gt;
&lt;br /&gt;
Another way to approach the problem is to linearize any nonlinearities (the sine function term in this case) at the various points of interest through Taylor expansions. For example, the linearization at &amp;lt;math&amp;gt;\theta = 0&amp;lt;/math&amp;gt;, called the small angle approximation, is&lt;br /&gt;
&lt;br /&gt;
另一种解决这个问题的方法是利用泰勒展开将任意非线性项（此时为正弦函数项)在某些感兴趣的点线性化。例如，在&amp;lt;math&amp;gt;\theta = 0&amp;lt;/math&amp;gt; 的点附近线性化（称为小角度近似）为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{d^2 \theta}{d t^2} + \theta = 0&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
since &amp;lt;math&amp;gt;\sin(\theta) \approx \theta&amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt;\theta \approx 0&amp;lt;/math&amp;gt;. This is a [[simple harmonic oscillator]] corresponding to oscillations of the pendulum near the bottom of its path. Another linearization would be at &amp;lt;math&amp;gt;\theta = \pi&amp;lt;/math&amp;gt;, corresponding to the pendulum being straight up:&lt;br /&gt;
&lt;br /&gt;
since &amp;lt;math&amp;gt;\sin(\theta) \approx \theta&amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt;\theta \approx 0&amp;lt;/math&amp;gt;. This is a simple harmonic oscillator corresponding to oscillations of the pendulum near the bottom of its path. Another linearization would be at &amp;lt;math&amp;gt;\theta = \pi&amp;lt;/math&amp;gt;, corresponding to the pendulum being straight up:&lt;br /&gt;
&lt;br /&gt;
因为 &amp;lt;math&amp;gt;\theta \approx 0&amp;lt;/math&amp;gt; 时，有 &amp;lt;math&amp;gt;\sin(\theta) \approx \theta&amp;lt;/math&amp;gt;。这是一个'''简谐振子 Simple Harmonic Oscillator''' ，对应于摆在其路径底部附近的摆动。另一种线性化方法是在 &amp;lt;math&amp;gt;\theta = \pi&amp;lt;/math&amp;gt;附近线性化，对应于运动到最高点的摆:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{d^2 \theta}{d t^2} + \pi - \theta = 0&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
since &amp;lt;math&amp;gt;\sin(\theta) \approx \pi - \theta&amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt;\theta \approx \pi&amp;lt;/math&amp;gt;. The solution to this problem involves [[hyperbolic sinusoid]]s, and note that unlike the small angle approximation, this approximation is unstable, meaning that &amp;lt;math&amp;gt;|\theta|&amp;lt;/math&amp;gt; will usually grow without limit, though bounded solutions are possible. This corresponds to the difficulty of balancing a pendulum upright, it is literally an unstable state.&lt;br /&gt;
&lt;br /&gt;
since &amp;lt;math&amp;gt;\sin(\theta) \approx \pi - \theta&amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt;\theta \approx \pi&amp;lt;/math&amp;gt;. The solution to this problem involves hyperbolic sinusoids, and note that unlike the small angle approximation, this approximation is unstable, meaning that &amp;lt;math&amp;gt;|\theta|&amp;lt;/math&amp;gt; will usually grow without limit, though bounded solutions are possible. This corresponds to the difficulty of balancing a pendulum upright, it is literally an unstable state.&lt;br /&gt;
&lt;br /&gt;
因为 &amp;lt;math&amp;gt;\theta \approx \pi&amp;lt;/math&amp;gt; 时，有 &amp;lt;math&amp;gt;\sin(\theta) \approx \pi - \theta&amp;lt;/math&amp;gt;。这个问题的解含双曲正弦曲线；注意到不同于小角度近似，它是不稳定的，这意味着 &amp;lt;math&amp;gt;|\theta|&amp;lt;/math&amp;gt; 通常会无限增长（但解也有可能是有界的）。这就解释了摆在最高点达到平衡的困难，此时实际上是一种不稳定的状态。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
One more interesting linearization is possible around &amp;lt;math&amp;gt;\theta = \pi/2&amp;lt;/math&amp;gt;, around which &amp;lt;math&amp;gt;\sin(\theta) \approx 1&amp;lt;/math&amp;gt;:&lt;br /&gt;
&lt;br /&gt;
One more interesting linearization is possible around &amp;lt;math&amp;gt;\theta = \pi/2&amp;lt;/math&amp;gt;, around which &amp;lt;math&amp;gt;\sin(\theta) \approx 1&amp;lt;/math&amp;gt;:&lt;br /&gt;
&lt;br /&gt;
一个更有趣的线性化可能是在 &amp;lt;math&amp;gt;\theta = \pi/2&amp;lt;/math&amp;gt;附近，此时 &amp;lt;math&amp;gt;\sin(\theta) \approx 1&amp;lt;/math&amp;gt;:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{d^2 \theta}{d t^2} + 1 = 0.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This corresponds to a free fall problem. A very useful qualitative picture of the pendulum's dynamics may be obtained by piecing together such linearizations, as seen in the figure at right. Other techniques may be used to find (exact) [[phase portrait]]s and approximate periods.&lt;br /&gt;
&lt;br /&gt;
This corresponds to a free fall problem. A very useful qualitative picture of the pendulum's dynamics may be obtained by piecing together such linearizations, as seen in the figure at right. Other techniques may be used to find (exact) phase portraits and approximate periods.&lt;br /&gt;
&lt;br /&gt;
这相当于一个自由落体问题。把这样线性化的结果合在一起看，就能得到有关摆的运动的非常有用的图像，如右图所示。利用其他方法寻找（精确的）'''相图  Phase Portrait'''和估计周期。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Types of nonlinear dynamic behaviors 非线性动力学行为的类型==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Amplitude death]] – any oscillations present in the system cease due to some kind of interaction with other system or feedback by the same system&lt;br /&gt;
&lt;br /&gt;
*'''振幅死亡 Amplitude Death'''——系统内的某振荡因系统的自回馈或与其他系统的某种相互作用而停止的现象&lt;br /&gt;
&lt;br /&gt;
*[[Chaos theory|Chaos]] – values of a system cannot be predicted indefinitely far into the future, and fluctuations are [[aperiodic]]&lt;br /&gt;
&lt;br /&gt;
*'''混沌 Chaos'''——系统内的值无法无限期地预测到遥远的未来；波动是非周期性的&lt;br /&gt;
&lt;br /&gt;
*[[Multistability]] – the presence of two or more stable states&lt;br /&gt;
&lt;br /&gt;
*'''多稳态 Multistability'''——两或多个稳态的存在&lt;br /&gt;
&lt;br /&gt;
*[[Soliton]]s – self-reinforcing solitary waves&lt;br /&gt;
&lt;br /&gt;
*'''孤波 Soliton'''s——自增强的孤立波&lt;br /&gt;
&lt;br /&gt;
*[[Limit cycle|Limit cycles]] – asymptotic periodic orbits to which destabilized fixed points are attracted. &lt;br /&gt;
&lt;br /&gt;
*'''极限环 Limit Cycles'''——吸引不稳定不动点的渐近周期轨道&lt;br /&gt;
&lt;br /&gt;
*[[Self-oscillation|Self-oscillations]] - feedback oscillations taking place in open dissipative physical systems.&lt;br /&gt;
&lt;br /&gt;
*'''自激振荡 Self-oscillations'''——开放耗散物理系统中的反馈振荡&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Examples of nonlinear equations 非线性方程的例子==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Div col|colwidth=25em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Algebraic Riccati equation]] 代数黎卡提方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Ball and beam]] system 球杆系统&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Bellman equation]] for optimal policy 最佳策略的贝尔曼方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Boltzmann equation]] 玻尔兹曼方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Colebrook equation]] 科尔布鲁克方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[General relativity]] 广义相对论&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Ginzburg–Landau theory]] 金兹堡-朗道方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Ishimori equation]] 石森方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Kadomtsev–Petviashvili equation]] 卡东穆塞夫-彼得韦亚斯维利方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Korteweg–de Vries equation]] kdV方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Landau–Lifshitz–Gilbert equation]] 朗道-利夫希兹-吉尔伯特方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Liénard equation]] 林纳德方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Navier–Stokes equations]] of [[fluid dynamics]] 流体力学的纳维－斯托克斯方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Nonlinear optics]] 非线性光学&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Nonlinear Schrödinger equation]] 非线性薛定谔方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Power-flow study]] 功率流研究&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Richards equation]] for unsaturated water flow 未饱和层水流的理查氏方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Self-balancing unicycle]] 自平衡独轮车&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Sine-Gordon equation]] 正弦-戈尔登方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Van der Pol oscillator]] 范德波尔振荡器&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Vlasov equation]] 弗拉索夫方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Div col end}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==See also 参见==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Aleksandr Mikhailovich Lyapunov]] 亚历山大·李亚普诺夫&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Dynamical system]] 动态系统&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Feedback]] 反馈&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Initial condition]] 初始条件&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Interaction]] 相互作用&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Linear system]] 线性系统&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Mode coupling]] 模式耦合&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Vector soliton]] 矢量孤子&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Volterra series]] 沃尔泰拉级数&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==References 参考资料==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Reflist|35em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Further reading 进一步阅读==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Refbegin|35em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*{{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| author= [[Diederich Hinrichsen]] and Anthony J. Pritchard&lt;br /&gt;
&lt;br /&gt;
| author= Diederich Hinrichsen and Anthony J. Pritchard&lt;br /&gt;
&lt;br /&gt;
作者 Diederich Hinrichsen 和 Anthony j. Pritchard&lt;br /&gt;
&lt;br /&gt;
| year= 2005&lt;br /&gt;
&lt;br /&gt;
| year= 2005&lt;br /&gt;
&lt;br /&gt;
2005年&lt;br /&gt;
&lt;br /&gt;
| title= Mathematical Systems Theory I - Modelling, State Space Analysis, Stability and Robustness&lt;br /&gt;
&lt;br /&gt;
| title= Mathematical Systems Theory I - Modelling, State Space Analysis, Stability and Robustness&lt;br /&gt;
&lt;br /&gt;
数学系统理论 i-建模，状态空间分析，稳定性和鲁棒性&lt;br /&gt;
&lt;br /&gt;
| publisher= Springer Verlag&lt;br /&gt;
&lt;br /&gt;
| publisher= Springer Verlag&lt;br /&gt;
&lt;br /&gt;
出版商 Springer Verlag&lt;br /&gt;
&lt;br /&gt;
| isbn=9783540441250&lt;br /&gt;
&lt;br /&gt;
| isbn=9783540441250&lt;br /&gt;
&lt;br /&gt;
9783540441250&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last= Jordan&lt;br /&gt;
&lt;br /&gt;
| last= Jordan&lt;br /&gt;
&lt;br /&gt;
最后一个乔丹&lt;br /&gt;
&lt;br /&gt;
| first= D. W.&lt;br /&gt;
&lt;br /&gt;
| first= D. W.&lt;br /&gt;
&lt;br /&gt;
首先是 D.w。&lt;br /&gt;
&lt;br /&gt;
| last2= Smith&lt;br /&gt;
&lt;br /&gt;
| last2= Smith&lt;br /&gt;
&lt;br /&gt;
最后2个史密斯&lt;br /&gt;
&lt;br /&gt;
| first2= P.&lt;br /&gt;
&lt;br /&gt;
| first2= P.&lt;br /&gt;
&lt;br /&gt;
| first2 p.&lt;br /&gt;
&lt;br /&gt;
| year= 2007&lt;br /&gt;
&lt;br /&gt;
| year= 2007&lt;br /&gt;
&lt;br /&gt;
2007年&lt;br /&gt;
&lt;br /&gt;
| edition= fourth&lt;br /&gt;
&lt;br /&gt;
| edition= fourth&lt;br /&gt;
&lt;br /&gt;
第四版&lt;br /&gt;
&lt;br /&gt;
| title= Nonlinear Ordinary Differential Equations&lt;br /&gt;
&lt;br /&gt;
| title= Nonlinear Ordinary Differential Equations&lt;br /&gt;
&lt;br /&gt;
非线性常微分方程&lt;br /&gt;
&lt;br /&gt;
| publisher= Oxford University Press&lt;br /&gt;
&lt;br /&gt;
| publisher= Oxford University Press&lt;br /&gt;
&lt;br /&gt;
牛津大学出版社&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-19-920824-1&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-19-920824-1&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-19-920824-1]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last= Khalil&lt;br /&gt;
&lt;br /&gt;
| last= Khalil&lt;br /&gt;
&lt;br /&gt;
最后的哈利勒&lt;br /&gt;
&lt;br /&gt;
| first= Hassan K.&lt;br /&gt;
&lt;br /&gt;
| first= Hassan K.&lt;br /&gt;
&lt;br /&gt;
首先是哈桑 · k。&lt;br /&gt;
&lt;br /&gt;
| year= 2001&lt;br /&gt;
&lt;br /&gt;
| year= 2001&lt;br /&gt;
&lt;br /&gt;
2001年&lt;br /&gt;
&lt;br /&gt;
| title= Nonlinear Systems&lt;br /&gt;
&lt;br /&gt;
| title= Nonlinear Systems&lt;br /&gt;
&lt;br /&gt;
非线性系统&lt;br /&gt;
&lt;br /&gt;
| publisher= Prentice Hall&lt;br /&gt;
&lt;br /&gt;
| publisher= Prentice Hall&lt;br /&gt;
&lt;br /&gt;
出版商 Prentice Hall&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-13-067389-3&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-13-067389-3&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-13-067389-3]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last= Kreyszig&lt;br /&gt;
&lt;br /&gt;
| last= Kreyszig&lt;br /&gt;
&lt;br /&gt;
| last= Kreyszig&lt;br /&gt;
&lt;br /&gt;
| first= Erwin&lt;br /&gt;
&lt;br /&gt;
| first= Erwin&lt;br /&gt;
&lt;br /&gt;
首先是欧文&lt;br /&gt;
&lt;br /&gt;
| authorlink= Erwin Kreyszig&lt;br /&gt;
&lt;br /&gt;
| authorlink= Erwin Kreyszig&lt;br /&gt;
&lt;br /&gt;
作者 / 链接 Erwin Kreyszig&lt;br /&gt;
&lt;br /&gt;
| year= 1998&lt;br /&gt;
&lt;br /&gt;
| year= 1998&lt;br /&gt;
&lt;br /&gt;
1998年&lt;br /&gt;
&lt;br /&gt;
| title= Advanced Engineering Mathematics&lt;br /&gt;
&lt;br /&gt;
| title= Advanced Engineering Mathematics&lt;br /&gt;
&lt;br /&gt;
高等工程数学&lt;br /&gt;
&lt;br /&gt;
| url= https://archive.org/details/advancedengineer0008krey&lt;br /&gt;
&lt;br /&gt;
| url= https://archive.org/details/advancedengineer0008krey&lt;br /&gt;
&lt;br /&gt;
Https://archive.org/details/advancedengineer0008krey&lt;br /&gt;
&lt;br /&gt;
| url-access= registration&lt;br /&gt;
&lt;br /&gt;
| url-access= registration&lt;br /&gt;
&lt;br /&gt;
访问注册&lt;br /&gt;
&lt;br /&gt;
| publisher= Wiley&lt;br /&gt;
&lt;br /&gt;
| publisher= Wiley&lt;br /&gt;
&lt;br /&gt;
出版商 Wiley&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-471-15496-9&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-471-15496-9&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-471-15496-9]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last= Sontag&lt;br /&gt;
&lt;br /&gt;
| last= Sontag&lt;br /&gt;
&lt;br /&gt;
最后一个桑塔格&lt;br /&gt;
&lt;br /&gt;
| first= Eduardo&lt;br /&gt;
&lt;br /&gt;
| first= Eduardo&lt;br /&gt;
&lt;br /&gt;
首先是爱德华多&lt;br /&gt;
&lt;br /&gt;
| authorlink= Eduardo D. Sontag&lt;br /&gt;
&lt;br /&gt;
| authorlink= Eduardo D. Sontag&lt;br /&gt;
&lt;br /&gt;
作者: Eduardo d. Sontag&lt;br /&gt;
&lt;br /&gt;
| year= 1998&lt;br /&gt;
&lt;br /&gt;
| year= 1998&lt;br /&gt;
&lt;br /&gt;
1998年&lt;br /&gt;
&lt;br /&gt;
| title= Mathematical Control Theory: Deterministic Finite Dimensional Systems. Second Edition&lt;br /&gt;
&lt;br /&gt;
| title= Mathematical Control Theory: Deterministic Finite Dimensional Systems. Second Edition&lt;br /&gt;
&lt;br /&gt;
数学控制理论: 确定性有限维系统。第二版&lt;br /&gt;
&lt;br /&gt;
| publisher= Springer&lt;br /&gt;
&lt;br /&gt;
| publisher= Springer&lt;br /&gt;
&lt;br /&gt;
出版商斯普林格&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-387-98489-6&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-387-98489-6&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-387-98489-6]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
{{Refend}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==External links 外部链接==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[http://www.dodccrp.org/ Command and Control Research Program (CCRP)]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[http://necsi.edu/guide/concepts/linearnonlinear.html New England Complex Systems Institute: Concepts in Complex Systems]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[http://ocw.mit.edu/courses/mathematics/18-353j-nonlinear-dynamics-i-chaos-fall-2012/ Nonlinear Dynamics I: Chaos] at [http://ocw.mit.edu/OcwWeb/index.htm MIT's OpenCourseWare]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[http://www.hedengren.net/research/models.htm Nonlinear Model Library]{{snd}} (in [[MATLAB]]) a Database of Physical Systems&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[http://cnls.lanl.gov/ The Center for Nonlinear Studies at Los Alamos National Laboratory]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Systems science}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Differential equations topics}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Authority control}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
[https://campus.swarma.org/ 集智学园]课程：[https://campus.swarma.org/course/697 非线性动力学与混沌]&lt;br /&gt;
&lt;br /&gt;
非线性动力学和混沌理论是系统发展的，从一阶微分方程及其分岔开始，然后是相平面分析，极限环和它们的分岔，最终得到Lorenz方程，混沌，迭代映射，周期倍增，重整化，分形和奇怪吸引。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
此系列课程由[[斯蒂文·斯特罗加茨 Steven H. Strogatz]]主持，内容包括机械振动，激光，生物节律，超导电路，昆虫爆发，化学振荡器，遗传控制系统，混沌水轮，甚至是使用混乱发送秘密信息的技术。在每种情况下，科学背景都在初级阶段进行解释，并与数学理论紧密结合。&lt;br /&gt;
&lt;br /&gt;
[[Category:Nonlinear systems| ]]&lt;br /&gt;
&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
[[Category:Dynamical systems]]&lt;br /&gt;
&lt;br /&gt;
Category:Dynamical systems&lt;br /&gt;
&lt;br /&gt;
类别: 动力系统&lt;br /&gt;
&lt;br /&gt;
[[Category:Concepts in physics]]&lt;br /&gt;
&lt;br /&gt;
Category:Concepts in physics&lt;br /&gt;
&lt;br /&gt;
分类: 物理概念&lt;br /&gt;
&lt;br /&gt;
&amp;lt;noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;small&amp;gt;This page was moved from [[wikipedia:en:Nonlinear system]]. Its edit history can be viewed at [[非线性系统/edithistory]]&amp;lt;/small&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:待整理页面]]&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E9%9D%9E%E7%BA%BF%E6%80%A7%E7%B3%BB%E7%BB%9F&amp;diff=10609</id>
		<title>非线性系统</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E9%9D%9E%E7%BA%BF%E6%80%A7%E7%B3%BB%E7%BB%9F&amp;diff=10609"/>
		<updated>2020-07-18T02:14:20Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。{{Redirect|Nonlinear dynamics|the journal|Nonlinear Dynamics (journal)}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Complex systems}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{About|&amp;quot;nonlinearity&amp;quot; in mathematics, physics and other sciences|video and film editing|Non-linear editing system|other uses|Nonlinearity (disambiguation)}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In [[mathematics]] and [[science]], a '''nonlinear system''' is a [[system]] in which the change of the output is not [[proportionality (mathematics)|proportional]] to the change of the input.&amp;lt;ref&amp;gt;{{Cite news|url=https://news.mit.edu/2010/explained-linear-0226|title=Explained: Linear and nonlinear systems|work=MIT News|access-date=2018-06-30}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite web|url=https://www.birmingham.ac.uk/research/activity/mathematics/applied-maths/nonlinear-systems.aspx|title=Nonlinear systems, Applied Mathematics - University of Birmingham|website=www.birmingham.ac.uk|language=en-gb|access-date=2018-06-30}}&amp;lt;/ref&amp;gt; Nonlinear problems are of interest to [[engineer]]s, [[biologist]]s,&amp;lt;ref&amp;gt;{{Citation|date=2007|pages=181–276|publisher=Springer Berlin Heidelberg|language=en|doi=10.1007/978-3-540-34153-6_7|isbn=9783540341529|title = The Nonlinear Universe|series = The Frontiers Collection|chapter = Nonlinear Biology}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last=Korenberg|first=Michael J.|last2=Hunter|first2=Ian W.|date=March 1996|title=The identification of nonlinear biological systems: Volterra kernel approaches|journal=Annals of Biomedical Engineering|language=en|volume=24|issue=2|pages=250–268|doi=10.1007/bf02667354|issn=0090-6964}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last=Mosconi|first=Francesco|last2=Julou|first2=Thomas|last3=Desprat|first3=Nicolas|last4=Sinha|first4=Deepak Kumar|last5=Allemand|first5=Jean-François|last6=Vincent Croquette|last7=Bensimon|first7=David|date=2008|title=Some nonlinear challenges in biology|url=http://stacks.iop.org/0951-7715/21/i=8/a=T03|journal=Nonlinearity|language=en|volume=21|issue=8|pages=T131|doi=10.1088/0951-7715/21/8/T03|issn=0951-7715|bibcode=2008Nonli..21..131M}}&amp;lt;/ref&amp;gt; [[physicist]]s,&amp;lt;ref&amp;gt;{{cite journal|last1=Gintautas|first1=V.|title=Resonant forcing of nonlinear systems of differential equations|journal=Chaos|date=2008|volume=18|issue=3|pages=033118|doi=10.1063/1.2964200|pmid=19045456|arxiv=0803.2252|bibcode=2008Chaos..18c3118G}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Stephenson|first1=C.|last2=et.|first2=al.|title=Topological properties of a self-assembled electrical network via ab initio calculation|journal=Sci. Rep.|volume=7|pages=41621|date=2017|doi=10.1038/srep41621|pmid=28155863|pmc=5290745|bibcode=2017NatSR...741621S}}&amp;lt;/ref&amp;gt; [[mathematician]]s, and many other [[scientist]]s because most systems are inherently nonlinear in nature.&amp;lt;ref&amp;gt;{{cite book|last1=de Canete|first1=Javier, Cipriano Galindo, and Inmaculada Garcia-Moral|title=System Engineering and Automation: An Interactive Educational Approach|date=2011|publisher=Springer|location=Berlin|isbn=978-3642202292|page=46|url=https://books.google.com/?id=h8rCQYXGGY8C&amp;amp;pg=PA46&amp;amp;lpg=PA46&amp;amp;dq=most+systems+are+inherently+nonlinear+in+nature#v=onepage&amp;amp;q=most%20systems%20are%20inherently%20nonlinear%20in%20nature&amp;amp;f=false|accessdate=20 January 2018}}&amp;lt;/ref&amp;gt; Nonlinear [[dynamical system]]s, describing changes in variables over time, may appear chaotic, unpredictable, or counterintuitive, contrasting with much simpler [[linear system]]s.&lt;br /&gt;
&lt;br /&gt;
In mathematics and science, a nonlinear system is a system in which the change of the output is not proportional to the change of the input. Nonlinear problems are of interest to engineers, biologists, physicists, mathematicians, and many other scientists because most systems are inherently nonlinear in nature. Nonlinear dynamical systems, describing changes in variables over time, may appear chaotic, unpredictable, or counterintuitive, contrasting with much simpler linear systems.&lt;br /&gt;
&lt;br /&gt;
在数学及科学中，'''非线性系统 Nonlinear System'''是一种输出的变化与输入的变化不成比例的系统。大多数系统在本质上是非线性的，因而非线性问题引起了工程师、生物学家、物理学家、数学家和许多其他科学家的兴趣。描述变量随时间变化的非线性动力系统与较之简单得多的线性系统相比，可能显得混沌、不可预测或违反直觉。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Typically, the behavior of a nonlinear system is described in mathematics by a '''nonlinear system of equations''', which is a set of simultaneous [[equation]]s in which the unknowns (or the unknown functions in the case of [[differential equation]]s) appear as variables of a [[polynomial]] of degree higher than one or in the argument of a [[function (mathematics)|function]] which is not a polynomial of degree one.&lt;br /&gt;
&lt;br /&gt;
Typically, the behavior of a nonlinear system is described in mathematics by a nonlinear system of equations, which is a set of simultaneous equations in which the unknowns (or the unknown functions in the case of differential equations) appear as variables of a polynomial of degree higher than one or in the argument of a function which is not a polynomial of degree one.&lt;br /&gt;
&lt;br /&gt;
通常，非线性系统的行为在数学上是由一组非线性联立方程来描述的，其中未知数（或微分方程中的未知函数）作为一个高于一次的多项式的变量出现，或者作为一个不是一次多项式的函数的论元出现。__[[用户:Dorr|Dorr]]（[[用户讨论:Dorr|讨论]]）后半句不知如何翻译&lt;br /&gt;
&lt;br /&gt;
&amp;lt;font color='blue'&amp;gt;通常，非线性系统的行为在数学上被描述为一组非线性的联立方程组，其中未知数（或微分方程中的未知函数）作为一个高于一次的多项式变量出现，或者作为一个非一次多项式函数的参数出现。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In other words, in a nonlinear system of equations, the equation(s) to be solved cannot be written as a [[linear combination]] of the unknown [[variable (mathematics)|variables]] or [[function (mathematics)|functions]] that appear in them. Systems can be defined as nonlinear, regardless of whether known linear functions appear in the equations. In particular, a differential equation is ''linear'' if it is linear in terms of the unknown function and its derivatives, even if nonlinear in terms of the other variables appearing in it.&lt;br /&gt;
&lt;br /&gt;
In other words, in a nonlinear system of equations, the equation(s) to be solved cannot be written as a linear combination of the unknown variables or functions that appear in them. Systems can be defined as nonlinear, regardless of whether known linear functions appear in the equations. In particular, a differential equation is linear if it is linear in terms of the unknown function and its derivatives, even if nonlinear in terms of the other variables appearing in it.&lt;br /&gt;
&lt;br /&gt;
换句话说，在非线性方程系统中，&amp;lt;font color='red'&amp;gt;要求解&amp;lt;/font&amp;gt; &amp;lt;font color='blue'&amp;gt;待解&amp;lt;/font&amp;gt;的方程不能被写成未知变量或函数的线性组合。无论方程中是否有已知的线性函数，系统都可以被定义为非线性。特别是当一个微分方程的未知函数及其导数是线性的，即使其他变量是非线性的，也称该方程是线性的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
As nonlinear dynamical equations are difficult to solve, nonlinear systems are commonly approximated by linear equations ([[linearization]]). This works well up to some accuracy and some range for the input values, but some interesting phenomena such as [[soliton]]s, [[chaos theory|chaos]],&amp;lt;ref&amp;gt;[http://ocw.mit.edu/OcwWeb/Earth--Atmospheric--and-Planetary-Sciences/12-006JFall-2006/CourseHome/index.htm Nonlinear Dynamics I: Chaos] {{webarchive|url=https://web.archive.org/web/20080212045134/http://ocw.mit.edu/OcwWeb/Earth--Atmospheric--and-Planetary-Sciences/12-006JFall-2006/CourseHome/index.htm |date=2008-02-12}} at [http://ocw.mit.edu/OcwWeb/index.htm MIT's OpenCourseWare]&amp;lt;/ref&amp;gt; and [[mathematical singularity|singularities]] are hidden by linearization. It follows that some aspects of the dynamic behavior of a nonlinear system can appear to be counterintuitive, unpredictable or even chaotic. Although such chaotic behavior may resemble [[randomness|random]] behavior, it is in fact not random. For example, some aspects of the weather are seen to be chaotic, where simple changes in one part of the system produce complex effects throughout. This nonlinearity is one of the reasons why accurate long-term forecasts are impossible with current technology.&lt;br /&gt;
&lt;br /&gt;
As nonlinear dynamical equations are difficult to solve, nonlinear systems are commonly approximated by linear equations (linearization). This works well up to some accuracy and some range for the input values, but some interesting phenomena such as solitons, chaos, and singularities are hidden by linearization. It follows that some aspects of the dynamic behavior of a nonlinear system can appear to be counterintuitive, unpredictable or even chaotic. Although such chaotic behavior may resemble random behavior, it is in fact not random. For example, some aspects of the weather are seen to be chaotic, where simple changes in one part of the system produce complex effects throughout. This nonlinearity is one of the reasons why accurate long-term forecasts are impossible with current technology.&lt;br /&gt;
&lt;br /&gt;
由于非线性动力学方程难以求解，通常用线性化方程来近似非线性系统（'''线性化 Linearization'''）。这种方法在一定的精度和范围对输入值效果很好，但一些有趣的现象如'''孤子 Soliton'''、'''混沌 Chaos'''和'''奇异性 Singularity'''在线性化后被隐藏。因此，非线性系统的动态行为在某些方面可能看起来违反直觉、不可预测、甚至混沌。尽管这种混沌行为可能感觉很像随机行为，但它实际上并不是随机的。例如，天气的某些方面被认为是混沌的，其系统某部分的微小扰动就会产生复杂的影响。这种非线性是目前技术无法进行精确长期预测的原因之一。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Some authors use the term '''nonlinear science''' for the study of nonlinear systems. This term is disputed by others:&lt;br /&gt;
&lt;br /&gt;
Some authors use the term nonlinear science for the study of nonlinear systems. This term is disputed by others:&lt;br /&gt;
&lt;br /&gt;
有些作者用非线性科学这一术语来研究非线性系统。这一术语引起了其他人的争议:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{quote|Using a term like nonlinear science is like referring to the bulk of zoology as the study of [[negation|non]]-elephant animals.|[[Stanislaw Ulam]]&amp;lt;ref&amp;gt;{{cite journal|last1=Campbell|first1=David K.|title=Nonlinear physics: Fresh breather|journal=Nature|date=25 November 2004|volume=432|issue=7016|pages=455–456|doi=10.1038/432455a|pmid=15565139|url=https://zenodo.org/record/1134179|language=en|issn=0028-0836|bibcode=2004Natur.432..455C}}&amp;lt;/ref&amp;gt;}}&lt;br /&gt;
&lt;br /&gt;
“使用‘非线性科学’这样的术语，就如同把动物学里大部分对象称作‘非大象动物’研究一样可笑。”&lt;br /&gt;
&lt;br /&gt;
——'''斯塔尼斯拉夫·乌拉姆 Stanislaw Ulam'''&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Definition 定义==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In [[mathematics]], a [[linear map]] (or ''linear function'') &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; is one which satisfies both of the following properties:&lt;br /&gt;
&lt;br /&gt;
In mathematics, a linear map (or linear function) &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; is one which satisfies both of the following properties:&lt;br /&gt;
&lt;br /&gt;
在数学中，线性映射（或线性函数）&amp;lt;math&amp;gt;f (x)&amp;lt;/math&amp;gt;满足以下两个性质:&lt;br /&gt;
&lt;br /&gt;
*Additivity or [[superposition Principle]]: &amp;lt;math&amp;gt;\textstyle f(x + y) = f(x) + f(y);&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
*Homogeneity: &amp;lt;math&amp;gt;\textstyle f(\alpha x) = \alpha f(x).&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*'''可加性 Additivity'''（'''叠加性 Superposition principle'''）: &amp;lt;math&amp;gt;\textstyle f(x + y) = f(x) + f(y);&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
*'''齐次性 Homogeneity''': &amp;lt;math&amp;gt;\textstyle f(\alpha x) = \alpha f(x).&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Additivity implies homogeneity for any [[rational number|rational]] ''α'', and, for [[continuous function]]s, for any [[real number|real]] ''α''. For a [[complex number|complex]] ''α'', homogeneity does not follow from additivity. For example, an [[antilinear map]] is additive but not homogeneous. The conditions of additivity and homogeneity are often combined in the superposition principle&lt;br /&gt;
&lt;br /&gt;
Additivity implies homogeneity for any rational α, and, for continuous functions, for any real α. For a complex α, homogeneity does not follow from additivity. For example, an antilinear map is additive but not homogeneous. The conditions of additivity and homogeneity are often combined in the superposition principle:&lt;br /&gt;
&lt;br /&gt;
当α是有理数或实数，且&amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt;是连续函数时，由可加性可以推出齐次性。但当α是复数时，可加性不能导出齐次性。例如，反线性映射是可加的，但不是齐次的。可加性和齐次性条件经常组合，称为叠加原理：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;f(\alpha x + \beta y) = \alpha f(x) + \beta f(y)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
An equation written as&lt;br /&gt;
&lt;br /&gt;
对一个写成&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;f(x) = C&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
is called '''linear''' if &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; is a linear map (as defined above) and '''nonlinear''' otherwise. The equation is called ''homogeneous'' if &amp;lt;math&amp;gt;C = 0&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
is called linear if &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; is a linear map (as defined above) and nonlinear otherwise. The equation is called homogeneous if &amp;lt;math&amp;gt;C = 0&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
的方程，若 &amp;lt;math&amp;gt; f (x) &amp;lt;/math&amp;gt; 是线性映射（如上定义） ，则称其为'''线性的 Linear'''，否则称为'''非线性的 Nonlinear'''。若&amp;lt;math&amp;gt;C = 0&amp;lt;/math&amp;gt;，该方程称为是齐次的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The definition &amp;lt;math&amp;gt;f(x) = C&amp;lt;/math&amp;gt; is very general in that &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; can be any sensible mathematical object (number, vector, function, etc.), and the function &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; can literally be any [[map (mathematics)|mapping]], including integration or differentiation with associated constraints (such as [[boundary values]]). If &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; contains [[derivative|differentiation]] with respect to &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt;, the result will be a [[differential equation]].&lt;br /&gt;
&lt;br /&gt;
The definition &amp;lt;math&amp;gt;f(x) = C&amp;lt;/math&amp;gt; is very general in that &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; can be any sensible mathematical object (number, vector, function, etc.), and the function &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; can literally be any mapping, including integration or differentiation with associated constraints (such as boundary values). If &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; contains differentiation with respect to &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt;, the result will be a differential equation.&lt;br /&gt;
&lt;br /&gt;
定义 &amp;lt;math&amp;gt;f(x) = C&amp;lt;/math&amp;gt; 是非常具有一般性的，因为 &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; 可以是任意可感知的数学对象（数字、向量、函数等），函数 &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; 实际上可以是任意映射，包括有相关约束（如给定边界值）的积分或微分。若 &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; 包含对 &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; 的微分运算，则该方程为微分方程。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===相关概念辨析===&lt;br /&gt;
'''线性Linear'''、'''非线性Nonlinear'''、'''亚线性 Sublinear'''、'''超线性 Superlinear'''：描述量与量之间的一种变化关系，例如&amp;lt;math&amp;gt;y=a+b*x^n&amp;lt;/math&amp;gt;，其中&amp;lt;math&amp;gt;n&amp;gt;1&amp;lt;/math&amp;gt;。当&amp;lt;math&amp;gt;n=1&amp;lt;/math&amp;gt;时，表示为线性关系；&amp;lt;math&amp;gt;n\neq 1&amp;lt;/math&amp;gt;时，表示为非线性关系；当&amp;lt;math&amp;gt;0&amp;lt;n&amp;lt;1&amp;lt;/math&amp;gt;时，表示为亚线性关系；当&amp;lt;math&amp;gt;n&amp;gt;1&amp;lt;/math&amp;gt;时，表示为超线性关系。&lt;br /&gt;
&lt;br /&gt;
亚线性与超线性属于非线性变化关系范畴。当两个变量之间存在亚线性关系时，其典型特性是因变量的变化速率会随着自变量的增大而减小，即其一阶导数会随着自变量的增大而减小；两个变量之间存在超线性关系时，其典型特性是因变量的变化速率会随着自变量的增大而增大，即其一阶导数会随着自变量的增大而增大。&lt;br /&gt;
&lt;br /&gt;
在线性系统中，整体等于部分和，描述线性系统的方程满足叠加原理，作用的总和正好等于每一部分作用相加的代数和，这意味着每一部分作用都是独立的、互不相关的；而在普遍存在的非线性系统中，作用的总和不等于每一部分作用相加的代数和，因为系统内部要素之间存在着复杂的非线性相互作用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Nonlinear algebraic equations 非线性代数方程==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Algebraic equation|System of polynomial equations}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Nonlinear [[algebraic equation]]s, which are also called ''[[polynomial equation]]s'', are defined by equating [[polynomial]]s (of degree greater than one) to zero. For example,&lt;br /&gt;
&lt;br /&gt;
Nonlinear algebraic equations, which are also called polynomial equations, are defined by equating polynomials (of degree greater than one) to zero. For example,&lt;br /&gt;
&lt;br /&gt;
非线性'''代数方程 Algebraic Equation'''，又称'''多项式方程 Polynomial Equation'''，由某多项式（次数大于1）等于零定义。例如：&lt;br /&gt;
&lt;br /&gt;
 &lt;br /&gt;
&amp;lt;math&amp;gt;x^2 + x - 1 = 0\,.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
For a single polynomial equation, [[root-finding algorithm]]s can be used to find solutions to the equation (i.e., sets of values for the variables that satisfy the equation). However, systems of algebraic equations are more complicated; their study is one motivation for the field of [[algebraic geometry]], a difficult branch of modern mathematics. It is even difficult to decide whether a given algebraic system has complex solutions (see [[Hilbert's Nullstellensatz]]). Nevertheless, in the case of the systems with a finite number of complex solutions, these [[systems of polynomial equations]] are now well understood and efficient methods exist for solving them.&amp;lt;ref&amp;gt;{{cite journal |last1= Lazard |first1= D. |title= Thirty years of Polynomial System Solving, and now? |doi= 10.1016/j.jsc.2008.03.004 |journal= Journal of Symbolic Computation |volume= 44 |issue= 3 |pages= 222–231 |year= 2009 |pmid= |pmc=}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
For a single polynomial equation, root-finding algorithms can be used to find solutions to the equation (i.e., sets of values for the variables that satisfy the equation). However, systems of algebraic equations are more complicated; their study is one motivation for the field of algebraic geometry, a difficult branch of modern mathematics. It is even difficult to decide whether a given algebraic system has complex solutions (see Hilbert's Nullstellensatz). Nevertheless, in the case of the systems with a finite number of complex solutions, these systems of polynomial equations are now well understood and efficient methods exist for solving them.&lt;br /&gt;
&lt;br /&gt;
对于一个单一的多项式方程，'''求根算法 Root-finding Algorithms'''可用于其求解（即找到满足该方程的变量的值集）。而代数方程组则相对复杂，其研究是现代数学的较难分支——'''代数几何 Algebraic Geometry'''领域的动力之一。甚至很难判断一个给定的代数系统是否有复数解（见'''希尔伯特零点定律  Hilbert's Nullstellensatz'''）。不过，对于具有有限个复数解的系统的多项式方程组，我们现在已经有了充分的理解，并且找到了有效的求解方法。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Nonlinear recurrence relations 非线性递推关系==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A nonlinear [[recurrence relation]] defines successive terms of a [[sequence]] as a nonlinear function of preceding terms. Examples of nonlinear recurrence relations are the [[logistic map]] and the relations that define the various [[Hofstadter sequence]]s. Nonlinear discrete models that represent a wide class of nonlinear recurrence relationships include the NARMAX (Nonlinear Autoregressive Moving Average with eXogenous inputs) model and the related [[nonlinear system identification]] and analysis procedures.&amp;lt;ref name=&amp;quot;SAB1&amp;quot;&amp;gt;Billings S.A. &amp;quot;Nonlinear System Identification: NARMAX Methods in the Time, Frequency, and Spatio-Temporal Domains&amp;quot;. Wiley, 2013&amp;lt;/ref&amp;gt; These approaches can be used to study a wide class of complex nonlinear behaviors in the time, frequency, and spatio-temporal domains.&lt;br /&gt;
&lt;br /&gt;
A nonlinear recurrence relation defines successive terms of a sequence as a nonlinear function of preceding terms. Examples of nonlinear recurrence relations are the logistic map and the relations that define the various Hofstadter sequences. Nonlinear discrete models that represent a wide class of nonlinear recurrence relationships include the NARMAX (Nonlinear Autoregressive Moving Average with eXogenous inputs) model and the related nonlinear system identification and analysis procedures. These approaches can be used to study a wide class of complex nonlinear behaviors in the time, frequency, and spatio-temporal domains.&lt;br /&gt;
&lt;br /&gt;
非线性递归关系中，序列的连续项被定义为其前项的非线性函数。非线性递归关系的例子有 [[logistic 映射]]和定义各种'''霍夫斯塔特序列 Hofstadter Sequences''' 的关系。非线性离散模型代表了一类广泛的非线性递归关系，包括 NARMAX（外部输入非线性自回归移动平均）模型和相关的非线性系统辨识和分析程序。这些方法可用于研究时域、频域和时空域的广泛复杂非线性行为。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Nonlinear differential equations 非线性微分方程==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A [[simultaneous equations|system]] of [[differential equation]]s is said to be nonlinear if it is not a [[linear system]]. Problems involving nonlinear differential equations are extremely diverse, and methods of solution or analysis are problem dependent. Examples of nonlinear differential equations are the [[Navier–Stokes equations]] in fluid dynamics and the [[Lotka–Volterra equation]]s in biology.&lt;br /&gt;
&lt;br /&gt;
A system of differential equations is said to be nonlinear if it is not a linear system. Problems involving nonlinear differential equations are extremely diverse, and methods of solution or analysis are problem dependent. Examples of nonlinear differential equations are the Navier–Stokes equations in fluid dynamics and the Lotka–Volterra equations in biology.&lt;br /&gt;
&lt;br /&gt;
若一个微分方程组不是线性系统，则称其为非线性的。涉及非线性微分方程的问题非常多样，对不同问题的解决或分析方法也不相同。非线性微分方程的例子有流体力学中的 '''纳维-斯托克斯方程 Navier-Stokes Equations'''和生物学中的'''洛特卡－沃尔泰拉方程 Lotka-Volterra Equations'''。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
One of the greatest difficulties of nonlinear problems is that it is not generally possible to combine known solutions into new solutions. In linear problems, for example, a family of [[linearly independent]] solutions can be used to construct general solutions through the [[superposition principle]]. A good example of this is one-dimensional heat transport with [[Dirichlet boundary conditions]], the solution of which can be written as a time-dependent linear combination of sinusoids of differing frequencies; this makes solutions very flexible. It is often possible to find several very specific solutions to nonlinear equations, however the lack of a superposition principle prevents the construction of new solutions.&lt;br /&gt;
&lt;br /&gt;
One of the greatest difficulties of nonlinear problems is that it is not generally possible to combine known solutions into new solutions. In linear problems, for example, a family of linearly independent solutions can be used to construct general solutions through the superposition principle. A good example of this is one-dimensional heat transport with Dirichlet boundary conditions, the solution of which can be written as a time-dependent linear combination of sinusoids of differing frequencies; this makes solutions very flexible. It is often possible to find several very specific solutions to nonlinear equations, however the lack of a superposition principle prevents the construction of new solutions.&lt;br /&gt;
&lt;br /&gt;
非线性问题最大的困难之一是通常不可能将已知的解组合成新的解。例如，在线性问题中，可以根据叠加原理以一族线性独立的解构造通解。一个很好的例子是带有'''狄利克雷边界条件 Dirichlet Boundary Conditions'''的一维热传导问题，其解（随时间变化）可以写成不同频率的正弦波的线性组合，这使得解非常灵活。而对非线性方程，通常可以找到几个非常特殊的解，但是此时叠加原理不适用，故无法构造新的解。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Ordinary differential equations 常微分方程===&lt;br /&gt;
&lt;br /&gt;
First order [[ordinary differential equation]]s are often exactly solvable by [[separation of variables]], especially for autonomous equations. For example, the nonlinear equation&lt;br /&gt;
&lt;br /&gt;
First order ordinary differential equations are often exactly solvable by separation of variables, especially for autonomous equations. For example, the nonlinear equation&lt;br /&gt;
&lt;br /&gt;
一阶常微分方程，尤其是自治方程，通常可以用'''分离变量法  Separation of Variables'''来精确求解。例如，非线性方程&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{d u}{d x} = -u^2&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
has &amp;lt;math&amp;gt;u=\frac{1}{x+C}&amp;lt;/math&amp;gt; as a general solution (and also ''u'' = 0 as a particular solution, corresponding to the limit of the general solution when ''C'' tends to infinity). The equation is nonlinear because it may be written as&lt;br /&gt;
&lt;br /&gt;
has &amp;lt;math&amp;gt;u=\frac{1}{x+C}&amp;lt;/math&amp;gt; as a general solution (and also u = 0 as a particular solution, corresponding to the limit of the general solution when C tends to infinity). The equation is nonlinear because it may be written as&lt;br /&gt;
&lt;br /&gt;
将 &amp;lt;math&amp;gt;u=\frac{1}{x+C}&amp;lt;/math&amp;gt; 作为一般解（也有特解 ''u'' = 0，对应于 ''C'' 趋于无穷时的一般解的极限)。该方程是非线性的，因为它可以改写成&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{du}{d x} + u^2=0&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
and the left-hand side of the equation is not a linear function of ''u'' and its derivatives. Note that if the ''u''&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt; term were replaced with ''u'', the problem would be linear (the [[exponential decay]] problem).&lt;br /&gt;
&lt;br /&gt;
and the left-hand side of the equation is not a linear function of u and its derivatives. Note that if the u&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt; term were replaced with u, the problem would be linear (the exponential decay problem).&lt;br /&gt;
&lt;br /&gt;
方程的左边不是 ''u'' 及其导数的线性函数。注意，若将 ''u''&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt; 项替换为''u''，该问题将变为线性的（'''指数衰减 Exponential Decay'''问题）。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Second and higher order ordinary differential equations (more generally, systems of nonlinear equations) rarely yield [[closed-form expression|closed-form]] solutions, though implicit solutions and solutions involving [[nonelementary integral]]s are encountered.&lt;br /&gt;
&lt;br /&gt;
Second and higher order ordinary differential equations (more generally, systems of nonlinear equations) rarely yield closed-form solutions, though implicit solutions and solutions involving nonelementary integrals are encountered.&lt;br /&gt;
&lt;br /&gt;
二阶和高阶常微分方程（更一般地说，非线性方程组）很少能产生封闭解，而隐式解和非初等函数积分形式的解较为常见。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Common methods for the qualitative analysis of nonlinear ordinary differential equations include:&lt;br /&gt;
&lt;br /&gt;
Common methods for the qualitative analysis of nonlinear ordinary differential equations include:&lt;br /&gt;
&lt;br /&gt;
非线性常微分方程定性分析的常用方法包括:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*Examination of any [[conserved quantities]], especially in [[Hamiltonian system]]s&lt;br /&gt;
&lt;br /&gt;
*检查是否有任意'''守恒量 Conserved Quantities'''（特别是在'''哈密顿系统 Hamiltonian System'''中）&lt;br /&gt;
&lt;br /&gt;
*Examination of dissipative quantities (see [[Lyapunov function]]) analogous to conserved quantities&lt;br /&gt;
&lt;br /&gt;
*检查是否有类似守恒量的耗散量（见'''李亚普诺夫函数 Lyapunov Function'''）&lt;br /&gt;
&lt;br /&gt;
*Linearization via [[Taylor expansion]]&lt;br /&gt;
&lt;br /&gt;
*基于'''泰勒展开 Taylor Expansion'''的线性化&lt;br /&gt;
&lt;br /&gt;
*Change of variables into something easier to study&lt;br /&gt;
&lt;br /&gt;
*将变量进行代换以便更好的进行研究&lt;br /&gt;
&lt;br /&gt;
*[[Bifurcation theory]]&lt;br /&gt;
&lt;br /&gt;
*'''分岔理论 Bifurcation Theory'''&lt;br /&gt;
&lt;br /&gt;
*[[Perturbation theory|Perturbation]] methods (can be applied to algebraic equations too)&lt;br /&gt;
&lt;br /&gt;
*'''摄动理论 Perturbation Theory'''（也可应用于代数方程）&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Partial differential equations 偏微分方程===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{main|Nonlinear partial differential equation}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{See also|List of nonlinear partial differential equations}}&lt;br /&gt;
&lt;br /&gt;
参见：非线性偏微分列表&lt;br /&gt;
&lt;br /&gt;
The most common basic approach to studying nonlinear [[partial differential equation]]s is to change the variables (or otherwise transform the problem) so that the resulting problem is simpler (possibly even linear). Sometimes, the equation may be transformed into one or more [[ordinary differential equation]]s, as seen in [[separation of variables]], which is always useful whether or not the resulting ordinary differential equation(s) is solvable.&lt;br /&gt;
&lt;br /&gt;
The most common basic approach to studying nonlinear partial differential equations is to change the variables (or otherwise transform the problem) so that the resulting problem is simpler (possibly even linear). Sometimes, the equation may be transformed into one or more ordinary differential equations, as seen in separation of variables, which is always useful whether or not the resulting ordinary differential equation(s) is solvable.&lt;br /&gt;
&lt;br /&gt;
研究非线性偏微分方程最常用的基本方法是变量代换（或转换问题），使变换后的问题更简单（甚至可能变为线性的）。有时可以将此类方程转化成一或多个常微分方程（如同分离变量法所示），此时不论得到的常微分方程是否可解，对研究问题总是有用的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Another common (though less mathematic) tactic, often seen in fluid and heat mechanics, is to use [[scale analysis (mathematics)|scale analysis]] to simplify a general, natural equation in a certain specific [[boundary value problem]]. For example, the (very) nonlinear [[Navier-Stokes equations]] can be simplified into one linear partial differential equation in the case of transient, laminar, one dimensional flow in a circular pipe; the scale analysis provides conditions under which the flow is laminar and one dimensional and also yields the simplified equation.&lt;br /&gt;
&lt;br /&gt;
Another common (though less mathematic) tactic, often seen in fluid and heat mechanics, is to use scale analysis to simplify a general, natural equation in a certain specific boundary value problem. For example, the (very) nonlinear Navier-Stokes equations can be simplified into one linear partial differential equation in the case of transient, laminar, one dimensional flow in a circular pipe; the scale analysis provides conditions under which the flow is laminar and one dimensional and also yields the simplified equation.&lt;br /&gt;
&lt;br /&gt;
另一个流体力学和热力学中常见的策略（虽然不是数学上的）是利用'''尺度分析 Scale Analysis'''来在某一特定边界条件下简化一般自然方程。例如，在描述圆管内一维层流的暂态时，非线性的纳维－斯托克斯方程可以简化为一个线性的偏微分方程; 尺度分析提供了层流和一维流动的条件，也产生了简化的方程。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Other methods include examining the [[method of characteristics|characteristics]] and using the methods outlined above for ordinary differential equations.&lt;br /&gt;
&lt;br /&gt;
Other methods include examining the characteristics and using the methods outlined above for ordinary differential equations.&lt;br /&gt;
&lt;br /&gt;
其他方法包括检查特征线法及前面所述研究常微分方程的方法。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Pendula 摆===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Pendulum (mathematics)}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:PendulumLayout.svg.png|thumb|图一：Illustration of a pendulum 摆图解|right|200px]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:PendulumLinearizations.png|thumb|图二：Linearizations of a pendulum 摆的线性化|right|200px]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A classic, extensively studied nonlinear problem is the dynamics of a [[pendulum (mathematics)|pendulum]] under the influence of [[gravity]]. Using [[Lagrangian mechanics]], it may be shown&amp;lt;ref&amp;gt;[http://www.damtp.cam.ac.uk/user/tong/dynamics.html David Tong: Lectures on Classical Dynamics]&amp;lt;/ref&amp;gt; that the motion of a pendulum can be described by the [[dimensionless]] nonlinear equation&lt;br /&gt;
&lt;br /&gt;
A classic, extensively studied nonlinear problem is the dynamics of a pendulum under the influence of gravity. Using Lagrangian mechanics, it may be shown that the motion of a pendulum can be described by the dimensionless nonlinear equation&lt;br /&gt;
&lt;br /&gt;
一个经典的被广泛研究的非线性问题是重力影响下的摆的动力学。利用'''拉格朗日力学 Lagrangian Mechanics'''，可以证明摆的运动可以用无量纲的非线性方程&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{d^2 \theta}{d t^2} + \sin(\theta) = 0&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
where gravity points &amp;quot;downwards&amp;quot; and &amp;lt;math&amp;gt;\theta&amp;lt;/math&amp;gt; is the angle the pendulum forms with its rest position, as shown in the figure at right. One approach to &amp;quot;solving&amp;quot; this equation is to use &amp;lt;math&amp;gt;d\theta/dt&amp;lt;/math&amp;gt; as an [[integrating factor]], which would eventually yield&lt;br /&gt;
&lt;br /&gt;
where gravity points &amp;quot;downwards&amp;quot; and &amp;lt;math&amp;gt;\theta&amp;lt;/math&amp;gt; is the angle the pendulum forms with its rest position, as shown in the figure at right. One approach to &amp;quot;solving&amp;quot; this equation is to use &amp;lt;math&amp;gt;d\theta/dt&amp;lt;/math&amp;gt; as an integrating factor, which would eventually yield&lt;br /&gt;
&lt;br /&gt;
描述，其中重力指向“下方”，&amp;lt;math&amp;gt;\theta&amp;lt;/math&amp;gt; 是摆与其静止位置形成的角度，如右图所示。“解”这个方程的方法之一是用 &amp;lt;math&amp;gt;d\theta/dt&amp;lt;/math&amp;gt; 作为'''积分因子 Integrating Factor'''，最终得&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\int{\frac{d \theta}{\sqrt{C_0 + 2 \cos(\theta)}}} = t + C_1&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
which is an implicit solution involving an [[elliptic integral]]. This &amp;quot;solution&amp;quot; generally does not have many uses because most of the nature of the solution is hidden in the [[nonelementary integral]] (nonelementary unless &amp;lt;math&amp;gt;C_0 = 2&amp;lt;/math&amp;gt;).&lt;br /&gt;
&lt;br /&gt;
which is an implicit solution involving an elliptic integral. This &amp;quot;solution&amp;quot; generally does not have many uses because most of the nature of the solution is hidden in the nonelementary integral (nonelementary unless &amp;lt;math&amp;gt;C_0 = 2&amp;lt;/math&amp;gt;).&lt;br /&gt;
&lt;br /&gt;
这是一个含'''椭圆积分 Elliptic Integral'''的隐式解。这个“解”通常没什么用，因为这个解的大部分性质都隐藏在非初等函数积分中（除非&amp;lt;math&amp;gt;C_0 = 2&amp;lt;/math&amp;gt;，否则是非初等的）。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Another way to approach the problem is to linearize any nonlinearities (the sine function term in this case) at the various points of interest through [[Taylor expansion]]s. For example, the linearization at &amp;lt;math&amp;gt;\theta = 0&amp;lt;/math&amp;gt;, called the small angle approximation, is&lt;br /&gt;
&lt;br /&gt;
Another way to approach the problem is to linearize any nonlinearities (the sine function term in this case) at the various points of interest through Taylor expansions. For example, the linearization at &amp;lt;math&amp;gt;\theta = 0&amp;lt;/math&amp;gt;, called the small angle approximation, is&lt;br /&gt;
&lt;br /&gt;
另一种解决这个问题的方法是利用泰勒展开将任意非线性项（此时为正弦函数项)在某些感兴趣的点线性化。例如，在&amp;lt;math&amp;gt;\theta = 0&amp;lt;/math&amp;gt; 的点附近线性化（称为小角度近似）为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{d^2 \theta}{d t^2} + \theta = 0&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
since &amp;lt;math&amp;gt;\sin(\theta) \approx \theta&amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt;\theta \approx 0&amp;lt;/math&amp;gt;. This is a [[simple harmonic oscillator]] corresponding to oscillations of the pendulum near the bottom of its path. Another linearization would be at &amp;lt;math&amp;gt;\theta = \pi&amp;lt;/math&amp;gt;, corresponding to the pendulum being straight up:&lt;br /&gt;
&lt;br /&gt;
since &amp;lt;math&amp;gt;\sin(\theta) \approx \theta&amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt;\theta \approx 0&amp;lt;/math&amp;gt;. This is a simple harmonic oscillator corresponding to oscillations of the pendulum near the bottom of its path. Another linearization would be at &amp;lt;math&amp;gt;\theta = \pi&amp;lt;/math&amp;gt;, corresponding to the pendulum being straight up:&lt;br /&gt;
&lt;br /&gt;
因为 &amp;lt;math&amp;gt;\theta \approx 0&amp;lt;/math&amp;gt; 时，有 &amp;lt;math&amp;gt;\sin(\theta) \approx \theta&amp;lt;/math&amp;gt;。这是一个'''简谐振子 Simple Harmonic Oscillator''' ，对应于摆在其路径底部附近的摆动。另一种线性化方法是在 &amp;lt;math&amp;gt;\theta = \pi&amp;lt;/math&amp;gt;附近线性化，对应于运动到最高点的摆:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{d^2 \theta}{d t^2} + \pi - \theta = 0&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
since &amp;lt;math&amp;gt;\sin(\theta) \approx \pi - \theta&amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt;\theta \approx \pi&amp;lt;/math&amp;gt;. The solution to this problem involves [[hyperbolic sinusoid]]s, and note that unlike the small angle approximation, this approximation is unstable, meaning that &amp;lt;math&amp;gt;|\theta|&amp;lt;/math&amp;gt; will usually grow without limit, though bounded solutions are possible. This corresponds to the difficulty of balancing a pendulum upright, it is literally an unstable state.&lt;br /&gt;
&lt;br /&gt;
since &amp;lt;math&amp;gt;\sin(\theta) \approx \pi - \theta&amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt;\theta \approx \pi&amp;lt;/math&amp;gt;. The solution to this problem involves hyperbolic sinusoids, and note that unlike the small angle approximation, this approximation is unstable, meaning that &amp;lt;math&amp;gt;|\theta|&amp;lt;/math&amp;gt; will usually grow without limit, though bounded solutions are possible. This corresponds to the difficulty of balancing a pendulum upright, it is literally an unstable state.&lt;br /&gt;
&lt;br /&gt;
因为 &amp;lt;math&amp;gt;\theta \approx \pi&amp;lt;/math&amp;gt; 时，有 &amp;lt;math&amp;gt;\sin(\theta) \approx \pi - \theta&amp;lt;/math&amp;gt;。这个问题的解含双曲正弦曲线；注意到不同于小角度近似，它是不稳定的，这意味着 &amp;lt;math&amp;gt;|\theta|&amp;lt;/math&amp;gt; 通常会无限增长（但解也有可能是有界的）。这就解释了摆在最高点达到平衡的困难，此时实际上是一种不稳定的状态。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
One more interesting linearization is possible around &amp;lt;math&amp;gt;\theta = \pi/2&amp;lt;/math&amp;gt;, around which &amp;lt;math&amp;gt;\sin(\theta) \approx 1&amp;lt;/math&amp;gt;:&lt;br /&gt;
&lt;br /&gt;
One more interesting linearization is possible around &amp;lt;math&amp;gt;\theta = \pi/2&amp;lt;/math&amp;gt;, around which &amp;lt;math&amp;gt;\sin(\theta) \approx 1&amp;lt;/math&amp;gt;:&lt;br /&gt;
&lt;br /&gt;
一个更有趣的线性化可能是在 &amp;lt;math&amp;gt;\theta = \pi/2&amp;lt;/math&amp;gt;附近，此时 &amp;lt;math&amp;gt;\sin(\theta) \approx 1&amp;lt;/math&amp;gt;:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{d^2 \theta}{d t^2} + 1 = 0.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This corresponds to a free fall problem. A very useful qualitative picture of the pendulum's dynamics may be obtained by piecing together such linearizations, as seen in the figure at right. Other techniques may be used to find (exact) [[phase portrait]]s and approximate periods.&lt;br /&gt;
&lt;br /&gt;
This corresponds to a free fall problem. A very useful qualitative picture of the pendulum's dynamics may be obtained by piecing together such linearizations, as seen in the figure at right. Other techniques may be used to find (exact) phase portraits and approximate periods.&lt;br /&gt;
&lt;br /&gt;
这相当于一个自由落体问题。把这样线性化的结果合在一起看，就能得到有关摆的运动的非常有用的图像，如右图所示。利用其他方法寻找（精确的）'''相图  Phase Portrait'''和估计周期。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Types of nonlinear dynamic behaviors 非线性动力学行为的类型==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Amplitude death]] – any oscillations present in the system cease due to some kind of interaction with other system or feedback by the same system&lt;br /&gt;
&lt;br /&gt;
*'''振幅死亡 Amplitude Death'''——系统内的某振荡因系统的自回馈或与其他系统的某种相互作用而停止的现象&lt;br /&gt;
&lt;br /&gt;
*[[Chaos theory|Chaos]] – values of a system cannot be predicted indefinitely far into the future, and fluctuations are [[aperiodic]]&lt;br /&gt;
&lt;br /&gt;
*'''混沌 Chaos'''——系统内的值无法无限期地预测到遥远的未来；波动是非周期性的&lt;br /&gt;
&lt;br /&gt;
*[[Multistability]] – the presence of two or more stable states&lt;br /&gt;
&lt;br /&gt;
*'''多稳态 Multistability'''——两或多个稳态的存在&lt;br /&gt;
&lt;br /&gt;
*[[Soliton]]s – self-reinforcing solitary waves&lt;br /&gt;
&lt;br /&gt;
*'''孤波 Soliton'''s——自增强的孤立波&lt;br /&gt;
&lt;br /&gt;
*[[Limit cycle|Limit cycles]] – asymptotic periodic orbits to which destabilized fixed points are attracted. &lt;br /&gt;
&lt;br /&gt;
*'''极限环 Limit Cycles'''——吸引不稳定不动点的渐近周期轨道&lt;br /&gt;
&lt;br /&gt;
*[[Self-oscillation|Self-oscillations]] - feedback oscillations taking place in open dissipative physical systems.&lt;br /&gt;
&lt;br /&gt;
*'''自激振荡 Self-oscillations'''——开放耗散物理系统中的反馈振荡&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Examples of nonlinear equations 非线性方程的例子==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Div col|colwidth=25em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Algebraic Riccati equation]] 代数黎卡提方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Ball and beam]] system 球杆系统&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Bellman equation]] for optimal policy 最佳策略的贝尔曼方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Boltzmann equation]] 玻尔兹曼方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Colebrook equation]] 科尔布鲁克方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[General relativity]] 广义相对论&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Ginzburg–Landau theory]] 金兹堡-朗道方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Ishimori equation]] 石森方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Kadomtsev–Petviashvili equation]] 卡东穆塞夫-彼得韦亚斯维利方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Korteweg–de Vries equation]] kdV方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Landau–Lifshitz–Gilbert equation]] 朗道-利夫希兹-吉尔伯特方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Liénard equation]] 林纳德方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Navier–Stokes equations]] of [[fluid dynamics]] 流体力学的纳维－斯托克斯方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Nonlinear optics]] 非线性光学&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Nonlinear Schrödinger equation]] 非线性薛定谔方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Power-flow study]] 功率流研究&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Richards equation]] for unsaturated water flow 未饱和层水流的理查氏方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Self-balancing unicycle]] 自平衡独轮车&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Sine-Gordon equation]] 正弦-戈尔登方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Van der Pol oscillator]] 范德波尔振荡器&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Vlasov equation]] 弗拉索夫方程&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Div col end}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==See also 参见==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Aleksandr Mikhailovich Lyapunov]] 亚历山大·李亚普诺夫&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Dynamical system]] 动态系统&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Feedback]] 反馈&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Initial condition]] 初始条件&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Interaction]] 相互作用&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Linear system]] 线性系统&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Mode coupling]] 模式耦合&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Vector soliton]] 矢量孤子&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[[Volterra series]] 沃尔泰拉级数&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==References 参考资料==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Reflist|35em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Further reading 进一步阅读==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Refbegin|35em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*{{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| author= [[Diederich Hinrichsen]] and Anthony J. Pritchard&lt;br /&gt;
&lt;br /&gt;
| author= Diederich Hinrichsen and Anthony J. Pritchard&lt;br /&gt;
&lt;br /&gt;
作者 Diederich Hinrichsen 和 Anthony j. Pritchard&lt;br /&gt;
&lt;br /&gt;
| year= 2005&lt;br /&gt;
&lt;br /&gt;
| year= 2005&lt;br /&gt;
&lt;br /&gt;
2005年&lt;br /&gt;
&lt;br /&gt;
| title= Mathematical Systems Theory I - Modelling, State Space Analysis, Stability and Robustness&lt;br /&gt;
&lt;br /&gt;
| title= Mathematical Systems Theory I - Modelling, State Space Analysis, Stability and Robustness&lt;br /&gt;
&lt;br /&gt;
数学系统理论 i-建模，状态空间分析，稳定性和鲁棒性&lt;br /&gt;
&lt;br /&gt;
| publisher= Springer Verlag&lt;br /&gt;
&lt;br /&gt;
| publisher= Springer Verlag&lt;br /&gt;
&lt;br /&gt;
出版商 Springer Verlag&lt;br /&gt;
&lt;br /&gt;
| isbn=9783540441250&lt;br /&gt;
&lt;br /&gt;
| isbn=9783540441250&lt;br /&gt;
&lt;br /&gt;
9783540441250&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last= Jordan&lt;br /&gt;
&lt;br /&gt;
| last= Jordan&lt;br /&gt;
&lt;br /&gt;
最后一个乔丹&lt;br /&gt;
&lt;br /&gt;
| first= D. W.&lt;br /&gt;
&lt;br /&gt;
| first= D. W.&lt;br /&gt;
&lt;br /&gt;
首先是 D.w。&lt;br /&gt;
&lt;br /&gt;
| last2= Smith&lt;br /&gt;
&lt;br /&gt;
| last2= Smith&lt;br /&gt;
&lt;br /&gt;
最后2个史密斯&lt;br /&gt;
&lt;br /&gt;
| first2= P.&lt;br /&gt;
&lt;br /&gt;
| first2= P.&lt;br /&gt;
&lt;br /&gt;
| first2 p.&lt;br /&gt;
&lt;br /&gt;
| year= 2007&lt;br /&gt;
&lt;br /&gt;
| year= 2007&lt;br /&gt;
&lt;br /&gt;
2007年&lt;br /&gt;
&lt;br /&gt;
| edition= fourth&lt;br /&gt;
&lt;br /&gt;
| edition= fourth&lt;br /&gt;
&lt;br /&gt;
第四版&lt;br /&gt;
&lt;br /&gt;
| title= Nonlinear Ordinary Differential Equations&lt;br /&gt;
&lt;br /&gt;
| title= Nonlinear Ordinary Differential Equations&lt;br /&gt;
&lt;br /&gt;
非线性常微分方程&lt;br /&gt;
&lt;br /&gt;
| publisher= Oxford University Press&lt;br /&gt;
&lt;br /&gt;
| publisher= Oxford University Press&lt;br /&gt;
&lt;br /&gt;
牛津大学出版社&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-19-920824-1&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-19-920824-1&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-19-920824-1]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last= Khalil&lt;br /&gt;
&lt;br /&gt;
| last= Khalil&lt;br /&gt;
&lt;br /&gt;
最后的哈利勒&lt;br /&gt;
&lt;br /&gt;
| first= Hassan K.&lt;br /&gt;
&lt;br /&gt;
| first= Hassan K.&lt;br /&gt;
&lt;br /&gt;
首先是哈桑 · k。&lt;br /&gt;
&lt;br /&gt;
| year= 2001&lt;br /&gt;
&lt;br /&gt;
| year= 2001&lt;br /&gt;
&lt;br /&gt;
2001年&lt;br /&gt;
&lt;br /&gt;
| title= Nonlinear Systems&lt;br /&gt;
&lt;br /&gt;
| title= Nonlinear Systems&lt;br /&gt;
&lt;br /&gt;
非线性系统&lt;br /&gt;
&lt;br /&gt;
| publisher= Prentice Hall&lt;br /&gt;
&lt;br /&gt;
| publisher= Prentice Hall&lt;br /&gt;
&lt;br /&gt;
出版商 Prentice Hall&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-13-067389-3&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-13-067389-3&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-13-067389-3]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last= Kreyszig&lt;br /&gt;
&lt;br /&gt;
| last= Kreyszig&lt;br /&gt;
&lt;br /&gt;
| last= Kreyszig&lt;br /&gt;
&lt;br /&gt;
| first= Erwin&lt;br /&gt;
&lt;br /&gt;
| first= Erwin&lt;br /&gt;
&lt;br /&gt;
首先是欧文&lt;br /&gt;
&lt;br /&gt;
| authorlink= Erwin Kreyszig&lt;br /&gt;
&lt;br /&gt;
| authorlink= Erwin Kreyszig&lt;br /&gt;
&lt;br /&gt;
作者 / 链接 Erwin Kreyszig&lt;br /&gt;
&lt;br /&gt;
| year= 1998&lt;br /&gt;
&lt;br /&gt;
| year= 1998&lt;br /&gt;
&lt;br /&gt;
1998年&lt;br /&gt;
&lt;br /&gt;
| title= Advanced Engineering Mathematics&lt;br /&gt;
&lt;br /&gt;
| title= Advanced Engineering Mathematics&lt;br /&gt;
&lt;br /&gt;
高等工程数学&lt;br /&gt;
&lt;br /&gt;
| url= https://archive.org/details/advancedengineer0008krey&lt;br /&gt;
&lt;br /&gt;
| url= https://archive.org/details/advancedengineer0008krey&lt;br /&gt;
&lt;br /&gt;
Https://archive.org/details/advancedengineer0008krey&lt;br /&gt;
&lt;br /&gt;
| url-access= registration&lt;br /&gt;
&lt;br /&gt;
| url-access= registration&lt;br /&gt;
&lt;br /&gt;
访问注册&lt;br /&gt;
&lt;br /&gt;
| publisher= Wiley&lt;br /&gt;
&lt;br /&gt;
| publisher= Wiley&lt;br /&gt;
&lt;br /&gt;
出版商 Wiley&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-471-15496-9&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-471-15496-9&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-471-15496-9]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last= Sontag&lt;br /&gt;
&lt;br /&gt;
| last= Sontag&lt;br /&gt;
&lt;br /&gt;
最后一个桑塔格&lt;br /&gt;
&lt;br /&gt;
| first= Eduardo&lt;br /&gt;
&lt;br /&gt;
| first= Eduardo&lt;br /&gt;
&lt;br /&gt;
首先是爱德华多&lt;br /&gt;
&lt;br /&gt;
| authorlink= Eduardo D. Sontag&lt;br /&gt;
&lt;br /&gt;
| authorlink= Eduardo D. Sontag&lt;br /&gt;
&lt;br /&gt;
作者: Eduardo d. Sontag&lt;br /&gt;
&lt;br /&gt;
| year= 1998&lt;br /&gt;
&lt;br /&gt;
| year= 1998&lt;br /&gt;
&lt;br /&gt;
1998年&lt;br /&gt;
&lt;br /&gt;
| title= Mathematical Control Theory: Deterministic Finite Dimensional Systems. Second Edition&lt;br /&gt;
&lt;br /&gt;
| title= Mathematical Control Theory: Deterministic Finite Dimensional Systems. Second Edition&lt;br /&gt;
&lt;br /&gt;
数学控制理论: 确定性有限维系统。第二版&lt;br /&gt;
&lt;br /&gt;
| publisher= Springer&lt;br /&gt;
&lt;br /&gt;
| publisher= Springer&lt;br /&gt;
&lt;br /&gt;
出版商斯普林格&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-387-98489-6&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-387-98489-6&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-387-98489-6]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
{{Refend}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==External links 外部链接==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[http://www.dodccrp.org/ Command and Control Research Program (CCRP)]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[http://necsi.edu/guide/concepts/linearnonlinear.html New England Complex Systems Institute: Concepts in Complex Systems]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[http://ocw.mit.edu/courses/mathematics/18-353j-nonlinear-dynamics-i-chaos-fall-2012/ Nonlinear Dynamics I: Chaos] at [http://ocw.mit.edu/OcwWeb/index.htm MIT's OpenCourseWare]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[http://www.hedengren.net/research/models.htm Nonlinear Model Library]{{snd}} (in [[MATLAB]]) a Database of Physical Systems&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
*[http://cnls.lanl.gov/ The Center for Nonlinear Studies at Los Alamos National Laboratory]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Systems science}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Differential equations topics}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Authority control}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
[https://campus.swarma.org/ 集智学园]课程：[https://campus.swarma.org/course/697 非线性动力学与混沌]&lt;br /&gt;
&lt;br /&gt;
非线性动力学和混沌理论是系统发展的，从一阶微分方程及其分岔开始，然后是相平面分析，极限环和它们的分岔，最终得到Lorenz方程，混沌，迭代映射，周期倍增，重整化，分形和奇怪吸引。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
此系列课程由[[斯蒂文·斯特罗加茨 Steven H. Strogatz]]主持，内容包括机械振动，激光，生物节律，超导电路，昆虫爆发，化学振荡器，遗传控制系统，混沌水轮，甚至是使用混乱发送秘密信息的技术。在每种情况下，科学背景都在初级阶段进行解释，并与数学理论紧密结合。&lt;br /&gt;
&lt;br /&gt;
[[Category:Nonlinear systems| ]]&lt;br /&gt;
&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
[[Category:Dynamical systems]]&lt;br /&gt;
&lt;br /&gt;
Category:Dynamical systems&lt;br /&gt;
&lt;br /&gt;
类别: 动力系统&lt;br /&gt;
&lt;br /&gt;
[[Category:Concepts in physics]]&lt;br /&gt;
&lt;br /&gt;
Category:Concepts in physics&lt;br /&gt;
&lt;br /&gt;
分类: 物理概念&lt;br /&gt;
&lt;br /&gt;
&amp;lt;noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;small&amp;gt;This page was moved from [[wikipedia:en:Nonlinear system]]. Its edit history can be viewed at [[非线性系统/edithistory]]&amp;lt;/small&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:待整理页面]]&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E5%8A%A8%E5%8A%9B%E7%B3%BB%E7%BB%9F%E7%90%86%E8%AE%BA_Dynamical_Systems_Theory&amp;diff=10219</id>
		<title>动力系统理论 Dynamical Systems Theory</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E5%8A%A8%E5%8A%9B%E7%B3%BB%E7%BB%9F%E7%90%86%E8%AE%BA_Dynamical_Systems_Theory&amp;diff=10219"/>
		<updated>2020-07-12T02:46:31Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。&lt;br /&gt;
&lt;br /&gt;
{{Use dmy dates|date=May 2019|cs1-dates=y}}&lt;br /&gt;
&lt;br /&gt;
'''Dynamical systems theory''' is an area of [[mathematics]] used to describe the behavior of the  [[complex systems|complex]] [[dynamical system]]s, usually by employing [[differential equations]] or [[difference equations]]. When differential equations are employed, the theory is called [[continuous time|''continuous dynamical systems'']]. From a physical point of view, continuous dynamical systems is a generalization of [[classical mechanics]], a generalization where the [[equations of motion]] are postulated directly and are not constrained to be [[Euler–Lagrange equation]]s of a [[Principle of least action|least action principle]]. When difference equations are employed, the theory is called [[discrete time|''discrete dynamical systems'']]. When the time variable runs over a set that is discrete over some intervals and continuous over other intervals or is any arbitrary time-set such as a [[cantor set]], one gets [[dynamic equations on time scales]]. Some situations may also be modeled by mixed operators, such as [[differential-difference equations]].&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory is an area of mathematics used to describe the behavior of the  complex dynamical systems, usually by employing differential equations or difference equations. When differential equations are employed, the theory is called continuous dynamical systems. From a physical point of view, continuous dynamical systems is a generalization of classical mechanics, a generalization where the equations of motion are postulated directly and are not constrained to be Euler–Lagrange equations of a least action principle. When difference equations are employed, the theory is called discrete dynamical systems. When the time variable runs over a set that is discrete over some intervals and continuous over other intervals or is any arbitrary time-set such as a cantor set, one gets dynamic equations on time scales. Some situations may also be modeled by mixed operators, such as differential-difference equations.&lt;br /&gt;
&lt;br /&gt;
  &lt;br /&gt;
'''动力系统理论 Dynamical Systems Theory'''是一个用来描述复杂动力系统行为的数学领域，通常使用微分方程或差分方程。当采用微分方程时，该理论被称为连续动力系统。从物理学的角度来看，连续动力系统是经典力学的推广，也是运动方程的推广，不受极小作用原理Euler–Lagrange方程的约束。当采用差分方程时，该理论被称为离散动力系统。&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;当时间变量在一个离散的集合上运行，在另一个离散的集合上连续，或者像cantor集一样在任意的时间集合上运行时，人们就能得到时间尺度上的动力方程。&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 当时间变量运行在一个某些区间离散、其他区间连续的集合、或者像cantor集一样任意的时间集合上时，人们就能得到时间尺度上的动力方程。&amp;lt;/font&amp;gt;&lt;br /&gt;
&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;'''算子 Operators'''是一个函数空间到函数空间上的映射O：X→X，广义的讲，对任何函数进行某一项操作都可以认为是一个算子，如求幂次、求微分等。&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;这句话的英文原文在哪里？&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;动力系统的有些情况也可以用'''混合算子 Mixed Operators'''来建模，如微分-差分方程。&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 某些情况下，也可以用'''混合算子 Mixed Operators'''来建模，如微分-差分方程。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This theory deals with the long-term qualitative behavior of dynamical systems, and studies the nature of, and when possible the solutions of, the [[equations of motion]] of systems that are often primarily [[mechanics|mechanical]] or otherwise physical in nature, such as [[planetary orbit]]s and the behaviour of [[electronic circuit]]s, as well as systems that arise in [[biology]], [[economics]], and elsewhere. Much of modern research is focused on the study of [[chaotic system]]s.&lt;br /&gt;
&lt;br /&gt;
This theory deals with the long-term qualitative behavior of dynamical systems, and studies the nature of, and when possible the solutions of, the equations of motion of systems that are often primarily mechanical or otherwise physical in nature, such as planetary orbits and the behaviour of electronic circuits, as well as systems that arise in biology, economics, and elsewhere. Much of modern research is focused on the study of chaotic systems.&lt;br /&gt;
&lt;br /&gt;
这个理论处理动力系统的长期定性行为。&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;如果能够得到解的话，还可以研究系统的运动方程。这些方程通常运用到机械或物理研究领域，如行星轨道和电子电路，以及出现在生物学，经济学和其他地方的系统。&amp;lt;/font&amp;gt;现代的研究大多集中在对混沌系统的研究上。&lt;br /&gt;
&lt;br /&gt;
这个理论处理动力系统的长期定性行为，&amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;并且研究系统的动力方程的规律，努力求得可能的解。这些系统通常是一些自然领域里的机械系统或其他物理系统，例如行星轨道和电子电路，也包括一些生物学、经济学和其他学科里的系统。&amp;lt;/font&amp;gt;现代的研究大多集中在对混沌系统的研究上。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This field of study is also called just ''dynamical systems'', ''mathematical dynamical systems theory'' or the ''mathematical theory of dynamical systems''.&lt;br /&gt;
&lt;br /&gt;
This field of study is also called just dynamical systems, mathematical dynamical systems theory or the mathematical theory of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
这个研究领域也被称为动力系统，数学动力系统理论或动力系统的数学理论。&lt;br /&gt;
&lt;br /&gt;
[[Image:Lorenz attractor yb.svg|thumb|240px|right|The [[Lorenz attractor]] is an example of a [[non-linear]] dynamical system. Studying this system helped give rise to [[chaos theory]].]]&lt;br /&gt;
&lt;br /&gt;
The [[Lorenz attractor is an example of a non-linear dynamical system. Studying this system helped give rise to chaos theory.]]&lt;br /&gt;
&lt;br /&gt;
'''洛伦兹吸引子 Lorenz Attractor'''是非线性动力系统的一个例子。对这个系统的研究产生了混沌理论。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Overview 综述 ==&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory and [[chaos theory]] deal with the long-term qualitative behavior of [[dynamical system]]s. Here, the focus is not on finding precise solutions to the equations defining the dynamical system (which is often hopeless), but rather to answer questions like &amp;quot;Will the system settle down to a steady state in the long term, and if so, what are the possible steady states?&amp;quot;, or &amp;quot;Does the long-term behavior of the system depend on its initial condition?&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory and chaos theory deal with the long-term qualitative behavior of dynamical systems. Here, the focus is not on finding precise solutions to the equations defining the dynamical system (which is often hopeless), but rather to answer questions like &amp;quot;Will the system settle down to a steady state in the long term, and if so, what are the possible steady states?&amp;quot;, or &amp;quot;Does the long-term behavior of the system depend on its initial condition?&amp;quot;&lt;br /&gt;
&lt;br /&gt;
动力系统理论和'''混沌理论 Chaos Theory'''是用来处理动力系统的长期定性行为的理论。寻找动力系统方程的精确解通常是很难达到的。这两个理论的重点不在于找到精确解，而是回答如下的问题，如“系统长期来看是否会稳定下来，如果可以，那么可能的稳定状态是什么样的?”，或“系统长期的行为是否取决于其初始条件?”&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
An important goal is to describe the fixed points, or steady states of a given dynamical system; these are values of the variable that don't change over time. Some of these fixed points are ''attractive'', meaning that if the system starts out in a nearby state, it converges towards the fixed point.&lt;br /&gt;
&lt;br /&gt;
An important goal is to describe the fixed points, or steady states of a given dynamical system; these are values of the variable that don't change over time. Some of these fixed points are attractive, meaning that if the system starts out in a nearby state, it converges towards the fixed point.&lt;br /&gt;
&lt;br /&gt;
描述给定动力系统的不动点或'''&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;定态&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;稳态&amp;lt;/font&amp;gt;Steady States'''是一个重要的目标。不动点或&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;定态&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;稳态&amp;lt;/font&amp;gt;的变量值不会随时间的变化而变化。一些不动点是有吸引力的（attractive），即如果系统的初始值在它的附近，系统最终会收敛到这个不动点。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Similarly, one is interested in ''periodic points'', states of the system that repeat after several timesteps. Periodic points can also be attractive. [[Sharkovskii's theorem]] is an interesting statement about the number of periodic points of a one-dimensional discrete dynamical system.&lt;br /&gt;
&lt;br /&gt;
Similarly, one is interested in periodic points, states of the system that repeat after several timesteps. Periodic points can also be attractive. Sharkovskii's theorem is an interesting statement about the number of periodic points of a one-dimensional discrete dynamical system.&lt;br /&gt;
&lt;br /&gt;
人们还对动力系统的'''周期点 Periodic Points'''感兴趣，&amp;lt;font color='red'&amp;gt;即系统在几个时间步之后会不断重复的状态。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;即系统在重复几个时间步之后的状态。&amp;lt;/font&amp;gt;周期点也可以是有吸引力的。Sharkovskii定理描述了一维离散动力系统的周期点的个数。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Even simple [[nonlinear dynamical system]]s often exhibit seemingly random behavior that has been called ''chaos''.&amp;lt;ref&amp;gt;{{cite journal |last=Grebogi |first=C. |last2=Ott |first2=E. |last3=Yorke |first3=J. |year=1987 |title=Chaos, Strange Attractors, and Fractal Basin Boundaries in Nonlinear Dynamics |journal=[[Science (journal)|Science]] |volume=238 |issue=4827 |pages=632–638 |jstor=1700479 |doi=10.1126/science.238.4827.632 |pmid=17816542 |bibcode=1987Sci...238..632G }}&amp;lt;/ref&amp;gt; The branch of dynamical systems that deals with the clean definition and investigation of chaos is called ''[[chaos theory]]''.&lt;br /&gt;
&lt;br /&gt;
Even simple nonlinear dynamical systems often exhibit seemingly random behavior that has been called chaos. The branch of dynamical systems that deals with the clean definition and investigation of chaos is called chaos theory.&lt;br /&gt;
&lt;br /&gt;
即使是简单的非线性动力系统也常常表现出看似随机的行为，这种行为被称为混沌。混沌理论主要研究混沌的清晰定义和混沌的现象，它是动力系统理论的一个分支。&lt;br /&gt;
&lt;br /&gt;
== History 历史==&lt;br /&gt;
&lt;br /&gt;
The concept of dynamical systems theory has its origins in [[Newtonian mechanics]]. There, as in other natural sciences and engineering disciplines, the evolution rule of dynamical systems is given implicitly by a relation that gives the state of the system only a short time into the future.&lt;br /&gt;
&lt;br /&gt;
The concept of dynamical systems theory has its origins in Newtonian mechanics. There, as in other natural sciences and engineering disciplines, the evolution rule of dynamical systems is given implicitly by a relation that gives the state of the system only a short time into the future.&lt;br /&gt;
&lt;br /&gt;
动态系统理论的概念起源于牛顿运动定律。与其他自然科学和工程学科一样，动力系统的演化规律也是通过一种预测系统在未来很短时间内的状态的关系隐含地给出的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Before the advent of [[computer|fast computing machines]], solving a dynamical system required sophisticated mathematical techniques and could only be accomplished for a small class of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
Before the advent of fast computing machines, solving a dynamical system required sophisticated mathematical techniques and could only be accomplished for a small class of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
在高速计算机器出现之前，解决动力系统问题需要复杂的数学技能，而且还只能解决一小类动力系统问题。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Some excellent presentations of mathematical dynamic system theory include {{harvtxt|Beltrami|1990}}, {{harvtxt|Luenberger|1979}}, {{harvtxt|Padulo|Arbib|1974}}, and {{harvtxt|Strogatz|1994}}.&amp;lt;ref&amp;gt;Jerome R. Busemeyer (2008), [http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html &amp;quot;Dynamic Systems&amp;quot;]. To Appear in: ''Encyclopedia of cognitive science'', Macmillan. Retrieved 8 May 2008.  {{webarchive |url=https://web.archive.org/web/20080613053119/http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html |date=June 13, 2008 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Some excellent presentations of mathematical dynamic system theory include , , , and . To Appear in: ''Encyclopedia of cognitive science'', Macmillan. Retrieved 8 May 2008&lt;br /&gt;
&lt;br /&gt;
优秀的数学动力系统理论包括，，，和。--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|存疑]]）。&lt;br /&gt;
&lt;br /&gt;
&amp;lt;font color='blue'&amp;gt;原文是：Some excellent presentations of mathematical dynamic system theory include Beltrami (1990), Luenberger (1979), Padulo &amp;amp; Arbib (1974), and Strogatz (1994).[2] 是不是在粘贴或解析时内容有丢失？&lt;br /&gt;
&lt;br /&gt;
一些优秀的数学动力系统理论包括贝尔特拉米（Beltrami，1990年），龙伯格(Luenberger，1979年），帕杜罗&amp;amp;阿尔比布（Padulo＆Arbib，1974年）和斯托加茨（Strogatz，1994年）。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Concepts 概念==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Dynamical systems 动力系统===&lt;br /&gt;
&lt;br /&gt;
{{main|Dynamical system (definition)}}&lt;br /&gt;
&lt;br /&gt;
The [[dynamical system]] concept is a mathematical [[formal system|formalization]] for any fixed &amp;quot;rule&amp;quot; that describes the [[time]] dependence of a point's position in its [[ambient space]].  Examples include the [[mathematical model]]s that describe the swinging of a clock pendulum, the flow of water in a pipe, and the number of fish each spring in a lake.&lt;br /&gt;
&lt;br /&gt;
The dynamical system concept is a mathematical formalization for any fixed &amp;quot;rule&amp;quot; that describes the time dependence of a point's position in its ambient space.  Examples include the mathematical models that describe the swinging of a clock pendulum, the flow of water in a pipe, and the number of fish each spring in a lake.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;动力系统是一个对任何描述了点的位置在周围环境随时间变化的“固定”规则的数学式。&amp;lt;/font&amp;gt;&amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;动力系统概念是对描述了一个点的位置在其周围环境中随时间变化的任何“固定”规则的数学形式化。&amp;lt;/font&amp;gt;举例来说，描述钟摆摆动、管道中的水流以及每年春天湖中鱼的数量的数学模型，都属于动力系统的概念范畴。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A dynamical system has a ''state'' determined by a collection of [[real numbers]], or more generally by a [[Set (mathematics)|set]] of [[Point (geometry)|points]] in an appropriate ''state space''.  Small changes in the state of the system correspond to small changes in the numbers.  The numbers are also the coordinates of a geometrical space—a [[manifold]].   The ''evolution rule'' of the dynamical system is a [[function (mathematics)|fixed rule]] that describes what future states follow from the current state.  The rule may be [[Deterministic system (mathematics)|deterministic]] (for a given time interval only one future state follows from the current state) or [[stochastic differential equation|stochastic]] (the evolution of the state is subject to random shocks).&lt;br /&gt;
&lt;br /&gt;
A dynamical system has a state determined by a collection of real numbers, or more generally by a set of points in an appropriate state space.  Small changes in the state of the system correspond to small changes in the numbers.  The numbers are also the coordinates of a geometrical space—a manifold.   The evolution rule of the dynamical system is a fixed rule that describes what future states follow from the current state.  The rule may be deterministic (for a given time interval only one future state follows from the current state) or stochastic (the evolution of the state is subject to random shocks).&lt;br /&gt;
&lt;br /&gt;
动力系统的状态是由一组实数决定的，更广泛地说，是由适当的状态空间中的一组点决定的。系统状态的微小变化对应于数字的变化。这些数字也是几何空间——'''流形 Manifold'''——的坐标组。&amp;lt;font color='red'&amp;gt;动力系统的演化是描述了在当前状态之后出现的未来状态的固定规则。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;动力系统的演化规律是一种固定的规则，它描述了从当前状态得出的未来状态。&amp;lt;/font&amp;gt;这个规则可以是确定性的(在给定的时间间隔内，有且仅有一个未来状态在当前状态之后出现)，或随机性的(状态的演化受到随机因素的影响)。&lt;br /&gt;
&lt;br /&gt;
=== Dynamicism 动态主义===&lt;br /&gt;
&lt;br /&gt;
[[Dynamicism]], also termed the ''dynamic hypothesis'' or the ''dynamic hypothesis in cognitive science'' or ''dynamic cognition'', is a new approach in [[cognitive science]] exemplified by the work of philosopher [[Tim van Gelder]]. It argues that [[differential equations]] are more suited to modelling [[cognition]] than more traditional [[computer]] models.&lt;br /&gt;
&lt;br /&gt;
Dynamicism, also termed the dynamic hypothesis or the dynamic hypothesis in cognitive science or dynamic cognition, is a new approach in cognitive science exemplified by the work of philosopher Tim van Gelder. It argues that differential equations are more suited to modelling cognition than more traditional computer models.&lt;br /&gt;
&lt;br /&gt;
'''动态主义 Dynamicism'''，也称动态假设，&amp;lt;font color='red'&amp;gt;或称认知科学、动态认知中的动态假设，&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;或称认知科学的动态假设或动态认知，&amp;lt;/font&amp;gt;是以哲学家Tim van Gelder的著作为代表的认知科学的一种新取向。动态主义认为微分方程比传统的计算机模型更适合于建立认知模型。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Nonlinear system 非线性系统===&lt;br /&gt;
&lt;br /&gt;
{{main|Nonlinear system}}&lt;br /&gt;
&lt;br /&gt;
In [[mathematics]], a [[nonlinear system]] is a system that is not [[linear system|linear]]—i.e., a system that does not satisfy the [[superposition principle]]. Less technically, a nonlinear system is any problem where the variable(s) to solve for cannot be written as a linear sum of independent components. A [[Homogeneity (physics)|nonhomogeneous]] system, which is linear apart from the presence of a function of the [[independent variable]]s, is nonlinear according to a strict definition, but such systems are usually studied alongside linear systems, because they can be transformed to a linear system as long as a particular solution is known.&lt;br /&gt;
&lt;br /&gt;
In mathematics, a nonlinear system is a system that is not linear—i.e., a system that does not satisfy the superposition principle. Less technically, a nonlinear system is any problem where the variable(s) to solve for cannot be written as a linear sum of independent components. A nonhomogeneous system, which is linear apart from the presence of a function of the independent variables, is nonlinear according to a strict definition, but such systems are usually studied alongside linear systems, because they can be transformed to a linear system as long as a particular solution is known.&lt;br /&gt;
&lt;br /&gt;
在数学中，'''非线性系统 Nonlinear System'''是指系统不是线性的——也就是说，一个不满足叠加原理的系统。更通俗地说，非线性系统是待求解变量不能被写成其独立分量的线性和的系统。非齐次系统根据定义严格来说是非线性的，除了它的自变量&amp;lt;font color='red'&amp;gt;&amp;lt;s&amp;gt;包含&amp;lt;/s&amp;gt;&amp;lt;/font&amp;gt;函数以外其他部分都是线性的。&amp;lt;font color='red'&amp;gt;但非齐次系统通常与线性系统一起研究，因为只要知道特解，它们就可以转化为线性系统。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;但非齐次系统通常可当做线性系统进行研究，因为只要知道特定解，它就可以转化为线性系统。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Related fields 相关领域==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Arithmetic dynamics &amp;lt;font color='red'&amp;gt;算术动态系统&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;算术动力学&amp;lt;/font&amp;gt;===&lt;br /&gt;
&lt;br /&gt;
:[[Arithmetic dynamics]] is a field that emerged in the 1990s that amalgamates two areas of mathematics, [[dynamical systems]] and [[number theory]]. Classically, discrete dynamics refers to the study of the [[Iterated function|iteration]] of self-maps of the [[complex plane]] or [[real line]]. Arithmetic dynamics is the study of the number-theoretic properties of integer, rational, {{math|&amp;lt;var&amp;gt;p&amp;lt;/var&amp;gt;}}-adic, and/or algebraic points under repeated application of a [[polynomial]] or [[rational function]].&lt;br /&gt;
&lt;br /&gt;
Arithmetic dynamics is a field that emerged in the 1990s that amalgamates two areas of mathematics, dynamical systems and number theory. Classically, discrete dynamics refers to the study of the iteration of self-maps of the complex plane or real line. Arithmetic dynamics is the study of the number-theoretic properties of integer, rational, -adic, and/or algebraic points under repeated application of a polynomial or rational function.&lt;br /&gt;
&lt;br /&gt;
'''&amp;lt;font color='red'&amp;gt;算术动态系统&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;算术动力学&amp;lt;/font&amp;gt; Arithmetic Dynamics'''是20世纪90年代出现的一个领域，融合了动力系统和数论这两个数学领域。经典的离散动力学研究复平面或&amp;lt;font color='blue'&amp;gt;实直线&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;实数轴&amp;lt;/font&amp;gt;的自映射的迭代。&amp;lt;font color='red'&amp;gt;算术动态系统研究内容是在多项式或有理函数中的整数、有理数、并元 --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|存疑]]） 和/或代数点的数论性质。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;算术动力学是在反复应用多项式或有理函数的情况下研究整数，有理数，p进数(p-adic)和/或代数点的数论性质。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Chaos theory 混沌理论===&lt;br /&gt;
&lt;br /&gt;
:[[Chaos theory]] describes the behavior of certain [[dynamical system (definition)|dynamical system]]s – that is, systems whose state evolves with time – that may exhibit dynamics that are highly sensitive to initial conditions (popularly referred to as the [[butterfly effect]]). As a result of this sensitivity, which manifests itself as an exponential growth of perturbations in the initial conditions, the behavior of chaotic systems appears [[randomness|random]]. This happens even though these systems are [[deterministic system (philosophy)|deterministic]], meaning that their future dynamics are fully defined by their initial conditions, with no random elements involved. This behavior is known as deterministic chaos, or simply ''chaos''.&lt;br /&gt;
&lt;br /&gt;
Chaos theory describes the behavior of certain dynamical systems – that is, systems whose state evolves with time – that may exhibit dynamics that are highly sensitive to initial conditions (popularly referred to as the butterfly effect). As a result of this sensitivity, which manifests itself as an exponential growth of perturbations in the initial conditions, the behavior of chaotic systems appears random. This happens even though these systems are deterministic, meaning that their future dynamics are fully defined by their initial conditions, with no random elements involved. This behavior is known as deterministic chaos, or simply chaos.&lt;br /&gt;
&lt;br /&gt;
混沌理论描述了某些状态随时间演化的动力系统的行为，这些系统可能表现出对初始条件高度敏感的特点（通常被称为'''蝴蝶效应 Butterfly Effect'''）。由于扰动受初始条件影响而指数增长，因此混沌系统具有敏感性，敏感性使它的行为看起来是随机的。但是这种敏感性也会出现在确定的动力系统中，即&amp;lt;font color='blue'&amp;gt;它们&amp;lt;/font&amp;gt;未来的动力学&amp;lt;font color='blue'&amp;gt;变化&amp;lt;/font&amp;gt;完全由它的初始条件定义，没有任何随机因素参与的系统中。这种现象被称为确定性混沌，或简单混沌。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Complex systems 复杂系统===&lt;br /&gt;
&lt;br /&gt;
:[[Complex systems]] is a scientific field that studies the common properties of [[system]]s considered [[Complexity|complex]] in [[nature]], [[society]], and [[science]]. It is also called ''complex systems theory'', ''complexity science'', ''study of complex systems'' and/or ''sciences of complexity''. The key problems of such systems are  difficulties with their formal [[Scientific modelling|modeling]] and [[simulation]]. From such perspective, in different research contexts complex systems are defined on the base of their different attributes.&lt;br /&gt;
&lt;br /&gt;
Complex systems is a scientific field that studies the common properties of systems considered complex in nature, society, and science. It is also called complex systems theory, complexity science, study of complex systems and/or sciences of complexity. The key problems of such systems are  difficulties with their formal modeling and simulation. From such perspective, in different research contexts complex systems are defined on the base of their different attributes.&lt;br /&gt;
&lt;br /&gt;
'''复杂系统 Complex Systems'''是研究自然、社会和科学中复杂现象的共同性质的科学领域。它也被称为复杂系统理论、复杂性科学、复杂系统研究和关于复杂性的科学。这些系统的关键问题在于对系统的形式化建模与仿真&amp;lt;font color='blue'&amp;gt;的困难&amp;lt;/font&amp;gt;。因此，复杂系统是根据在不同的研究语境中的不同属性来定义的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
:The study of complex systems is bringing new vitality to many areas of science where a more typical [[reductionist]] strategy has fallen short. ''Complex systems'' is therefore often used as a broad term encompassing a research approach to problems in many diverse disciplines including [[neurosciences]], [[social sciences]], [[meteorology]], [[chemistry]], [[physics]], [[computer science]], [[psychology]], [[artificial life]], [[evolutionary computation]], [[economics]], earthquake prediction, [[molecular biology]] and inquiries into the nature of living [[cell (biology)|cell]]s themselves.&lt;br /&gt;
&lt;br /&gt;
The study of complex systems is bringing new vitality to many areas of science where a more typical reductionist strategy has fallen short. Complex systems is therefore often used as a broad term encompassing a research approach to problems in many diverse disciplines including neurosciences, social sciences, meteorology, chemistry, physics, computer science, psychology, artificial life, evolutionary computation, economics, earthquake prediction, molecular biology and inquiries into the nature of living cells themselves.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;font color='red'&amp;gt;还原论策略已经不足以研究许多科学领域的问题，而复杂系统的研究则为科学带来了广泛的新活力。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;复杂系统的研究为许多科学领域带来了新的活力，在这些领域中，更为典型的还原论策略已经不足。&amp;lt;/font&amp;gt;复杂系统通常被用作一个应用广泛的研究方法术语，并涵盖许多不同的学科，包括神经科学、社会科学、气象学、化学、物理学、计算机科学、心理学、人工生命、进化计算、经济学、地震预测、分子生物学以及对活细胞的研究等。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Control theory 控制理论===&lt;br /&gt;
&lt;br /&gt;
:[[Control theory]] is an interdisciplinary branch of [[engineering]] and [[mathematics]], in part it deals with influencing the behavior of [[dynamical system]]s.&lt;br /&gt;
&lt;br /&gt;
Control theory is an interdisciplinary branch of engineering and mathematics, in part it deals with influencing the behavior of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
'''控制理论 Control Theory'''是工程和数学的一个交叉学科，它的其中一部分研究影响动力系统行为的各种因素。&lt;br /&gt;
&lt;br /&gt;
控制理论是一个研究如何调整动态系统特性的理论，它也是工程和数学的一个交叉学科，逐渐的应用在许多社会科学中，例如心理学、社会学（社会学中的控制理论）、犯罪学及'''金融系统 Financial System'''。控制理论一般的目的是借由控制器的动作让系统稳定，也就是系统维持在设定值，而且不会在设定值附近晃动。设定值一般维持不变的控制称为调节，设定值快速变化，要求跟踪速度加速度等的控制称为伺服。它的其中一部分研究影响动力系统行为的各种因素。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Ergodic theory 遍历理论===&lt;br /&gt;
&lt;br /&gt;
:[[Ergodic theory]] is a branch of [[mathematics]] that studies [[dynamical system]]s with an [[invariant measure]] and related problems. Its initial development was motivated by problems of [[statistical physics]].&lt;br /&gt;
&lt;br /&gt;
Ergodic theory is a branch of mathematics that studies dynamical systems with an invariant measure and related problems. Its initial development was motivated by problems of statistical physics.&lt;br /&gt;
&lt;br /&gt;
'''遍历理论 Ergodic Theory'''是数学的一个分支，研究有不变测度和相关问题的动力系统。它最初的发展受到了统计物理学的推动。&lt;br /&gt;
遍历理论是研究保测变换的渐近性态的数学分支。它起源于为统计力学提供基础的&amp;quot;遍历假设&amp;quot;研究，并与动力系统理论、概率论、信息论、泛函分析、数论等数学分支有着密切的联系。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Functional analysis 泛函分析===&lt;br /&gt;
&lt;br /&gt;
:[[Functional analysis]] is the branch of [[mathematics]], and specifically of [[mathematical analysis|analysis]], concerned with the study of [[vector space]]s and [[operator (mathematics)|operator]]s acting upon them. It has its historical roots in the study of [[functional space]]s, in particular transformations of [[function (mathematics)|functions]], such as the [[Fourier transform]], as well as in the study of [[differential equations|differential]] and [[integral equations]]. This usage of the word ''[[functional (mathematics)|functional]]'' goes back to the [[calculus of variations]], implying a function whose argument is a function. Its use in general has been attributed to mathematician and physicist [[Vito Volterra]] and its founding is largely attributed to mathematician [[Stefan Banach]].&lt;br /&gt;
&lt;br /&gt;
Functional analysis is the branch of mathematics, and specifically of analysis, concerned with the study of vector spaces and operators acting upon them. It has its historical roots in the study of functional spaces, in particular transformations of functions, such as the Fourier transform, as well as in the study of differential and integral equations. This usage of the word functional goes back to the calculus of variations, implying a function whose argument is a function. Its use in general has been attributed to mathematician and physicist Vito Volterra and its founding is largely attributed to mathematician Stefan Banach.&lt;br /&gt;
&lt;br /&gt;
'''泛函分析 Functional analysis'''是数学分析的一个分支，研究向量空间和作用于向量空间的算子。它源于对函数空间的研究，特别是对函数变换的研究，例如傅里叶变换，微积分方程的研究等。泛函分析的名称“Functional Analysis”中，“functional”这个词的用法可以追溯到变分法，也就是说函数的参数是一个函数。这个词的使用一般被认为归功于数学家和物理学家Vito Volterra，和数学家Stefan Banach。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Graph dynamical systems 图动力系统===&lt;br /&gt;
&lt;br /&gt;
:The concept of [[graph dynamical system]]s (GDS) can be used to capture a wide range of processes taking place on graphs or networks. A major theme in the mathematical and computational analysis of graph dynamical systems is to relate their structural properties (e.g. the network connectivity) and the global dynamics that result.&lt;br /&gt;
&lt;br /&gt;
The concept of graph dynamical systems (GDS) can be used to capture a wide range of processes taking place on graphs or networks. A major theme in the mathematical and computational analysis of graph dynamical systems is to relate their structural properties (e.g. the network connectivity) and the global dynamics that result.&lt;br /&gt;
&lt;br /&gt;
'''图动力系统 Graph dynamical systems (GDS)'''可以用来描绘图或网络上发生的各种过程。&amp;lt;font color='red'&amp;gt;图动力系统的数学和计算分析的一个主要主题是关联它们的结构性质(例如:网络连接)和结构性质造成的网络整体的动态结果。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;图动力系统的数学和计算分析的一个主要主题是将其结构特性（例如：网络连接性）与其所产生的全局动力学联系起来。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Projected dynamical systems 投影动力系统===&lt;br /&gt;
&lt;br /&gt;
:[[Projected dynamical systems]] it is a [[mathematics|mathematical]] theory investigating the behaviour of [[dynamical system]]s where solutions are restricted to a constraint set. The discipline shares connections to and applications with both the static world of [[Optimization (mathematics)|optimization]] and [[Equilibrium point|equilibrium]] problems and the dynamical world of [[ordinary differential equations]]. A projected dynamical system is given by the [[flow (mathematics)|flow]] to the projected differential equation.&lt;br /&gt;
&lt;br /&gt;
Projected dynamical systems it is a mathematical theory investigating the behaviour of dynamical systems where solutions are restricted to a constraint set. The discipline shares connections to and applications with both the static world of optimization and equilibrium problems and the dynamical world of ordinary differential equations. A projected dynamical system is given by the flow to the projected differential equation.&lt;br /&gt;
&lt;br /&gt;
'''投影动力系统 Projected Dynamical Systems'''是研究解在一个约束集内的动力系统行为的数学理论。这门学科与静态世界中的最优化和平衡问题以及动态世界中的常微分方程都有联系&amp;lt;font color='blue'&amp;gt;和&amp;lt;s&amp;gt;，并且都有相互联系的&amp;lt;/s&amp;gt;&amp;lt;/font&amp;gt;应用。一个投影动力系统是由投影微分方程的'''流形 flow'''给定的。&lt;br /&gt;
通过对投影微分方程的流分析，给出了一个投影动力系统的表达式：&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\frac{dx(t)}{dt} = \Pi_K(x(t),-F(x(t)))&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中K为约束集。这种形式的微分方程因具有不连续的向量场而值得注意。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Symbolic dynamics 符号动力学===&lt;br /&gt;
&lt;br /&gt;
:[[Symbolic dynamics]] is the practice of modelling a topological or smooth [[dynamical system]] by a discrete space consisting of infinite [[sequence]]s of abstract symbols, each of which corresponds to a state of the system, with the dynamics (evolution) given by the [[shift operator]].&lt;br /&gt;
&lt;br /&gt;
Symbolic dynamics is the practice of modelling a topological or smooth dynamical system by a discrete space consisting of infinite sequences of abstract symbols, each of which corresponds to a state of the system, with the dynamics (evolution) given by the shift operator.&lt;br /&gt;
&lt;br /&gt;
'''符号动力学 Symbolic Dynamics'''是通过一个由抽象符号的无限序列组成的离散空间建立一个拓扑或光滑动力系统的方法。每一个抽象符号的无限序列序列对应于系统的一个状态，并由移位算子给出动力学(演化)。&lt;br /&gt;
&amp;lt;font color='blue'&amp;gt;'''符号动力学 Symbolic Dynamics'''是通过离散空间对拓扑或平滑动力学系统进行建模的方法，该离散空间由无限的抽象符号序列组成，每个抽象符号对应于系统的一个状态，并且由移位运算符给出动力学（演化）。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== System dynamics 系统动力学===&lt;br /&gt;
&lt;br /&gt;
:[[System dynamics]] is an approach to understanding the behaviour of systems over time.  It deals with internal feedback loops and time delays that affect the behaviour and state of the entire system.&amp;lt;ref name=&amp;quot;sysdyn&amp;quot;&amp;gt;[http://sysdyn.clexchange.org MIT System Dynamics in Education Project (SDEP)&amp;lt;!-- Bot generated title --&amp;gt;] {{webarchive|url=https://web.archive.org/web/20080509163801/http://sysdyn.clexchange.org/ |date=2008-05-09 }}&amp;lt;/ref&amp;gt;  What makes using system dynamics different from other approaches to studying systems is the use of [[feedback]] loops and [[Stock and flow|stocks and flows]].  These elements help describe how even seemingly simple systems display baffling [[nonlinearity]].&lt;br /&gt;
&lt;br /&gt;
System dynamics is an approach to understanding the behaviour of systems over time.  It deals with internal feedback loops and time delays that affect the behaviour and state of the entire system.  What makes using system dynamics different from other approaches to studying systems is the use of feedback loops and stocks and flows.  These elements help describe how even seemingly simple systems display baffling nonlinearity.&lt;br /&gt;
&lt;br /&gt;
'''系统动力学 System Dynamics'''是一种理解系统随时间变化行为的方法。它是用来处理影响整个系统行为和状态的内部反馈回路和时间延迟的方法。系统动力学不同于其他系统研究方法的地方在于它使用了反馈环、&amp;lt;font color='red'&amp;gt;股票（stocks）和流形（flows）&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;存量(stocks)和流量(flows)--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|原wiki里这两个词指向:https://en.wikipedia.org/wiki/Stock_and_flow ，估计应该是存量和流量的意思，也可以群里大家讨论一下]]）&amp;lt;/font&amp;gt;--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|如何翻译stocks 和 folows]]）的元素。这些元素有助于描述看似简单的系统如何显示复杂的非线性行为。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Topological dynamics 拓扑动力学===&lt;br /&gt;
&lt;br /&gt;
:[[Topological dynamics]] is a branch of the theory of dynamical systems in which qualitative, asymptotic properties of dynamical systems are studied from the viewpoint of [[general topology]].&lt;br /&gt;
&lt;br /&gt;
Topological dynamics is a branch of the theory of dynamical systems in which qualitative, asymptotic properties of dynamical systems are studied from the viewpoint of general topology.&lt;br /&gt;
&lt;br /&gt;
'''拓扑动力学 Topological Dynamics'''是动力系统理论的一个分支。在拓朴动力学中，动力系统的定性性质和渐近性质是从一般拓扑学的观点来研究的。&lt;br /&gt;
&lt;br /&gt;
== Applications 应用==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== In human development 在人类发展中的应用===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In [[Developmental psychology|human development]], dynamical systems theory has been used to enhance and simplify Erik Erikson's [[eight stages of psychosocial development]] and offers a standard method of examining the universal pattern of human development. This method is based on the self-organizing and [[fractal]] properties of the [[Fibonacci sequence]].&amp;lt;ref name=Sacco&amp;gt;{{cite journal|last=Sacco|first=R.G.|title=Re-envisaging the eight developmental stages of Erik Erikson: The Fibonacci Life-Chart Method (FLCM)|journal=Journal of Educational and Developmental Psychology|date=2013|volume=3|issue=1|pages=140–146|doi=10.5539/jedp.v3n1p140|doi-access=free}}&amp;lt;/ref&amp;gt; Using mathematical modeling, a natural progression of human development with eight life stages has been identified:  early infancy (0–2 years), toddler (2–4 years), early childhood (4–7 years), middle childhood (7–11 years), adolescence (11–18 years), young adulthood (18–29 years), middle adulthood (29–48 years), and older adulthood (48–78+ years).&amp;lt;ref name=Sacco/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In human development, dynamical systems theory has been used to enhance and simplify Erik Erikson's eight stages of psychosocial development and offers a standard method of examining the universal pattern of human development. This method is based on the self-organizing and fractal properties of the Fibonacci sequence. Using mathematical modeling, a natural progression of human development with eight life stages has been identified:  early infancy (0–2 years), toddler (2–4 years), early childhood (4–7 years), middle childhood (7–11 years), adolescence (11–18 years), young adulthood (18–29 years), middle adulthood (29–48 years), and older adulthood (48–78+ years).&lt;br /&gt;
&lt;br /&gt;
在人类发展方面，动力系统理论已经被用来增强和简化 Erik Erikson 的'''社会心理发展8阶段理论 Eight Stages of Psychosocial Development'''，并提供了一个检验人类发展普遍模式的标准方法。该方法基于斐波那契数列的'''自组织性 self-organizing'''和'''分形 Fractal''' 特性。利用数学模型，人类发展的自然进程被分为8个生命阶段: 早期婴儿期(0-2岁)、幼儿期(2-4岁)、童年早期(4-7岁)、童年中期(7-11岁)、青春期(11-18岁)、成年早期(18-29岁)、成年中期(29-48岁)和老年成年期(48-78岁及以上)。&lt;br /&gt;
&lt;br /&gt;
--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|原wiki里没有这个应用呀？是被删除了吗？]] &lt;br /&gt;
&lt;br /&gt;
According to this model, stage transitions between age intervals represent self-organization processes at multiple levels (e.g., molecules, genes, cell, organ, organ system, organism, behavior, and environment). For example, at the stage transition from [[adolescence]] to [[young adulthood]], and after reaching the critical point of 18 years of age (young adulthood), a peak in [[testosterone]] is observed in males&amp;lt;ref&amp;gt;{{cite journal |last1=Kelsey |first1=T. W. |title=A validated age-related normative model for male total testosterone shows increasing variance but no decline after age 40 years. |journal=PLOS One |volume=9 |issue=10 |pages=e109346 |doi=10.1371/journal.pone.0109346|pmid=25295520 |year=2014 |pmc=4190174 |bibcode=2014PLoSO...9j9346K }}&amp;lt;/ref&amp;gt; and the period of optimal [[fertility]] begins in females.&amp;lt;ref&amp;gt;{{cite book |last1=Tulandi |first1=T. |title=Preservation of fertility |date=2004 |publisher=Taylor &amp;amp; Francis |pages=1–20}}&amp;lt;/ref&amp;gt; Similarly, at age 30 optimal fertility begins to decline in females,&amp;lt;ref name=&amp;quot;Social Science 2008&amp;quot;&amp;gt;{{cite journal |last1=Blanchflower |first1=D. G. |title=Is well-being U-shaped over the life cycle? |journal=Social Science &amp;amp; Medicine |volume=66 |issue=8 |pages=1733–1749 |doi=10.1016/j.socscimed.2008.01.030|pmid=18316146 |year=2008 |citeseerx=10.1.1.63.5221 }}&amp;lt;/ref&amp;gt; and at the stage transition from [[middle adulthood]] to older adulthood at 48 years, the average age of onset of [[menopause]] occurs.&amp;lt;ref name=&amp;quot;Social Science 2008&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
According to this model, stage transitions between age intervals represent self-organization processes at multiple levels (e.g., molecules, genes, cell, organ, organ system, organism, behavior, and environment). For example, at the stage transition from adolescence to young adulthood, and after reaching the critical point of 18 years of age (young adulthood), a peak in testosterone is observed in males and the period of optimal fertility begins in females. Similarly, at age 30 optimal fertility begins to decline in females, and at the stage transition from middle adulthood to older adulthood at 48 years, the average age of onset of menopause occurs.&lt;br /&gt;
&lt;br /&gt;
根据这个模型，年龄的阶段转换代表了多层次的自组织过程(例如，分子、基因、细胞、器官、器官系统、生物体、行为和环境)。例如，在从青春期向成年早期过渡的阶段中，在达到18岁这一关键年龄之后，男性的睾丸激素达到高峰，女性的最佳生育期开始。同样，在30岁时，女性的最佳生育能力开始下降；在从成年中期过渡到老年成年期时，48岁是绝经的平均年龄。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
These events are physical bioattractors of aging from the perspective of Fibonacci mathematical modeling and dynamically systems theory. In practical terms, prediction in human development becomes possible in the same statistical sense in which the average temperature or precipitation at different times of the year can be used for [[weather forecasting]]. Each of the predetermined stages of human development follows an optimal epigenetic biological pattern. This phenomenon can be explained by the occurrence of Fibonacci numbers in biological [[DNA]]&amp;lt;ref&amp;gt;{{cite journal |last1=Perez |first1=J. C. (2010). |title=Codon populations in single-stranded whole human genome DNA are fractal and fine-tuned by the Golden Ratio 1.618. |journal=Interdisciplinary Sciences: Computational Life Sciences |volume=2 |issue=3 |pages=228–240 |doi=10.1007/s12539-010-0022-0|pmid=20658335 |year=2010 }}&amp;lt;/ref&amp;gt; and self-organizing properties of the Fibonacci numbers that converge on the [[golden ratio]].&lt;br /&gt;
&lt;br /&gt;
These events are physical bioattractors of aging from the perspective of Fibonacci mathematical modeling and dynamically systems theory. In practical terms, prediction in human development becomes possible in the same statistical sense in which the average temperature or precipitation at different times of the year can be used for weather forecasting. Each of the predetermined stages of human development follows an optimal epigenetic biological pattern. This phenomenon can be explained by the occurrence of Fibonacci numbers in biological DNA and self-organizing properties of the Fibonacci numbers that converge on the golden ratio.&lt;br /&gt;
&lt;br /&gt;
从斐波那契数学模型和动力系统理论的角度来看，上述事件是衰老的'''物理生物吸引子Physical Bioattractors'''。实际上，正如一年中不同时间的平均气温和降水量可以用来预测天气，预测人类的发展在统计意义上同样是可能的。人类发展的每个'''预定阶段Predetermined Stages'''都遵循最佳的'''表观遗传生物模式 Epigenetic Biological Pattern'''。这种现象可以用 DNA 中的斐波那契数和收敛于黄金分割比的斐波那契数的自组织特性来解释。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== In biomechanics 在运动生物力学中的应用===&lt;br /&gt;
&lt;br /&gt;
In [[sports biomechanics]], dynamical systems theory has emerged in the movement sciences as a viable framework for modeling athletic performance. From a dynamical systems perspective, the human movement system is a highly intricate network of co-dependent sub-systems (e.g. respiratory, circulatory, nervous, skeletomuscular, perceptual) that are composed of a large number of interacting components (e.g. blood cells, oxygen molecules, muscle tissue, metabolic enzymes, connective tissue and bone). In dynamical systems theory, movement patterns emerge through generic processes of self-organization found in physical and biological systems.&amp;lt;ref&amp;gt;Paul S Glazier, Keith Davids, Roger M Bartlett (2003). [http://www.sportsci.org/jour/03/psg.htm &amp;quot;DYNAMICAL SYSTEMS THEORY: a Relevant Framework for Performance-Oriented Sports Biomechanics Research&amp;quot;]. in: Sportscience 7. Accessed 2008-05-08.&amp;lt;/ref&amp;gt; There is no research validation of any of the claims associated to the conceptual application of this framework.&lt;br /&gt;
&lt;br /&gt;
In sports biomechanics, dynamical systems theory has emerged in the movement sciences as a viable framework for modeling athletic performance. From a dynamical systems perspective, the human movement system is a highly intricate network of co-dependent sub-systems (e.g. respiratory, circulatory, nervous, skeletomuscular, perceptual) that are composed of a large number of interacting components (e.g. blood cells, oxygen molecules, muscle tissue, metabolic enzymes, connective tissue and bone). In dynamical systems theory, movement patterns emerge through generic processes of self-organization found in physical and biological systems. There is no research validation of any of the claims associated to the conceptual application of this framework.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;font color='red'&amp;gt;在运动生物力学中，动力系统理论新兴地成为对运动表现建模的可行框架。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;在运动生物力学中，动力系统理论在运动科学中崭露头角，成为一种对运动表现建模的可行框架。&amp;lt;/font&amp;gt;从动力系统的角度来看，人类的运动系统是由高度复杂和相互依赖的子系统网络（如呼吸、循环、神经、骨骼肌系统和知觉系统等）组成的，它们由大量相互作用的部分组成（包括血细胞、氧分子、肌肉组织、代谢酶、结缔组织和骨骼等)。动力系统理论中，运动模式通过物理系统和生物系统中的一般自组织过程出现。没有任何研究证实与这一框架的概念&amp;lt;font color='blue'&amp;gt;应用&amp;lt;/font&amp;gt;相关的任何主张。&lt;br /&gt;
&lt;br /&gt;
=== In cognitive science 在认知科学中的应用===&lt;br /&gt;
&lt;br /&gt;
Dynamical system theory has been applied in the field of [[neurodynamics|neuroscience]] and [[cognitive science|cognitive development]], especially in [[the neo-Piagetian theories of cognitive development]]. It is the belief that cognitive development is best represented by physical theories rather than theories based on syntax and [[AI]]. It also believed that differential equations are the most appropriate tool for modeling human behavior. These equations are interpreted to represent an agent's cognitive trajectory through [[state space]]. In other words, dynamicists argue that [[psychology]] should be (or is) the description (via differential equations) of the cognitions and behaviors of an agent under certain environmental and internal pressures. The language of chaos theory is also frequently adopted.&lt;br /&gt;
&lt;br /&gt;
Dynamical system theory has been applied in the field of neuroscience and cognitive development, especially in the neo-Piagetian theories of cognitive development. It is the belief that cognitive development is best represented by physical theories rather than theories based on syntax and AI. It also believed that differential equations are the most appropriate tool for modeling human behavior. These equations are interpreted to represent an agent's cognitive trajectory through state space. In other words, dynamicists argue that psychology should be (or is) the description (via differential equations) of the cognitions and behaviors of an agent under certain environmental and internal pressures. The language of chaos theory is also frequently adopted.&lt;br /&gt;
&lt;br /&gt;
动力系统理论已经被应用于神经科学和认知发展领域，特别是在认知发展的'''新皮亚杰学派 neo-Piagetian'''中。人们相信，物理学理论比句法学理论和人工智能理论更能代表认知发展。人们还相信微分方程是人类行为建模最合适的工具。&amp;lt;s&amp;gt;人们认为&amp;lt;/s&amp;gt;微分方程可以解释为通过状态空间代表一个主体的认知轨迹的算式。换句话说，动力学家认为心理学应该&amp;lt;font color='blue'&amp;gt;是&amp;lt;/font&amp;gt;(或者&amp;lt;font color='blue'&amp;gt;就&amp;lt;/font&amp;gt;是)(通过微分方程)描述在一定的环境和内部压力下的主体的认知和行为的学科。混沌理论在相关领域也经常被采用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In it, the learner's mind reaches a state of disequilibrium where old patterns have broken down. This is the phase transition of cognitive development. [[Self-organization]] (the spontaneous creation of coherent forms) sets in as activity levels link to each other. Newly formed macroscopic and microscopic structures support each other, speeding up the process. These links form the structure of a new state of order in the mind through a process called ''scalloping'' (the repeated building up and collapsing of complex performance.) This new, novel state is progressive, discrete, idiosyncratic and unpredictable.&amp;lt;ref&amp;gt;{{cite journal|title=The Promise of Dynamic Systems Approaches for an Integrated Account of Human Development|journal=Child Development|date=2000-02-25|first=Mark D.|last=Lewis|volume=71|issue=1|pages=36–43|id= |url=http://home.oise.utoronto.ca/~mlewis/Manuscripts/Promise.pdf|accessdate=2008-04-04|doi=10.1111/1467-8624.00116|pmid=10836556 |citeseerx=10.1.1.72.3668}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In it, the learner's mind reaches a state of disequilibrium where old patterns have broken down. This is the phase transition of cognitive development. Self-organization (the spontaneous creation of coherent forms) sets in as activity levels link to each other. Newly formed macroscopic and microscopic structures support each other, speeding up the process. These links form the structure of a new state of order in the mind through a process called scalloping (the repeated building up and collapsing of complex performance.) This new, novel state is progressive, discrete, idiosyncratic and unpredictable.&lt;br /&gt;
&lt;br /&gt;
在学习的过程中，旧的模式被打破了，学习者的思维达到了一种不平衡的状态。这是认知发展的阶段性转变。自组织(连贯的自发创造(the spontaneous creation of coherent forms))在'''活动水平 Activity Levels'''相互联系时产生。新形成的宏观和微观结构相互支持，加速了这一过程。这些联系在头脑中形成了一种&amp;lt;font color='blue'&amp;gt;有序的&amp;lt;s&amp;gt;具有&amp;lt;/s&amp;gt;&amp;lt;/font&amp;gt;新状态&amp;lt;s&amp;gt;的&amp;lt;/s&amp;gt;结构，这个过程被称为“扇贝化 Scalloping”，也就是头脑的复杂&amp;lt;font color='red'&amp;gt;性能&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;表现&amp;lt;/font&amp;gt;的不断累积和崩溃的过程 --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|扇贝化的翻译拿不准，这句话的描述比较抽象]]）。这种新的状态是渐进的、离散的、异质的的和不可预知的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Dynamic systems theory has recently been used to explain a long-unanswered problem in child development referred to as the [[A-not-B error]].&amp;lt;ref&amp;gt;{{cite journal|title=Development as a dynamic system|journal=Trends in Cognitive Sciences|date=2003-07-30|first=Linda B.|last=Smith|author2=Esther Thelen|volume=7|issue=8|pages=343–8|id= |url=http://www.indiana.edu/~cogdev/labwork/dynamicsystem.pdf|accessdate=2008-04-04|doi=10.1016/S1364-6613(03)00156-6|pmid=12907229|citeseerx=10.1.1.294.2037}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Dynamic systems theory has recently been used to explain a long-unanswered problem in child development referred to as the A-not-B error.&lt;br /&gt;
&lt;br /&gt;
动力系统理论最近还被用来解释儿童发展中一个长期没有答案的问题，即 A-not-B 错误。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===In second language development 在二语习得中的应用===&lt;br /&gt;
&lt;br /&gt;
{{Main|Dynamic approach to second language development}}&lt;br /&gt;
&lt;br /&gt;
The application of Dynamic Systems Theory to study [[second language acquisition]] is attributed to [[Diane Larsen-Freeman]] who published an article in 1997 in which she claimed that [[second language acquisition]] should be viewed as a developmental process which includes [[language attrition]] as well as language acquisition.&amp;lt;ref&amp;gt;{{cite web|url=https://academic.oup.com/applij/article-abstract/18/2/141/134192|title=Chaos/Complexity Science and Second Language Acquisition|date=1997|publisher=Applied Linguistics}}&amp;lt;/ref&amp;gt; In her article she claimed that language should be viewed as a dynamic system which is dynamic, complex, nonlinear, chaotic, unpredictable, sensitive to initial conditions, open, self-organizing, feedback sensitive, and adaptive.&lt;br /&gt;
&lt;br /&gt;
The application of Dynamic Systems Theory to study second language acquisition is attributed to Diane Larsen-Freeman who published an article in 1997 in which she claimed that second language acquisition should be viewed as a developmental process which includes language attrition as well as language acquisition. In her article she claimed that language should be viewed as a dynamic system which is dynamic, complex, nonlinear, chaotic, unpredictable, sensitive to initial conditions, open, self-organizing, feedback sensitive, and adaptive.&lt;br /&gt;
&lt;br /&gt;
动力系统理论在二语习得研究中的应用归功于 Diane Larsen-Freeman，她在1997年发表的一篇文章中认为，二语习得应该被看作是一个包括语言流失和&amp;lt;font color='blue'&amp;gt;语言&amp;lt;/font&amp;gt;习得在内的发展过程。她在文章中认为，语言应该被看作是一个动态的、复杂的、非线性的、混沌的、不可预知的、对初始条件敏感的、开放的、自组织的、反馈敏感的和适应性的动力系统。&lt;br /&gt;
&lt;br /&gt;
== See also 参见==&lt;br /&gt;
&lt;br /&gt;
;Related subjects&lt;br /&gt;
&lt;br /&gt;
Related subjects&lt;br /&gt;
&lt;br /&gt;
相关科目&lt;br /&gt;
&lt;br /&gt;
{{div col|colwidth=20em}}&lt;br /&gt;
&lt;br /&gt;
* [[List of dynamical system topics]] 动力系统主题清单&lt;br /&gt;
&lt;br /&gt;
* [[Baker's map]]&lt;br /&gt;
&lt;br /&gt;
* [[Biological applications of bifurcation theory]] 分支理论的生物学应用&lt;br /&gt;
&lt;br /&gt;
* [[Dynamical system (definition)]] 动力系统（定义）&lt;br /&gt;
&lt;br /&gt;
* [[Embodied Embedded Cognition]] 具身认知&lt;br /&gt;
&lt;br /&gt;
* [[Fibonacci numbers]] 斐波那契数&lt;br /&gt;
&lt;br /&gt;
* [[Fractals]] 分形&lt;br /&gt;
&lt;br /&gt;
* [[Gingerbreadman map]]&lt;br /&gt;
&lt;br /&gt;
* [[Halo orbit]] Halo 轨道&lt;br /&gt;
&lt;br /&gt;
* [[List of types of systems theory]] 动力系统类型清单&lt;br /&gt;
&lt;br /&gt;
* [[Oscillation]] 振动性&lt;br /&gt;
&lt;br /&gt;
* [[Postcognitivism]]&lt;br /&gt;
&lt;br /&gt;
* [[Recurrent neural network]] 递归神经网络&lt;br /&gt;
&lt;br /&gt;
* [[Combinatorics and dynamical systems]] 组合数学和动力系统&lt;br /&gt;
&lt;br /&gt;
* [[Synergetics (Haken)|Synergetics]] 协同学(Haken)&lt;br /&gt;
&lt;br /&gt;
* [[Systemography]]&lt;br /&gt;
&lt;br /&gt;
{{div col end}}&lt;br /&gt;
&lt;br /&gt;
;Related scientists&lt;br /&gt;
&lt;br /&gt;
Related scientists&lt;br /&gt;
&lt;br /&gt;
相关科学家&lt;br /&gt;
&lt;br /&gt;
{{div col|colwidth=20em}}&lt;br /&gt;
&lt;br /&gt;
* [[People in systems and control]]&lt;br /&gt;
&lt;br /&gt;
* [[Dmitri Anosov]]&lt;br /&gt;
&lt;br /&gt;
* [[Vladimir Arnold]]&lt;br /&gt;
&lt;br /&gt;
* [[Nikolay Bogolyubov]]&lt;br /&gt;
&lt;br /&gt;
* [[Andrey Kolmogorov]]&lt;br /&gt;
&lt;br /&gt;
* [[Nikolay Mitrofanovich Krylov|Nikolay Krylov]]&lt;br /&gt;
&lt;br /&gt;
* [[Jürgen Moser]]&lt;br /&gt;
&lt;br /&gt;
* [[Yakov G. Sinai]]&lt;br /&gt;
&lt;br /&gt;
* [[Stephen Smale]]&lt;br /&gt;
&lt;br /&gt;
* [[Hillel Furstenberg]]&lt;br /&gt;
&lt;br /&gt;
* [[Grigory Margulis]]&lt;br /&gt;
&lt;br /&gt;
* [[Elon Lindenstrauss]]&lt;br /&gt;
&lt;br /&gt;
{{div col end}}&lt;br /&gt;
&lt;br /&gt;
== Notes 参考资料==&lt;br /&gt;
&lt;br /&gt;
{{reflist}}&lt;br /&gt;
&lt;br /&gt;
== Further reading 拓展阅读==&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Frederick D. |last1=Abraham |first2=Ralph |last2=Abraham |authorlink2=Ralph Abraham (mathematician)|first3=Christopher D. |last3=Shaw |title=A Visual Introduction to Dynamical Systems Theory for Psychology |url=https://books.google.com/books?id=oMbaAAAAMAAJ |year=1990 |publisher=Aerial Press |isbn=978-0-942344-09-7 |oclc=24345312}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=Edward J. |last=Beltrami |title=Mathematics for Dynamic Modeling |url=https://books.google.com/books?id=MmoiJPsuFW8C |year=1998 |publisher=Academic Press |isbn=978-0-12-085566-7 |edition=2nd |oclc=36713294}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=Otomar |last=Hájek |title=Dynamical systems in the plane |url=https://books.google.com/books?id=czhPAQAAIAAJ |year=1968 |publisher=Academic Press |oclc=343328 |authorlink=Otomar Hájek |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=David G. |last=Luenberger |title=Introduction to dynamic systems: theory, models, and applications |url=https://books.google.com/books?id=mvlQAAAAMAAJ |year=1979 |publisher=Wiley |isbn=978-0-471-02594-8 |oclc=4195122 |authorlink=David Luenberger |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Anthony |last1=Michel |author2=Kaining Wang |author3=Bo Hu |title=Qualitative Theory of Dynamical Systems |url=https://books.google.com/books?id=ZPGBnZGV2_cC |year=2001 |publisher=Taylor &amp;amp; Francis |isbn=978-0-8247-0526-8 |oclc=45873628}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Louis |last1=Padulo |first2=Michael A. |last2=Arbib |authorlink2=Michael A. Arbib |title=System theory: a unified state-space approach to continuous and discrete systems |url=https://books.google.com/books?id=6UPvAAAAMAAJ |year=1974 |publisher=Saunders |isbn=9780721670355 |oclc=947600 |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |first=Steven H. |last=Strogatz |title=Nonlinear Dynamics and Chaos: With Applications to Physics, Biology, Chemistry, and Engineering |year=1994 |publisher=Addison Wesley |isbn=978-0-7382-0453-6 |oclc=49839504 |authorlink=Steven Strogatz |ref=harv |url-access=registration |url=https://archive.org/details/nonlineardynamic00stro }}&lt;br /&gt;
&lt;br /&gt;
== External links 外部链接==&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20080613053119/http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html Dynamic Systems 动力系统] Encyclopedia of Cognitive Science entry. --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|这是一个嵌套的链接，但好像只能鼠标点击并超链接到内嵌的那个]]）认知科学百科全书&lt;br /&gt;
--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|确实，应该是原wiki中的链接有错误，https://cogs.indiana.edu/Publications/techreps2000/241/241.html 这个能打开但显示not find page，https://web.archive.org/web/20080613053119 则打不开]]&lt;br /&gt;
&lt;br /&gt;
*[http://mathworld.wolfram.com/DynamicalSystem.html Definition of dynamical system 动力系统的定义] in MathWorld. 在MathWorld.wolfram.com储存的定义&lt;br /&gt;
&lt;br /&gt;
*[http://www.dynamicalsystems.org/ DSWeb] Dynamical Systems Magazine 动力系统杂志&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Areas of mathematics | state=collapsed}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:Dynamical systems]]&lt;br /&gt;
&lt;br /&gt;
Category:Dynamical systems&lt;br /&gt;
&lt;br /&gt;
类别: 动力系统&lt;br /&gt;
&lt;br /&gt;
[[Category:Complex systems theory]]&lt;br /&gt;
&lt;br /&gt;
Category:Complex systems theory&lt;br /&gt;
&lt;br /&gt;
范畴: 复杂系统理论&lt;br /&gt;
&lt;br /&gt;
[[Category:Computational fields of study]]&lt;br /&gt;
&lt;br /&gt;
Category:Computational fields of study&lt;br /&gt;
&lt;br /&gt;
类别: 研究的计算领域&lt;br /&gt;
&lt;br /&gt;
&amp;lt;noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;small&amp;gt;This page was moved from [[wikipedia:en:Dynamical systems theory]]. Its edit history can be viewed at [[动力系统/edithistory]]&amp;lt;/small&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:待整理页面]]&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
===书籍推荐===&lt;br /&gt;
====[https://www.amazon.co.uk/Chaos-Making-Science-James-Gleick/dp/0749386061 Chaos: Making a New Science]====&lt;br /&gt;
The million-copy bestseller by National Book Award nominee and Pulitzer Prize finalist James Gleick—the author of Time Travel: A History—that reveals the science behind chaos theory。&lt;br /&gt;
Very readable, focuses on the scientists and mathematicians behind many of the key results in chaos.&lt;br /&gt;
本书由普利茨奖获得者James Gleick撰写。它是一本易读科普书籍，侧重介绍对混沌概念的发展做出重大贡献的科学家和数学家们。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://www.amazon.com/dp/0199566445/ref=cm_sw_su_dp Chaos and Fractals: An Elementary Introduction]====&lt;br /&gt;
This book provides the reader with an elementary introduction to chaos and fractals, suitable for students with a background in elementary algebra, without assuming prior coursework in calculus or physics. &lt;br /&gt;
这是一本关于混沌和分形的入门书籍。读者需要有一定的线性代数基础，但是不需要有微积分或物理学的基础。&lt;br /&gt;
&lt;br /&gt;
====[https://www.amazon.co.uk/Chaos-Very-Short-Introduction-Introductions/dp/0192853783/ref=pd_lpo_14_img_1/257-2017232-0516612?_encoding=UTF8&amp;amp;pd_rd_i=0192853783&amp;amp;pd_rd_r=eebee69a-fad3-43e3-bbeb-b883f2c59bf5&amp;amp;pd_rd_w=g6knH&amp;amp;pd_rd_wg=sx6z5&amp;amp;pf_rd_p=7b8e3b03-1439-4489-abd4-4a138cf4eca6&amp;amp;pf_rd_r=YTB0XXCR2DM8049PYP1Y&amp;amp;psc=1&amp;amp;refRID=YTB0XXCR2DM8049PYP1Y 牛津通识读本: Chaos]====&lt;br /&gt;
This book would not have been possible without my parents, of course, but I owe a greater debt than most to their faith, doubt, and hope, and to the love and patience of a, b, and c. Professionally my greatest debt is to Ed Spiegel, a father of chaos and my thesis Professor, mentor, and friend.&lt;br /&gt;
本书隶属于牛津通识读本系列。该书由Ed Spiegel的学生Leonard Smith撰写，语言生动简明。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
===集智课程推荐===&lt;br /&gt;
====[https://campus.swarma.org/course/1655 圣塔菲课程：Introduction to Dynamical Systems and Chaos]====&lt;br /&gt;
本课程中，主要介绍动力学系统和混沌系统，您将学到'''蝴蝶效应 Butterfly effect'''、'''奇异吸引子 Attractors'''等基本概念，以及如何应用于您感兴趣的领域。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://campus.swarma.org/course/1641 动力系统分析]====&lt;br /&gt;
本课程主要讲授连续和离散动力系统的定态、极限环及其稳定性分析、动力学系统的结构稳定性和常见的分支类型以及分析方法，混沌概念等。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E5%8A%A8%E5%8A%9B%E7%B3%BB%E7%BB%9F%E7%90%86%E8%AE%BA_Dynamical_Systems_Theory&amp;diff=10218</id>
		<title>动力系统理论 Dynamical Systems Theory</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E5%8A%A8%E5%8A%9B%E7%B3%BB%E7%BB%9F%E7%90%86%E8%AE%BA_Dynamical_Systems_Theory&amp;diff=10218"/>
		<updated>2020-07-12T02:43:32Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。&lt;br /&gt;
&lt;br /&gt;
{{Use dmy dates|date=May 2019|cs1-dates=y}}&lt;br /&gt;
&lt;br /&gt;
'''Dynamical systems theory''' is an area of [[mathematics]] used to describe the behavior of the  [[complex systems|complex]] [[dynamical system]]s, usually by employing [[differential equations]] or [[difference equations]]. When differential equations are employed, the theory is called [[continuous time|''continuous dynamical systems'']]. From a physical point of view, continuous dynamical systems is a generalization of [[classical mechanics]], a generalization where the [[equations of motion]] are postulated directly and are not constrained to be [[Euler–Lagrange equation]]s of a [[Principle of least action|least action principle]]. When difference equations are employed, the theory is called [[discrete time|''discrete dynamical systems'']]. When the time variable runs over a set that is discrete over some intervals and continuous over other intervals or is any arbitrary time-set such as a [[cantor set]], one gets [[dynamic equations on time scales]]. Some situations may also be modeled by mixed operators, such as [[differential-difference equations]].&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory is an area of mathematics used to describe the behavior of the  complex dynamical systems, usually by employing differential equations or difference equations. When differential equations are employed, the theory is called continuous dynamical systems. From a physical point of view, continuous dynamical systems is a generalization of classical mechanics, a generalization where the equations of motion are postulated directly and are not constrained to be Euler–Lagrange equations of a least action principle. When difference equations are employed, the theory is called discrete dynamical systems. When the time variable runs over a set that is discrete over some intervals and continuous over other intervals or is any arbitrary time-set such as a cantor set, one gets dynamic equations on time scales. Some situations may also be modeled by mixed operators, such as differential-difference equations.&lt;br /&gt;
&lt;br /&gt;
  &lt;br /&gt;
'''动力系统理论 Dynamical Systems Theory'''是一个用来描述复杂动力系统行为的数学领域，通常使用微分方程或差分方程。当采用微分方程时，该理论被称为连续动力系统。从物理学的角度来看，连续动力系统是经典力学的推广，也是运动方程的推广，不受极小作用原理Euler–Lagrange方程的约束。当采用差分方程时，该理论被称为离散动力系统。&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;当时间变量在一个离散的集合上运行，在另一个离散的集合上连续，或者像cantor集一样在任意的时间集合上运行时，人们就能得到时间尺度上的动力方程。&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 当时间变量运行在一个某些区间离散、其他区间连续的集合、或者像cantor集一样任意的时间集合上时，人们就能得到时间尺度上的动力方程。&amp;lt;/font&amp;gt;&lt;br /&gt;
&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;'''算子 Operators'''是一个函数空间到函数空间上的映射O：X→X，广义的讲，对任何函数进行某一项操作都可以认为是一个算子，如求幂次、求微分等。&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;这句话的英文原文在哪里？&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;动力系统的有些情况也可以用'''混合算子 Mixed Operators'''来建模，如微分-差分方程。&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 某些情况下，也可以用'''混合算子 Mixed Operators'''来建模，如微分-差分方程。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This theory deals with the long-term qualitative behavior of dynamical systems, and studies the nature of, and when possible the solutions of, the [[equations of motion]] of systems that are often primarily [[mechanics|mechanical]] or otherwise physical in nature, such as [[planetary orbit]]s and the behaviour of [[electronic circuit]]s, as well as systems that arise in [[biology]], [[economics]], and elsewhere. Much of modern research is focused on the study of [[chaotic system]]s.&lt;br /&gt;
&lt;br /&gt;
This theory deals with the long-term qualitative behavior of dynamical systems, and studies the nature of, and when possible the solutions of, the equations of motion of systems that are often primarily mechanical or otherwise physical in nature, such as planetary orbits and the behaviour of electronic circuits, as well as systems that arise in biology, economics, and elsewhere. Much of modern research is focused on the study of chaotic systems.&lt;br /&gt;
&lt;br /&gt;
这个理论处理动力系统的长期定性行为。&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;如果能够得到解的话，还可以研究系统的运动方程。这些方程通常运用到机械或物理研究领域，如行星轨道和电子电路，以及出现在生物学，经济学和其他地方的系统。&amp;lt;/font&amp;gt;现代的研究大多集中在对混沌系统的研究上。&lt;br /&gt;
&lt;br /&gt;
这个理论处理动力系统的长期定性行为，&amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;并且研究系统的动力方程的规律，努力求得可能的解。这些系统通常是一些自然领域里的机械系统或其他物理系统，例如行星轨道和电子电路，也包括一些生物学、经济学和其他学科里的系统。&amp;lt;/font&amp;gt;现代的研究大多集中在对混沌系统的研究上。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This field of study is also called just ''dynamical systems'', ''mathematical dynamical systems theory'' or the ''mathematical theory of dynamical systems''.&lt;br /&gt;
&lt;br /&gt;
This field of study is also called just dynamical systems, mathematical dynamical systems theory or the mathematical theory of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
这个研究领域也被称为动力系统，数学动力系统理论或动力系统的数学理论。&lt;br /&gt;
&lt;br /&gt;
[[Image:Lorenz attractor yb.svg|thumb|240px|right|The [[Lorenz attractor]] is an example of a [[non-linear]] dynamical system. Studying this system helped give rise to [[chaos theory]].]]&lt;br /&gt;
&lt;br /&gt;
The [[Lorenz attractor is an example of a non-linear dynamical system. Studying this system helped give rise to chaos theory.]]&lt;br /&gt;
&lt;br /&gt;
'''洛伦兹吸引子 Lorenz Attractor'''是非线性动力系统的一个例子。对这个系统的研究产生了混沌理论。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Overview 综述 ==&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory and [[chaos theory]] deal with the long-term qualitative behavior of [[dynamical system]]s. Here, the focus is not on finding precise solutions to the equations defining the dynamical system (which is often hopeless), but rather to answer questions like &amp;quot;Will the system settle down to a steady state in the long term, and if so, what are the possible steady states?&amp;quot;, or &amp;quot;Does the long-term behavior of the system depend on its initial condition?&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory and chaos theory deal with the long-term qualitative behavior of dynamical systems. Here, the focus is not on finding precise solutions to the equations defining the dynamical system (which is often hopeless), but rather to answer questions like &amp;quot;Will the system settle down to a steady state in the long term, and if so, what are the possible steady states?&amp;quot;, or &amp;quot;Does the long-term behavior of the system depend on its initial condition?&amp;quot;&lt;br /&gt;
&lt;br /&gt;
动力系统理论和'''混沌理论 Chaos Theory'''是用来处理动力系统的长期定性行为的理论。寻找动力系统方程的精确解通常是很难达到的。这两个理论的重点不在于找到精确解，而是回答如下的问题，如“系统长期来看是否会稳定下来，如果可以，那么可能的稳定状态是什么样的?”，或“系统长期的行为是否取决于其初始条件?”&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
An important goal is to describe the fixed points, or steady states of a given dynamical system; these are values of the variable that don't change over time. Some of these fixed points are ''attractive'', meaning that if the system starts out in a nearby state, it converges towards the fixed point.&lt;br /&gt;
&lt;br /&gt;
An important goal is to describe the fixed points, or steady states of a given dynamical system; these are values of the variable that don't change over time. Some of these fixed points are attractive, meaning that if the system starts out in a nearby state, it converges towards the fixed point.&lt;br /&gt;
&lt;br /&gt;
描述给定动力系统的不动点或'''&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;定态&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;稳态&amp;lt;/font&amp;gt;Steady States'''是一个重要的目标。不动点或&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;定态&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;稳态&amp;lt;/font&amp;gt;的变量值不会随时间的变化而变化。一些不动点是有吸引力的（attractive），即如果系统的初始值在它的附近，系统最终会收敛到这个不动点。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Similarly, one is interested in ''periodic points'', states of the system that repeat after several timesteps. Periodic points can also be attractive. [[Sharkovskii's theorem]] is an interesting statement about the number of periodic points of a one-dimensional discrete dynamical system.&lt;br /&gt;
&lt;br /&gt;
Similarly, one is interested in periodic points, states of the system that repeat after several timesteps. Periodic points can also be attractive. Sharkovskii's theorem is an interesting statement about the number of periodic points of a one-dimensional discrete dynamical system.&lt;br /&gt;
&lt;br /&gt;
人们还对动力系统的'''周期点 Periodic Points'''感兴趣，&amp;lt;font color='red'&amp;gt;即系统在几个时间步之后会不断重复的状态。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;即系统在重复几个时间步之后的状态。&amp;lt;/font&amp;gt;周期点也可以是有吸引力的。Sharkovskii定理描述了一维离散动力系统的周期点的个数。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Even simple [[nonlinear dynamical system]]s often exhibit seemingly random behavior that has been called ''chaos''.&amp;lt;ref&amp;gt;{{cite journal |last=Grebogi |first=C. |last2=Ott |first2=E. |last3=Yorke |first3=J. |year=1987 |title=Chaos, Strange Attractors, and Fractal Basin Boundaries in Nonlinear Dynamics |journal=[[Science (journal)|Science]] |volume=238 |issue=4827 |pages=632–638 |jstor=1700479 |doi=10.1126/science.238.4827.632 |pmid=17816542 |bibcode=1987Sci...238..632G }}&amp;lt;/ref&amp;gt; The branch of dynamical systems that deals with the clean definition and investigation of chaos is called ''[[chaos theory]]''.&lt;br /&gt;
&lt;br /&gt;
Even simple nonlinear dynamical systems often exhibit seemingly random behavior that has been called chaos. The branch of dynamical systems that deals with the clean definition and investigation of chaos is called chaos theory.&lt;br /&gt;
&lt;br /&gt;
即使是简单的非线性动力系统也常常表现出看似随机的行为，这种行为被称为混沌。混沌理论主要研究混沌的清晰定义和混沌的现象，它是动力系统理论的一个分支。&lt;br /&gt;
&lt;br /&gt;
== History 历史==&lt;br /&gt;
&lt;br /&gt;
The concept of dynamical systems theory has its origins in [[Newtonian mechanics]]. There, as in other natural sciences and engineering disciplines, the evolution rule of dynamical systems is given implicitly by a relation that gives the state of the system only a short time into the future.&lt;br /&gt;
&lt;br /&gt;
The concept of dynamical systems theory has its origins in Newtonian mechanics. There, as in other natural sciences and engineering disciplines, the evolution rule of dynamical systems is given implicitly by a relation that gives the state of the system only a short time into the future.&lt;br /&gt;
&lt;br /&gt;
动态系统理论的概念起源于牛顿运动定律。与其他自然科学和工程学科一样，动力系统的演化规律也是通过一种预测系统在未来很短时间内的状态的关系隐含地给出的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Before the advent of [[computer|fast computing machines]], solving a dynamical system required sophisticated mathematical techniques and could only be accomplished for a small class of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
Before the advent of fast computing machines, solving a dynamical system required sophisticated mathematical techniques and could only be accomplished for a small class of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
在高速计算机器出现之前，解决动力系统问题需要复杂的数学技能，而且还只能解决一小类动力系统问题。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Some excellent presentations of mathematical dynamic system theory include {{harvtxt|Beltrami|1990}}, {{harvtxt|Luenberger|1979}}, {{harvtxt|Padulo|Arbib|1974}}, and {{harvtxt|Strogatz|1994}}.&amp;lt;ref&amp;gt;Jerome R. Busemeyer (2008), [http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html &amp;quot;Dynamic Systems&amp;quot;]. To Appear in: ''Encyclopedia of cognitive science'', Macmillan. Retrieved 8 May 2008.  {{webarchive |url=https://web.archive.org/web/20080613053119/http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html |date=June 13, 2008 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Some excellent presentations of mathematical dynamic system theory include , , , and . To Appear in: ''Encyclopedia of cognitive science'', Macmillan. Retrieved 8 May 2008&lt;br /&gt;
&lt;br /&gt;
优秀的数学动力系统理论包括，，，和。--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|存疑]]）。&lt;br /&gt;
&lt;br /&gt;
&amp;lt;font color='blue'&amp;gt;原文是：Some excellent presentations of mathematical dynamic system theory include Beltrami (1990), Luenberger (1979), Padulo &amp;amp; Arbib (1974), and Strogatz (1994).[2] 是不是在粘贴或解析时内容有丢失？&lt;br /&gt;
&lt;br /&gt;
一些优秀的数学动力系统理论包括贝尔特拉米（Beltrami，1990年），龙伯格(Luenberger，1979年），帕杜罗&amp;amp;阿尔比布（Padulo＆Arbib，1974年）和斯托加茨（Strogatz，1994年）。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Concepts 概念==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Dynamical systems 动力系统===&lt;br /&gt;
&lt;br /&gt;
{{main|Dynamical system (definition)}}&lt;br /&gt;
&lt;br /&gt;
The [[dynamical system]] concept is a mathematical [[formal system|formalization]] for any fixed &amp;quot;rule&amp;quot; that describes the [[time]] dependence of a point's position in its [[ambient space]].  Examples include the [[mathematical model]]s that describe the swinging of a clock pendulum, the flow of water in a pipe, and the number of fish each spring in a lake.&lt;br /&gt;
&lt;br /&gt;
The dynamical system concept is a mathematical formalization for any fixed &amp;quot;rule&amp;quot; that describes the time dependence of a point's position in its ambient space.  Examples include the mathematical models that describe the swinging of a clock pendulum, the flow of water in a pipe, and the number of fish each spring in a lake.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;动力系统是一个对任何描述了点的位置在周围环境随时间变化的“固定”规则的数学式。&amp;lt;/font&amp;gt;&amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;动力系统概念是对描述了一个点的位置在其周围环境中随时间变化的任何“固定”规则的数学形式化。&amp;lt;/font&amp;gt;举例来说，描述钟摆摆动、管道中的水流以及每年春天湖中鱼的数量的数学模型，都属于动力系统的概念范畴。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A dynamical system has a ''state'' determined by a collection of [[real numbers]], or more generally by a [[Set (mathematics)|set]] of [[Point (geometry)|points]] in an appropriate ''state space''.  Small changes in the state of the system correspond to small changes in the numbers.  The numbers are also the coordinates of a geometrical space—a [[manifold]].   The ''evolution rule'' of the dynamical system is a [[function (mathematics)|fixed rule]] that describes what future states follow from the current state.  The rule may be [[Deterministic system (mathematics)|deterministic]] (for a given time interval only one future state follows from the current state) or [[stochastic differential equation|stochastic]] (the evolution of the state is subject to random shocks).&lt;br /&gt;
&lt;br /&gt;
A dynamical system has a state determined by a collection of real numbers, or more generally by a set of points in an appropriate state space.  Small changes in the state of the system correspond to small changes in the numbers.  The numbers are also the coordinates of a geometrical space—a manifold.   The evolution rule of the dynamical system is a fixed rule that describes what future states follow from the current state.  The rule may be deterministic (for a given time interval only one future state follows from the current state) or stochastic (the evolution of the state is subject to random shocks).&lt;br /&gt;
&lt;br /&gt;
动力系统的状态是由一组实数决定的，更广泛地说，是由适当的状态空间中的一组点决定的。系统状态的微小变化对应于数字的变化。这些数字也是几何空间——'''流形 Manifold'''——的坐标组。&amp;lt;font color='red'&amp;gt;动力系统的演化是描述了在当前状态之后出现的未来状态的固定规则。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;动力系统的演化规律是一种固定的规则，它描述了从当前状态得出的未来状态。&amp;lt;/font&amp;gt;这个规则可以是确定性的(在给定的时间间隔内，有且仅有一个未来状态在当前状态之后出现)，或随机性的(状态的演化受到随机因素的影响)。&lt;br /&gt;
&lt;br /&gt;
=== Dynamicism 动态主义===&lt;br /&gt;
&lt;br /&gt;
[[Dynamicism]], also termed the ''dynamic hypothesis'' or the ''dynamic hypothesis in cognitive science'' or ''dynamic cognition'', is a new approach in [[cognitive science]] exemplified by the work of philosopher [[Tim van Gelder]]. It argues that [[differential equations]] are more suited to modelling [[cognition]] than more traditional [[computer]] models.&lt;br /&gt;
&lt;br /&gt;
Dynamicism, also termed the dynamic hypothesis or the dynamic hypothesis in cognitive science or dynamic cognition, is a new approach in cognitive science exemplified by the work of philosopher Tim van Gelder. It argues that differential equations are more suited to modelling cognition than more traditional computer models.&lt;br /&gt;
&lt;br /&gt;
'''动态主义 Dynamicism'''，也称动态假设，&amp;lt;font color='red'&amp;gt;或称认知科学、动态认知中的动态假设，&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;或称认知科学的动态假设或动态认知，&amp;lt;/font&amp;gt;是以哲学家Tim van Gelder的著作为代表的认知科学的一种新取向。动态主义认为微分方程比传统的计算机模型更适合于建立认知模型。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Nonlinear system 非线性系统===&lt;br /&gt;
&lt;br /&gt;
{{main|Nonlinear system}}&lt;br /&gt;
&lt;br /&gt;
In [[mathematics]], a [[nonlinear system]] is a system that is not [[linear system|linear]]—i.e., a system that does not satisfy the [[superposition principle]]. Less technically, a nonlinear system is any problem where the variable(s) to solve for cannot be written as a linear sum of independent components. A [[Homogeneity (physics)|nonhomogeneous]] system, which is linear apart from the presence of a function of the [[independent variable]]s, is nonlinear according to a strict definition, but such systems are usually studied alongside linear systems, because they can be transformed to a linear system as long as a particular solution is known.&lt;br /&gt;
&lt;br /&gt;
In mathematics, a nonlinear system is a system that is not linear—i.e., a system that does not satisfy the superposition principle. Less technically, a nonlinear system is any problem where the variable(s) to solve for cannot be written as a linear sum of independent components. A nonhomogeneous system, which is linear apart from the presence of a function of the independent variables, is nonlinear according to a strict definition, but such systems are usually studied alongside linear systems, because they can be transformed to a linear system as long as a particular solution is known.&lt;br /&gt;
&lt;br /&gt;
在数学中，'''非线性系统 Nonlinear System'''是指系统不是线性的——也就是说，一个不满足叠加原理的系统。更通俗地说，非线性系统是待求解变量不能被写成其独立分量的线性和的系统。非齐次系统根据定义严格来说是非线性的，除了它的自变量&amp;lt;font color='red'&amp;gt;&amp;lt;s&amp;gt;包含&amp;lt;/s&amp;gt;&amp;lt;/font&amp;gt;函数以外其他部分都是线性的。&amp;lt;font color='red'&amp;gt;但非齐次系统通常与线性系统一起研究，因为只要知道特解，它们就可以转化为线性系统。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;但非齐次系统通常可当做线性系统进行研究，因为只要知道特定解，它就可以转化为线性系统。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Related fields 相关领域==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Arithmetic dynamics &amp;lt;font color='red'&amp;gt;算术动态系统&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;算术动力学&amp;lt;/font&amp;gt;===&lt;br /&gt;
&lt;br /&gt;
:[[Arithmetic dynamics]] is a field that emerged in the 1990s that amalgamates two areas of mathematics, [[dynamical systems]] and [[number theory]]. Classically, discrete dynamics refers to the study of the [[Iterated function|iteration]] of self-maps of the [[complex plane]] or [[real line]]. Arithmetic dynamics is the study of the number-theoretic properties of integer, rational, {{math|&amp;lt;var&amp;gt;p&amp;lt;/var&amp;gt;}}-adic, and/or algebraic points under repeated application of a [[polynomial]] or [[rational function]].&lt;br /&gt;
&lt;br /&gt;
Arithmetic dynamics is a field that emerged in the 1990s that amalgamates two areas of mathematics, dynamical systems and number theory. Classically, discrete dynamics refers to the study of the iteration of self-maps of the complex plane or real line. Arithmetic dynamics is the study of the number-theoretic properties of integer, rational, -adic, and/or algebraic points under repeated application of a polynomial or rational function.&lt;br /&gt;
&lt;br /&gt;
'''&amp;lt;font color='red'&amp;gt;算术动态系统&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;算术动力学&amp;lt;/font&amp;gt; Arithmetic Dynamics'''是20世纪90年代出现的一个领域，融合了动力系统和数论这两个数学领域。经典的离散动力学研究复平面或&amp;lt;font color='blue'&amp;gt;实直线&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;实数轴&amp;lt;/font&amp;gt;的自映射的迭代。&amp;lt;font color='red'&amp;gt;算术动态系统研究内容是在多项式或有理函数中的整数、有理数、并元 --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|存疑]]） 和/或代数点的数论性质。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;算术动力学是在反复应用多项式或有理函数的情况下研究整数，有理数，p进数(p-adic)和/或代数点的数论性质。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Chaos theory 混沌理论===&lt;br /&gt;
&lt;br /&gt;
:[[Chaos theory]] describes the behavior of certain [[dynamical system (definition)|dynamical system]]s – that is, systems whose state evolves with time – that may exhibit dynamics that are highly sensitive to initial conditions (popularly referred to as the [[butterfly effect]]). As a result of this sensitivity, which manifests itself as an exponential growth of perturbations in the initial conditions, the behavior of chaotic systems appears [[randomness|random]]. This happens even though these systems are [[deterministic system (philosophy)|deterministic]], meaning that their future dynamics are fully defined by their initial conditions, with no random elements involved. This behavior is known as deterministic chaos, or simply ''chaos''.&lt;br /&gt;
&lt;br /&gt;
Chaos theory describes the behavior of certain dynamical systems – that is, systems whose state evolves with time – that may exhibit dynamics that are highly sensitive to initial conditions (popularly referred to as the butterfly effect). As a result of this sensitivity, which manifests itself as an exponential growth of perturbations in the initial conditions, the behavior of chaotic systems appears random. This happens even though these systems are deterministic, meaning that their future dynamics are fully defined by their initial conditions, with no random elements involved. This behavior is known as deterministic chaos, or simply chaos.&lt;br /&gt;
&lt;br /&gt;
混沌理论描述了某些状态随时间演化的动力系统的行为，这些系统可能表现出对初始条件高度敏感的特点（通常被称为'''蝴蝶效应 Butterfly Effect'''）。由于扰动受初始条件影响而指数增长，因此混沌系统具有敏感性，敏感性使它的行为看起来是随机的。但是这种敏感性也会出现在确定的动力系统中，即&amp;lt;font color='blue'&amp;gt;它们&amp;lt;/font&amp;gt;未来的动力&amp;lt;s&amp;gt;学&amp;lt;/s&amp;gt;完全由它的初始条件定义，没有任何随机因素参与的系统中。这种现象被称为确定性混沌，或简单混沌。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Complex systems 复杂系统===&lt;br /&gt;
&lt;br /&gt;
:[[Complex systems]] is a scientific field that studies the common properties of [[system]]s considered [[Complexity|complex]] in [[nature]], [[society]], and [[science]]. It is also called ''complex systems theory'', ''complexity science'', ''study of complex systems'' and/or ''sciences of complexity''. The key problems of such systems are  difficulties with their formal [[Scientific modelling|modeling]] and [[simulation]]. From such perspective, in different research contexts complex systems are defined on the base of their different attributes.&lt;br /&gt;
&lt;br /&gt;
Complex systems is a scientific field that studies the common properties of systems considered complex in nature, society, and science. It is also called complex systems theory, complexity science, study of complex systems and/or sciences of complexity. The key problems of such systems are  difficulties with their formal modeling and simulation. From such perspective, in different research contexts complex systems are defined on the base of their different attributes.&lt;br /&gt;
&lt;br /&gt;
'''复杂系统 Complex Systems'''是研究自然、社会和科学中复杂现象的共同性质的科学领域。它也被称为复杂系统理论、复杂性科学、复杂系统研究和关于复杂性的科学。这些系统的关键问题在于对系统的形式化建模与仿真&amp;lt;font color='blue'&amp;gt;的困难&amp;lt;/font&amp;gt;。因此，复杂系统是根据在不同的研究语境中的不同属性来定义的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
:The study of complex systems is bringing new vitality to many areas of science where a more typical [[reductionist]] strategy has fallen short. ''Complex systems'' is therefore often used as a broad term encompassing a research approach to problems in many diverse disciplines including [[neurosciences]], [[social sciences]], [[meteorology]], [[chemistry]], [[physics]], [[computer science]], [[psychology]], [[artificial life]], [[evolutionary computation]], [[economics]], earthquake prediction, [[molecular biology]] and inquiries into the nature of living [[cell (biology)|cell]]s themselves.&lt;br /&gt;
&lt;br /&gt;
The study of complex systems is bringing new vitality to many areas of science where a more typical reductionist strategy has fallen short. Complex systems is therefore often used as a broad term encompassing a research approach to problems in many diverse disciplines including neurosciences, social sciences, meteorology, chemistry, physics, computer science, psychology, artificial life, evolutionary computation, economics, earthquake prediction, molecular biology and inquiries into the nature of living cells themselves.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;font color='red'&amp;gt;还原论策略已经不足以研究许多科学领域的问题，而复杂系统的研究则为科学带来了广泛的新活力。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;复杂系统的研究为许多科学领域带来了新的活力，在这些领域中，更为典型的还原论策略已经不足。&amp;lt;/font&amp;gt;复杂系统通常被用作一个应用广泛的研究方法术语，并涵盖许多不同的学科，包括神经科学、社会科学、气象学、化学、物理学、计算机科学、心理学、人工生命、进化计算、经济学、地震预测、分子生物学以及对活细胞的研究等。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Control theory 控制理论===&lt;br /&gt;
&lt;br /&gt;
:[[Control theory]] is an interdisciplinary branch of [[engineering]] and [[mathematics]], in part it deals with influencing the behavior of [[dynamical system]]s.&lt;br /&gt;
&lt;br /&gt;
Control theory is an interdisciplinary branch of engineering and mathematics, in part it deals with influencing the behavior of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
'''控制理论 Control Theory'''是工程和数学的一个交叉学科，它的其中一部分研究影响动力系统行为的各种因素。&lt;br /&gt;
&lt;br /&gt;
控制理论是一个研究如何调整动态系统特性的理论，它也是工程和数学的一个交叉学科，逐渐的应用在许多社会科学中，例如心理学、社会学（社会学中的控制理论）、犯罪学及'''金融系统 Financial System'''。控制理论一般的目的是借由控制器的动作让系统稳定，也就是系统维持在设定值，而且不会在设定值附近晃动。设定值一般维持不变的控制称为调节，设定值快速变化，要求跟踪速度加速度等的控制称为伺服。它的其中一部分研究影响动力系统行为的各种因素。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Ergodic theory 遍历理论===&lt;br /&gt;
&lt;br /&gt;
:[[Ergodic theory]] is a branch of [[mathematics]] that studies [[dynamical system]]s with an [[invariant measure]] and related problems. Its initial development was motivated by problems of [[statistical physics]].&lt;br /&gt;
&lt;br /&gt;
Ergodic theory is a branch of mathematics that studies dynamical systems with an invariant measure and related problems. Its initial development was motivated by problems of statistical physics.&lt;br /&gt;
&lt;br /&gt;
'''遍历理论 Ergodic Theory'''是数学的一个分支，研究有不变测度和相关问题的动力系统。它最初的发展受到了统计物理学的推动。&lt;br /&gt;
遍历理论是研究保测变换的渐近性态的数学分支。它起源于为统计力学提供基础的&amp;quot;遍历假设&amp;quot;研究，并与动力系统理论、概率论、信息论、泛函分析、数论等数学分支有着密切的联系。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Functional analysis 泛函分析===&lt;br /&gt;
&lt;br /&gt;
:[[Functional analysis]] is the branch of [[mathematics]], and specifically of [[mathematical analysis|analysis]], concerned with the study of [[vector space]]s and [[operator (mathematics)|operator]]s acting upon them. It has its historical roots in the study of [[functional space]]s, in particular transformations of [[function (mathematics)|functions]], such as the [[Fourier transform]], as well as in the study of [[differential equations|differential]] and [[integral equations]]. This usage of the word ''[[functional (mathematics)|functional]]'' goes back to the [[calculus of variations]], implying a function whose argument is a function. Its use in general has been attributed to mathematician and physicist [[Vito Volterra]] and its founding is largely attributed to mathematician [[Stefan Banach]].&lt;br /&gt;
&lt;br /&gt;
Functional analysis is the branch of mathematics, and specifically of analysis, concerned with the study of vector spaces and operators acting upon them. It has its historical roots in the study of functional spaces, in particular transformations of functions, such as the Fourier transform, as well as in the study of differential and integral equations. This usage of the word functional goes back to the calculus of variations, implying a function whose argument is a function. Its use in general has been attributed to mathematician and physicist Vito Volterra and its founding is largely attributed to mathematician Stefan Banach.&lt;br /&gt;
&lt;br /&gt;
'''泛函分析 Functional analysis'''是数学分析的一个分支，研究向量空间和作用于向量空间的算子。它源于对函数空间的研究，特别是对函数变换的研究，例如傅里叶变换，微积分方程的研究等。泛函分析的名称“Functional Analysis”中，“functional”这个词的用法可以追溯到变分法，也就是说函数的参数是一个函数。这个词的使用一般被认为归功于数学家和物理学家Vito Volterra，和数学家Stefan Banach。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Graph dynamical systems 图动力系统===&lt;br /&gt;
&lt;br /&gt;
:The concept of [[graph dynamical system]]s (GDS) can be used to capture a wide range of processes taking place on graphs or networks. A major theme in the mathematical and computational analysis of graph dynamical systems is to relate their structural properties (e.g. the network connectivity) and the global dynamics that result.&lt;br /&gt;
&lt;br /&gt;
The concept of graph dynamical systems (GDS) can be used to capture a wide range of processes taking place on graphs or networks. A major theme in the mathematical and computational analysis of graph dynamical systems is to relate their structural properties (e.g. the network connectivity) and the global dynamics that result.&lt;br /&gt;
&lt;br /&gt;
'''图动力系统 Graph dynamical systems (GDS)'''可以用来描绘图或网络上发生的各种过程。&amp;lt;font color='red'&amp;gt;图动力系统的数学和计算分析的一个主要主题是关联它们的结构性质(例如:网络连接)和结构性质造成的网络整体的动态结果。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;图动力系统的数学和计算分析的一个主要主题是将其结构特性（例如：网络连接性）与其所产生的全局动力学联系起来。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Projected dynamical systems 投影动力系统===&lt;br /&gt;
&lt;br /&gt;
:[[Projected dynamical systems]] it is a [[mathematics|mathematical]] theory investigating the behaviour of [[dynamical system]]s where solutions are restricted to a constraint set. The discipline shares connections to and applications with both the static world of [[Optimization (mathematics)|optimization]] and [[Equilibrium point|equilibrium]] problems and the dynamical world of [[ordinary differential equations]]. A projected dynamical system is given by the [[flow (mathematics)|flow]] to the projected differential equation.&lt;br /&gt;
&lt;br /&gt;
Projected dynamical systems it is a mathematical theory investigating the behaviour of dynamical systems where solutions are restricted to a constraint set. The discipline shares connections to and applications with both the static world of optimization and equilibrium problems and the dynamical world of ordinary differential equations. A projected dynamical system is given by the flow to the projected differential equation.&lt;br /&gt;
&lt;br /&gt;
'''投影动力系统 Projected Dynamical Systems'''是研究解在一个约束集内的动力系统行为的数学理论。这门学科与静态世界中的最优化和平衡问题以及动态世界中的常微分方程都有联系&amp;lt;font color='blue'&amp;gt;和&amp;lt;s&amp;gt;，并且都有相互联系的&amp;lt;/s&amp;gt;&amp;lt;/font&amp;gt;应用。一个投影动力系统是由投影微分方程的'''流形 flow'''给定的。&lt;br /&gt;
通过对投影微分方程的流分析，给出了一个投影动力系统的表达式：&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\frac{dx(t)}{dt} = \Pi_K(x(t),-F(x(t)))&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中K为约束集。这种形式的微分方程因具有不连续的向量场而值得注意。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Symbolic dynamics 符号动力学===&lt;br /&gt;
&lt;br /&gt;
:[[Symbolic dynamics]] is the practice of modelling a topological or smooth [[dynamical system]] by a discrete space consisting of infinite [[sequence]]s of abstract symbols, each of which corresponds to a state of the system, with the dynamics (evolution) given by the [[shift operator]].&lt;br /&gt;
&lt;br /&gt;
Symbolic dynamics is the practice of modelling a topological or smooth dynamical system by a discrete space consisting of infinite sequences of abstract symbols, each of which corresponds to a state of the system, with the dynamics (evolution) given by the shift operator.&lt;br /&gt;
&lt;br /&gt;
'''符号动力学 Symbolic Dynamics'''是通过一个由抽象符号的无限序列组成的离散空间建立一个拓扑或光滑动力系统的方法。每一个抽象符号的无限序列序列对应于系统的一个状态，并由移位算子给出动力学(演化)。&lt;br /&gt;
&amp;lt;font color='blue'&amp;gt;'''符号动力学 Symbolic Dynamics'''是通过离散空间对拓扑或平滑动力学系统进行建模的方法，该离散空间由无限的抽象符号序列组成，每个抽象符号对应于系统的一个状态，并且由移位运算符给出动力学（演化）。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== System dynamics 系统动力学===&lt;br /&gt;
&lt;br /&gt;
:[[System dynamics]] is an approach to understanding the behaviour of systems over time.  It deals with internal feedback loops and time delays that affect the behaviour and state of the entire system.&amp;lt;ref name=&amp;quot;sysdyn&amp;quot;&amp;gt;[http://sysdyn.clexchange.org MIT System Dynamics in Education Project (SDEP)&amp;lt;!-- Bot generated title --&amp;gt;] {{webarchive|url=https://web.archive.org/web/20080509163801/http://sysdyn.clexchange.org/ |date=2008-05-09 }}&amp;lt;/ref&amp;gt;  What makes using system dynamics different from other approaches to studying systems is the use of [[feedback]] loops and [[Stock and flow|stocks and flows]].  These elements help describe how even seemingly simple systems display baffling [[nonlinearity]].&lt;br /&gt;
&lt;br /&gt;
System dynamics is an approach to understanding the behaviour of systems over time.  It deals with internal feedback loops and time delays that affect the behaviour and state of the entire system.  What makes using system dynamics different from other approaches to studying systems is the use of feedback loops and stocks and flows.  These elements help describe how even seemingly simple systems display baffling nonlinearity.&lt;br /&gt;
&lt;br /&gt;
'''系统动力学 System Dynamics'''是一种理解系统随时间变化行为的方法。它是用来处理影响整个系统行为和状态的内部反馈回路和时间延迟的方法。系统动力学不同于其他系统研究方法的地方在于它使用了反馈环、&amp;lt;font color='red'&amp;gt;股票（stocks）和流形（flows）&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;存量(stocks)和流量(flows)--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|原wiki里这两个词指向:https://en.wikipedia.org/wiki/Stock_and_flow ，估计应该是存量和流量的意思，也可以群里大家讨论一下]]）&amp;lt;/font&amp;gt;--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|如何翻译stocks 和 folows]]）的元素。这些元素有助于描述看似简单的系统如何显示复杂的非线性行为。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Topological dynamics 拓扑动力学===&lt;br /&gt;
&lt;br /&gt;
:[[Topological dynamics]] is a branch of the theory of dynamical systems in which qualitative, asymptotic properties of dynamical systems are studied from the viewpoint of [[general topology]].&lt;br /&gt;
&lt;br /&gt;
Topological dynamics is a branch of the theory of dynamical systems in which qualitative, asymptotic properties of dynamical systems are studied from the viewpoint of general topology.&lt;br /&gt;
&lt;br /&gt;
'''拓扑动力学 Topological Dynamics'''是动力系统理论的一个分支。在拓朴动力学中，动力系统的定性性质和渐近性质是从一般拓扑学的观点来研究的。&lt;br /&gt;
&lt;br /&gt;
== Applications 应用==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== In human development 在人类发展中的应用===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In [[Developmental psychology|human development]], dynamical systems theory has been used to enhance and simplify Erik Erikson's [[eight stages of psychosocial development]] and offers a standard method of examining the universal pattern of human development. This method is based on the self-organizing and [[fractal]] properties of the [[Fibonacci sequence]].&amp;lt;ref name=Sacco&amp;gt;{{cite journal|last=Sacco|first=R.G.|title=Re-envisaging the eight developmental stages of Erik Erikson: The Fibonacci Life-Chart Method (FLCM)|journal=Journal of Educational and Developmental Psychology|date=2013|volume=3|issue=1|pages=140–146|doi=10.5539/jedp.v3n1p140|doi-access=free}}&amp;lt;/ref&amp;gt; Using mathematical modeling, a natural progression of human development with eight life stages has been identified:  early infancy (0–2 years), toddler (2–4 years), early childhood (4–7 years), middle childhood (7–11 years), adolescence (11–18 years), young adulthood (18–29 years), middle adulthood (29–48 years), and older adulthood (48–78+ years).&amp;lt;ref name=Sacco/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In human development, dynamical systems theory has been used to enhance and simplify Erik Erikson's eight stages of psychosocial development and offers a standard method of examining the universal pattern of human development. This method is based on the self-organizing and fractal properties of the Fibonacci sequence. Using mathematical modeling, a natural progression of human development with eight life stages has been identified:  early infancy (0–2 years), toddler (2–4 years), early childhood (4–7 years), middle childhood (7–11 years), adolescence (11–18 years), young adulthood (18–29 years), middle adulthood (29–48 years), and older adulthood (48–78+ years).&lt;br /&gt;
&lt;br /&gt;
在人类发展方面，动力系统理论已经被用来增强和简化 Erik Erikson 的'''社会心理发展8阶段理论 Eight Stages of Psychosocial Development'''，并提供了一个检验人类发展普遍模式的标准方法。该方法基于斐波那契数列的'''自组织性 self-organizing'''和'''分形 Fractal''' 特性。利用数学模型，人类发展的自然进程被分为8个生命阶段: 早期婴儿期(0-2岁)、幼儿期(2-4岁)、童年早期(4-7岁)、童年中期(7-11岁)、青春期(11-18岁)、成年早期(18-29岁)、成年中期(29-48岁)和老年成年期(48-78岁及以上)。&lt;br /&gt;
&lt;br /&gt;
--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|原wiki里没有这个应用呀？是被删除了吗？]] &lt;br /&gt;
&lt;br /&gt;
According to this model, stage transitions between age intervals represent self-organization processes at multiple levels (e.g., molecules, genes, cell, organ, organ system, organism, behavior, and environment). For example, at the stage transition from [[adolescence]] to [[young adulthood]], and after reaching the critical point of 18 years of age (young adulthood), a peak in [[testosterone]] is observed in males&amp;lt;ref&amp;gt;{{cite journal |last1=Kelsey |first1=T. W. |title=A validated age-related normative model for male total testosterone shows increasing variance but no decline after age 40 years. |journal=PLOS One |volume=9 |issue=10 |pages=e109346 |doi=10.1371/journal.pone.0109346|pmid=25295520 |year=2014 |pmc=4190174 |bibcode=2014PLoSO...9j9346K }}&amp;lt;/ref&amp;gt; and the period of optimal [[fertility]] begins in females.&amp;lt;ref&amp;gt;{{cite book |last1=Tulandi |first1=T. |title=Preservation of fertility |date=2004 |publisher=Taylor &amp;amp; Francis |pages=1–20}}&amp;lt;/ref&amp;gt; Similarly, at age 30 optimal fertility begins to decline in females,&amp;lt;ref name=&amp;quot;Social Science 2008&amp;quot;&amp;gt;{{cite journal |last1=Blanchflower |first1=D. G. |title=Is well-being U-shaped over the life cycle? |journal=Social Science &amp;amp; Medicine |volume=66 |issue=8 |pages=1733–1749 |doi=10.1016/j.socscimed.2008.01.030|pmid=18316146 |year=2008 |citeseerx=10.1.1.63.5221 }}&amp;lt;/ref&amp;gt; and at the stage transition from [[middle adulthood]] to older adulthood at 48 years, the average age of onset of [[menopause]] occurs.&amp;lt;ref name=&amp;quot;Social Science 2008&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
According to this model, stage transitions between age intervals represent self-organization processes at multiple levels (e.g., molecules, genes, cell, organ, organ system, organism, behavior, and environment). For example, at the stage transition from adolescence to young adulthood, and after reaching the critical point of 18 years of age (young adulthood), a peak in testosterone is observed in males and the period of optimal fertility begins in females. Similarly, at age 30 optimal fertility begins to decline in females, and at the stage transition from middle adulthood to older adulthood at 48 years, the average age of onset of menopause occurs.&lt;br /&gt;
&lt;br /&gt;
根据这个模型，年龄的阶段转换代表了多层次的自组织过程(例如，分子、基因、细胞、器官、器官系统、生物体、行为和环境)。例如，在从青春期向成年早期过渡的阶段中，在达到18岁这一关键年龄之后，男性的睾丸激素达到高峰，女性的最佳生育期开始。同样，在30岁时，女性的最佳生育能力开始下降；在从成年中期过渡到老年成年期时，48岁是绝经的平均年龄。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
These events are physical bioattractors of aging from the perspective of Fibonacci mathematical modeling and dynamically systems theory. In practical terms, prediction in human development becomes possible in the same statistical sense in which the average temperature or precipitation at different times of the year can be used for [[weather forecasting]]. Each of the predetermined stages of human development follows an optimal epigenetic biological pattern. This phenomenon can be explained by the occurrence of Fibonacci numbers in biological [[DNA]]&amp;lt;ref&amp;gt;{{cite journal |last1=Perez |first1=J. C. (2010). |title=Codon populations in single-stranded whole human genome DNA are fractal and fine-tuned by the Golden Ratio 1.618. |journal=Interdisciplinary Sciences: Computational Life Sciences |volume=2 |issue=3 |pages=228–240 |doi=10.1007/s12539-010-0022-0|pmid=20658335 |year=2010 }}&amp;lt;/ref&amp;gt; and self-organizing properties of the Fibonacci numbers that converge on the [[golden ratio]].&lt;br /&gt;
&lt;br /&gt;
These events are physical bioattractors of aging from the perspective of Fibonacci mathematical modeling and dynamically systems theory. In practical terms, prediction in human development becomes possible in the same statistical sense in which the average temperature or precipitation at different times of the year can be used for weather forecasting. Each of the predetermined stages of human development follows an optimal epigenetic biological pattern. This phenomenon can be explained by the occurrence of Fibonacci numbers in biological DNA and self-organizing properties of the Fibonacci numbers that converge on the golden ratio.&lt;br /&gt;
&lt;br /&gt;
从斐波那契数学模型和动力系统理论的角度来看，上述事件是衰老的'''物理生物吸引子Physical Bioattractors'''。实际上，正如一年中不同时间的平均气温和降水量可以用来预测天气，预测人类的发展在统计意义上同样是可能的。人类发展的每个'''预定阶段Predetermined Stages'''都遵循最佳的'''表观遗传生物模式 Epigenetic Biological Pattern'''。这种现象可以用 DNA 中的斐波那契数和收敛于黄金分割比的斐波那契数的自组织特性来解释。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== In biomechanics 在运动生物力学中的应用===&lt;br /&gt;
&lt;br /&gt;
In [[sports biomechanics]], dynamical systems theory has emerged in the movement sciences as a viable framework for modeling athletic performance. From a dynamical systems perspective, the human movement system is a highly intricate network of co-dependent sub-systems (e.g. respiratory, circulatory, nervous, skeletomuscular, perceptual) that are composed of a large number of interacting components (e.g. blood cells, oxygen molecules, muscle tissue, metabolic enzymes, connective tissue and bone). In dynamical systems theory, movement patterns emerge through generic processes of self-organization found in physical and biological systems.&amp;lt;ref&amp;gt;Paul S Glazier, Keith Davids, Roger M Bartlett (2003). [http://www.sportsci.org/jour/03/psg.htm &amp;quot;DYNAMICAL SYSTEMS THEORY: a Relevant Framework for Performance-Oriented Sports Biomechanics Research&amp;quot;]. in: Sportscience 7. Accessed 2008-05-08.&amp;lt;/ref&amp;gt; There is no research validation of any of the claims associated to the conceptual application of this framework.&lt;br /&gt;
&lt;br /&gt;
In sports biomechanics, dynamical systems theory has emerged in the movement sciences as a viable framework for modeling athletic performance. From a dynamical systems perspective, the human movement system is a highly intricate network of co-dependent sub-systems (e.g. respiratory, circulatory, nervous, skeletomuscular, perceptual) that are composed of a large number of interacting components (e.g. blood cells, oxygen molecules, muscle tissue, metabolic enzymes, connective tissue and bone). In dynamical systems theory, movement patterns emerge through generic processes of self-organization found in physical and biological systems. There is no research validation of any of the claims associated to the conceptual application of this framework.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;font color='red'&amp;gt;在运动生物力学中，动力系统理论新兴地成为对运动表现建模的可行框架。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;在运动生物力学中，动力系统理论在运动科学中崭露头角，成为一种对运动表现建模的可行框架。&amp;lt;/font&amp;gt;从动力系统的角度来看，人类的运动系统是由高度复杂和相互依赖的子系统网络（如呼吸、循环、神经、骨骼肌系统和知觉系统等）组成的，它们由大量相互作用的部分组成（包括血细胞、氧分子、肌肉组织、代谢酶、结缔组织和骨骼等)。动力系统理论中，运动模式通过物理系统和生物系统中的一般自组织过程出现。没有任何研究证实与这一框架的概念&amp;lt;font color='blue'&amp;gt;应用&amp;lt;/font&amp;gt;相关的任何主张。&lt;br /&gt;
&lt;br /&gt;
=== In cognitive science 在认知科学中的应用===&lt;br /&gt;
&lt;br /&gt;
Dynamical system theory has been applied in the field of [[neurodynamics|neuroscience]] and [[cognitive science|cognitive development]], especially in [[the neo-Piagetian theories of cognitive development]]. It is the belief that cognitive development is best represented by physical theories rather than theories based on syntax and [[AI]]. It also believed that differential equations are the most appropriate tool for modeling human behavior. These equations are interpreted to represent an agent's cognitive trajectory through [[state space]]. In other words, dynamicists argue that [[psychology]] should be (or is) the description (via differential equations) of the cognitions and behaviors of an agent under certain environmental and internal pressures. The language of chaos theory is also frequently adopted.&lt;br /&gt;
&lt;br /&gt;
Dynamical system theory has been applied in the field of neuroscience and cognitive development, especially in the neo-Piagetian theories of cognitive development. It is the belief that cognitive development is best represented by physical theories rather than theories based on syntax and AI. It also believed that differential equations are the most appropriate tool for modeling human behavior. These equations are interpreted to represent an agent's cognitive trajectory through state space. In other words, dynamicists argue that psychology should be (or is) the description (via differential equations) of the cognitions and behaviors of an agent under certain environmental and internal pressures. The language of chaos theory is also frequently adopted.&lt;br /&gt;
&lt;br /&gt;
动力系统理论已经被应用于神经科学和认知发展领域，特别是在认知发展的'''新皮亚杰学派 neo-Piagetian'''中。人们相信，物理学理论比句法学理论和人工智能理论更能代表认知发展。人们还相信微分方程是人类行为建模最合适的工具。&amp;lt;s&amp;gt;人们认为&amp;lt;/s&amp;gt;微分方程可以解释为通过状态空间代表一个主体的认知轨迹的算式。换句话说，动力学家认为心理学应该&amp;lt;font color='blue'&amp;gt;是&amp;lt;/font&amp;gt;(或者&amp;lt;font color='blue'&amp;gt;就&amp;lt;/font&amp;gt;是)(通过微分方程)描述在一定的环境和内部压力下的主体的认知和行为的学科。混沌理论在相关领域也经常被采用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In it, the learner's mind reaches a state of disequilibrium where old patterns have broken down. This is the phase transition of cognitive development. [[Self-organization]] (the spontaneous creation of coherent forms) sets in as activity levels link to each other. Newly formed macroscopic and microscopic structures support each other, speeding up the process. These links form the structure of a new state of order in the mind through a process called ''scalloping'' (the repeated building up and collapsing of complex performance.) This new, novel state is progressive, discrete, idiosyncratic and unpredictable.&amp;lt;ref&amp;gt;{{cite journal|title=The Promise of Dynamic Systems Approaches for an Integrated Account of Human Development|journal=Child Development|date=2000-02-25|first=Mark D.|last=Lewis|volume=71|issue=1|pages=36–43|id= |url=http://home.oise.utoronto.ca/~mlewis/Manuscripts/Promise.pdf|accessdate=2008-04-04|doi=10.1111/1467-8624.00116|pmid=10836556 |citeseerx=10.1.1.72.3668}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In it, the learner's mind reaches a state of disequilibrium where old patterns have broken down. This is the phase transition of cognitive development. Self-organization (the spontaneous creation of coherent forms) sets in as activity levels link to each other. Newly formed macroscopic and microscopic structures support each other, speeding up the process. These links form the structure of a new state of order in the mind through a process called scalloping (the repeated building up and collapsing of complex performance.) This new, novel state is progressive, discrete, idiosyncratic and unpredictable.&lt;br /&gt;
&lt;br /&gt;
在学习的过程中，旧的模式被打破了，学习者的思维达到了一种不平衡的状态。这是认知发展的阶段性转变。自组织(连贯的自发创造(the spontaneous creation of coherent forms))在'''活动水平 Activity Levels'''相互联系时产生。新形成的宏观和微观结构相互支持，加速了这一过程。这些联系在头脑中形成了一种&amp;lt;font color='blue'&amp;gt;有序的&amp;lt;s&amp;gt;具有&amp;lt;/s&amp;gt;&amp;lt;/font&amp;gt;新状态&amp;lt;s&amp;gt;的&amp;lt;/s&amp;gt;结构，这个过程被称为“扇贝化 Scalloping”，也就是头脑的复杂&amp;lt;font color='red'&amp;gt;性能&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;表现&amp;lt;/font&amp;gt;的不断累积和崩溃的过程 --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|扇贝化的翻译拿不准，这句话的描述比较抽象]]）。这种新的状态是渐进的、离散的、异质的的和不可预知的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Dynamic systems theory has recently been used to explain a long-unanswered problem in child development referred to as the [[A-not-B error]].&amp;lt;ref&amp;gt;{{cite journal|title=Development as a dynamic system|journal=Trends in Cognitive Sciences|date=2003-07-30|first=Linda B.|last=Smith|author2=Esther Thelen|volume=7|issue=8|pages=343–8|id= |url=http://www.indiana.edu/~cogdev/labwork/dynamicsystem.pdf|accessdate=2008-04-04|doi=10.1016/S1364-6613(03)00156-6|pmid=12907229|citeseerx=10.1.1.294.2037}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Dynamic systems theory has recently been used to explain a long-unanswered problem in child development referred to as the A-not-B error.&lt;br /&gt;
&lt;br /&gt;
动力系统理论最近还被用来解释儿童发展中一个长期没有答案的问题，即 A-not-B 错误。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===In second language development 在二语习得中的应用===&lt;br /&gt;
&lt;br /&gt;
{{Main|Dynamic approach to second language development}}&lt;br /&gt;
&lt;br /&gt;
The application of Dynamic Systems Theory to study [[second language acquisition]] is attributed to [[Diane Larsen-Freeman]] who published an article in 1997 in which she claimed that [[second language acquisition]] should be viewed as a developmental process which includes [[language attrition]] as well as language acquisition.&amp;lt;ref&amp;gt;{{cite web|url=https://academic.oup.com/applij/article-abstract/18/2/141/134192|title=Chaos/Complexity Science and Second Language Acquisition|date=1997|publisher=Applied Linguistics}}&amp;lt;/ref&amp;gt; In her article she claimed that language should be viewed as a dynamic system which is dynamic, complex, nonlinear, chaotic, unpredictable, sensitive to initial conditions, open, self-organizing, feedback sensitive, and adaptive.&lt;br /&gt;
&lt;br /&gt;
The application of Dynamic Systems Theory to study second language acquisition is attributed to Diane Larsen-Freeman who published an article in 1997 in which she claimed that second language acquisition should be viewed as a developmental process which includes language attrition as well as language acquisition. In her article she claimed that language should be viewed as a dynamic system which is dynamic, complex, nonlinear, chaotic, unpredictable, sensitive to initial conditions, open, self-organizing, feedback sensitive, and adaptive.&lt;br /&gt;
&lt;br /&gt;
动力系统理论在二语习得研究中的应用归功于 Diane Larsen-Freeman，她在1997年发表的一篇文章中认为，二语习得应该被看作是一个包括语言流失和&amp;lt;font color='blue'&amp;gt;语言&amp;lt;/font&amp;gt;习得在内的发展过程。她在文章中认为，语言应该被看作是一个动态的、复杂的、非线性的、混沌的、不可预知的、对初始条件敏感的、开放的、自组织的、反馈敏感的和适应性的动力系统。&lt;br /&gt;
&lt;br /&gt;
== See also 参见==&lt;br /&gt;
&lt;br /&gt;
;Related subjects&lt;br /&gt;
&lt;br /&gt;
Related subjects&lt;br /&gt;
&lt;br /&gt;
相关科目&lt;br /&gt;
&lt;br /&gt;
{{div col|colwidth=20em}}&lt;br /&gt;
&lt;br /&gt;
* [[List of dynamical system topics]] 动力系统主题清单&lt;br /&gt;
&lt;br /&gt;
* [[Baker's map]]&lt;br /&gt;
&lt;br /&gt;
* [[Biological applications of bifurcation theory]] 分支理论的生物学应用&lt;br /&gt;
&lt;br /&gt;
* [[Dynamical system (definition)]] 动力系统（定义）&lt;br /&gt;
&lt;br /&gt;
* [[Embodied Embedded Cognition]] 具身认知&lt;br /&gt;
&lt;br /&gt;
* [[Fibonacci numbers]] 斐波那契数&lt;br /&gt;
&lt;br /&gt;
* [[Fractals]] 分形&lt;br /&gt;
&lt;br /&gt;
* [[Gingerbreadman map]]&lt;br /&gt;
&lt;br /&gt;
* [[Halo orbit]] Halo 轨道&lt;br /&gt;
&lt;br /&gt;
* [[List of types of systems theory]] 动力系统类型清单&lt;br /&gt;
&lt;br /&gt;
* [[Oscillation]] 振动性&lt;br /&gt;
&lt;br /&gt;
* [[Postcognitivism]]&lt;br /&gt;
&lt;br /&gt;
* [[Recurrent neural network]] 递归神经网络&lt;br /&gt;
&lt;br /&gt;
* [[Combinatorics and dynamical systems]] 组合数学和动力系统&lt;br /&gt;
&lt;br /&gt;
* [[Synergetics (Haken)|Synergetics]] 协同学(Haken)&lt;br /&gt;
&lt;br /&gt;
* [[Systemography]]&lt;br /&gt;
&lt;br /&gt;
{{div col end}}&lt;br /&gt;
&lt;br /&gt;
;Related scientists&lt;br /&gt;
&lt;br /&gt;
Related scientists&lt;br /&gt;
&lt;br /&gt;
相关科学家&lt;br /&gt;
&lt;br /&gt;
{{div col|colwidth=20em}}&lt;br /&gt;
&lt;br /&gt;
* [[People in systems and control]]&lt;br /&gt;
&lt;br /&gt;
* [[Dmitri Anosov]]&lt;br /&gt;
&lt;br /&gt;
* [[Vladimir Arnold]]&lt;br /&gt;
&lt;br /&gt;
* [[Nikolay Bogolyubov]]&lt;br /&gt;
&lt;br /&gt;
* [[Andrey Kolmogorov]]&lt;br /&gt;
&lt;br /&gt;
* [[Nikolay Mitrofanovich Krylov|Nikolay Krylov]]&lt;br /&gt;
&lt;br /&gt;
* [[Jürgen Moser]]&lt;br /&gt;
&lt;br /&gt;
* [[Yakov G. Sinai]]&lt;br /&gt;
&lt;br /&gt;
* [[Stephen Smale]]&lt;br /&gt;
&lt;br /&gt;
* [[Hillel Furstenberg]]&lt;br /&gt;
&lt;br /&gt;
* [[Grigory Margulis]]&lt;br /&gt;
&lt;br /&gt;
* [[Elon Lindenstrauss]]&lt;br /&gt;
&lt;br /&gt;
{{div col end}}&lt;br /&gt;
&lt;br /&gt;
== Notes 参考资料==&lt;br /&gt;
&lt;br /&gt;
{{reflist}}&lt;br /&gt;
&lt;br /&gt;
== Further reading 拓展阅读==&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Frederick D. |last1=Abraham |first2=Ralph |last2=Abraham |authorlink2=Ralph Abraham (mathematician)|first3=Christopher D. |last3=Shaw |title=A Visual Introduction to Dynamical Systems Theory for Psychology |url=https://books.google.com/books?id=oMbaAAAAMAAJ |year=1990 |publisher=Aerial Press |isbn=978-0-942344-09-7 |oclc=24345312}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=Edward J. |last=Beltrami |title=Mathematics for Dynamic Modeling |url=https://books.google.com/books?id=MmoiJPsuFW8C |year=1998 |publisher=Academic Press |isbn=978-0-12-085566-7 |edition=2nd |oclc=36713294}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=Otomar |last=Hájek |title=Dynamical systems in the plane |url=https://books.google.com/books?id=czhPAQAAIAAJ |year=1968 |publisher=Academic Press |oclc=343328 |authorlink=Otomar Hájek |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=David G. |last=Luenberger |title=Introduction to dynamic systems: theory, models, and applications |url=https://books.google.com/books?id=mvlQAAAAMAAJ |year=1979 |publisher=Wiley |isbn=978-0-471-02594-8 |oclc=4195122 |authorlink=David Luenberger |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Anthony |last1=Michel |author2=Kaining Wang |author3=Bo Hu |title=Qualitative Theory of Dynamical Systems |url=https://books.google.com/books?id=ZPGBnZGV2_cC |year=2001 |publisher=Taylor &amp;amp; Francis |isbn=978-0-8247-0526-8 |oclc=45873628}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Louis |last1=Padulo |first2=Michael A. |last2=Arbib |authorlink2=Michael A. Arbib |title=System theory: a unified state-space approach to continuous and discrete systems |url=https://books.google.com/books?id=6UPvAAAAMAAJ |year=1974 |publisher=Saunders |isbn=9780721670355 |oclc=947600 |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |first=Steven H. |last=Strogatz |title=Nonlinear Dynamics and Chaos: With Applications to Physics, Biology, Chemistry, and Engineering |year=1994 |publisher=Addison Wesley |isbn=978-0-7382-0453-6 |oclc=49839504 |authorlink=Steven Strogatz |ref=harv |url-access=registration |url=https://archive.org/details/nonlineardynamic00stro }}&lt;br /&gt;
&lt;br /&gt;
== External links 外部链接==&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20080613053119/http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html Dynamic Systems 动力系统] Encyclopedia of Cognitive Science entry. --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|这是一个嵌套的链接，但好像只能鼠标点击并超链接到内嵌的那个]]）认知科学百科全书&lt;br /&gt;
--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|确实，应该是原wiki中的链接有错误，https://cogs.indiana.edu/Publications/techreps2000/241/241.html 这个能打开但显示not find page，https://web.archive.org/web/20080613053119 则打不开]]&lt;br /&gt;
&lt;br /&gt;
*[http://mathworld.wolfram.com/DynamicalSystem.html Definition of dynamical system 动力系统的定义] in MathWorld. 在MathWorld.wolfram.com储存的定义&lt;br /&gt;
&lt;br /&gt;
*[http://www.dynamicalsystems.org/ DSWeb] Dynamical Systems Magazine 动力系统杂志&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Areas of mathematics | state=collapsed}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:Dynamical systems]]&lt;br /&gt;
&lt;br /&gt;
Category:Dynamical systems&lt;br /&gt;
&lt;br /&gt;
类别: 动力系统&lt;br /&gt;
&lt;br /&gt;
[[Category:Complex systems theory]]&lt;br /&gt;
&lt;br /&gt;
Category:Complex systems theory&lt;br /&gt;
&lt;br /&gt;
范畴: 复杂系统理论&lt;br /&gt;
&lt;br /&gt;
[[Category:Computational fields of study]]&lt;br /&gt;
&lt;br /&gt;
Category:Computational fields of study&lt;br /&gt;
&lt;br /&gt;
类别: 研究的计算领域&lt;br /&gt;
&lt;br /&gt;
&amp;lt;noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;small&amp;gt;This page was moved from [[wikipedia:en:Dynamical systems theory]]. Its edit history can be viewed at [[动力系统/edithistory]]&amp;lt;/small&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:待整理页面]]&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
===书籍推荐===&lt;br /&gt;
====[https://www.amazon.co.uk/Chaos-Making-Science-James-Gleick/dp/0749386061 Chaos: Making a New Science]====&lt;br /&gt;
The million-copy bestseller by National Book Award nominee and Pulitzer Prize finalist James Gleick—the author of Time Travel: A History—that reveals the science behind chaos theory。&lt;br /&gt;
Very readable, focuses on the scientists and mathematicians behind many of the key results in chaos.&lt;br /&gt;
本书由普利茨奖获得者James Gleick撰写。它是一本易读科普书籍，侧重介绍对混沌概念的发展做出重大贡献的科学家和数学家们。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://www.amazon.com/dp/0199566445/ref=cm_sw_su_dp Chaos and Fractals: An Elementary Introduction]====&lt;br /&gt;
This book provides the reader with an elementary introduction to chaos and fractals, suitable for students with a background in elementary algebra, without assuming prior coursework in calculus or physics. &lt;br /&gt;
这是一本关于混沌和分形的入门书籍。读者需要有一定的线性代数基础，但是不需要有微积分或物理学的基础。&lt;br /&gt;
&lt;br /&gt;
====[https://www.amazon.co.uk/Chaos-Very-Short-Introduction-Introductions/dp/0192853783/ref=pd_lpo_14_img_1/257-2017232-0516612?_encoding=UTF8&amp;amp;pd_rd_i=0192853783&amp;amp;pd_rd_r=eebee69a-fad3-43e3-bbeb-b883f2c59bf5&amp;amp;pd_rd_w=g6knH&amp;amp;pd_rd_wg=sx6z5&amp;amp;pf_rd_p=7b8e3b03-1439-4489-abd4-4a138cf4eca6&amp;amp;pf_rd_r=YTB0XXCR2DM8049PYP1Y&amp;amp;psc=1&amp;amp;refRID=YTB0XXCR2DM8049PYP1Y 牛津通识读本: Chaos]====&lt;br /&gt;
This book would not have been possible without my parents, of course, but I owe a greater debt than most to their faith, doubt, and hope, and to the love and patience of a, b, and c. Professionally my greatest debt is to Ed Spiegel, a father of chaos and my thesis Professor, mentor, and friend.&lt;br /&gt;
本书隶属于牛津通识读本系列。该书由Ed Spiegel的学生Leonard Smith撰写，语言生动简明。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
===集智课程推荐===&lt;br /&gt;
====[https://campus.swarma.org/course/1655 圣塔菲课程：Introduction to Dynamical Systems and Chaos]====&lt;br /&gt;
本课程中，主要介绍动力学系统和混沌系统，您将学到'''蝴蝶效应 Butterfly effect'''、'''奇异吸引子 Attractors'''等基本概念，以及如何应用于您感兴趣的领域。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://campus.swarma.org/course/1641 动力系统分析]====&lt;br /&gt;
本课程主要讲授连续和离散动力系统的定态、极限环及其稳定性分析、动力学系统的结构稳定性和常见的分支类型以及分析方法，混沌概念等。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E5%8A%A8%E5%8A%9B%E7%B3%BB%E7%BB%9F%E7%90%86%E8%AE%BA_Dynamical_Systems_Theory&amp;diff=10190</id>
		<title>动力系统理论 Dynamical Systems Theory</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E5%8A%A8%E5%8A%9B%E7%B3%BB%E7%BB%9F%E7%90%86%E8%AE%BA_Dynamical_Systems_Theory&amp;diff=10190"/>
		<updated>2020-07-11T16:45:48Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：/* Overview 综述 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。&lt;br /&gt;
&lt;br /&gt;
{{Use dmy dates|date=May 2019|cs1-dates=y}}&lt;br /&gt;
&lt;br /&gt;
'''Dynamical systems theory''' is an area of [[mathematics]] used to describe the behavior of the  [[complex systems|complex]] [[dynamical system]]s, usually by employing [[differential equations]] or [[difference equations]]. When differential equations are employed, the theory is called [[continuous time|''continuous dynamical systems'']]. From a physical point of view, continuous dynamical systems is a generalization of [[classical mechanics]], a generalization where the [[equations of motion]] are postulated directly and are not constrained to be [[Euler–Lagrange equation]]s of a [[Principle of least action|least action principle]]. When difference equations are employed, the theory is called [[discrete time|''discrete dynamical systems'']]. When the time variable runs over a set that is discrete over some intervals and continuous over other intervals or is any arbitrary time-set such as a [[cantor set]], one gets [[dynamic equations on time scales]]. Some situations may also be modeled by mixed operators, such as [[differential-difference equations]].&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory is an area of mathematics used to describe the behavior of the  complex dynamical systems, usually by employing differential equations or difference equations. When differential equations are employed, the theory is called continuous dynamical systems. From a physical point of view, continuous dynamical systems is a generalization of classical mechanics, a generalization where the equations of motion are postulated directly and are not constrained to be Euler–Lagrange equations of a least action principle. When difference equations are employed, the theory is called discrete dynamical systems. When the time variable runs over a set that is discrete over some intervals and continuous over other intervals or is any arbitrary time-set such as a cantor set, one gets dynamic equations on time scales. Some situations may also be modeled by mixed operators, such as differential-difference equations.&lt;br /&gt;
&lt;br /&gt;
  &lt;br /&gt;
'''动力系统理论 Dynamical Systems Theory'''是一个用来描述复杂动力系统行为的数学领域，通常使用微分方程或差分方程。当采用微分方程时，该理论被称为连续动力系统。从物理学的角度来看，连续动力系统是经典力学的推广，也是运动方程的推广，不受极小作用原理Euler–Lagrange方程的约束。当采用差分方程时，该理论被称为离散动力系统。&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;当时间变量在一个离散的集合上运行，在另一个离散的集合上连续，或者像cantor集一样在任意的时间集合上运行时，人们就能得到时间尺度上的动力方程。&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 当时间变量运行在一个某些区间离散、其他区间连续的集合、或者像cantor集一样任意的时间集合上时，人们就能得到时间尺度上的动力方程。&amp;lt;/font&amp;gt;&lt;br /&gt;
&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;'''算子 Operators'''是一个函数空间到函数空间上的映射O：X→X，广义的讲，对任何函数进行某一项操作都可以认为是一个算子，如求幂次、求微分等。&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;这句话的英文原文在哪里？&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;动力系统的有些情况也可以用'''混合算子 Mixed Operators'''来建模，如微分-差分方程。&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 某些情况下，也可以用'''混合算子 Mixed Operators'''来建模，如微分-差分方程。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This theory deals with the long-term qualitative behavior of dynamical systems, and studies the nature of, and when possible the solutions of, the [[equations of motion]] of systems that are often primarily [[mechanics|mechanical]] or otherwise physical in nature, such as [[planetary orbit]]s and the behaviour of [[electronic circuit]]s, as well as systems that arise in [[biology]], [[economics]], and elsewhere. Much of modern research is focused on the study of [[chaotic system]]s.&lt;br /&gt;
&lt;br /&gt;
This theory deals with the long-term qualitative behavior of dynamical systems, and studies the nature of, and when possible the solutions of, the equations of motion of systems that are often primarily mechanical or otherwise physical in nature, such as planetary orbits and the behaviour of electronic circuits, as well as systems that arise in biology, economics, and elsewhere. Much of modern research is focused on the study of chaotic systems.&lt;br /&gt;
&lt;br /&gt;
这个理论处理动力系统的长期定性行为。&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;如果能够得到解的话，还可以研究系统的运动方程。这些方程通常运用到机械或物理研究领域，如行星轨道和电子电路，以及出现在生物学，经济学和其他地方的系统。&amp;lt;/font&amp;gt;现代的研究大多集中在对混沌系统的研究上。&lt;br /&gt;
&lt;br /&gt;
这个理论处理动力系统的长期定性行为，&amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;并且研究系统的动力方程的规律，努力求得可能的解。这些系统通常是一些自然领域里的机械系统或其他物理系统，例如行星轨道和电子电路，也包括一些生物学、经济学和其他学科里的系统。&amp;lt;/font&amp;gt;现代的研究大多集中在对混沌系统的研究上。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This field of study is also called just ''dynamical systems'', ''mathematical dynamical systems theory'' or the ''mathematical theory of dynamical systems''.&lt;br /&gt;
&lt;br /&gt;
This field of study is also called just dynamical systems, mathematical dynamical systems theory or the mathematical theory of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
这个研究领域也被称为动力系统，数学动力系统理论或动力系统的数学理论。&lt;br /&gt;
&lt;br /&gt;
[[Image:Lorenz attractor yb.svg|thumb|240px|right|The [[Lorenz attractor]] is an example of a [[non-linear]] dynamical system. Studying this system helped give rise to [[chaos theory]].]]&lt;br /&gt;
&lt;br /&gt;
The [[Lorenz attractor is an example of a non-linear dynamical system. Studying this system helped give rise to chaos theory.]]&lt;br /&gt;
&lt;br /&gt;
'''洛伦兹吸引子 Lorenz Attractor'''是非线性动力系统的一个例子。对这个系统的研究产生了混沌理论。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Overview 综述 ==&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory and [[chaos theory]] deal with the long-term qualitative behavior of [[dynamical system]]s. Here, the focus is not on finding precise solutions to the equations defining the dynamical system (which is often hopeless), but rather to answer questions like &amp;quot;Will the system settle down to a steady state in the long term, and if so, what are the possible steady states?&amp;quot;, or &amp;quot;Does the long-term behavior of the system depend on its initial condition?&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory and chaos theory deal with the long-term qualitative behavior of dynamical systems. Here, the focus is not on finding precise solutions to the equations defining the dynamical system (which is often hopeless), but rather to answer questions like &amp;quot;Will the system settle down to a steady state in the long term, and if so, what are the possible steady states?&amp;quot;, or &amp;quot;Does the long-term behavior of the system depend on its initial condition?&amp;quot;&lt;br /&gt;
&lt;br /&gt;
动力系统理论和'''混沌理论 Chaos Theory'''是用来处理动力系统的长期定性行为的理论。寻找动力系统方程的精确解通常是很难达到的。这两个理论的重点不在于找到精确解，而是回答如下的问题，如“系统长期来看是否会稳定下来，如果可以，那么可能的稳定状态是什么样的?”，或“系统长期的行为是否取决于其初始条件?”&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
An important goal is to describe the fixed points, or steady states of a given dynamical system; these are values of the variable that don't change over time. Some of these fixed points are ''attractive'', meaning that if the system starts out in a nearby state, it converges towards the fixed point.&lt;br /&gt;
&lt;br /&gt;
An important goal is to describe the fixed points, or steady states of a given dynamical system; these are values of the variable that don't change over time. Some of these fixed points are attractive, meaning that if the system starts out in a nearby state, it converges towards the fixed point.&lt;br /&gt;
&lt;br /&gt;
描述给定动力系统的不动点或'''&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;定态&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;稳态&amp;lt;/font&amp;gt;Steady States'''是一个重要的目标。不动点或&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;定态&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;稳态&amp;lt;/font&amp;gt;的变量值不会随时间的变化而变化。一些不动点是有吸引力的（attractive），即如果系统的初始值在它的附近，系统最终会收敛到这个不动点。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Similarly, one is interested in ''periodic points'', states of the system that repeat after several timesteps. Periodic points can also be attractive. [[Sharkovskii's theorem]] is an interesting statement about the number of periodic points of a one-dimensional discrete dynamical system.&lt;br /&gt;
&lt;br /&gt;
Similarly, one is interested in periodic points, states of the system that repeat after several timesteps. Periodic points can also be attractive. Sharkovskii's theorem is an interesting statement about the number of periodic points of a one-dimensional discrete dynamical system.&lt;br /&gt;
&lt;br /&gt;
人们还对动力系统的'''周期点 Periodic Points'''感兴趣，&amp;lt;font color='red'&amp;gt;即系统在几个时间步之后会不断重复的状态。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;即系统在重复几个时间步之后的状态。&amp;lt;/font&amp;gt;周期点也可以是有吸引力的。Sharkovskii定理描述了一维离散动力系统的周期点的个数。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Even simple [[nonlinear dynamical system]]s often exhibit seemingly random behavior that has been called ''chaos''.&amp;lt;ref&amp;gt;{{cite journal |last=Grebogi |first=C. |last2=Ott |first2=E. |last3=Yorke |first3=J. |year=1987 |title=Chaos, Strange Attractors, and Fractal Basin Boundaries in Nonlinear Dynamics |journal=[[Science (journal)|Science]] |volume=238 |issue=4827 |pages=632–638 |jstor=1700479 |doi=10.1126/science.238.4827.632 |pmid=17816542 |bibcode=1987Sci...238..632G }}&amp;lt;/ref&amp;gt; The branch of dynamical systems that deals with the clean definition and investigation of chaos is called ''[[chaos theory]]''.&lt;br /&gt;
&lt;br /&gt;
Even simple nonlinear dynamical systems often exhibit seemingly random behavior that has been called chaos. The branch of dynamical systems that deals with the clean definition and investigation of chaos is called chaos theory.&lt;br /&gt;
&lt;br /&gt;
即使是简单的非线性动力系统也常常表现出看似随机的行为，这种行为被称为混沌。混沌理论主要研究混沌的清晰定义和混沌的现象，它是动力系统理论的一个分支。&lt;br /&gt;
&lt;br /&gt;
== History 历史==&lt;br /&gt;
&lt;br /&gt;
The concept of dynamical systems theory has its origins in [[Newtonian mechanics]]. There, as in other natural sciences and engineering disciplines, the evolution rule of dynamical systems is given implicitly by a relation that gives the state of the system only a short time into the future.&lt;br /&gt;
&lt;br /&gt;
The concept of dynamical systems theory has its origins in Newtonian mechanics. There, as in other natural sciences and engineering disciplines, the evolution rule of dynamical systems is given implicitly by a relation that gives the state of the system only a short time into the future.&lt;br /&gt;
&lt;br /&gt;
动态系统理论的概念起源于牛顿运动定律。与其他自然科学和工程学科一样，动力系统的演化规律也是通过一种预测系统在未来很短时间内的状态的关系隐含地给出的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Before the advent of [[computer|fast computing machines]], solving a dynamical system required sophisticated mathematical techniques and could only be accomplished for a small class of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
Before the advent of fast computing machines, solving a dynamical system required sophisticated mathematical techniques and could only be accomplished for a small class of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
在高速计算机器出现之前，解决动力系统问题需要复杂的数学技能，而且还只能解决一小类动力系统问题。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Some excellent presentations of mathematical dynamic system theory include {{harvtxt|Beltrami|1990}}, {{harvtxt|Luenberger|1979}}, {{harvtxt|Padulo|Arbib|1974}}, and {{harvtxt|Strogatz|1994}}.&amp;lt;ref&amp;gt;Jerome R. Busemeyer (2008), [http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html &amp;quot;Dynamic Systems&amp;quot;]. To Appear in: ''Encyclopedia of cognitive science'', Macmillan. Retrieved 8 May 2008.  {{webarchive |url=https://web.archive.org/web/20080613053119/http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html |date=June 13, 2008 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Some excellent presentations of mathematical dynamic system theory include , , , and . To Appear in: ''Encyclopedia of cognitive science'', Macmillan. Retrieved 8 May 2008&lt;br /&gt;
&lt;br /&gt;
优秀的数学动力系统理论包括，，，和。--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|存疑]]）。&lt;br /&gt;
&lt;br /&gt;
&amp;lt;font color='blue'&amp;gt;原文是：Some excellent presentations of mathematical dynamic system theory include Beltrami (1990), Luenberger (1979), Padulo &amp;amp; Arbib (1974), and Strogatz (1994).[2] 是不是在粘贴或解析时内容有丢失？&lt;br /&gt;
&lt;br /&gt;
一些优秀的数学动力系统理论包括贝尔特拉米（Beltrami，1990年），龙伯格(Luenberger，1979年），帕杜罗&amp;amp;阿尔比布（Padulo＆Arbib，1974年）和斯托加茨（Strogatz，1994年）。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Concepts 概念==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Dynamical systems 动力系统===&lt;br /&gt;
&lt;br /&gt;
{{main|Dynamical system (definition)}}&lt;br /&gt;
&lt;br /&gt;
The [[dynamical system]] concept is a mathematical [[formal system|formalization]] for any fixed &amp;quot;rule&amp;quot; that describes the [[time]] dependence of a point's position in its [[ambient space]].  Examples include the [[mathematical model]]s that describe the swinging of a clock pendulum, the flow of water in a pipe, and the number of fish each spring in a lake.&lt;br /&gt;
&lt;br /&gt;
The dynamical system concept is a mathematical formalization for any fixed &amp;quot;rule&amp;quot; that describes the time dependence of a point's position in its ambient space.  Examples include the mathematical models that describe the swinging of a clock pendulum, the flow of water in a pipe, and the number of fish each spring in a lake.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;动力系统是一个对任何描述了点的位置在周围环境随时间变化的“固定”规则的数学式。&amp;lt;/font&amp;gt;&amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;动力系统概念是对描述了一个点的位置在其周围环境中随时间变化的任何“固定”规则的数学形式化。&amp;lt;/font&amp;gt;举例来说，描述钟摆摆动、管道中的水流以及每年春天湖中鱼的数量的数学模型，都属于动力系统的概念范畴。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A dynamical system has a ''state'' determined by a collection of [[real numbers]], or more generally by a [[Set (mathematics)|set]] of [[Point (geometry)|points]] in an appropriate ''state space''.  Small changes in the state of the system correspond to small changes in the numbers.  The numbers are also the coordinates of a geometrical space—a [[manifold]].   The ''evolution rule'' of the dynamical system is a [[function (mathematics)|fixed rule]] that describes what future states follow from the current state.  The rule may be [[Deterministic system (mathematics)|deterministic]] (for a given time interval only one future state follows from the current state) or [[stochastic differential equation|stochastic]] (the evolution of the state is subject to random shocks).&lt;br /&gt;
&lt;br /&gt;
A dynamical system has a state determined by a collection of real numbers, or more generally by a set of points in an appropriate state space.  Small changes in the state of the system correspond to small changes in the numbers.  The numbers are also the coordinates of a geometrical space—a manifold.   The evolution rule of the dynamical system is a fixed rule that describes what future states follow from the current state.  The rule may be deterministic (for a given time interval only one future state follows from the current state) or stochastic (the evolution of the state is subject to random shocks).&lt;br /&gt;
&lt;br /&gt;
动力系统的状态是由一组实数决定的，更广泛地说，是由适当的状态空间中的一组点决定的。系统状态的微小变化对应于数字的变化。这些数字也是几何空间——'''流形 Manifold'''——的坐标组。&amp;lt;font color='red'&amp;gt;动力系统的演化是描述了在当前状态之后出现的未来状态的固定规则。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;动力系统的演化规律是一种固定的规则，它描述了从当前状态得出的未来状态。&amp;lt;/font&amp;gt;这个规则可以是确定性的(在给定的时间间隔内，有且仅有一个未来状态在当前状态之后出现)，或随机性的(状态的演化受到随机因素的影响)。&lt;br /&gt;
&lt;br /&gt;
=== Dynamicism 动态主义===&lt;br /&gt;
&lt;br /&gt;
[[Dynamicism]], also termed the ''dynamic hypothesis'' or the ''dynamic hypothesis in cognitive science'' or ''dynamic cognition'', is a new approach in [[cognitive science]] exemplified by the work of philosopher [[Tim van Gelder]]. It argues that [[differential equations]] are more suited to modelling [[cognition]] than more traditional [[computer]] models.&lt;br /&gt;
&lt;br /&gt;
Dynamicism, also termed the dynamic hypothesis or the dynamic hypothesis in cognitive science or dynamic cognition, is a new approach in cognitive science exemplified by the work of philosopher Tim van Gelder. It argues that differential equations are more suited to modelling cognition than more traditional computer models.&lt;br /&gt;
&lt;br /&gt;
'''动态主义 Dynamicism'''，也称动态假设，&amp;lt;font color='red'&amp;gt;或称认知科学、动态认知中的动态假设，&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;或称认知科学的动态假设或动态认知，&amp;lt;/font&amp;gt;是以哲学家Tim van Gelder的著作为代表的认知科学的一种新取向。动态主义认为微分方程比传统的计算机模型更适合于建立认知模型。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Nonlinear system 非线性系统===&lt;br /&gt;
&lt;br /&gt;
{{main|Nonlinear system}}&lt;br /&gt;
&lt;br /&gt;
In [[mathematics]], a [[nonlinear system]] is a system that is not [[linear system|linear]]—i.e., a system that does not satisfy the [[superposition principle]]. Less technically, a nonlinear system is any problem where the variable(s) to solve for cannot be written as a linear sum of independent components. A [[Homogeneity (physics)|nonhomogeneous]] system, which is linear apart from the presence of a function of the [[independent variable]]s, is nonlinear according to a strict definition, but such systems are usually studied alongside linear systems, because they can be transformed to a linear system as long as a particular solution is known.&lt;br /&gt;
&lt;br /&gt;
In mathematics, a nonlinear system is a system that is not linear—i.e., a system that does not satisfy the superposition principle. Less technically, a nonlinear system is any problem where the variable(s) to solve for cannot be written as a linear sum of independent components. A nonhomogeneous system, which is linear apart from the presence of a function of the independent variables, is nonlinear according to a strict definition, but such systems are usually studied alongside linear systems, because they can be transformed to a linear system as long as a particular solution is known.&lt;br /&gt;
&lt;br /&gt;
在数学中，'''非线性系统 Nonlinear System'''是指系统不是线性的——也就是说，一个不满足叠加原理的系统。更通俗地说，非线性系统是待求解变量不能被写成其独立分量的线性和的系统。非齐次系统根据定义严格来说是非线性的，除了它的自变量&amp;lt;font color='red'&amp;gt;&amp;lt;s&amp;gt;包含&amp;lt;/s&amp;gt;&amp;lt;/font&amp;gt;函数以外其他部分都是线性的。&amp;lt;font color='red'&amp;gt;但非齐次系统通常与线性系统一起研究，因为只要知道特解，它们就可以转化为线性系统。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;但非齐次系统通常可当做线性系统进行研究，因为只要知道特定解，它就可以转化为线性系统。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Related fields 相关领域==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Arithmetic dynamics &amp;lt;font color='red'&amp;gt;算术动态系统&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;算术动力学&amp;lt;/font&amp;gt;===&lt;br /&gt;
&lt;br /&gt;
:[[Arithmetic dynamics]] is a field that emerged in the 1990s that amalgamates two areas of mathematics, [[dynamical systems]] and [[number theory]]. Classically, discrete dynamics refers to the study of the [[Iterated function|iteration]] of self-maps of the [[complex plane]] or [[real line]]. Arithmetic dynamics is the study of the number-theoretic properties of integer, rational, {{math|&amp;lt;var&amp;gt;p&amp;lt;/var&amp;gt;}}-adic, and/or algebraic points under repeated application of a [[polynomial]] or [[rational function]].&lt;br /&gt;
&lt;br /&gt;
Arithmetic dynamics is a field that emerged in the 1990s that amalgamates two areas of mathematics, dynamical systems and number theory. Classically, discrete dynamics refers to the study of the iteration of self-maps of the complex plane or real line. Arithmetic dynamics is the study of the number-theoretic properties of integer, rational, -adic, and/or algebraic points under repeated application of a polynomial or rational function.&lt;br /&gt;
&lt;br /&gt;
'''&amp;lt;font color='red'&amp;gt;算术动态系统&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;算术动力学&amp;lt;/font&amp;gt; Arithmetic Dynamics'''是20世纪90年代出现的一个领域，融合了动力系统和数论这两个数学领域。经典的离散动力学研究复平面或&amp;lt;font color='blue'&amp;gt;实直线&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;实数轴&amp;lt;/font&amp;gt;的自映射的迭代。&amp;lt;font color='red'&amp;gt;算术动态系统研究内容是在多项式或有理函数中的整数、有理数、并元 --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|存疑]]） 和/或代数点的数论性质。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;算术动力学是在反复应用多项式或有理函数的情况下研究整数，有理数，p进数(p-adic)和/或代数点的数论性质。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Chaos theory 混沌理论===&lt;br /&gt;
&lt;br /&gt;
:[[Chaos theory]] describes the behavior of certain [[dynamical system (definition)|dynamical system]]s – that is, systems whose state evolves with time – that may exhibit dynamics that are highly sensitive to initial conditions (popularly referred to as the [[butterfly effect]]). As a result of this sensitivity, which manifests itself as an exponential growth of perturbations in the initial conditions, the behavior of chaotic systems appears [[randomness|random]]. This happens even though these systems are [[deterministic system (philosophy)|deterministic]], meaning that their future dynamics are fully defined by their initial conditions, with no random elements involved. This behavior is known as deterministic chaos, or simply ''chaos''.&lt;br /&gt;
&lt;br /&gt;
Chaos theory describes the behavior of certain dynamical systems – that is, systems whose state evolves with time – that may exhibit dynamics that are highly sensitive to initial conditions (popularly referred to as the butterfly effect). As a result of this sensitivity, which manifests itself as an exponential growth of perturbations in the initial conditions, the behavior of chaotic systems appears random. This happens even though these systems are deterministic, meaning that their future dynamics are fully defined by their initial conditions, with no random elements involved. This behavior is known as deterministic chaos, or simply chaos.&lt;br /&gt;
&lt;br /&gt;
混沌理论描述了某些状态随时间演化的动力系统的行为，这些系统可能表现出对初始条件高度敏感的特点（通常被称为'''蝴蝶效应 Butterfly Effect'''）。由于扰动受初始条件影响而指数增长，因此混沌系统具有敏感性，敏感性使它的行为看起来是随机的。但是这种敏感性也会出现在确定的动力系统中，即&amp;lt;font color='blue'&amp;gt;它们&amp;lt;/font&amp;gt;未来的动力&amp;lt;s&amp;gt;学&amp;lt;/s&amp;gt;完全由它的初始条件定义，没有任何随机因素参与的系统中。这种现象被称为确定性混沌，或简单混沌。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Complex systems 复杂系统===&lt;br /&gt;
&lt;br /&gt;
:[[Complex systems]] is a scientific field that studies the common properties of [[system]]s considered [[Complexity|complex]] in [[nature]], [[society]], and [[science]]. It is also called ''complex systems theory'', ''complexity science'', ''study of complex systems'' and/or ''sciences of complexity''. The key problems of such systems are  difficulties with their formal [[Scientific modelling|modeling]] and [[simulation]]. From such perspective, in different research contexts complex systems are defined on the base of their different attributes.&lt;br /&gt;
&lt;br /&gt;
Complex systems is a scientific field that studies the common properties of systems considered complex in nature, society, and science. It is also called complex systems theory, complexity science, study of complex systems and/or sciences of complexity. The key problems of such systems are  difficulties with their formal modeling and simulation. From such perspective, in different research contexts complex systems are defined on the base of their different attributes.&lt;br /&gt;
&lt;br /&gt;
'''复杂系统 Complex Systems'''是研究自然、社会和科学中复杂现象的共同性质的科学领域。它也被称为复杂系统理论、复杂性科学、复杂系统研究和关于复杂性的科学。这些系统的关键问题在于对系统的形式化建模与仿真&amp;lt;font color='blue'&amp;gt;的困难&amp;lt;/font&amp;gt;。因此，复杂系统是根据在不同的研究语境中的不同属性来定义的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
:The study of complex systems is bringing new vitality to many areas of science where a more typical [[reductionist]] strategy has fallen short. ''Complex systems'' is therefore often used as a broad term encompassing a research approach to problems in many diverse disciplines including [[neurosciences]], [[social sciences]], [[meteorology]], [[chemistry]], [[physics]], [[computer science]], [[psychology]], [[artificial life]], [[evolutionary computation]], [[economics]], earthquake prediction, [[molecular biology]] and inquiries into the nature of living [[cell (biology)|cell]]s themselves.&lt;br /&gt;
&lt;br /&gt;
The study of complex systems is bringing new vitality to many areas of science where a more typical reductionist strategy has fallen short. Complex systems is therefore often used as a broad term encompassing a research approach to problems in many diverse disciplines including neurosciences, social sciences, meteorology, chemistry, physics, computer science, psychology, artificial life, evolutionary computation, economics, earthquake prediction, molecular biology and inquiries into the nature of living cells themselves.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;font color='red'&amp;gt;还原论策略已经不足以研究许多科学领域的问题，而复杂系统的研究则为科学带来了广泛的新活力。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;复杂系统的研究为许多科学领域带来了新的活力，在这些领域中，更为典型的还原论策略已经不足。&amp;lt;/font&amp;gt;复杂系统通常被用作一个应用广泛的研究方法术语，并涵盖许多不同的学科，包括神经科学、社会科学、气象学、化学、物理学、计算机科学、心理学、人工生命、进化计算、经济学、地震预测、分子生物学以及对活细胞的研究等。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Control theory 控制理论===&lt;br /&gt;
&lt;br /&gt;
:[[Control theory]] is an interdisciplinary branch of [[engineering]] and [[mathematics]], in part it deals with influencing the behavior of [[dynamical system]]s.&lt;br /&gt;
&lt;br /&gt;
Control theory is an interdisciplinary branch of engineering and mathematics, in part it deals with influencing the behavior of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
'''控制理论 Control Theory'''是工程和数学的一个交叉学科，它的其中一部分研究影响动力系统行为的各种因素。&lt;br /&gt;
&lt;br /&gt;
控制理论是一个研究如何调整动态系统特性的理论，它也是工程和数学的一个交叉学科，逐渐的应用在许多社会科学中，例如心理学、社会学（社会学中的控制理论）、犯罪学及'''金融系统 Financial System'''。控制理论一般的目的是借由控制器的动作让系统稳定，也就是系统维持在设定值，而且不会在设定值附近晃动。设定值一般维持不变的控制称为调节，设定值快速变化，要求跟踪速度加速度等的控制称为伺服。它的其中一部分研究影响动力系统行为的各种因素。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Ergodic theory 遍历理论===&lt;br /&gt;
&lt;br /&gt;
:[[Ergodic theory]] is a branch of [[mathematics]] that studies [[dynamical system]]s with an [[invariant measure]] and related problems. Its initial development was motivated by problems of [[statistical physics]].&lt;br /&gt;
&lt;br /&gt;
Ergodic theory is a branch of mathematics that studies dynamical systems with an invariant measure and related problems. Its initial development was motivated by problems of statistical physics.&lt;br /&gt;
&lt;br /&gt;
'''遍历理论 Ergodic Theory'''是数学的一个分支，研究有不变测度和相关问题的动力系统。它最初的发展受到了统计物理学的推动。&lt;br /&gt;
遍历理论是研究保测变换的渐近性态的数学分支。它起源于为统计力学提供基础的&amp;quot;遍历假设&amp;quot;研究，并与动力系统理论、概率论、信息论、泛函分析、数论等数学分支有着密切的联系。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Functional analysis 泛函分析===&lt;br /&gt;
&lt;br /&gt;
:[[Functional analysis]] is the branch of [[mathematics]], and specifically of [[mathematical analysis|analysis]], concerned with the study of [[vector space]]s and [[operator (mathematics)|operator]]s acting upon them. It has its historical roots in the study of [[functional space]]s, in particular transformations of [[function (mathematics)|functions]], such as the [[Fourier transform]], as well as in the study of [[differential equations|differential]] and [[integral equations]]. This usage of the word ''[[functional (mathematics)|functional]]'' goes back to the [[calculus of variations]], implying a function whose argument is a function. Its use in general has been attributed to mathematician and physicist [[Vito Volterra]] and its founding is largely attributed to mathematician [[Stefan Banach]].&lt;br /&gt;
&lt;br /&gt;
Functional analysis is the branch of mathematics, and specifically of analysis, concerned with the study of vector spaces and operators acting upon them. It has its historical roots in the study of functional spaces, in particular transformations of functions, such as the Fourier transform, as well as in the study of differential and integral equations. This usage of the word functional goes back to the calculus of variations, implying a function whose argument is a function. Its use in general has been attributed to mathematician and physicist Vito Volterra and its founding is largely attributed to mathematician Stefan Banach.&lt;br /&gt;
&lt;br /&gt;
'''泛函分析 Functional analysis'''是数学分析的一个分支，研究向量空间和作用于向量空间的算子。它源于对函数空间的研究，特别是对函数变换的研究，例如傅里叶变换，微积分方程的研究等。泛函分析的名称“Functional Analysis”中，“functional”这个词的用法可以追溯到变分法，也就是说函数的参数是一个函数。这个词的使用一般被认为归功于数学家和物理学家Vito Volterra，和数学家Stefan Banach。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Graph dynamical systems 图动力系统===&lt;br /&gt;
&lt;br /&gt;
:The concept of [[graph dynamical system]]s (GDS) can be used to capture a wide range of processes taking place on graphs or networks. A major theme in the mathematical and computational analysis of graph dynamical systems is to relate their structural properties (e.g. the network connectivity) and the global dynamics that result.&lt;br /&gt;
&lt;br /&gt;
The concept of graph dynamical systems (GDS) can be used to capture a wide range of processes taking place on graphs or networks. A major theme in the mathematical and computational analysis of graph dynamical systems is to relate their structural properties (e.g. the network connectivity) and the global dynamics that result.&lt;br /&gt;
&lt;br /&gt;
'''图动力系统 Graph dynamical systems (GDS)'''可以用来描绘图或网络上发生的各种过程。&amp;lt;font color='red'&amp;gt;图动力系统的数学和计算分析的一个主要主题是关联它们的结构性质(例如:网络连接)和结构性质造成的网络整体的动态结果。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;图动力系统的数学和计算分析的一个主要主题是将其结构特性（例如：网络连接性）与其所产生的全局动力学联系起来。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Projected dynamical systems 投影动力系统===&lt;br /&gt;
&lt;br /&gt;
:[[Projected dynamical systems]] it is a [[mathematics|mathematical]] theory investigating the behaviour of [[dynamical system]]s where solutions are restricted to a constraint set. The discipline shares connections to and applications with both the static world of [[Optimization (mathematics)|optimization]] and [[Equilibrium point|equilibrium]] problems and the dynamical world of [[ordinary differential equations]]. A projected dynamical system is given by the [[flow (mathematics)|flow]] to the projected differential equation.&lt;br /&gt;
&lt;br /&gt;
Projected dynamical systems it is a mathematical theory investigating the behaviour of dynamical systems where solutions are restricted to a constraint set. The discipline shares connections to and applications with both the static world of optimization and equilibrium problems and the dynamical world of ordinary differential equations. A projected dynamical system is given by the flow to the projected differential equation.&lt;br /&gt;
&lt;br /&gt;
'''投影动力系统 Projected Dynamical Systems'''是研究解在一个约束集内的动力系统行为的数学理论。这门学科与静态世界中的最优化和平衡问题以及动态世界中的常微分方程都有联系&amp;lt;font color='blue'&amp;gt;和&amp;lt;s&amp;gt;，并且都有相互联系的&amp;lt;/s&amp;gt;&amp;lt;/font&amp;gt;应用。一个投影动力系统是由投影微分方程的'''流形 flow'''给定的。&lt;br /&gt;
通过对投影微分方程的流分析，给出了一个投影动力系统的表达式：&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\frac{dx(t)}{dt} = \Pi_K(x(t),-F(x(t)))&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中K为约束集。这种形式的微分方程因具有不连续的向量场而值得注意。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Symbolic dynamics 符号动力学===&lt;br /&gt;
&lt;br /&gt;
:[[Symbolic dynamics]] is the practice of modelling a topological or smooth [[dynamical system]] by a discrete space consisting of infinite [[sequence]]s of abstract symbols, each of which corresponds to a state of the system, with the dynamics (evolution) given by the [[shift operator]].&lt;br /&gt;
&lt;br /&gt;
Symbolic dynamics is the practice of modelling a topological or smooth dynamical system by a discrete space consisting of infinite sequences of abstract symbols, each of which corresponds to a state of the system, with the dynamics (evolution) given by the shift operator.&lt;br /&gt;
&lt;br /&gt;
'''符号动力学 Symbolic Dynamics'''是通过一个由抽象符号的无限序列组成的离散空间建立一个拓扑或光滑动力系统的方法。每一个抽象符号的无限序列序列对应于系统的一个状态，并由移位算子给出动力学(演化)。&lt;br /&gt;
&amp;lt;font color='blue'&amp;gt;'''符号动力学 Symbolic Dynamics'''是通过离散空间对拓扑或平滑动力学系统进行建模的方法，该离散空间由无限的抽象符号序列组成，每个抽象符号对应于系统的一个状态，并且由移位运算符给出动力学（演化）。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== System dynamics 系统动力学===&lt;br /&gt;
&lt;br /&gt;
:[[System dynamics]] is an approach to understanding the behaviour of systems over time.  It deals with internal feedback loops and time delays that affect the behaviour and state of the entire system.&amp;lt;ref name=&amp;quot;sysdyn&amp;quot;&amp;gt;[http://sysdyn.clexchange.org MIT System Dynamics in Education Project (SDEP)&amp;lt;!-- Bot generated title --&amp;gt;] {{webarchive|url=https://web.archive.org/web/20080509163801/http://sysdyn.clexchange.org/ |date=2008-05-09 }}&amp;lt;/ref&amp;gt;  What makes using system dynamics different from other approaches to studying systems is the use of [[feedback]] loops and [[Stock and flow|stocks and flows]].  These elements help describe how even seemingly simple systems display baffling [[nonlinearity]].&lt;br /&gt;
&lt;br /&gt;
System dynamics is an approach to understanding the behaviour of systems over time.  It deals with internal feedback loops and time delays that affect the behaviour and state of the entire system.  What makes using system dynamics different from other approaches to studying systems is the use of feedback loops and stocks and flows.  These elements help describe how even seemingly simple systems display baffling nonlinearity.&lt;br /&gt;
&lt;br /&gt;
'''系统动力学 System Dynamics'''是一种理解系统随时间变化行为的方法。它是用来处理影响整个系统行为和状态的内部反馈回路和时间延迟的方法。系统动力学不同于其他系统研究方法的地方在于它使用了反馈环、&amp;lt;font color='red'&amp;gt;股票（stocks）和流形（flows）&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;存量(stocks)和流量(flows)--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|原wiki里这两个词指向:https://en.wikipedia.org/wiki/Stock_and_flow ，估计应该是存量和流量的意思，也可以群里大家讨论一下]]）&amp;lt;/font&amp;gt;--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|如何翻译stocks 和 folows]]）的元素。这些元素有助于描述看似简单的系统如何显示复杂的非线性行为。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Topological dynamics 拓扑动力学===&lt;br /&gt;
&lt;br /&gt;
:[[Topological dynamics]] is a branch of the theory of dynamical systems in which qualitative, asymptotic properties of dynamical systems are studied from the viewpoint of [[general topology]].&lt;br /&gt;
&lt;br /&gt;
Topological dynamics is a branch of the theory of dynamical systems in which qualitative, asymptotic properties of dynamical systems are studied from the viewpoint of general topology.&lt;br /&gt;
&lt;br /&gt;
'''拓扑动力学 Topological Dynamics'''是动力系统理论的一个分支。在拓朴动力学中，动力系统的定性性质和渐近性质是从一般拓扑学的观点来研究的。&lt;br /&gt;
&lt;br /&gt;
== Applications 应用==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== In human development 在人类发展中的应用===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In [[Developmental psychology|human development]], dynamical systems theory has been used to enhance and simplify Erik Erikson's [[eight stages of psychosocial development]] and offers a standard method of examining the universal pattern of human development. This method is based on the self-organizing and [[fractal]] properties of the [[Fibonacci sequence]].&amp;lt;ref name=Sacco&amp;gt;{{cite journal|last=Sacco|first=R.G.|title=Re-envisaging the eight developmental stages of Erik Erikson: The Fibonacci Life-Chart Method (FLCM)|journal=Journal of Educational and Developmental Psychology|date=2013|volume=3|issue=1|pages=140–146|doi=10.5539/jedp.v3n1p140|doi-access=free}}&amp;lt;/ref&amp;gt; Using mathematical modeling, a natural progression of human development with eight life stages has been identified:  early infancy (0–2 years), toddler (2–4 years), early childhood (4–7 years), middle childhood (7–11 years), adolescence (11–18 years), young adulthood (18–29 years), middle adulthood (29–48 years), and older adulthood (48–78+ years).&amp;lt;ref name=Sacco/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In human development, dynamical systems theory has been used to enhance and simplify Erik Erikson's eight stages of psychosocial development and offers a standard method of examining the universal pattern of human development. This method is based on the self-organizing and fractal properties of the Fibonacci sequence. Using mathematical modeling, a natural progression of human development with eight life stages has been identified:  early infancy (0–2 years), toddler (2–4 years), early childhood (4–7 years), middle childhood (7–11 years), adolescence (11–18 years), young adulthood (18–29 years), middle adulthood (29–48 years), and older adulthood (48–78+ years).&lt;br /&gt;
&lt;br /&gt;
在人类发展方面，动力系统理论已经被用来增强和简化 Erik Erikson 的'''社会心理发展8阶段理论 Eight Stages of Psychosocial Development'''，并提供了一个检验人类发展普遍模式的标准方法。该方法基于斐波那契数列的'''自组织性 self-organizing'''和'''分形 Fractal''' 特性。利用数学模型，人类发展的自然进程被分为8个生命阶段: 早期婴儿期(0-2岁)、幼儿期(2-4岁)、童年早期(4-7岁)、童年中期(7-11岁)、青春期(11-18岁)、成年早期(18-29岁)、成年中期(29-48岁)和老年成年期(48-78岁及以上)。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
According to this model, stage transitions between age intervals represent self-organization processes at multiple levels (e.g., molecules, genes, cell, organ, organ system, organism, behavior, and environment). For example, at the stage transition from [[adolescence]] to [[young adulthood]], and after reaching the critical point of 18 years of age (young adulthood), a peak in [[testosterone]] is observed in males&amp;lt;ref&amp;gt;{{cite journal |last1=Kelsey |first1=T. W. |title=A validated age-related normative model for male total testosterone shows increasing variance but no decline after age 40 years. |journal=PLOS One |volume=9 |issue=10 |pages=e109346 |doi=10.1371/journal.pone.0109346|pmid=25295520 |year=2014 |pmc=4190174 |bibcode=2014PLoSO...9j9346K }}&amp;lt;/ref&amp;gt; and the period of optimal [[fertility]] begins in females.&amp;lt;ref&amp;gt;{{cite book |last1=Tulandi |first1=T. |title=Preservation of fertility |date=2004 |publisher=Taylor &amp;amp; Francis |pages=1–20}}&amp;lt;/ref&amp;gt; Similarly, at age 30 optimal fertility begins to decline in females,&amp;lt;ref name=&amp;quot;Social Science 2008&amp;quot;&amp;gt;{{cite journal |last1=Blanchflower |first1=D. G. |title=Is well-being U-shaped over the life cycle? |journal=Social Science &amp;amp; Medicine |volume=66 |issue=8 |pages=1733–1749 |doi=10.1016/j.socscimed.2008.01.030|pmid=18316146 |year=2008 |citeseerx=10.1.1.63.5221 }}&amp;lt;/ref&amp;gt; and at the stage transition from [[middle adulthood]] to older adulthood at 48 years, the average age of onset of [[menopause]] occurs.&amp;lt;ref name=&amp;quot;Social Science 2008&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
According to this model, stage transitions between age intervals represent self-organization processes at multiple levels (e.g., molecules, genes, cell, organ, organ system, organism, behavior, and environment). For example, at the stage transition from adolescence to young adulthood, and after reaching the critical point of 18 years of age (young adulthood), a peak in testosterone is observed in males and the period of optimal fertility begins in females. Similarly, at age 30 optimal fertility begins to decline in females, and at the stage transition from middle adulthood to older adulthood at 48 years, the average age of onset of menopause occurs.&lt;br /&gt;
&lt;br /&gt;
根据这个模型，年龄的阶段转换代表了多层次的自组织过程(例如，分子、基因、细胞、器官、器官系统、生物体、行为和环境)。例如，在从青春期向成年早期过渡的阶段中，在达到18岁这一关键年龄之后，男性的睾丸激素达到高峰，女性的最佳生育期开始。同样，在30岁时，女性的最佳生育能力开始下降；在从成年中期过渡到老年成年期时，48岁是绝经的平均年龄。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
These events are physical bioattractors of aging from the perspective of Fibonacci mathematical modeling and dynamically systems theory. In practical terms, prediction in human development becomes possible in the same statistical sense in which the average temperature or precipitation at different times of the year can be used for [[weather forecasting]]. Each of the predetermined stages of human development follows an optimal epigenetic biological pattern. This phenomenon can be explained by the occurrence of Fibonacci numbers in biological [[DNA]]&amp;lt;ref&amp;gt;{{cite journal |last1=Perez |first1=J. C. (2010). |title=Codon populations in single-stranded whole human genome DNA are fractal and fine-tuned by the Golden Ratio 1.618. |journal=Interdisciplinary Sciences: Computational Life Sciences |volume=2 |issue=3 |pages=228–240 |doi=10.1007/s12539-010-0022-0|pmid=20658335 |year=2010 }}&amp;lt;/ref&amp;gt; and self-organizing properties of the Fibonacci numbers that converge on the [[golden ratio]].&lt;br /&gt;
&lt;br /&gt;
These events are physical bioattractors of aging from the perspective of Fibonacci mathematical modeling and dynamically systems theory. In practical terms, prediction in human development becomes possible in the same statistical sense in which the average temperature or precipitation at different times of the year can be used for weather forecasting. Each of the predetermined stages of human development follows an optimal epigenetic biological pattern. This phenomenon can be explained by the occurrence of Fibonacci numbers in biological DNA and self-organizing properties of the Fibonacci numbers that converge on the golden ratio.&lt;br /&gt;
&lt;br /&gt;
从斐波那契数学模型和动力系统理论的角度来看，上述事件是衰老的'''物理生物吸引子Physical Bioattractors'''。实际上，正如一年中不同时间的平均气温和降水量可以用来预测天气，预测人类的发展在统计意义上同样是可能的。人类发展的每个'''预定阶段Predetermined Stages'''都遵循最佳的'''表观遗传生物模式 Epigenetic Biological Pattern'''。这种现象可以用 DNA 中的斐波那契数和收敛于黄金分割比的斐波那契数的自组织特性来解释。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== In biomechanics 在运动生物力学中的应用===&lt;br /&gt;
&lt;br /&gt;
In [[sports biomechanics]], dynamical systems theory has emerged in the movement sciences as a viable framework for modeling athletic performance. From a dynamical systems perspective, the human movement system is a highly intricate network of co-dependent sub-systems (e.g. respiratory, circulatory, nervous, skeletomuscular, perceptual) that are composed of a large number of interacting components (e.g. blood cells, oxygen molecules, muscle tissue, metabolic enzymes, connective tissue and bone). In dynamical systems theory, movement patterns emerge through generic processes of self-organization found in physical and biological systems.&amp;lt;ref&amp;gt;Paul S Glazier, Keith Davids, Roger M Bartlett (2003). [http://www.sportsci.org/jour/03/psg.htm &amp;quot;DYNAMICAL SYSTEMS THEORY: a Relevant Framework for Performance-Oriented Sports Biomechanics Research&amp;quot;]. in: Sportscience 7. Accessed 2008-05-08.&amp;lt;/ref&amp;gt; There is no research validation of any of the claims associated to the conceptual application of this framework.&lt;br /&gt;
&lt;br /&gt;
In sports biomechanics, dynamical systems theory has emerged in the movement sciences as a viable framework for modeling athletic performance. From a dynamical systems perspective, the human movement system is a highly intricate network of co-dependent sub-systems (e.g. respiratory, circulatory, nervous, skeletomuscular, perceptual) that are composed of a large number of interacting components (e.g. blood cells, oxygen molecules, muscle tissue, metabolic enzymes, connective tissue and bone). In dynamical systems theory, movement patterns emerge through generic processes of self-organization found in physical and biological systems. There is no research validation of any of the claims associated to the conceptual application of this framework.&lt;br /&gt;
&lt;br /&gt;
在运动生物力学中，动力系统理论新兴地成为对运动表现建模的可行框架。从动力系统的角度来看，人类的运动系统是由高度复杂和相互依赖的子系统网络（如呼吸、循环、神经、骨骼肌系统和知觉系统等）组成的，它们由大量相互作用的部分组成（包括血细胞、氧分子、肌肉组织、代谢酶、结缔组织和骨骼等)。动力系统理论中，运动模式通过物理系统和生物系统中的一般自组织过程出现。没有任何研究证实与这一框架的概念相关的任何主张。&lt;br /&gt;
&lt;br /&gt;
=== In cognitive science 在认知科学中的应用===&lt;br /&gt;
&lt;br /&gt;
Dynamical system theory has been applied in the field of [[neurodynamics|neuroscience]] and [[cognitive science|cognitive development]], especially in [[the neo-Piagetian theories of cognitive development]]. It is the belief that cognitive development is best represented by physical theories rather than theories based on syntax and [[AI]]. It also believed that differential equations are the most appropriate tool for modeling human behavior. These equations are interpreted to represent an agent's cognitive trajectory through [[state space]]. In other words, dynamicists argue that [[psychology]] should be (or is) the description (via differential equations) of the cognitions and behaviors of an agent under certain environmental and internal pressures. The language of chaos theory is also frequently adopted.&lt;br /&gt;
&lt;br /&gt;
Dynamical system theory has been applied in the field of neuroscience and cognitive development, especially in the neo-Piagetian theories of cognitive development. It is the belief that cognitive development is best represented by physical theories rather than theories based on syntax and AI. It also believed that differential equations are the most appropriate tool for modeling human behavior. These equations are interpreted to represent an agent's cognitive trajectory through state space. In other words, dynamicists argue that psychology should be (or is) the description (via differential equations) of the cognitions and behaviors of an agent under certain environmental and internal pressures. The language of chaos theory is also frequently adopted.&lt;br /&gt;
&lt;br /&gt;
动力系统理论已经被应用于神经科学和认知发展领域，特别是在认知发展的'''新皮亚杰学派 neo-Piagetian'''中。人们相信，物理学理论比句法学理论和人工智能理论更能代表认知发展。人们还相信微分方程是人类行为建模最合适的工具。人们认为微分方程可以解释为通过状态空间代表一个主体的认知轨迹的算式。换句话说，动力学家认为心理学应该(或者是)(通过微分方程)描述在一定的环境和内部压力下的主体的认知和行为的学科。混沌理论在相关领域也经常被采用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In it, the learner's mind reaches a state of disequilibrium where old patterns have broken down. This is the phase transition of cognitive development. [[Self-organization]] (the spontaneous creation of coherent forms) sets in as activity levels link to each other. Newly formed macroscopic and microscopic structures support each other, speeding up the process. These links form the structure of a new state of order in the mind through a process called ''scalloping'' (the repeated building up and collapsing of complex performance.) This new, novel state is progressive, discrete, idiosyncratic and unpredictable.&amp;lt;ref&amp;gt;{{cite journal|title=The Promise of Dynamic Systems Approaches for an Integrated Account of Human Development|journal=Child Development|date=2000-02-25|first=Mark D.|last=Lewis|volume=71|issue=1|pages=36–43|id= |url=http://home.oise.utoronto.ca/~mlewis/Manuscripts/Promise.pdf|accessdate=2008-04-04|doi=10.1111/1467-8624.00116|pmid=10836556 |citeseerx=10.1.1.72.3668}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In it, the learner's mind reaches a state of disequilibrium where old patterns have broken down. This is the phase transition of cognitive development. Self-organization (the spontaneous creation of coherent forms) sets in as activity levels link to each other. Newly formed macroscopic and microscopic structures support each other, speeding up the process. These links form the structure of a new state of order in the mind through a process called scalloping (the repeated building up and collapsing of complex performance.) This new, novel state is progressive, discrete, idiosyncratic and unpredictable.&lt;br /&gt;
&lt;br /&gt;
在学习的过程中，旧的模式被打破了，学习者的思维达到了一种不平衡的状态。这是认知发展的阶段性转变。自组织(连贯的自发创造(the spontaneous creation of coherent forms))在'''活动水平 Activity Levels'''相互联系时产生。新形成的宏观和微观结构相互支持，加速了这一过程。这些联系在头脑中形成了一种具有新状态的结构，这个过程被称为“扇贝化 Scalloping”，也就是头脑的复杂性能的不断累积和崩溃的过程 --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|扇贝化的翻译拿不准，这句话的描述比较抽象]]）。这种新的状态是渐进的、离散的、异质的的和不可预知的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Dynamic systems theory has recently been used to explain a long-unanswered problem in child development referred to as the [[A-not-B error]].&amp;lt;ref&amp;gt;{{cite journal|title=Development as a dynamic system|journal=Trends in Cognitive Sciences|date=2003-07-30|first=Linda B.|last=Smith|author2=Esther Thelen|volume=7|issue=8|pages=343–8|id= |url=http://www.indiana.edu/~cogdev/labwork/dynamicsystem.pdf|accessdate=2008-04-04|doi=10.1016/S1364-6613(03)00156-6|pmid=12907229|citeseerx=10.1.1.294.2037}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Dynamic systems theory has recently been used to explain a long-unanswered problem in child development referred to as the A-not-B error.&lt;br /&gt;
&lt;br /&gt;
动力系统理论最近还被用来解释儿童发展中一个长期没有答案的问题，即 A-not-B 错误。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===In second language development 在二语习得中的应用===&lt;br /&gt;
&lt;br /&gt;
{{Main|Dynamic approach to second language development}}&lt;br /&gt;
&lt;br /&gt;
The application of Dynamic Systems Theory to study [[second language acquisition]] is attributed to [[Diane Larsen-Freeman]] who published an article in 1997 in which she claimed that [[second language acquisition]] should be viewed as a developmental process which includes [[language attrition]] as well as language acquisition.&amp;lt;ref&amp;gt;{{cite web|url=https://academic.oup.com/applij/article-abstract/18/2/141/134192|title=Chaos/Complexity Science and Second Language Acquisition|date=1997|publisher=Applied Linguistics}}&amp;lt;/ref&amp;gt; In her article she claimed that language should be viewed as a dynamic system which is dynamic, complex, nonlinear, chaotic, unpredictable, sensitive to initial conditions, open, self-organizing, feedback sensitive, and adaptive.&lt;br /&gt;
&lt;br /&gt;
The application of Dynamic Systems Theory to study second language acquisition is attributed to Diane Larsen-Freeman who published an article in 1997 in which she claimed that second language acquisition should be viewed as a developmental process which includes language attrition as well as language acquisition. In her article she claimed that language should be viewed as a dynamic system which is dynamic, complex, nonlinear, chaotic, unpredictable, sensitive to initial conditions, open, self-organizing, feedback sensitive, and adaptive.&lt;br /&gt;
&lt;br /&gt;
动力系统理论在二语习得研究中的应用归功于 Diane Larsen-Freeman，她在1997年发表的一篇文章中认为，二语习得应该被看作是一个包括语言流失和习得在内的发展过程。她在文章中认为，语言应该被看作是一个动态的、复杂的、非线性的、混沌的、不可预知的、对初始条件敏感的、开放的、自组织的、反馈敏感的和适应性的动力系统。&lt;br /&gt;
&lt;br /&gt;
== See also 参见==&lt;br /&gt;
&lt;br /&gt;
;Related subjects&lt;br /&gt;
&lt;br /&gt;
Related subjects&lt;br /&gt;
&lt;br /&gt;
相关科目&lt;br /&gt;
&lt;br /&gt;
{{div col|colwidth=20em}}&lt;br /&gt;
&lt;br /&gt;
* [[List of dynamical system topics]] 动力系统主题清单&lt;br /&gt;
&lt;br /&gt;
* [[Baker's map]]&lt;br /&gt;
&lt;br /&gt;
* [[Biological applications of bifurcation theory]] 分支理论的生物学应用&lt;br /&gt;
&lt;br /&gt;
* [[Dynamical system (definition)]] 动力系统（定义）&lt;br /&gt;
&lt;br /&gt;
* [[Embodied Embedded Cognition]] 具身认知&lt;br /&gt;
&lt;br /&gt;
* [[Fibonacci numbers]] 斐波那契数&lt;br /&gt;
&lt;br /&gt;
* [[Fractals]] 分形&lt;br /&gt;
&lt;br /&gt;
* [[Gingerbreadman map]]&lt;br /&gt;
&lt;br /&gt;
* [[Halo orbit]] Halo 轨道&lt;br /&gt;
&lt;br /&gt;
* [[List of types of systems theory]] 动力系统类型清单&lt;br /&gt;
&lt;br /&gt;
* [[Oscillation]] 振动性&lt;br /&gt;
&lt;br /&gt;
* [[Postcognitivism]]&lt;br /&gt;
&lt;br /&gt;
* [[Recurrent neural network]] 递归神经网络&lt;br /&gt;
&lt;br /&gt;
* [[Combinatorics and dynamical systems]] 组合数学和动力系统&lt;br /&gt;
&lt;br /&gt;
* [[Synergetics (Haken)|Synergetics]] 协同学(Haken)&lt;br /&gt;
&lt;br /&gt;
* [[Systemography]]&lt;br /&gt;
&lt;br /&gt;
{{div col end}}&lt;br /&gt;
&lt;br /&gt;
;Related scientists&lt;br /&gt;
&lt;br /&gt;
Related scientists&lt;br /&gt;
&lt;br /&gt;
相关科学家&lt;br /&gt;
&lt;br /&gt;
{{div col|colwidth=20em}}&lt;br /&gt;
&lt;br /&gt;
* [[People in systems and control]]&lt;br /&gt;
&lt;br /&gt;
* [[Dmitri Anosov]]&lt;br /&gt;
&lt;br /&gt;
* [[Vladimir Arnold]]&lt;br /&gt;
&lt;br /&gt;
* [[Nikolay Bogolyubov]]&lt;br /&gt;
&lt;br /&gt;
* [[Andrey Kolmogorov]]&lt;br /&gt;
&lt;br /&gt;
* [[Nikolay Mitrofanovich Krylov|Nikolay Krylov]]&lt;br /&gt;
&lt;br /&gt;
* [[Jürgen Moser]]&lt;br /&gt;
&lt;br /&gt;
* [[Yakov G. Sinai]]&lt;br /&gt;
&lt;br /&gt;
* [[Stephen Smale]]&lt;br /&gt;
&lt;br /&gt;
* [[Hillel Furstenberg]]&lt;br /&gt;
&lt;br /&gt;
* [[Grigory Margulis]]&lt;br /&gt;
&lt;br /&gt;
* [[Elon Lindenstrauss]]&lt;br /&gt;
&lt;br /&gt;
{{div col end}}&lt;br /&gt;
&lt;br /&gt;
== Notes 参考资料==&lt;br /&gt;
&lt;br /&gt;
{{reflist}}&lt;br /&gt;
&lt;br /&gt;
== Further reading 拓展阅读==&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Frederick D. |last1=Abraham |first2=Ralph |last2=Abraham |authorlink2=Ralph Abraham (mathematician)|first3=Christopher D. |last3=Shaw |title=A Visual Introduction to Dynamical Systems Theory for Psychology |url=https://books.google.com/books?id=oMbaAAAAMAAJ |year=1990 |publisher=Aerial Press |isbn=978-0-942344-09-7 |oclc=24345312}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=Edward J. |last=Beltrami |title=Mathematics for Dynamic Modeling |url=https://books.google.com/books?id=MmoiJPsuFW8C |year=1998 |publisher=Academic Press |isbn=978-0-12-085566-7 |edition=2nd |oclc=36713294}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=Otomar |last=Hájek |title=Dynamical systems in the plane |url=https://books.google.com/books?id=czhPAQAAIAAJ |year=1968 |publisher=Academic Press |oclc=343328 |authorlink=Otomar Hájek |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=David G. |last=Luenberger |title=Introduction to dynamic systems: theory, models, and applications |url=https://books.google.com/books?id=mvlQAAAAMAAJ |year=1979 |publisher=Wiley |isbn=978-0-471-02594-8 |oclc=4195122 |authorlink=David Luenberger |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Anthony |last1=Michel |author2=Kaining Wang |author3=Bo Hu |title=Qualitative Theory of Dynamical Systems |url=https://books.google.com/books?id=ZPGBnZGV2_cC |year=2001 |publisher=Taylor &amp;amp; Francis |isbn=978-0-8247-0526-8 |oclc=45873628}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Louis |last1=Padulo |first2=Michael A. |last2=Arbib |authorlink2=Michael A. Arbib |title=System theory: a unified state-space approach to continuous and discrete systems |url=https://books.google.com/books?id=6UPvAAAAMAAJ |year=1974 |publisher=Saunders |isbn=9780721670355 |oclc=947600 |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |first=Steven H. |last=Strogatz |title=Nonlinear Dynamics and Chaos: With Applications to Physics, Biology, Chemistry, and Engineering |year=1994 |publisher=Addison Wesley |isbn=978-0-7382-0453-6 |oclc=49839504 |authorlink=Steven Strogatz |ref=harv |url-access=registration |url=https://archive.org/details/nonlineardynamic00stro }}&lt;br /&gt;
&lt;br /&gt;
== External links 外部链接==&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20080613053119/http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html Dynamic Systems 动力系统] Encyclopedia of Cognitive Science entry. --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|这是一个嵌套的链接，但好像只能鼠标点击并超链接到内嵌的那个]]）认知科学百科全书&lt;br /&gt;
&lt;br /&gt;
*[http://mathworld.wolfram.com/DynamicalSystem.html Definition of dynamical system 动力系统的定义] in MathWorld. 在MathWorld.wolfram.com储存的定义&lt;br /&gt;
&lt;br /&gt;
*[http://www.dynamicalsystems.org/ DSWeb] Dynamical Systems Magazine 动力系统杂志&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Areas of mathematics | state=collapsed}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:Dynamical systems]]&lt;br /&gt;
&lt;br /&gt;
Category:Dynamical systems&lt;br /&gt;
&lt;br /&gt;
类别: 动力系统&lt;br /&gt;
&lt;br /&gt;
[[Category:Complex systems theory]]&lt;br /&gt;
&lt;br /&gt;
Category:Complex systems theory&lt;br /&gt;
&lt;br /&gt;
范畴: 复杂系统理论&lt;br /&gt;
&lt;br /&gt;
[[Category:Computational fields of study]]&lt;br /&gt;
&lt;br /&gt;
Category:Computational fields of study&lt;br /&gt;
&lt;br /&gt;
类别: 研究的计算领域&lt;br /&gt;
&lt;br /&gt;
&amp;lt;noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;small&amp;gt;This page was moved from [[wikipedia:en:Dynamical systems theory]]. Its edit history can be viewed at [[动力系统/edithistory]]&amp;lt;/small&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:待整理页面]]&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
===书籍推荐===&lt;br /&gt;
====[https://www.amazon.co.uk/Chaos-Making-Science-James-Gleick/dp/0749386061 Chaos: Making a New Science]====&lt;br /&gt;
The million-copy bestseller by National Book Award nominee and Pulitzer Prize finalist James Gleick—the author of Time Travel: A History—that reveals the science behind chaos theory。&lt;br /&gt;
Very readable, focuses on the scientists and mathematicians behind many of the key results in chaos.&lt;br /&gt;
本书由普利茨奖获得者James Gleick撰写。它是一本易读科普书籍，侧重介绍对混沌概念的发展做出重大贡献的科学家和数学家们。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://www.amazon.com/dp/0199566445/ref=cm_sw_su_dp Chaos and Fractals: An Elementary Introduction]====&lt;br /&gt;
This book provides the reader with an elementary introduction to chaos and fractals, suitable for students with a background in elementary algebra, without assuming prior coursework in calculus or physics. &lt;br /&gt;
这是一本关于混沌和分形的入门书籍。读者需要有一定的线性代数基础，但是不需要有微积分或物理学的基础。&lt;br /&gt;
&lt;br /&gt;
====[https://www.amazon.co.uk/Chaos-Very-Short-Introduction-Introductions/dp/0192853783/ref=pd_lpo_14_img_1/257-2017232-0516612?_encoding=UTF8&amp;amp;pd_rd_i=0192853783&amp;amp;pd_rd_r=eebee69a-fad3-43e3-bbeb-b883f2c59bf5&amp;amp;pd_rd_w=g6knH&amp;amp;pd_rd_wg=sx6z5&amp;amp;pf_rd_p=7b8e3b03-1439-4489-abd4-4a138cf4eca6&amp;amp;pf_rd_r=YTB0XXCR2DM8049PYP1Y&amp;amp;psc=1&amp;amp;refRID=YTB0XXCR2DM8049PYP1Y 牛津通识读本: Chaos]====&lt;br /&gt;
This book would not have been possible without my parents, of course, but I owe a greater debt than most to their faith, doubt, and hope, and to the love and patience of a, b, and c. Professionally my greatest debt is to Ed Spiegel, a father of chaos and my thesis Professor, mentor, and friend.&lt;br /&gt;
本书隶属于牛津通识读本系列。该书由Ed Spiegel的学生Leonard Smith撰写，语言生动简明。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
===集智课程推荐===&lt;br /&gt;
====[https://campus.swarma.org/course/1655 圣塔菲课程：Introduction to Dynamical Systems and Chaos]====&lt;br /&gt;
本课程中，主要介绍动力学系统和混沌系统，您将学到'''蝴蝶效应 Butterfly effect'''、'''奇异吸引子 Attractors'''等基本概念，以及如何应用于您感兴趣的领域。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://campus.swarma.org/course/1641 动力系统分析]====&lt;br /&gt;
本课程主要讲授连续和离散动力系统的定态、极限环及其稳定性分析、动力学系统的结构稳定性和常见的分支类型以及分析方法，混沌概念等。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E5%8A%A8%E5%8A%9B%E7%B3%BB%E7%BB%9F%E7%90%86%E8%AE%BA_Dynamical_Systems_Theory&amp;diff=10189</id>
		<title>动力系统理论 Dynamical Systems Theory</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E5%8A%A8%E5%8A%9B%E7%B3%BB%E7%BB%9F%E7%90%86%E8%AE%BA_Dynamical_Systems_Theory&amp;diff=10189"/>
		<updated>2020-07-11T16:41:19Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。&lt;br /&gt;
&lt;br /&gt;
{{Use dmy dates|date=May 2019|cs1-dates=y}}&lt;br /&gt;
&lt;br /&gt;
'''Dynamical systems theory''' is an area of [[mathematics]] used to describe the behavior of the  [[complex systems|complex]] [[dynamical system]]s, usually by employing [[differential equations]] or [[difference equations]]. When differential equations are employed, the theory is called [[continuous time|''continuous dynamical systems'']]. From a physical point of view, continuous dynamical systems is a generalization of [[classical mechanics]], a generalization where the [[equations of motion]] are postulated directly and are not constrained to be [[Euler–Lagrange equation]]s of a [[Principle of least action|least action principle]]. When difference equations are employed, the theory is called [[discrete time|''discrete dynamical systems'']]. When the time variable runs over a set that is discrete over some intervals and continuous over other intervals or is any arbitrary time-set such as a [[cantor set]], one gets [[dynamic equations on time scales]]. Some situations may also be modeled by mixed operators, such as [[differential-difference equations]].&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory is an area of mathematics used to describe the behavior of the  complex dynamical systems, usually by employing differential equations or difference equations. When differential equations are employed, the theory is called continuous dynamical systems. From a physical point of view, continuous dynamical systems is a generalization of classical mechanics, a generalization where the equations of motion are postulated directly and are not constrained to be Euler–Lagrange equations of a least action principle. When difference equations are employed, the theory is called discrete dynamical systems. When the time variable runs over a set that is discrete over some intervals and continuous over other intervals or is any arbitrary time-set such as a cantor set, one gets dynamic equations on time scales. Some situations may also be modeled by mixed operators, such as differential-difference equations.&lt;br /&gt;
&lt;br /&gt;
  &lt;br /&gt;
'''动力系统理论 Dynamical Systems Theory'''是一个用来描述复杂动力系统行为的数学领域，通常使用微分方程或差分方程。当采用微分方程时，该理论被称为连续动力系统。从物理学的角度来看，连续动力系统是经典力学的推广，也是运动方程的推广，不受极小作用原理Euler–Lagrange方程的约束。当采用差分方程时，该理论被称为离散动力系统。&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;当时间变量在一个离散的集合上运行，在另一个离散的集合上连续，或者像cantor集一样在任意的时间集合上运行时，人们就能得到时间尺度上的动力方程。&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 当时间变量运行在一个某些区间离散、其他区间连续的集合、或者像cantor集一样任意的时间集合上时，人们就能得到时间尺度上的动力方程。&amp;lt;/font&amp;gt;&lt;br /&gt;
&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;'''算子 Operators'''是一个函数空间到函数空间上的映射O：X→X，广义的讲，对任何函数进行某一项操作都可以认为是一个算子，如求幂次、求微分等。&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;这句话的英文原文在哪里？&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;动力系统的有些情况也可以用'''混合算子 Mixed Operators'''来建模，如微分-差分方程。&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 某些情况下，也可以用'''混合算子 Mixed Operators'''来建模，如微分-差分方程。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This theory deals with the long-term qualitative behavior of dynamical systems, and studies the nature of, and when possible the solutions of, the [[equations of motion]] of systems that are often primarily [[mechanics|mechanical]] or otherwise physical in nature, such as [[planetary orbit]]s and the behaviour of [[electronic circuit]]s, as well as systems that arise in [[biology]], [[economics]], and elsewhere. Much of modern research is focused on the study of [[chaotic system]]s.&lt;br /&gt;
&lt;br /&gt;
This theory deals with the long-term qualitative behavior of dynamical systems, and studies the nature of, and when possible the solutions of, the equations of motion of systems that are often primarily mechanical or otherwise physical in nature, such as planetary orbits and the behaviour of electronic circuits, as well as systems that arise in biology, economics, and elsewhere. Much of modern research is focused on the study of chaotic systems.&lt;br /&gt;
&lt;br /&gt;
这个理论处理动力系统的长期定性行为。&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;如果能够得到解的话，还可以研究系统的运动方程。这些方程通常运用到机械或物理研究领域，如行星轨道和电子电路，以及出现在生物学，经济学和其他地方的系统。&amp;lt;/font&amp;gt;现代的研究大多集中在对混沌系统的研究上。&lt;br /&gt;
&lt;br /&gt;
这个理论处理动力系统的长期定性行为，&amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;并且研究系统的动力方程的规律，努力求得可能的解。这些系统通常是一些自然领域里的机械系统或其他物理系统，例如行星轨道和电子电路，也包括一些生物学、经济学和其他学科里的系统。&amp;lt;/font&amp;gt;现代的研究大多集中在对混沌系统的研究上。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This field of study is also called just ''dynamical systems'', ''mathematical dynamical systems theory'' or the ''mathematical theory of dynamical systems''.&lt;br /&gt;
&lt;br /&gt;
This field of study is also called just dynamical systems, mathematical dynamical systems theory or the mathematical theory of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
这个研究领域也被称为动力系统，数学动力系统理论或动力系统的数学理论。&lt;br /&gt;
&lt;br /&gt;
[[Image:Lorenz attractor yb.svg|thumb|240px|right|The [[Lorenz attractor]] is an example of a [[non-linear]] dynamical system. Studying this system helped give rise to [[chaos theory]].]]&lt;br /&gt;
&lt;br /&gt;
The [[Lorenz attractor is an example of a non-linear dynamical system. Studying this system helped give rise to chaos theory.]]&lt;br /&gt;
&lt;br /&gt;
'''洛伦兹吸引子 Lorenz Attractor'''是非线性动力系统的一个例子。对这个系统的研究产生了混沌理论。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Overview 综述 ==&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory and [[chaos theory]] deal with the long-term qualitative behavior of [[dynamical system]]s. Here, the focus is not on finding precise solutions to the equations defining the dynamical system (which is often hopeless), but rather to answer questions like &amp;quot;Will the system settle down to a steady state in the long term, and if so, what are the possible steady states?&amp;quot;, or &amp;quot;Does the long-term behavior of the system depend on its initial condition?&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory and chaos theory deal with the long-term qualitative behavior of dynamical systems. Here, the focus is not on finding precise solutions to the equations defining the dynamical system (which is often hopeless), but rather to answer questions like &amp;quot;Will the system settle down to a steady state in the long term, and if so, what are the possible steady states?&amp;quot;, or &amp;quot;Does the long-term behavior of the system depend on its initial condition?&amp;quot;&lt;br /&gt;
&lt;br /&gt;
动力系统理论和'''混沌理论 Chaos Theory'''是用来处理动力系统的长期定性行为的理论。寻找动力系统方程的精确解通常是很难达到的。这两个理论的重点不在于找到精确解，而是回答如下的问题，如“系统长期来看是否会稳定下来，如果可以，那么可能的稳定状态是什么样的?”，或“系统长期的行为是否取决于其初始条件?”&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
An important goal is to describe the fixed points, or steady states of a given dynamical system; these are values of the variable that don't change over time. Some of these fixed points are ''attractive'', meaning that if the system starts out in a nearby state, it converges towards the fixed point.&lt;br /&gt;
&lt;br /&gt;
An important goal is to describe the fixed points, or steady states of a given dynamical system; these are values of the variable that don't change over time. Some of these fixed points are attractive, meaning that if the system starts out in a nearby state, it converges towards the fixed point.&lt;br /&gt;
&lt;br /&gt;
描述给定动力系统的不动点或'''&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;定态&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;稳态&amp;lt;/font&amp;gt;Steady States'''是一个重要的目标。不动点或&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;定态&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;稳态&amp;lt;/font&amp;gt;的变量值不会随时间的变化而变化。&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;一些不动点是有吸引力的（attractive），即如果系统的初始值在它的附近，系统最终会收敛到这个不动点。&amp;lt;/font&amp;gt;&amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 某些不动点被称为“吸引子”，意味着如果系统即使不在它附近的状态开始，最终也会收敛到这些不动点。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Similarly, one is interested in ''periodic points'', states of the system that repeat after several timesteps. Periodic points can also be attractive. [[Sharkovskii's theorem]] is an interesting statement about the number of periodic points of a one-dimensional discrete dynamical system.&lt;br /&gt;
&lt;br /&gt;
Similarly, one is interested in periodic points, states of the system that repeat after several timesteps. Periodic points can also be attractive. Sharkovskii's theorem is an interesting statement about the number of periodic points of a one-dimensional discrete dynamical system.&lt;br /&gt;
&lt;br /&gt;
人们还对动力系统的'''周期点 Periodic Points'''感兴趣，即系统在几个时间步之后会不断重复的状态。周期点也可以是有吸引力的。Sharkovskii定理描述了一维离散动力系统的周期点的个数。&lt;br /&gt;
&amp;lt;font color='blue'&amp;gt;类似地，另一个研究兴趣是'''周期点 Periodic Points'''，即系统在重复几个时间步之后的状态。周期点也可以是吸引子。Sharkovskii定理描述了一维离散动力系统的周期点的个数。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Even simple [[nonlinear dynamical system]]s often exhibit seemingly random behavior that has been called ''chaos''.&amp;lt;ref&amp;gt;{{cite journal |last=Grebogi |first=C. |last2=Ott |first2=E. |last3=Yorke |first3=J. |year=1987 |title=Chaos, Strange Attractors, and Fractal Basin Boundaries in Nonlinear Dynamics |journal=[[Science (journal)|Science]] |volume=238 |issue=4827 |pages=632–638 |jstor=1700479 |doi=10.1126/science.238.4827.632 |pmid=17816542 |bibcode=1987Sci...238..632G }}&amp;lt;/ref&amp;gt; The branch of dynamical systems that deals with the clean definition and investigation of chaos is called ''[[chaos theory]]''.&lt;br /&gt;
&lt;br /&gt;
Even simple nonlinear dynamical systems often exhibit seemingly random behavior that has been called chaos. The branch of dynamical systems that deals with the clean definition and investigation of chaos is called chaos theory.&lt;br /&gt;
&lt;br /&gt;
即使是简单的非线性动力系统也常常表现出看似随机的行为，这种行为被称为混沌。混沌理论主要研究混沌的清晰定义和混沌的现象，它是动力系统理论的一个分支。&lt;br /&gt;
&lt;br /&gt;
== History 历史==&lt;br /&gt;
&lt;br /&gt;
The concept of dynamical systems theory has its origins in [[Newtonian mechanics]]. There, as in other natural sciences and engineering disciplines, the evolution rule of dynamical systems is given implicitly by a relation that gives the state of the system only a short time into the future.&lt;br /&gt;
&lt;br /&gt;
The concept of dynamical systems theory has its origins in Newtonian mechanics. There, as in other natural sciences and engineering disciplines, the evolution rule of dynamical systems is given implicitly by a relation that gives the state of the system only a short time into the future.&lt;br /&gt;
&lt;br /&gt;
动态系统理论的概念起源于牛顿运动定律。与其他自然科学和工程学科一样，动力系统的演化规律也是通过一种预测系统在未来很短时间内的状态的关系隐含地给出的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Before the advent of [[computer|fast computing machines]], solving a dynamical system required sophisticated mathematical techniques and could only be accomplished for a small class of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
Before the advent of fast computing machines, solving a dynamical system required sophisticated mathematical techniques and could only be accomplished for a small class of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
在高速计算机器出现之前，解决动力系统问题需要复杂的数学技能，而且还只能解决一小类动力系统问题。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Some excellent presentations of mathematical dynamic system theory include {{harvtxt|Beltrami|1990}}, {{harvtxt|Luenberger|1979}}, {{harvtxt|Padulo|Arbib|1974}}, and {{harvtxt|Strogatz|1994}}.&amp;lt;ref&amp;gt;Jerome R. Busemeyer (2008), [http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html &amp;quot;Dynamic Systems&amp;quot;]. To Appear in: ''Encyclopedia of cognitive science'', Macmillan. Retrieved 8 May 2008.  {{webarchive |url=https://web.archive.org/web/20080613053119/http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html |date=June 13, 2008 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Some excellent presentations of mathematical dynamic system theory include , , , and . To Appear in: ''Encyclopedia of cognitive science'', Macmillan. Retrieved 8 May 2008&lt;br /&gt;
&lt;br /&gt;
优秀的数学动力系统理论包括，，，和。--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|存疑]]）。&lt;br /&gt;
&lt;br /&gt;
&amp;lt;font color='blue'&amp;gt;原文是：Some excellent presentations of mathematical dynamic system theory include Beltrami (1990), Luenberger (1979), Padulo &amp;amp; Arbib (1974), and Strogatz (1994).[2] 是不是在粘贴或解析时内容有丢失？&lt;br /&gt;
&lt;br /&gt;
一些优秀的数学动力系统理论包括贝尔特拉米（Beltrami，1990年），龙伯格(Luenberger，1979年），帕杜罗&amp;amp;阿尔比布（Padulo＆Arbib，1974年）和斯托加茨（Strogatz，1994年）。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Concepts 概念==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Dynamical systems 动力系统===&lt;br /&gt;
&lt;br /&gt;
{{main|Dynamical system (definition)}}&lt;br /&gt;
&lt;br /&gt;
The [[dynamical system]] concept is a mathematical [[formal system|formalization]] for any fixed &amp;quot;rule&amp;quot; that describes the [[time]] dependence of a point's position in its [[ambient space]].  Examples include the [[mathematical model]]s that describe the swinging of a clock pendulum, the flow of water in a pipe, and the number of fish each spring in a lake.&lt;br /&gt;
&lt;br /&gt;
The dynamical system concept is a mathematical formalization for any fixed &amp;quot;rule&amp;quot; that describes the time dependence of a point's position in its ambient space.  Examples include the mathematical models that describe the swinging of a clock pendulum, the flow of water in a pipe, and the number of fish each spring in a lake.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;动力系统是一个对任何描述了点的位置在周围环境随时间变化的“固定”规则的数学式。&amp;lt;/font&amp;gt;&amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;动力系统概念是对描述了一个点的位置在其周围环境中随时间变化的任何“固定”规则的数学形式化。&amp;lt;/font&amp;gt;举例来说，描述钟摆摆动、管道中的水流以及每年春天湖中鱼的数量的数学模型，都属于动力系统的概念范畴。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A dynamical system has a ''state'' determined by a collection of [[real numbers]], or more generally by a [[Set (mathematics)|set]] of [[Point (geometry)|points]] in an appropriate ''state space''.  Small changes in the state of the system correspond to small changes in the numbers.  The numbers are also the coordinates of a geometrical space—a [[manifold]].   The ''evolution rule'' of the dynamical system is a [[function (mathematics)|fixed rule]] that describes what future states follow from the current state.  The rule may be [[Deterministic system (mathematics)|deterministic]] (for a given time interval only one future state follows from the current state) or [[stochastic differential equation|stochastic]] (the evolution of the state is subject to random shocks).&lt;br /&gt;
&lt;br /&gt;
A dynamical system has a state determined by a collection of real numbers, or more generally by a set of points in an appropriate state space.  Small changes in the state of the system correspond to small changes in the numbers.  The numbers are also the coordinates of a geometrical space—a manifold.   The evolution rule of the dynamical system is a fixed rule that describes what future states follow from the current state.  The rule may be deterministic (for a given time interval only one future state follows from the current state) or stochastic (the evolution of the state is subject to random shocks).&lt;br /&gt;
&lt;br /&gt;
动力系统的状态是由一组实数决定的，更广泛地说，是由适当的状态空间中的一组点决定的。系统状态的微小变化对应于数字的变化。这些数字也是几何空间——'''流形 Manifold'''——的坐标组。&amp;lt;font color='red'&amp;gt;动力系统的演化是描述了在当前状态之后出现的未来状态的固定规则。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;动力系统的演化规律是一种固定的规则，它描述了从当前状态得出的未来状态。&amp;lt;/font&amp;gt;这个规则可以是确定性的(在给定的时间间隔内，有且仅有一个未来状态在当前状态之后出现)，或随机性的(状态的演化受到随机因素的影响)。&lt;br /&gt;
&lt;br /&gt;
=== Dynamicism 动态主义===&lt;br /&gt;
&lt;br /&gt;
[[Dynamicism]], also termed the ''dynamic hypothesis'' or the ''dynamic hypothesis in cognitive science'' or ''dynamic cognition'', is a new approach in [[cognitive science]] exemplified by the work of philosopher [[Tim van Gelder]]. It argues that [[differential equations]] are more suited to modelling [[cognition]] than more traditional [[computer]] models.&lt;br /&gt;
&lt;br /&gt;
Dynamicism, also termed the dynamic hypothesis or the dynamic hypothesis in cognitive science or dynamic cognition, is a new approach in cognitive science exemplified by the work of philosopher Tim van Gelder. It argues that differential equations are more suited to modelling cognition than more traditional computer models.&lt;br /&gt;
&lt;br /&gt;
'''动态主义 Dynamicism'''，也称动态假设，&amp;lt;font color='red'&amp;gt;或称认知科学、动态认知中的动态假设，&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;或称认知科学的动态假设或动态认知，&amp;lt;/font&amp;gt;是以哲学家Tim van Gelder的著作为代表的认知科学的一种新取向。动态主义认为微分方程比传统的计算机模型更适合于建立认知模型。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Nonlinear system 非线性系统===&lt;br /&gt;
&lt;br /&gt;
{{main|Nonlinear system}}&lt;br /&gt;
&lt;br /&gt;
In [[mathematics]], a [[nonlinear system]] is a system that is not [[linear system|linear]]—i.e., a system that does not satisfy the [[superposition principle]]. Less technically, a nonlinear system is any problem where the variable(s) to solve for cannot be written as a linear sum of independent components. A [[Homogeneity (physics)|nonhomogeneous]] system, which is linear apart from the presence of a function of the [[independent variable]]s, is nonlinear according to a strict definition, but such systems are usually studied alongside linear systems, because they can be transformed to a linear system as long as a particular solution is known.&lt;br /&gt;
&lt;br /&gt;
In mathematics, a nonlinear system is a system that is not linear—i.e., a system that does not satisfy the superposition principle. Less technically, a nonlinear system is any problem where the variable(s) to solve for cannot be written as a linear sum of independent components. A nonhomogeneous system, which is linear apart from the presence of a function of the independent variables, is nonlinear according to a strict definition, but such systems are usually studied alongside linear systems, because they can be transformed to a linear system as long as a particular solution is known.&lt;br /&gt;
&lt;br /&gt;
在数学中，'''非线性系统 Nonlinear System'''是指系统不是线性的——也就是说，一个不满足叠加原理的系统。更通俗地说，非线性系统是待求解变量不能被写成其独立分量的线性和的系统。非齐次系统根据定义严格来说是非线性的，除了它的自变量&amp;lt;font color='red'&amp;gt;&amp;lt;s&amp;gt;包含&amp;lt;/s&amp;gt;&amp;lt;/font&amp;gt;函数以外其他部分都是线性的。&amp;lt;font color='red'&amp;gt;但非齐次系统通常与线性系统一起研究，因为只要知道特解，它们就可以转化为线性系统。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;但非齐次系统通常可当做线性系统进行研究，因为只要知道特定解，它就可以转化为线性系统。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Related fields 相关领域==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Arithmetic dynamics &amp;lt;font color='red'&amp;gt;算术动态系统&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;算术动力学&amp;lt;/font&amp;gt;===&lt;br /&gt;
&lt;br /&gt;
:[[Arithmetic dynamics]] is a field that emerged in the 1990s that amalgamates two areas of mathematics, [[dynamical systems]] and [[number theory]]. Classically, discrete dynamics refers to the study of the [[Iterated function|iteration]] of self-maps of the [[complex plane]] or [[real line]]. Arithmetic dynamics is the study of the number-theoretic properties of integer, rational, {{math|&amp;lt;var&amp;gt;p&amp;lt;/var&amp;gt;}}-adic, and/or algebraic points under repeated application of a [[polynomial]] or [[rational function]].&lt;br /&gt;
&lt;br /&gt;
Arithmetic dynamics is a field that emerged in the 1990s that amalgamates two areas of mathematics, dynamical systems and number theory. Classically, discrete dynamics refers to the study of the iteration of self-maps of the complex plane or real line. Arithmetic dynamics is the study of the number-theoretic properties of integer, rational, -adic, and/or algebraic points under repeated application of a polynomial or rational function.&lt;br /&gt;
&lt;br /&gt;
'''&amp;lt;font color='red'&amp;gt;算术动态系统&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;算术动力学&amp;lt;/font&amp;gt; Arithmetic Dynamics'''是20世纪90年代出现的一个领域，融合了动力系统和数论这两个数学领域。经典的离散动力学研究复平面或&amp;lt;font color='blue'&amp;gt;实直线&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;实数轴&amp;lt;/font&amp;gt;的自映射的迭代。&amp;lt;font color='red'&amp;gt;算术动态系统研究内容是在多项式或有理函数中的整数、有理数、并元 --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|存疑]]） 和/或代数点的数论性质。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;算术动力学是在反复应用多项式或有理函数的情况下研究整数，有理数，p进数(p-adic)和/或代数点的数论性质。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Chaos theory 混沌理论===&lt;br /&gt;
&lt;br /&gt;
:[[Chaos theory]] describes the behavior of certain [[dynamical system (definition)|dynamical system]]s – that is, systems whose state evolves with time – that may exhibit dynamics that are highly sensitive to initial conditions (popularly referred to as the [[butterfly effect]]). As a result of this sensitivity, which manifests itself as an exponential growth of perturbations in the initial conditions, the behavior of chaotic systems appears [[randomness|random]]. This happens even though these systems are [[deterministic system (philosophy)|deterministic]], meaning that their future dynamics are fully defined by their initial conditions, with no random elements involved. This behavior is known as deterministic chaos, or simply ''chaos''.&lt;br /&gt;
&lt;br /&gt;
Chaos theory describes the behavior of certain dynamical systems – that is, systems whose state evolves with time – that may exhibit dynamics that are highly sensitive to initial conditions (popularly referred to as the butterfly effect). As a result of this sensitivity, which manifests itself as an exponential growth of perturbations in the initial conditions, the behavior of chaotic systems appears random. This happens even though these systems are deterministic, meaning that their future dynamics are fully defined by their initial conditions, with no random elements involved. This behavior is known as deterministic chaos, or simply chaos.&lt;br /&gt;
&lt;br /&gt;
混沌理论描述了某些状态随时间演化的动力系统的行为，这些系统可能表现出对初始条件高度敏感的特点（通常被称为'''蝴蝶效应 Butterfly Effect'''）。由于扰动受初始条件影响而指数增长，因此混沌系统具有敏感性，敏感性使它的行为看起来是随机的。但是这种敏感性也会出现在确定的动力系统中，即&amp;lt;font color='blue'&amp;gt;它们&amp;lt;/font&amp;gt;未来的动力&amp;lt;s&amp;gt;学&amp;lt;/s&amp;gt;完全由它的初始条件定义，没有任何随机因素参与的系统中。这种现象被称为确定性混沌，或简单混沌。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Complex systems 复杂系统===&lt;br /&gt;
&lt;br /&gt;
:[[Complex systems]] is a scientific field that studies the common properties of [[system]]s considered [[Complexity|complex]] in [[nature]], [[society]], and [[science]]. It is also called ''complex systems theory'', ''complexity science'', ''study of complex systems'' and/or ''sciences of complexity''. The key problems of such systems are  difficulties with their formal [[Scientific modelling|modeling]] and [[simulation]]. From such perspective, in different research contexts complex systems are defined on the base of their different attributes.&lt;br /&gt;
&lt;br /&gt;
Complex systems is a scientific field that studies the common properties of systems considered complex in nature, society, and science. It is also called complex systems theory, complexity science, study of complex systems and/or sciences of complexity. The key problems of such systems are  difficulties with their formal modeling and simulation. From such perspective, in different research contexts complex systems are defined on the base of their different attributes.&lt;br /&gt;
&lt;br /&gt;
'''复杂系统 Complex Systems'''是研究自然、社会和科学中复杂现象的共同性质的科学领域。它也被称为复杂系统理论、复杂性科学、复杂系统研究和关于复杂性的科学。这些系统的关键问题在于对系统的形式化建模与仿真&amp;lt;font color='blue'&amp;gt;的困难&amp;lt;/font&amp;gt;。因此，复杂系统是根据在不同的研究语境中的不同属性来定义的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
:The study of complex systems is bringing new vitality to many areas of science where a more typical [[reductionist]] strategy has fallen short. ''Complex systems'' is therefore often used as a broad term encompassing a research approach to problems in many diverse disciplines including [[neurosciences]], [[social sciences]], [[meteorology]], [[chemistry]], [[physics]], [[computer science]], [[psychology]], [[artificial life]], [[evolutionary computation]], [[economics]], earthquake prediction, [[molecular biology]] and inquiries into the nature of living [[cell (biology)|cell]]s themselves.&lt;br /&gt;
&lt;br /&gt;
The study of complex systems is bringing new vitality to many areas of science where a more typical reductionist strategy has fallen short. Complex systems is therefore often used as a broad term encompassing a research approach to problems in many diverse disciplines including neurosciences, social sciences, meteorology, chemistry, physics, computer science, psychology, artificial life, evolutionary computation, economics, earthquake prediction, molecular biology and inquiries into the nature of living cells themselves.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;font color='red'&amp;gt;还原论策略已经不足以研究许多科学领域的问题，而复杂系统的研究则为科学带来了广泛的新活力。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;复杂系统的研究为许多科学领域带来了新的活力，在这些领域中，更为典型的还原论策略已经不足。&amp;lt;/font&amp;gt;复杂系统通常被用作一个应用广泛的研究方法术语，并涵盖许多不同的学科，包括神经科学、社会科学、气象学、化学、物理学、计算机科学、心理学、人工生命、进化计算、经济学、地震预测、分子生物学以及对活细胞的研究等。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Control theory 控制理论===&lt;br /&gt;
&lt;br /&gt;
:[[Control theory]] is an interdisciplinary branch of [[engineering]] and [[mathematics]], in part it deals with influencing the behavior of [[dynamical system]]s.&lt;br /&gt;
&lt;br /&gt;
Control theory is an interdisciplinary branch of engineering and mathematics, in part it deals with influencing the behavior of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
'''控制理论 Control Theory'''是工程和数学的一个交叉学科，它的其中一部分研究影响动力系统行为的各种因素。&lt;br /&gt;
&lt;br /&gt;
控制理论是一个研究如何调整动态系统特性的理论，它也是工程和数学的一个交叉学科，逐渐的应用在许多社会科学中，例如心理学、社会学（社会学中的控制理论）、犯罪学及'''金融系统 Financial System'''。控制理论一般的目的是借由控制器的动作让系统稳定，也就是系统维持在设定值，而且不会在设定值附近晃动。设定值一般维持不变的控制称为调节，设定值快速变化，要求跟踪速度加速度等的控制称为伺服。它的其中一部分研究影响动力系统行为的各种因素。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Ergodic theory 遍历理论===&lt;br /&gt;
&lt;br /&gt;
:[[Ergodic theory]] is a branch of [[mathematics]] that studies [[dynamical system]]s with an [[invariant measure]] and related problems. Its initial development was motivated by problems of [[statistical physics]].&lt;br /&gt;
&lt;br /&gt;
Ergodic theory is a branch of mathematics that studies dynamical systems with an invariant measure and related problems. Its initial development was motivated by problems of statistical physics.&lt;br /&gt;
&lt;br /&gt;
'''遍历理论 Ergodic Theory'''是数学的一个分支，研究有不变测度和相关问题的动力系统。它最初的发展受到了统计物理学的推动。&lt;br /&gt;
遍历理论是研究保测变换的渐近性态的数学分支。它起源于为统计力学提供基础的&amp;quot;遍历假设&amp;quot;研究，并与动力系统理论、概率论、信息论、泛函分析、数论等数学分支有着密切的联系。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Functional analysis 泛函分析===&lt;br /&gt;
&lt;br /&gt;
:[[Functional analysis]] is the branch of [[mathematics]], and specifically of [[mathematical analysis|analysis]], concerned with the study of [[vector space]]s and [[operator (mathematics)|operator]]s acting upon them. It has its historical roots in the study of [[functional space]]s, in particular transformations of [[function (mathematics)|functions]], such as the [[Fourier transform]], as well as in the study of [[differential equations|differential]] and [[integral equations]]. This usage of the word ''[[functional (mathematics)|functional]]'' goes back to the [[calculus of variations]], implying a function whose argument is a function. Its use in general has been attributed to mathematician and physicist [[Vito Volterra]] and its founding is largely attributed to mathematician [[Stefan Banach]].&lt;br /&gt;
&lt;br /&gt;
Functional analysis is the branch of mathematics, and specifically of analysis, concerned with the study of vector spaces and operators acting upon them. It has its historical roots in the study of functional spaces, in particular transformations of functions, such as the Fourier transform, as well as in the study of differential and integral equations. This usage of the word functional goes back to the calculus of variations, implying a function whose argument is a function. Its use in general has been attributed to mathematician and physicist Vito Volterra and its founding is largely attributed to mathematician Stefan Banach.&lt;br /&gt;
&lt;br /&gt;
'''泛函分析 Functional analysis'''是数学分析的一个分支，研究向量空间和作用于向量空间的算子。它源于对函数空间的研究，特别是对函数变换的研究，例如傅里叶变换，微积分方程的研究等。泛函分析的名称“Functional Analysis”中，“functional”这个词的用法可以追溯到变分法，也就是说函数的参数是一个函数。这个词的使用一般被认为归功于数学家和物理学家Vito Volterra，和数学家Stefan Banach。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Graph dynamical systems 图动力系统===&lt;br /&gt;
&lt;br /&gt;
:The concept of [[graph dynamical system]]s (GDS) can be used to capture a wide range of processes taking place on graphs or networks. A major theme in the mathematical and computational analysis of graph dynamical systems is to relate their structural properties (e.g. the network connectivity) and the global dynamics that result.&lt;br /&gt;
&lt;br /&gt;
The concept of graph dynamical systems (GDS) can be used to capture a wide range of processes taking place on graphs or networks. A major theme in the mathematical and computational analysis of graph dynamical systems is to relate their structural properties (e.g. the network connectivity) and the global dynamics that result.&lt;br /&gt;
&lt;br /&gt;
'''图动力系统 Graph dynamical systems (GDS)'''可以用来描绘图或网络上发生的各种过程。&amp;lt;font color='red'&amp;gt;图动力系统的数学和计算分析的一个主要主题是关联它们的结构性质(例如:网络连接)和结构性质造成的网络整体的动态结果。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;图动力系统的数学和计算分析的一个主要主题是将其结构特性（例如：网络连接性）与其所产生的全局动力学联系起来。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Projected dynamical systems 投影动力系统===&lt;br /&gt;
&lt;br /&gt;
:[[Projected dynamical systems]] it is a [[mathematics|mathematical]] theory investigating the behaviour of [[dynamical system]]s where solutions are restricted to a constraint set. The discipline shares connections to and applications with both the static world of [[Optimization (mathematics)|optimization]] and [[Equilibrium point|equilibrium]] problems and the dynamical world of [[ordinary differential equations]]. A projected dynamical system is given by the [[flow (mathematics)|flow]] to the projected differential equation.&lt;br /&gt;
&lt;br /&gt;
Projected dynamical systems it is a mathematical theory investigating the behaviour of dynamical systems where solutions are restricted to a constraint set. The discipline shares connections to and applications with both the static world of optimization and equilibrium problems and the dynamical world of ordinary differential equations. A projected dynamical system is given by the flow to the projected differential equation.&lt;br /&gt;
&lt;br /&gt;
'''投影动力系统 Projected Dynamical Systems'''是研究解在一个约束集内的动力系统行为的数学理论。这门学科与静态世界中的最优化和平衡问题以及动态世界中的常微分方程都有联系&amp;lt;font color='blue'&amp;gt;和&amp;lt;s&amp;gt;，并且都有相互联系的&amp;lt;/s&amp;gt;&amp;lt;/font&amp;gt;应用。一个投影动力系统是由投影微分方程的'''流形 flow'''给定的。&lt;br /&gt;
通过对投影微分方程的流分析，给出了一个投影动力系统的表达式：&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\frac{dx(t)}{dt} = \Pi_K(x(t),-F(x(t)))&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中K为约束集。这种形式的微分方程因具有不连续的向量场而值得注意。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Symbolic dynamics 符号动力学===&lt;br /&gt;
&lt;br /&gt;
:[[Symbolic dynamics]] is the practice of modelling a topological or smooth [[dynamical system]] by a discrete space consisting of infinite [[sequence]]s of abstract symbols, each of which corresponds to a state of the system, with the dynamics (evolution) given by the [[shift operator]].&lt;br /&gt;
&lt;br /&gt;
Symbolic dynamics is the practice of modelling a topological or smooth dynamical system by a discrete space consisting of infinite sequences of abstract symbols, each of which corresponds to a state of the system, with the dynamics (evolution) given by the shift operator.&lt;br /&gt;
&lt;br /&gt;
'''符号动力学 Symbolic Dynamics'''是通过一个由抽象符号的无限序列组成的离散空间建立一个拓扑或光滑动力系统的方法。每一个抽象符号的无限序列序列对应于系统的一个状态，并由移位算子给出动力学(演化)。&lt;br /&gt;
&amp;lt;font color='blue'&amp;gt;'''符号动力学 Symbolic Dynamics'''是通过离散空间对拓扑或平滑动力学系统进行建模的方法，该离散空间由无限的抽象符号序列组成，每个抽象符号对应于系统的一个状态，并且由移位运算符给出动力学（演化）。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== System dynamics 系统动力学===&lt;br /&gt;
&lt;br /&gt;
:[[System dynamics]] is an approach to understanding the behaviour of systems over time.  It deals with internal feedback loops and time delays that affect the behaviour and state of the entire system.&amp;lt;ref name=&amp;quot;sysdyn&amp;quot;&amp;gt;[http://sysdyn.clexchange.org MIT System Dynamics in Education Project (SDEP)&amp;lt;!-- Bot generated title --&amp;gt;] {{webarchive|url=https://web.archive.org/web/20080509163801/http://sysdyn.clexchange.org/ |date=2008-05-09 }}&amp;lt;/ref&amp;gt;  What makes using system dynamics different from other approaches to studying systems is the use of [[feedback]] loops and [[Stock and flow|stocks and flows]].  These elements help describe how even seemingly simple systems display baffling [[nonlinearity]].&lt;br /&gt;
&lt;br /&gt;
System dynamics is an approach to understanding the behaviour of systems over time.  It deals with internal feedback loops and time delays that affect the behaviour and state of the entire system.  What makes using system dynamics different from other approaches to studying systems is the use of feedback loops and stocks and flows.  These elements help describe how even seemingly simple systems display baffling nonlinearity.&lt;br /&gt;
&lt;br /&gt;
'''系统动力学 System Dynamics'''是一种理解系统随时间变化行为的方法。它是用来处理影响整个系统行为和状态的内部反馈回路和时间延迟的方法。系统动力学不同于其他系统研究方法的地方在于它使用了反馈环、&amp;lt;font color='red'&amp;gt;股票（stocks）和流形（flows）&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;存量(stocks)和流量(flows)--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|原wiki里这两个词指向:https://en.wikipedia.org/wiki/Stock_and_flow ，估计应该是存量和流量的意思，也可以群里大家讨论一下]]）&amp;lt;/font&amp;gt;--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|如何翻译stocks 和 folows]]）的元素。这些元素有助于描述看似简单的系统如何显示复杂的非线性行为。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Topological dynamics 拓扑动力学===&lt;br /&gt;
&lt;br /&gt;
:[[Topological dynamics]] is a branch of the theory of dynamical systems in which qualitative, asymptotic properties of dynamical systems are studied from the viewpoint of [[general topology]].&lt;br /&gt;
&lt;br /&gt;
Topological dynamics is a branch of the theory of dynamical systems in which qualitative, asymptotic properties of dynamical systems are studied from the viewpoint of general topology.&lt;br /&gt;
&lt;br /&gt;
'''拓扑动力学 Topological Dynamics'''是动力系统理论的一个分支。在拓朴动力学中，动力系统的定性性质和渐近性质是从一般拓扑学的观点来研究的。&lt;br /&gt;
&lt;br /&gt;
== Applications 应用==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== In human development 在人类发展中的应用===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In [[Developmental psychology|human development]], dynamical systems theory has been used to enhance and simplify Erik Erikson's [[eight stages of psychosocial development]] and offers a standard method of examining the universal pattern of human development. This method is based on the self-organizing and [[fractal]] properties of the [[Fibonacci sequence]].&amp;lt;ref name=Sacco&amp;gt;{{cite journal|last=Sacco|first=R.G.|title=Re-envisaging the eight developmental stages of Erik Erikson: The Fibonacci Life-Chart Method (FLCM)|journal=Journal of Educational and Developmental Psychology|date=2013|volume=3|issue=1|pages=140–146|doi=10.5539/jedp.v3n1p140|doi-access=free}}&amp;lt;/ref&amp;gt; Using mathematical modeling, a natural progression of human development with eight life stages has been identified:  early infancy (0–2 years), toddler (2–4 years), early childhood (4–7 years), middle childhood (7–11 years), adolescence (11–18 years), young adulthood (18–29 years), middle adulthood (29–48 years), and older adulthood (48–78+ years).&amp;lt;ref name=Sacco/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In human development, dynamical systems theory has been used to enhance and simplify Erik Erikson's eight stages of psychosocial development and offers a standard method of examining the universal pattern of human development. This method is based on the self-organizing and fractal properties of the Fibonacci sequence. Using mathematical modeling, a natural progression of human development with eight life stages has been identified:  early infancy (0–2 years), toddler (2–4 years), early childhood (4–7 years), middle childhood (7–11 years), adolescence (11–18 years), young adulthood (18–29 years), middle adulthood (29–48 years), and older adulthood (48–78+ years).&lt;br /&gt;
&lt;br /&gt;
在人类发展方面，动力系统理论已经被用来增强和简化 Erik Erikson 的'''社会心理发展8阶段理论 Eight Stages of Psychosocial Development'''，并提供了一个检验人类发展普遍模式的标准方法。该方法基于斐波那契数列的'''自组织性 self-organizing'''和'''分形 Fractal''' 特性。利用数学模型，人类发展的自然进程被分为8个生命阶段: 早期婴儿期(0-2岁)、幼儿期(2-4岁)、童年早期(4-7岁)、童年中期(7-11岁)、青春期(11-18岁)、成年早期(18-29岁)、成年中期(29-48岁)和老年成年期(48-78岁及以上)。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
According to this model, stage transitions between age intervals represent self-organization processes at multiple levels (e.g., molecules, genes, cell, organ, organ system, organism, behavior, and environment). For example, at the stage transition from [[adolescence]] to [[young adulthood]], and after reaching the critical point of 18 years of age (young adulthood), a peak in [[testosterone]] is observed in males&amp;lt;ref&amp;gt;{{cite journal |last1=Kelsey |first1=T. W. |title=A validated age-related normative model for male total testosterone shows increasing variance but no decline after age 40 years. |journal=PLOS One |volume=9 |issue=10 |pages=e109346 |doi=10.1371/journal.pone.0109346|pmid=25295520 |year=2014 |pmc=4190174 |bibcode=2014PLoSO...9j9346K }}&amp;lt;/ref&amp;gt; and the period of optimal [[fertility]] begins in females.&amp;lt;ref&amp;gt;{{cite book |last1=Tulandi |first1=T. |title=Preservation of fertility |date=2004 |publisher=Taylor &amp;amp; Francis |pages=1–20}}&amp;lt;/ref&amp;gt; Similarly, at age 30 optimal fertility begins to decline in females,&amp;lt;ref name=&amp;quot;Social Science 2008&amp;quot;&amp;gt;{{cite journal |last1=Blanchflower |first1=D. G. |title=Is well-being U-shaped over the life cycle? |journal=Social Science &amp;amp; Medicine |volume=66 |issue=8 |pages=1733–1749 |doi=10.1016/j.socscimed.2008.01.030|pmid=18316146 |year=2008 |citeseerx=10.1.1.63.5221 }}&amp;lt;/ref&amp;gt; and at the stage transition from [[middle adulthood]] to older adulthood at 48 years, the average age of onset of [[menopause]] occurs.&amp;lt;ref name=&amp;quot;Social Science 2008&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
According to this model, stage transitions between age intervals represent self-organization processes at multiple levels (e.g., molecules, genes, cell, organ, organ system, organism, behavior, and environment). For example, at the stage transition from adolescence to young adulthood, and after reaching the critical point of 18 years of age (young adulthood), a peak in testosterone is observed in males and the period of optimal fertility begins in females. Similarly, at age 30 optimal fertility begins to decline in females, and at the stage transition from middle adulthood to older adulthood at 48 years, the average age of onset of menopause occurs.&lt;br /&gt;
&lt;br /&gt;
根据这个模型，年龄的阶段转换代表了多层次的自组织过程(例如，分子、基因、细胞、器官、器官系统、生物体、行为和环境)。例如，在从青春期向成年早期过渡的阶段中，在达到18岁这一关键年龄之后，男性的睾丸激素达到高峰，女性的最佳生育期开始。同样，在30岁时，女性的最佳生育能力开始下降；在从成年中期过渡到老年成年期时，48岁是绝经的平均年龄。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
These events are physical bioattractors of aging from the perspective of Fibonacci mathematical modeling and dynamically systems theory. In practical terms, prediction in human development becomes possible in the same statistical sense in which the average temperature or precipitation at different times of the year can be used for [[weather forecasting]]. Each of the predetermined stages of human development follows an optimal epigenetic biological pattern. This phenomenon can be explained by the occurrence of Fibonacci numbers in biological [[DNA]]&amp;lt;ref&amp;gt;{{cite journal |last1=Perez |first1=J. C. (2010). |title=Codon populations in single-stranded whole human genome DNA are fractal and fine-tuned by the Golden Ratio 1.618. |journal=Interdisciplinary Sciences: Computational Life Sciences |volume=2 |issue=3 |pages=228–240 |doi=10.1007/s12539-010-0022-0|pmid=20658335 |year=2010 }}&amp;lt;/ref&amp;gt; and self-organizing properties of the Fibonacci numbers that converge on the [[golden ratio]].&lt;br /&gt;
&lt;br /&gt;
These events are physical bioattractors of aging from the perspective of Fibonacci mathematical modeling and dynamically systems theory. In practical terms, prediction in human development becomes possible in the same statistical sense in which the average temperature or precipitation at different times of the year can be used for weather forecasting. Each of the predetermined stages of human development follows an optimal epigenetic biological pattern. This phenomenon can be explained by the occurrence of Fibonacci numbers in biological DNA and self-organizing properties of the Fibonacci numbers that converge on the golden ratio.&lt;br /&gt;
&lt;br /&gt;
从斐波那契数学模型和动力系统理论的角度来看，上述事件是衰老的'''物理生物吸引子Physical Bioattractors'''。实际上，正如一年中不同时间的平均气温和降水量可以用来预测天气，预测人类的发展在统计意义上同样是可能的。人类发展的每个'''预定阶段Predetermined Stages'''都遵循最佳的'''表观遗传生物模式 Epigenetic Biological Pattern'''。这种现象可以用 DNA 中的斐波那契数和收敛于黄金分割比的斐波那契数的自组织特性来解释。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== In biomechanics 在运动生物力学中的应用===&lt;br /&gt;
&lt;br /&gt;
In [[sports biomechanics]], dynamical systems theory has emerged in the movement sciences as a viable framework for modeling athletic performance. From a dynamical systems perspective, the human movement system is a highly intricate network of co-dependent sub-systems (e.g. respiratory, circulatory, nervous, skeletomuscular, perceptual) that are composed of a large number of interacting components (e.g. blood cells, oxygen molecules, muscle tissue, metabolic enzymes, connective tissue and bone). In dynamical systems theory, movement patterns emerge through generic processes of self-organization found in physical and biological systems.&amp;lt;ref&amp;gt;Paul S Glazier, Keith Davids, Roger M Bartlett (2003). [http://www.sportsci.org/jour/03/psg.htm &amp;quot;DYNAMICAL SYSTEMS THEORY: a Relevant Framework for Performance-Oriented Sports Biomechanics Research&amp;quot;]. in: Sportscience 7. Accessed 2008-05-08.&amp;lt;/ref&amp;gt; There is no research validation of any of the claims associated to the conceptual application of this framework.&lt;br /&gt;
&lt;br /&gt;
In sports biomechanics, dynamical systems theory has emerged in the movement sciences as a viable framework for modeling athletic performance. From a dynamical systems perspective, the human movement system is a highly intricate network of co-dependent sub-systems (e.g. respiratory, circulatory, nervous, skeletomuscular, perceptual) that are composed of a large number of interacting components (e.g. blood cells, oxygen molecules, muscle tissue, metabolic enzymes, connective tissue and bone). In dynamical systems theory, movement patterns emerge through generic processes of self-organization found in physical and biological systems. There is no research validation of any of the claims associated to the conceptual application of this framework.&lt;br /&gt;
&lt;br /&gt;
在运动生物力学中，动力系统理论新兴地成为对运动表现建模的可行框架。从动力系统的角度来看，人类的运动系统是由高度复杂和相互依赖的子系统网络（如呼吸、循环、神经、骨骼肌系统和知觉系统等）组成的，它们由大量相互作用的部分组成（包括血细胞、氧分子、肌肉组织、代谢酶、结缔组织和骨骼等)。动力系统理论中，运动模式通过物理系统和生物系统中的一般自组织过程出现。没有任何研究证实与这一框架的概念相关的任何主张。&lt;br /&gt;
&lt;br /&gt;
=== In cognitive science 在认知科学中的应用===&lt;br /&gt;
&lt;br /&gt;
Dynamical system theory has been applied in the field of [[neurodynamics|neuroscience]] and [[cognitive science|cognitive development]], especially in [[the neo-Piagetian theories of cognitive development]]. It is the belief that cognitive development is best represented by physical theories rather than theories based on syntax and [[AI]]. It also believed that differential equations are the most appropriate tool for modeling human behavior. These equations are interpreted to represent an agent's cognitive trajectory through [[state space]]. In other words, dynamicists argue that [[psychology]] should be (or is) the description (via differential equations) of the cognitions and behaviors of an agent under certain environmental and internal pressures. The language of chaos theory is also frequently adopted.&lt;br /&gt;
&lt;br /&gt;
Dynamical system theory has been applied in the field of neuroscience and cognitive development, especially in the neo-Piagetian theories of cognitive development. It is the belief that cognitive development is best represented by physical theories rather than theories based on syntax and AI. It also believed that differential equations are the most appropriate tool for modeling human behavior. These equations are interpreted to represent an agent's cognitive trajectory through state space. In other words, dynamicists argue that psychology should be (or is) the description (via differential equations) of the cognitions and behaviors of an agent under certain environmental and internal pressures. The language of chaos theory is also frequently adopted.&lt;br /&gt;
&lt;br /&gt;
动力系统理论已经被应用于神经科学和认知发展领域，特别是在认知发展的'''新皮亚杰学派 neo-Piagetian'''中。人们相信，物理学理论比句法学理论和人工智能理论更能代表认知发展。人们还相信微分方程是人类行为建模最合适的工具。人们认为微分方程可以解释为通过状态空间代表一个主体的认知轨迹的算式。换句话说，动力学家认为心理学应该(或者是)(通过微分方程)描述在一定的环境和内部压力下的主体的认知和行为的学科。混沌理论在相关领域也经常被采用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In it, the learner's mind reaches a state of disequilibrium where old patterns have broken down. This is the phase transition of cognitive development. [[Self-organization]] (the spontaneous creation of coherent forms) sets in as activity levels link to each other. Newly formed macroscopic and microscopic structures support each other, speeding up the process. These links form the structure of a new state of order in the mind through a process called ''scalloping'' (the repeated building up and collapsing of complex performance.) This new, novel state is progressive, discrete, idiosyncratic and unpredictable.&amp;lt;ref&amp;gt;{{cite journal|title=The Promise of Dynamic Systems Approaches for an Integrated Account of Human Development|journal=Child Development|date=2000-02-25|first=Mark D.|last=Lewis|volume=71|issue=1|pages=36–43|id= |url=http://home.oise.utoronto.ca/~mlewis/Manuscripts/Promise.pdf|accessdate=2008-04-04|doi=10.1111/1467-8624.00116|pmid=10836556 |citeseerx=10.1.1.72.3668}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In it, the learner's mind reaches a state of disequilibrium where old patterns have broken down. This is the phase transition of cognitive development. Self-organization (the spontaneous creation of coherent forms) sets in as activity levels link to each other. Newly formed macroscopic and microscopic structures support each other, speeding up the process. These links form the structure of a new state of order in the mind through a process called scalloping (the repeated building up and collapsing of complex performance.) This new, novel state is progressive, discrete, idiosyncratic and unpredictable.&lt;br /&gt;
&lt;br /&gt;
在学习的过程中，旧的模式被打破了，学习者的思维达到了一种不平衡的状态。这是认知发展的阶段性转变。自组织(连贯的自发创造(the spontaneous creation of coherent forms))在'''活动水平 Activity Levels'''相互联系时产生。新形成的宏观和微观结构相互支持，加速了这一过程。这些联系在头脑中形成了一种具有新状态的结构，这个过程被称为“扇贝化 Scalloping”，也就是头脑的复杂性能的不断累积和崩溃的过程 --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|扇贝化的翻译拿不准，这句话的描述比较抽象]]）。这种新的状态是渐进的、离散的、异质的的和不可预知的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Dynamic systems theory has recently been used to explain a long-unanswered problem in child development referred to as the [[A-not-B error]].&amp;lt;ref&amp;gt;{{cite journal|title=Development as a dynamic system|journal=Trends in Cognitive Sciences|date=2003-07-30|first=Linda B.|last=Smith|author2=Esther Thelen|volume=7|issue=8|pages=343–8|id= |url=http://www.indiana.edu/~cogdev/labwork/dynamicsystem.pdf|accessdate=2008-04-04|doi=10.1016/S1364-6613(03)00156-6|pmid=12907229|citeseerx=10.1.1.294.2037}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Dynamic systems theory has recently been used to explain a long-unanswered problem in child development referred to as the A-not-B error.&lt;br /&gt;
&lt;br /&gt;
动力系统理论最近还被用来解释儿童发展中一个长期没有答案的问题，即 A-not-B 错误。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===In second language development 在二语习得中的应用===&lt;br /&gt;
&lt;br /&gt;
{{Main|Dynamic approach to second language development}}&lt;br /&gt;
&lt;br /&gt;
The application of Dynamic Systems Theory to study [[second language acquisition]] is attributed to [[Diane Larsen-Freeman]] who published an article in 1997 in which she claimed that [[second language acquisition]] should be viewed as a developmental process which includes [[language attrition]] as well as language acquisition.&amp;lt;ref&amp;gt;{{cite web|url=https://academic.oup.com/applij/article-abstract/18/2/141/134192|title=Chaos/Complexity Science and Second Language Acquisition|date=1997|publisher=Applied Linguistics}}&amp;lt;/ref&amp;gt; In her article she claimed that language should be viewed as a dynamic system which is dynamic, complex, nonlinear, chaotic, unpredictable, sensitive to initial conditions, open, self-organizing, feedback sensitive, and adaptive.&lt;br /&gt;
&lt;br /&gt;
The application of Dynamic Systems Theory to study second language acquisition is attributed to Diane Larsen-Freeman who published an article in 1997 in which she claimed that second language acquisition should be viewed as a developmental process which includes language attrition as well as language acquisition. In her article she claimed that language should be viewed as a dynamic system which is dynamic, complex, nonlinear, chaotic, unpredictable, sensitive to initial conditions, open, self-organizing, feedback sensitive, and adaptive.&lt;br /&gt;
&lt;br /&gt;
动力系统理论在二语习得研究中的应用归功于 Diane Larsen-Freeman，她在1997年发表的一篇文章中认为，二语习得应该被看作是一个包括语言流失和习得在内的发展过程。她在文章中认为，语言应该被看作是一个动态的、复杂的、非线性的、混沌的、不可预知的、对初始条件敏感的、开放的、自组织的、反馈敏感的和适应性的动力系统。&lt;br /&gt;
&lt;br /&gt;
== See also 参见==&lt;br /&gt;
&lt;br /&gt;
;Related subjects&lt;br /&gt;
&lt;br /&gt;
Related subjects&lt;br /&gt;
&lt;br /&gt;
相关科目&lt;br /&gt;
&lt;br /&gt;
{{div col|colwidth=20em}}&lt;br /&gt;
&lt;br /&gt;
* [[List of dynamical system topics]] 动力系统主题清单&lt;br /&gt;
&lt;br /&gt;
* [[Baker's map]]&lt;br /&gt;
&lt;br /&gt;
* [[Biological applications of bifurcation theory]] 分支理论的生物学应用&lt;br /&gt;
&lt;br /&gt;
* [[Dynamical system (definition)]] 动力系统（定义）&lt;br /&gt;
&lt;br /&gt;
* [[Embodied Embedded Cognition]] 具身认知&lt;br /&gt;
&lt;br /&gt;
* [[Fibonacci numbers]] 斐波那契数&lt;br /&gt;
&lt;br /&gt;
* [[Fractals]] 分形&lt;br /&gt;
&lt;br /&gt;
* [[Gingerbreadman map]]&lt;br /&gt;
&lt;br /&gt;
* [[Halo orbit]] Halo 轨道&lt;br /&gt;
&lt;br /&gt;
* [[List of types of systems theory]] 动力系统类型清单&lt;br /&gt;
&lt;br /&gt;
* [[Oscillation]] 振动性&lt;br /&gt;
&lt;br /&gt;
* [[Postcognitivism]]&lt;br /&gt;
&lt;br /&gt;
* [[Recurrent neural network]] 递归神经网络&lt;br /&gt;
&lt;br /&gt;
* [[Combinatorics and dynamical systems]] 组合数学和动力系统&lt;br /&gt;
&lt;br /&gt;
* [[Synergetics (Haken)|Synergetics]] 协同学(Haken)&lt;br /&gt;
&lt;br /&gt;
* [[Systemography]]&lt;br /&gt;
&lt;br /&gt;
{{div col end}}&lt;br /&gt;
&lt;br /&gt;
;Related scientists&lt;br /&gt;
&lt;br /&gt;
Related scientists&lt;br /&gt;
&lt;br /&gt;
相关科学家&lt;br /&gt;
&lt;br /&gt;
{{div col|colwidth=20em}}&lt;br /&gt;
&lt;br /&gt;
* [[People in systems and control]]&lt;br /&gt;
&lt;br /&gt;
* [[Dmitri Anosov]]&lt;br /&gt;
&lt;br /&gt;
* [[Vladimir Arnold]]&lt;br /&gt;
&lt;br /&gt;
* [[Nikolay Bogolyubov]]&lt;br /&gt;
&lt;br /&gt;
* [[Andrey Kolmogorov]]&lt;br /&gt;
&lt;br /&gt;
* [[Nikolay Mitrofanovich Krylov|Nikolay Krylov]]&lt;br /&gt;
&lt;br /&gt;
* [[Jürgen Moser]]&lt;br /&gt;
&lt;br /&gt;
* [[Yakov G. Sinai]]&lt;br /&gt;
&lt;br /&gt;
* [[Stephen Smale]]&lt;br /&gt;
&lt;br /&gt;
* [[Hillel Furstenberg]]&lt;br /&gt;
&lt;br /&gt;
* [[Grigory Margulis]]&lt;br /&gt;
&lt;br /&gt;
* [[Elon Lindenstrauss]]&lt;br /&gt;
&lt;br /&gt;
{{div col end}}&lt;br /&gt;
&lt;br /&gt;
== Notes 参考资料==&lt;br /&gt;
&lt;br /&gt;
{{reflist}}&lt;br /&gt;
&lt;br /&gt;
== Further reading 拓展阅读==&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Frederick D. |last1=Abraham |first2=Ralph |last2=Abraham |authorlink2=Ralph Abraham (mathematician)|first3=Christopher D. |last3=Shaw |title=A Visual Introduction to Dynamical Systems Theory for Psychology |url=https://books.google.com/books?id=oMbaAAAAMAAJ |year=1990 |publisher=Aerial Press |isbn=978-0-942344-09-7 |oclc=24345312}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=Edward J. |last=Beltrami |title=Mathematics for Dynamic Modeling |url=https://books.google.com/books?id=MmoiJPsuFW8C |year=1998 |publisher=Academic Press |isbn=978-0-12-085566-7 |edition=2nd |oclc=36713294}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=Otomar |last=Hájek |title=Dynamical systems in the plane |url=https://books.google.com/books?id=czhPAQAAIAAJ |year=1968 |publisher=Academic Press |oclc=343328 |authorlink=Otomar Hájek |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=David G. |last=Luenberger |title=Introduction to dynamic systems: theory, models, and applications |url=https://books.google.com/books?id=mvlQAAAAMAAJ |year=1979 |publisher=Wiley |isbn=978-0-471-02594-8 |oclc=4195122 |authorlink=David Luenberger |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Anthony |last1=Michel |author2=Kaining Wang |author3=Bo Hu |title=Qualitative Theory of Dynamical Systems |url=https://books.google.com/books?id=ZPGBnZGV2_cC |year=2001 |publisher=Taylor &amp;amp; Francis |isbn=978-0-8247-0526-8 |oclc=45873628}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Louis |last1=Padulo |first2=Michael A. |last2=Arbib |authorlink2=Michael A. Arbib |title=System theory: a unified state-space approach to continuous and discrete systems |url=https://books.google.com/books?id=6UPvAAAAMAAJ |year=1974 |publisher=Saunders |isbn=9780721670355 |oclc=947600 |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |first=Steven H. |last=Strogatz |title=Nonlinear Dynamics and Chaos: With Applications to Physics, Biology, Chemistry, and Engineering |year=1994 |publisher=Addison Wesley |isbn=978-0-7382-0453-6 |oclc=49839504 |authorlink=Steven Strogatz |ref=harv |url-access=registration |url=https://archive.org/details/nonlineardynamic00stro }}&lt;br /&gt;
&lt;br /&gt;
== External links 外部链接==&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20080613053119/http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html Dynamic Systems 动力系统] Encyclopedia of Cognitive Science entry. --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|这是一个嵌套的链接，但好像只能鼠标点击并超链接到内嵌的那个]]）认知科学百科全书&lt;br /&gt;
&lt;br /&gt;
*[http://mathworld.wolfram.com/DynamicalSystem.html Definition of dynamical system 动力系统的定义] in MathWorld. 在MathWorld.wolfram.com储存的定义&lt;br /&gt;
&lt;br /&gt;
*[http://www.dynamicalsystems.org/ DSWeb] Dynamical Systems Magazine 动力系统杂志&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Areas of mathematics | state=collapsed}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:Dynamical systems]]&lt;br /&gt;
&lt;br /&gt;
Category:Dynamical systems&lt;br /&gt;
&lt;br /&gt;
类别: 动力系统&lt;br /&gt;
&lt;br /&gt;
[[Category:Complex systems theory]]&lt;br /&gt;
&lt;br /&gt;
Category:Complex systems theory&lt;br /&gt;
&lt;br /&gt;
范畴: 复杂系统理论&lt;br /&gt;
&lt;br /&gt;
[[Category:Computational fields of study]]&lt;br /&gt;
&lt;br /&gt;
Category:Computational fields of study&lt;br /&gt;
&lt;br /&gt;
类别: 研究的计算领域&lt;br /&gt;
&lt;br /&gt;
&amp;lt;noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;small&amp;gt;This page was moved from [[wikipedia:en:Dynamical systems theory]]. Its edit history can be viewed at [[动力系统/edithistory]]&amp;lt;/small&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:待整理页面]]&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
===书籍推荐===&lt;br /&gt;
====[https://www.amazon.co.uk/Chaos-Making-Science-James-Gleick/dp/0749386061 Chaos: Making a New Science]====&lt;br /&gt;
The million-copy bestseller by National Book Award nominee and Pulitzer Prize finalist James Gleick—the author of Time Travel: A History—that reveals the science behind chaos theory。&lt;br /&gt;
Very readable, focuses on the scientists and mathematicians behind many of the key results in chaos.&lt;br /&gt;
本书由普利茨奖获得者James Gleick撰写。它是一本易读科普书籍，侧重介绍对混沌概念的发展做出重大贡献的科学家和数学家们。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://www.amazon.com/dp/0199566445/ref=cm_sw_su_dp Chaos and Fractals: An Elementary Introduction]====&lt;br /&gt;
This book provides the reader with an elementary introduction to chaos and fractals, suitable for students with a background in elementary algebra, without assuming prior coursework in calculus or physics. &lt;br /&gt;
这是一本关于混沌和分形的入门书籍。读者需要有一定的线性代数基础，但是不需要有微积分或物理学的基础。&lt;br /&gt;
&lt;br /&gt;
====[https://www.amazon.co.uk/Chaos-Very-Short-Introduction-Introductions/dp/0192853783/ref=pd_lpo_14_img_1/257-2017232-0516612?_encoding=UTF8&amp;amp;pd_rd_i=0192853783&amp;amp;pd_rd_r=eebee69a-fad3-43e3-bbeb-b883f2c59bf5&amp;amp;pd_rd_w=g6knH&amp;amp;pd_rd_wg=sx6z5&amp;amp;pf_rd_p=7b8e3b03-1439-4489-abd4-4a138cf4eca6&amp;amp;pf_rd_r=YTB0XXCR2DM8049PYP1Y&amp;amp;psc=1&amp;amp;refRID=YTB0XXCR2DM8049PYP1Y 牛津通识读本: Chaos]====&lt;br /&gt;
This book would not have been possible without my parents, of course, but I owe a greater debt than most to their faith, doubt, and hope, and to the love and patience of a, b, and c. Professionally my greatest debt is to Ed Spiegel, a father of chaos and my thesis Professor, mentor, and friend.&lt;br /&gt;
本书隶属于牛津通识读本系列。该书由Ed Spiegel的学生Leonard Smith撰写，语言生动简明。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
===集智课程推荐===&lt;br /&gt;
====[https://campus.swarma.org/course/1655 圣塔菲课程：Introduction to Dynamical Systems and Chaos]====&lt;br /&gt;
本课程中，主要介绍动力学系统和混沌系统，您将学到'''蝴蝶效应 Butterfly effect'''、'''奇异吸引子 Attractors'''等基本概念，以及如何应用于您感兴趣的领域。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://campus.swarma.org/course/1641 动力系统分析]====&lt;br /&gt;
本课程主要讲授连续和离散动力系统的定态、极限环及其稳定性分析、动力学系统的结构稳定性和常见的分支类型以及分析方法，混沌概念等。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E5%8A%A8%E5%8A%9B%E7%B3%BB%E7%BB%9F%E7%90%86%E8%AE%BA_Dynamical_Systems_Theory&amp;diff=10188</id>
		<title>动力系统理论 Dynamical Systems Theory</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E5%8A%A8%E5%8A%9B%E7%B3%BB%E7%BB%9F%E7%90%86%E8%AE%BA_Dynamical_Systems_Theory&amp;diff=10188"/>
		<updated>2020-07-11T16:34:24Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。&lt;br /&gt;
&lt;br /&gt;
{{Use dmy dates|date=May 2019|cs1-dates=y}}&lt;br /&gt;
&lt;br /&gt;
'''Dynamical systems theory''' is an area of [[mathematics]] used to describe the behavior of the  [[complex systems|complex]] [[dynamical system]]s, usually by employing [[differential equations]] or [[difference equations]]. When differential equations are employed, the theory is called [[continuous time|''continuous dynamical systems'']]. From a physical point of view, continuous dynamical systems is a generalization of [[classical mechanics]], a generalization where the [[equations of motion]] are postulated directly and are not constrained to be [[Euler–Lagrange equation]]s of a [[Principle of least action|least action principle]]. When difference equations are employed, the theory is called [[discrete time|''discrete dynamical systems'']]. When the time variable runs over a set that is discrete over some intervals and continuous over other intervals or is any arbitrary time-set such as a [[cantor set]], one gets [[dynamic equations on time scales]]. Some situations may also be modeled by mixed operators, such as [[differential-difference equations]].&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory is an area of mathematics used to describe the behavior of the  complex dynamical systems, usually by employing differential equations or difference equations. When differential equations are employed, the theory is called continuous dynamical systems. From a physical point of view, continuous dynamical systems is a generalization of classical mechanics, a generalization where the equations of motion are postulated directly and are not constrained to be Euler–Lagrange equations of a least action principle. When difference equations are employed, the theory is called discrete dynamical systems. When the time variable runs over a set that is discrete over some intervals and continuous over other intervals or is any arbitrary time-set such as a cantor set, one gets dynamic equations on time scales. Some situations may also be modeled by mixed operators, such as differential-difference equations.&lt;br /&gt;
&lt;br /&gt;
  &lt;br /&gt;
'''动力系统理论 Dynamical Systems Theory'''是一个用来描述复杂动力系统行为的数学领域，通常使用微分方程或差分方程。当采用微分方程时，该理论被称为连续动力系统。从物理学的角度来看，连续动力系统是经典力学的推广，也是运动方程的推广，不受极小作用原理Euler–Lagrange方程的约束。当采用差分方程时，该理论被称为离散动力系统。&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;当时间变量在一个离散的集合上运行，在另一个离散的集合上连续，或者像cantor集一样在任意的时间集合上运行时，人们就能得到时间尺度上的动力方程。&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 当时间变量运行在一个某些区间离散、其他区间连续的集合、或者像cantor集一样任意的时间集合上时，人们就能得到时间尺度上的动力方程。&amp;lt;/font&amp;gt;&lt;br /&gt;
&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;'''算子 Operators'''是一个函数空间到函数空间上的映射O：X→X，广义的讲，对任何函数进行某一项操作都可以认为是一个算子，如求幂次、求微分等。&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;这句话的英文原文在哪里？&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;动力系统的有些情况也可以用'''混合算子 Mixed Operators'''来建模，如微分-差分方程。&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 某些情况下，也可以用'''混合算子 Mixed Operators'''来建模，如微分-差分方程。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This theory deals with the long-term qualitative behavior of dynamical systems, and studies the nature of, and when possible the solutions of, the [[equations of motion]] of systems that are often primarily [[mechanics|mechanical]] or otherwise physical in nature, such as [[planetary orbit]]s and the behaviour of [[electronic circuit]]s, as well as systems that arise in [[biology]], [[economics]], and elsewhere. Much of modern research is focused on the study of [[chaotic system]]s.&lt;br /&gt;
&lt;br /&gt;
This theory deals with the long-term qualitative behavior of dynamical systems, and studies the nature of, and when possible the solutions of, the equations of motion of systems that are often primarily mechanical or otherwise physical in nature, such as planetary orbits and the behaviour of electronic circuits, as well as systems that arise in biology, economics, and elsewhere. Much of modern research is focused on the study of chaotic systems.&lt;br /&gt;
&lt;br /&gt;
这个理论处理动力系统的&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;长期定性行为。如果能够得到解的话，还可以研究系统的运动方程。这些方程通常运用到机械或物理研究领域，如行星轨道和电子电路，以及出现在生物学，经济学和其他地方的系统。&amp;lt;/font&amp;gt;现代的研究大多集中在对混沌系统的研究上。&lt;br /&gt;
&lt;br /&gt;
&amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;这个理论处理动力系统的长周期性的行为，并且研究系统的动力方程的规律，努力求得可能的解。这些系统通常是一些自然领域里的机械系统或其他物理系统，例如行星轨道和电子电路，也包括一些生物学、经济学和其他学科里的系统。现代的研究大多集中在对混沌系统的研究上。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This field of study is also called just ''dynamical systems'', ''mathematical dynamical systems theory'' or the ''mathematical theory of dynamical systems''.&lt;br /&gt;
&lt;br /&gt;
This field of study is also called just dynamical systems, mathematical dynamical systems theory or the mathematical theory of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
这个研究领域也被称为动力系统，数学动力系统理论或动力系统的数学理论。&lt;br /&gt;
&lt;br /&gt;
[[Image:Lorenz attractor yb.svg|thumb|240px|right|The [[Lorenz attractor]] is an example of a [[non-linear]] dynamical system. Studying this system helped give rise to [[chaos theory]].]]&lt;br /&gt;
&lt;br /&gt;
The [[Lorenz attractor is an example of a non-linear dynamical system. Studying this system helped give rise to chaos theory.]]&lt;br /&gt;
&lt;br /&gt;
'''洛伦兹吸引子 Lorenz Attractor'''是非线性动力系统的一个例子。对这个系统的研究产生了混沌理论。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Overview 综述 ==&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory and [[chaos theory]] deal with the long-term qualitative behavior of [[dynamical system]]s. Here, the focus is not on finding precise solutions to the equations defining the dynamical system (which is often hopeless), but rather to answer questions like &amp;quot;Will the system settle down to a steady state in the long term, and if so, what are the possible steady states?&amp;quot;, or &amp;quot;Does the long-term behavior of the system depend on its initial condition?&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory and chaos theory deal with the long-term qualitative behavior of dynamical systems. Here, the focus is not on finding precise solutions to the equations defining the dynamical system (which is often hopeless), but rather to answer questions like &amp;quot;Will the system settle down to a steady state in the long term, and if so, what are the possible steady states?&amp;quot;, or &amp;quot;Does the long-term behavior of the system depend on its initial condition?&amp;quot;&lt;br /&gt;
&lt;br /&gt;
动力系统理论和'''混沌理论 Chaos Theory'''是用来处理动力系统的&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;长期定性行为&amp;lt;/font&amp;gt;&amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 长周期性行为&amp;lt;/font&amp;gt;的理论。寻找动力系统方程的精确解通常是很难达到的。&amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 因此，&amp;lt;/font&amp;gt;这两个理论的重点不在于找到精确解，而是回答如下的问题，如“系统长期来看是否会稳定下来，如果可以，那么可能的稳定状态是什么样的?”，或“系统长期的行为是否取决于其初始条件?”&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
An important goal is to describe the fixed points, or steady states of a given dynamical system; these are values of the variable that don't change over time. Some of these fixed points are ''attractive'', meaning that if the system starts out in a nearby state, it converges towards the fixed point.&lt;br /&gt;
&lt;br /&gt;
An important goal is to describe the fixed points, or steady states of a given dynamical system; these are values of the variable that don't change over time. Some of these fixed points are attractive, meaning that if the system starts out in a nearby state, it converges towards the fixed point.&lt;br /&gt;
&lt;br /&gt;
描述给定动力系统的不动点或'''&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;定态&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;稳态&amp;lt;/font&amp;gt;Steady States'''是一个重要的目标。不动点或&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;定态&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;稳态&amp;lt;/font&amp;gt;的变量值不会随时间的变化而变化。&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;一些不动点是有吸引力的（attractive），即如果系统的初始值在它的附近，系统最终会收敛到这个不动点。&amp;lt;/font&amp;gt;&amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 某些不动点被称为“吸引子”，意味着如果系统即使不在它附近的状态开始，最终也会收敛到这些不动点。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Similarly, one is interested in ''periodic points'', states of the system that repeat after several timesteps. Periodic points can also be attractive. [[Sharkovskii's theorem]] is an interesting statement about the number of periodic points of a one-dimensional discrete dynamical system.&lt;br /&gt;
&lt;br /&gt;
Similarly, one is interested in periodic points, states of the system that repeat after several timesteps. Periodic points can also be attractive. Sharkovskii's theorem is an interesting statement about the number of periodic points of a one-dimensional discrete dynamical system.&lt;br /&gt;
&lt;br /&gt;
人们还对动力系统的'''周期点 Periodic Points'''感兴趣，即系统在几个时间步之后会不断重复的状态。周期点也可以是有吸引力的。Sharkovskii定理描述了一维离散动力系统的周期点的个数。&lt;br /&gt;
&amp;lt;font color='blue'&amp;gt;类似地，另一个研究兴趣是'''周期点 Periodic Points'''，即系统在重复几个时间步之后的状态。周期点也可以是吸引子。Sharkovskii定理描述了一维离散动力系统的周期点的个数。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Even simple [[nonlinear dynamical system]]s often exhibit seemingly random behavior that has been called ''chaos''.&amp;lt;ref&amp;gt;{{cite journal |last=Grebogi |first=C. |last2=Ott |first2=E. |last3=Yorke |first3=J. |year=1987 |title=Chaos, Strange Attractors, and Fractal Basin Boundaries in Nonlinear Dynamics |journal=[[Science (journal)|Science]] |volume=238 |issue=4827 |pages=632–638 |jstor=1700479 |doi=10.1126/science.238.4827.632 |pmid=17816542 |bibcode=1987Sci...238..632G }}&amp;lt;/ref&amp;gt; The branch of dynamical systems that deals with the clean definition and investigation of chaos is called ''[[chaos theory]]''.&lt;br /&gt;
&lt;br /&gt;
Even simple nonlinear dynamical systems often exhibit seemingly random behavior that has been called chaos. The branch of dynamical systems that deals with the clean definition and investigation of chaos is called chaos theory.&lt;br /&gt;
&lt;br /&gt;
即使是简单的非线性动力系统也常常表现出看似随机的行为，这种行为被称为混沌。混沌理论主要研究混沌的清晰定义和混沌的现象，它是动力系统理论的一个分支。&lt;br /&gt;
&lt;br /&gt;
== History 历史==&lt;br /&gt;
&lt;br /&gt;
The concept of dynamical systems theory has its origins in [[Newtonian mechanics]]. There, as in other natural sciences and engineering disciplines, the evolution rule of dynamical systems is given implicitly by a relation that gives the state of the system only a short time into the future.&lt;br /&gt;
&lt;br /&gt;
The concept of dynamical systems theory has its origins in Newtonian mechanics. There, as in other natural sciences and engineering disciplines, the evolution rule of dynamical systems is given implicitly by a relation that gives the state of the system only a short time into the future.&lt;br /&gt;
&lt;br /&gt;
动态系统理论的概念起源于牛顿运动定律。与其他自然科学和工程学科一样，动力系统的演化规律也是通过一种预测系统在未来很短时间内的状态的关系隐含地给出的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Before the advent of [[computer|fast computing machines]], solving a dynamical system required sophisticated mathematical techniques and could only be accomplished for a small class of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
Before the advent of fast computing machines, solving a dynamical system required sophisticated mathematical techniques and could only be accomplished for a small class of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
在高速计算机器出现之前，解决动力系统问题需要复杂的数学技能，而且还只能解决一小类动力系统问题。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Some excellent presentations of mathematical dynamic system theory include {{harvtxt|Beltrami|1990}}, {{harvtxt|Luenberger|1979}}, {{harvtxt|Padulo|Arbib|1974}}, and {{harvtxt|Strogatz|1994}}.&amp;lt;ref&amp;gt;Jerome R. Busemeyer (2008), [http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html &amp;quot;Dynamic Systems&amp;quot;]. To Appear in: ''Encyclopedia of cognitive science'', Macmillan. Retrieved 8 May 2008.  {{webarchive |url=https://web.archive.org/web/20080613053119/http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html |date=June 13, 2008 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Some excellent presentations of mathematical dynamic system theory include , , , and . To Appear in: ''Encyclopedia of cognitive science'', Macmillan. Retrieved 8 May 2008&lt;br /&gt;
&lt;br /&gt;
优秀的数学动力系统理论包括，，，和。--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|存疑]]）。&lt;br /&gt;
&lt;br /&gt;
&amp;lt;font color='blue'&amp;gt;原文是：Some excellent presentations of mathematical dynamic system theory include Beltrami (1990), Luenberger (1979), Padulo &amp;amp; Arbib (1974), and Strogatz (1994).[2] 是不是在粘贴或解析时内容有丢失？&lt;br /&gt;
&lt;br /&gt;
一些优秀的数学动力系统理论包括贝尔特拉米（Beltrami，1990年），龙伯格(Luenberger，1979年），帕杜罗&amp;amp;阿尔比布（Padulo＆Arbib，1974年）和斯托加茨（Strogatz，1994年）。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Concepts 概念==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Dynamical systems 动力系统===&lt;br /&gt;
&lt;br /&gt;
{{main|Dynamical system (definition)}}&lt;br /&gt;
&lt;br /&gt;
The [[dynamical system]] concept is a mathematical [[formal system|formalization]] for any fixed &amp;quot;rule&amp;quot; that describes the [[time]] dependence of a point's position in its [[ambient space]].  Examples include the [[mathematical model]]s that describe the swinging of a clock pendulum, the flow of water in a pipe, and the number of fish each spring in a lake.&lt;br /&gt;
&lt;br /&gt;
The dynamical system concept is a mathematical formalization for any fixed &amp;quot;rule&amp;quot; that describes the time dependence of a point's position in its ambient space.  Examples include the mathematical models that describe the swinging of a clock pendulum, the flow of water in a pipe, and the number of fish each spring in a lake.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;动力系统是一个对任何描述了点的位置在周围环境随时间变化的“固定”规则的数学式。&amp;lt;/font&amp;gt;&amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;动力系统概念是对描述了一个点的位置在其周围环境中随时间变化的任何“固定”规则的数学形式化。&amp;lt;/font&amp;gt;举例来说，描述钟摆摆动、管道中的水流以及每年春天湖中鱼的数量的数学模型，都属于动力系统的概念范畴。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A dynamical system has a ''state'' determined by a collection of [[real numbers]], or more generally by a [[Set (mathematics)|set]] of [[Point (geometry)|points]] in an appropriate ''state space''.  Small changes in the state of the system correspond to small changes in the numbers.  The numbers are also the coordinates of a geometrical space—a [[manifold]].   The ''evolution rule'' of the dynamical system is a [[function (mathematics)|fixed rule]] that describes what future states follow from the current state.  The rule may be [[Deterministic system (mathematics)|deterministic]] (for a given time interval only one future state follows from the current state) or [[stochastic differential equation|stochastic]] (the evolution of the state is subject to random shocks).&lt;br /&gt;
&lt;br /&gt;
A dynamical system has a state determined by a collection of real numbers, or more generally by a set of points in an appropriate state space.  Small changes in the state of the system correspond to small changes in the numbers.  The numbers are also the coordinates of a geometrical space—a manifold.   The evolution rule of the dynamical system is a fixed rule that describes what future states follow from the current state.  The rule may be deterministic (for a given time interval only one future state follows from the current state) or stochastic (the evolution of the state is subject to random shocks).&lt;br /&gt;
&lt;br /&gt;
动力系统的状态是由一组实数决定的，更广泛地说，是由适当的状态空间中的一组点决定的。系统状态的微小变化对应于数字的变化。这些数字也是几何空间——'''流形 Manifold'''——的坐标组。&amp;lt;font color='red'&amp;gt;动力系统的演化是描述了在当前状态之后出现的未来状态的固定规则。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;动力系统的演化规律是一种固定的规则，它描述了从当前状态得出的未来状态。&amp;lt;/font&amp;gt;这个规则可以是确定性的(在给定的时间间隔内，有且仅有一个未来状态在当前状态之后出现)，或随机性的(状态的演化受到随机因素的影响)。&lt;br /&gt;
&lt;br /&gt;
=== Dynamicism 动态主义===&lt;br /&gt;
&lt;br /&gt;
[[Dynamicism]], also termed the ''dynamic hypothesis'' or the ''dynamic hypothesis in cognitive science'' or ''dynamic cognition'', is a new approach in [[cognitive science]] exemplified by the work of philosopher [[Tim van Gelder]]. It argues that [[differential equations]] are more suited to modelling [[cognition]] than more traditional [[computer]] models.&lt;br /&gt;
&lt;br /&gt;
Dynamicism, also termed the dynamic hypothesis or the dynamic hypothesis in cognitive science or dynamic cognition, is a new approach in cognitive science exemplified by the work of philosopher Tim van Gelder. It argues that differential equations are more suited to modelling cognition than more traditional computer models.&lt;br /&gt;
&lt;br /&gt;
'''动态主义 Dynamicism'''，也称动态假设，&amp;lt;font color='red'&amp;gt;或称认知科学、动态认知中的动态假设，&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;或称认知科学的动态假设或动态认知，&amp;lt;/font&amp;gt;是以哲学家Tim van Gelder的著作为代表的认知科学的一种新取向。动态主义认为微分方程比传统的计算机模型更适合于建立认知模型。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Nonlinear system 非线性系统===&lt;br /&gt;
&lt;br /&gt;
{{main|Nonlinear system}}&lt;br /&gt;
&lt;br /&gt;
In [[mathematics]], a [[nonlinear system]] is a system that is not [[linear system|linear]]—i.e., a system that does not satisfy the [[superposition principle]]. Less technically, a nonlinear system is any problem where the variable(s) to solve for cannot be written as a linear sum of independent components. A [[Homogeneity (physics)|nonhomogeneous]] system, which is linear apart from the presence of a function of the [[independent variable]]s, is nonlinear according to a strict definition, but such systems are usually studied alongside linear systems, because they can be transformed to a linear system as long as a particular solution is known.&lt;br /&gt;
&lt;br /&gt;
In mathematics, a nonlinear system is a system that is not linear—i.e., a system that does not satisfy the superposition principle. Less technically, a nonlinear system is any problem where the variable(s) to solve for cannot be written as a linear sum of independent components. A nonhomogeneous system, which is linear apart from the presence of a function of the independent variables, is nonlinear according to a strict definition, but such systems are usually studied alongside linear systems, because they can be transformed to a linear system as long as a particular solution is known.&lt;br /&gt;
&lt;br /&gt;
在数学中，'''非线性系统 Nonlinear System'''是指系统不是线性的——也就是说，一个不满足叠加原理的系统。更通俗地说，非线性系统是待求解变量不能被写成其独立分量的线性和的系统。非齐次系统根据定义严格来说是非线性的，除了它的自变量&amp;lt;font color='red'&amp;gt;&amp;lt;s&amp;gt;包含&amp;lt;/s&amp;gt;&amp;lt;/font&amp;gt;函数以外其他部分都是线性的。&amp;lt;font color='red'&amp;gt;但非齐次系统通常与线性系统一起研究，因为只要知道特解，它们就可以转化为线性系统。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;但非齐次系统通常可当做线性系统进行研究，因为只要知道特定解，它就可以转化为线性系统。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Related fields 相关领域==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Arithmetic dynamics &amp;lt;font color='red'&amp;gt;算术动态系统&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;算术动力学&amp;lt;/font&amp;gt;===&lt;br /&gt;
&lt;br /&gt;
:[[Arithmetic dynamics]] is a field that emerged in the 1990s that amalgamates two areas of mathematics, [[dynamical systems]] and [[number theory]]. Classically, discrete dynamics refers to the study of the [[Iterated function|iteration]] of self-maps of the [[complex plane]] or [[real line]]. Arithmetic dynamics is the study of the number-theoretic properties of integer, rational, {{math|&amp;lt;var&amp;gt;p&amp;lt;/var&amp;gt;}}-adic, and/or algebraic points under repeated application of a [[polynomial]] or [[rational function]].&lt;br /&gt;
&lt;br /&gt;
Arithmetic dynamics is a field that emerged in the 1990s that amalgamates two areas of mathematics, dynamical systems and number theory. Classically, discrete dynamics refers to the study of the iteration of self-maps of the complex plane or real line. Arithmetic dynamics is the study of the number-theoretic properties of integer, rational, -adic, and/or algebraic points under repeated application of a polynomial or rational function.&lt;br /&gt;
&lt;br /&gt;
'''&amp;lt;font color='red'&amp;gt;算术动态系统&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;算术动力学&amp;lt;/font&amp;gt; Arithmetic Dynamics'''是20世纪90年代出现的一个领域，融合了动力系统和数论这两个数学领域。经典的离散动力学研究复平面或&amp;lt;font color='blue'&amp;gt;实直线&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;实数轴&amp;lt;/font&amp;gt;的自映射的迭代。&amp;lt;font color='red'&amp;gt;算术动态系统研究内容是在多项式或有理函数中的整数、有理数、并元 --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|存疑]]） 和/或代数点的数论性质。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;算术动力学是在反复应用多项式或有理函数的情况下研究整数，有理数，p进数(p-adic)和/或代数点的数论性质。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Chaos theory 混沌理论===&lt;br /&gt;
&lt;br /&gt;
:[[Chaos theory]] describes the behavior of certain [[dynamical system (definition)|dynamical system]]s – that is, systems whose state evolves with time – that may exhibit dynamics that are highly sensitive to initial conditions (popularly referred to as the [[butterfly effect]]). As a result of this sensitivity, which manifests itself as an exponential growth of perturbations in the initial conditions, the behavior of chaotic systems appears [[randomness|random]]. This happens even though these systems are [[deterministic system (philosophy)|deterministic]], meaning that their future dynamics are fully defined by their initial conditions, with no random elements involved. This behavior is known as deterministic chaos, or simply ''chaos''.&lt;br /&gt;
&lt;br /&gt;
Chaos theory describes the behavior of certain dynamical systems – that is, systems whose state evolves with time – that may exhibit dynamics that are highly sensitive to initial conditions (popularly referred to as the butterfly effect). As a result of this sensitivity, which manifests itself as an exponential growth of perturbations in the initial conditions, the behavior of chaotic systems appears random. This happens even though these systems are deterministic, meaning that their future dynamics are fully defined by their initial conditions, with no random elements involved. This behavior is known as deterministic chaos, or simply chaos.&lt;br /&gt;
&lt;br /&gt;
混沌理论描述了某些状态随时间演化的动力系统的行为，这些系统可能表现出对初始条件高度敏感的特点（通常被称为'''蝴蝶效应 Butterfly Effect'''）。由于扰动受初始条件影响而指数增长，因此混沌系统具有敏感性，敏感性使它的行为看起来是随机的。但是这种敏感性也会出现在确定的动力系统中，即&amp;lt;font color='blue'&amp;gt;它们&amp;lt;/font&amp;gt;未来的动力&amp;lt;s&amp;gt;学&amp;lt;/s&amp;gt;完全由它的初始条件定义，没有任何随机因素参与的系统中。这种现象被称为确定性混沌，或简单混沌。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Complex systems 复杂系统===&lt;br /&gt;
&lt;br /&gt;
:[[Complex systems]] is a scientific field that studies the common properties of [[system]]s considered [[Complexity|complex]] in [[nature]], [[society]], and [[science]]. It is also called ''complex systems theory'', ''complexity science'', ''study of complex systems'' and/or ''sciences of complexity''. The key problems of such systems are  difficulties with their formal [[Scientific modelling|modeling]] and [[simulation]]. From such perspective, in different research contexts complex systems are defined on the base of their different attributes.&lt;br /&gt;
&lt;br /&gt;
Complex systems is a scientific field that studies the common properties of systems considered complex in nature, society, and science. It is also called complex systems theory, complexity science, study of complex systems and/or sciences of complexity. The key problems of such systems are  difficulties with their formal modeling and simulation. From such perspective, in different research contexts complex systems are defined on the base of their different attributes.&lt;br /&gt;
&lt;br /&gt;
'''复杂系统 Complex Systems'''是研究自然、社会和科学中复杂现象的共同性质的科学领域。它也被称为复杂系统理论、复杂性科学、复杂系统研究和关于复杂性的科学。这些系统的关键问题在于对系统的形式化建模与仿真&amp;lt;font color='blue'&amp;gt;的困难&amp;lt;/font&amp;gt;。因此，复杂系统是根据在不同的研究语境中的不同属性来定义的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
:The study of complex systems is bringing new vitality to many areas of science where a more typical [[reductionist]] strategy has fallen short. ''Complex systems'' is therefore often used as a broad term encompassing a research approach to problems in many diverse disciplines including [[neurosciences]], [[social sciences]], [[meteorology]], [[chemistry]], [[physics]], [[computer science]], [[psychology]], [[artificial life]], [[evolutionary computation]], [[economics]], earthquake prediction, [[molecular biology]] and inquiries into the nature of living [[cell (biology)|cell]]s themselves.&lt;br /&gt;
&lt;br /&gt;
The study of complex systems is bringing new vitality to many areas of science where a more typical reductionist strategy has fallen short. Complex systems is therefore often used as a broad term encompassing a research approach to problems in many diverse disciplines including neurosciences, social sciences, meteorology, chemistry, physics, computer science, psychology, artificial life, evolutionary computation, economics, earthquake prediction, molecular biology and inquiries into the nature of living cells themselves.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;font color='red'&amp;gt;还原论策略已经不足以研究许多科学领域的问题，而复杂系统的研究则为科学带来了广泛的新活力。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;复杂系统的研究为许多科学领域带来了新的活力，在这些领域中，更为典型的还原论策略已经不足。&amp;lt;/font&amp;gt;复杂系统通常被用作一个应用广泛的研究方法术语，并涵盖许多不同的学科，包括神经科学、社会科学、气象学、化学、物理学、计算机科学、心理学、人工生命、进化计算、经济学、地震预测、分子生物学以及对活细胞的研究等。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Control theory 控制理论===&lt;br /&gt;
&lt;br /&gt;
:[[Control theory]] is an interdisciplinary branch of [[engineering]] and [[mathematics]], in part it deals with influencing the behavior of [[dynamical system]]s.&lt;br /&gt;
&lt;br /&gt;
Control theory is an interdisciplinary branch of engineering and mathematics, in part it deals with influencing the behavior of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
'''控制理论 Control Theory'''是工程和数学的一个交叉学科，它的其中一部分研究影响动力系统行为的各种因素。&lt;br /&gt;
&lt;br /&gt;
控制理论是一个研究如何调整动态系统特性的理论，它也是工程和数学的一个交叉学科，逐渐的应用在许多社会科学中，例如心理学、社会学（社会学中的控制理论）、犯罪学及'''金融系统 Financial System'''。控制理论一般的目的是借由控制器的动作让系统稳定，也就是系统维持在设定值，而且不会在设定值附近晃动。设定值一般维持不变的控制称为调节，设定值快速变化，要求跟踪速度加速度等的控制称为伺服。它的其中一部分研究影响动力系统行为的各种因素。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Ergodic theory 遍历理论===&lt;br /&gt;
&lt;br /&gt;
:[[Ergodic theory]] is a branch of [[mathematics]] that studies [[dynamical system]]s with an [[invariant measure]] and related problems. Its initial development was motivated by problems of [[statistical physics]].&lt;br /&gt;
&lt;br /&gt;
Ergodic theory is a branch of mathematics that studies dynamical systems with an invariant measure and related problems. Its initial development was motivated by problems of statistical physics.&lt;br /&gt;
&lt;br /&gt;
'''遍历理论 Ergodic Theory'''是数学的一个分支，研究有不变测度和相关问题的动力系统。它最初的发展受到了统计物理学的推动。&lt;br /&gt;
遍历理论是研究保测变换的渐近性态的数学分支。它起源于为统计力学提供基础的&amp;quot;遍历假设&amp;quot;研究，并与动力系统理论、概率论、信息论、泛函分析、数论等数学分支有着密切的联系。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Functional analysis 泛函分析===&lt;br /&gt;
&lt;br /&gt;
:[[Functional analysis]] is the branch of [[mathematics]], and specifically of [[mathematical analysis|analysis]], concerned with the study of [[vector space]]s and [[operator (mathematics)|operator]]s acting upon them. It has its historical roots in the study of [[functional space]]s, in particular transformations of [[function (mathematics)|functions]], such as the [[Fourier transform]], as well as in the study of [[differential equations|differential]] and [[integral equations]]. This usage of the word ''[[functional (mathematics)|functional]]'' goes back to the [[calculus of variations]], implying a function whose argument is a function. Its use in general has been attributed to mathematician and physicist [[Vito Volterra]] and its founding is largely attributed to mathematician [[Stefan Banach]].&lt;br /&gt;
&lt;br /&gt;
Functional analysis is the branch of mathematics, and specifically of analysis, concerned with the study of vector spaces and operators acting upon them. It has its historical roots in the study of functional spaces, in particular transformations of functions, such as the Fourier transform, as well as in the study of differential and integral equations. This usage of the word functional goes back to the calculus of variations, implying a function whose argument is a function. Its use in general has been attributed to mathematician and physicist Vito Volterra and its founding is largely attributed to mathematician Stefan Banach.&lt;br /&gt;
&lt;br /&gt;
'''泛函分析 Functional analysis'''是数学分析的一个分支，研究向量空间和作用于向量空间的算子。它源于对函数空间的研究，特别是对函数变换的研究，例如傅里叶变换，微积分方程的研究等。泛函分析的名称“Functional Analysis”中，“functional”这个词的用法可以追溯到变分法，也就是说函数的参数是一个函数。这个词的使用一般被认为归功于数学家和物理学家Vito Volterra，和数学家Stefan Banach。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Graph dynamical systems 图动力系统===&lt;br /&gt;
&lt;br /&gt;
:The concept of [[graph dynamical system]]s (GDS) can be used to capture a wide range of processes taking place on graphs or networks. A major theme in the mathematical and computational analysis of graph dynamical systems is to relate their structural properties (e.g. the network connectivity) and the global dynamics that result.&lt;br /&gt;
&lt;br /&gt;
The concept of graph dynamical systems (GDS) can be used to capture a wide range of processes taking place on graphs or networks. A major theme in the mathematical and computational analysis of graph dynamical systems is to relate their structural properties (e.g. the network connectivity) and the global dynamics that result.&lt;br /&gt;
&lt;br /&gt;
'''图动力系统 Graph dynamical systems (GDS)'''可以用来描绘图或网络上发生的各种过程。&amp;lt;font color='red'&amp;gt;图动力系统的数学和计算分析的一个主要主题是关联它们的结构性质(例如:网络连接)和结构性质造成的网络整体的动态结果。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;图动力系统的数学和计算分析的一个主要主题是将其结构特性（例如：网络连接性）与其所产生的全局动力学联系起来。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Projected dynamical systems 投影动力系统===&lt;br /&gt;
&lt;br /&gt;
:[[Projected dynamical systems]] it is a [[mathematics|mathematical]] theory investigating the behaviour of [[dynamical system]]s where solutions are restricted to a constraint set. The discipline shares connections to and applications with both the static world of [[Optimization (mathematics)|optimization]] and [[Equilibrium point|equilibrium]] problems and the dynamical world of [[ordinary differential equations]]. A projected dynamical system is given by the [[flow (mathematics)|flow]] to the projected differential equation.&lt;br /&gt;
&lt;br /&gt;
Projected dynamical systems it is a mathematical theory investigating the behaviour of dynamical systems where solutions are restricted to a constraint set. The discipline shares connections to and applications with both the static world of optimization and equilibrium problems and the dynamical world of ordinary differential equations. A projected dynamical system is given by the flow to the projected differential equation.&lt;br /&gt;
&lt;br /&gt;
'''投影动力系统 Projected Dynamical Systems'''是研究解在一个约束集内的动力系统行为的数学理论。这门学科与静态世界中的最优化和平衡问题以及动态世界中的常微分方程都有联系&amp;lt;font color='blue'&amp;gt;和&amp;lt;s&amp;gt;，并且都有相互联系的&amp;lt;/s&amp;gt;&amp;lt;/font&amp;gt;应用。一个投影动力系统是由投影微分方程的'''流形 flow'''给定的。&lt;br /&gt;
通过对投影微分方程的流分析，给出了一个投影动力系统的表达式：&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\frac{dx(t)}{dt} = \Pi_K(x(t),-F(x(t)))&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中K为约束集。这种形式的微分方程因具有不连续的向量场而值得注意。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Symbolic dynamics 符号动力学===&lt;br /&gt;
&lt;br /&gt;
:[[Symbolic dynamics]] is the practice of modelling a topological or smooth [[dynamical system]] by a discrete space consisting of infinite [[sequence]]s of abstract symbols, each of which corresponds to a state of the system, with the dynamics (evolution) given by the [[shift operator]].&lt;br /&gt;
&lt;br /&gt;
Symbolic dynamics is the practice of modelling a topological or smooth dynamical system by a discrete space consisting of infinite sequences of abstract symbols, each of which corresponds to a state of the system, with the dynamics (evolution) given by the shift operator.&lt;br /&gt;
&lt;br /&gt;
'''符号动力学 Symbolic Dynamics'''是通过一个由抽象符号的无限序列组成的离散空间建立一个拓扑或光滑动力系统的方法。每一个抽象符号的无限序列序列对应于系统的一个状态，并由移位算子给出动力学(演化)。&lt;br /&gt;
&amp;lt;font color='blue'&amp;gt;'''符号动力学 Symbolic Dynamics'''是通过离散空间对拓扑或平滑动力学系统进行建模的方法，该离散空间由无限的抽象符号序列组成，每个抽象符号对应于系统的一个状态，并且由移位运算符给出动力学（演化）。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== System dynamics 系统动力学===&lt;br /&gt;
&lt;br /&gt;
:[[System dynamics]] is an approach to understanding the behaviour of systems over time.  It deals with internal feedback loops and time delays that affect the behaviour and state of the entire system.&amp;lt;ref name=&amp;quot;sysdyn&amp;quot;&amp;gt;[http://sysdyn.clexchange.org MIT System Dynamics in Education Project (SDEP)&amp;lt;!-- Bot generated title --&amp;gt;] {{webarchive|url=https://web.archive.org/web/20080509163801/http://sysdyn.clexchange.org/ |date=2008-05-09 }}&amp;lt;/ref&amp;gt;  What makes using system dynamics different from other approaches to studying systems is the use of [[feedback]] loops and [[Stock and flow|stocks and flows]].  These elements help describe how even seemingly simple systems display baffling [[nonlinearity]].&lt;br /&gt;
&lt;br /&gt;
System dynamics is an approach to understanding the behaviour of systems over time.  It deals with internal feedback loops and time delays that affect the behaviour and state of the entire system.  What makes using system dynamics different from other approaches to studying systems is the use of feedback loops and stocks and flows.  These elements help describe how even seemingly simple systems display baffling nonlinearity.&lt;br /&gt;
&lt;br /&gt;
'''系统动力学 System Dynamics'''是一种理解系统随时间变化行为的方法。它是用来处理影响整个系统行为和状态的内部反馈回路和时间延迟的方法。系统动力学不同于其他系统研究方法的地方在于它使用了反馈环、&amp;lt;font color='red'&amp;gt;股票（stocks）和流形（flows）&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;存量(stocks)和流量(flows)--[[用户:木子二月鸟|木子二月鸟]]（[[用户讨论:木子二月鸟|原wiki里这两个词指向:https://en.wikipedia.org/wiki/Stock_and_flow ，估计应该是存量和流量的意思，也可以群里大家讨论一下]]）&amp;lt;/font&amp;gt;--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|如何翻译stocks 和 folows]]）的元素。这些元素有助于描述看似简单的系统如何显示复杂的非线性行为。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Topological dynamics 拓扑动力学===&lt;br /&gt;
&lt;br /&gt;
:[[Topological dynamics]] is a branch of the theory of dynamical systems in which qualitative, asymptotic properties of dynamical systems are studied from the viewpoint of [[general topology]].&lt;br /&gt;
&lt;br /&gt;
Topological dynamics is a branch of the theory of dynamical systems in which qualitative, asymptotic properties of dynamical systems are studied from the viewpoint of general topology.&lt;br /&gt;
&lt;br /&gt;
'''拓扑动力学 Topological Dynamics'''是动力系统理论的一个分支。在拓朴动力学中，动力系统的定性性质和渐近性质是从一般拓扑学的观点来研究的。&lt;br /&gt;
&lt;br /&gt;
== Applications 应用==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== In human development 在人类发展中的应用===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In [[Developmental psychology|human development]], dynamical systems theory has been used to enhance and simplify Erik Erikson's [[eight stages of psychosocial development]] and offers a standard method of examining the universal pattern of human development. This method is based on the self-organizing and [[fractal]] properties of the [[Fibonacci sequence]].&amp;lt;ref name=Sacco&amp;gt;{{cite journal|last=Sacco|first=R.G.|title=Re-envisaging the eight developmental stages of Erik Erikson: The Fibonacci Life-Chart Method (FLCM)|journal=Journal of Educational and Developmental Psychology|date=2013|volume=3|issue=1|pages=140–146|doi=10.5539/jedp.v3n1p140|doi-access=free}}&amp;lt;/ref&amp;gt; Using mathematical modeling, a natural progression of human development with eight life stages has been identified:  early infancy (0–2 years), toddler (2–4 years), early childhood (4–7 years), middle childhood (7–11 years), adolescence (11–18 years), young adulthood (18–29 years), middle adulthood (29–48 years), and older adulthood (48–78+ years).&amp;lt;ref name=Sacco/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In human development, dynamical systems theory has been used to enhance and simplify Erik Erikson's eight stages of psychosocial development and offers a standard method of examining the universal pattern of human development. This method is based on the self-organizing and fractal properties of the Fibonacci sequence. Using mathematical modeling, a natural progression of human development with eight life stages has been identified:  early infancy (0–2 years), toddler (2–4 years), early childhood (4–7 years), middle childhood (7–11 years), adolescence (11–18 years), young adulthood (18–29 years), middle adulthood (29–48 years), and older adulthood (48–78+ years).&lt;br /&gt;
&lt;br /&gt;
在人类发展方面，动力系统理论已经被用来增强和简化 Erik Erikson 的'''社会心理发展8阶段理论 Eight Stages of Psychosocial Development'''，并提供了一个检验人类发展普遍模式的标准方法。该方法基于斐波那契数列的'''自组织性 self-organizing'''和'''分形 Fractal''' 特性。利用数学模型，人类发展的自然进程被分为8个生命阶段: 早期婴儿期(0-2岁)、幼儿期(2-4岁)、童年早期(4-7岁)、童年中期(7-11岁)、青春期(11-18岁)、成年早期(18-29岁)、成年中期(29-48岁)和老年成年期(48-78岁及以上)。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
According to this model, stage transitions between age intervals represent self-organization processes at multiple levels (e.g., molecules, genes, cell, organ, organ system, organism, behavior, and environment). For example, at the stage transition from [[adolescence]] to [[young adulthood]], and after reaching the critical point of 18 years of age (young adulthood), a peak in [[testosterone]] is observed in males&amp;lt;ref&amp;gt;{{cite journal |last1=Kelsey |first1=T. W. |title=A validated age-related normative model for male total testosterone shows increasing variance but no decline after age 40 years. |journal=PLOS One |volume=9 |issue=10 |pages=e109346 |doi=10.1371/journal.pone.0109346|pmid=25295520 |year=2014 |pmc=4190174 |bibcode=2014PLoSO...9j9346K }}&amp;lt;/ref&amp;gt; and the period of optimal [[fertility]] begins in females.&amp;lt;ref&amp;gt;{{cite book |last1=Tulandi |first1=T. |title=Preservation of fertility |date=2004 |publisher=Taylor &amp;amp; Francis |pages=1–20}}&amp;lt;/ref&amp;gt; Similarly, at age 30 optimal fertility begins to decline in females,&amp;lt;ref name=&amp;quot;Social Science 2008&amp;quot;&amp;gt;{{cite journal |last1=Blanchflower |first1=D. G. |title=Is well-being U-shaped over the life cycle? |journal=Social Science &amp;amp; Medicine |volume=66 |issue=8 |pages=1733–1749 |doi=10.1016/j.socscimed.2008.01.030|pmid=18316146 |year=2008 |citeseerx=10.1.1.63.5221 }}&amp;lt;/ref&amp;gt; and at the stage transition from [[middle adulthood]] to older adulthood at 48 years, the average age of onset of [[menopause]] occurs.&amp;lt;ref name=&amp;quot;Social Science 2008&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
According to this model, stage transitions between age intervals represent self-organization processes at multiple levels (e.g., molecules, genes, cell, organ, organ system, organism, behavior, and environment). For example, at the stage transition from adolescence to young adulthood, and after reaching the critical point of 18 years of age (young adulthood), a peak in testosterone is observed in males and the period of optimal fertility begins in females. Similarly, at age 30 optimal fertility begins to decline in females, and at the stage transition from middle adulthood to older adulthood at 48 years, the average age of onset of menopause occurs.&lt;br /&gt;
&lt;br /&gt;
根据这个模型，年龄的阶段转换代表了多层次的自组织过程(例如，分子、基因、细胞、器官、器官系统、生物体、行为和环境)。例如，在从青春期向成年早期过渡的阶段中，在达到18岁这一关键年龄之后，男性的睾丸激素达到高峰，女性的最佳生育期开始。同样，在30岁时，女性的最佳生育能力开始下降；在从成年中期过渡到老年成年期时，48岁是绝经的平均年龄。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
These events are physical bioattractors of aging from the perspective of Fibonacci mathematical modeling and dynamically systems theory. In practical terms, prediction in human development becomes possible in the same statistical sense in which the average temperature or precipitation at different times of the year can be used for [[weather forecasting]]. Each of the predetermined stages of human development follows an optimal epigenetic biological pattern. This phenomenon can be explained by the occurrence of Fibonacci numbers in biological [[DNA]]&amp;lt;ref&amp;gt;{{cite journal |last1=Perez |first1=J. C. (2010). |title=Codon populations in single-stranded whole human genome DNA are fractal and fine-tuned by the Golden Ratio 1.618. |journal=Interdisciplinary Sciences: Computational Life Sciences |volume=2 |issue=3 |pages=228–240 |doi=10.1007/s12539-010-0022-0|pmid=20658335 |year=2010 }}&amp;lt;/ref&amp;gt; and self-organizing properties of the Fibonacci numbers that converge on the [[golden ratio]].&lt;br /&gt;
&lt;br /&gt;
These events are physical bioattractors of aging from the perspective of Fibonacci mathematical modeling and dynamically systems theory. In practical terms, prediction in human development becomes possible in the same statistical sense in which the average temperature or precipitation at different times of the year can be used for weather forecasting. Each of the predetermined stages of human development follows an optimal epigenetic biological pattern. This phenomenon can be explained by the occurrence of Fibonacci numbers in biological DNA and self-organizing properties of the Fibonacci numbers that converge on the golden ratio.&lt;br /&gt;
&lt;br /&gt;
从斐波那契数学模型和动力系统理论的角度来看，上述事件是衰老的'''物理生物吸引子Physical Bioattractors'''。实际上，正如一年中不同时间的平均气温和降水量可以用来预测天气，预测人类的发展在统计意义上同样是可能的。人类发展的每个'''预定阶段Predetermined Stages'''都遵循最佳的'''表观遗传生物模式 Epigenetic Biological Pattern'''。这种现象可以用 DNA 中的斐波那契数和收敛于黄金分割比的斐波那契数的自组织特性来解释。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== In biomechanics 在运动生物力学中的应用===&lt;br /&gt;
&lt;br /&gt;
In [[sports biomechanics]], dynamical systems theory has emerged in the movement sciences as a viable framework for modeling athletic performance. From a dynamical systems perspective, the human movement system is a highly intricate network of co-dependent sub-systems (e.g. respiratory, circulatory, nervous, skeletomuscular, perceptual) that are composed of a large number of interacting components (e.g. blood cells, oxygen molecules, muscle tissue, metabolic enzymes, connective tissue and bone). In dynamical systems theory, movement patterns emerge through generic processes of self-organization found in physical and biological systems.&amp;lt;ref&amp;gt;Paul S Glazier, Keith Davids, Roger M Bartlett (2003). [http://www.sportsci.org/jour/03/psg.htm &amp;quot;DYNAMICAL SYSTEMS THEORY: a Relevant Framework for Performance-Oriented Sports Biomechanics Research&amp;quot;]. in: Sportscience 7. Accessed 2008-05-08.&amp;lt;/ref&amp;gt; There is no research validation of any of the claims associated to the conceptual application of this framework.&lt;br /&gt;
&lt;br /&gt;
In sports biomechanics, dynamical systems theory has emerged in the movement sciences as a viable framework for modeling athletic performance. From a dynamical systems perspective, the human movement system is a highly intricate network of co-dependent sub-systems (e.g. respiratory, circulatory, nervous, skeletomuscular, perceptual) that are composed of a large number of interacting components (e.g. blood cells, oxygen molecules, muscle tissue, metabolic enzymes, connective tissue and bone). In dynamical systems theory, movement patterns emerge through generic processes of self-organization found in physical and biological systems. There is no research validation of any of the claims associated to the conceptual application of this framework.&lt;br /&gt;
&lt;br /&gt;
在运动生物力学中，动力系统理论新兴地成为对运动表现建模的可行框架。从动力系统的角度来看，人类的运动系统是由高度复杂和相互依赖的子系统网络（如呼吸、循环、神经、骨骼肌系统和知觉系统等）组成的，它们由大量相互作用的部分组成（包括血细胞、氧分子、肌肉组织、代谢酶、结缔组织和骨骼等)。动力系统理论中，运动模式通过物理系统和生物系统中的一般自组织过程出现。没有任何研究证实与这一框架的概念相关的任何主张。&lt;br /&gt;
&lt;br /&gt;
=== In cognitive science 在认知科学中的应用===&lt;br /&gt;
&lt;br /&gt;
Dynamical system theory has been applied in the field of [[neurodynamics|neuroscience]] and [[cognitive science|cognitive development]], especially in [[the neo-Piagetian theories of cognitive development]]. It is the belief that cognitive development is best represented by physical theories rather than theories based on syntax and [[AI]]. It also believed that differential equations are the most appropriate tool for modeling human behavior. These equations are interpreted to represent an agent's cognitive trajectory through [[state space]]. In other words, dynamicists argue that [[psychology]] should be (or is) the description (via differential equations) of the cognitions and behaviors of an agent under certain environmental and internal pressures. The language of chaos theory is also frequently adopted.&lt;br /&gt;
&lt;br /&gt;
Dynamical system theory has been applied in the field of neuroscience and cognitive development, especially in the neo-Piagetian theories of cognitive development. It is the belief that cognitive development is best represented by physical theories rather than theories based on syntax and AI. It also believed that differential equations are the most appropriate tool for modeling human behavior. These equations are interpreted to represent an agent's cognitive trajectory through state space. In other words, dynamicists argue that psychology should be (or is) the description (via differential equations) of the cognitions and behaviors of an agent under certain environmental and internal pressures. The language of chaos theory is also frequently adopted.&lt;br /&gt;
&lt;br /&gt;
动力系统理论已经被应用于神经科学和认知发展领域，特别是在认知发展的'''新皮亚杰学派 neo-Piagetian'''中。人们相信，物理学理论比句法学理论和人工智能理论更能代表认知发展。人们还相信微分方程是人类行为建模最合适的工具。人们认为微分方程可以解释为通过状态空间代表一个主体的认知轨迹的算式。换句话说，动力学家认为心理学应该(或者是)(通过微分方程)描述在一定的环境和内部压力下的主体的认知和行为的学科。混沌理论在相关领域也经常被采用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In it, the learner's mind reaches a state of disequilibrium where old patterns have broken down. This is the phase transition of cognitive development. [[Self-organization]] (the spontaneous creation of coherent forms) sets in as activity levels link to each other. Newly formed macroscopic and microscopic structures support each other, speeding up the process. These links form the structure of a new state of order in the mind through a process called ''scalloping'' (the repeated building up and collapsing of complex performance.) This new, novel state is progressive, discrete, idiosyncratic and unpredictable.&amp;lt;ref&amp;gt;{{cite journal|title=The Promise of Dynamic Systems Approaches for an Integrated Account of Human Development|journal=Child Development|date=2000-02-25|first=Mark D.|last=Lewis|volume=71|issue=1|pages=36–43|id= |url=http://home.oise.utoronto.ca/~mlewis/Manuscripts/Promise.pdf|accessdate=2008-04-04|doi=10.1111/1467-8624.00116|pmid=10836556 |citeseerx=10.1.1.72.3668}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In it, the learner's mind reaches a state of disequilibrium where old patterns have broken down. This is the phase transition of cognitive development. Self-organization (the spontaneous creation of coherent forms) sets in as activity levels link to each other. Newly formed macroscopic and microscopic structures support each other, speeding up the process. These links form the structure of a new state of order in the mind through a process called scalloping (the repeated building up and collapsing of complex performance.) This new, novel state is progressive, discrete, idiosyncratic and unpredictable.&lt;br /&gt;
&lt;br /&gt;
在学习的过程中，旧的模式被打破了，学习者的思维达到了一种不平衡的状态。这是认知发展的阶段性转变。自组织(连贯的自发创造(the spontaneous creation of coherent forms))在'''活动水平 Activity Levels'''相互联系时产生。新形成的宏观和微观结构相互支持，加速了这一过程。这些联系在头脑中形成了一种具有新状态的结构，这个过程被称为“扇贝化 Scalloping”，也就是头脑的复杂性能的不断累积和崩溃的过程 --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|扇贝化的翻译拿不准，这句话的描述比较抽象]]）。这种新的状态是渐进的、离散的、异质的的和不可预知的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Dynamic systems theory has recently been used to explain a long-unanswered problem in child development referred to as the [[A-not-B error]].&amp;lt;ref&amp;gt;{{cite journal|title=Development as a dynamic system|journal=Trends in Cognitive Sciences|date=2003-07-30|first=Linda B.|last=Smith|author2=Esther Thelen|volume=7|issue=8|pages=343–8|id= |url=http://www.indiana.edu/~cogdev/labwork/dynamicsystem.pdf|accessdate=2008-04-04|doi=10.1016/S1364-6613(03)00156-6|pmid=12907229|citeseerx=10.1.1.294.2037}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Dynamic systems theory has recently been used to explain a long-unanswered problem in child development referred to as the A-not-B error.&lt;br /&gt;
&lt;br /&gt;
动力系统理论最近还被用来解释儿童发展中一个长期没有答案的问题，即 A-not-B 错误。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===In second language development 在二语习得中的应用===&lt;br /&gt;
&lt;br /&gt;
{{Main|Dynamic approach to second language development}}&lt;br /&gt;
&lt;br /&gt;
The application of Dynamic Systems Theory to study [[second language acquisition]] is attributed to [[Diane Larsen-Freeman]] who published an article in 1997 in which she claimed that [[second language acquisition]] should be viewed as a developmental process which includes [[language attrition]] as well as language acquisition.&amp;lt;ref&amp;gt;{{cite web|url=https://academic.oup.com/applij/article-abstract/18/2/141/134192|title=Chaos/Complexity Science and Second Language Acquisition|date=1997|publisher=Applied Linguistics}}&amp;lt;/ref&amp;gt; In her article she claimed that language should be viewed as a dynamic system which is dynamic, complex, nonlinear, chaotic, unpredictable, sensitive to initial conditions, open, self-organizing, feedback sensitive, and adaptive.&lt;br /&gt;
&lt;br /&gt;
The application of Dynamic Systems Theory to study second language acquisition is attributed to Diane Larsen-Freeman who published an article in 1997 in which she claimed that second language acquisition should be viewed as a developmental process which includes language attrition as well as language acquisition. In her article she claimed that language should be viewed as a dynamic system which is dynamic, complex, nonlinear, chaotic, unpredictable, sensitive to initial conditions, open, self-organizing, feedback sensitive, and adaptive.&lt;br /&gt;
&lt;br /&gt;
动力系统理论在二语习得研究中的应用归功于 Diane Larsen-Freeman，她在1997年发表的一篇文章中认为，二语习得应该被看作是一个包括语言流失和习得在内的发展过程。她在文章中认为，语言应该被看作是一个动态的、复杂的、非线性的、混沌的、不可预知的、对初始条件敏感的、开放的、自组织的、反馈敏感的和适应性的动力系统。&lt;br /&gt;
&lt;br /&gt;
== See also 参见==&lt;br /&gt;
&lt;br /&gt;
;Related subjects&lt;br /&gt;
&lt;br /&gt;
Related subjects&lt;br /&gt;
&lt;br /&gt;
相关科目&lt;br /&gt;
&lt;br /&gt;
{{div col|colwidth=20em}}&lt;br /&gt;
&lt;br /&gt;
* [[List of dynamical system topics]] 动力系统主题清单&lt;br /&gt;
&lt;br /&gt;
* [[Baker's map]]&lt;br /&gt;
&lt;br /&gt;
* [[Biological applications of bifurcation theory]] 分支理论的生物学应用&lt;br /&gt;
&lt;br /&gt;
* [[Dynamical system (definition)]] 动力系统（定义）&lt;br /&gt;
&lt;br /&gt;
* [[Embodied Embedded Cognition]] 具身认知&lt;br /&gt;
&lt;br /&gt;
* [[Fibonacci numbers]] 斐波那契数&lt;br /&gt;
&lt;br /&gt;
* [[Fractals]] 分形&lt;br /&gt;
&lt;br /&gt;
* [[Gingerbreadman map]]&lt;br /&gt;
&lt;br /&gt;
* [[Halo orbit]] Halo 轨道&lt;br /&gt;
&lt;br /&gt;
* [[List of types of systems theory]] 动力系统类型清单&lt;br /&gt;
&lt;br /&gt;
* [[Oscillation]] 振动性&lt;br /&gt;
&lt;br /&gt;
* [[Postcognitivism]]&lt;br /&gt;
&lt;br /&gt;
* [[Recurrent neural network]] 递归神经网络&lt;br /&gt;
&lt;br /&gt;
* [[Combinatorics and dynamical systems]] 组合数学和动力系统&lt;br /&gt;
&lt;br /&gt;
* [[Synergetics (Haken)|Synergetics]] 协同学(Haken)&lt;br /&gt;
&lt;br /&gt;
* [[Systemography]]&lt;br /&gt;
&lt;br /&gt;
{{div col end}}&lt;br /&gt;
&lt;br /&gt;
;Related scientists&lt;br /&gt;
&lt;br /&gt;
Related scientists&lt;br /&gt;
&lt;br /&gt;
相关科学家&lt;br /&gt;
&lt;br /&gt;
{{div col|colwidth=20em}}&lt;br /&gt;
&lt;br /&gt;
* [[People in systems and control]]&lt;br /&gt;
&lt;br /&gt;
* [[Dmitri Anosov]]&lt;br /&gt;
&lt;br /&gt;
* [[Vladimir Arnold]]&lt;br /&gt;
&lt;br /&gt;
* [[Nikolay Bogolyubov]]&lt;br /&gt;
&lt;br /&gt;
* [[Andrey Kolmogorov]]&lt;br /&gt;
&lt;br /&gt;
* [[Nikolay Mitrofanovich Krylov|Nikolay Krylov]]&lt;br /&gt;
&lt;br /&gt;
* [[Jürgen Moser]]&lt;br /&gt;
&lt;br /&gt;
* [[Yakov G. Sinai]]&lt;br /&gt;
&lt;br /&gt;
* [[Stephen Smale]]&lt;br /&gt;
&lt;br /&gt;
* [[Hillel Furstenberg]]&lt;br /&gt;
&lt;br /&gt;
* [[Grigory Margulis]]&lt;br /&gt;
&lt;br /&gt;
* [[Elon Lindenstrauss]]&lt;br /&gt;
&lt;br /&gt;
{{div col end}}&lt;br /&gt;
&lt;br /&gt;
== Notes 参考资料==&lt;br /&gt;
&lt;br /&gt;
{{reflist}}&lt;br /&gt;
&lt;br /&gt;
== Further reading 拓展阅读==&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Frederick D. |last1=Abraham |first2=Ralph |last2=Abraham |authorlink2=Ralph Abraham (mathematician)|first3=Christopher D. |last3=Shaw |title=A Visual Introduction to Dynamical Systems Theory for Psychology |url=https://books.google.com/books?id=oMbaAAAAMAAJ |year=1990 |publisher=Aerial Press |isbn=978-0-942344-09-7 |oclc=24345312}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=Edward J. |last=Beltrami |title=Mathematics for Dynamic Modeling |url=https://books.google.com/books?id=MmoiJPsuFW8C |year=1998 |publisher=Academic Press |isbn=978-0-12-085566-7 |edition=2nd |oclc=36713294}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=Otomar |last=Hájek |title=Dynamical systems in the plane |url=https://books.google.com/books?id=czhPAQAAIAAJ |year=1968 |publisher=Academic Press |oclc=343328 |authorlink=Otomar Hájek |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=David G. |last=Luenberger |title=Introduction to dynamic systems: theory, models, and applications |url=https://books.google.com/books?id=mvlQAAAAMAAJ |year=1979 |publisher=Wiley |isbn=978-0-471-02594-8 |oclc=4195122 |authorlink=David Luenberger |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Anthony |last1=Michel |author2=Kaining Wang |author3=Bo Hu |title=Qualitative Theory of Dynamical Systems |url=https://books.google.com/books?id=ZPGBnZGV2_cC |year=2001 |publisher=Taylor &amp;amp; Francis |isbn=978-0-8247-0526-8 |oclc=45873628}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Louis |last1=Padulo |first2=Michael A. |last2=Arbib |authorlink2=Michael A. Arbib |title=System theory: a unified state-space approach to continuous and discrete systems |url=https://books.google.com/books?id=6UPvAAAAMAAJ |year=1974 |publisher=Saunders |isbn=9780721670355 |oclc=947600 |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |first=Steven H. |last=Strogatz |title=Nonlinear Dynamics and Chaos: With Applications to Physics, Biology, Chemistry, and Engineering |year=1994 |publisher=Addison Wesley |isbn=978-0-7382-0453-6 |oclc=49839504 |authorlink=Steven Strogatz |ref=harv |url-access=registration |url=https://archive.org/details/nonlineardynamic00stro }}&lt;br /&gt;
&lt;br /&gt;
== External links 外部链接==&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20080613053119/http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html Dynamic Systems 动力系统] Encyclopedia of Cognitive Science entry. --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|这是一个嵌套的链接，但好像只能鼠标点击并超链接到内嵌的那个]]）认知科学百科全书&lt;br /&gt;
&lt;br /&gt;
*[http://mathworld.wolfram.com/DynamicalSystem.html Definition of dynamical system 动力系统的定义] in MathWorld. 在MathWorld.wolfram.com储存的定义&lt;br /&gt;
&lt;br /&gt;
*[http://www.dynamicalsystems.org/ DSWeb] Dynamical Systems Magazine 动力系统杂志&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Areas of mathematics | state=collapsed}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:Dynamical systems]]&lt;br /&gt;
&lt;br /&gt;
Category:Dynamical systems&lt;br /&gt;
&lt;br /&gt;
类别: 动力系统&lt;br /&gt;
&lt;br /&gt;
[[Category:Complex systems theory]]&lt;br /&gt;
&lt;br /&gt;
Category:Complex systems theory&lt;br /&gt;
&lt;br /&gt;
范畴: 复杂系统理论&lt;br /&gt;
&lt;br /&gt;
[[Category:Computational fields of study]]&lt;br /&gt;
&lt;br /&gt;
Category:Computational fields of study&lt;br /&gt;
&lt;br /&gt;
类别: 研究的计算领域&lt;br /&gt;
&lt;br /&gt;
&amp;lt;noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;small&amp;gt;This page was moved from [[wikipedia:en:Dynamical systems theory]]. Its edit history can be viewed at [[动力系统/edithistory]]&amp;lt;/small&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:待整理页面]]&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
===书籍推荐===&lt;br /&gt;
====[https://www.amazon.co.uk/Chaos-Making-Science-James-Gleick/dp/0749386061 Chaos: Making a New Science]====&lt;br /&gt;
The million-copy bestseller by National Book Award nominee and Pulitzer Prize finalist James Gleick—the author of Time Travel: A History—that reveals the science behind chaos theory。&lt;br /&gt;
Very readable, focuses on the scientists and mathematicians behind many of the key results in chaos.&lt;br /&gt;
本书由普利茨奖获得者James Gleick撰写。它是一本易读科普书籍，侧重介绍对混沌概念的发展做出重大贡献的科学家和数学家们。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://www.amazon.com/dp/0199566445/ref=cm_sw_su_dp Chaos and Fractals: An Elementary Introduction]====&lt;br /&gt;
This book provides the reader with an elementary introduction to chaos and fractals, suitable for students with a background in elementary algebra, without assuming prior coursework in calculus or physics. &lt;br /&gt;
这是一本关于混沌和分形的入门书籍。读者需要有一定的线性代数基础，但是不需要有微积分或物理学的基础。&lt;br /&gt;
&lt;br /&gt;
====[https://www.amazon.co.uk/Chaos-Very-Short-Introduction-Introductions/dp/0192853783/ref=pd_lpo_14_img_1/257-2017232-0516612?_encoding=UTF8&amp;amp;pd_rd_i=0192853783&amp;amp;pd_rd_r=eebee69a-fad3-43e3-bbeb-b883f2c59bf5&amp;amp;pd_rd_w=g6knH&amp;amp;pd_rd_wg=sx6z5&amp;amp;pf_rd_p=7b8e3b03-1439-4489-abd4-4a138cf4eca6&amp;amp;pf_rd_r=YTB0XXCR2DM8049PYP1Y&amp;amp;psc=1&amp;amp;refRID=YTB0XXCR2DM8049PYP1Y 牛津通识读本: Chaos]====&lt;br /&gt;
This book would not have been possible without my parents, of course, but I owe a greater debt than most to their faith, doubt, and hope, and to the love and patience of a, b, and c. Professionally my greatest debt is to Ed Spiegel, a father of chaos and my thesis Professor, mentor, and friend.&lt;br /&gt;
本书隶属于牛津通识读本系列。该书由Ed Spiegel的学生Leonard Smith撰写，语言生动简明。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
===集智课程推荐===&lt;br /&gt;
====[https://campus.swarma.org/course/1655 圣塔菲课程：Introduction to Dynamical Systems and Chaos]====&lt;br /&gt;
本课程中，主要介绍动力学系统和混沌系统，您将学到'''蝴蝶效应 Butterfly effect'''、'''奇异吸引子 Attractors'''等基本概念，以及如何应用于您感兴趣的领域。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://campus.swarma.org/course/1641 动力系统分析]====&lt;br /&gt;
本课程主要讲授连续和离散动力系统的定态、极限环及其稳定性分析、动力学系统的结构稳定性和常见的分支类型以及分析方法，混沌概念等。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E5%8A%A8%E5%8A%9B%E7%B3%BB%E7%BB%9F%E7%90%86%E8%AE%BA_Dynamical_Systems_Theory&amp;diff=10185</id>
		<title>动力系统理论 Dynamical Systems Theory</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E5%8A%A8%E5%8A%9B%E7%B3%BB%E7%BB%9F%E7%90%86%E8%AE%BA_Dynamical_Systems_Theory&amp;diff=10185"/>
		<updated>2020-07-11T15:20:53Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。&lt;br /&gt;
&lt;br /&gt;
{{Use dmy dates|date=May 2019|cs1-dates=y}}&lt;br /&gt;
&lt;br /&gt;
'''Dynamical systems theory''' is an area of [[mathematics]] used to describe the behavior of the  [[complex systems|complex]] [[dynamical system]]s, usually by employing [[differential equations]] or [[difference equations]]. When differential equations are employed, the theory is called [[continuous time|''continuous dynamical systems'']]. From a physical point of view, continuous dynamical systems is a generalization of [[classical mechanics]], a generalization where the [[equations of motion]] are postulated directly and are not constrained to be [[Euler–Lagrange equation]]s of a [[Principle of least action|least action principle]]. When difference equations are employed, the theory is called [[discrete time|''discrete dynamical systems'']]. When the time variable runs over a set that is discrete over some intervals and continuous over other intervals or is any arbitrary time-set such as a [[cantor set]], one gets [[dynamic equations on time scales]]. Some situations may also be modeled by mixed operators, such as [[differential-difference equations]].&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory is an area of mathematics used to describe the behavior of the  complex dynamical systems, usually by employing differential equations or difference equations. When differential equations are employed, the theory is called continuous dynamical systems. From a physical point of view, continuous dynamical systems is a generalization of classical mechanics, a generalization where the equations of motion are postulated directly and are not constrained to be Euler–Lagrange equations of a least action principle. When difference equations are employed, the theory is called discrete dynamical systems. When the time variable runs over a set that is discrete over some intervals and continuous over other intervals or is any arbitrary time-set such as a cantor set, one gets dynamic equations on time scales. Some situations may also be modeled by mixed operators, such as differential-difference equations.&lt;br /&gt;
&lt;br /&gt;
  &lt;br /&gt;
'''动力系统理论 Dynamical Systems Theory'''是一个用来描述复杂动力系统行为的数学领域，通常使用微分方程或差分方程。当采用微分方程时，该理论被称为连续动力系统。从物理学的角度来看，连续动力系统是经典力学的推广，也是运动方程的推广，不受极小作用原理Euler–Lagrange方程的约束。当采用差分方程时，该理论被称为离散动力系统。&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;当时间变量在一个离散的集合上运行，在另一个离散的集合上连续，或者像cantor集一样在任意的时间集合上运行时，人们就能得到时间尺度上的动力方程。&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 当时间变量运行在一个某些区间离散、其他区间连续的集合、或者像cantor集一样任意的时间集合上时，人们就能得到时间尺度上的动力方程。&amp;lt;/font&amp;gt;&lt;br /&gt;
&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;'''算子 Operators'''是一个函数空间到函数空间上的映射O：X→X，广义的讲，对任何函数进行某一项操作都可以认为是一个算子，如求幂次、求微分等。&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;这句话的英文原文在哪里？&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;动力系统的有些情况也可以用'''混合算子 Mixed Operators'''来建模，如微分-差分方程。&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 某些情况下，也可以用'''混合算子 Mixed Operators'''来建模，如微分-差分方程。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This theory deals with the long-term qualitative behavior of dynamical systems, and studies the nature of, and when possible the solutions of, the [[equations of motion]] of systems that are often primarily [[mechanics|mechanical]] or otherwise physical in nature, such as [[planetary orbit]]s and the behaviour of [[electronic circuit]]s, as well as systems that arise in [[biology]], [[economics]], and elsewhere. Much of modern research is focused on the study of [[chaotic system]]s.&lt;br /&gt;
&lt;br /&gt;
This theory deals with the long-term qualitative behavior of dynamical systems, and studies the nature of, and when possible the solutions of, the equations of motion of systems that are often primarily mechanical or otherwise physical in nature, such as planetary orbits and the behaviour of electronic circuits, as well as systems that arise in biology, economics, and elsewhere. Much of modern research is focused on the study of chaotic systems.&lt;br /&gt;
&lt;br /&gt;
这个理论处理动力系统的&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;长期定性行为。如果能够得到解的话，还可以研究系统的运动方程。这些方程通常运用到机械或物理研究领域，如行星轨道和电子电路，以及出现在生物学，经济学和其他地方的系统。&amp;lt;/font&amp;gt;现代的研究大多集中在对混沌系统的研究上。&lt;br /&gt;
&lt;br /&gt;
&amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;这个理论处理动力系统的长周期性的行为，并且研究系统的动力方程的规律，努力求得可能的解。这些系统通常是一些自然领域里的机械系统或其他物理系统，例如行星轨道和电子电路，也包括一些生物学、经济学和其他学科里的系统。现代的研究大多集中在对混沌系统的研究上。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This field of study is also called just ''dynamical systems'', ''mathematical dynamical systems theory'' or the ''mathematical theory of dynamical systems''.&lt;br /&gt;
&lt;br /&gt;
This field of study is also called just dynamical systems, mathematical dynamical systems theory or the mathematical theory of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
这个研究领域也被称为动力系统，数学动力系统理论或动力系统的数学理论。&lt;br /&gt;
&lt;br /&gt;
[[Image:Lorenz attractor yb.svg|thumb|240px|right|The [[Lorenz attractor]] is an example of a [[non-linear]] dynamical system. Studying this system helped give rise to [[chaos theory]].]]&lt;br /&gt;
&lt;br /&gt;
The [[Lorenz attractor is an example of a non-linear dynamical system. Studying this system helped give rise to chaos theory.]]&lt;br /&gt;
&lt;br /&gt;
'''洛伦兹吸引子 Lorenz Attractor'''是非线性动力系统的一个例子。对这个系统的研究产生了混沌理论。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Overview 综述 ==&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory and [[chaos theory]] deal with the long-term qualitative behavior of [[dynamical system]]s. Here, the focus is not on finding precise solutions to the equations defining the dynamical system (which is often hopeless), but rather to answer questions like &amp;quot;Will the system settle down to a steady state in the long term, and if so, what are the possible steady states?&amp;quot;, or &amp;quot;Does the long-term behavior of the system depend on its initial condition?&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory and chaos theory deal with the long-term qualitative behavior of dynamical systems. Here, the focus is not on finding precise solutions to the equations defining the dynamical system (which is often hopeless), but rather to answer questions like &amp;quot;Will the system settle down to a steady state in the long term, and if so, what are the possible steady states?&amp;quot;, or &amp;quot;Does the long-term behavior of the system depend on its initial condition?&amp;quot;&lt;br /&gt;
&lt;br /&gt;
动力系统理论和'''混沌理论 Chaos Theory'''是用来处理动力系统的&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;长期定性行为&amp;lt;/font&amp;gt;&amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 长周期性行为&amp;lt;/font&amp;gt;的理论。寻找动力系统方程的精确解通常是很难达到的。&amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 因此，&amp;lt;/font&amp;gt;这两个理论的重点不在于找到精确解，而是回答如下的问题，如“系统长期来看是否会稳定下来，如果可以，那么可能的稳定状态是什么样的?”，或“系统长期的行为是否取决于其初始条件?”&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
An important goal is to describe the fixed points, or steady states of a given dynamical system; these are values of the variable that don't change over time. Some of these fixed points are ''attractive'', meaning that if the system starts out in a nearby state, it converges towards the fixed point.&lt;br /&gt;
&lt;br /&gt;
An important goal is to describe the fixed points, or steady states of a given dynamical system; these are values of the variable that don't change over time. Some of these fixed points are attractive, meaning that if the system starts out in a nearby state, it converges towards the fixed point.&lt;br /&gt;
&lt;br /&gt;
描述给定动力系统的不动点或'''&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;定态&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;稳态&amp;lt;/font&amp;gt;Steady States'''是一个重要的目标。不动点或&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;定态&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;稳态&amp;lt;/font&amp;gt;的变量值不会随时间的变化而变化。&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;一些不动点是有吸引力的（attractive），即如果系统的初始值在它的附近，系统最终会收敛到这个不动点。&amp;lt;/font&amp;gt;&amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 某些不动点被称为“吸引子”，意味着如果系统即使不在它附近的状态开始，最终也会收敛到这些不动点。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Similarly, one is interested in ''periodic points'', states of the system that repeat after several timesteps. Periodic points can also be attractive. [[Sharkovskii's theorem]] is an interesting statement about the number of periodic points of a one-dimensional discrete dynamical system.&lt;br /&gt;
&lt;br /&gt;
Similarly, one is interested in periodic points, states of the system that repeat after several timesteps. Periodic points can also be attractive. Sharkovskii's theorem is an interesting statement about the number of periodic points of a one-dimensional discrete dynamical system.&lt;br /&gt;
&lt;br /&gt;
人们还对动力系统的'''周期点 Periodic Points'''感兴趣，即系统在几个时间步之后会不断重复的状态。周期点也可以是有吸引力的。Sharkovskii定理描述了一维离散动力系统的周期点的个数。&lt;br /&gt;
&amp;lt;font color='blue'&amp;gt;类似地，另一个研究兴趣是'''周期点 Periodic Points'''，即系统在重复几个时间步之后的状态。周期点也可以是吸引子。Sharkovskii定理描述了一维离散动力系统的周期点的个数。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Even simple [[nonlinear dynamical system]]s often exhibit seemingly random behavior that has been called ''chaos''.&amp;lt;ref&amp;gt;{{cite journal |last=Grebogi |first=C. |last2=Ott |first2=E. |last3=Yorke |first3=J. |year=1987 |title=Chaos, Strange Attractors, and Fractal Basin Boundaries in Nonlinear Dynamics |journal=[[Science (journal)|Science]] |volume=238 |issue=4827 |pages=632–638 |jstor=1700479 |doi=10.1126/science.238.4827.632 |pmid=17816542 |bibcode=1987Sci...238..632G }}&amp;lt;/ref&amp;gt; The branch of dynamical systems that deals with the clean definition and investigation of chaos is called ''[[chaos theory]]''.&lt;br /&gt;
&lt;br /&gt;
Even simple nonlinear dynamical systems often exhibit seemingly random behavior that has been called chaos. The branch of dynamical systems that deals with the clean definition and investigation of chaos is called chaos theory.&lt;br /&gt;
&lt;br /&gt;
即使是简单的非线性动力系统也常常表现出看似随机的行为，这种行为被称为混沌。混沌理论主要研究混沌的清晰定义和混沌的现象，它是动力系统理论的一个分支。&lt;br /&gt;
&lt;br /&gt;
== History 历史==&lt;br /&gt;
&lt;br /&gt;
The concept of dynamical systems theory has its origins in [[Newtonian mechanics]]. There, as in other natural sciences and engineering disciplines, the evolution rule of dynamical systems is given implicitly by a relation that gives the state of the system only a short time into the future.&lt;br /&gt;
&lt;br /&gt;
The concept of dynamical systems theory has its origins in Newtonian mechanics. There, as in other natural sciences and engineering disciplines, the evolution rule of dynamical systems is given implicitly by a relation that gives the state of the system only a short time into the future.&lt;br /&gt;
&lt;br /&gt;
动态系统理论的概念起源于牛顿运动定律。与其他自然科学和工程学科一样，动力系统的演化规律也是通过一种预测系统在未来很短时间内的状态的关系隐含地给出的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Before the advent of [[computer|fast computing machines]], solving a dynamical system required sophisticated mathematical techniques and could only be accomplished for a small class of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
Before the advent of fast computing machines, solving a dynamical system required sophisticated mathematical techniques and could only be accomplished for a small class of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
在高速计算机器出现之前，解决动力系统问题需要复杂的数学技能，而且还只能解决一小类动力系统问题。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Some excellent presentations of mathematical dynamic system theory include {{harvtxt|Beltrami|1990}}, {{harvtxt|Luenberger|1979}}, {{harvtxt|Padulo|Arbib|1974}}, and {{harvtxt|Strogatz|1994}}.&amp;lt;ref&amp;gt;Jerome R. Busemeyer (2008), [http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html &amp;quot;Dynamic Systems&amp;quot;]. To Appear in: ''Encyclopedia of cognitive science'', Macmillan. Retrieved 8 May 2008.  {{webarchive |url=https://web.archive.org/web/20080613053119/http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html |date=June 13, 2008 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Some excellent presentations of mathematical dynamic system theory include , , , and . To Appear in: ''Encyclopedia of cognitive science'', Macmillan. Retrieved 8 May 2008&lt;br /&gt;
&lt;br /&gt;
优秀的数学动力系统理论包括，，，和。--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|存疑]]）。&lt;br /&gt;
&lt;br /&gt;
&amp;lt;font color='blue'&amp;gt;原文是：Some excellent presentations of mathematical dynamic system theory include Beltrami (1990), Luenberger (1979), Padulo &amp;amp; Arbib (1974), and Strogatz (1994).[2] 是不是在粘贴或解析时内容有丢失？&lt;br /&gt;
&lt;br /&gt;
一些优秀的数学动力系统理论包括贝尔特拉米（Beltrami，1990年），龙伯格(Luenberger，1979年），帕杜罗&amp;amp;阿尔比布（Padulo＆Arbib，1974年）和斯托加茨（Strogatz，1994年）。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Concepts 概念==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Dynamical systems 动力系统===&lt;br /&gt;
&lt;br /&gt;
{{main|Dynamical system (definition)}}&lt;br /&gt;
&lt;br /&gt;
The [[dynamical system]] concept is a mathematical [[formal system|formalization]] for any fixed &amp;quot;rule&amp;quot; that describes the [[time]] dependence of a point's position in its [[ambient space]].  Examples include the [[mathematical model]]s that describe the swinging of a clock pendulum, the flow of water in a pipe, and the number of fish each spring in a lake.&lt;br /&gt;
&lt;br /&gt;
The dynamical system concept is a mathematical formalization for any fixed &amp;quot;rule&amp;quot; that describes the time dependence of a point's position in its ambient space.  Examples include the mathematical models that describe the swinging of a clock pendulum, the flow of water in a pipe, and the number of fish each spring in a lake.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;动力系统是一个对任何描述了点的位置在周围环境随时间变化的“固定”规则的数学式。&amp;lt;/font&amp;gt;&amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;动力系统概念是对描述了一个点的位置在其周围环境中随时间变化的任何“固定”规则的数学形式化。&amp;lt;/font&amp;gt;举例来说，描述钟摆摆动、管道中的水流以及每年春天湖中鱼的数量的数学模型，都属于动力系统的概念范畴。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A dynamical system has a ''state'' determined by a collection of [[real numbers]], or more generally by a [[Set (mathematics)|set]] of [[Point (geometry)|points]] in an appropriate ''state space''.  Small changes in the state of the system correspond to small changes in the numbers.  The numbers are also the coordinates of a geometrical space—a [[manifold]].   The ''evolution rule'' of the dynamical system is a [[function (mathematics)|fixed rule]] that describes what future states follow from the current state.  The rule may be [[Deterministic system (mathematics)|deterministic]] (for a given time interval only one future state follows from the current state) or [[stochastic differential equation|stochastic]] (the evolution of the state is subject to random shocks).&lt;br /&gt;
&lt;br /&gt;
A dynamical system has a state determined by a collection of real numbers, or more generally by a set of points in an appropriate state space.  Small changes in the state of the system correspond to small changes in the numbers.  The numbers are also the coordinates of a geometrical space—a manifold.   The evolution rule of the dynamical system is a fixed rule that describes what future states follow from the current state.  The rule may be deterministic (for a given time interval only one future state follows from the current state) or stochastic (the evolution of the state is subject to random shocks).&lt;br /&gt;
&lt;br /&gt;
动力系统的状态是由一组实数决定的，更广泛地说，是由适当的状态空间中的一组点决定的。系统状态的微小变化对应于数字的变化。这些数字也是几何空间——'''流形 Manifold'''——的坐标组。&amp;lt;font color='red'&amp;gt;动力系统的演化是描述了在当前状态之后出现的未来状态的固定规则。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;动力系统的演化规律是一种固定的规则，它描述了从当前状态得出的未来状态。&amp;lt;/font&amp;gt;这个规则可以是确定性的(在给定的时间间隔内，有且仅有一个未来状态在当前状态之后出现)，或随机性的(状态的演化受到随机因素的影响)。&lt;br /&gt;
&lt;br /&gt;
=== Dynamicism 动态主义===&lt;br /&gt;
&lt;br /&gt;
[[Dynamicism]], also termed the ''dynamic hypothesis'' or the ''dynamic hypothesis in cognitive science'' or ''dynamic cognition'', is a new approach in [[cognitive science]] exemplified by the work of philosopher [[Tim van Gelder]]. It argues that [[differential equations]] are more suited to modelling [[cognition]] than more traditional [[computer]] models.&lt;br /&gt;
&lt;br /&gt;
Dynamicism, also termed the dynamic hypothesis or the dynamic hypothesis in cognitive science or dynamic cognition, is a new approach in cognitive science exemplified by the work of philosopher Tim van Gelder. It argues that differential equations are more suited to modelling cognition than more traditional computer models.&lt;br /&gt;
&lt;br /&gt;
'''动态主义 Dynamicism'''，也称动态假设，&amp;lt;font color='red'&amp;gt;或称认知科学、动态认知中的动态假设，&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;或称认知科学的动态假设或动态认知，&amp;lt;/font&amp;gt;是以哲学家Tim van Gelder的著作为代表的认知科学的一种新取向。动态主义认为微分方程比传统的计算机模型更适合于建立认知模型。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Nonlinear system 非线性系统===&lt;br /&gt;
&lt;br /&gt;
{{main|Nonlinear system}}&lt;br /&gt;
&lt;br /&gt;
In [[mathematics]], a [[nonlinear system]] is a system that is not [[linear system|linear]]—i.e., a system that does not satisfy the [[superposition principle]]. Less technically, a nonlinear system is any problem where the variable(s) to solve for cannot be written as a linear sum of independent components. A [[Homogeneity (physics)|nonhomogeneous]] system, which is linear apart from the presence of a function of the [[independent variable]]s, is nonlinear according to a strict definition, but such systems are usually studied alongside linear systems, because they can be transformed to a linear system as long as a particular solution is known.&lt;br /&gt;
&lt;br /&gt;
In mathematics, a nonlinear system is a system that is not linear—i.e., a system that does not satisfy the superposition principle. Less technically, a nonlinear system is any problem where the variable(s) to solve for cannot be written as a linear sum of independent components. A nonhomogeneous system, which is linear apart from the presence of a function of the independent variables, is nonlinear according to a strict definition, but such systems are usually studied alongside linear systems, because they can be transformed to a linear system as long as a particular solution is known.&lt;br /&gt;
&lt;br /&gt;
在数学中，'''非线性系统 Nonlinear System'''是指系统不是线性的——也就是说，一个不满足叠加原理的系统。更通俗地说，非线性系统是待求解变量不能被写成其独立分量的线性和的系统。非齐次系统根据定义严格来说是非线性的，除了它的自变量&amp;lt;font color='red'&amp;gt;&amp;lt;s&amp;gt;包含&amp;lt;s&amp;gt;&amp;lt;/font&amp;gt;函数以外其他部分都是线性的。但非齐次系统通常与线性系统一起研究，因为只要知道特解，它们就可以转化为线性系统。&lt;br /&gt;
&lt;br /&gt;
== Related fields 相关领域==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Arithmetic dynamics 算术动态系统===&lt;br /&gt;
&lt;br /&gt;
:[[Arithmetic dynamics]] is a field that emerged in the 1990s that amalgamates two areas of mathematics, [[dynamical systems]] and [[number theory]]. Classically, discrete dynamics refers to the study of the [[Iterated function|iteration]] of self-maps of the [[complex plane]] or [[real line]]. Arithmetic dynamics is the study of the number-theoretic properties of integer, rational, {{math|&amp;lt;var&amp;gt;p&amp;lt;/var&amp;gt;}}-adic, and/or algebraic points under repeated application of a [[polynomial]] or [[rational function]].&lt;br /&gt;
&lt;br /&gt;
Arithmetic dynamics is a field that emerged in the 1990s that amalgamates two areas of mathematics, dynamical systems and number theory. Classically, discrete dynamics refers to the study of the iteration of self-maps of the complex plane or real line. Arithmetic dynamics is the study of the number-theoretic properties of integer, rational, -adic, and/or algebraic points under repeated application of a polynomial or rational function.&lt;br /&gt;
&lt;br /&gt;
'''算术动态系统 Arithmetic Dynamics'''是20世纪90年代出现的一个领域，融合了动力系统和数论这两个数学领域。经典的离散动力学研究复平面或实直线的自映射的迭代。算术动态系统研究内容是在多项式或有理函数中的整数、有理数、并元 --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|存疑]]） 和/或代数点的数论性质。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Chaos theory 混沌理论===&lt;br /&gt;
&lt;br /&gt;
:[[Chaos theory]] describes the behavior of certain [[dynamical system (definition)|dynamical system]]s – that is, systems whose state evolves with time – that may exhibit dynamics that are highly sensitive to initial conditions (popularly referred to as the [[butterfly effect]]). As a result of this sensitivity, which manifests itself as an exponential growth of perturbations in the initial conditions, the behavior of chaotic systems appears [[randomness|random]]. This happens even though these systems are [[deterministic system (philosophy)|deterministic]], meaning that their future dynamics are fully defined by their initial conditions, with no random elements involved. This behavior is known as deterministic chaos, or simply ''chaos''.&lt;br /&gt;
&lt;br /&gt;
Chaos theory describes the behavior of certain dynamical systems – that is, systems whose state evolves with time – that may exhibit dynamics that are highly sensitive to initial conditions (popularly referred to as the butterfly effect). As a result of this sensitivity, which manifests itself as an exponential growth of perturbations in the initial conditions, the behavior of chaotic systems appears random. This happens even though these systems are deterministic, meaning that their future dynamics are fully defined by their initial conditions, with no random elements involved. This behavior is known as deterministic chaos, or simply chaos.&lt;br /&gt;
&lt;br /&gt;
混沌理论描述了某些状态随时间演化的动力系统的行为，这些系统可能表现出对初始条件高度敏感的特点（通常被称为'''蝴蝶效应 Butterfly Effect'''）。由于扰动受初始条件影响而指数增长，因此混沌系统具有敏感性，敏感性使它的行为看起来是随机的。但是这种敏感性也会出现在确定的动力系统中，即未来的动力学完全由它的初始条件定义，没有任何随机因素参与的系统中。这种现象被称为确定性混沌，或简单混沌。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Complex systems 复杂系统===&lt;br /&gt;
&lt;br /&gt;
:[[Complex systems]] is a scientific field that studies the common properties of [[system]]s considered [[Complexity|complex]] in [[nature]], [[society]], and [[science]]. It is also called ''complex systems theory'', ''complexity science'', ''study of complex systems'' and/or ''sciences of complexity''. The key problems of such systems are  difficulties with their formal [[Scientific modelling|modeling]] and [[simulation]]. From such perspective, in different research contexts complex systems are defined on the base of their different attributes.&lt;br /&gt;
&lt;br /&gt;
Complex systems is a scientific field that studies the common properties of systems considered complex in nature, society, and science. It is also called complex systems theory, complexity science, study of complex systems and/or sciences of complexity. The key problems of such systems are  difficulties with their formal modeling and simulation. From such perspective, in different research contexts complex systems are defined on the base of their different attributes.&lt;br /&gt;
&lt;br /&gt;
'''复杂系统 Complex Systems'''是研究自然、社会和科学中复杂现象的共同性质的科学领域。它也被称为复杂系统理论、复杂性科学、复杂系统研究和关于复杂性的科学。这些系统的关键问题在于对系统的形式化建模与仿真。因此，复杂系统是根据在不同的研究语境中的不同属性来定义的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
:The study of complex systems is bringing new vitality to many areas of science where a more typical [[reductionist]] strategy has fallen short. ''Complex systems'' is therefore often used as a broad term encompassing a research approach to problems in many diverse disciplines including [[neurosciences]], [[social sciences]], [[meteorology]], [[chemistry]], [[physics]], [[computer science]], [[psychology]], [[artificial life]], [[evolutionary computation]], [[economics]], earthquake prediction, [[molecular biology]] and inquiries into the nature of living [[cell (biology)|cell]]s themselves.&lt;br /&gt;
&lt;br /&gt;
The study of complex systems is bringing new vitality to many areas of science where a more typical reductionist strategy has fallen short. Complex systems is therefore often used as a broad term encompassing a research approach to problems in many diverse disciplines including neurosciences, social sciences, meteorology, chemistry, physics, computer science, psychology, artificial life, evolutionary computation, economics, earthquake prediction, molecular biology and inquiries into the nature of living cells themselves.&lt;br /&gt;
&lt;br /&gt;
还原论策略已经不足以研究许多科学领域的问题，而复杂系统的研究则为科学带来了广泛的新活力。复杂系统通常被用作一个应用广泛的研究方法术语，并涵盖许多不同的学科，包括神经科学、社会科学、气象学、化学、物理学、计算机科学、心理学、人工生命、进化计算、经济学、地震预测、分子生物学以及对活细胞的研究等。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Control theory 控制理论===&lt;br /&gt;
&lt;br /&gt;
:[[Control theory]] is an interdisciplinary branch of [[engineering]] and [[mathematics]], in part it deals with influencing the behavior of [[dynamical system]]s.&lt;br /&gt;
&lt;br /&gt;
Control theory is an interdisciplinary branch of engineering and mathematics, in part it deals with influencing the behavior of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
'''控制理论 Control Theory'''是工程和数学的一个交叉学科，它的其中一部分研究影响动力系统行为的各种因素。&lt;br /&gt;
&lt;br /&gt;
控制理论是一个研究如何调整动态系统特性的理论，它也是工程和数学的一个交叉学科，逐渐的应用在许多社会科学中，例如心理学、社会学（社会学中的控制理论）、犯罪学及'''金融系统 Financial System'''。控制理论一般的目的是借由控制器的动作让系统稳定，也就是系统维持在设定值，而且不会在设定值附近晃动。设定值一般维持不变的控制称为调节，设定值快速变化，要求跟踪速度加速度等的控制称为伺服。它的其中一部分研究影响动力系统行为的各种因素。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Ergodic theory 遍历理论===&lt;br /&gt;
&lt;br /&gt;
:[[Ergodic theory]] is a branch of [[mathematics]] that studies [[dynamical system]]s with an [[invariant measure]] and related problems. Its initial development was motivated by problems of [[statistical physics]].&lt;br /&gt;
&lt;br /&gt;
Ergodic theory is a branch of mathematics that studies dynamical systems with an invariant measure and related problems. Its initial development was motivated by problems of statistical physics.&lt;br /&gt;
&lt;br /&gt;
'''遍历理论 Ergodic Theory'''是数学的一个分支，研究有不变测度相关问题的动力系统。它最初的发展受到了统计物理学的推动。&lt;br /&gt;
遍历理论是研究保测变换的渐近性态的数学分支。它起源于为统计力学提供基础的&amp;quot;遍历假设&amp;quot;研究，并与动力系统理论、概率论、信息论、泛函分析、数论等数学分支有着密切的联系。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Functional analysis 泛函分析===&lt;br /&gt;
&lt;br /&gt;
:[[Functional analysis]] is the branch of [[mathematics]], and specifically of [[mathematical analysis|analysis]], concerned with the study of [[vector space]]s and [[operator (mathematics)|operator]]s acting upon them. It has its historical roots in the study of [[functional space]]s, in particular transformations of [[function (mathematics)|functions]], such as the [[Fourier transform]], as well as in the study of [[differential equations|differential]] and [[integral equations]]. This usage of the word ''[[functional (mathematics)|functional]]'' goes back to the [[calculus of variations]], implying a function whose argument is a function. Its use in general has been attributed to mathematician and physicist [[Vito Volterra]] and its founding is largely attributed to mathematician [[Stefan Banach]].&lt;br /&gt;
&lt;br /&gt;
Functional analysis is the branch of mathematics, and specifically of analysis, concerned with the study of vector spaces and operators acting upon them. It has its historical roots in the study of functional spaces, in particular transformations of functions, such as the Fourier transform, as well as in the study of differential and integral equations. This usage of the word functional goes back to the calculus of variations, implying a function whose argument is a function. Its use in general has been attributed to mathematician and physicist Vito Volterra and its founding is largely attributed to mathematician Stefan Banach.&lt;br /&gt;
&lt;br /&gt;
'''泛函分析 Functional analysis'''是数学分析的一个分支，研究向量空间和作用于向量空间的算子。它源于对函数空间的研究，特别是对函数变换的研究，例如傅里叶变换，微积分方程的研究等。泛函分析的名称“Functional Analysis”中，“functional”这个词的用法可以追溯到变分法，也就是说函数的参数是一个函数。这个词的使用一般被认为归功于数学家和物理学家Vito Volterra，和数学家Stefan Banach。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Graph dynamical systems 图动力系统===&lt;br /&gt;
&lt;br /&gt;
:The concept of [[graph dynamical system]]s (GDS) can be used to capture a wide range of processes taking place on graphs or networks. A major theme in the mathematical and computational analysis of graph dynamical systems is to relate their structural properties (e.g. the network connectivity) and the global dynamics that result.&lt;br /&gt;
&lt;br /&gt;
The concept of graph dynamical systems (GDS) can be used to capture a wide range of processes taking place on graphs or networks. A major theme in the mathematical and computational analysis of graph dynamical systems is to relate their structural properties (e.g. the network connectivity) and the global dynamics that result.&lt;br /&gt;
&lt;br /&gt;
'''图动力系统 Graph dynamical systems (GDS)'''可以用来描绘图或网络上发生的各种过程。图动力系统的数学和计算分析的一个主要主题是关联它们的结构性质(例如:网络连接)和结构性质造成的网络整体的动态结果。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Projected dynamical systems 投影动力系统===&lt;br /&gt;
&lt;br /&gt;
:[[Projected dynamical systems]] it is a [[mathematics|mathematical]] theory investigating the behaviour of [[dynamical system]]s where solutions are restricted to a constraint set. The discipline shares connections to and applications with both the static world of [[Optimization (mathematics)|optimization]] and [[Equilibrium point|equilibrium]] problems and the dynamical world of [[ordinary differential equations]]. A projected dynamical system is given by the [[flow (mathematics)|flow]] to the projected differential equation.&lt;br /&gt;
&lt;br /&gt;
Projected dynamical systems it is a mathematical theory investigating the behaviour of dynamical systems where solutions are restricted to a constraint set. The discipline shares connections to and applications with both the static world of optimization and equilibrium problems and the dynamical world of ordinary differential equations. A projected dynamical system is given by the flow to the projected differential equation.&lt;br /&gt;
&lt;br /&gt;
'''投影动力系统 Projected Dynamical Systems'''是研究解在一个约束集内的动力系统行为的数学理论。这门学科与静态世界中的最优化和平衡问题以及动态世界中的常微分方程都有联系，并且都有相互联系的应用。一个投影动力系统是由投影微分方程的'''流形 flow'''给定的。&lt;br /&gt;
通过对投影微分方程的流分析，给出了一个投影动力系统的表达式：&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\frac{dx(t)}{dt} = \Pi_K(x(t),-F(x(t)))&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中K为约束集。这种形式的微分方程因具有不连续的向量场而值得注意。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Symbolic dynamics 符号动力学===&lt;br /&gt;
&lt;br /&gt;
:[[Symbolic dynamics]] is the practice of modelling a topological or smooth [[dynamical system]] by a discrete space consisting of infinite [[sequence]]s of abstract symbols, each of which corresponds to a state of the system, with the dynamics (evolution) given by the [[shift operator]].&lt;br /&gt;
&lt;br /&gt;
Symbolic dynamics is the practice of modelling a topological or smooth dynamical system by a discrete space consisting of infinite sequences of abstract symbols, each of which corresponds to a state of the system, with the dynamics (evolution) given by the shift operator.&lt;br /&gt;
&lt;br /&gt;
'''符号动力学 Symbolic Dynamics'''是通过一个由抽象符号的无限序列组成的离散空间建立一个拓扑或光滑动力系统的方法。每一个抽象符号的无限序列序列对应于系统的一个状态，并由移位算子给出动力学(演化)。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== System dynamics 系统动力学===&lt;br /&gt;
&lt;br /&gt;
:[[System dynamics]] is an approach to understanding the behaviour of systems over time.  It deals with internal feedback loops and time delays that affect the behaviour and state of the entire system.&amp;lt;ref name=&amp;quot;sysdyn&amp;quot;&amp;gt;[http://sysdyn.clexchange.org MIT System Dynamics in Education Project (SDEP)&amp;lt;!-- Bot generated title --&amp;gt;] {{webarchive|url=https://web.archive.org/web/20080509163801/http://sysdyn.clexchange.org/ |date=2008-05-09 }}&amp;lt;/ref&amp;gt;  What makes using system dynamics different from other approaches to studying systems is the use of [[feedback]] loops and [[Stock and flow|stocks and flows]].  These elements help describe how even seemingly simple systems display baffling [[nonlinearity]].&lt;br /&gt;
&lt;br /&gt;
System dynamics is an approach to understanding the behaviour of systems over time.  It deals with internal feedback loops and time delays that affect the behaviour and state of the entire system.  What makes using system dynamics different from other approaches to studying systems is the use of feedback loops and stocks and flows.  These elements help describe how even seemingly simple systems display baffling nonlinearity.&lt;br /&gt;
&lt;br /&gt;
'''系统动力学 System Dynamics'''是一种理解系统随时间变化行为的方法。它是用来处理影响整个系统行为和状态的内部反馈回路和时间延迟的方法。系统动力学不同于其他系统研究方法的地方在于它使用了反馈环、股票（stocks）和流形（flows）--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|如何翻译stocks 和 folows]]）的元素。这些元素有助于描述看似简单的系统如何显示复杂的非线性行为。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Topological dynamics 拓扑动力学===&lt;br /&gt;
&lt;br /&gt;
:[[Topological dynamics]] is a branch of the theory of dynamical systems in which qualitative, asymptotic properties of dynamical systems are studied from the viewpoint of [[general topology]].&lt;br /&gt;
&lt;br /&gt;
Topological dynamics is a branch of the theory of dynamical systems in which qualitative, asymptotic properties of dynamical systems are studied from the viewpoint of general topology.&lt;br /&gt;
&lt;br /&gt;
'''拓扑动力学 Topological Dynamics'''是动力系统理论的一个分支。在拓朴动力学中，动力系统的定性性质和渐近性质是从一般拓扑学的观点来研究的。&lt;br /&gt;
&lt;br /&gt;
== Applications 应用==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== In human development 在人类发展中的应用===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In [[Developmental psychology|human development]], dynamical systems theory has been used to enhance and simplify Erik Erikson's [[eight stages of psychosocial development]] and offers a standard method of examining the universal pattern of human development. This method is based on the self-organizing and [[fractal]] properties of the [[Fibonacci sequence]].&amp;lt;ref name=Sacco&amp;gt;{{cite journal|last=Sacco|first=R.G.|title=Re-envisaging the eight developmental stages of Erik Erikson: The Fibonacci Life-Chart Method (FLCM)|journal=Journal of Educational and Developmental Psychology|date=2013|volume=3|issue=1|pages=140–146|doi=10.5539/jedp.v3n1p140|doi-access=free}}&amp;lt;/ref&amp;gt; Using mathematical modeling, a natural progression of human development with eight life stages has been identified:  early infancy (0–2 years), toddler (2–4 years), early childhood (4–7 years), middle childhood (7–11 years), adolescence (11–18 years), young adulthood (18–29 years), middle adulthood (29–48 years), and older adulthood (48–78+ years).&amp;lt;ref name=Sacco/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In human development, dynamical systems theory has been used to enhance and simplify Erik Erikson's eight stages of psychosocial development and offers a standard method of examining the universal pattern of human development. This method is based on the self-organizing and fractal properties of the Fibonacci sequence. Using mathematical modeling, a natural progression of human development with eight life stages has been identified:  early infancy (0–2 years), toddler (2–4 years), early childhood (4–7 years), middle childhood (7–11 years), adolescence (11–18 years), young adulthood (18–29 years), middle adulthood (29–48 years), and older adulthood (48–78+ years).&lt;br /&gt;
&lt;br /&gt;
在人类发展方面，动力系统理论已经被用来增强和简化 Erik Erikson 的'''社会心理发展8阶段理论 Eight Stages of Psychosocial Development'''，并提供了一个检验人类发展普遍模式的标准方法。该方法基于斐波那契数列的'''自组织性 self-organizing'''和'''分形 Fractal''' 特性。利用数学模型，人类发展的自然进程被分为8个生命阶段: 早期婴儿期(0-2岁)、幼儿期(2-4岁)、童年早期(4-7岁)、童年中期(7-11岁)、青春期(11-18岁)、成年早期(18-29岁)、成年中期(29-48岁)和老年成年期(48-78岁及以上)。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
According to this model, stage transitions between age intervals represent self-organization processes at multiple levels (e.g., molecules, genes, cell, organ, organ system, organism, behavior, and environment). For example, at the stage transition from [[adolescence]] to [[young adulthood]], and after reaching the critical point of 18 years of age (young adulthood), a peak in [[testosterone]] is observed in males&amp;lt;ref&amp;gt;{{cite journal |last1=Kelsey |first1=T. W. |title=A validated age-related normative model for male total testosterone shows increasing variance but no decline after age 40 years. |journal=PLOS One |volume=9 |issue=10 |pages=e109346 |doi=10.1371/journal.pone.0109346|pmid=25295520 |year=2014 |pmc=4190174 |bibcode=2014PLoSO...9j9346K }}&amp;lt;/ref&amp;gt; and the period of optimal [[fertility]] begins in females.&amp;lt;ref&amp;gt;{{cite book |last1=Tulandi |first1=T. |title=Preservation of fertility |date=2004 |publisher=Taylor &amp;amp; Francis |pages=1–20}}&amp;lt;/ref&amp;gt; Similarly, at age 30 optimal fertility begins to decline in females,&amp;lt;ref name=&amp;quot;Social Science 2008&amp;quot;&amp;gt;{{cite journal |last1=Blanchflower |first1=D. G. |title=Is well-being U-shaped over the life cycle? |journal=Social Science &amp;amp; Medicine |volume=66 |issue=8 |pages=1733–1749 |doi=10.1016/j.socscimed.2008.01.030|pmid=18316146 |year=2008 |citeseerx=10.1.1.63.5221 }}&amp;lt;/ref&amp;gt; and at the stage transition from [[middle adulthood]] to older adulthood at 48 years, the average age of onset of [[menopause]] occurs.&amp;lt;ref name=&amp;quot;Social Science 2008&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
According to this model, stage transitions between age intervals represent self-organization processes at multiple levels (e.g., molecules, genes, cell, organ, organ system, organism, behavior, and environment). For example, at the stage transition from adolescence to young adulthood, and after reaching the critical point of 18 years of age (young adulthood), a peak in testosterone is observed in males and the period of optimal fertility begins in females. Similarly, at age 30 optimal fertility begins to decline in females, and at the stage transition from middle adulthood to older adulthood at 48 years, the average age of onset of menopause occurs.&lt;br /&gt;
&lt;br /&gt;
根据这个模型，年龄的阶段转换代表了多层次的自组织过程(例如，分子、基因、细胞、器官、器官系统、生物体、行为和环境)。例如，在从青春期向成年早期过渡的阶段中，在达到18岁这一关键年龄之后，男性的睾丸激素达到高峰，女性的最佳生育期开始。同样，在30岁时，女性的最佳生育能力开始下降；在从成年中期过渡到老年成年期时，48岁是绝经的平均年龄。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
These events are physical bioattractors of aging from the perspective of Fibonacci mathematical modeling and dynamically systems theory. In practical terms, prediction in human development becomes possible in the same statistical sense in which the average temperature or precipitation at different times of the year can be used for [[weather forecasting]]. Each of the predetermined stages of human development follows an optimal epigenetic biological pattern. This phenomenon can be explained by the occurrence of Fibonacci numbers in biological [[DNA]]&amp;lt;ref&amp;gt;{{cite journal |last1=Perez |first1=J. C. (2010). |title=Codon populations in single-stranded whole human genome DNA are fractal and fine-tuned by the Golden Ratio 1.618. |journal=Interdisciplinary Sciences: Computational Life Sciences |volume=2 |issue=3 |pages=228–240 |doi=10.1007/s12539-010-0022-0|pmid=20658335 |year=2010 }}&amp;lt;/ref&amp;gt; and self-organizing properties of the Fibonacci numbers that converge on the [[golden ratio]].&lt;br /&gt;
&lt;br /&gt;
These events are physical bioattractors of aging from the perspective of Fibonacci mathematical modeling and dynamically systems theory. In practical terms, prediction in human development becomes possible in the same statistical sense in which the average temperature or precipitation at different times of the year can be used for weather forecasting. Each of the predetermined stages of human development follows an optimal epigenetic biological pattern. This phenomenon can be explained by the occurrence of Fibonacci numbers in biological DNA and self-organizing properties of the Fibonacci numbers that converge on the golden ratio.&lt;br /&gt;
&lt;br /&gt;
从斐波那契数学模型和动力系统理论的角度来看，上述事件是衰老的'''物理生物吸引子Physical Bioattractors'''。实际上，正如一年中不同时间的平均气温和降水量可以用来预测天气，预测人类的发展在统计意义上同样是可能的。人类发展的每个'''预定阶段Predetermined Stages'''都遵循最佳的'''表观遗传生物模式 Epigenetic Biological Pattern'''。这种现象可以用 DNA 中的斐波那契数和收敛于黄金分割比的斐波那契数的自组织特性来解释。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== In biomechanics 在运动生物力学中的应用===&lt;br /&gt;
&lt;br /&gt;
In [[sports biomechanics]], dynamical systems theory has emerged in the movement sciences as a viable framework for modeling athletic performance. From a dynamical systems perspective, the human movement system is a highly intricate network of co-dependent sub-systems (e.g. respiratory, circulatory, nervous, skeletomuscular, perceptual) that are composed of a large number of interacting components (e.g. blood cells, oxygen molecules, muscle tissue, metabolic enzymes, connective tissue and bone). In dynamical systems theory, movement patterns emerge through generic processes of self-organization found in physical and biological systems.&amp;lt;ref&amp;gt;Paul S Glazier, Keith Davids, Roger M Bartlett (2003). [http://www.sportsci.org/jour/03/psg.htm &amp;quot;DYNAMICAL SYSTEMS THEORY: a Relevant Framework for Performance-Oriented Sports Biomechanics Research&amp;quot;]. in: Sportscience 7. Accessed 2008-05-08.&amp;lt;/ref&amp;gt; There is no research validation of any of the claims associated to the conceptual application of this framework.&lt;br /&gt;
&lt;br /&gt;
In sports biomechanics, dynamical systems theory has emerged in the movement sciences as a viable framework for modeling athletic performance. From a dynamical systems perspective, the human movement system is a highly intricate network of co-dependent sub-systems (e.g. respiratory, circulatory, nervous, skeletomuscular, perceptual) that are composed of a large number of interacting components (e.g. blood cells, oxygen molecules, muscle tissue, metabolic enzymes, connective tissue and bone). In dynamical systems theory, movement patterns emerge through generic processes of self-organization found in physical and biological systems. There is no research validation of any of the claims associated to the conceptual application of this framework.&lt;br /&gt;
&lt;br /&gt;
在运动生物力学中，动力系统理论新兴地成为对运动表现建模的可行框架。从动力系统的角度来看，人类的运动系统是由高度复杂和相互依赖的子系统网络（如呼吸、循环、神经、骨骼肌系统和知觉系统等）组成的，它们由大量相互作用的部分组成（包括血细胞、氧分子、肌肉组织、代谢酶、结缔组织和骨骼等)。动力系统理论中，运动模式通过物理系统和生物系统中的一般自组织过程出现。没有任何研究证实与这一框架的概念相关的任何主张。&lt;br /&gt;
&lt;br /&gt;
=== In cognitive science 在认知科学中的应用===&lt;br /&gt;
&lt;br /&gt;
Dynamical system theory has been applied in the field of [[neurodynamics|neuroscience]] and [[cognitive science|cognitive development]], especially in [[the neo-Piagetian theories of cognitive development]]. It is the belief that cognitive development is best represented by physical theories rather than theories based on syntax and [[AI]]. It also believed that differential equations are the most appropriate tool for modeling human behavior. These equations are interpreted to represent an agent's cognitive trajectory through [[state space]]. In other words, dynamicists argue that [[psychology]] should be (or is) the description (via differential equations) of the cognitions and behaviors of an agent under certain environmental and internal pressures. The language of chaos theory is also frequently adopted.&lt;br /&gt;
&lt;br /&gt;
Dynamical system theory has been applied in the field of neuroscience and cognitive development, especially in the neo-Piagetian theories of cognitive development. It is the belief that cognitive development is best represented by physical theories rather than theories based on syntax and AI. It also believed that differential equations are the most appropriate tool for modeling human behavior. These equations are interpreted to represent an agent's cognitive trajectory through state space. In other words, dynamicists argue that psychology should be (or is) the description (via differential equations) of the cognitions and behaviors of an agent under certain environmental and internal pressures. The language of chaos theory is also frequently adopted.&lt;br /&gt;
&lt;br /&gt;
动力系统理论已经被应用于神经科学和认知发展领域，特别是在认知发展的'''新皮亚杰学派 neo-Piagetian'''中。人们相信，物理学理论比句法学理论和人工智能理论更能代表认知发展。人们还相信微分方程是人类行为建模最合适的工具。人们认为微分方程可以解释为通过状态空间代表一个主体的认知轨迹的算式。换句话说，动力学家认为心理学应该(或者是)(通过微分方程)描述在一定的环境和内部压力下的主体的认知和行为的学科。混沌理论在相关领域也经常被采用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In it, the learner's mind reaches a state of disequilibrium where old patterns have broken down. This is the phase transition of cognitive development. [[Self-organization]] (the spontaneous creation of coherent forms) sets in as activity levels link to each other. Newly formed macroscopic and microscopic structures support each other, speeding up the process. These links form the structure of a new state of order in the mind through a process called ''scalloping'' (the repeated building up and collapsing of complex performance.) This new, novel state is progressive, discrete, idiosyncratic and unpredictable.&amp;lt;ref&amp;gt;{{cite journal|title=The Promise of Dynamic Systems Approaches for an Integrated Account of Human Development|journal=Child Development|date=2000-02-25|first=Mark D.|last=Lewis|volume=71|issue=1|pages=36–43|id= |url=http://home.oise.utoronto.ca/~mlewis/Manuscripts/Promise.pdf|accessdate=2008-04-04|doi=10.1111/1467-8624.00116|pmid=10836556 |citeseerx=10.1.1.72.3668}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In it, the learner's mind reaches a state of disequilibrium where old patterns have broken down. This is the phase transition of cognitive development. Self-organization (the spontaneous creation of coherent forms) sets in as activity levels link to each other. Newly formed macroscopic and microscopic structures support each other, speeding up the process. These links form the structure of a new state of order in the mind through a process called scalloping (the repeated building up and collapsing of complex performance.) This new, novel state is progressive, discrete, idiosyncratic and unpredictable.&lt;br /&gt;
&lt;br /&gt;
在学习的过程中，旧的模式被打破了，学习者的思维达到了一种不平衡的状态。这是认知发展的阶段性转变。自组织(连贯的自发创造(the spontaneous creation of coherent forms))在'''活动水平 Activity Levels'''相互联系时产生。新形成的宏观和微观结构相互支持，加速了这一过程。这些联系在头脑中形成了一种具有新状态的结构，这个过程被称为“扇贝化 Scalloping”，也就是头脑的复杂性能的不断累积和崩溃的过程 --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|扇贝化的翻译拿不准，这句话的描述比较抽象]]）。这种新的状态是渐进的、离散的、异质的的和不可预知的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Dynamic systems theory has recently been used to explain a long-unanswered problem in child development referred to as the [[A-not-B error]].&amp;lt;ref&amp;gt;{{cite journal|title=Development as a dynamic system|journal=Trends in Cognitive Sciences|date=2003-07-30|first=Linda B.|last=Smith|author2=Esther Thelen|volume=7|issue=8|pages=343–8|id= |url=http://www.indiana.edu/~cogdev/labwork/dynamicsystem.pdf|accessdate=2008-04-04|doi=10.1016/S1364-6613(03)00156-6|pmid=12907229|citeseerx=10.1.1.294.2037}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Dynamic systems theory has recently been used to explain a long-unanswered problem in child development referred to as the A-not-B error.&lt;br /&gt;
&lt;br /&gt;
动力系统理论最近还被用来解释儿童发展中一个长期没有答案的问题，即 A-not-B 错误。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===In second language development 在二语习得中的应用===&lt;br /&gt;
&lt;br /&gt;
{{Main|Dynamic approach to second language development}}&lt;br /&gt;
&lt;br /&gt;
The application of Dynamic Systems Theory to study [[second language acquisition]] is attributed to [[Diane Larsen-Freeman]] who published an article in 1997 in which she claimed that [[second language acquisition]] should be viewed as a developmental process which includes [[language attrition]] as well as language acquisition.&amp;lt;ref&amp;gt;{{cite web|url=https://academic.oup.com/applij/article-abstract/18/2/141/134192|title=Chaos/Complexity Science and Second Language Acquisition|date=1997|publisher=Applied Linguistics}}&amp;lt;/ref&amp;gt; In her article she claimed that language should be viewed as a dynamic system which is dynamic, complex, nonlinear, chaotic, unpredictable, sensitive to initial conditions, open, self-organizing, feedback sensitive, and adaptive.&lt;br /&gt;
&lt;br /&gt;
The application of Dynamic Systems Theory to study second language acquisition is attributed to Diane Larsen-Freeman who published an article in 1997 in which she claimed that second language acquisition should be viewed as a developmental process which includes language attrition as well as language acquisition. In her article she claimed that language should be viewed as a dynamic system which is dynamic, complex, nonlinear, chaotic, unpredictable, sensitive to initial conditions, open, self-organizing, feedback sensitive, and adaptive.&lt;br /&gt;
&lt;br /&gt;
动力系统理论在二语习得研究中的应用归功于 Diane Larsen-Freeman，她在1997年发表的一篇文章中认为，二语习得应该被看作是一个包括语言流失和习得在内的发展过程。她在文章中认为，语言应该被看作是一个动态的、复杂的、非线性的、混沌的、不可预知的、对初始条件敏感的、开放的、自组织的、反馈敏感的和适应性的动力系统。&lt;br /&gt;
&lt;br /&gt;
== See also 参见==&lt;br /&gt;
&lt;br /&gt;
;Related subjects&lt;br /&gt;
&lt;br /&gt;
Related subjects&lt;br /&gt;
&lt;br /&gt;
相关科目&lt;br /&gt;
&lt;br /&gt;
{{div col|colwidth=20em}}&lt;br /&gt;
&lt;br /&gt;
* [[List of dynamical system topics]] 动力系统主题清单&lt;br /&gt;
&lt;br /&gt;
* [[Baker's map]]&lt;br /&gt;
&lt;br /&gt;
* [[Biological applications of bifurcation theory]] 分支理论的生物学应用&lt;br /&gt;
&lt;br /&gt;
* [[Dynamical system (definition)]] 动力系统（定义）&lt;br /&gt;
&lt;br /&gt;
* [[Embodied Embedded Cognition]] 具身认知&lt;br /&gt;
&lt;br /&gt;
* [[Fibonacci numbers]] 斐波那契数&lt;br /&gt;
&lt;br /&gt;
* [[Fractals]] 分形&lt;br /&gt;
&lt;br /&gt;
* [[Gingerbreadman map]]&lt;br /&gt;
&lt;br /&gt;
* [[Halo orbit]] Halo 轨道&lt;br /&gt;
&lt;br /&gt;
* [[List of types of systems theory]] 动力系统类型清单&lt;br /&gt;
&lt;br /&gt;
* [[Oscillation]] 振动性&lt;br /&gt;
&lt;br /&gt;
* [[Postcognitivism]]&lt;br /&gt;
&lt;br /&gt;
* [[Recurrent neural network]] 递归神经网络&lt;br /&gt;
&lt;br /&gt;
* [[Combinatorics and dynamical systems]] 组合数学和动力系统&lt;br /&gt;
&lt;br /&gt;
* [[Synergetics (Haken)|Synergetics]] 协同学(Haken)&lt;br /&gt;
&lt;br /&gt;
* [[Systemography]]&lt;br /&gt;
&lt;br /&gt;
{{div col end}}&lt;br /&gt;
&lt;br /&gt;
;Related scientists&lt;br /&gt;
&lt;br /&gt;
Related scientists&lt;br /&gt;
&lt;br /&gt;
相关科学家&lt;br /&gt;
&lt;br /&gt;
{{div col|colwidth=20em}}&lt;br /&gt;
&lt;br /&gt;
* [[People in systems and control]]&lt;br /&gt;
&lt;br /&gt;
* [[Dmitri Anosov]]&lt;br /&gt;
&lt;br /&gt;
* [[Vladimir Arnold]]&lt;br /&gt;
&lt;br /&gt;
* [[Nikolay Bogolyubov]]&lt;br /&gt;
&lt;br /&gt;
* [[Andrey Kolmogorov]]&lt;br /&gt;
&lt;br /&gt;
* [[Nikolay Mitrofanovich Krylov|Nikolay Krylov]]&lt;br /&gt;
&lt;br /&gt;
* [[Jürgen Moser]]&lt;br /&gt;
&lt;br /&gt;
* [[Yakov G. Sinai]]&lt;br /&gt;
&lt;br /&gt;
* [[Stephen Smale]]&lt;br /&gt;
&lt;br /&gt;
* [[Hillel Furstenberg]]&lt;br /&gt;
&lt;br /&gt;
* [[Grigory Margulis]]&lt;br /&gt;
&lt;br /&gt;
* [[Elon Lindenstrauss]]&lt;br /&gt;
&lt;br /&gt;
{{div col end}}&lt;br /&gt;
&lt;br /&gt;
== Notes 参考资料==&lt;br /&gt;
&lt;br /&gt;
{{reflist}}&lt;br /&gt;
&lt;br /&gt;
== Further reading 拓展阅读==&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Frederick D. |last1=Abraham |first2=Ralph |last2=Abraham |authorlink2=Ralph Abraham (mathematician)|first3=Christopher D. |last3=Shaw |title=A Visual Introduction to Dynamical Systems Theory for Psychology |url=https://books.google.com/books?id=oMbaAAAAMAAJ |year=1990 |publisher=Aerial Press |isbn=978-0-942344-09-7 |oclc=24345312}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=Edward J. |last=Beltrami |title=Mathematics for Dynamic Modeling |url=https://books.google.com/books?id=MmoiJPsuFW8C |year=1998 |publisher=Academic Press |isbn=978-0-12-085566-7 |edition=2nd |oclc=36713294}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=Otomar |last=Hájek |title=Dynamical systems in the plane |url=https://books.google.com/books?id=czhPAQAAIAAJ |year=1968 |publisher=Academic Press |oclc=343328 |authorlink=Otomar Hájek |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=David G. |last=Luenberger |title=Introduction to dynamic systems: theory, models, and applications |url=https://books.google.com/books?id=mvlQAAAAMAAJ |year=1979 |publisher=Wiley |isbn=978-0-471-02594-8 |oclc=4195122 |authorlink=David Luenberger |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Anthony |last1=Michel |author2=Kaining Wang |author3=Bo Hu |title=Qualitative Theory of Dynamical Systems |url=https://books.google.com/books?id=ZPGBnZGV2_cC |year=2001 |publisher=Taylor &amp;amp; Francis |isbn=978-0-8247-0526-8 |oclc=45873628}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Louis |last1=Padulo |first2=Michael A. |last2=Arbib |authorlink2=Michael A. Arbib |title=System theory: a unified state-space approach to continuous and discrete systems |url=https://books.google.com/books?id=6UPvAAAAMAAJ |year=1974 |publisher=Saunders |isbn=9780721670355 |oclc=947600 |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |first=Steven H. |last=Strogatz |title=Nonlinear Dynamics and Chaos: With Applications to Physics, Biology, Chemistry, and Engineering |year=1994 |publisher=Addison Wesley |isbn=978-0-7382-0453-6 |oclc=49839504 |authorlink=Steven Strogatz |ref=harv |url-access=registration |url=https://archive.org/details/nonlineardynamic00stro }}&lt;br /&gt;
&lt;br /&gt;
== External links 外部链接==&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20080613053119/http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html Dynamic Systems 动力系统] Encyclopedia of Cognitive Science entry. --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|这是一个嵌套的链接，但好像只能鼠标点击并超链接到内嵌的那个]]）认知科学百科全书&lt;br /&gt;
&lt;br /&gt;
*[http://mathworld.wolfram.com/DynamicalSystem.html Definition of dynamical system 动力系统的定义] in MathWorld. 在MathWorld.wolfram.com储存的定义&lt;br /&gt;
&lt;br /&gt;
*[http://www.dynamicalsystems.org/ DSWeb] Dynamical Systems Magazine 动力系统杂志&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Areas of mathematics | state=collapsed}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:Dynamical systems]]&lt;br /&gt;
&lt;br /&gt;
Category:Dynamical systems&lt;br /&gt;
&lt;br /&gt;
类别: 动力系统&lt;br /&gt;
&lt;br /&gt;
[[Category:Complex systems theory]]&lt;br /&gt;
&lt;br /&gt;
Category:Complex systems theory&lt;br /&gt;
&lt;br /&gt;
范畴: 复杂系统理论&lt;br /&gt;
&lt;br /&gt;
[[Category:Computational fields of study]]&lt;br /&gt;
&lt;br /&gt;
Category:Computational fields of study&lt;br /&gt;
&lt;br /&gt;
类别: 研究的计算领域&lt;br /&gt;
&lt;br /&gt;
&amp;lt;noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;small&amp;gt;This page was moved from [[wikipedia:en:Dynamical systems theory]]. Its edit history can be viewed at [[动力系统/edithistory]]&amp;lt;/small&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:待整理页面]]&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
===书籍推荐===&lt;br /&gt;
====[https://www.amazon.co.uk/Chaos-Making-Science-James-Gleick/dp/0749386061 Chaos: Making a New Science]====&lt;br /&gt;
The million-copy bestseller by National Book Award nominee and Pulitzer Prize finalist James Gleick—the author of Time Travel: A History—that reveals the science behind chaos theory。&lt;br /&gt;
Very readable, focuses on the scientists and mathematicians behind many of the key results in chaos.&lt;br /&gt;
本书由普利茨奖获得者James Gleick撰写。它是一本易读科普书籍，侧重介绍对混沌概念的发展做出重大贡献的科学家和数学家们。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://www.amazon.com/dp/0199566445/ref=cm_sw_su_dp Chaos and Fractals: An Elementary Introduction]====&lt;br /&gt;
This book provides the reader with an elementary introduction to chaos and fractals, suitable for students with a background in elementary algebra, without assuming prior coursework in calculus or physics. &lt;br /&gt;
这是一本关于混沌和分形的入门书籍。读者需要有一定的线性代数基础，但是不需要有微积分或物理学的基础。&lt;br /&gt;
&lt;br /&gt;
====[https://www.amazon.co.uk/Chaos-Very-Short-Introduction-Introductions/dp/0192853783/ref=pd_lpo_14_img_1/257-2017232-0516612?_encoding=UTF8&amp;amp;pd_rd_i=0192853783&amp;amp;pd_rd_r=eebee69a-fad3-43e3-bbeb-b883f2c59bf5&amp;amp;pd_rd_w=g6knH&amp;amp;pd_rd_wg=sx6z5&amp;amp;pf_rd_p=7b8e3b03-1439-4489-abd4-4a138cf4eca6&amp;amp;pf_rd_r=YTB0XXCR2DM8049PYP1Y&amp;amp;psc=1&amp;amp;refRID=YTB0XXCR2DM8049PYP1Y 牛津通识读本: Chaos]====&lt;br /&gt;
This book would not have been possible without my parents, of course, but I owe a greater debt than most to their faith, doubt, and hope, and to the love and patience of a, b, and c. Professionally my greatest debt is to Ed Spiegel, a father of chaos and my thesis Professor, mentor, and friend.&lt;br /&gt;
本书隶属于牛津通识读本系列。该书由Ed Spiegel的学生Leonard Smith撰写，语言生动简明。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
===集智课程推荐===&lt;br /&gt;
====[https://campus.swarma.org/course/1655 圣塔菲课程：Introduction to Dynamical Systems and Chaos]====&lt;br /&gt;
本课程中，主要介绍动力学系统和混沌系统，您将学到'''蝴蝶效应 Butterfly effect'''、'''奇异吸引子 Attractors'''等基本概念，以及如何应用于您感兴趣的领域。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://campus.swarma.org/course/1641 动力系统分析]====&lt;br /&gt;
本课程主要讲授连续和离散动力系统的定态、极限环及其稳定性分析、动力学系统的结构稳定性和常见的分支类型以及分析方法，混沌概念等。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E5%8A%A8%E5%8A%9B%E7%B3%BB%E7%BB%9F%E7%90%86%E8%AE%BA_Dynamical_Systems_Theory&amp;diff=10184</id>
		<title>动力系统理论 Dynamical Systems Theory</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E5%8A%A8%E5%8A%9B%E7%B3%BB%E7%BB%9F%E7%90%86%E8%AE%BA_Dynamical_Systems_Theory&amp;diff=10184"/>
		<updated>2020-07-11T15:18:54Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。&lt;br /&gt;
&lt;br /&gt;
{{Use dmy dates|date=May 2019|cs1-dates=y}}&lt;br /&gt;
&lt;br /&gt;
'''Dynamical systems theory''' is an area of [[mathematics]] used to describe the behavior of the  [[complex systems|complex]] [[dynamical system]]s, usually by employing [[differential equations]] or [[difference equations]]. When differential equations are employed, the theory is called [[continuous time|''continuous dynamical systems'']]. From a physical point of view, continuous dynamical systems is a generalization of [[classical mechanics]], a generalization where the [[equations of motion]] are postulated directly and are not constrained to be [[Euler–Lagrange equation]]s of a [[Principle of least action|least action principle]]. When difference equations are employed, the theory is called [[discrete time|''discrete dynamical systems'']]. When the time variable runs over a set that is discrete over some intervals and continuous over other intervals or is any arbitrary time-set such as a [[cantor set]], one gets [[dynamic equations on time scales]]. Some situations may also be modeled by mixed operators, such as [[differential-difference equations]].&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory is an area of mathematics used to describe the behavior of the  complex dynamical systems, usually by employing differential equations or difference equations. When differential equations are employed, the theory is called continuous dynamical systems. From a physical point of view, continuous dynamical systems is a generalization of classical mechanics, a generalization where the equations of motion are postulated directly and are not constrained to be Euler–Lagrange equations of a least action principle. When difference equations are employed, the theory is called discrete dynamical systems. When the time variable runs over a set that is discrete over some intervals and continuous over other intervals or is any arbitrary time-set such as a cantor set, one gets dynamic equations on time scales. Some situations may also be modeled by mixed operators, such as differential-difference equations.&lt;br /&gt;
&lt;br /&gt;
  &lt;br /&gt;
'''动力系统理论 Dynamical Systems Theory'''是一个用来描述复杂动力系统行为的数学领域，通常使用微分方程或差分方程。当采用微分方程时，该理论被称为连续动力系统。从物理学的角度来看，连续动力系统是经典力学的推广，也是运动方程的推广，不受极小作用原理Euler–Lagrange方程的约束。当采用差分方程时，该理论被称为离散动力系统。&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;当时间变量在一个离散的集合上运行，在另一个离散的集合上连续，或者像cantor集一样在任意的时间集合上运行时，人们就能得到时间尺度上的动力方程。&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 当时间变量运行在一个某些区间离散、其他区间连续的集合、或者像cantor集一样任意的时间集合上时，人们就能得到时间尺度上的动力方程。&amp;lt;/font&amp;gt;&lt;br /&gt;
&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;'''算子 Operators'''是一个函数空间到函数空间上的映射O：X→X，广义的讲，对任何函数进行某一项操作都可以认为是一个算子，如求幂次、求微分等。&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;这句话的英文原文在哪里？&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;动力系统的有些情况也可以用'''混合算子 Mixed Operators'''来建模，如微分-差分方程。&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 某些情况下，也可以用'''混合算子 Mixed Operators'''来建模，如微分-差分方程。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This theory deals with the long-term qualitative behavior of dynamical systems, and studies the nature of, and when possible the solutions of, the [[equations of motion]] of systems that are often primarily [[mechanics|mechanical]] or otherwise physical in nature, such as [[planetary orbit]]s and the behaviour of [[electronic circuit]]s, as well as systems that arise in [[biology]], [[economics]], and elsewhere. Much of modern research is focused on the study of [[chaotic system]]s.&lt;br /&gt;
&lt;br /&gt;
This theory deals with the long-term qualitative behavior of dynamical systems, and studies the nature of, and when possible the solutions of, the equations of motion of systems that are often primarily mechanical or otherwise physical in nature, such as planetary orbits and the behaviour of electronic circuits, as well as systems that arise in biology, economics, and elsewhere. Much of modern research is focused on the study of chaotic systems.&lt;br /&gt;
&lt;br /&gt;
这个理论处理动力系统的&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;长期定性行为。如果能够得到解的话，还可以研究系统的运动方程。这些方程通常运用到机械或物理研究领域，如行星轨道和电子电路，以及出现在生物学，经济学和其他地方的系统。&amp;lt;/font&amp;gt;现代的研究大多集中在对混沌系统的研究上。&lt;br /&gt;
&lt;br /&gt;
&amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;这个理论处理动力系统的长周期性的行为，并且研究系统的动力方程的规律，努力求得可能的解。这些系统通常是一些自然领域里的机械系统或其他物理系统，例如行星轨道和电子电路，也包括一些生物学、经济学和其他学科里的系统。现代的研究大多集中在对混沌系统的研究上。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This field of study is also called just ''dynamical systems'', ''mathematical dynamical systems theory'' or the ''mathematical theory of dynamical systems''.&lt;br /&gt;
&lt;br /&gt;
This field of study is also called just dynamical systems, mathematical dynamical systems theory or the mathematical theory of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
这个研究领域也被称为动力系统，数学动力系统理论或动力系统的数学理论。&lt;br /&gt;
&lt;br /&gt;
[[Image:Lorenz attractor yb.svg|thumb|240px|right|The [[Lorenz attractor]] is an example of a [[non-linear]] dynamical system. Studying this system helped give rise to [[chaos theory]].]]&lt;br /&gt;
&lt;br /&gt;
The [[Lorenz attractor is an example of a non-linear dynamical system. Studying this system helped give rise to chaos theory.]]&lt;br /&gt;
&lt;br /&gt;
'''洛伦兹吸引子 Lorenz Attractor'''是非线性动力系统的一个例子。对这个系统的研究产生了混沌理论。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Overview 综述 ==&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory and [[chaos theory]] deal with the long-term qualitative behavior of [[dynamical system]]s. Here, the focus is not on finding precise solutions to the equations defining the dynamical system (which is often hopeless), but rather to answer questions like &amp;quot;Will the system settle down to a steady state in the long term, and if so, what are the possible steady states?&amp;quot;, or &amp;quot;Does the long-term behavior of the system depend on its initial condition?&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory and chaos theory deal with the long-term qualitative behavior of dynamical systems. Here, the focus is not on finding precise solutions to the equations defining the dynamical system (which is often hopeless), but rather to answer questions like &amp;quot;Will the system settle down to a steady state in the long term, and if so, what are the possible steady states?&amp;quot;, or &amp;quot;Does the long-term behavior of the system depend on its initial condition?&amp;quot;&lt;br /&gt;
&lt;br /&gt;
动力系统理论和'''混沌理论 Chaos Theory'''是用来处理动力系统的&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;长期定性行为&amp;lt;/font&amp;gt;&amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 长周期性行为&amp;lt;/font&amp;gt;的理论。寻找动力系统方程的精确解通常是很难达到的。&amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 因此，&amp;lt;/font&amp;gt;这两个理论的重点不在于找到精确解，而是回答如下的问题，如“系统长期来看是否会稳定下来，如果可以，那么可能的稳定状态是什么样的?”，或“系统长期的行为是否取决于其初始条件?”&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
An important goal is to describe the fixed points, or steady states of a given dynamical system; these are values of the variable that don't change over time. Some of these fixed points are ''attractive'', meaning that if the system starts out in a nearby state, it converges towards the fixed point.&lt;br /&gt;
&lt;br /&gt;
An important goal is to describe the fixed points, or steady states of a given dynamical system; these are values of the variable that don't change over time. Some of these fixed points are attractive, meaning that if the system starts out in a nearby state, it converges towards the fixed point.&lt;br /&gt;
&lt;br /&gt;
描述给定动力系统的不动点或'''&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;定态&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;稳态&amp;lt;/font&amp;gt;Steady States'''是一个重要的目标。不动点或&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;定态&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;稳态&amp;lt;/font&amp;gt;的变量值不会随时间的变化而变化。&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;一些不动点是有吸引力的（attractive），即如果系统的初始值在它的附近，系统最终会收敛到这个不动点。&amp;lt;/font&amp;gt;&amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 某些不动点被称为“吸引子”，意味着如果系统即使不在它附近的状态开始，最终也会收敛到这些不动点。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Similarly, one is interested in ''periodic points'', states of the system that repeat after several timesteps. Periodic points can also be attractive. [[Sharkovskii's theorem]] is an interesting statement about the number of periodic points of a one-dimensional discrete dynamical system.&lt;br /&gt;
&lt;br /&gt;
Similarly, one is interested in periodic points, states of the system that repeat after several timesteps. Periodic points can also be attractive. Sharkovskii's theorem is an interesting statement about the number of periodic points of a one-dimensional discrete dynamical system.&lt;br /&gt;
&lt;br /&gt;
人们还对动力系统的'''周期点 Periodic Points'''感兴趣，即系统在几个时间步之后会不断重复的状态。周期点也可以是有吸引力的。Sharkovskii定理描述了一维离散动力系统的周期点的个数。&lt;br /&gt;
&amp;lt;font color='blue'&amp;gt;类似地，另一个研究兴趣是'''周期点 Periodic Points'''，即系统在重复几个时间步之后的状态。周期点也可以是吸引子。Sharkovskii定理描述了一维离散动力系统的周期点的个数。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Even simple [[nonlinear dynamical system]]s often exhibit seemingly random behavior that has been called ''chaos''.&amp;lt;ref&amp;gt;{{cite journal |last=Grebogi |first=C. |last2=Ott |first2=E. |last3=Yorke |first3=J. |year=1987 |title=Chaos, Strange Attractors, and Fractal Basin Boundaries in Nonlinear Dynamics |journal=[[Science (journal)|Science]] |volume=238 |issue=4827 |pages=632–638 |jstor=1700479 |doi=10.1126/science.238.4827.632 |pmid=17816542 |bibcode=1987Sci...238..632G }}&amp;lt;/ref&amp;gt; The branch of dynamical systems that deals with the clean definition and investigation of chaos is called ''[[chaos theory]]''.&lt;br /&gt;
&lt;br /&gt;
Even simple nonlinear dynamical systems often exhibit seemingly random behavior that has been called chaos. The branch of dynamical systems that deals with the clean definition and investigation of chaos is called chaos theory.&lt;br /&gt;
&lt;br /&gt;
即使是简单的非线性动力系统也常常表现出看似随机的行为，这种行为被称为混沌。混沌理论主要研究混沌的清晰定义和混沌的现象，它是动力系统理论的一个分支。&lt;br /&gt;
&lt;br /&gt;
== History 历史==&lt;br /&gt;
&lt;br /&gt;
The concept of dynamical systems theory has its origins in [[Newtonian mechanics]]. There, as in other natural sciences and engineering disciplines, the evolution rule of dynamical systems is given implicitly by a relation that gives the state of the system only a short time into the future.&lt;br /&gt;
&lt;br /&gt;
The concept of dynamical systems theory has its origins in Newtonian mechanics. There, as in other natural sciences and engineering disciplines, the evolution rule of dynamical systems is given implicitly by a relation that gives the state of the system only a short time into the future.&lt;br /&gt;
&lt;br /&gt;
动态系统理论的概念起源于牛顿运动定律。与其他自然科学和工程学科一样，动力系统的演化规律也是通过一种预测系统在未来很短时间内的状态的关系隐含地给出的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Before the advent of [[computer|fast computing machines]], solving a dynamical system required sophisticated mathematical techniques and could only be accomplished for a small class of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
Before the advent of fast computing machines, solving a dynamical system required sophisticated mathematical techniques and could only be accomplished for a small class of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
在高速计算机器出现之前，解决动力系统问题需要复杂的数学技能，而且还只能解决一小类动力系统问题。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Some excellent presentations of mathematical dynamic system theory include {{harvtxt|Beltrami|1990}}, {{harvtxt|Luenberger|1979}}, {{harvtxt|Padulo|Arbib|1974}}, and {{harvtxt|Strogatz|1994}}.&amp;lt;ref&amp;gt;Jerome R. Busemeyer (2008), [http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html &amp;quot;Dynamic Systems&amp;quot;]. To Appear in: ''Encyclopedia of cognitive science'', Macmillan. Retrieved 8 May 2008.  {{webarchive |url=https://web.archive.org/web/20080613053119/http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html |date=June 13, 2008 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Some excellent presentations of mathematical dynamic system theory include , , , and . To Appear in: ''Encyclopedia of cognitive science'', Macmillan. Retrieved 8 May 2008&lt;br /&gt;
&lt;br /&gt;
优秀的数学动力系统理论包括，，，和。--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|存疑]]）。&lt;br /&gt;
&lt;br /&gt;
&amp;lt;font color='blue'&amp;gt;原文是：Some excellent presentations of mathematical dynamic system theory include Beltrami (1990), Luenberger (1979), Padulo &amp;amp; Arbib (1974), and Strogatz (1994).[2] 是不是在粘贴或解析时内容有丢失？&lt;br /&gt;
&lt;br /&gt;
一些优秀的数学动力系统理论包括贝尔特拉米（Beltrami，1990年），龙伯格(Luenberger，1979年），帕杜罗&amp;amp;阿尔比布（Padulo＆Arbib，1974年）和斯托加茨（Strogatz，1994年）。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Concepts 概念==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Dynamical systems 动力系统===&lt;br /&gt;
&lt;br /&gt;
{{main|Dynamical system (definition)}}&lt;br /&gt;
&lt;br /&gt;
The [[dynamical system]] concept is a mathematical [[formal system|formalization]] for any fixed &amp;quot;rule&amp;quot; that describes the [[time]] dependence of a point's position in its [[ambient space]].  Examples include the [[mathematical model]]s that describe the swinging of a clock pendulum, the flow of water in a pipe, and the number of fish each spring in a lake.&lt;br /&gt;
&lt;br /&gt;
The dynamical system concept is a mathematical formalization for any fixed &amp;quot;rule&amp;quot; that describes the time dependence of a point's position in its ambient space.  Examples include the mathematical models that describe the swinging of a clock pendulum, the flow of water in a pipe, and the number of fish each spring in a lake.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;动力系统是一个对任何描述了点的位置在周围环境随时间变化的“固定”规则的数学式。&amp;lt;/font&amp;gt;&amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;动力系统概念是对描述了一个点的位置在其周围环境中随时间变化的任何“固定”规则的数学形式化。&amp;lt;/font&amp;gt;举例来说，描述钟摆摆动、管道中的水流以及每年春天湖中鱼的数量的数学模型，都属于动力系统的概念范畴。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A dynamical system has a ''state'' determined by a collection of [[real numbers]], or more generally by a [[Set (mathematics)|set]] of [[Point (geometry)|points]] in an appropriate ''state space''.  Small changes in the state of the system correspond to small changes in the numbers.  The numbers are also the coordinates of a geometrical space—a [[manifold]].   The ''evolution rule'' of the dynamical system is a [[function (mathematics)|fixed rule]] that describes what future states follow from the current state.  The rule may be [[Deterministic system (mathematics)|deterministic]] (for a given time interval only one future state follows from the current state) or [[stochastic differential equation|stochastic]] (the evolution of the state is subject to random shocks).&lt;br /&gt;
&lt;br /&gt;
A dynamical system has a state determined by a collection of real numbers, or more generally by a set of points in an appropriate state space.  Small changes in the state of the system correspond to small changes in the numbers.  The numbers are also the coordinates of a geometrical space—a manifold.   The evolution rule of the dynamical system is a fixed rule that describes what future states follow from the current state.  The rule may be deterministic (for a given time interval only one future state follows from the current state) or stochastic (the evolution of the state is subject to random shocks).&lt;br /&gt;
&lt;br /&gt;
动力系统的状态是由一组实数决定的，更广泛地说，是由适当的状态空间中的一组点决定的。系统状态的微小变化对应于数字的变化。这些数字也是几何空间——'''流形 Manifold'''——的坐标组。&amp;lt;font color='red'&amp;gt;动力系统的演化是描述了在当前状态之后出现的未来状态的固定规则。&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;动力系统的演化规律是一种固定的规则，它描述了从当前状态得出的未来状态。&amp;lt;/font&amp;gt;这个规则可以是确定性的(在给定的时间间隔内，有且仅有一个未来状态在当前状态之后出现)，或随机性的(状态的演化受到随机因素的影响)。&lt;br /&gt;
&lt;br /&gt;
=== Dynamicism 动态主义===&lt;br /&gt;
&lt;br /&gt;
[[Dynamicism]], also termed the ''dynamic hypothesis'' or the ''dynamic hypothesis in cognitive science'' or ''dynamic cognition'', is a new approach in [[cognitive science]] exemplified by the work of philosopher [[Tim van Gelder]]. It argues that [[differential equations]] are more suited to modelling [[cognition]] than more traditional [[computer]] models.&lt;br /&gt;
&lt;br /&gt;
Dynamicism, also termed the dynamic hypothesis or the dynamic hypothesis in cognitive science or dynamic cognition, is a new approach in cognitive science exemplified by the work of philosopher Tim van Gelder. It argues that differential equations are more suited to modelling cognition than more traditional computer models.&lt;br /&gt;
&lt;br /&gt;
'''动态主义 Dynamicism'''，也称动态假设，&amp;lt;font color='red'&amp;gt;或称认知科学、动态认知中的动态假设，&amp;lt;/font&amp;gt;&amp;lt;font color='blue'&amp;gt;或称认知科学的动态假设或动态认知，&amp;lt;/font&amp;gt;是以哲学家Tim van Gelder的著作为代表的认知科学的一种新取向。动态主义认为微分方程比传统的计算机模型更适合于建立认知模型。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Nonlinear system 非线性系统===&lt;br /&gt;
&lt;br /&gt;
{{main|Nonlinear system}}&lt;br /&gt;
&lt;br /&gt;
In [[mathematics]], a [[nonlinear system]] is a system that is not [[linear system|linear]]—i.e., a system that does not satisfy the [[superposition principle]]. Less technically, a nonlinear system is any problem where the variable(s) to solve for cannot be written as a linear sum of independent components. A [[Homogeneity (physics)|nonhomogeneous]] system, which is linear apart from the presence of a function of the [[independent variable]]s, is nonlinear according to a strict definition, but such systems are usually studied alongside linear systems, because they can be transformed to a linear system as long as a particular solution is known.&lt;br /&gt;
&lt;br /&gt;
In mathematics, a nonlinear system is a system that is not linear—i.e., a system that does not satisfy the superposition principle. Less technically, a nonlinear system is any problem where the variable(s) to solve for cannot be written as a linear sum of independent components. A nonhomogeneous system, which is linear apart from the presence of a function of the independent variables, is nonlinear according to a strict definition, but such systems are usually studied alongside linear systems, because they can be transformed to a linear system as long as a particular solution is known.&lt;br /&gt;
&lt;br /&gt;
在数学中，'''非线性系统 Nonlinear System'''是指系统不是线性的——也就是说，一个不满足叠加原理的系统。更通俗地说，非线性系统是待求解变量不能被写成其独立分量的线性和的系统。非齐次系统根据定义严格来说是非线性的，除了它的自变量&amp;lt;font del&amp;gt;包含&amp;lt;/font&amp;gt;函数以外其他部分都是线性的。但非齐次系统通常与线性系统一起研究，因为只要知道特解，它们就可以转化为线性系统。&lt;br /&gt;
&lt;br /&gt;
== Related fields 相关领域==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Arithmetic dynamics 算术动态系统===&lt;br /&gt;
&lt;br /&gt;
:[[Arithmetic dynamics]] is a field that emerged in the 1990s that amalgamates two areas of mathematics, [[dynamical systems]] and [[number theory]]. Classically, discrete dynamics refers to the study of the [[Iterated function|iteration]] of self-maps of the [[complex plane]] or [[real line]]. Arithmetic dynamics is the study of the number-theoretic properties of integer, rational, {{math|&amp;lt;var&amp;gt;p&amp;lt;/var&amp;gt;}}-adic, and/or algebraic points under repeated application of a [[polynomial]] or [[rational function]].&lt;br /&gt;
&lt;br /&gt;
Arithmetic dynamics is a field that emerged in the 1990s that amalgamates two areas of mathematics, dynamical systems and number theory. Classically, discrete dynamics refers to the study of the iteration of self-maps of the complex plane or real line. Arithmetic dynamics is the study of the number-theoretic properties of integer, rational, -adic, and/or algebraic points under repeated application of a polynomial or rational function.&lt;br /&gt;
&lt;br /&gt;
'''算术动态系统 Arithmetic Dynamics'''是20世纪90年代出现的一个领域，融合了动力系统和数论这两个数学领域。经典的离散动力学研究复平面或实直线的自映射的迭代。算术动态系统研究内容是在多项式或有理函数中的整数、有理数、并元 --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|存疑]]） 和/或代数点的数论性质。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Chaos theory 混沌理论===&lt;br /&gt;
&lt;br /&gt;
:[[Chaos theory]] describes the behavior of certain [[dynamical system (definition)|dynamical system]]s – that is, systems whose state evolves with time – that may exhibit dynamics that are highly sensitive to initial conditions (popularly referred to as the [[butterfly effect]]). As a result of this sensitivity, which manifests itself as an exponential growth of perturbations in the initial conditions, the behavior of chaotic systems appears [[randomness|random]]. This happens even though these systems are [[deterministic system (philosophy)|deterministic]], meaning that their future dynamics are fully defined by their initial conditions, with no random elements involved. This behavior is known as deterministic chaos, or simply ''chaos''.&lt;br /&gt;
&lt;br /&gt;
Chaos theory describes the behavior of certain dynamical systems – that is, systems whose state evolves with time – that may exhibit dynamics that are highly sensitive to initial conditions (popularly referred to as the butterfly effect). As a result of this sensitivity, which manifests itself as an exponential growth of perturbations in the initial conditions, the behavior of chaotic systems appears random. This happens even though these systems are deterministic, meaning that their future dynamics are fully defined by their initial conditions, with no random elements involved. This behavior is known as deterministic chaos, or simply chaos.&lt;br /&gt;
&lt;br /&gt;
混沌理论描述了某些状态随时间演化的动力系统的行为，这些系统可能表现出对初始条件高度敏感的特点（通常被称为'''蝴蝶效应 Butterfly Effect'''）。由于扰动受初始条件影响而指数增长，因此混沌系统具有敏感性，敏感性使它的行为看起来是随机的。但是这种敏感性也会出现在确定的动力系统中，即未来的动力学完全由它的初始条件定义，没有任何随机因素参与的系统中。这种现象被称为确定性混沌，或简单混沌。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Complex systems 复杂系统===&lt;br /&gt;
&lt;br /&gt;
:[[Complex systems]] is a scientific field that studies the common properties of [[system]]s considered [[Complexity|complex]] in [[nature]], [[society]], and [[science]]. It is also called ''complex systems theory'', ''complexity science'', ''study of complex systems'' and/or ''sciences of complexity''. The key problems of such systems are  difficulties with their formal [[Scientific modelling|modeling]] and [[simulation]]. From such perspective, in different research contexts complex systems are defined on the base of their different attributes.&lt;br /&gt;
&lt;br /&gt;
Complex systems is a scientific field that studies the common properties of systems considered complex in nature, society, and science. It is also called complex systems theory, complexity science, study of complex systems and/or sciences of complexity. The key problems of such systems are  difficulties with their formal modeling and simulation. From such perspective, in different research contexts complex systems are defined on the base of their different attributes.&lt;br /&gt;
&lt;br /&gt;
'''复杂系统 Complex Systems'''是研究自然、社会和科学中复杂现象的共同性质的科学领域。它也被称为复杂系统理论、复杂性科学、复杂系统研究和关于复杂性的科学。这些系统的关键问题在于对系统的形式化建模与仿真。因此，复杂系统是根据在不同的研究语境中的不同属性来定义的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
:The study of complex systems is bringing new vitality to many areas of science where a more typical [[reductionist]] strategy has fallen short. ''Complex systems'' is therefore often used as a broad term encompassing a research approach to problems in many diverse disciplines including [[neurosciences]], [[social sciences]], [[meteorology]], [[chemistry]], [[physics]], [[computer science]], [[psychology]], [[artificial life]], [[evolutionary computation]], [[economics]], earthquake prediction, [[molecular biology]] and inquiries into the nature of living [[cell (biology)|cell]]s themselves.&lt;br /&gt;
&lt;br /&gt;
The study of complex systems is bringing new vitality to many areas of science where a more typical reductionist strategy has fallen short. Complex systems is therefore often used as a broad term encompassing a research approach to problems in many diverse disciplines including neurosciences, social sciences, meteorology, chemistry, physics, computer science, psychology, artificial life, evolutionary computation, economics, earthquake prediction, molecular biology and inquiries into the nature of living cells themselves.&lt;br /&gt;
&lt;br /&gt;
还原论策略已经不足以研究许多科学领域的问题，而复杂系统的研究则为科学带来了广泛的新活力。复杂系统通常被用作一个应用广泛的研究方法术语，并涵盖许多不同的学科，包括神经科学、社会科学、气象学、化学、物理学、计算机科学、心理学、人工生命、进化计算、经济学、地震预测、分子生物学以及对活细胞的研究等。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Control theory 控制理论===&lt;br /&gt;
&lt;br /&gt;
:[[Control theory]] is an interdisciplinary branch of [[engineering]] and [[mathematics]], in part it deals with influencing the behavior of [[dynamical system]]s.&lt;br /&gt;
&lt;br /&gt;
Control theory is an interdisciplinary branch of engineering and mathematics, in part it deals with influencing the behavior of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
'''控制理论 Control Theory'''是工程和数学的一个交叉学科，它的其中一部分研究影响动力系统行为的各种因素。&lt;br /&gt;
&lt;br /&gt;
控制理论是一个研究如何调整动态系统特性的理论，它也是工程和数学的一个交叉学科，逐渐的应用在许多社会科学中，例如心理学、社会学（社会学中的控制理论）、犯罪学及'''金融系统 Financial System'''。控制理论一般的目的是借由控制器的动作让系统稳定，也就是系统维持在设定值，而且不会在设定值附近晃动。设定值一般维持不变的控制称为调节，设定值快速变化，要求跟踪速度加速度等的控制称为伺服。它的其中一部分研究影响动力系统行为的各种因素。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Ergodic theory 遍历理论===&lt;br /&gt;
&lt;br /&gt;
:[[Ergodic theory]] is a branch of [[mathematics]] that studies [[dynamical system]]s with an [[invariant measure]] and related problems. Its initial development was motivated by problems of [[statistical physics]].&lt;br /&gt;
&lt;br /&gt;
Ergodic theory is a branch of mathematics that studies dynamical systems with an invariant measure and related problems. Its initial development was motivated by problems of statistical physics.&lt;br /&gt;
&lt;br /&gt;
'''遍历理论 Ergodic Theory'''是数学的一个分支，研究有不变测度相关问题的动力系统。它最初的发展受到了统计物理学的推动。&lt;br /&gt;
遍历理论是研究保测变换的渐近性态的数学分支。它起源于为统计力学提供基础的&amp;quot;遍历假设&amp;quot;研究，并与动力系统理论、概率论、信息论、泛函分析、数论等数学分支有着密切的联系。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Functional analysis 泛函分析===&lt;br /&gt;
&lt;br /&gt;
:[[Functional analysis]] is the branch of [[mathematics]], and specifically of [[mathematical analysis|analysis]], concerned with the study of [[vector space]]s and [[operator (mathematics)|operator]]s acting upon them. It has its historical roots in the study of [[functional space]]s, in particular transformations of [[function (mathematics)|functions]], such as the [[Fourier transform]], as well as in the study of [[differential equations|differential]] and [[integral equations]]. This usage of the word ''[[functional (mathematics)|functional]]'' goes back to the [[calculus of variations]], implying a function whose argument is a function. Its use in general has been attributed to mathematician and physicist [[Vito Volterra]] and its founding is largely attributed to mathematician [[Stefan Banach]].&lt;br /&gt;
&lt;br /&gt;
Functional analysis is the branch of mathematics, and specifically of analysis, concerned with the study of vector spaces and operators acting upon them. It has its historical roots in the study of functional spaces, in particular transformations of functions, such as the Fourier transform, as well as in the study of differential and integral equations. This usage of the word functional goes back to the calculus of variations, implying a function whose argument is a function. Its use in general has been attributed to mathematician and physicist Vito Volterra and its founding is largely attributed to mathematician Stefan Banach.&lt;br /&gt;
&lt;br /&gt;
'''泛函分析 Functional analysis'''是数学分析的一个分支，研究向量空间和作用于向量空间的算子。它源于对函数空间的研究，特别是对函数变换的研究，例如傅里叶变换，微积分方程的研究等。泛函分析的名称“Functional Analysis”中，“functional”这个词的用法可以追溯到变分法，也就是说函数的参数是一个函数。这个词的使用一般被认为归功于数学家和物理学家Vito Volterra，和数学家Stefan Banach。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Graph dynamical systems 图动力系统===&lt;br /&gt;
&lt;br /&gt;
:The concept of [[graph dynamical system]]s (GDS) can be used to capture a wide range of processes taking place on graphs or networks. A major theme in the mathematical and computational analysis of graph dynamical systems is to relate their structural properties (e.g. the network connectivity) and the global dynamics that result.&lt;br /&gt;
&lt;br /&gt;
The concept of graph dynamical systems (GDS) can be used to capture a wide range of processes taking place on graphs or networks. A major theme in the mathematical and computational analysis of graph dynamical systems is to relate their structural properties (e.g. the network connectivity) and the global dynamics that result.&lt;br /&gt;
&lt;br /&gt;
'''图动力系统 Graph dynamical systems (GDS)'''可以用来描绘图或网络上发生的各种过程。图动力系统的数学和计算分析的一个主要主题是关联它们的结构性质(例如:网络连接)和结构性质造成的网络整体的动态结果。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Projected dynamical systems 投影动力系统===&lt;br /&gt;
&lt;br /&gt;
:[[Projected dynamical systems]] it is a [[mathematics|mathematical]] theory investigating the behaviour of [[dynamical system]]s where solutions are restricted to a constraint set. The discipline shares connections to and applications with both the static world of [[Optimization (mathematics)|optimization]] and [[Equilibrium point|equilibrium]] problems and the dynamical world of [[ordinary differential equations]]. A projected dynamical system is given by the [[flow (mathematics)|flow]] to the projected differential equation.&lt;br /&gt;
&lt;br /&gt;
Projected dynamical systems it is a mathematical theory investigating the behaviour of dynamical systems where solutions are restricted to a constraint set. The discipline shares connections to and applications with both the static world of optimization and equilibrium problems and the dynamical world of ordinary differential equations. A projected dynamical system is given by the flow to the projected differential equation.&lt;br /&gt;
&lt;br /&gt;
'''投影动力系统 Projected Dynamical Systems'''是研究解在一个约束集内的动力系统行为的数学理论。这门学科与静态世界中的最优化和平衡问题以及动态世界中的常微分方程都有联系，并且都有相互联系的应用。一个投影动力系统是由投影微分方程的'''流形 flow'''给定的。&lt;br /&gt;
通过对投影微分方程的流分析，给出了一个投影动力系统的表达式：&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\frac{dx(t)}{dt} = \Pi_K(x(t),-F(x(t)))&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中K为约束集。这种形式的微分方程因具有不连续的向量场而值得注意。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Symbolic dynamics 符号动力学===&lt;br /&gt;
&lt;br /&gt;
:[[Symbolic dynamics]] is the practice of modelling a topological or smooth [[dynamical system]] by a discrete space consisting of infinite [[sequence]]s of abstract symbols, each of which corresponds to a state of the system, with the dynamics (evolution) given by the [[shift operator]].&lt;br /&gt;
&lt;br /&gt;
Symbolic dynamics is the practice of modelling a topological or smooth dynamical system by a discrete space consisting of infinite sequences of abstract symbols, each of which corresponds to a state of the system, with the dynamics (evolution) given by the shift operator.&lt;br /&gt;
&lt;br /&gt;
'''符号动力学 Symbolic Dynamics'''是通过一个由抽象符号的无限序列组成的离散空间建立一个拓扑或光滑动力系统的方法。每一个抽象符号的无限序列序列对应于系统的一个状态，并由移位算子给出动力学(演化)。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== System dynamics 系统动力学===&lt;br /&gt;
&lt;br /&gt;
:[[System dynamics]] is an approach to understanding the behaviour of systems over time.  It deals with internal feedback loops and time delays that affect the behaviour and state of the entire system.&amp;lt;ref name=&amp;quot;sysdyn&amp;quot;&amp;gt;[http://sysdyn.clexchange.org MIT System Dynamics in Education Project (SDEP)&amp;lt;!-- Bot generated title --&amp;gt;] {{webarchive|url=https://web.archive.org/web/20080509163801/http://sysdyn.clexchange.org/ |date=2008-05-09 }}&amp;lt;/ref&amp;gt;  What makes using system dynamics different from other approaches to studying systems is the use of [[feedback]] loops and [[Stock and flow|stocks and flows]].  These elements help describe how even seemingly simple systems display baffling [[nonlinearity]].&lt;br /&gt;
&lt;br /&gt;
System dynamics is an approach to understanding the behaviour of systems over time.  It deals with internal feedback loops and time delays that affect the behaviour and state of the entire system.  What makes using system dynamics different from other approaches to studying systems is the use of feedback loops and stocks and flows.  These elements help describe how even seemingly simple systems display baffling nonlinearity.&lt;br /&gt;
&lt;br /&gt;
'''系统动力学 System Dynamics'''是一种理解系统随时间变化行为的方法。它是用来处理影响整个系统行为和状态的内部反馈回路和时间延迟的方法。系统动力学不同于其他系统研究方法的地方在于它使用了反馈环、股票（stocks）和流形（flows）--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|如何翻译stocks 和 folows]]）的元素。这些元素有助于描述看似简单的系统如何显示复杂的非线性行为。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Topological dynamics 拓扑动力学===&lt;br /&gt;
&lt;br /&gt;
:[[Topological dynamics]] is a branch of the theory of dynamical systems in which qualitative, asymptotic properties of dynamical systems are studied from the viewpoint of [[general topology]].&lt;br /&gt;
&lt;br /&gt;
Topological dynamics is a branch of the theory of dynamical systems in which qualitative, asymptotic properties of dynamical systems are studied from the viewpoint of general topology.&lt;br /&gt;
&lt;br /&gt;
'''拓扑动力学 Topological Dynamics'''是动力系统理论的一个分支。在拓朴动力学中，动力系统的定性性质和渐近性质是从一般拓扑学的观点来研究的。&lt;br /&gt;
&lt;br /&gt;
== Applications 应用==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== In human development 在人类发展中的应用===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In [[Developmental psychology|human development]], dynamical systems theory has been used to enhance and simplify Erik Erikson's [[eight stages of psychosocial development]] and offers a standard method of examining the universal pattern of human development. This method is based on the self-organizing and [[fractal]] properties of the [[Fibonacci sequence]].&amp;lt;ref name=Sacco&amp;gt;{{cite journal|last=Sacco|first=R.G.|title=Re-envisaging the eight developmental stages of Erik Erikson: The Fibonacci Life-Chart Method (FLCM)|journal=Journal of Educational and Developmental Psychology|date=2013|volume=3|issue=1|pages=140–146|doi=10.5539/jedp.v3n1p140|doi-access=free}}&amp;lt;/ref&amp;gt; Using mathematical modeling, a natural progression of human development with eight life stages has been identified:  early infancy (0–2 years), toddler (2–4 years), early childhood (4–7 years), middle childhood (7–11 years), adolescence (11–18 years), young adulthood (18–29 years), middle adulthood (29–48 years), and older adulthood (48–78+ years).&amp;lt;ref name=Sacco/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In human development, dynamical systems theory has been used to enhance and simplify Erik Erikson's eight stages of psychosocial development and offers a standard method of examining the universal pattern of human development. This method is based on the self-organizing and fractal properties of the Fibonacci sequence. Using mathematical modeling, a natural progression of human development with eight life stages has been identified:  early infancy (0–2 years), toddler (2–4 years), early childhood (4–7 years), middle childhood (7–11 years), adolescence (11–18 years), young adulthood (18–29 years), middle adulthood (29–48 years), and older adulthood (48–78+ years).&lt;br /&gt;
&lt;br /&gt;
在人类发展方面，动力系统理论已经被用来增强和简化 Erik Erikson 的'''社会心理发展8阶段理论 Eight Stages of Psychosocial Development'''，并提供了一个检验人类发展普遍模式的标准方法。该方法基于斐波那契数列的'''自组织性 self-organizing'''和'''分形 Fractal''' 特性。利用数学模型，人类发展的自然进程被分为8个生命阶段: 早期婴儿期(0-2岁)、幼儿期(2-4岁)、童年早期(4-7岁)、童年中期(7-11岁)、青春期(11-18岁)、成年早期(18-29岁)、成年中期(29-48岁)和老年成年期(48-78岁及以上)。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
According to this model, stage transitions between age intervals represent self-organization processes at multiple levels (e.g., molecules, genes, cell, organ, organ system, organism, behavior, and environment). For example, at the stage transition from [[adolescence]] to [[young adulthood]], and after reaching the critical point of 18 years of age (young adulthood), a peak in [[testosterone]] is observed in males&amp;lt;ref&amp;gt;{{cite journal |last1=Kelsey |first1=T. W. |title=A validated age-related normative model for male total testosterone shows increasing variance but no decline after age 40 years. |journal=PLOS One |volume=9 |issue=10 |pages=e109346 |doi=10.1371/journal.pone.0109346|pmid=25295520 |year=2014 |pmc=4190174 |bibcode=2014PLoSO...9j9346K }}&amp;lt;/ref&amp;gt; and the period of optimal [[fertility]] begins in females.&amp;lt;ref&amp;gt;{{cite book |last1=Tulandi |first1=T. |title=Preservation of fertility |date=2004 |publisher=Taylor &amp;amp; Francis |pages=1–20}}&amp;lt;/ref&amp;gt; Similarly, at age 30 optimal fertility begins to decline in females,&amp;lt;ref name=&amp;quot;Social Science 2008&amp;quot;&amp;gt;{{cite journal |last1=Blanchflower |first1=D. G. |title=Is well-being U-shaped over the life cycle? |journal=Social Science &amp;amp; Medicine |volume=66 |issue=8 |pages=1733–1749 |doi=10.1016/j.socscimed.2008.01.030|pmid=18316146 |year=2008 |citeseerx=10.1.1.63.5221 }}&amp;lt;/ref&amp;gt; and at the stage transition from [[middle adulthood]] to older adulthood at 48 years, the average age of onset of [[menopause]] occurs.&amp;lt;ref name=&amp;quot;Social Science 2008&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
According to this model, stage transitions between age intervals represent self-organization processes at multiple levels (e.g., molecules, genes, cell, organ, organ system, organism, behavior, and environment). For example, at the stage transition from adolescence to young adulthood, and after reaching the critical point of 18 years of age (young adulthood), a peak in testosterone is observed in males and the period of optimal fertility begins in females. Similarly, at age 30 optimal fertility begins to decline in females, and at the stage transition from middle adulthood to older adulthood at 48 years, the average age of onset of menopause occurs.&lt;br /&gt;
&lt;br /&gt;
根据这个模型，年龄的阶段转换代表了多层次的自组织过程(例如，分子、基因、细胞、器官、器官系统、生物体、行为和环境)。例如，在从青春期向成年早期过渡的阶段中，在达到18岁这一关键年龄之后，男性的睾丸激素达到高峰，女性的最佳生育期开始。同样，在30岁时，女性的最佳生育能力开始下降；在从成年中期过渡到老年成年期时，48岁是绝经的平均年龄。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
These events are physical bioattractors of aging from the perspective of Fibonacci mathematical modeling and dynamically systems theory. In practical terms, prediction in human development becomes possible in the same statistical sense in which the average temperature or precipitation at different times of the year can be used for [[weather forecasting]]. Each of the predetermined stages of human development follows an optimal epigenetic biological pattern. This phenomenon can be explained by the occurrence of Fibonacci numbers in biological [[DNA]]&amp;lt;ref&amp;gt;{{cite journal |last1=Perez |first1=J. C. (2010). |title=Codon populations in single-stranded whole human genome DNA are fractal and fine-tuned by the Golden Ratio 1.618. |journal=Interdisciplinary Sciences: Computational Life Sciences |volume=2 |issue=3 |pages=228–240 |doi=10.1007/s12539-010-0022-0|pmid=20658335 |year=2010 }}&amp;lt;/ref&amp;gt; and self-organizing properties of the Fibonacci numbers that converge on the [[golden ratio]].&lt;br /&gt;
&lt;br /&gt;
These events are physical bioattractors of aging from the perspective of Fibonacci mathematical modeling and dynamically systems theory. In practical terms, prediction in human development becomes possible in the same statistical sense in which the average temperature or precipitation at different times of the year can be used for weather forecasting. Each of the predetermined stages of human development follows an optimal epigenetic biological pattern. This phenomenon can be explained by the occurrence of Fibonacci numbers in biological DNA and self-organizing properties of the Fibonacci numbers that converge on the golden ratio.&lt;br /&gt;
&lt;br /&gt;
从斐波那契数学模型和动力系统理论的角度来看，上述事件是衰老的'''物理生物吸引子Physical Bioattractors'''。实际上，正如一年中不同时间的平均气温和降水量可以用来预测天气，预测人类的发展在统计意义上同样是可能的。人类发展的每个'''预定阶段Predetermined Stages'''都遵循最佳的'''表观遗传生物模式 Epigenetic Biological Pattern'''。这种现象可以用 DNA 中的斐波那契数和收敛于黄金分割比的斐波那契数的自组织特性来解释。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== In biomechanics 在运动生物力学中的应用===&lt;br /&gt;
&lt;br /&gt;
In [[sports biomechanics]], dynamical systems theory has emerged in the movement sciences as a viable framework for modeling athletic performance. From a dynamical systems perspective, the human movement system is a highly intricate network of co-dependent sub-systems (e.g. respiratory, circulatory, nervous, skeletomuscular, perceptual) that are composed of a large number of interacting components (e.g. blood cells, oxygen molecules, muscle tissue, metabolic enzymes, connective tissue and bone). In dynamical systems theory, movement patterns emerge through generic processes of self-organization found in physical and biological systems.&amp;lt;ref&amp;gt;Paul S Glazier, Keith Davids, Roger M Bartlett (2003). [http://www.sportsci.org/jour/03/psg.htm &amp;quot;DYNAMICAL SYSTEMS THEORY: a Relevant Framework for Performance-Oriented Sports Biomechanics Research&amp;quot;]. in: Sportscience 7. Accessed 2008-05-08.&amp;lt;/ref&amp;gt; There is no research validation of any of the claims associated to the conceptual application of this framework.&lt;br /&gt;
&lt;br /&gt;
In sports biomechanics, dynamical systems theory has emerged in the movement sciences as a viable framework for modeling athletic performance. From a dynamical systems perspective, the human movement system is a highly intricate network of co-dependent sub-systems (e.g. respiratory, circulatory, nervous, skeletomuscular, perceptual) that are composed of a large number of interacting components (e.g. blood cells, oxygen molecules, muscle tissue, metabolic enzymes, connective tissue and bone). In dynamical systems theory, movement patterns emerge through generic processes of self-organization found in physical and biological systems. There is no research validation of any of the claims associated to the conceptual application of this framework.&lt;br /&gt;
&lt;br /&gt;
在运动生物力学中，动力系统理论新兴地成为对运动表现建模的可行框架。从动力系统的角度来看，人类的运动系统是由高度复杂和相互依赖的子系统网络（如呼吸、循环、神经、骨骼肌系统和知觉系统等）组成的，它们由大量相互作用的部分组成（包括血细胞、氧分子、肌肉组织、代谢酶、结缔组织和骨骼等)。动力系统理论中，运动模式通过物理系统和生物系统中的一般自组织过程出现。没有任何研究证实与这一框架的概念相关的任何主张。&lt;br /&gt;
&lt;br /&gt;
=== In cognitive science 在认知科学中的应用===&lt;br /&gt;
&lt;br /&gt;
Dynamical system theory has been applied in the field of [[neurodynamics|neuroscience]] and [[cognitive science|cognitive development]], especially in [[the neo-Piagetian theories of cognitive development]]. It is the belief that cognitive development is best represented by physical theories rather than theories based on syntax and [[AI]]. It also believed that differential equations are the most appropriate tool for modeling human behavior. These equations are interpreted to represent an agent's cognitive trajectory through [[state space]]. In other words, dynamicists argue that [[psychology]] should be (or is) the description (via differential equations) of the cognitions and behaviors of an agent under certain environmental and internal pressures. The language of chaos theory is also frequently adopted.&lt;br /&gt;
&lt;br /&gt;
Dynamical system theory has been applied in the field of neuroscience and cognitive development, especially in the neo-Piagetian theories of cognitive development. It is the belief that cognitive development is best represented by physical theories rather than theories based on syntax and AI. It also believed that differential equations are the most appropriate tool for modeling human behavior. These equations are interpreted to represent an agent's cognitive trajectory through state space. In other words, dynamicists argue that psychology should be (or is) the description (via differential equations) of the cognitions and behaviors of an agent under certain environmental and internal pressures. The language of chaos theory is also frequently adopted.&lt;br /&gt;
&lt;br /&gt;
动力系统理论已经被应用于神经科学和认知发展领域，特别是在认知发展的'''新皮亚杰学派 neo-Piagetian'''中。人们相信，物理学理论比句法学理论和人工智能理论更能代表认知发展。人们还相信微分方程是人类行为建模最合适的工具。人们认为微分方程可以解释为通过状态空间代表一个主体的认知轨迹的算式。换句话说，动力学家认为心理学应该(或者是)(通过微分方程)描述在一定的环境和内部压力下的主体的认知和行为的学科。混沌理论在相关领域也经常被采用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In it, the learner's mind reaches a state of disequilibrium where old patterns have broken down. This is the phase transition of cognitive development. [[Self-organization]] (the spontaneous creation of coherent forms) sets in as activity levels link to each other. Newly formed macroscopic and microscopic structures support each other, speeding up the process. These links form the structure of a new state of order in the mind through a process called ''scalloping'' (the repeated building up and collapsing of complex performance.) This new, novel state is progressive, discrete, idiosyncratic and unpredictable.&amp;lt;ref&amp;gt;{{cite journal|title=The Promise of Dynamic Systems Approaches for an Integrated Account of Human Development|journal=Child Development|date=2000-02-25|first=Mark D.|last=Lewis|volume=71|issue=1|pages=36–43|id= |url=http://home.oise.utoronto.ca/~mlewis/Manuscripts/Promise.pdf|accessdate=2008-04-04|doi=10.1111/1467-8624.00116|pmid=10836556 |citeseerx=10.1.1.72.3668}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In it, the learner's mind reaches a state of disequilibrium where old patterns have broken down. This is the phase transition of cognitive development. Self-organization (the spontaneous creation of coherent forms) sets in as activity levels link to each other. Newly formed macroscopic and microscopic structures support each other, speeding up the process. These links form the structure of a new state of order in the mind through a process called scalloping (the repeated building up and collapsing of complex performance.) This new, novel state is progressive, discrete, idiosyncratic and unpredictable.&lt;br /&gt;
&lt;br /&gt;
在学习的过程中，旧的模式被打破了，学习者的思维达到了一种不平衡的状态。这是认知发展的阶段性转变。自组织(连贯的自发创造(the spontaneous creation of coherent forms))在'''活动水平 Activity Levels'''相互联系时产生。新形成的宏观和微观结构相互支持，加速了这一过程。这些联系在头脑中形成了一种具有新状态的结构，这个过程被称为“扇贝化 Scalloping”，也就是头脑的复杂性能的不断累积和崩溃的过程 --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|扇贝化的翻译拿不准，这句话的描述比较抽象]]）。这种新的状态是渐进的、离散的、异质的的和不可预知的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Dynamic systems theory has recently been used to explain a long-unanswered problem in child development referred to as the [[A-not-B error]].&amp;lt;ref&amp;gt;{{cite journal|title=Development as a dynamic system|journal=Trends in Cognitive Sciences|date=2003-07-30|first=Linda B.|last=Smith|author2=Esther Thelen|volume=7|issue=8|pages=343–8|id= |url=http://www.indiana.edu/~cogdev/labwork/dynamicsystem.pdf|accessdate=2008-04-04|doi=10.1016/S1364-6613(03)00156-6|pmid=12907229|citeseerx=10.1.1.294.2037}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Dynamic systems theory has recently been used to explain a long-unanswered problem in child development referred to as the A-not-B error.&lt;br /&gt;
&lt;br /&gt;
动力系统理论最近还被用来解释儿童发展中一个长期没有答案的问题，即 A-not-B 错误。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===In second language development 在二语习得中的应用===&lt;br /&gt;
&lt;br /&gt;
{{Main|Dynamic approach to second language development}}&lt;br /&gt;
&lt;br /&gt;
The application of Dynamic Systems Theory to study [[second language acquisition]] is attributed to [[Diane Larsen-Freeman]] who published an article in 1997 in which she claimed that [[second language acquisition]] should be viewed as a developmental process which includes [[language attrition]] as well as language acquisition.&amp;lt;ref&amp;gt;{{cite web|url=https://academic.oup.com/applij/article-abstract/18/2/141/134192|title=Chaos/Complexity Science and Second Language Acquisition|date=1997|publisher=Applied Linguistics}}&amp;lt;/ref&amp;gt; In her article she claimed that language should be viewed as a dynamic system which is dynamic, complex, nonlinear, chaotic, unpredictable, sensitive to initial conditions, open, self-organizing, feedback sensitive, and adaptive.&lt;br /&gt;
&lt;br /&gt;
The application of Dynamic Systems Theory to study second language acquisition is attributed to Diane Larsen-Freeman who published an article in 1997 in which she claimed that second language acquisition should be viewed as a developmental process which includes language attrition as well as language acquisition. In her article she claimed that language should be viewed as a dynamic system which is dynamic, complex, nonlinear, chaotic, unpredictable, sensitive to initial conditions, open, self-organizing, feedback sensitive, and adaptive.&lt;br /&gt;
&lt;br /&gt;
动力系统理论在二语习得研究中的应用归功于 Diane Larsen-Freeman，她在1997年发表的一篇文章中认为，二语习得应该被看作是一个包括语言流失和习得在内的发展过程。她在文章中认为，语言应该被看作是一个动态的、复杂的、非线性的、混沌的、不可预知的、对初始条件敏感的、开放的、自组织的、反馈敏感的和适应性的动力系统。&lt;br /&gt;
&lt;br /&gt;
== See also 参见==&lt;br /&gt;
&lt;br /&gt;
;Related subjects&lt;br /&gt;
&lt;br /&gt;
Related subjects&lt;br /&gt;
&lt;br /&gt;
相关科目&lt;br /&gt;
&lt;br /&gt;
{{div col|colwidth=20em}}&lt;br /&gt;
&lt;br /&gt;
* [[List of dynamical system topics]] 动力系统主题清单&lt;br /&gt;
&lt;br /&gt;
* [[Baker's map]]&lt;br /&gt;
&lt;br /&gt;
* [[Biological applications of bifurcation theory]] 分支理论的生物学应用&lt;br /&gt;
&lt;br /&gt;
* [[Dynamical system (definition)]] 动力系统（定义）&lt;br /&gt;
&lt;br /&gt;
* [[Embodied Embedded Cognition]] 具身认知&lt;br /&gt;
&lt;br /&gt;
* [[Fibonacci numbers]] 斐波那契数&lt;br /&gt;
&lt;br /&gt;
* [[Fractals]] 分形&lt;br /&gt;
&lt;br /&gt;
* [[Gingerbreadman map]]&lt;br /&gt;
&lt;br /&gt;
* [[Halo orbit]] Halo 轨道&lt;br /&gt;
&lt;br /&gt;
* [[List of types of systems theory]] 动力系统类型清单&lt;br /&gt;
&lt;br /&gt;
* [[Oscillation]] 振动性&lt;br /&gt;
&lt;br /&gt;
* [[Postcognitivism]]&lt;br /&gt;
&lt;br /&gt;
* [[Recurrent neural network]] 递归神经网络&lt;br /&gt;
&lt;br /&gt;
* [[Combinatorics and dynamical systems]] 组合数学和动力系统&lt;br /&gt;
&lt;br /&gt;
* [[Synergetics (Haken)|Synergetics]] 协同学(Haken)&lt;br /&gt;
&lt;br /&gt;
* [[Systemography]]&lt;br /&gt;
&lt;br /&gt;
{{div col end}}&lt;br /&gt;
&lt;br /&gt;
;Related scientists&lt;br /&gt;
&lt;br /&gt;
Related scientists&lt;br /&gt;
&lt;br /&gt;
相关科学家&lt;br /&gt;
&lt;br /&gt;
{{div col|colwidth=20em}}&lt;br /&gt;
&lt;br /&gt;
* [[People in systems and control]]&lt;br /&gt;
&lt;br /&gt;
* [[Dmitri Anosov]]&lt;br /&gt;
&lt;br /&gt;
* [[Vladimir Arnold]]&lt;br /&gt;
&lt;br /&gt;
* [[Nikolay Bogolyubov]]&lt;br /&gt;
&lt;br /&gt;
* [[Andrey Kolmogorov]]&lt;br /&gt;
&lt;br /&gt;
* [[Nikolay Mitrofanovich Krylov|Nikolay Krylov]]&lt;br /&gt;
&lt;br /&gt;
* [[Jürgen Moser]]&lt;br /&gt;
&lt;br /&gt;
* [[Yakov G. Sinai]]&lt;br /&gt;
&lt;br /&gt;
* [[Stephen Smale]]&lt;br /&gt;
&lt;br /&gt;
* [[Hillel Furstenberg]]&lt;br /&gt;
&lt;br /&gt;
* [[Grigory Margulis]]&lt;br /&gt;
&lt;br /&gt;
* [[Elon Lindenstrauss]]&lt;br /&gt;
&lt;br /&gt;
{{div col end}}&lt;br /&gt;
&lt;br /&gt;
== Notes 参考资料==&lt;br /&gt;
&lt;br /&gt;
{{reflist}}&lt;br /&gt;
&lt;br /&gt;
== Further reading 拓展阅读==&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Frederick D. |last1=Abraham |first2=Ralph |last2=Abraham |authorlink2=Ralph Abraham (mathematician)|first3=Christopher D. |last3=Shaw |title=A Visual Introduction to Dynamical Systems Theory for Psychology |url=https://books.google.com/books?id=oMbaAAAAMAAJ |year=1990 |publisher=Aerial Press |isbn=978-0-942344-09-7 |oclc=24345312}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=Edward J. |last=Beltrami |title=Mathematics for Dynamic Modeling |url=https://books.google.com/books?id=MmoiJPsuFW8C |year=1998 |publisher=Academic Press |isbn=978-0-12-085566-7 |edition=2nd |oclc=36713294}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=Otomar |last=Hájek |title=Dynamical systems in the plane |url=https://books.google.com/books?id=czhPAQAAIAAJ |year=1968 |publisher=Academic Press |oclc=343328 |authorlink=Otomar Hájek |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=David G. |last=Luenberger |title=Introduction to dynamic systems: theory, models, and applications |url=https://books.google.com/books?id=mvlQAAAAMAAJ |year=1979 |publisher=Wiley |isbn=978-0-471-02594-8 |oclc=4195122 |authorlink=David Luenberger |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Anthony |last1=Michel |author2=Kaining Wang |author3=Bo Hu |title=Qualitative Theory of Dynamical Systems |url=https://books.google.com/books?id=ZPGBnZGV2_cC |year=2001 |publisher=Taylor &amp;amp; Francis |isbn=978-0-8247-0526-8 |oclc=45873628}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Louis |last1=Padulo |first2=Michael A. |last2=Arbib |authorlink2=Michael A. Arbib |title=System theory: a unified state-space approach to continuous and discrete systems |url=https://books.google.com/books?id=6UPvAAAAMAAJ |year=1974 |publisher=Saunders |isbn=9780721670355 |oclc=947600 |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |first=Steven H. |last=Strogatz |title=Nonlinear Dynamics and Chaos: With Applications to Physics, Biology, Chemistry, and Engineering |year=1994 |publisher=Addison Wesley |isbn=978-0-7382-0453-6 |oclc=49839504 |authorlink=Steven Strogatz |ref=harv |url-access=registration |url=https://archive.org/details/nonlineardynamic00stro }}&lt;br /&gt;
&lt;br /&gt;
== External links 外部链接==&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20080613053119/http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html Dynamic Systems 动力系统] Encyclopedia of Cognitive Science entry. --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|这是一个嵌套的链接，但好像只能鼠标点击并超链接到内嵌的那个]]）认知科学百科全书&lt;br /&gt;
&lt;br /&gt;
*[http://mathworld.wolfram.com/DynamicalSystem.html Definition of dynamical system 动力系统的定义] in MathWorld. 在MathWorld.wolfram.com储存的定义&lt;br /&gt;
&lt;br /&gt;
*[http://www.dynamicalsystems.org/ DSWeb] Dynamical Systems Magazine 动力系统杂志&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Areas of mathematics | state=collapsed}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:Dynamical systems]]&lt;br /&gt;
&lt;br /&gt;
Category:Dynamical systems&lt;br /&gt;
&lt;br /&gt;
类别: 动力系统&lt;br /&gt;
&lt;br /&gt;
[[Category:Complex systems theory]]&lt;br /&gt;
&lt;br /&gt;
Category:Complex systems theory&lt;br /&gt;
&lt;br /&gt;
范畴: 复杂系统理论&lt;br /&gt;
&lt;br /&gt;
[[Category:Computational fields of study]]&lt;br /&gt;
&lt;br /&gt;
Category:Computational fields of study&lt;br /&gt;
&lt;br /&gt;
类别: 研究的计算领域&lt;br /&gt;
&lt;br /&gt;
&amp;lt;noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;small&amp;gt;This page was moved from [[wikipedia:en:Dynamical systems theory]]. Its edit history can be viewed at [[动力系统/edithistory]]&amp;lt;/small&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:待整理页面]]&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
===书籍推荐===&lt;br /&gt;
====[https://www.amazon.co.uk/Chaos-Making-Science-James-Gleick/dp/0749386061 Chaos: Making a New Science]====&lt;br /&gt;
The million-copy bestseller by National Book Award nominee and Pulitzer Prize finalist James Gleick—the author of Time Travel: A History—that reveals the science behind chaos theory。&lt;br /&gt;
Very readable, focuses on the scientists and mathematicians behind many of the key results in chaos.&lt;br /&gt;
本书由普利茨奖获得者James Gleick撰写。它是一本易读科普书籍，侧重介绍对混沌概念的发展做出重大贡献的科学家和数学家们。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://www.amazon.com/dp/0199566445/ref=cm_sw_su_dp Chaos and Fractals: An Elementary Introduction]====&lt;br /&gt;
This book provides the reader with an elementary introduction to chaos and fractals, suitable for students with a background in elementary algebra, without assuming prior coursework in calculus or physics. &lt;br /&gt;
这是一本关于混沌和分形的入门书籍。读者需要有一定的线性代数基础，但是不需要有微积分或物理学的基础。&lt;br /&gt;
&lt;br /&gt;
====[https://www.amazon.co.uk/Chaos-Very-Short-Introduction-Introductions/dp/0192853783/ref=pd_lpo_14_img_1/257-2017232-0516612?_encoding=UTF8&amp;amp;pd_rd_i=0192853783&amp;amp;pd_rd_r=eebee69a-fad3-43e3-bbeb-b883f2c59bf5&amp;amp;pd_rd_w=g6knH&amp;amp;pd_rd_wg=sx6z5&amp;amp;pf_rd_p=7b8e3b03-1439-4489-abd4-4a138cf4eca6&amp;amp;pf_rd_r=YTB0XXCR2DM8049PYP1Y&amp;amp;psc=1&amp;amp;refRID=YTB0XXCR2DM8049PYP1Y 牛津通识读本: Chaos]====&lt;br /&gt;
This book would not have been possible without my parents, of course, but I owe a greater debt than most to their faith, doubt, and hope, and to the love and patience of a, b, and c. Professionally my greatest debt is to Ed Spiegel, a father of chaos and my thesis Professor, mentor, and friend.&lt;br /&gt;
本书隶属于牛津通识读本系列。该书由Ed Spiegel的学生Leonard Smith撰写，语言生动简明。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
===集智课程推荐===&lt;br /&gt;
====[https://campus.swarma.org/course/1655 圣塔菲课程：Introduction to Dynamical Systems and Chaos]====&lt;br /&gt;
本课程中，主要介绍动力学系统和混沌系统，您将学到'''蝴蝶效应 Butterfly effect'''、'''奇异吸引子 Attractors'''等基本概念，以及如何应用于您感兴趣的领域。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://campus.swarma.org/course/1641 动力系统分析]====&lt;br /&gt;
本课程主要讲授连续和离散动力系统的定态、极限环及其稳定性分析、动力学系统的结构稳定性和常见的分支类型以及分析方法，混沌概念等。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E5%8A%A8%E5%8A%9B%E7%B3%BB%E7%BB%9F%E7%90%86%E8%AE%BA_Dynamical_Systems_Theory&amp;diff=10180</id>
		<title>动力系统理论 Dynamical Systems Theory</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E5%8A%A8%E5%8A%9B%E7%B3%BB%E7%BB%9F%E7%90%86%E8%AE%BA_Dynamical_Systems_Theory&amp;diff=10180"/>
		<updated>2020-07-11T14:55:52Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。&lt;br /&gt;
&lt;br /&gt;
{{Use dmy dates|date=May 2019|cs1-dates=y}}&lt;br /&gt;
&lt;br /&gt;
'''Dynamical systems theory''' is an area of [[mathematics]] used to describe the behavior of the  [[complex systems|complex]] [[dynamical system]]s, usually by employing [[differential equations]] or [[difference equations]]. When differential equations are employed, the theory is called [[continuous time|''continuous dynamical systems'']]. From a physical point of view, continuous dynamical systems is a generalization of [[classical mechanics]], a generalization where the [[equations of motion]] are postulated directly and are not constrained to be [[Euler–Lagrange equation]]s of a [[Principle of least action|least action principle]]. When difference equations are employed, the theory is called [[discrete time|''discrete dynamical systems'']]. When the time variable runs over a set that is discrete over some intervals and continuous over other intervals or is any arbitrary time-set such as a [[cantor set]], one gets [[dynamic equations on time scales]]. Some situations may also be modeled by mixed operators, such as [[differential-difference equations]].&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory is an area of mathematics used to describe the behavior of the  complex dynamical systems, usually by employing differential equations or difference equations. When differential equations are employed, the theory is called continuous dynamical systems. From a physical point of view, continuous dynamical systems is a generalization of classical mechanics, a generalization where the equations of motion are postulated directly and are not constrained to be Euler–Lagrange equations of a least action principle. When difference equations are employed, the theory is called discrete dynamical systems. When the time variable runs over a set that is discrete over some intervals and continuous over other intervals or is any arbitrary time-set such as a cantor set, one gets dynamic equations on time scales. Some situations may also be modeled by mixed operators, such as differential-difference equations.&lt;br /&gt;
&lt;br /&gt;
  &lt;br /&gt;
'''动力系统理论 Dynamical Systems Theory'''是一个用来描述复杂动力系统行为的数学领域，通常使用微分方程或差分方程。当采用微分方程时，该理论被称为连续动力系统。从物理学的角度来看，连续动力系统是经典力学的推广，也是运动方程的推广，不受极小作用原理Euler–Lagrange方程的约束。当采用差分方程时，该理论被称为离散动力系统。&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;当时间变量在一个离散的集合上运行，在另一个离散的集合上连续，或者像cantor集一样在任意的时间集合上运行时，人们就能得到时间尺度上的动力方程。&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 当时间变量运行在一个某些区间离散、其他区间连续的集合、或者像cantor集一样任意的时间集合上时，人们就能得到时间尺度上的动力方程。&amp;lt;/font&amp;gt;&lt;br /&gt;
&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;'''算子 Operators'''是一个函数空间到函数空间上的映射O：X→X，广义的讲，对任何函数进行某一项操作都可以认为是一个算子，如求幂次、求微分等。&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;这句话的英文原文在哪里？&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;动力系统的有些情况也可以用'''混合算子 Mixed Operators'''来建模，如微分-差分方程。&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 某些情况下，也可以用'''混合算子 Mixed Operators'''来建模，如微分-差分方程。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This theory deals with the long-term qualitative behavior of dynamical systems, and studies the nature of, and when possible the solutions of, the [[equations of motion]] of systems that are often primarily [[mechanics|mechanical]] or otherwise physical in nature, such as [[planetary orbit]]s and the behaviour of [[electronic circuit]]s, as well as systems that arise in [[biology]], [[economics]], and elsewhere. Much of modern research is focused on the study of [[chaotic system]]s.&lt;br /&gt;
&lt;br /&gt;
This theory deals with the long-term qualitative behavior of dynamical systems, and studies the nature of, and when possible the solutions of, the equations of motion of systems that are often primarily mechanical or otherwise physical in nature, such as planetary orbits and the behaviour of electronic circuits, as well as systems that arise in biology, economics, and elsewhere. Much of modern research is focused on the study of chaotic systems.&lt;br /&gt;
&lt;br /&gt;
这个理论处理动力系统的&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;长期定性行为。如果能够得到解的话，还可以研究系统的运动方程。这些方程通常运用到机械或物理研究领域，如行星轨道和电子电路，以及出现在生物学，经济学和其他地方的系统。&amp;lt;/font&amp;gt;现代的研究大多集中在对混沌系统的研究上。&lt;br /&gt;
&lt;br /&gt;
&amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;这个理论处理动力系统的长周期性的行为，并且研究系统的动力方程的规律，努力求得可能的解。这些系统通常是一些自然领域里的机械系统或其他物理系统，例如行星轨道和电子电路，也包括一些生物学、经济学和其他学科里的系统。现代的研究大多集中在对混沌系统的研究上。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This field of study is also called just ''dynamical systems'', ''mathematical dynamical systems theory'' or the ''mathematical theory of dynamical systems''.&lt;br /&gt;
&lt;br /&gt;
This field of study is also called just dynamical systems, mathematical dynamical systems theory or the mathematical theory of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
这个研究领域也被称为动力系统，数学动力系统理论或动力系统的数学理论。&lt;br /&gt;
&lt;br /&gt;
[[Image:Lorenz attractor yb.svg|thumb|240px|right|The [[Lorenz attractor]] is an example of a [[non-linear]] dynamical system. Studying this system helped give rise to [[chaos theory]].]]&lt;br /&gt;
&lt;br /&gt;
The [[Lorenz attractor is an example of a non-linear dynamical system. Studying this system helped give rise to chaos theory.]]&lt;br /&gt;
&lt;br /&gt;
'''洛伦兹吸引子 Lorenz Attractor'''是非线性动力系统的一个例子。对这个系统的研究产生了混沌理论。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Overview 综述 ==&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory and [[chaos theory]] deal with the long-term qualitative behavior of [[dynamical system]]s. Here, the focus is not on finding precise solutions to the equations defining the dynamical system (which is often hopeless), but rather to answer questions like &amp;quot;Will the system settle down to a steady state in the long term, and if so, what are the possible steady states?&amp;quot;, or &amp;quot;Does the long-term behavior of the system depend on its initial condition?&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory and chaos theory deal with the long-term qualitative behavior of dynamical systems. Here, the focus is not on finding precise solutions to the equations defining the dynamical system (which is often hopeless), but rather to answer questions like &amp;quot;Will the system settle down to a steady state in the long term, and if so, what are the possible steady states?&amp;quot;, or &amp;quot;Does the long-term behavior of the system depend on its initial condition?&amp;quot;&lt;br /&gt;
&lt;br /&gt;
动力系统理论和'''混沌理论 Chaos Theory'''是用来处理动力系统的&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;长期定性行为&amp;lt;/font&amp;gt;&amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 长周期性行为&amp;lt;/font&amp;gt;的理论。寻找动力系统方程的精确解通常是很难达到的。&amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 因此，&amp;lt;/font&amp;gt;这两个理论的重点不在于找到精确解，而是回答如下的问题，如“系统长期来看是否会稳定下来，如果可以，那么可能的稳定状态是什么样的?”，或“系统长期的行为是否取决于其初始条件?”&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
An important goal is to describe the fixed points, or steady states of a given dynamical system; these are values of the variable that don't change over time. Some of these fixed points are ''attractive'', meaning that if the system starts out in a nearby state, it converges towards the fixed point.&lt;br /&gt;
&lt;br /&gt;
An important goal is to describe the fixed points, or steady states of a given dynamical system; these are values of the variable that don't change over time. Some of these fixed points are attractive, meaning that if the system starts out in a nearby state, it converges towards the fixed point.&lt;br /&gt;
&lt;br /&gt;
描述给定动力系统的不动点或'''&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;定态&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;稳态&amp;lt;/font&amp;gt;Steady States'''是一个重要的目标。不动点或&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;定态&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;稳态&amp;lt;/font&amp;gt;的变量值不会随时间的变化而变化。&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;一些不动点是有吸引力的（attractive），即如果系统的初始值在它的附近，系统最终会收敛到这个不动点。&amp;lt;/font&amp;gt;&amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 某些不动点被称为“吸引子”，意味着如果系统即使不在它附近的状态开始，最终也会收敛到这些不动点。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Similarly, one is interested in ''periodic points'', states of the system that repeat after several timesteps. Periodic points can also be attractive. [[Sharkovskii's theorem]] is an interesting statement about the number of periodic points of a one-dimensional discrete dynamical system.&lt;br /&gt;
&lt;br /&gt;
Similarly, one is interested in periodic points, states of the system that repeat after several timesteps. Periodic points can also be attractive. Sharkovskii's theorem is an interesting statement about the number of periodic points of a one-dimensional discrete dynamical system.&lt;br /&gt;
&lt;br /&gt;
人们还对动力系统的'''周期点 Periodic Points'''感兴趣，即系统在几个时间步之后会不断重复的状态。周期点也可以是有吸引力的。Sharkovskii定理描述了一维离散动力系统的周期点的个数。&lt;br /&gt;
&amp;lt;font color='blue'&amp;gt;类似地，另一个研究兴趣是'''周期点 Periodic Points'''，即系统在重复几个时间步之后的状态。周期点也可以是吸引子。Sharkovskii定理描述了一维离散动力系统的周期点的个数。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Even simple [[nonlinear dynamical system]]s often exhibit seemingly random behavior that has been called ''chaos''.&amp;lt;ref&amp;gt;{{cite journal |last=Grebogi |first=C. |last2=Ott |first2=E. |last3=Yorke |first3=J. |year=1987 |title=Chaos, Strange Attractors, and Fractal Basin Boundaries in Nonlinear Dynamics |journal=[[Science (journal)|Science]] |volume=238 |issue=4827 |pages=632–638 |jstor=1700479 |doi=10.1126/science.238.4827.632 |pmid=17816542 |bibcode=1987Sci...238..632G }}&amp;lt;/ref&amp;gt; The branch of dynamical systems that deals with the clean definition and investigation of chaos is called ''[[chaos theory]]''.&lt;br /&gt;
&lt;br /&gt;
Even simple nonlinear dynamical systems often exhibit seemingly random behavior that has been called chaos. The branch of dynamical systems that deals with the clean definition and investigation of chaos is called chaos theory.&lt;br /&gt;
&lt;br /&gt;
即使是简单的非线性动力系统也常常表现出看似随机的行为，这种行为被称为混沌。混沌理论主要研究混沌的清晰定义和混沌的现象，它是动力系统理论的一个分支。&lt;br /&gt;
&lt;br /&gt;
== History 历史==&lt;br /&gt;
&lt;br /&gt;
The concept of dynamical systems theory has its origins in [[Newtonian mechanics]]. There, as in other natural sciences and engineering disciplines, the evolution rule of dynamical systems is given implicitly by a relation that gives the state of the system only a short time into the future.&lt;br /&gt;
&lt;br /&gt;
The concept of dynamical systems theory has its origins in Newtonian mechanics. There, as in other natural sciences and engineering disciplines, the evolution rule of dynamical systems is given implicitly by a relation that gives the state of the system only a short time into the future.&lt;br /&gt;
&lt;br /&gt;
动态系统理论的概念起源于牛顿运动定律。与其他自然科学和工程学科一样，动力系统的演化规律也是通过一种预测系统在未来很短时间内的状态的关系隐含地给出的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Before the advent of [[computer|fast computing machines]], solving a dynamical system required sophisticated mathematical techniques and could only be accomplished for a small class of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
Before the advent of fast computing machines, solving a dynamical system required sophisticated mathematical techniques and could only be accomplished for a small class of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
在高速计算机器出现之前，解决动力系统问题需要复杂的数学技能，而且还只能解决一小类动力系统问题。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Some excellent presentations of mathematical dynamic system theory include {{harvtxt|Beltrami|1990}}, {{harvtxt|Luenberger|1979}}, {{harvtxt|Padulo|Arbib|1974}}, and {{harvtxt|Strogatz|1994}}.&amp;lt;ref&amp;gt;Jerome R. Busemeyer (2008), [http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html &amp;quot;Dynamic Systems&amp;quot;]. To Appear in: ''Encyclopedia of cognitive science'', Macmillan. Retrieved 8 May 2008.  {{webarchive |url=https://web.archive.org/web/20080613053119/http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html |date=June 13, 2008 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Some excellent presentations of mathematical dynamic system theory include , , , and . To Appear in: ''Encyclopedia of cognitive science'', Macmillan. Retrieved 8 May 2008&lt;br /&gt;
&lt;br /&gt;
优秀的数学动力系统理论包括，，，和。--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|存疑]]）。&lt;br /&gt;
&lt;br /&gt;
&amp;lt;font color='blue'&amp;gt;原文是：Some excellent presentations of mathematical dynamic system theory include Beltrami (1990), Luenberger (1979), Padulo &amp;amp; Arbib (1974), and Strogatz (1994).[2] 是不是在粘贴或解析时内容有丢失？&lt;br /&gt;
&lt;br /&gt;
一些优秀的数学动力系统理论包括贝尔特拉米（Beltrami，1990年），龙伯格(Luenberger，1979年），帕杜罗&amp;amp;阿尔比布（Padulo＆Arbib，1974年）和斯托加茨（Strogatz，1994年）。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Concepts 概念==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Dynamical systems 动力系统===&lt;br /&gt;
&lt;br /&gt;
{{main|Dynamical system (definition)}}&lt;br /&gt;
&lt;br /&gt;
The [[dynamical system]] concept is a mathematical [[formal system|formalization]] for any fixed &amp;quot;rule&amp;quot; that describes the [[time]] dependence of a point's position in its [[ambient space]].  Examples include the [[mathematical model]]s that describe the swinging of a clock pendulum, the flow of water in a pipe, and the number of fish each spring in a lake.&lt;br /&gt;
&lt;br /&gt;
The dynamical system concept is a mathematical formalization for any fixed &amp;quot;rule&amp;quot; that describes the time dependence of a point's position in its ambient space.  Examples include the mathematical models that describe the swinging of a clock pendulum, the flow of water in a pipe, and the number of fish each spring in a lake.&lt;br /&gt;
&lt;br /&gt;
动力系统是一个对任何描述了点的位置在周围环境随时间变化的“固定”规则的数学式。举例来说，描述钟摆摆动、管道中的水流以及每年春天湖中鱼的数量的数学模型，都属于动力系统的概念范畴。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A dynamical system has a ''state'' determined by a collection of [[real numbers]], or more generally by a [[Set (mathematics)|set]] of [[Point (geometry)|points]] in an appropriate ''state space''.  Small changes in the state of the system correspond to small changes in the numbers.  The numbers are also the coordinates of a geometrical space—a [[manifold]].   The ''evolution rule'' of the dynamical system is a [[function (mathematics)|fixed rule]] that describes what future states follow from the current state.  The rule may be [[Deterministic system (mathematics)|deterministic]] (for a given time interval only one future state follows from the current state) or [[stochastic differential equation|stochastic]] (the evolution of the state is subject to random shocks).&lt;br /&gt;
&lt;br /&gt;
A dynamical system has a state determined by a collection of real numbers, or more generally by a set of points in an appropriate state space.  Small changes in the state of the system correspond to small changes in the numbers.  The numbers are also the coordinates of a geometrical space—a manifold.   The evolution rule of the dynamical system is a fixed rule that describes what future states follow from the current state.  The rule may be deterministic (for a given time interval only one future state follows from the current state) or stochastic (the evolution of the state is subject to random shocks).&lt;br /&gt;
&lt;br /&gt;
动力系统的状态是由一组实数决定的，更广泛地说，是由适当的状态空间中的一组点决定的。系统状态的微小变化对应于数字的变化。这些数字也是几何空间——'''流形 Manifold'''——的坐标组。动力系统的演化是描述了在当前状态之后出现的未来状态的固定规则。这个规则可以是确定性的(在给定的时间间隔内，有且仅有一个未来状态在当前状态之后出现)，或随机性的(状态的演化受到随机因素的影响)。&lt;br /&gt;
&lt;br /&gt;
=== Dynamicism 动态主义===&lt;br /&gt;
&lt;br /&gt;
[[Dynamicism]], also termed the ''dynamic hypothesis'' or the ''dynamic hypothesis in cognitive science'' or ''dynamic cognition'', is a new approach in [[cognitive science]] exemplified by the work of philosopher [[Tim van Gelder]]. It argues that [[differential equations]] are more suited to modelling [[cognition]] than more traditional [[computer]] models.&lt;br /&gt;
&lt;br /&gt;
Dynamicism, also termed the dynamic hypothesis or the dynamic hypothesis in cognitive science or dynamic cognition, is a new approach in cognitive science exemplified by the work of philosopher Tim van Gelder. It argues that differential equations are more suited to modelling cognition than more traditional computer models.&lt;br /&gt;
&lt;br /&gt;
'''动态主义 Dynamicism'''，又称动态假设，或称认知科学、动态认知中的动态假设，是以哲学家Tim van Gelder的著作为代表的认知科学的一种新取向。动态主义认为微分方程比传统的计算机模型更适合于建立认知模型。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Nonlinear system 非线性系统===&lt;br /&gt;
&lt;br /&gt;
{{main|Nonlinear system}}&lt;br /&gt;
&lt;br /&gt;
In [[mathematics]], a [[nonlinear system]] is a system that is not [[linear system|linear]]—i.e., a system that does not satisfy the [[superposition principle]]. Less technically, a nonlinear system is any problem where the variable(s) to solve for cannot be written as a linear sum of independent components. A [[Homogeneity (physics)|nonhomogeneous]] system, which is linear apart from the presence of a function of the [[independent variable]]s, is nonlinear according to a strict definition, but such systems are usually studied alongside linear systems, because they can be transformed to a linear system as long as a particular solution is known.&lt;br /&gt;
&lt;br /&gt;
In mathematics, a nonlinear system is a system that is not linear—i.e., a system that does not satisfy the superposition principle. Less technically, a nonlinear system is any problem where the variable(s) to solve for cannot be written as a linear sum of independent components. A nonhomogeneous system, which is linear apart from the presence of a function of the independent variables, is nonlinear according to a strict definition, but such systems are usually studied alongside linear systems, because they can be transformed to a linear system as long as a particular solution is known.&lt;br /&gt;
&lt;br /&gt;
在数学中，'''非线性系统 Nonlinear System'''是指系统不是线性的——也就是说，一个不满足叠加原理的系统。更通俗地说，非线性系统是待求解变量不能被写成其独立分量的线性和的系统。非齐次系统根据定义严格来说是非线性的，除了它的自变量包含函数以外其他部分都是线性的。但非齐次系统通常与线性系统一起研究，因为只要知道特解，它们就可以转化为线性系统。&lt;br /&gt;
&lt;br /&gt;
== Related fields 相关领域==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Arithmetic dynamics 算术动态系统===&lt;br /&gt;
&lt;br /&gt;
:[[Arithmetic dynamics]] is a field that emerged in the 1990s that amalgamates two areas of mathematics, [[dynamical systems]] and [[number theory]]. Classically, discrete dynamics refers to the study of the [[Iterated function|iteration]] of self-maps of the [[complex plane]] or [[real line]]. Arithmetic dynamics is the study of the number-theoretic properties of integer, rational, {{math|&amp;lt;var&amp;gt;p&amp;lt;/var&amp;gt;}}-adic, and/or algebraic points under repeated application of a [[polynomial]] or [[rational function]].&lt;br /&gt;
&lt;br /&gt;
Arithmetic dynamics is a field that emerged in the 1990s that amalgamates two areas of mathematics, dynamical systems and number theory. Classically, discrete dynamics refers to the study of the iteration of self-maps of the complex plane or real line. Arithmetic dynamics is the study of the number-theoretic properties of integer, rational, -adic, and/or algebraic points under repeated application of a polynomial or rational function.&lt;br /&gt;
&lt;br /&gt;
'''算术动态系统 Arithmetic Dynamics'''是20世纪90年代出现的一个领域，融合了动力系统和数论这两个数学领域。经典的离散动力学研究复平面或实直线的自映射的迭代。算术动态系统研究内容是在多项式或有理函数中的整数、有理数、并元 --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|存疑]]） 和/或代数点的数论性质。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Chaos theory 混沌理论===&lt;br /&gt;
&lt;br /&gt;
:[[Chaos theory]] describes the behavior of certain [[dynamical system (definition)|dynamical system]]s – that is, systems whose state evolves with time – that may exhibit dynamics that are highly sensitive to initial conditions (popularly referred to as the [[butterfly effect]]). As a result of this sensitivity, which manifests itself as an exponential growth of perturbations in the initial conditions, the behavior of chaotic systems appears [[randomness|random]]. This happens even though these systems are [[deterministic system (philosophy)|deterministic]], meaning that their future dynamics are fully defined by their initial conditions, with no random elements involved. This behavior is known as deterministic chaos, or simply ''chaos''.&lt;br /&gt;
&lt;br /&gt;
Chaos theory describes the behavior of certain dynamical systems – that is, systems whose state evolves with time – that may exhibit dynamics that are highly sensitive to initial conditions (popularly referred to as the butterfly effect). As a result of this sensitivity, which manifests itself as an exponential growth of perturbations in the initial conditions, the behavior of chaotic systems appears random. This happens even though these systems are deterministic, meaning that their future dynamics are fully defined by their initial conditions, with no random elements involved. This behavior is known as deterministic chaos, or simply chaos.&lt;br /&gt;
&lt;br /&gt;
混沌理论描述了某些状态随时间演化的动力系统的行为，这些系统可能表现出对初始条件高度敏感的特点（通常被称为'''蝴蝶效应 Butterfly Effect'''）。由于扰动受初始条件影响而指数增长，因此混沌系统具有敏感性，敏感性使它的行为看起来是随机的。但是这种敏感性也会出现在确定的动力系统中，即未来的动力学完全由它的初始条件定义，没有任何随机因素参与的系统中。这种现象被称为确定性混沌，或简单混沌。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Complex systems 复杂系统===&lt;br /&gt;
&lt;br /&gt;
:[[Complex systems]] is a scientific field that studies the common properties of [[system]]s considered [[Complexity|complex]] in [[nature]], [[society]], and [[science]]. It is also called ''complex systems theory'', ''complexity science'', ''study of complex systems'' and/or ''sciences of complexity''. The key problems of such systems are  difficulties with their formal [[Scientific modelling|modeling]] and [[simulation]]. From such perspective, in different research contexts complex systems are defined on the base of their different attributes.&lt;br /&gt;
&lt;br /&gt;
Complex systems is a scientific field that studies the common properties of systems considered complex in nature, society, and science. It is also called complex systems theory, complexity science, study of complex systems and/or sciences of complexity. The key problems of such systems are  difficulties with their formal modeling and simulation. From such perspective, in different research contexts complex systems are defined on the base of their different attributes.&lt;br /&gt;
&lt;br /&gt;
'''复杂系统 Complex Systems'''是研究自然、社会和科学中复杂现象的共同性质的科学领域。它也被称为复杂系统理论、复杂性科学、复杂系统研究和关于复杂性的科学。这些系统的关键问题在于对系统的形式化建模与仿真。因此，复杂系统是根据在不同的研究语境中的不同属性来定义的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
:The study of complex systems is bringing new vitality to many areas of science where a more typical [[reductionist]] strategy has fallen short. ''Complex systems'' is therefore often used as a broad term encompassing a research approach to problems in many diverse disciplines including [[neurosciences]], [[social sciences]], [[meteorology]], [[chemistry]], [[physics]], [[computer science]], [[psychology]], [[artificial life]], [[evolutionary computation]], [[economics]], earthquake prediction, [[molecular biology]] and inquiries into the nature of living [[cell (biology)|cell]]s themselves.&lt;br /&gt;
&lt;br /&gt;
The study of complex systems is bringing new vitality to many areas of science where a more typical reductionist strategy has fallen short. Complex systems is therefore often used as a broad term encompassing a research approach to problems in many diverse disciplines including neurosciences, social sciences, meteorology, chemistry, physics, computer science, psychology, artificial life, evolutionary computation, economics, earthquake prediction, molecular biology and inquiries into the nature of living cells themselves.&lt;br /&gt;
&lt;br /&gt;
还原论策略已经不足以研究许多科学领域的问题，而复杂系统的研究则为科学带来了广泛的新活力。复杂系统通常被用作一个应用广泛的研究方法术语，并涵盖许多不同的学科，包括神经科学、社会科学、气象学、化学、物理学、计算机科学、心理学、人工生命、进化计算、经济学、地震预测、分子生物学以及对活细胞的研究等。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Control theory 控制理论===&lt;br /&gt;
&lt;br /&gt;
:[[Control theory]] is an interdisciplinary branch of [[engineering]] and [[mathematics]], in part it deals with influencing the behavior of [[dynamical system]]s.&lt;br /&gt;
&lt;br /&gt;
Control theory is an interdisciplinary branch of engineering and mathematics, in part it deals with influencing the behavior of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
'''控制理论 Control Theory'''是工程和数学的一个交叉学科，它的其中一部分研究影响动力系统行为的各种因素。&lt;br /&gt;
&lt;br /&gt;
控制理论是一个研究如何调整动态系统特性的理论，它也是工程和数学的一个交叉学科，逐渐的应用在许多社会科学中，例如心理学、社会学（社会学中的控制理论）、犯罪学及'''金融系统 Financial System'''。控制理论一般的目的是借由控制器的动作让系统稳定，也就是系统维持在设定值，而且不会在设定值附近晃动。设定值一般维持不变的控制称为调节，设定值快速变化，要求跟踪速度加速度等的控制称为伺服。它的其中一部分研究影响动力系统行为的各种因素。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Ergodic theory 遍历理论===&lt;br /&gt;
&lt;br /&gt;
:[[Ergodic theory]] is a branch of [[mathematics]] that studies [[dynamical system]]s with an [[invariant measure]] and related problems. Its initial development was motivated by problems of [[statistical physics]].&lt;br /&gt;
&lt;br /&gt;
Ergodic theory is a branch of mathematics that studies dynamical systems with an invariant measure and related problems. Its initial development was motivated by problems of statistical physics.&lt;br /&gt;
&lt;br /&gt;
'''遍历理论 Ergodic Theory'''是数学的一个分支，研究有不变测度相关问题的动力系统。它最初的发展受到了统计物理学的推动。&lt;br /&gt;
遍历理论是研究保测变换的渐近性态的数学分支。它起源于为统计力学提供基础的&amp;quot;遍历假设&amp;quot;研究，并与动力系统理论、概率论、信息论、泛函分析、数论等数学分支有着密切的联系。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Functional analysis 泛函分析===&lt;br /&gt;
&lt;br /&gt;
:[[Functional analysis]] is the branch of [[mathematics]], and specifically of [[mathematical analysis|analysis]], concerned with the study of [[vector space]]s and [[operator (mathematics)|operator]]s acting upon them. It has its historical roots in the study of [[functional space]]s, in particular transformations of [[function (mathematics)|functions]], such as the [[Fourier transform]], as well as in the study of [[differential equations|differential]] and [[integral equations]]. This usage of the word ''[[functional (mathematics)|functional]]'' goes back to the [[calculus of variations]], implying a function whose argument is a function. Its use in general has been attributed to mathematician and physicist [[Vito Volterra]] and its founding is largely attributed to mathematician [[Stefan Banach]].&lt;br /&gt;
&lt;br /&gt;
Functional analysis is the branch of mathematics, and specifically of analysis, concerned with the study of vector spaces and operators acting upon them. It has its historical roots in the study of functional spaces, in particular transformations of functions, such as the Fourier transform, as well as in the study of differential and integral equations. This usage of the word functional goes back to the calculus of variations, implying a function whose argument is a function. Its use in general has been attributed to mathematician and physicist Vito Volterra and its founding is largely attributed to mathematician Stefan Banach.&lt;br /&gt;
&lt;br /&gt;
'''泛函分析 Functional analysis'''是数学分析的一个分支，研究向量空间和作用于向量空间的算子。它源于对函数空间的研究，特别是对函数变换的研究，例如傅里叶变换，微积分方程的研究等。泛函分析的名称“Functional Analysis”中，“functional”这个词的用法可以追溯到变分法，也就是说函数的参数是一个函数。这个词的使用一般被认为归功于数学家和物理学家Vito Volterra，和数学家Stefan Banach。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Graph dynamical systems 图动力系统===&lt;br /&gt;
&lt;br /&gt;
:The concept of [[graph dynamical system]]s (GDS) can be used to capture a wide range of processes taking place on graphs or networks. A major theme in the mathematical and computational analysis of graph dynamical systems is to relate their structural properties (e.g. the network connectivity) and the global dynamics that result.&lt;br /&gt;
&lt;br /&gt;
The concept of graph dynamical systems (GDS) can be used to capture a wide range of processes taking place on graphs or networks. A major theme in the mathematical and computational analysis of graph dynamical systems is to relate their structural properties (e.g. the network connectivity) and the global dynamics that result.&lt;br /&gt;
&lt;br /&gt;
'''图动力系统 Graph dynamical systems (GDS)'''可以用来描绘图或网络上发生的各种过程。图动力系统的数学和计算分析的一个主要主题是关联它们的结构性质(例如:网络连接)和结构性质造成的网络整体的动态结果。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Projected dynamical systems 投影动力系统===&lt;br /&gt;
&lt;br /&gt;
:[[Projected dynamical systems]] it is a [[mathematics|mathematical]] theory investigating the behaviour of [[dynamical system]]s where solutions are restricted to a constraint set. The discipline shares connections to and applications with both the static world of [[Optimization (mathematics)|optimization]] and [[Equilibrium point|equilibrium]] problems and the dynamical world of [[ordinary differential equations]]. A projected dynamical system is given by the [[flow (mathematics)|flow]] to the projected differential equation.&lt;br /&gt;
&lt;br /&gt;
Projected dynamical systems it is a mathematical theory investigating the behaviour of dynamical systems where solutions are restricted to a constraint set. The discipline shares connections to and applications with both the static world of optimization and equilibrium problems and the dynamical world of ordinary differential equations. A projected dynamical system is given by the flow to the projected differential equation.&lt;br /&gt;
&lt;br /&gt;
'''投影动力系统 Projected Dynamical Systems'''是研究解在一个约束集内的动力系统行为的数学理论。这门学科与静态世界中的最优化和平衡问题以及动态世界中的常微分方程都有联系，并且都有相互联系的应用。一个投影动力系统是由投影微分方程的'''流形 flow'''给定的。&lt;br /&gt;
通过对投影微分方程的流分析，给出了一个投影动力系统的表达式：&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\frac{dx(t)}{dt} = \Pi_K(x(t),-F(x(t)))&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中K为约束集。这种形式的微分方程因具有不连续的向量场而值得注意。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Symbolic dynamics 符号动力学===&lt;br /&gt;
&lt;br /&gt;
:[[Symbolic dynamics]] is the practice of modelling a topological or smooth [[dynamical system]] by a discrete space consisting of infinite [[sequence]]s of abstract symbols, each of which corresponds to a state of the system, with the dynamics (evolution) given by the [[shift operator]].&lt;br /&gt;
&lt;br /&gt;
Symbolic dynamics is the practice of modelling a topological or smooth dynamical system by a discrete space consisting of infinite sequences of abstract symbols, each of which corresponds to a state of the system, with the dynamics (evolution) given by the shift operator.&lt;br /&gt;
&lt;br /&gt;
'''符号动力学 Symbolic Dynamics'''是通过一个由抽象符号的无限序列组成的离散空间建立一个拓扑或光滑动力系统的方法。每一个抽象符号的无限序列序列对应于系统的一个状态，并由移位算子给出动力学(演化)。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== System dynamics 系统动力学===&lt;br /&gt;
&lt;br /&gt;
:[[System dynamics]] is an approach to understanding the behaviour of systems over time.  It deals with internal feedback loops and time delays that affect the behaviour and state of the entire system.&amp;lt;ref name=&amp;quot;sysdyn&amp;quot;&amp;gt;[http://sysdyn.clexchange.org MIT System Dynamics in Education Project (SDEP)&amp;lt;!-- Bot generated title --&amp;gt;] {{webarchive|url=https://web.archive.org/web/20080509163801/http://sysdyn.clexchange.org/ |date=2008-05-09 }}&amp;lt;/ref&amp;gt;  What makes using system dynamics different from other approaches to studying systems is the use of [[feedback]] loops and [[Stock and flow|stocks and flows]].  These elements help describe how even seemingly simple systems display baffling [[nonlinearity]].&lt;br /&gt;
&lt;br /&gt;
System dynamics is an approach to understanding the behaviour of systems over time.  It deals with internal feedback loops and time delays that affect the behaviour and state of the entire system.  What makes using system dynamics different from other approaches to studying systems is the use of feedback loops and stocks and flows.  These elements help describe how even seemingly simple systems display baffling nonlinearity.&lt;br /&gt;
&lt;br /&gt;
'''系统动力学 System Dynamics'''是一种理解系统随时间变化行为的方法。它是用来处理影响整个系统行为和状态的内部反馈回路和时间延迟的方法。系统动力学不同于其他系统研究方法的地方在于它使用了反馈环、股票（stocks）和流形（flows）--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|如何翻译stocks 和 folows]]）的元素。这些元素有助于描述看似简单的系统如何显示复杂的非线性行为。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Topological dynamics 拓扑动力学===&lt;br /&gt;
&lt;br /&gt;
:[[Topological dynamics]] is a branch of the theory of dynamical systems in which qualitative, asymptotic properties of dynamical systems are studied from the viewpoint of [[general topology]].&lt;br /&gt;
&lt;br /&gt;
Topological dynamics is a branch of the theory of dynamical systems in which qualitative, asymptotic properties of dynamical systems are studied from the viewpoint of general topology.&lt;br /&gt;
&lt;br /&gt;
'''拓扑动力学 Topological Dynamics'''是动力系统理论的一个分支。在拓朴动力学中，动力系统的定性性质和渐近性质是从一般拓扑学的观点来研究的。&lt;br /&gt;
&lt;br /&gt;
== Applications 应用==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== In human development 在人类发展中的应用===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In [[Developmental psychology|human development]], dynamical systems theory has been used to enhance and simplify Erik Erikson's [[eight stages of psychosocial development]] and offers a standard method of examining the universal pattern of human development. This method is based on the self-organizing and [[fractal]] properties of the [[Fibonacci sequence]].&amp;lt;ref name=Sacco&amp;gt;{{cite journal|last=Sacco|first=R.G.|title=Re-envisaging the eight developmental stages of Erik Erikson: The Fibonacci Life-Chart Method (FLCM)|journal=Journal of Educational and Developmental Psychology|date=2013|volume=3|issue=1|pages=140–146|doi=10.5539/jedp.v3n1p140|doi-access=free}}&amp;lt;/ref&amp;gt; Using mathematical modeling, a natural progression of human development with eight life stages has been identified:  early infancy (0–2 years), toddler (2–4 years), early childhood (4–7 years), middle childhood (7–11 years), adolescence (11–18 years), young adulthood (18–29 years), middle adulthood (29–48 years), and older adulthood (48–78+ years).&amp;lt;ref name=Sacco/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In human development, dynamical systems theory has been used to enhance and simplify Erik Erikson's eight stages of psychosocial development and offers a standard method of examining the universal pattern of human development. This method is based on the self-organizing and fractal properties of the Fibonacci sequence. Using mathematical modeling, a natural progression of human development with eight life stages has been identified:  early infancy (0–2 years), toddler (2–4 years), early childhood (4–7 years), middle childhood (7–11 years), adolescence (11–18 years), young adulthood (18–29 years), middle adulthood (29–48 years), and older adulthood (48–78+ years).&lt;br /&gt;
&lt;br /&gt;
在人类发展方面，动力系统理论已经被用来增强和简化 Erik Erikson 的'''社会心理发展8阶段理论 Eight Stages of Psychosocial Development'''，并提供了一个检验人类发展普遍模式的标准方法。该方法基于斐波那契数列的'''自组织性 self-organizing'''和'''分形 Fractal''' 特性。利用数学模型，人类发展的自然进程被分为8个生命阶段: 早期婴儿期(0-2岁)、幼儿期(2-4岁)、童年早期(4-7岁)、童年中期(7-11岁)、青春期(11-18岁)、成年早期(18-29岁)、成年中期(29-48岁)和老年成年期(48-78岁及以上)。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
According to this model, stage transitions between age intervals represent self-organization processes at multiple levels (e.g., molecules, genes, cell, organ, organ system, organism, behavior, and environment). For example, at the stage transition from [[adolescence]] to [[young adulthood]], and after reaching the critical point of 18 years of age (young adulthood), a peak in [[testosterone]] is observed in males&amp;lt;ref&amp;gt;{{cite journal |last1=Kelsey |first1=T. W. |title=A validated age-related normative model for male total testosterone shows increasing variance but no decline after age 40 years. |journal=PLOS One |volume=9 |issue=10 |pages=e109346 |doi=10.1371/journal.pone.0109346|pmid=25295520 |year=2014 |pmc=4190174 |bibcode=2014PLoSO...9j9346K }}&amp;lt;/ref&amp;gt; and the period of optimal [[fertility]] begins in females.&amp;lt;ref&amp;gt;{{cite book |last1=Tulandi |first1=T. |title=Preservation of fertility |date=2004 |publisher=Taylor &amp;amp; Francis |pages=1–20}}&amp;lt;/ref&amp;gt; Similarly, at age 30 optimal fertility begins to decline in females,&amp;lt;ref name=&amp;quot;Social Science 2008&amp;quot;&amp;gt;{{cite journal |last1=Blanchflower |first1=D. G. |title=Is well-being U-shaped over the life cycle? |journal=Social Science &amp;amp; Medicine |volume=66 |issue=8 |pages=1733–1749 |doi=10.1016/j.socscimed.2008.01.030|pmid=18316146 |year=2008 |citeseerx=10.1.1.63.5221 }}&amp;lt;/ref&amp;gt; and at the stage transition from [[middle adulthood]] to older adulthood at 48 years, the average age of onset of [[menopause]] occurs.&amp;lt;ref name=&amp;quot;Social Science 2008&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
According to this model, stage transitions between age intervals represent self-organization processes at multiple levels (e.g., molecules, genes, cell, organ, organ system, organism, behavior, and environment). For example, at the stage transition from adolescence to young adulthood, and after reaching the critical point of 18 years of age (young adulthood), a peak in testosterone is observed in males and the period of optimal fertility begins in females. Similarly, at age 30 optimal fertility begins to decline in females, and at the stage transition from middle adulthood to older adulthood at 48 years, the average age of onset of menopause occurs.&lt;br /&gt;
&lt;br /&gt;
根据这个模型，年龄的阶段转换代表了多层次的自组织过程(例如，分子、基因、细胞、器官、器官系统、生物体、行为和环境)。例如，在从青春期向成年早期过渡的阶段中，在达到18岁这一关键年龄之后，男性的睾丸激素达到高峰，女性的最佳生育期开始。同样，在30岁时，女性的最佳生育能力开始下降；在从成年中期过渡到老年成年期时，48岁是绝经的平均年龄。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
These events are physical bioattractors of aging from the perspective of Fibonacci mathematical modeling and dynamically systems theory. In practical terms, prediction in human development becomes possible in the same statistical sense in which the average temperature or precipitation at different times of the year can be used for [[weather forecasting]]. Each of the predetermined stages of human development follows an optimal epigenetic biological pattern. This phenomenon can be explained by the occurrence of Fibonacci numbers in biological [[DNA]]&amp;lt;ref&amp;gt;{{cite journal |last1=Perez |first1=J. C. (2010). |title=Codon populations in single-stranded whole human genome DNA are fractal and fine-tuned by the Golden Ratio 1.618. |journal=Interdisciplinary Sciences: Computational Life Sciences |volume=2 |issue=3 |pages=228–240 |doi=10.1007/s12539-010-0022-0|pmid=20658335 |year=2010 }}&amp;lt;/ref&amp;gt; and self-organizing properties of the Fibonacci numbers that converge on the [[golden ratio]].&lt;br /&gt;
&lt;br /&gt;
These events are physical bioattractors of aging from the perspective of Fibonacci mathematical modeling and dynamically systems theory. In practical terms, prediction in human development becomes possible in the same statistical sense in which the average temperature or precipitation at different times of the year can be used for weather forecasting. Each of the predetermined stages of human development follows an optimal epigenetic biological pattern. This phenomenon can be explained by the occurrence of Fibonacci numbers in biological DNA and self-organizing properties of the Fibonacci numbers that converge on the golden ratio.&lt;br /&gt;
&lt;br /&gt;
从斐波那契数学模型和动力系统理论的角度来看，上述事件是衰老的'''物理生物吸引子Physical Bioattractors'''。实际上，正如一年中不同时间的平均气温和降水量可以用来预测天气，预测人类的发展在统计意义上同样是可能的。人类发展的每个'''预定阶段Predetermined Stages'''都遵循最佳的'''表观遗传生物模式 Epigenetic Biological Pattern'''。这种现象可以用 DNA 中的斐波那契数和收敛于黄金分割比的斐波那契数的自组织特性来解释。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== In biomechanics 在运动生物力学中的应用===&lt;br /&gt;
&lt;br /&gt;
In [[sports biomechanics]], dynamical systems theory has emerged in the movement sciences as a viable framework for modeling athletic performance. From a dynamical systems perspective, the human movement system is a highly intricate network of co-dependent sub-systems (e.g. respiratory, circulatory, nervous, skeletomuscular, perceptual) that are composed of a large number of interacting components (e.g. blood cells, oxygen molecules, muscle tissue, metabolic enzymes, connective tissue and bone). In dynamical systems theory, movement patterns emerge through generic processes of self-organization found in physical and biological systems.&amp;lt;ref&amp;gt;Paul S Glazier, Keith Davids, Roger M Bartlett (2003). [http://www.sportsci.org/jour/03/psg.htm &amp;quot;DYNAMICAL SYSTEMS THEORY: a Relevant Framework for Performance-Oriented Sports Biomechanics Research&amp;quot;]. in: Sportscience 7. Accessed 2008-05-08.&amp;lt;/ref&amp;gt; There is no research validation of any of the claims associated to the conceptual application of this framework.&lt;br /&gt;
&lt;br /&gt;
In sports biomechanics, dynamical systems theory has emerged in the movement sciences as a viable framework for modeling athletic performance. From a dynamical systems perspective, the human movement system is a highly intricate network of co-dependent sub-systems (e.g. respiratory, circulatory, nervous, skeletomuscular, perceptual) that are composed of a large number of interacting components (e.g. blood cells, oxygen molecules, muscle tissue, metabolic enzymes, connective tissue and bone). In dynamical systems theory, movement patterns emerge through generic processes of self-organization found in physical and biological systems. There is no research validation of any of the claims associated to the conceptual application of this framework.&lt;br /&gt;
&lt;br /&gt;
在运动生物力学中，动力系统理论新兴地成为对运动表现建模的可行框架。从动力系统的角度来看，人类的运动系统是由高度复杂和相互依赖的子系统网络（如呼吸、循环、神经、骨骼肌系统和知觉系统等）组成的，它们由大量相互作用的部分组成（包括血细胞、氧分子、肌肉组织、代谢酶、结缔组织和骨骼等)。动力系统理论中，运动模式通过物理系统和生物系统中的一般自组织过程出现。没有任何研究证实与这一框架的概念相关的任何主张。&lt;br /&gt;
&lt;br /&gt;
=== In cognitive science 在认知科学中的应用===&lt;br /&gt;
&lt;br /&gt;
Dynamical system theory has been applied in the field of [[neurodynamics|neuroscience]] and [[cognitive science|cognitive development]], especially in [[the neo-Piagetian theories of cognitive development]]. It is the belief that cognitive development is best represented by physical theories rather than theories based on syntax and [[AI]]. It also believed that differential equations are the most appropriate tool for modeling human behavior. These equations are interpreted to represent an agent's cognitive trajectory through [[state space]]. In other words, dynamicists argue that [[psychology]] should be (or is) the description (via differential equations) of the cognitions and behaviors of an agent under certain environmental and internal pressures. The language of chaos theory is also frequently adopted.&lt;br /&gt;
&lt;br /&gt;
Dynamical system theory has been applied in the field of neuroscience and cognitive development, especially in the neo-Piagetian theories of cognitive development. It is the belief that cognitive development is best represented by physical theories rather than theories based on syntax and AI. It also believed that differential equations are the most appropriate tool for modeling human behavior. These equations are interpreted to represent an agent's cognitive trajectory through state space. In other words, dynamicists argue that psychology should be (or is) the description (via differential equations) of the cognitions and behaviors of an agent under certain environmental and internal pressures. The language of chaos theory is also frequently adopted.&lt;br /&gt;
&lt;br /&gt;
动力系统理论已经被应用于神经科学和认知发展领域，特别是在认知发展的'''新皮亚杰学派 neo-Piagetian'''中。人们相信，物理学理论比句法学理论和人工智能理论更能代表认知发展。人们还相信微分方程是人类行为建模最合适的工具。人们认为微分方程可以解释为通过状态空间代表一个主体的认知轨迹的算式。换句话说，动力学家认为心理学应该(或者是)(通过微分方程)描述在一定的环境和内部压力下的主体的认知和行为的学科。混沌理论在相关领域也经常被采用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In it, the learner's mind reaches a state of disequilibrium where old patterns have broken down. This is the phase transition of cognitive development. [[Self-organization]] (the spontaneous creation of coherent forms) sets in as activity levels link to each other. Newly formed macroscopic and microscopic structures support each other, speeding up the process. These links form the structure of a new state of order in the mind through a process called ''scalloping'' (the repeated building up and collapsing of complex performance.) This new, novel state is progressive, discrete, idiosyncratic and unpredictable.&amp;lt;ref&amp;gt;{{cite journal|title=The Promise of Dynamic Systems Approaches for an Integrated Account of Human Development|journal=Child Development|date=2000-02-25|first=Mark D.|last=Lewis|volume=71|issue=1|pages=36–43|id= |url=http://home.oise.utoronto.ca/~mlewis/Manuscripts/Promise.pdf|accessdate=2008-04-04|doi=10.1111/1467-8624.00116|pmid=10836556 |citeseerx=10.1.1.72.3668}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In it, the learner's mind reaches a state of disequilibrium where old patterns have broken down. This is the phase transition of cognitive development. Self-organization (the spontaneous creation of coherent forms) sets in as activity levels link to each other. Newly formed macroscopic and microscopic structures support each other, speeding up the process. These links form the structure of a new state of order in the mind through a process called scalloping (the repeated building up and collapsing of complex performance.) This new, novel state is progressive, discrete, idiosyncratic and unpredictable.&lt;br /&gt;
&lt;br /&gt;
在学习的过程中，旧的模式被打破了，学习者的思维达到了一种不平衡的状态。这是认知发展的阶段性转变。自组织(连贯的自发创造(the spontaneous creation of coherent forms))在'''活动水平 Activity Levels'''相互联系时产生。新形成的宏观和微观结构相互支持，加速了这一过程。这些联系在头脑中形成了一种具有新状态的结构，这个过程被称为“扇贝化 Scalloping”，也就是头脑的复杂性能的不断累积和崩溃的过程 --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|扇贝化的翻译拿不准，这句话的描述比较抽象]]）。这种新的状态是渐进的、离散的、异质的的和不可预知的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Dynamic systems theory has recently been used to explain a long-unanswered problem in child development referred to as the [[A-not-B error]].&amp;lt;ref&amp;gt;{{cite journal|title=Development as a dynamic system|journal=Trends in Cognitive Sciences|date=2003-07-30|first=Linda B.|last=Smith|author2=Esther Thelen|volume=7|issue=8|pages=343–8|id= |url=http://www.indiana.edu/~cogdev/labwork/dynamicsystem.pdf|accessdate=2008-04-04|doi=10.1016/S1364-6613(03)00156-6|pmid=12907229|citeseerx=10.1.1.294.2037}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Dynamic systems theory has recently been used to explain a long-unanswered problem in child development referred to as the A-not-B error.&lt;br /&gt;
&lt;br /&gt;
动力系统理论最近还被用来解释儿童发展中一个长期没有答案的问题，即 A-not-B 错误。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===In second language development 在二语习得中的应用===&lt;br /&gt;
&lt;br /&gt;
{{Main|Dynamic approach to second language development}}&lt;br /&gt;
&lt;br /&gt;
The application of Dynamic Systems Theory to study [[second language acquisition]] is attributed to [[Diane Larsen-Freeman]] who published an article in 1997 in which she claimed that [[second language acquisition]] should be viewed as a developmental process which includes [[language attrition]] as well as language acquisition.&amp;lt;ref&amp;gt;{{cite web|url=https://academic.oup.com/applij/article-abstract/18/2/141/134192|title=Chaos/Complexity Science and Second Language Acquisition|date=1997|publisher=Applied Linguistics}}&amp;lt;/ref&amp;gt; In her article she claimed that language should be viewed as a dynamic system which is dynamic, complex, nonlinear, chaotic, unpredictable, sensitive to initial conditions, open, self-organizing, feedback sensitive, and adaptive.&lt;br /&gt;
&lt;br /&gt;
The application of Dynamic Systems Theory to study second language acquisition is attributed to Diane Larsen-Freeman who published an article in 1997 in which she claimed that second language acquisition should be viewed as a developmental process which includes language attrition as well as language acquisition. In her article she claimed that language should be viewed as a dynamic system which is dynamic, complex, nonlinear, chaotic, unpredictable, sensitive to initial conditions, open, self-organizing, feedback sensitive, and adaptive.&lt;br /&gt;
&lt;br /&gt;
动力系统理论在二语习得研究中的应用归功于 Diane Larsen-Freeman，她在1997年发表的一篇文章中认为，二语习得应该被看作是一个包括语言流失和习得在内的发展过程。她在文章中认为，语言应该被看作是一个动态的、复杂的、非线性的、混沌的、不可预知的、对初始条件敏感的、开放的、自组织的、反馈敏感的和适应性的动力系统。&lt;br /&gt;
&lt;br /&gt;
== See also 参见==&lt;br /&gt;
&lt;br /&gt;
;Related subjects&lt;br /&gt;
&lt;br /&gt;
Related subjects&lt;br /&gt;
&lt;br /&gt;
相关科目&lt;br /&gt;
&lt;br /&gt;
{{div col|colwidth=20em}}&lt;br /&gt;
&lt;br /&gt;
* [[List of dynamical system topics]] 动力系统主题清单&lt;br /&gt;
&lt;br /&gt;
* [[Baker's map]]&lt;br /&gt;
&lt;br /&gt;
* [[Biological applications of bifurcation theory]] 分支理论的生物学应用&lt;br /&gt;
&lt;br /&gt;
* [[Dynamical system (definition)]] 动力系统（定义）&lt;br /&gt;
&lt;br /&gt;
* [[Embodied Embedded Cognition]] 具身认知&lt;br /&gt;
&lt;br /&gt;
* [[Fibonacci numbers]] 斐波那契数&lt;br /&gt;
&lt;br /&gt;
* [[Fractals]] 分形&lt;br /&gt;
&lt;br /&gt;
* [[Gingerbreadman map]]&lt;br /&gt;
&lt;br /&gt;
* [[Halo orbit]] Halo 轨道&lt;br /&gt;
&lt;br /&gt;
* [[List of types of systems theory]] 动力系统类型清单&lt;br /&gt;
&lt;br /&gt;
* [[Oscillation]] 振动性&lt;br /&gt;
&lt;br /&gt;
* [[Postcognitivism]]&lt;br /&gt;
&lt;br /&gt;
* [[Recurrent neural network]] 递归神经网络&lt;br /&gt;
&lt;br /&gt;
* [[Combinatorics and dynamical systems]] 组合数学和动力系统&lt;br /&gt;
&lt;br /&gt;
* [[Synergetics (Haken)|Synergetics]] 协同学(Haken)&lt;br /&gt;
&lt;br /&gt;
* [[Systemography]]&lt;br /&gt;
&lt;br /&gt;
{{div col end}}&lt;br /&gt;
&lt;br /&gt;
;Related scientists&lt;br /&gt;
&lt;br /&gt;
Related scientists&lt;br /&gt;
&lt;br /&gt;
相关科学家&lt;br /&gt;
&lt;br /&gt;
{{div col|colwidth=20em}}&lt;br /&gt;
&lt;br /&gt;
* [[People in systems and control]]&lt;br /&gt;
&lt;br /&gt;
* [[Dmitri Anosov]]&lt;br /&gt;
&lt;br /&gt;
* [[Vladimir Arnold]]&lt;br /&gt;
&lt;br /&gt;
* [[Nikolay Bogolyubov]]&lt;br /&gt;
&lt;br /&gt;
* [[Andrey Kolmogorov]]&lt;br /&gt;
&lt;br /&gt;
* [[Nikolay Mitrofanovich Krylov|Nikolay Krylov]]&lt;br /&gt;
&lt;br /&gt;
* [[Jürgen Moser]]&lt;br /&gt;
&lt;br /&gt;
* [[Yakov G. Sinai]]&lt;br /&gt;
&lt;br /&gt;
* [[Stephen Smale]]&lt;br /&gt;
&lt;br /&gt;
* [[Hillel Furstenberg]]&lt;br /&gt;
&lt;br /&gt;
* [[Grigory Margulis]]&lt;br /&gt;
&lt;br /&gt;
* [[Elon Lindenstrauss]]&lt;br /&gt;
&lt;br /&gt;
{{div col end}}&lt;br /&gt;
&lt;br /&gt;
== Notes 参考资料==&lt;br /&gt;
&lt;br /&gt;
{{reflist}}&lt;br /&gt;
&lt;br /&gt;
== Further reading 拓展阅读==&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Frederick D. |last1=Abraham |first2=Ralph |last2=Abraham |authorlink2=Ralph Abraham (mathematician)|first3=Christopher D. |last3=Shaw |title=A Visual Introduction to Dynamical Systems Theory for Psychology |url=https://books.google.com/books?id=oMbaAAAAMAAJ |year=1990 |publisher=Aerial Press |isbn=978-0-942344-09-7 |oclc=24345312}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=Edward J. |last=Beltrami |title=Mathematics for Dynamic Modeling |url=https://books.google.com/books?id=MmoiJPsuFW8C |year=1998 |publisher=Academic Press |isbn=978-0-12-085566-7 |edition=2nd |oclc=36713294}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=Otomar |last=Hájek |title=Dynamical systems in the plane |url=https://books.google.com/books?id=czhPAQAAIAAJ |year=1968 |publisher=Academic Press |oclc=343328 |authorlink=Otomar Hájek |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=David G. |last=Luenberger |title=Introduction to dynamic systems: theory, models, and applications |url=https://books.google.com/books?id=mvlQAAAAMAAJ |year=1979 |publisher=Wiley |isbn=978-0-471-02594-8 |oclc=4195122 |authorlink=David Luenberger |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Anthony |last1=Michel |author2=Kaining Wang |author3=Bo Hu |title=Qualitative Theory of Dynamical Systems |url=https://books.google.com/books?id=ZPGBnZGV2_cC |year=2001 |publisher=Taylor &amp;amp; Francis |isbn=978-0-8247-0526-8 |oclc=45873628}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Louis |last1=Padulo |first2=Michael A. |last2=Arbib |authorlink2=Michael A. Arbib |title=System theory: a unified state-space approach to continuous and discrete systems |url=https://books.google.com/books?id=6UPvAAAAMAAJ |year=1974 |publisher=Saunders |isbn=9780721670355 |oclc=947600 |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |first=Steven H. |last=Strogatz |title=Nonlinear Dynamics and Chaos: With Applications to Physics, Biology, Chemistry, and Engineering |year=1994 |publisher=Addison Wesley |isbn=978-0-7382-0453-6 |oclc=49839504 |authorlink=Steven Strogatz |ref=harv |url-access=registration |url=https://archive.org/details/nonlineardynamic00stro }}&lt;br /&gt;
&lt;br /&gt;
== External links 外部链接==&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20080613053119/http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html Dynamic Systems 动力系统] Encyclopedia of Cognitive Science entry. --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|这是一个嵌套的链接，但好像只能鼠标点击并超链接到内嵌的那个]]）认知科学百科全书&lt;br /&gt;
&lt;br /&gt;
*[http://mathworld.wolfram.com/DynamicalSystem.html Definition of dynamical system 动力系统的定义] in MathWorld. 在MathWorld.wolfram.com储存的定义&lt;br /&gt;
&lt;br /&gt;
*[http://www.dynamicalsystems.org/ DSWeb] Dynamical Systems Magazine 动力系统杂志&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Areas of mathematics | state=collapsed}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:Dynamical systems]]&lt;br /&gt;
&lt;br /&gt;
Category:Dynamical systems&lt;br /&gt;
&lt;br /&gt;
类别: 动力系统&lt;br /&gt;
&lt;br /&gt;
[[Category:Complex systems theory]]&lt;br /&gt;
&lt;br /&gt;
Category:Complex systems theory&lt;br /&gt;
&lt;br /&gt;
范畴: 复杂系统理论&lt;br /&gt;
&lt;br /&gt;
[[Category:Computational fields of study]]&lt;br /&gt;
&lt;br /&gt;
Category:Computational fields of study&lt;br /&gt;
&lt;br /&gt;
类别: 研究的计算领域&lt;br /&gt;
&lt;br /&gt;
&amp;lt;noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;small&amp;gt;This page was moved from [[wikipedia:en:Dynamical systems theory]]. Its edit history can be viewed at [[动力系统/edithistory]]&amp;lt;/small&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:待整理页面]]&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
===书籍推荐===&lt;br /&gt;
====[https://www.amazon.co.uk/Chaos-Making-Science-James-Gleick/dp/0749386061 Chaos: Making a New Science]====&lt;br /&gt;
The million-copy bestseller by National Book Award nominee and Pulitzer Prize finalist James Gleick—the author of Time Travel: A History—that reveals the science behind chaos theory。&lt;br /&gt;
Very readable, focuses on the scientists and mathematicians behind many of the key results in chaos.&lt;br /&gt;
本书由普利茨奖获得者James Gleick撰写。它是一本易读科普书籍，侧重介绍对混沌概念的发展做出重大贡献的科学家和数学家们。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://www.amazon.com/dp/0199566445/ref=cm_sw_su_dp Chaos and Fractals: An Elementary Introduction]====&lt;br /&gt;
This book provides the reader with an elementary introduction to chaos and fractals, suitable for students with a background in elementary algebra, without assuming prior coursework in calculus or physics. &lt;br /&gt;
这是一本关于混沌和分形的入门书籍。读者需要有一定的线性代数基础，但是不需要有微积分或物理学的基础。&lt;br /&gt;
&lt;br /&gt;
====[https://www.amazon.co.uk/Chaos-Very-Short-Introduction-Introductions/dp/0192853783/ref=pd_lpo_14_img_1/257-2017232-0516612?_encoding=UTF8&amp;amp;pd_rd_i=0192853783&amp;amp;pd_rd_r=eebee69a-fad3-43e3-bbeb-b883f2c59bf5&amp;amp;pd_rd_w=g6knH&amp;amp;pd_rd_wg=sx6z5&amp;amp;pf_rd_p=7b8e3b03-1439-4489-abd4-4a138cf4eca6&amp;amp;pf_rd_r=YTB0XXCR2DM8049PYP1Y&amp;amp;psc=1&amp;amp;refRID=YTB0XXCR2DM8049PYP1Y 牛津通识读本: Chaos]====&lt;br /&gt;
This book would not have been possible without my parents, of course, but I owe a greater debt than most to their faith, doubt, and hope, and to the love and patience of a, b, and c. Professionally my greatest debt is to Ed Spiegel, a father of chaos and my thesis Professor, mentor, and friend.&lt;br /&gt;
本书隶属于牛津通识读本系列。该书由Ed Spiegel的学生Leonard Smith撰写，语言生动简明。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
===集智课程推荐===&lt;br /&gt;
====[https://campus.swarma.org/course/1655 圣塔菲课程：Introduction to Dynamical Systems and Chaos]====&lt;br /&gt;
本课程中，主要介绍动力学系统和混沌系统，您将学到'''蝴蝶效应 Butterfly effect'''、'''奇异吸引子 Attractors'''等基本概念，以及如何应用于您感兴趣的领域。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://campus.swarma.org/course/1641 动力系统分析]====&lt;br /&gt;
本课程主要讲授连续和离散动力系统的定态、极限环及其稳定性分析、动力学系统的结构稳定性和常见的分支类型以及分析方法，混沌概念等。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E5%8A%A8%E5%8A%9B%E7%B3%BB%E7%BB%9F%E7%90%86%E8%AE%BA_Dynamical_Systems_Theory&amp;diff=10099</id>
		<title>动力系统理论 Dynamical Systems Theory</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E5%8A%A8%E5%8A%9B%E7%B3%BB%E7%BB%9F%E7%90%86%E8%AE%BA_Dynamical_Systems_Theory&amp;diff=10099"/>
		<updated>2020-07-10T15:56:50Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。&lt;br /&gt;
&lt;br /&gt;
{{Use dmy dates|date=May 2019|cs1-dates=y}}&lt;br /&gt;
&lt;br /&gt;
'''Dynamical systems theory''' is an area of [[mathematics]] used to describe the behavior of the  [[complex systems|complex]] [[dynamical system]]s, usually by employing [[differential equations]] or [[difference equations]]. When differential equations are employed, the theory is called [[continuous time|''continuous dynamical systems'']]. From a physical point of view, continuous dynamical systems is a generalization of [[classical mechanics]], a generalization where the [[equations of motion]] are postulated directly and are not constrained to be [[Euler–Lagrange equation]]s of a [[Principle of least action|least action principle]]. When difference equations are employed, the theory is called [[discrete time|''discrete dynamical systems'']]. When the time variable runs over a set that is discrete over some intervals and continuous over other intervals or is any arbitrary time-set such as a [[cantor set]], one gets [[dynamic equations on time scales]]. Some situations may also be modeled by mixed operators, such as [[differential-difference equations]].&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory is an area of mathematics used to describe the behavior of the  complex dynamical systems, usually by employing differential equations or difference equations. When differential equations are employed, the theory is called continuous dynamical systems. From a physical point of view, continuous dynamical systems is a generalization of classical mechanics, a generalization where the equations of motion are postulated directly and are not constrained to be Euler–Lagrange equations of a least action principle. When difference equations are employed, the theory is called discrete dynamical systems. When the time variable runs over a set that is discrete over some intervals and continuous over other intervals or is any arbitrary time-set such as a cantor set, one gets dynamic equations on time scales. Some situations may also be modeled by mixed operators, such as differential-difference equations.&lt;br /&gt;
&lt;br /&gt;
  &lt;br /&gt;
'''动力系统理论 Dynamical Systems Theory'''是一个用来描述复杂动力系统行为的数学领域，通常使用微分方程或差分方程。当采用微分方程时，该理论被称为连续动力系统。从物理学的角度来看，连续动力系统是经典力学的推广，也是运动方程的推广，不受极小作用原理Euler–Lagrange方程的约束。当采用差分方程时，该理论被称为离散动力系统。&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;当时间变量在一个离散的集合上运行，在另一个离散的集合上连续，或者像cantor集一样在任意的时间集合上运行时，人们就能得到时间尺度上的动力方程。&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 当时间变量运行在一个某些区间离散、其他区间连续的集合、或者像cantor集一样任意的时间集合上时，人们就能得到时间尺度上的动力方程。&amp;lt;/font&amp;gt;&lt;br /&gt;
&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;'''算子 Operators'''是一个函数空间到函数空间上的映射O：X→X，广义的讲，对任何函数进行某一项操作都可以认为是一个算子，如求幂次、求微分等。&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;这句话的英文原文在哪里？&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;动力系统的有些情况也可以用'''混合算子 Mixed Operators'''来建模，如微分-差分方程。&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 某些情况下，也可以用'''混合算子 Mixed Operators'''来建模，如微分-差分方程。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This theory deals with the long-term qualitative behavior of dynamical systems, and studies the nature of, and when possible the solutions of, the [[equations of motion]] of systems that are often primarily [[mechanics|mechanical]] or otherwise physical in nature, such as [[planetary orbit]]s and the behaviour of [[electronic circuit]]s, as well as systems that arise in [[biology]], [[economics]], and elsewhere. Much of modern research is focused on the study of [[chaotic system]]s.&lt;br /&gt;
&lt;br /&gt;
This theory deals with the long-term qualitative behavior of dynamical systems, and studies the nature of, and when possible the solutions of, the equations of motion of systems that are often primarily mechanical or otherwise physical in nature, such as planetary orbits and the behaviour of electronic circuits, as well as systems that arise in biology, economics, and elsewhere. Much of modern research is focused on the study of chaotic systems.&lt;br /&gt;
&lt;br /&gt;
这个理论处理动力系统的&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;长期定性行为。如果能够得到解的话，还可以研究系统的运动方程。这些方程通常运用到机械或物理研究领域，如行星轨道和电子电路，以及出现在生物学，经济学和其他地方的系统。&amp;lt;/font&amp;gt;现代的研究大多集中在对混沌系统的研究上。&lt;br /&gt;
&lt;br /&gt;
&amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;这个理论处理动力系统的长周期性的行为，并且研究系统的动力方程的规律，努力求得可能的解。这些系统通常是一些自然领域里的机械系统或其他物理系统，例如行星轨道和电子电路，也包括一些生物学、经济学和其他学科里的系统。现代的研究大多集中在对混沌系统的研究上。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This field of study is also called just ''dynamical systems'', ''mathematical dynamical systems theory'' or the ''mathematical theory of dynamical systems''.&lt;br /&gt;
&lt;br /&gt;
This field of study is also called just dynamical systems, mathematical dynamical systems theory or the mathematical theory of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
这个研究领域也被称为动力系统，数学动力系统理论或动力系统的数学理论。&lt;br /&gt;
&lt;br /&gt;
[[Image:Lorenz attractor yb.svg|thumb|240px|right|The [[Lorenz attractor]] is an example of a [[non-linear]] dynamical system. Studying this system helped give rise to [[chaos theory]].]]&lt;br /&gt;
&lt;br /&gt;
The [[Lorenz attractor is an example of a non-linear dynamical system. Studying this system helped give rise to chaos theory.]]&lt;br /&gt;
&lt;br /&gt;
'''洛伦兹吸引子 Lorenz Attractor'''是非线性动力系统的一个例子。对这个系统的研究产生了混沌理论。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Overview 综述 ==&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory and [[chaos theory]] deal with the long-term qualitative behavior of [[dynamical system]]s. Here, the focus is not on finding precise solutions to the equations defining the dynamical system (which is often hopeless), but rather to answer questions like &amp;quot;Will the system settle down to a steady state in the long term, and if so, what are the possible steady states?&amp;quot;, or &amp;quot;Does the long-term behavior of the system depend on its initial condition?&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory and chaos theory deal with the long-term qualitative behavior of dynamical systems. Here, the focus is not on finding precise solutions to the equations defining the dynamical system (which is often hopeless), but rather to answer questions like &amp;quot;Will the system settle down to a steady state in the long term, and if so, what are the possible steady states?&amp;quot;, or &amp;quot;Does the long-term behavior of the system depend on its initial condition?&amp;quot;&lt;br /&gt;
&lt;br /&gt;
动力系统理论和'''混沌理论 Chaos Theory'''是用来处理动力系统的&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;长期定性行为&amp;lt;/font&amp;gt;&amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 长周期性行为&amp;lt;/font&amp;gt;的理论。寻找动力系统方程的精确解通常是很难达到的。&amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 因此，&amp;lt;/font&amp;gt;这两个理论的重点不在于找到精确解，而是回答如下的问题，如“系统长期来看是否会稳定下来，如果可以，那么可能的稳定状态是什么样的?”，或“系统长期的行为是否取决于其初始条件?”&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
An important goal is to describe the fixed points, or steady states of a given dynamical system; these are values of the variable that don't change over time. Some of these fixed points are ''attractive'', meaning that if the system starts out in a nearby state, it converges towards the fixed point.&lt;br /&gt;
&lt;br /&gt;
An important goal is to describe the fixed points, or steady states of a given dynamical system; these are values of the variable that don't change over time. Some of these fixed points are attractive, meaning that if the system starts out in a nearby state, it converges towards the fixed point.&lt;br /&gt;
&lt;br /&gt;
描述给定动力系统的不动点或'''&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;定态&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;稳态&amp;lt;/font&amp;gt;Steady States'''是一个重要的目标。不动点或&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;定态&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;稳态&amp;lt;/font&amp;gt;的变量值不会随时间的变化而变化。&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;一些不动点是有吸引力的（attractive），即如果系统的初始值在它的附近，系统最终会收敛到这个不动点。&amp;lt;/font&amp;gt;&amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 某些不动点被称为“吸引子”，意味着如果系统即使不在它附近的状态开始，最终也会收敛到这些不动点。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Similarly, one is interested in ''periodic points'', states of the system that repeat after several timesteps. Periodic points can also be attractive. [[Sharkovskii's theorem]] is an interesting statement about the number of periodic points of a one-dimensional discrete dynamical system.&lt;br /&gt;
&lt;br /&gt;
Similarly, one is interested in periodic points, states of the system that repeat after several timesteps. Periodic points can also be attractive. Sharkovskii's theorem is an interesting statement about the number of periodic points of a one-dimensional discrete dynamical system.&lt;br /&gt;
&lt;br /&gt;
人们还对动力系统的'''周期点 Periodic Points'''感兴趣，即系统在几个时间步之后会不断重复的状态。周期点也可以是有吸引力的。Sharkovskii定理描述了一维离散动力系统的周期点的个数。&lt;br /&gt;
&amp;lt;font color='blue'&amp;gt;类似地，另一个研究兴趣是'''周期点 Periodic Points'''，即系统在重复几个时间步之后的状态。周期点也可以是吸引子。Sharkovskii定理描述了一维离散动力系统的周期点的个数。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Even simple [[nonlinear dynamical system]]s often exhibit seemingly random behavior that has been called ''chaos''.&amp;lt;ref&amp;gt;{{cite journal |last=Grebogi |first=C. |last2=Ott |first2=E. |last3=Yorke |first3=J. |year=1987 |title=Chaos, Strange Attractors, and Fractal Basin Boundaries in Nonlinear Dynamics |journal=[[Science (journal)|Science]] |volume=238 |issue=4827 |pages=632–638 |jstor=1700479 |doi=10.1126/science.238.4827.632 |pmid=17816542 |bibcode=1987Sci...238..632G }}&amp;lt;/ref&amp;gt; The branch of dynamical systems that deals with the clean definition and investigation of chaos is called ''[[chaos theory]]''.&lt;br /&gt;
&lt;br /&gt;
Even simple nonlinear dynamical systems often exhibit seemingly random behavior that has been called chaos. The branch of dynamical systems that deals with the clean definition and investigation of chaos is called chaos theory.&lt;br /&gt;
&lt;br /&gt;
即使是简单的非线性动力系统也常常表现出看似随机的行为，这种行为被称为混沌。混沌理论主要研究混沌的清晰定义和混沌的现象，它是动力系统理论的一个分支。&lt;br /&gt;
&lt;br /&gt;
== History 历史==&lt;br /&gt;
&lt;br /&gt;
The concept of dynamical systems theory has its origins in [[Newtonian mechanics]]. There, as in other natural sciences and engineering disciplines, the evolution rule of dynamical systems is given implicitly by a relation that gives the state of the system only a short time into the future.&lt;br /&gt;
&lt;br /&gt;
The concept of dynamical systems theory has its origins in Newtonian mechanics. There, as in other natural sciences and engineering disciplines, the evolution rule of dynamical systems is given implicitly by a relation that gives the state of the system only a short time into the future.&lt;br /&gt;
&lt;br /&gt;
动态系统理论的概念起源于牛顿运动定律。与其他自然科学和工程学科一样，动力系统的演化规律也是通过一种预测系统在未来很短时间内的状态的关系隐含地给出的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Before the advent of [[computer|fast computing machines]], solving a dynamical system required sophisticated mathematical techniques and could only be accomplished for a small class of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
Before the advent of fast computing machines, solving a dynamical system required sophisticated mathematical techniques and could only be accomplished for a small class of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
在高速计算机器出现之前，解决动力系统问题需要复杂的数学技能，而且还只能解决一小类动力系统问题。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Some excellent presentations of mathematical dynamic system theory include {{harvtxt|Beltrami|1990}}, {{harvtxt|Luenberger|1979}}, {{harvtxt|Padulo|Arbib|1974}}, and {{harvtxt|Strogatz|1994}}.&amp;lt;ref&amp;gt;Jerome R. Busemeyer (2008), [http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html &amp;quot;Dynamic Systems&amp;quot;]. To Appear in: ''Encyclopedia of cognitive science'', Macmillan. Retrieved 8 May 2008.  {{webarchive |url=https://web.archive.org/web/20080613053119/http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html |date=June 13, 2008 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Some excellent presentations of mathematical dynamic system theory include , , , and . To Appear in: ''Encyclopedia of cognitive science'', Macmillan. Retrieved 8 May 2008&lt;br /&gt;
&lt;br /&gt;
优秀的数学动力系统理论包括，，，和。--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|存疑]]）。&lt;br /&gt;
&lt;br /&gt;
== Concepts 概念==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Dynamical systems 动力系统===&lt;br /&gt;
&lt;br /&gt;
{{main|Dynamical system (definition)}}&lt;br /&gt;
&lt;br /&gt;
The [[dynamical system]] concept is a mathematical [[formal system|formalization]] for any fixed &amp;quot;rule&amp;quot; that describes the [[time]] dependence of a point's position in its [[ambient space]].  Examples include the [[mathematical model]]s that describe the swinging of a clock pendulum, the flow of water in a pipe, and the number of fish each spring in a lake.&lt;br /&gt;
&lt;br /&gt;
The dynamical system concept is a mathematical formalization for any fixed &amp;quot;rule&amp;quot; that describes the time dependence of a point's position in its ambient space.  Examples include the mathematical models that describe the swinging of a clock pendulum, the flow of water in a pipe, and the number of fish each spring in a lake.&lt;br /&gt;
&lt;br /&gt;
动力系统是一个对任何描述了点的位置在周围环境随时间变化的“固定”规则的数学式。举例来说，描述钟摆摆动、管道中的水流以及每年春天湖中鱼的数量的数学模型，都属于动力系统的概念范畴。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A dynamical system has a ''state'' determined by a collection of [[real numbers]], or more generally by a [[Set (mathematics)|set]] of [[Point (geometry)|points]] in an appropriate ''state space''.  Small changes in the state of the system correspond to small changes in the numbers.  The numbers are also the coordinates of a geometrical space—a [[manifold]].   The ''evolution rule'' of the dynamical system is a [[function (mathematics)|fixed rule]] that describes what future states follow from the current state.  The rule may be [[Deterministic system (mathematics)|deterministic]] (for a given time interval only one future state follows from the current state) or [[stochastic differential equation|stochastic]] (the evolution of the state is subject to random shocks).&lt;br /&gt;
&lt;br /&gt;
A dynamical system has a state determined by a collection of real numbers, or more generally by a set of points in an appropriate state space.  Small changes in the state of the system correspond to small changes in the numbers.  The numbers are also the coordinates of a geometrical space—a manifold.   The evolution rule of the dynamical system is a fixed rule that describes what future states follow from the current state.  The rule may be deterministic (for a given time interval only one future state follows from the current state) or stochastic (the evolution of the state is subject to random shocks).&lt;br /&gt;
&lt;br /&gt;
动力系统的状态是由一组实数决定的，更广泛地说，是由适当的状态空间中的一组点决定的。系统状态的微小变化对应于数字的变化。这些数字也是几何空间——'''流形 Manifold'''——的坐标组。动力系统的演化是描述了在当前状态之后出现的未来状态的固定规则。这个规则可以是确定性的(在给定的时间间隔内，有且仅有一个未来状态在当前状态之后出现)，或随机性的(状态的演化受到随机因素的影响)。&lt;br /&gt;
&lt;br /&gt;
=== Dynamicism 动态主义===&lt;br /&gt;
&lt;br /&gt;
[[Dynamicism]], also termed the ''dynamic hypothesis'' or the ''dynamic hypothesis in cognitive science'' or ''dynamic cognition'', is a new approach in [[cognitive science]] exemplified by the work of philosopher [[Tim van Gelder]]. It argues that [[differential equations]] are more suited to modelling [[cognition]] than more traditional [[computer]] models.&lt;br /&gt;
&lt;br /&gt;
Dynamicism, also termed the dynamic hypothesis or the dynamic hypothesis in cognitive science or dynamic cognition, is a new approach in cognitive science exemplified by the work of philosopher Tim van Gelder. It argues that differential equations are more suited to modelling cognition than more traditional computer models.&lt;br /&gt;
&lt;br /&gt;
'''动态主义 Dynamicism'''，又称动态假设，或称认知科学、动态认知中的动态假设，是以哲学家Tim van Gelder的著作为代表的认知科学的一种新取向。动态主义认为微分方程比传统的计算机模型更适合于建立认知模型。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Nonlinear system 非线性系统===&lt;br /&gt;
&lt;br /&gt;
{{main|Nonlinear system}}&lt;br /&gt;
&lt;br /&gt;
In [[mathematics]], a [[nonlinear system]] is a system that is not [[linear system|linear]]—i.e., a system that does not satisfy the [[superposition principle]]. Less technically, a nonlinear system is any problem where the variable(s) to solve for cannot be written as a linear sum of independent components. A [[Homogeneity (physics)|nonhomogeneous]] system, which is linear apart from the presence of a function of the [[independent variable]]s, is nonlinear according to a strict definition, but such systems are usually studied alongside linear systems, because they can be transformed to a linear system as long as a particular solution is known.&lt;br /&gt;
&lt;br /&gt;
In mathematics, a nonlinear system is a system that is not linear—i.e., a system that does not satisfy the superposition principle. Less technically, a nonlinear system is any problem where the variable(s) to solve for cannot be written as a linear sum of independent components. A nonhomogeneous system, which is linear apart from the presence of a function of the independent variables, is nonlinear according to a strict definition, but such systems are usually studied alongside linear systems, because they can be transformed to a linear system as long as a particular solution is known.&lt;br /&gt;
&lt;br /&gt;
在数学中，'''非线性系统 Nonlinear System'''是指系统不是线性的——也就是说，一个不满足叠加原理的系统。更通俗地说，非线性系统是待求解变量不能被写成其独立分量的线性和的系统。非齐次系统根据定义严格来说是非线性的，除了它的自变量包含函数以外其他部分都是线性的。但非齐次系统通常与线性系统一起研究，因为只要知道特解，它们就可以转化为线性系统。&lt;br /&gt;
&lt;br /&gt;
== Related fields 相关领域==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Arithmetic dynamics 算术动态系统===&lt;br /&gt;
&lt;br /&gt;
:[[Arithmetic dynamics]] is a field that emerged in the 1990s that amalgamates two areas of mathematics, [[dynamical systems]] and [[number theory]]. Classically, discrete dynamics refers to the study of the [[Iterated function|iteration]] of self-maps of the [[complex plane]] or [[real line]]. Arithmetic dynamics is the study of the number-theoretic properties of integer, rational, {{math|&amp;lt;var&amp;gt;p&amp;lt;/var&amp;gt;}}-adic, and/or algebraic points under repeated application of a [[polynomial]] or [[rational function]].&lt;br /&gt;
&lt;br /&gt;
Arithmetic dynamics is a field that emerged in the 1990s that amalgamates two areas of mathematics, dynamical systems and number theory. Classically, discrete dynamics refers to the study of the iteration of self-maps of the complex plane or real line. Arithmetic dynamics is the study of the number-theoretic properties of integer, rational, -adic, and/or algebraic points under repeated application of a polynomial or rational function.&lt;br /&gt;
&lt;br /&gt;
'''算术动态系统 Arithmetic Dynamics'''是20世纪90年代出现的一个领域，融合了动力系统和数论这两个数学领域。经典的离散动力学研究复平面或实直线的自映射的迭代。算术动态系统研究内容是在多项式或有理函数中的整数、有理数、并元 --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|存疑]]） 和/或代数点的数论性质。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Chaos theory 混沌理论===&lt;br /&gt;
&lt;br /&gt;
:[[Chaos theory]] describes the behavior of certain [[dynamical system (definition)|dynamical system]]s – that is, systems whose state evolves with time – that may exhibit dynamics that are highly sensitive to initial conditions (popularly referred to as the [[butterfly effect]]). As a result of this sensitivity, which manifests itself as an exponential growth of perturbations in the initial conditions, the behavior of chaotic systems appears [[randomness|random]]. This happens even though these systems are [[deterministic system (philosophy)|deterministic]], meaning that their future dynamics are fully defined by their initial conditions, with no random elements involved. This behavior is known as deterministic chaos, or simply ''chaos''.&lt;br /&gt;
&lt;br /&gt;
Chaos theory describes the behavior of certain dynamical systems – that is, systems whose state evolves with time – that may exhibit dynamics that are highly sensitive to initial conditions (popularly referred to as the butterfly effect). As a result of this sensitivity, which manifests itself as an exponential growth of perturbations in the initial conditions, the behavior of chaotic systems appears random. This happens even though these systems are deterministic, meaning that their future dynamics are fully defined by their initial conditions, with no random elements involved. This behavior is known as deterministic chaos, or simply chaos.&lt;br /&gt;
&lt;br /&gt;
混沌理论描述了某些状态随时间演化的动力系统的行为，这些系统可能表现出对初始条件高度敏感的特点（通常被称为'''蝴蝶效应 Butterfly Effect'''）。由于扰动受初始条件影响而指数增长，因此混沌系统具有敏感性，敏感性使它的行为看起来是随机的。但是这种敏感性也会出现在确定的动力系统中，即未来的动力学完全由它的初始条件定义，没有任何随机因素参与的系统中。这种现象被称为确定性混沌，或简单混沌。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Complex systems 复杂系统===&lt;br /&gt;
&lt;br /&gt;
:[[Complex systems]] is a scientific field that studies the common properties of [[system]]s considered [[Complexity|complex]] in [[nature]], [[society]], and [[science]]. It is also called ''complex systems theory'', ''complexity science'', ''study of complex systems'' and/or ''sciences of complexity''. The key problems of such systems are  difficulties with their formal [[Scientific modelling|modeling]] and [[simulation]]. From such perspective, in different research contexts complex systems are defined on the base of their different attributes.&lt;br /&gt;
&lt;br /&gt;
Complex systems is a scientific field that studies the common properties of systems considered complex in nature, society, and science. It is also called complex systems theory, complexity science, study of complex systems and/or sciences of complexity. The key problems of such systems are  difficulties with their formal modeling and simulation. From such perspective, in different research contexts complex systems are defined on the base of their different attributes.&lt;br /&gt;
&lt;br /&gt;
'''复杂系统 Complex Systems'''是研究自然、社会和科学中复杂现象的共同性质的科学领域。它也被称为复杂系统理论、复杂性科学、复杂系统研究和关于复杂性的科学。这些系统的关键问题在于对系统的形式化建模与仿真。因此，复杂系统是根据在不同的研究语境中的不同属性来定义的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
:The study of complex systems is bringing new vitality to many areas of science where a more typical [[reductionist]] strategy has fallen short. ''Complex systems'' is therefore often used as a broad term encompassing a research approach to problems in many diverse disciplines including [[neurosciences]], [[social sciences]], [[meteorology]], [[chemistry]], [[physics]], [[computer science]], [[psychology]], [[artificial life]], [[evolutionary computation]], [[economics]], earthquake prediction, [[molecular biology]] and inquiries into the nature of living [[cell (biology)|cell]]s themselves.&lt;br /&gt;
&lt;br /&gt;
The study of complex systems is bringing new vitality to many areas of science where a more typical reductionist strategy has fallen short. Complex systems is therefore often used as a broad term encompassing a research approach to problems in many diverse disciplines including neurosciences, social sciences, meteorology, chemistry, physics, computer science, psychology, artificial life, evolutionary computation, economics, earthquake prediction, molecular biology and inquiries into the nature of living cells themselves.&lt;br /&gt;
&lt;br /&gt;
还原论策略已经不足以研究许多科学领域的问题，而复杂系统的研究则为科学带来了广泛的新活力。复杂系统通常被用作一个应用广泛的研究方法术语，并涵盖许多不同的学科，包括神经科学、社会科学、气象学、化学、物理学、计算机科学、心理学、人工生命、进化计算、经济学、地震预测、分子生物学以及对活细胞的研究等。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Control theory 控制理论===&lt;br /&gt;
&lt;br /&gt;
:[[Control theory]] is an interdisciplinary branch of [[engineering]] and [[mathematics]], in part it deals with influencing the behavior of [[dynamical system]]s.&lt;br /&gt;
&lt;br /&gt;
Control theory is an interdisciplinary branch of engineering and mathematics, in part it deals with influencing the behavior of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
'''控制理论 Control Theory'''是工程和数学的一个交叉学科，它的其中一部分研究影响动力系统行为的各种因素。&lt;br /&gt;
&lt;br /&gt;
控制理论是一个研究如何调整动态系统特性的理论，它也是工程和数学的一个交叉学科，逐渐的应用在许多社会科学中，例如心理学、社会学（社会学中的控制理论）、犯罪学及'''金融系统 Financial System'''。控制理论一般的目的是借由控制器的动作让系统稳定，也就是系统维持在设定值，而且不会在设定值附近晃动。设定值一般维持不变的控制称为调节，设定值快速变化，要求跟踪速度加速度等的控制称为伺服。它的其中一部分研究影响动力系统行为的各种因素。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Ergodic theory 遍历理论===&lt;br /&gt;
&lt;br /&gt;
:[[Ergodic theory]] is a branch of [[mathematics]] that studies [[dynamical system]]s with an [[invariant measure]] and related problems. Its initial development was motivated by problems of [[statistical physics]].&lt;br /&gt;
&lt;br /&gt;
Ergodic theory is a branch of mathematics that studies dynamical systems with an invariant measure and related problems. Its initial development was motivated by problems of statistical physics.&lt;br /&gt;
&lt;br /&gt;
'''遍历理论 Ergodic Theory'''是数学的一个分支，研究有不变测度相关问题的动力系统。它最初的发展受到了统计物理学的推动。&lt;br /&gt;
遍历理论是研究保测变换的渐近性态的数学分支。它起源于为统计力学提供基础的&amp;quot;遍历假设&amp;quot;研究，并与动力系统理论、概率论、信息论、泛函分析、数论等数学分支有着密切的联系。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Functional analysis 泛函分析===&lt;br /&gt;
&lt;br /&gt;
:[[Functional analysis]] is the branch of [[mathematics]], and specifically of [[mathematical analysis|analysis]], concerned with the study of [[vector space]]s and [[operator (mathematics)|operator]]s acting upon them. It has its historical roots in the study of [[functional space]]s, in particular transformations of [[function (mathematics)|functions]], such as the [[Fourier transform]], as well as in the study of [[differential equations|differential]] and [[integral equations]]. This usage of the word ''[[functional (mathematics)|functional]]'' goes back to the [[calculus of variations]], implying a function whose argument is a function. Its use in general has been attributed to mathematician and physicist [[Vito Volterra]] and its founding is largely attributed to mathematician [[Stefan Banach]].&lt;br /&gt;
&lt;br /&gt;
Functional analysis is the branch of mathematics, and specifically of analysis, concerned with the study of vector spaces and operators acting upon them. It has its historical roots in the study of functional spaces, in particular transformations of functions, such as the Fourier transform, as well as in the study of differential and integral equations. This usage of the word functional goes back to the calculus of variations, implying a function whose argument is a function. Its use in general has been attributed to mathematician and physicist Vito Volterra and its founding is largely attributed to mathematician Stefan Banach.&lt;br /&gt;
&lt;br /&gt;
'''泛函分析 Functional analysis'''是数学分析的一个分支，研究向量空间和作用于向量空间的算子。它源于对函数空间的研究，特别是对函数变换的研究，例如傅里叶变换，微积分方程的研究等。泛函分析的名称“Functional Analysis”中，“functional”这个词的用法可以追溯到变分法，也就是说函数的参数是一个函数。这个词的使用一般被认为归功于数学家和物理学家Vito Volterra，和数学家Stefan Banach。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Graph dynamical systems 图动力系统===&lt;br /&gt;
&lt;br /&gt;
:The concept of [[graph dynamical system]]s (GDS) can be used to capture a wide range of processes taking place on graphs or networks. A major theme in the mathematical and computational analysis of graph dynamical systems is to relate their structural properties (e.g. the network connectivity) and the global dynamics that result.&lt;br /&gt;
&lt;br /&gt;
The concept of graph dynamical systems (GDS) can be used to capture a wide range of processes taking place on graphs or networks. A major theme in the mathematical and computational analysis of graph dynamical systems is to relate their structural properties (e.g. the network connectivity) and the global dynamics that result.&lt;br /&gt;
&lt;br /&gt;
'''图动力系统 Graph dynamical systems (GDS)'''可以用来描绘图或网络上发生的各种过程。图动力系统的数学和计算分析的一个主要主题是关联它们的结构性质(例如:网络连接)和结构性质造成的网络整体的动态结果。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Projected dynamical systems 投影动力系统===&lt;br /&gt;
&lt;br /&gt;
:[[Projected dynamical systems]] it is a [[mathematics|mathematical]] theory investigating the behaviour of [[dynamical system]]s where solutions are restricted to a constraint set. The discipline shares connections to and applications with both the static world of [[Optimization (mathematics)|optimization]] and [[Equilibrium point|equilibrium]] problems and the dynamical world of [[ordinary differential equations]]. A projected dynamical system is given by the [[flow (mathematics)|flow]] to the projected differential equation.&lt;br /&gt;
&lt;br /&gt;
Projected dynamical systems it is a mathematical theory investigating the behaviour of dynamical systems where solutions are restricted to a constraint set. The discipline shares connections to and applications with both the static world of optimization and equilibrium problems and the dynamical world of ordinary differential equations. A projected dynamical system is given by the flow to the projected differential equation.&lt;br /&gt;
&lt;br /&gt;
'''投影动力系统 Projected Dynamical Systems'''是研究解在一个约束集内的动力系统行为的数学理论。这门学科与静态世界中的最优化和平衡问题以及动态世界中的常微分方程都有联系，并且都有相互联系的应用。一个投影动力系统是由投影微分方程的'''流形 flow'''给定的。&lt;br /&gt;
通过对投影微分方程的流分析，给出了一个投影动力系统的表达式：&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\frac{dx(t)}{dt} = \Pi_K(x(t),-F(x(t)))&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中K为约束集。这种形式的微分方程因具有不连续的向量场而值得注意。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Symbolic dynamics 符号动力学===&lt;br /&gt;
&lt;br /&gt;
:[[Symbolic dynamics]] is the practice of modelling a topological or smooth [[dynamical system]] by a discrete space consisting of infinite [[sequence]]s of abstract symbols, each of which corresponds to a state of the system, with the dynamics (evolution) given by the [[shift operator]].&lt;br /&gt;
&lt;br /&gt;
Symbolic dynamics is the practice of modelling a topological or smooth dynamical system by a discrete space consisting of infinite sequences of abstract symbols, each of which corresponds to a state of the system, with the dynamics (evolution) given by the shift operator.&lt;br /&gt;
&lt;br /&gt;
'''符号动力学 Symbolic Dynamics'''是通过一个由抽象符号的无限序列组成的离散空间建立一个拓扑或光滑动力系统的方法。每一个抽象符号的无限序列序列对应于系统的一个状态，并由移位算子给出动力学(演化)。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== System dynamics 系统动力学===&lt;br /&gt;
&lt;br /&gt;
:[[System dynamics]] is an approach to understanding the behaviour of systems over time.  It deals with internal feedback loops and time delays that affect the behaviour and state of the entire system.&amp;lt;ref name=&amp;quot;sysdyn&amp;quot;&amp;gt;[http://sysdyn.clexchange.org MIT System Dynamics in Education Project (SDEP)&amp;lt;!-- Bot generated title --&amp;gt;] {{webarchive|url=https://web.archive.org/web/20080509163801/http://sysdyn.clexchange.org/ |date=2008-05-09 }}&amp;lt;/ref&amp;gt;  What makes using system dynamics different from other approaches to studying systems is the use of [[feedback]] loops and [[Stock and flow|stocks and flows]].  These elements help describe how even seemingly simple systems display baffling [[nonlinearity]].&lt;br /&gt;
&lt;br /&gt;
System dynamics is an approach to understanding the behaviour of systems over time.  It deals with internal feedback loops and time delays that affect the behaviour and state of the entire system.  What makes using system dynamics different from other approaches to studying systems is the use of feedback loops and stocks and flows.  These elements help describe how even seemingly simple systems display baffling nonlinearity.&lt;br /&gt;
&lt;br /&gt;
'''系统动力学 System Dynamics'''是一种理解系统随时间变化行为的方法。它是用来处理影响整个系统行为和状态的内部反馈回路和时间延迟的方法。系统动力学不同于其他系统研究方法的地方在于它使用了反馈环、股票（stocks）和流形（flows）--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|如何翻译stocks 和 folows]]）的元素。这些元素有助于描述看似简单的系统如何显示复杂的非线性行为。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Topological dynamics 拓扑动力学===&lt;br /&gt;
&lt;br /&gt;
:[[Topological dynamics]] is a branch of the theory of dynamical systems in which qualitative, asymptotic properties of dynamical systems are studied from the viewpoint of [[general topology]].&lt;br /&gt;
&lt;br /&gt;
Topological dynamics is a branch of the theory of dynamical systems in which qualitative, asymptotic properties of dynamical systems are studied from the viewpoint of general topology.&lt;br /&gt;
&lt;br /&gt;
'''拓扑动力学 Topological Dynamics'''是动力系统理论的一个分支。在拓朴动力学中，动力系统的定性性质和渐近性质是从一般拓扑学的观点来研究的。&lt;br /&gt;
&lt;br /&gt;
== Applications 应用==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== In human development 在人类发展中的应用===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In [[Developmental psychology|human development]], dynamical systems theory has been used to enhance and simplify Erik Erikson's [[eight stages of psychosocial development]] and offers a standard method of examining the universal pattern of human development. This method is based on the self-organizing and [[fractal]] properties of the [[Fibonacci sequence]].&amp;lt;ref name=Sacco&amp;gt;{{cite journal|last=Sacco|first=R.G.|title=Re-envisaging the eight developmental stages of Erik Erikson: The Fibonacci Life-Chart Method (FLCM)|journal=Journal of Educational and Developmental Psychology|date=2013|volume=3|issue=1|pages=140–146|doi=10.5539/jedp.v3n1p140|doi-access=free}}&amp;lt;/ref&amp;gt; Using mathematical modeling, a natural progression of human development with eight life stages has been identified:  early infancy (0–2 years), toddler (2–4 years), early childhood (4–7 years), middle childhood (7–11 years), adolescence (11–18 years), young adulthood (18–29 years), middle adulthood (29–48 years), and older adulthood (48–78+ years).&amp;lt;ref name=Sacco/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In human development, dynamical systems theory has been used to enhance and simplify Erik Erikson's eight stages of psychosocial development and offers a standard method of examining the universal pattern of human development. This method is based on the self-organizing and fractal properties of the Fibonacci sequence. Using mathematical modeling, a natural progression of human development with eight life stages has been identified:  early infancy (0–2 years), toddler (2–4 years), early childhood (4–7 years), middle childhood (7–11 years), adolescence (11–18 years), young adulthood (18–29 years), middle adulthood (29–48 years), and older adulthood (48–78+ years).&lt;br /&gt;
&lt;br /&gt;
在人类发展方面，动力系统理论已经被用来增强和简化 Erik Erikson 的'''社会心理发展8阶段理论 Eight Stages of Psychosocial Development'''，并提供了一个检验人类发展普遍模式的标准方法。该方法基于斐波那契数列的'''自组织性 self-organizing'''和'''分形 Fractal''' 特性。利用数学模型，人类发展的自然进程被分为8个生命阶段: 早期婴儿期(0-2岁)、幼儿期(2-4岁)、童年早期(4-7岁)、童年中期(7-11岁)、青春期(11-18岁)、成年早期(18-29岁)、成年中期(29-48岁)和老年成年期(48-78岁及以上)。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
According to this model, stage transitions between age intervals represent self-organization processes at multiple levels (e.g., molecules, genes, cell, organ, organ system, organism, behavior, and environment). For example, at the stage transition from [[adolescence]] to [[young adulthood]], and after reaching the critical point of 18 years of age (young adulthood), a peak in [[testosterone]] is observed in males&amp;lt;ref&amp;gt;{{cite journal |last1=Kelsey |first1=T. W. |title=A validated age-related normative model for male total testosterone shows increasing variance but no decline after age 40 years. |journal=PLOS One |volume=9 |issue=10 |pages=e109346 |doi=10.1371/journal.pone.0109346|pmid=25295520 |year=2014 |pmc=4190174 |bibcode=2014PLoSO...9j9346K }}&amp;lt;/ref&amp;gt; and the period of optimal [[fertility]] begins in females.&amp;lt;ref&amp;gt;{{cite book |last1=Tulandi |first1=T. |title=Preservation of fertility |date=2004 |publisher=Taylor &amp;amp; Francis |pages=1–20}}&amp;lt;/ref&amp;gt; Similarly, at age 30 optimal fertility begins to decline in females,&amp;lt;ref name=&amp;quot;Social Science 2008&amp;quot;&amp;gt;{{cite journal |last1=Blanchflower |first1=D. G. |title=Is well-being U-shaped over the life cycle? |journal=Social Science &amp;amp; Medicine |volume=66 |issue=8 |pages=1733–1749 |doi=10.1016/j.socscimed.2008.01.030|pmid=18316146 |year=2008 |citeseerx=10.1.1.63.5221 }}&amp;lt;/ref&amp;gt; and at the stage transition from [[middle adulthood]] to older adulthood at 48 years, the average age of onset of [[menopause]] occurs.&amp;lt;ref name=&amp;quot;Social Science 2008&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
According to this model, stage transitions between age intervals represent self-organization processes at multiple levels (e.g., molecules, genes, cell, organ, organ system, organism, behavior, and environment). For example, at the stage transition from adolescence to young adulthood, and after reaching the critical point of 18 years of age (young adulthood), a peak in testosterone is observed in males and the period of optimal fertility begins in females. Similarly, at age 30 optimal fertility begins to decline in females, and at the stage transition from middle adulthood to older adulthood at 48 years, the average age of onset of menopause occurs.&lt;br /&gt;
&lt;br /&gt;
根据这个模型，年龄的阶段转换代表了多层次的自组织过程(例如，分子、基因、细胞、器官、器官系统、生物体、行为和环境)。例如，在从青春期向成年早期过渡的阶段中，在达到18岁这一关键年龄之后，男性的睾丸激素达到高峰，女性的最佳生育期开始。同样，在30岁时，女性的最佳生育能力开始下降；在从成年中期过渡到老年成年期时，48岁是绝经的平均年龄。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
These events are physical bioattractors of aging from the perspective of Fibonacci mathematical modeling and dynamically systems theory. In practical terms, prediction in human development becomes possible in the same statistical sense in which the average temperature or precipitation at different times of the year can be used for [[weather forecasting]]. Each of the predetermined stages of human development follows an optimal epigenetic biological pattern. This phenomenon can be explained by the occurrence of Fibonacci numbers in biological [[DNA]]&amp;lt;ref&amp;gt;{{cite journal |last1=Perez |first1=J. C. (2010). |title=Codon populations in single-stranded whole human genome DNA are fractal and fine-tuned by the Golden Ratio 1.618. |journal=Interdisciplinary Sciences: Computational Life Sciences |volume=2 |issue=3 |pages=228–240 |doi=10.1007/s12539-010-0022-0|pmid=20658335 |year=2010 }}&amp;lt;/ref&amp;gt; and self-organizing properties of the Fibonacci numbers that converge on the [[golden ratio]].&lt;br /&gt;
&lt;br /&gt;
These events are physical bioattractors of aging from the perspective of Fibonacci mathematical modeling and dynamically systems theory. In practical terms, prediction in human development becomes possible in the same statistical sense in which the average temperature or precipitation at different times of the year can be used for weather forecasting. Each of the predetermined stages of human development follows an optimal epigenetic biological pattern. This phenomenon can be explained by the occurrence of Fibonacci numbers in biological DNA and self-organizing properties of the Fibonacci numbers that converge on the golden ratio.&lt;br /&gt;
&lt;br /&gt;
从斐波那契数学模型和动力系统理论的角度来看，上述事件是衰老的'''物理生物吸引子Physical Bioattractors'''。实际上，正如一年中不同时间的平均气温和降水量可以用来预测天气，预测人类的发展在统计意义上同样是可能的。人类发展的每个'''预定阶段Predetermined Stages'''都遵循最佳的'''表观遗传生物模式 Epigenetic Biological Pattern'''。这种现象可以用 DNA 中的斐波那契数和收敛于黄金分割比的斐波那契数的自组织特性来解释。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== In biomechanics 在运动生物力学中的应用===&lt;br /&gt;
&lt;br /&gt;
In [[sports biomechanics]], dynamical systems theory has emerged in the movement sciences as a viable framework for modeling athletic performance. From a dynamical systems perspective, the human movement system is a highly intricate network of co-dependent sub-systems (e.g. respiratory, circulatory, nervous, skeletomuscular, perceptual) that are composed of a large number of interacting components (e.g. blood cells, oxygen molecules, muscle tissue, metabolic enzymes, connective tissue and bone). In dynamical systems theory, movement patterns emerge through generic processes of self-organization found in physical and biological systems.&amp;lt;ref&amp;gt;Paul S Glazier, Keith Davids, Roger M Bartlett (2003). [http://www.sportsci.org/jour/03/psg.htm &amp;quot;DYNAMICAL SYSTEMS THEORY: a Relevant Framework for Performance-Oriented Sports Biomechanics Research&amp;quot;]. in: Sportscience 7. Accessed 2008-05-08.&amp;lt;/ref&amp;gt; There is no research validation of any of the claims associated to the conceptual application of this framework.&lt;br /&gt;
&lt;br /&gt;
In sports biomechanics, dynamical systems theory has emerged in the movement sciences as a viable framework for modeling athletic performance. From a dynamical systems perspective, the human movement system is a highly intricate network of co-dependent sub-systems (e.g. respiratory, circulatory, nervous, skeletomuscular, perceptual) that are composed of a large number of interacting components (e.g. blood cells, oxygen molecules, muscle tissue, metabolic enzymes, connective tissue and bone). In dynamical systems theory, movement patterns emerge through generic processes of self-organization found in physical and biological systems. There is no research validation of any of the claims associated to the conceptual application of this framework.&lt;br /&gt;
&lt;br /&gt;
在运动生物力学中，动力系统理论新兴地成为对运动表现建模的可行框架。从动力系统的角度来看，人类的运动系统是由高度复杂和相互依赖的子系统网络（如呼吸、循环、神经、骨骼肌系统和知觉系统等）组成的，它们由大量相互作用的部分组成（包括血细胞、氧分子、肌肉组织、代谢酶、结缔组织和骨骼等)。动力系统理论中，运动模式通过物理系统和生物系统中的一般自组织过程出现。没有任何研究证实与这一框架的概念相关的任何主张。&lt;br /&gt;
&lt;br /&gt;
=== In cognitive science 在认知科学中的应用===&lt;br /&gt;
&lt;br /&gt;
Dynamical system theory has been applied in the field of [[neurodynamics|neuroscience]] and [[cognitive science|cognitive development]], especially in [[the neo-Piagetian theories of cognitive development]]. It is the belief that cognitive development is best represented by physical theories rather than theories based on syntax and [[AI]]. It also believed that differential equations are the most appropriate tool for modeling human behavior. These equations are interpreted to represent an agent's cognitive trajectory through [[state space]]. In other words, dynamicists argue that [[psychology]] should be (or is) the description (via differential equations) of the cognitions and behaviors of an agent under certain environmental and internal pressures. The language of chaos theory is also frequently adopted.&lt;br /&gt;
&lt;br /&gt;
Dynamical system theory has been applied in the field of neuroscience and cognitive development, especially in the neo-Piagetian theories of cognitive development. It is the belief that cognitive development is best represented by physical theories rather than theories based on syntax and AI. It also believed that differential equations are the most appropriate tool for modeling human behavior. These equations are interpreted to represent an agent's cognitive trajectory through state space. In other words, dynamicists argue that psychology should be (or is) the description (via differential equations) of the cognitions and behaviors of an agent under certain environmental and internal pressures. The language of chaos theory is also frequently adopted.&lt;br /&gt;
&lt;br /&gt;
动力系统理论已经被应用于神经科学和认知发展领域，特别是在认知发展的'''新皮亚杰学派 neo-Piagetian'''中。人们相信，物理学理论比句法学理论和人工智能理论更能代表认知发展。人们还相信微分方程是人类行为建模最合适的工具。人们认为微分方程可以解释为通过状态空间代表一个主体的认知轨迹的算式。换句话说，动力学家认为心理学应该(或者是)(通过微分方程)描述在一定的环境和内部压力下的主体的认知和行为的学科。混沌理论在相关领域也经常被采用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In it, the learner's mind reaches a state of disequilibrium where old patterns have broken down. This is the phase transition of cognitive development. [[Self-organization]] (the spontaneous creation of coherent forms) sets in as activity levels link to each other. Newly formed macroscopic and microscopic structures support each other, speeding up the process. These links form the structure of a new state of order in the mind through a process called ''scalloping'' (the repeated building up and collapsing of complex performance.) This new, novel state is progressive, discrete, idiosyncratic and unpredictable.&amp;lt;ref&amp;gt;{{cite journal|title=The Promise of Dynamic Systems Approaches for an Integrated Account of Human Development|journal=Child Development|date=2000-02-25|first=Mark D.|last=Lewis|volume=71|issue=1|pages=36–43|id= |url=http://home.oise.utoronto.ca/~mlewis/Manuscripts/Promise.pdf|accessdate=2008-04-04|doi=10.1111/1467-8624.00116|pmid=10836556 |citeseerx=10.1.1.72.3668}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In it, the learner's mind reaches a state of disequilibrium where old patterns have broken down. This is the phase transition of cognitive development. Self-organization (the spontaneous creation of coherent forms) sets in as activity levels link to each other. Newly formed macroscopic and microscopic structures support each other, speeding up the process. These links form the structure of a new state of order in the mind through a process called scalloping (the repeated building up and collapsing of complex performance.) This new, novel state is progressive, discrete, idiosyncratic and unpredictable.&lt;br /&gt;
&lt;br /&gt;
在学习的过程中，旧的模式被打破了，学习者的思维达到了一种不平衡的状态。这是认知发展的阶段性转变。自组织(连贯的自发创造(the spontaneous creation of coherent forms))在'''活动水平 Activity Levels'''相互联系时产生。新形成的宏观和微观结构相互支持，加速了这一过程。这些联系在头脑中形成了一种具有新状态的结构，这个过程被称为“扇贝化 Scalloping”，也就是头脑的复杂性能的不断累积和崩溃的过程 --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|扇贝化的翻译拿不准，这句话的描述比较抽象]]）。这种新的状态是渐进的、离散的、异质的的和不可预知的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Dynamic systems theory has recently been used to explain a long-unanswered problem in child development referred to as the [[A-not-B error]].&amp;lt;ref&amp;gt;{{cite journal|title=Development as a dynamic system|journal=Trends in Cognitive Sciences|date=2003-07-30|first=Linda B.|last=Smith|author2=Esther Thelen|volume=7|issue=8|pages=343–8|id= |url=http://www.indiana.edu/~cogdev/labwork/dynamicsystem.pdf|accessdate=2008-04-04|doi=10.1016/S1364-6613(03)00156-6|pmid=12907229|citeseerx=10.1.1.294.2037}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Dynamic systems theory has recently been used to explain a long-unanswered problem in child development referred to as the A-not-B error.&lt;br /&gt;
&lt;br /&gt;
动力系统理论最近还被用来解释儿童发展中一个长期没有答案的问题，即 A-not-B 错误。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===In second language development 在二语习得中的应用===&lt;br /&gt;
&lt;br /&gt;
{{Main|Dynamic approach to second language development}}&lt;br /&gt;
&lt;br /&gt;
The application of Dynamic Systems Theory to study [[second language acquisition]] is attributed to [[Diane Larsen-Freeman]] who published an article in 1997 in which she claimed that [[second language acquisition]] should be viewed as a developmental process which includes [[language attrition]] as well as language acquisition.&amp;lt;ref&amp;gt;{{cite web|url=https://academic.oup.com/applij/article-abstract/18/2/141/134192|title=Chaos/Complexity Science and Second Language Acquisition|date=1997|publisher=Applied Linguistics}}&amp;lt;/ref&amp;gt; In her article she claimed that language should be viewed as a dynamic system which is dynamic, complex, nonlinear, chaotic, unpredictable, sensitive to initial conditions, open, self-organizing, feedback sensitive, and adaptive.&lt;br /&gt;
&lt;br /&gt;
The application of Dynamic Systems Theory to study second language acquisition is attributed to Diane Larsen-Freeman who published an article in 1997 in which she claimed that second language acquisition should be viewed as a developmental process which includes language attrition as well as language acquisition. In her article she claimed that language should be viewed as a dynamic system which is dynamic, complex, nonlinear, chaotic, unpredictable, sensitive to initial conditions, open, self-organizing, feedback sensitive, and adaptive.&lt;br /&gt;
&lt;br /&gt;
动力系统理论在二语习得研究中的应用归功于 Diane Larsen-Freeman，她在1997年发表的一篇文章中认为，二语习得应该被看作是一个包括语言流失和习得在内的发展过程。她在文章中认为，语言应该被看作是一个动态的、复杂的、非线性的、混沌的、不可预知的、对初始条件敏感的、开放的、自组织的、反馈敏感的和适应性的动力系统。&lt;br /&gt;
&lt;br /&gt;
== See also 参见==&lt;br /&gt;
&lt;br /&gt;
;Related subjects&lt;br /&gt;
&lt;br /&gt;
Related subjects&lt;br /&gt;
&lt;br /&gt;
相关科目&lt;br /&gt;
&lt;br /&gt;
{{div col|colwidth=20em}}&lt;br /&gt;
&lt;br /&gt;
* [[List of dynamical system topics]] 动力系统主题清单&lt;br /&gt;
&lt;br /&gt;
* [[Baker's map]]&lt;br /&gt;
&lt;br /&gt;
* [[Biological applications of bifurcation theory]] 分支理论的生物学应用&lt;br /&gt;
&lt;br /&gt;
* [[Dynamical system (definition)]] 动力系统（定义）&lt;br /&gt;
&lt;br /&gt;
* [[Embodied Embedded Cognition]] 具身认知&lt;br /&gt;
&lt;br /&gt;
* [[Fibonacci numbers]] 斐波那契数&lt;br /&gt;
&lt;br /&gt;
* [[Fractals]] 分形&lt;br /&gt;
&lt;br /&gt;
* [[Gingerbreadman map]]&lt;br /&gt;
&lt;br /&gt;
* [[Halo orbit]] Halo 轨道&lt;br /&gt;
&lt;br /&gt;
* [[List of types of systems theory]] 动力系统类型清单&lt;br /&gt;
&lt;br /&gt;
* [[Oscillation]] 振动性&lt;br /&gt;
&lt;br /&gt;
* [[Postcognitivism]]&lt;br /&gt;
&lt;br /&gt;
* [[Recurrent neural network]] 递归神经网络&lt;br /&gt;
&lt;br /&gt;
* [[Combinatorics and dynamical systems]] 组合数学和动力系统&lt;br /&gt;
&lt;br /&gt;
* [[Synergetics (Haken)|Synergetics]] 协同学(Haken)&lt;br /&gt;
&lt;br /&gt;
* [[Systemography]]&lt;br /&gt;
&lt;br /&gt;
{{div col end}}&lt;br /&gt;
&lt;br /&gt;
;Related scientists&lt;br /&gt;
&lt;br /&gt;
Related scientists&lt;br /&gt;
&lt;br /&gt;
相关科学家&lt;br /&gt;
&lt;br /&gt;
{{div col|colwidth=20em}}&lt;br /&gt;
&lt;br /&gt;
* [[People in systems and control]]&lt;br /&gt;
&lt;br /&gt;
* [[Dmitri Anosov]]&lt;br /&gt;
&lt;br /&gt;
* [[Vladimir Arnold]]&lt;br /&gt;
&lt;br /&gt;
* [[Nikolay Bogolyubov]]&lt;br /&gt;
&lt;br /&gt;
* [[Andrey Kolmogorov]]&lt;br /&gt;
&lt;br /&gt;
* [[Nikolay Mitrofanovich Krylov|Nikolay Krylov]]&lt;br /&gt;
&lt;br /&gt;
* [[Jürgen Moser]]&lt;br /&gt;
&lt;br /&gt;
* [[Yakov G. Sinai]]&lt;br /&gt;
&lt;br /&gt;
* [[Stephen Smale]]&lt;br /&gt;
&lt;br /&gt;
* [[Hillel Furstenberg]]&lt;br /&gt;
&lt;br /&gt;
* [[Grigory Margulis]]&lt;br /&gt;
&lt;br /&gt;
* [[Elon Lindenstrauss]]&lt;br /&gt;
&lt;br /&gt;
{{div col end}}&lt;br /&gt;
&lt;br /&gt;
== Notes 参考资料==&lt;br /&gt;
&lt;br /&gt;
{{reflist}}&lt;br /&gt;
&lt;br /&gt;
== Further reading 拓展阅读==&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Frederick D. |last1=Abraham |first2=Ralph |last2=Abraham |authorlink2=Ralph Abraham (mathematician)|first3=Christopher D. |last3=Shaw |title=A Visual Introduction to Dynamical Systems Theory for Psychology |url=https://books.google.com/books?id=oMbaAAAAMAAJ |year=1990 |publisher=Aerial Press |isbn=978-0-942344-09-7 |oclc=24345312}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=Edward J. |last=Beltrami |title=Mathematics for Dynamic Modeling |url=https://books.google.com/books?id=MmoiJPsuFW8C |year=1998 |publisher=Academic Press |isbn=978-0-12-085566-7 |edition=2nd |oclc=36713294}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=Otomar |last=Hájek |title=Dynamical systems in the plane |url=https://books.google.com/books?id=czhPAQAAIAAJ |year=1968 |publisher=Academic Press |oclc=343328 |authorlink=Otomar Hájek |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=David G. |last=Luenberger |title=Introduction to dynamic systems: theory, models, and applications |url=https://books.google.com/books?id=mvlQAAAAMAAJ |year=1979 |publisher=Wiley |isbn=978-0-471-02594-8 |oclc=4195122 |authorlink=David Luenberger |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Anthony |last1=Michel |author2=Kaining Wang |author3=Bo Hu |title=Qualitative Theory of Dynamical Systems |url=https://books.google.com/books?id=ZPGBnZGV2_cC |year=2001 |publisher=Taylor &amp;amp; Francis |isbn=978-0-8247-0526-8 |oclc=45873628}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Louis |last1=Padulo |first2=Michael A. |last2=Arbib |authorlink2=Michael A. Arbib |title=System theory: a unified state-space approach to continuous and discrete systems |url=https://books.google.com/books?id=6UPvAAAAMAAJ |year=1974 |publisher=Saunders |isbn=9780721670355 |oclc=947600 |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |first=Steven H. |last=Strogatz |title=Nonlinear Dynamics and Chaos: With Applications to Physics, Biology, Chemistry, and Engineering |year=1994 |publisher=Addison Wesley |isbn=978-0-7382-0453-6 |oclc=49839504 |authorlink=Steven Strogatz |ref=harv |url-access=registration |url=https://archive.org/details/nonlineardynamic00stro }}&lt;br /&gt;
&lt;br /&gt;
== External links 外部链接==&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20080613053119/http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html Dynamic Systems 动力系统] Encyclopedia of Cognitive Science entry. --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|这是一个嵌套的链接，但好像只能鼠标点击并超链接到内嵌的那个]]）认知科学百科全书&lt;br /&gt;
&lt;br /&gt;
*[http://mathworld.wolfram.com/DynamicalSystem.html Definition of dynamical system 动力系统的定义] in MathWorld. 在MathWorld.wolfram.com储存的定义&lt;br /&gt;
&lt;br /&gt;
*[http://www.dynamicalsystems.org/ DSWeb] Dynamical Systems Magazine 动力系统杂志&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Areas of mathematics | state=collapsed}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:Dynamical systems]]&lt;br /&gt;
&lt;br /&gt;
Category:Dynamical systems&lt;br /&gt;
&lt;br /&gt;
类别: 动力系统&lt;br /&gt;
&lt;br /&gt;
[[Category:Complex systems theory]]&lt;br /&gt;
&lt;br /&gt;
Category:Complex systems theory&lt;br /&gt;
&lt;br /&gt;
范畴: 复杂系统理论&lt;br /&gt;
&lt;br /&gt;
[[Category:Computational fields of study]]&lt;br /&gt;
&lt;br /&gt;
Category:Computational fields of study&lt;br /&gt;
&lt;br /&gt;
类别: 研究的计算领域&lt;br /&gt;
&lt;br /&gt;
&amp;lt;noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;small&amp;gt;This page was moved from [[wikipedia:en:Dynamical systems theory]]. Its edit history can be viewed at [[动力系统/edithistory]]&amp;lt;/small&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:待整理页面]]&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
===书籍推荐===&lt;br /&gt;
====[https://www.amazon.co.uk/Chaos-Making-Science-James-Gleick/dp/0749386061 Chaos: Making a New Science]====&lt;br /&gt;
The million-copy bestseller by National Book Award nominee and Pulitzer Prize finalist James Gleick—the author of Time Travel: A History—that reveals the science behind chaos theory。&lt;br /&gt;
Very readable, focuses on the scientists and mathematicians behind many of the key results in chaos.&lt;br /&gt;
本书由普利茨奖获得者James Gleick撰写。它是一本易读科普书籍，侧重介绍对混沌概念的发展做出重大贡献的科学家和数学家们。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://www.amazon.com/dp/0199566445/ref=cm_sw_su_dp Chaos and Fractals: An Elementary Introduction]====&lt;br /&gt;
This book provides the reader with an elementary introduction to chaos and fractals, suitable for students with a background in elementary algebra, without assuming prior coursework in calculus or physics. &lt;br /&gt;
这是一本关于混沌和分形的入门书籍。读者需要有一定的线性代数基础，但是不需要有微积分或物理学的基础。&lt;br /&gt;
&lt;br /&gt;
====[https://www.amazon.co.uk/Chaos-Very-Short-Introduction-Introductions/dp/0192853783/ref=pd_lpo_14_img_1/257-2017232-0516612?_encoding=UTF8&amp;amp;pd_rd_i=0192853783&amp;amp;pd_rd_r=eebee69a-fad3-43e3-bbeb-b883f2c59bf5&amp;amp;pd_rd_w=g6knH&amp;amp;pd_rd_wg=sx6z5&amp;amp;pf_rd_p=7b8e3b03-1439-4489-abd4-4a138cf4eca6&amp;amp;pf_rd_r=YTB0XXCR2DM8049PYP1Y&amp;amp;psc=1&amp;amp;refRID=YTB0XXCR2DM8049PYP1Y 牛津通识读本: Chaos]====&lt;br /&gt;
This book would not have been possible without my parents, of course, but I owe a greater debt than most to their faith, doubt, and hope, and to the love and patience of a, b, and c. Professionally my greatest debt is to Ed Spiegel, a father of chaos and my thesis Professor, mentor, and friend.&lt;br /&gt;
本书隶属于牛津通识读本系列。该书由Ed Spiegel的学生Leonard Smith撰写，语言生动简明。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
===集智课程推荐===&lt;br /&gt;
====[https://campus.swarma.org/course/1655 圣塔菲课程：Introduction to Dynamical Systems and Chaos]====&lt;br /&gt;
本课程中，主要介绍动力学系统和混沌系统，您将学到'''蝴蝶效应 Butterfly effect'''、'''奇异吸引子 Attractors'''等基本概念，以及如何应用于您感兴趣的领域。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://campus.swarma.org/course/1641 动力系统分析]====&lt;br /&gt;
本课程主要讲授连续和离散动力系统的定态、极限环及其稳定性分析、动力学系统的结构稳定性和常见的分支类型以及分析方法，混沌概念等。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E5%8A%A8%E5%8A%9B%E7%B3%BB%E7%BB%9F%E7%90%86%E8%AE%BA_Dynamical_Systems_Theory&amp;diff=10098</id>
		<title>动力系统理论 Dynamical Systems Theory</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E5%8A%A8%E5%8A%9B%E7%B3%BB%E7%BB%9F%E7%90%86%E8%AE%BA_Dynamical_Systems_Theory&amp;diff=10098"/>
		<updated>2020-07-10T15:39:25Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。&lt;br /&gt;
&lt;br /&gt;
{{Use dmy dates|date=May 2019|cs1-dates=y}}&lt;br /&gt;
&lt;br /&gt;
'''Dynamical systems theory''' is an area of [[mathematics]] used to describe the behavior of the  [[complex systems|complex]] [[dynamical system]]s, usually by employing [[differential equations]] or [[difference equations]]. When differential equations are employed, the theory is called [[continuous time|''continuous dynamical systems'']]. From a physical point of view, continuous dynamical systems is a generalization of [[classical mechanics]], a generalization where the [[equations of motion]] are postulated directly and are not constrained to be [[Euler–Lagrange equation]]s of a [[Principle of least action|least action principle]]. When difference equations are employed, the theory is called [[discrete time|''discrete dynamical systems'']]. When the time variable runs over a set that is discrete over some intervals and continuous over other intervals or is any arbitrary time-set such as a [[cantor set]], one gets [[dynamic equations on time scales]]. Some situations may also be modeled by mixed operators, such as [[differential-difference equations]].&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory is an area of mathematics used to describe the behavior of the  complex dynamical systems, usually by employing differential equations or difference equations. When differential equations are employed, the theory is called continuous dynamical systems. From a physical point of view, continuous dynamical systems is a generalization of classical mechanics, a generalization where the equations of motion are postulated directly and are not constrained to be Euler–Lagrange equations of a least action principle. When difference equations are employed, the theory is called discrete dynamical systems. When the time variable runs over a set that is discrete over some intervals and continuous over other intervals or is any arbitrary time-set such as a cantor set, one gets dynamic equations on time scales. Some situations may also be modeled by mixed operators, such as differential-difference equations.&lt;br /&gt;
&lt;br /&gt;
  &lt;br /&gt;
'''动力系统理论 Dynamical Systems Theory'''是一个用来描述复杂动力系统行为的数学领域，通常使用微分方程或差分方程。当采用微分方程时，该理论被称为连续动力系统。从物理学的角度来看，连续动力系统是经典力学的推广，也是运动方程的推广，不受极小作用原理Euler–Lagrange方程的约束。当采用差分方程时，该理论被称为离散动力系统。&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;当时间变量在一个离散的集合上运行，在另一个离散的集合上连续，或者像cantor集一样在任意的时间集合上运行时，人们就能得到时间尺度上的动力方程。&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 当时间变量运行在一个某些区间离散、其他区间连续的集合、或者像cantor集一样任意的时间集合上时，人们就能得到时间尺度上的动力方程。&amp;lt;/font&amp;gt;&lt;br /&gt;
&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;'''算子 Operators'''是一个函数空间到函数空间上的映射O：X→X，广义的讲，对任何函数进行某一项操作都可以认为是一个算子，如求幂次、求微分等。&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;这句话的英文原文在哪里？&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;动力系统的有些情况也可以用'''混合算子 Mixed Operators'''来建模，如微分-差分方程。&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 某些情况下，也可以用'''混合算子 Mixed Operators'''来建模，如微分-差分方程。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This theory deals with the long-term qualitative behavior of dynamical systems, and studies the nature of, and when possible the solutions of, the [[equations of motion]] of systems that are often primarily [[mechanics|mechanical]] or otherwise physical in nature, such as [[planetary orbit]]s and the behaviour of [[electronic circuit]]s, as well as systems that arise in [[biology]], [[economics]], and elsewhere. Much of modern research is focused on the study of [[chaotic system]]s.&lt;br /&gt;
&lt;br /&gt;
This theory deals with the long-term qualitative behavior of dynamical systems, and studies the nature of, and when possible the solutions of, the equations of motion of systems that are often primarily mechanical or otherwise physical in nature, such as planetary orbits and the behaviour of electronic circuits, as well as systems that arise in biology, economics, and elsewhere. Much of modern research is focused on the study of chaotic systems.&lt;br /&gt;
&lt;br /&gt;
这个理论处理动力系统的&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;长期定性行为。如果能够得到解的话，还可以研究系统的运动方程。这些方程通常运用到机械或物理研究领域，如行星轨道和电子电路，以及出现在生物学，经济学和其他地方的系统。&amp;lt;/font&amp;gt;现代的研究大多集中在对混沌系统的研究上。&lt;br /&gt;
&amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt;这个理论处理动力系统的长周期性的行为，并且研究系统的动力方程的规律，努力求得可能的解。这些系统通常是一些自然领域里的机械系统或其他物理系统，例如行星轨道和电子电路，也包括一些生物学、经济学和其他学科里的系统。&amp;lt;/font&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This field of study is also called just ''dynamical systems'', ''mathematical dynamical systems theory'' or the ''mathematical theory of dynamical systems''.&lt;br /&gt;
&lt;br /&gt;
This field of study is also called just dynamical systems, mathematical dynamical systems theory or the mathematical theory of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
这个研究领域被称为动力系统，数学动力系统理论或动力系统的数学理论。&lt;br /&gt;
&lt;br /&gt;
[[Image:Lorenz attractor yb.svg|thumb|240px|right|The [[Lorenz attractor]] is an example of a [[non-linear]] dynamical system. Studying this system helped give rise to [[chaos theory]].]]&lt;br /&gt;
&lt;br /&gt;
The [[Lorenz attractor is an example of a non-linear dynamical system. Studying this system helped give rise to chaos theory.]]&lt;br /&gt;
&lt;br /&gt;
'''洛伦兹吸引子 Lorenz Attractor'''是非线性动力系统的一个例子。对这个系统的研究产生了混沌理论。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Overview 综述 ==&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory and [[chaos theory]] deal with the long-term qualitative behavior of [[dynamical system]]s. Here, the focus is not on finding precise solutions to the equations defining the dynamical system (which is often hopeless), but rather to answer questions like &amp;quot;Will the system settle down to a steady state in the long term, and if so, what are the possible steady states?&amp;quot;, or &amp;quot;Does the long-term behavior of the system depend on its initial condition?&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory and chaos theory deal with the long-term qualitative behavior of dynamical systems. Here, the focus is not on finding precise solutions to the equations defining the dynamical system (which is often hopeless), but rather to answer questions like &amp;quot;Will the system settle down to a steady state in the long term, and if so, what are the possible steady states?&amp;quot;, or &amp;quot;Does the long-term behavior of the system depend on its initial condition?&amp;quot;&lt;br /&gt;
&lt;br /&gt;
动力系统理论和'''混沌理论 Chaos Theory'''是用来处理动力系统的长期定性行为的理论。寻找动力系统方程的精确解通常是很难达到的。这两个理论的重点不在于找到精确解，而是回答如下的问题，如“系统长期来看是否会稳定下来，如果可以，那么可能的稳定状态是什么样的?”，或“系统长期的行为是否取决于其初始条件?”&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
An important goal is to describe the fixed points, or steady states of a given dynamical system; these are values of the variable that don't change over time. Some of these fixed points are ''attractive'', meaning that if the system starts out in a nearby state, it converges towards the fixed point.&lt;br /&gt;
&lt;br /&gt;
An important goal is to describe the fixed points, or steady states of a given dynamical system; these are values of the variable that don't change over time. Some of these fixed points are attractive, meaning that if the system starts out in a nearby state, it converges towards the fixed point.&lt;br /&gt;
&lt;br /&gt;
描述给定动力系统的不动点或'''定态 Steady States'''是一个重要的目标。不动点或定态的变量值不会随时间的变化而变化。一些不动点是有吸引力的（attractive），即如果系统的初始值在它的附近，系统最终会收敛到这个不动点。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Similarly, one is interested in ''periodic points'', states of the system that repeat after several timesteps. Periodic points can also be attractive. [[Sharkovskii's theorem]] is an interesting statement about the number of periodic points of a one-dimensional discrete dynamical system.&lt;br /&gt;
&lt;br /&gt;
Similarly, one is interested in periodic points, states of the system that repeat after several timesteps. Periodic points can also be attractive. Sharkovskii's theorem is an interesting statement about the number of periodic points of a one-dimensional discrete dynamical system.&lt;br /&gt;
&lt;br /&gt;
人们还对动力系统的'''周期点 Periodic Points'''感兴趣，即系统在几个时间步之后会不断重复的状态。周期点也可以是有吸引力的。Sharkovskii定理描述了一维离散动力系统的周期点的个数。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Even simple [[nonlinear dynamical system]]s often exhibit seemingly random behavior that has been called ''chaos''.&amp;lt;ref&amp;gt;{{cite journal |last=Grebogi |first=C. |last2=Ott |first2=E. |last3=Yorke |first3=J. |year=1987 |title=Chaos, Strange Attractors, and Fractal Basin Boundaries in Nonlinear Dynamics |journal=[[Science (journal)|Science]] |volume=238 |issue=4827 |pages=632–638 |jstor=1700479 |doi=10.1126/science.238.4827.632 |pmid=17816542 |bibcode=1987Sci...238..632G }}&amp;lt;/ref&amp;gt; The branch of dynamical systems that deals with the clean definition and investigation of chaos is called ''[[chaos theory]]''.&lt;br /&gt;
&lt;br /&gt;
Even simple nonlinear dynamical systems often exhibit seemingly random behavior that has been called chaos. The branch of dynamical systems that deals with the clean definition and investigation of chaos is called chaos theory.&lt;br /&gt;
&lt;br /&gt;
即使是简单的非线性动力系统也常常表现出看似随机的行为，这种行为被称为混沌。混沌理论主要研究混沌的清晰定义和混沌的现象，它是动力系统理论的一个分支。&lt;br /&gt;
&lt;br /&gt;
== History 历史==&lt;br /&gt;
&lt;br /&gt;
The concept of dynamical systems theory has its origins in [[Newtonian mechanics]]. There, as in other natural sciences and engineering disciplines, the evolution rule of dynamical systems is given implicitly by a relation that gives the state of the system only a short time into the future.&lt;br /&gt;
&lt;br /&gt;
The concept of dynamical systems theory has its origins in Newtonian mechanics. There, as in other natural sciences and engineering disciplines, the evolution rule of dynamical systems is given implicitly by a relation that gives the state of the system only a short time into the future.&lt;br /&gt;
&lt;br /&gt;
动态系统理论的概念起源于牛顿运动定律。与其他自然科学和工程学科一样，动力系统的演化规律也是通过一种预测系统在未来很短时间内的状态的关系隐含地给出的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Before the advent of [[computer|fast computing machines]], solving a dynamical system required sophisticated mathematical techniques and could only be accomplished for a small class of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
Before the advent of fast computing machines, solving a dynamical system required sophisticated mathematical techniques and could only be accomplished for a small class of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
在高速计算机器出现之前，解决动力系统问题需要复杂的数学技能，而且还只能解决一小类动力系统问题。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Some excellent presentations of mathematical dynamic system theory include {{harvtxt|Beltrami|1990}}, {{harvtxt|Luenberger|1979}}, {{harvtxt|Padulo|Arbib|1974}}, and {{harvtxt|Strogatz|1994}}.&amp;lt;ref&amp;gt;Jerome R. Busemeyer (2008), [http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html &amp;quot;Dynamic Systems&amp;quot;]. To Appear in: ''Encyclopedia of cognitive science'', Macmillan. Retrieved 8 May 2008.  {{webarchive |url=https://web.archive.org/web/20080613053119/http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html |date=June 13, 2008 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Some excellent presentations of mathematical dynamic system theory include , , , and . To Appear in: ''Encyclopedia of cognitive science'', Macmillan. Retrieved 8 May 2008&lt;br /&gt;
&lt;br /&gt;
优秀的数学动力系统理论包括，，，和。--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|存疑]]）。&lt;br /&gt;
&lt;br /&gt;
== Concepts 概念==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Dynamical systems 动力系统===&lt;br /&gt;
&lt;br /&gt;
{{main|Dynamical system (definition)}}&lt;br /&gt;
&lt;br /&gt;
The [[dynamical system]] concept is a mathematical [[formal system|formalization]] for any fixed &amp;quot;rule&amp;quot; that describes the [[time]] dependence of a point's position in its [[ambient space]].  Examples include the [[mathematical model]]s that describe the swinging of a clock pendulum, the flow of water in a pipe, and the number of fish each spring in a lake.&lt;br /&gt;
&lt;br /&gt;
The dynamical system concept is a mathematical formalization for any fixed &amp;quot;rule&amp;quot; that describes the time dependence of a point's position in its ambient space.  Examples include the mathematical models that describe the swinging of a clock pendulum, the flow of water in a pipe, and the number of fish each spring in a lake.&lt;br /&gt;
&lt;br /&gt;
动力系统是一个对任何描述了点的位置在周围环境随时间变化的“固定”规则的数学式。举例来说，描述钟摆摆动、管道中的水流以及每年春天湖中鱼的数量的数学模型，都属于动力系统的概念范畴。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A dynamical system has a ''state'' determined by a collection of [[real numbers]], or more generally by a [[Set (mathematics)|set]] of [[Point (geometry)|points]] in an appropriate ''state space''.  Small changes in the state of the system correspond to small changes in the numbers.  The numbers are also the coordinates of a geometrical space—a [[manifold]].   The ''evolution rule'' of the dynamical system is a [[function (mathematics)|fixed rule]] that describes what future states follow from the current state.  The rule may be [[Deterministic system (mathematics)|deterministic]] (for a given time interval only one future state follows from the current state) or [[stochastic differential equation|stochastic]] (the evolution of the state is subject to random shocks).&lt;br /&gt;
&lt;br /&gt;
A dynamical system has a state determined by a collection of real numbers, or more generally by a set of points in an appropriate state space.  Small changes in the state of the system correspond to small changes in the numbers.  The numbers are also the coordinates of a geometrical space—a manifold.   The evolution rule of the dynamical system is a fixed rule that describes what future states follow from the current state.  The rule may be deterministic (for a given time interval only one future state follows from the current state) or stochastic (the evolution of the state is subject to random shocks).&lt;br /&gt;
&lt;br /&gt;
动力系统的状态是由一组实数决定的，更广泛地说，是由适当的状态空间中的一组点决定的。系统状态的微小变化对应于数字的变化。这些数字也是几何空间——'''流形 Manifold'''——的坐标组。动力系统的演化是描述了在当前状态之后出现的未来状态的固定规则。这个规则可以是确定性的(在给定的时间间隔内，有且仅有一个未来状态在当前状态之后出现)，或随机性的(状态的演化受到随机因素的影响)。&lt;br /&gt;
&lt;br /&gt;
=== Dynamicism 动态主义===&lt;br /&gt;
&lt;br /&gt;
[[Dynamicism]], also termed the ''dynamic hypothesis'' or the ''dynamic hypothesis in cognitive science'' or ''dynamic cognition'', is a new approach in [[cognitive science]] exemplified by the work of philosopher [[Tim van Gelder]]. It argues that [[differential equations]] are more suited to modelling [[cognition]] than more traditional [[computer]] models.&lt;br /&gt;
&lt;br /&gt;
Dynamicism, also termed the dynamic hypothesis or the dynamic hypothesis in cognitive science or dynamic cognition, is a new approach in cognitive science exemplified by the work of philosopher Tim van Gelder. It argues that differential equations are more suited to modelling cognition than more traditional computer models.&lt;br /&gt;
&lt;br /&gt;
'''动态主义 Dynamicism'''，又称动态假设，或称认知科学、动态认知中的动态假设，是以哲学家Tim van Gelder的著作为代表的认知科学的一种新取向。动态主义认为微分方程比传统的计算机模型更适合于建立认知模型。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Nonlinear system 非线性系统===&lt;br /&gt;
&lt;br /&gt;
{{main|Nonlinear system}}&lt;br /&gt;
&lt;br /&gt;
In [[mathematics]], a [[nonlinear system]] is a system that is not [[linear system|linear]]—i.e., a system that does not satisfy the [[superposition principle]]. Less technically, a nonlinear system is any problem where the variable(s) to solve for cannot be written as a linear sum of independent components. A [[Homogeneity (physics)|nonhomogeneous]] system, which is linear apart from the presence of a function of the [[independent variable]]s, is nonlinear according to a strict definition, but such systems are usually studied alongside linear systems, because they can be transformed to a linear system as long as a particular solution is known.&lt;br /&gt;
&lt;br /&gt;
In mathematics, a nonlinear system is a system that is not linear—i.e., a system that does not satisfy the superposition principle. Less technically, a nonlinear system is any problem where the variable(s) to solve for cannot be written as a linear sum of independent components. A nonhomogeneous system, which is linear apart from the presence of a function of the independent variables, is nonlinear according to a strict definition, but such systems are usually studied alongside linear systems, because they can be transformed to a linear system as long as a particular solution is known.&lt;br /&gt;
&lt;br /&gt;
在数学中，'''非线性系统 Nonlinear System'''是指系统不是线性的——也就是说，一个不满足叠加原理的系统。更通俗地说，非线性系统是待求解变量不能被写成其独立分量的线性和的系统。非齐次系统根据定义严格来说是非线性的，除了它的自变量包含函数以外其他部分都是线性的。但非齐次系统通常与线性系统一起研究，因为只要知道特解，它们就可以转化为线性系统。&lt;br /&gt;
&lt;br /&gt;
== Related fields 相关领域==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Arithmetic dynamics 算术动态系统===&lt;br /&gt;
&lt;br /&gt;
:[[Arithmetic dynamics]] is a field that emerged in the 1990s that amalgamates two areas of mathematics, [[dynamical systems]] and [[number theory]]. Classically, discrete dynamics refers to the study of the [[Iterated function|iteration]] of self-maps of the [[complex plane]] or [[real line]]. Arithmetic dynamics is the study of the number-theoretic properties of integer, rational, {{math|&amp;lt;var&amp;gt;p&amp;lt;/var&amp;gt;}}-adic, and/or algebraic points under repeated application of a [[polynomial]] or [[rational function]].&lt;br /&gt;
&lt;br /&gt;
Arithmetic dynamics is a field that emerged in the 1990s that amalgamates two areas of mathematics, dynamical systems and number theory. Classically, discrete dynamics refers to the study of the iteration of self-maps of the complex plane or real line. Arithmetic dynamics is the study of the number-theoretic properties of integer, rational, -adic, and/or algebraic points under repeated application of a polynomial or rational function.&lt;br /&gt;
&lt;br /&gt;
'''算术动态系统 Arithmetic Dynamics'''是20世纪90年代出现的一个领域，融合了动力系统和数论这两个数学领域。经典的离散动力学研究复平面或实直线的自映射的迭代。算术动态系统研究内容是在多项式或有理函数中的整数、有理数、并元 --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|存疑]]） 和/或代数点的数论性质。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Chaos theory 混沌理论===&lt;br /&gt;
&lt;br /&gt;
:[[Chaos theory]] describes the behavior of certain [[dynamical system (definition)|dynamical system]]s – that is, systems whose state evolves with time – that may exhibit dynamics that are highly sensitive to initial conditions (popularly referred to as the [[butterfly effect]]). As a result of this sensitivity, which manifests itself as an exponential growth of perturbations in the initial conditions, the behavior of chaotic systems appears [[randomness|random]]. This happens even though these systems are [[deterministic system (philosophy)|deterministic]], meaning that their future dynamics are fully defined by their initial conditions, with no random elements involved. This behavior is known as deterministic chaos, or simply ''chaos''.&lt;br /&gt;
&lt;br /&gt;
Chaos theory describes the behavior of certain dynamical systems – that is, systems whose state evolves with time – that may exhibit dynamics that are highly sensitive to initial conditions (popularly referred to as the butterfly effect). As a result of this sensitivity, which manifests itself as an exponential growth of perturbations in the initial conditions, the behavior of chaotic systems appears random. This happens even though these systems are deterministic, meaning that their future dynamics are fully defined by their initial conditions, with no random elements involved. This behavior is known as deterministic chaos, or simply chaos.&lt;br /&gt;
&lt;br /&gt;
混沌理论描述了某些状态随时间演化的动力系统的行为，这些系统可能表现出对初始条件高度敏感的特点（通常被称为'''蝴蝶效应 Butterfly Effect'''）。由于扰动受初始条件影响而指数增长，因此混沌系统具有敏感性，敏感性使它的行为看起来是随机的。但是这种敏感性也会出现在确定的动力系统中，即未来的动力学完全由它的初始条件定义，没有任何随机因素参与的系统中。这种现象被称为确定性混沌，或简单混沌。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Complex systems 复杂系统===&lt;br /&gt;
&lt;br /&gt;
:[[Complex systems]] is a scientific field that studies the common properties of [[system]]s considered [[Complexity|complex]] in [[nature]], [[society]], and [[science]]. It is also called ''complex systems theory'', ''complexity science'', ''study of complex systems'' and/or ''sciences of complexity''. The key problems of such systems are  difficulties with their formal [[Scientific modelling|modeling]] and [[simulation]]. From such perspective, in different research contexts complex systems are defined on the base of their different attributes.&lt;br /&gt;
&lt;br /&gt;
Complex systems is a scientific field that studies the common properties of systems considered complex in nature, society, and science. It is also called complex systems theory, complexity science, study of complex systems and/or sciences of complexity. The key problems of such systems are  difficulties with their formal modeling and simulation. From such perspective, in different research contexts complex systems are defined on the base of their different attributes.&lt;br /&gt;
&lt;br /&gt;
'''复杂系统 Complex Systems'''是研究自然、社会和科学中复杂现象的共同性质的科学领域。它也被称为复杂系统理论、复杂性科学、复杂系统研究和关于复杂性的科学。这些系统的关键问题在于对系统的形式化建模与仿真。因此，复杂系统是根据在不同的研究语境中的不同属性来定义的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
:The study of complex systems is bringing new vitality to many areas of science where a more typical [[reductionist]] strategy has fallen short. ''Complex systems'' is therefore often used as a broad term encompassing a research approach to problems in many diverse disciplines including [[neurosciences]], [[social sciences]], [[meteorology]], [[chemistry]], [[physics]], [[computer science]], [[psychology]], [[artificial life]], [[evolutionary computation]], [[economics]], earthquake prediction, [[molecular biology]] and inquiries into the nature of living [[cell (biology)|cell]]s themselves.&lt;br /&gt;
&lt;br /&gt;
The study of complex systems is bringing new vitality to many areas of science where a more typical reductionist strategy has fallen short. Complex systems is therefore often used as a broad term encompassing a research approach to problems in many diverse disciplines including neurosciences, social sciences, meteorology, chemistry, physics, computer science, psychology, artificial life, evolutionary computation, economics, earthquake prediction, molecular biology and inquiries into the nature of living cells themselves.&lt;br /&gt;
&lt;br /&gt;
还原论策略已经不足以研究许多科学领域的问题，而复杂系统的研究则为科学带来了广泛的新活力。复杂系统通常被用作一个应用广泛的研究方法术语，并涵盖许多不同的学科，包括神经科学、社会科学、气象学、化学、物理学、计算机科学、心理学、人工生命、进化计算、经济学、地震预测、分子生物学以及对活细胞的研究等。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Control theory 控制理论===&lt;br /&gt;
&lt;br /&gt;
:[[Control theory]] is an interdisciplinary branch of [[engineering]] and [[mathematics]], in part it deals with influencing the behavior of [[dynamical system]]s.&lt;br /&gt;
&lt;br /&gt;
Control theory is an interdisciplinary branch of engineering and mathematics, in part it deals with influencing the behavior of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
'''控制理论 Control Theory'''是工程和数学的一个交叉学科，它的其中一部分研究影响动力系统行为的各种因素。&lt;br /&gt;
&lt;br /&gt;
控制理论是一个研究如何调整动态系统特性的理论，它也是工程和数学的一个交叉学科，逐渐的应用在许多社会科学中，例如心理学、社会学（社会学中的控制理论）、犯罪学及'''金融系统 Financial System'''。控制理论一般的目的是借由控制器的动作让系统稳定，也就是系统维持在设定值，而且不会在设定值附近晃动。设定值一般维持不变的控制称为调节，设定值快速变化，要求跟踪速度加速度等的控制称为伺服。它的其中一部分研究影响动力系统行为的各种因素。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Ergodic theory 遍历理论===&lt;br /&gt;
&lt;br /&gt;
:[[Ergodic theory]] is a branch of [[mathematics]] that studies [[dynamical system]]s with an [[invariant measure]] and related problems. Its initial development was motivated by problems of [[statistical physics]].&lt;br /&gt;
&lt;br /&gt;
Ergodic theory is a branch of mathematics that studies dynamical systems with an invariant measure and related problems. Its initial development was motivated by problems of statistical physics.&lt;br /&gt;
&lt;br /&gt;
'''遍历理论 Ergodic Theory'''是数学的一个分支，研究有不变测度相关问题的动力系统。它最初的发展受到了统计物理学的推动。&lt;br /&gt;
遍历理论是研究保测变换的渐近性态的数学分支。它起源于为统计力学提供基础的&amp;quot;遍历假设&amp;quot;研究，并与动力系统理论、概率论、信息论、泛函分析、数论等数学分支有着密切的联系。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Functional analysis 泛函分析===&lt;br /&gt;
&lt;br /&gt;
:[[Functional analysis]] is the branch of [[mathematics]], and specifically of [[mathematical analysis|analysis]], concerned with the study of [[vector space]]s and [[operator (mathematics)|operator]]s acting upon them. It has its historical roots in the study of [[functional space]]s, in particular transformations of [[function (mathematics)|functions]], such as the [[Fourier transform]], as well as in the study of [[differential equations|differential]] and [[integral equations]]. This usage of the word ''[[functional (mathematics)|functional]]'' goes back to the [[calculus of variations]], implying a function whose argument is a function. Its use in general has been attributed to mathematician and physicist [[Vito Volterra]] and its founding is largely attributed to mathematician [[Stefan Banach]].&lt;br /&gt;
&lt;br /&gt;
Functional analysis is the branch of mathematics, and specifically of analysis, concerned with the study of vector spaces and operators acting upon them. It has its historical roots in the study of functional spaces, in particular transformations of functions, such as the Fourier transform, as well as in the study of differential and integral equations. This usage of the word functional goes back to the calculus of variations, implying a function whose argument is a function. Its use in general has been attributed to mathematician and physicist Vito Volterra and its founding is largely attributed to mathematician Stefan Banach.&lt;br /&gt;
&lt;br /&gt;
'''泛函分析 Functional analysis'''是数学分析的一个分支，研究向量空间和作用于向量空间的算子。它源于对函数空间的研究，特别是对函数变换的研究，例如傅里叶变换，微积分方程的研究等。泛函分析的名称“Functional Analysis”中，“functional”这个词的用法可以追溯到变分法，也就是说函数的参数是一个函数。这个词的使用一般被认为归功于数学家和物理学家Vito Volterra，和数学家Stefan Banach。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Graph dynamical systems 图动力系统===&lt;br /&gt;
&lt;br /&gt;
:The concept of [[graph dynamical system]]s (GDS) can be used to capture a wide range of processes taking place on graphs or networks. A major theme in the mathematical and computational analysis of graph dynamical systems is to relate their structural properties (e.g. the network connectivity) and the global dynamics that result.&lt;br /&gt;
&lt;br /&gt;
The concept of graph dynamical systems (GDS) can be used to capture a wide range of processes taking place on graphs or networks. A major theme in the mathematical and computational analysis of graph dynamical systems is to relate their structural properties (e.g. the network connectivity) and the global dynamics that result.&lt;br /&gt;
&lt;br /&gt;
'''图动力系统 Graph dynamical systems (GDS)'''可以用来描绘图或网络上发生的各种过程。图动力系统的数学和计算分析的一个主要主题是关联它们的结构性质(例如:网络连接)和结构性质造成的网络整体的动态结果。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Projected dynamical systems 投影动力系统===&lt;br /&gt;
&lt;br /&gt;
:[[Projected dynamical systems]] it is a [[mathematics|mathematical]] theory investigating the behaviour of [[dynamical system]]s where solutions are restricted to a constraint set. The discipline shares connections to and applications with both the static world of [[Optimization (mathematics)|optimization]] and [[Equilibrium point|equilibrium]] problems and the dynamical world of [[ordinary differential equations]]. A projected dynamical system is given by the [[flow (mathematics)|flow]] to the projected differential equation.&lt;br /&gt;
&lt;br /&gt;
Projected dynamical systems it is a mathematical theory investigating the behaviour of dynamical systems where solutions are restricted to a constraint set. The discipline shares connections to and applications with both the static world of optimization and equilibrium problems and the dynamical world of ordinary differential equations. A projected dynamical system is given by the flow to the projected differential equation.&lt;br /&gt;
&lt;br /&gt;
'''投影动力系统 Projected Dynamical Systems'''是研究解在一个约束集内的动力系统行为的数学理论。这门学科与静态世界中的最优化和平衡问题以及动态世界中的常微分方程都有联系，并且都有相互联系的应用。一个投影动力系统是由投影微分方程的'''流形 flow'''给定的。&lt;br /&gt;
通过对投影微分方程的流分析，给出了一个投影动力系统的表达式：&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\frac{dx(t)}{dt} = \Pi_K(x(t),-F(x(t)))&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中K为约束集。这种形式的微分方程因具有不连续的向量场而值得注意。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Symbolic dynamics 符号动力学===&lt;br /&gt;
&lt;br /&gt;
:[[Symbolic dynamics]] is the practice of modelling a topological or smooth [[dynamical system]] by a discrete space consisting of infinite [[sequence]]s of abstract symbols, each of which corresponds to a state of the system, with the dynamics (evolution) given by the [[shift operator]].&lt;br /&gt;
&lt;br /&gt;
Symbolic dynamics is the practice of modelling a topological or smooth dynamical system by a discrete space consisting of infinite sequences of abstract symbols, each of which corresponds to a state of the system, with the dynamics (evolution) given by the shift operator.&lt;br /&gt;
&lt;br /&gt;
'''符号动力学 Symbolic Dynamics'''是通过一个由抽象符号的无限序列组成的离散空间建立一个拓扑或光滑动力系统的方法。每一个抽象符号的无限序列序列对应于系统的一个状态，并由移位算子给出动力学(演化)。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== System dynamics 系统动力学===&lt;br /&gt;
&lt;br /&gt;
:[[System dynamics]] is an approach to understanding the behaviour of systems over time.  It deals with internal feedback loops and time delays that affect the behaviour and state of the entire system.&amp;lt;ref name=&amp;quot;sysdyn&amp;quot;&amp;gt;[http://sysdyn.clexchange.org MIT System Dynamics in Education Project (SDEP)&amp;lt;!-- Bot generated title --&amp;gt;] {{webarchive|url=https://web.archive.org/web/20080509163801/http://sysdyn.clexchange.org/ |date=2008-05-09 }}&amp;lt;/ref&amp;gt;  What makes using system dynamics different from other approaches to studying systems is the use of [[feedback]] loops and [[Stock and flow|stocks and flows]].  These elements help describe how even seemingly simple systems display baffling [[nonlinearity]].&lt;br /&gt;
&lt;br /&gt;
System dynamics is an approach to understanding the behaviour of systems over time.  It deals with internal feedback loops and time delays that affect the behaviour and state of the entire system.  What makes using system dynamics different from other approaches to studying systems is the use of feedback loops and stocks and flows.  These elements help describe how even seemingly simple systems display baffling nonlinearity.&lt;br /&gt;
&lt;br /&gt;
'''系统动力学 System Dynamics'''是一种理解系统随时间变化行为的方法。它是用来处理影响整个系统行为和状态的内部反馈回路和时间延迟的方法。系统动力学不同于其他系统研究方法的地方在于它使用了反馈环、股票（stocks）和流形（flows）--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|如何翻译stocks 和 folows]]）的元素。这些元素有助于描述看似简单的系统如何显示复杂的非线性行为。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Topological dynamics 拓扑动力学===&lt;br /&gt;
&lt;br /&gt;
:[[Topological dynamics]] is a branch of the theory of dynamical systems in which qualitative, asymptotic properties of dynamical systems are studied from the viewpoint of [[general topology]].&lt;br /&gt;
&lt;br /&gt;
Topological dynamics is a branch of the theory of dynamical systems in which qualitative, asymptotic properties of dynamical systems are studied from the viewpoint of general topology.&lt;br /&gt;
&lt;br /&gt;
'''拓扑动力学 Topological Dynamics'''是动力系统理论的一个分支。在拓朴动力学中，动力系统的定性性质和渐近性质是从一般拓扑学的观点来研究的。&lt;br /&gt;
&lt;br /&gt;
== Applications 应用==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== In human development 在人类发展中的应用===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In [[Developmental psychology|human development]], dynamical systems theory has been used to enhance and simplify Erik Erikson's [[eight stages of psychosocial development]] and offers a standard method of examining the universal pattern of human development. This method is based on the self-organizing and [[fractal]] properties of the [[Fibonacci sequence]].&amp;lt;ref name=Sacco&amp;gt;{{cite journal|last=Sacco|first=R.G.|title=Re-envisaging the eight developmental stages of Erik Erikson: The Fibonacci Life-Chart Method (FLCM)|journal=Journal of Educational and Developmental Psychology|date=2013|volume=3|issue=1|pages=140–146|doi=10.5539/jedp.v3n1p140|doi-access=free}}&amp;lt;/ref&amp;gt; Using mathematical modeling, a natural progression of human development with eight life stages has been identified:  early infancy (0–2 years), toddler (2–4 years), early childhood (4–7 years), middle childhood (7–11 years), adolescence (11–18 years), young adulthood (18–29 years), middle adulthood (29–48 years), and older adulthood (48–78+ years).&amp;lt;ref name=Sacco/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In human development, dynamical systems theory has been used to enhance and simplify Erik Erikson's eight stages of psychosocial development and offers a standard method of examining the universal pattern of human development. This method is based on the self-organizing and fractal properties of the Fibonacci sequence. Using mathematical modeling, a natural progression of human development with eight life stages has been identified:  early infancy (0–2 years), toddler (2–4 years), early childhood (4–7 years), middle childhood (7–11 years), adolescence (11–18 years), young adulthood (18–29 years), middle adulthood (29–48 years), and older adulthood (48–78+ years).&lt;br /&gt;
&lt;br /&gt;
在人类发展方面，动力系统理论已经被用来增强和简化 Erik Erikson 的'''社会心理发展8阶段理论 Eight Stages of Psychosocial Development'''，并提供了一个检验人类发展普遍模式的标准方法。该方法基于斐波那契数列的'''自组织性 self-organizing'''和'''分形 Fractal''' 特性。利用数学模型，人类发展的自然进程被分为8个生命阶段: 早期婴儿期(0-2岁)、幼儿期(2-4岁)、童年早期(4-7岁)、童年中期(7-11岁)、青春期(11-18岁)、成年早期(18-29岁)、成年中期(29-48岁)和老年成年期(48-78岁及以上)。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
According to this model, stage transitions between age intervals represent self-organization processes at multiple levels (e.g., molecules, genes, cell, organ, organ system, organism, behavior, and environment). For example, at the stage transition from [[adolescence]] to [[young adulthood]], and after reaching the critical point of 18 years of age (young adulthood), a peak in [[testosterone]] is observed in males&amp;lt;ref&amp;gt;{{cite journal |last1=Kelsey |first1=T. W. |title=A validated age-related normative model for male total testosterone shows increasing variance but no decline after age 40 years. |journal=PLOS One |volume=9 |issue=10 |pages=e109346 |doi=10.1371/journal.pone.0109346|pmid=25295520 |year=2014 |pmc=4190174 |bibcode=2014PLoSO...9j9346K }}&amp;lt;/ref&amp;gt; and the period of optimal [[fertility]] begins in females.&amp;lt;ref&amp;gt;{{cite book |last1=Tulandi |first1=T. |title=Preservation of fertility |date=2004 |publisher=Taylor &amp;amp; Francis |pages=1–20}}&amp;lt;/ref&amp;gt; Similarly, at age 30 optimal fertility begins to decline in females,&amp;lt;ref name=&amp;quot;Social Science 2008&amp;quot;&amp;gt;{{cite journal |last1=Blanchflower |first1=D. G. |title=Is well-being U-shaped over the life cycle? |journal=Social Science &amp;amp; Medicine |volume=66 |issue=8 |pages=1733–1749 |doi=10.1016/j.socscimed.2008.01.030|pmid=18316146 |year=2008 |citeseerx=10.1.1.63.5221 }}&amp;lt;/ref&amp;gt; and at the stage transition from [[middle adulthood]] to older adulthood at 48 years, the average age of onset of [[menopause]] occurs.&amp;lt;ref name=&amp;quot;Social Science 2008&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
According to this model, stage transitions between age intervals represent self-organization processes at multiple levels (e.g., molecules, genes, cell, organ, organ system, organism, behavior, and environment). For example, at the stage transition from adolescence to young adulthood, and after reaching the critical point of 18 years of age (young adulthood), a peak in testosterone is observed in males and the period of optimal fertility begins in females. Similarly, at age 30 optimal fertility begins to decline in females, and at the stage transition from middle adulthood to older adulthood at 48 years, the average age of onset of menopause occurs.&lt;br /&gt;
&lt;br /&gt;
根据这个模型，年龄的阶段转换代表了多层次的自组织过程(例如，分子、基因、细胞、器官、器官系统、生物体、行为和环境)。例如，在从青春期向成年早期过渡的阶段中，在达到18岁这一关键年龄之后，男性的睾丸激素达到高峰，女性的最佳生育期开始。同样，在30岁时，女性的最佳生育能力开始下降；在从成年中期过渡到老年成年期时，48岁是绝经的平均年龄。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
These events are physical bioattractors of aging from the perspective of Fibonacci mathematical modeling and dynamically systems theory. In practical terms, prediction in human development becomes possible in the same statistical sense in which the average temperature or precipitation at different times of the year can be used for [[weather forecasting]]. Each of the predetermined stages of human development follows an optimal epigenetic biological pattern. This phenomenon can be explained by the occurrence of Fibonacci numbers in biological [[DNA]]&amp;lt;ref&amp;gt;{{cite journal |last1=Perez |first1=J. C. (2010). |title=Codon populations in single-stranded whole human genome DNA are fractal and fine-tuned by the Golden Ratio 1.618. |journal=Interdisciplinary Sciences: Computational Life Sciences |volume=2 |issue=3 |pages=228–240 |doi=10.1007/s12539-010-0022-0|pmid=20658335 |year=2010 }}&amp;lt;/ref&amp;gt; and self-organizing properties of the Fibonacci numbers that converge on the [[golden ratio]].&lt;br /&gt;
&lt;br /&gt;
These events are physical bioattractors of aging from the perspective of Fibonacci mathematical modeling and dynamically systems theory. In practical terms, prediction in human development becomes possible in the same statistical sense in which the average temperature or precipitation at different times of the year can be used for weather forecasting. Each of the predetermined stages of human development follows an optimal epigenetic biological pattern. This phenomenon can be explained by the occurrence of Fibonacci numbers in biological DNA and self-organizing properties of the Fibonacci numbers that converge on the golden ratio.&lt;br /&gt;
&lt;br /&gt;
从斐波那契数学模型和动力系统理论的角度来看，上述事件是衰老的'''物理生物吸引子Physical Bioattractors'''。实际上，正如一年中不同时间的平均气温和降水量可以用来预测天气，预测人类的发展在统计意义上同样是可能的。人类发展的每个'''预定阶段Predetermined Stages'''都遵循最佳的'''表观遗传生物模式 Epigenetic Biological Pattern'''。这种现象可以用 DNA 中的斐波那契数和收敛于黄金分割比的斐波那契数的自组织特性来解释。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== In biomechanics 在运动生物力学中的应用===&lt;br /&gt;
&lt;br /&gt;
In [[sports biomechanics]], dynamical systems theory has emerged in the movement sciences as a viable framework for modeling athletic performance. From a dynamical systems perspective, the human movement system is a highly intricate network of co-dependent sub-systems (e.g. respiratory, circulatory, nervous, skeletomuscular, perceptual) that are composed of a large number of interacting components (e.g. blood cells, oxygen molecules, muscle tissue, metabolic enzymes, connective tissue and bone). In dynamical systems theory, movement patterns emerge through generic processes of self-organization found in physical and biological systems.&amp;lt;ref&amp;gt;Paul S Glazier, Keith Davids, Roger M Bartlett (2003). [http://www.sportsci.org/jour/03/psg.htm &amp;quot;DYNAMICAL SYSTEMS THEORY: a Relevant Framework for Performance-Oriented Sports Biomechanics Research&amp;quot;]. in: Sportscience 7. Accessed 2008-05-08.&amp;lt;/ref&amp;gt; There is no research validation of any of the claims associated to the conceptual application of this framework.&lt;br /&gt;
&lt;br /&gt;
In sports biomechanics, dynamical systems theory has emerged in the movement sciences as a viable framework for modeling athletic performance. From a dynamical systems perspective, the human movement system is a highly intricate network of co-dependent sub-systems (e.g. respiratory, circulatory, nervous, skeletomuscular, perceptual) that are composed of a large number of interacting components (e.g. blood cells, oxygen molecules, muscle tissue, metabolic enzymes, connective tissue and bone). In dynamical systems theory, movement patterns emerge through generic processes of self-organization found in physical and biological systems. There is no research validation of any of the claims associated to the conceptual application of this framework.&lt;br /&gt;
&lt;br /&gt;
在运动生物力学中，动力系统理论新兴地成为对运动表现建模的可行框架。从动力系统的角度来看，人类的运动系统是由高度复杂和相互依赖的子系统网络（如呼吸、循环、神经、骨骼肌系统和知觉系统等）组成的，它们由大量相互作用的部分组成（包括血细胞、氧分子、肌肉组织、代谢酶、结缔组织和骨骼等)。动力系统理论中，运动模式通过物理系统和生物系统中的一般自组织过程出现。没有任何研究证实与这一框架的概念相关的任何主张。&lt;br /&gt;
&lt;br /&gt;
=== In cognitive science 在认知科学中的应用===&lt;br /&gt;
&lt;br /&gt;
Dynamical system theory has been applied in the field of [[neurodynamics|neuroscience]] and [[cognitive science|cognitive development]], especially in [[the neo-Piagetian theories of cognitive development]]. It is the belief that cognitive development is best represented by physical theories rather than theories based on syntax and [[AI]]. It also believed that differential equations are the most appropriate tool for modeling human behavior. These equations are interpreted to represent an agent's cognitive trajectory through [[state space]]. In other words, dynamicists argue that [[psychology]] should be (or is) the description (via differential equations) of the cognitions and behaviors of an agent under certain environmental and internal pressures. The language of chaos theory is also frequently adopted.&lt;br /&gt;
&lt;br /&gt;
Dynamical system theory has been applied in the field of neuroscience and cognitive development, especially in the neo-Piagetian theories of cognitive development. It is the belief that cognitive development is best represented by physical theories rather than theories based on syntax and AI. It also believed that differential equations are the most appropriate tool for modeling human behavior. These equations are interpreted to represent an agent's cognitive trajectory through state space. In other words, dynamicists argue that psychology should be (or is) the description (via differential equations) of the cognitions and behaviors of an agent under certain environmental and internal pressures. The language of chaos theory is also frequently adopted.&lt;br /&gt;
&lt;br /&gt;
动力系统理论已经被应用于神经科学和认知发展领域，特别是在认知发展的'''新皮亚杰学派 neo-Piagetian'''中。人们相信，物理学理论比句法学理论和人工智能理论更能代表认知发展。人们还相信微分方程是人类行为建模最合适的工具。人们认为微分方程可以解释为通过状态空间代表一个主体的认知轨迹的算式。换句话说，动力学家认为心理学应该(或者是)(通过微分方程)描述在一定的环境和内部压力下的主体的认知和行为的学科。混沌理论在相关领域也经常被采用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In it, the learner's mind reaches a state of disequilibrium where old patterns have broken down. This is the phase transition of cognitive development. [[Self-organization]] (the spontaneous creation of coherent forms) sets in as activity levels link to each other. Newly formed macroscopic and microscopic structures support each other, speeding up the process. These links form the structure of a new state of order in the mind through a process called ''scalloping'' (the repeated building up and collapsing of complex performance.) This new, novel state is progressive, discrete, idiosyncratic and unpredictable.&amp;lt;ref&amp;gt;{{cite journal|title=The Promise of Dynamic Systems Approaches for an Integrated Account of Human Development|journal=Child Development|date=2000-02-25|first=Mark D.|last=Lewis|volume=71|issue=1|pages=36–43|id= |url=http://home.oise.utoronto.ca/~mlewis/Manuscripts/Promise.pdf|accessdate=2008-04-04|doi=10.1111/1467-8624.00116|pmid=10836556 |citeseerx=10.1.1.72.3668}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In it, the learner's mind reaches a state of disequilibrium where old patterns have broken down. This is the phase transition of cognitive development. Self-organization (the spontaneous creation of coherent forms) sets in as activity levels link to each other. Newly formed macroscopic and microscopic structures support each other, speeding up the process. These links form the structure of a new state of order in the mind through a process called scalloping (the repeated building up and collapsing of complex performance.) This new, novel state is progressive, discrete, idiosyncratic and unpredictable.&lt;br /&gt;
&lt;br /&gt;
在学习的过程中，旧的模式被打破了，学习者的思维达到了一种不平衡的状态。这是认知发展的阶段性转变。自组织(连贯的自发创造(the spontaneous creation of coherent forms))在'''活动水平 Activity Levels'''相互联系时产生。新形成的宏观和微观结构相互支持，加速了这一过程。这些联系在头脑中形成了一种具有新状态的结构，这个过程被称为“扇贝化 Scalloping”，也就是头脑的复杂性能的不断累积和崩溃的过程 --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|扇贝化的翻译拿不准，这句话的描述比较抽象]]）。这种新的状态是渐进的、离散的、异质的的和不可预知的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Dynamic systems theory has recently been used to explain a long-unanswered problem in child development referred to as the [[A-not-B error]].&amp;lt;ref&amp;gt;{{cite journal|title=Development as a dynamic system|journal=Trends in Cognitive Sciences|date=2003-07-30|first=Linda B.|last=Smith|author2=Esther Thelen|volume=7|issue=8|pages=343–8|id= |url=http://www.indiana.edu/~cogdev/labwork/dynamicsystem.pdf|accessdate=2008-04-04|doi=10.1016/S1364-6613(03)00156-6|pmid=12907229|citeseerx=10.1.1.294.2037}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Dynamic systems theory has recently been used to explain a long-unanswered problem in child development referred to as the A-not-B error.&lt;br /&gt;
&lt;br /&gt;
动力系统理论最近还被用来解释儿童发展中一个长期没有答案的问题，即 A-not-B 错误。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===In second language development 在二语习得中的应用===&lt;br /&gt;
&lt;br /&gt;
{{Main|Dynamic approach to second language development}}&lt;br /&gt;
&lt;br /&gt;
The application of Dynamic Systems Theory to study [[second language acquisition]] is attributed to [[Diane Larsen-Freeman]] who published an article in 1997 in which she claimed that [[second language acquisition]] should be viewed as a developmental process which includes [[language attrition]] as well as language acquisition.&amp;lt;ref&amp;gt;{{cite web|url=https://academic.oup.com/applij/article-abstract/18/2/141/134192|title=Chaos/Complexity Science and Second Language Acquisition|date=1997|publisher=Applied Linguistics}}&amp;lt;/ref&amp;gt; In her article she claimed that language should be viewed as a dynamic system which is dynamic, complex, nonlinear, chaotic, unpredictable, sensitive to initial conditions, open, self-organizing, feedback sensitive, and adaptive.&lt;br /&gt;
&lt;br /&gt;
The application of Dynamic Systems Theory to study second language acquisition is attributed to Diane Larsen-Freeman who published an article in 1997 in which she claimed that second language acquisition should be viewed as a developmental process which includes language attrition as well as language acquisition. In her article she claimed that language should be viewed as a dynamic system which is dynamic, complex, nonlinear, chaotic, unpredictable, sensitive to initial conditions, open, self-organizing, feedback sensitive, and adaptive.&lt;br /&gt;
&lt;br /&gt;
动力系统理论在二语习得研究中的应用归功于 Diane Larsen-Freeman，她在1997年发表的一篇文章中认为，二语习得应该被看作是一个包括语言流失和习得在内的发展过程。她在文章中认为，语言应该被看作是一个动态的、复杂的、非线性的、混沌的、不可预知的、对初始条件敏感的、开放的、自组织的、反馈敏感的和适应性的动力系统。&lt;br /&gt;
&lt;br /&gt;
== See also 参见==&lt;br /&gt;
&lt;br /&gt;
;Related subjects&lt;br /&gt;
&lt;br /&gt;
Related subjects&lt;br /&gt;
&lt;br /&gt;
相关科目&lt;br /&gt;
&lt;br /&gt;
{{div col|colwidth=20em}}&lt;br /&gt;
&lt;br /&gt;
* [[List of dynamical system topics]] 动力系统主题清单&lt;br /&gt;
&lt;br /&gt;
* [[Baker's map]]&lt;br /&gt;
&lt;br /&gt;
* [[Biological applications of bifurcation theory]] 分支理论的生物学应用&lt;br /&gt;
&lt;br /&gt;
* [[Dynamical system (definition)]] 动力系统（定义）&lt;br /&gt;
&lt;br /&gt;
* [[Embodied Embedded Cognition]] 具身认知&lt;br /&gt;
&lt;br /&gt;
* [[Fibonacci numbers]] 斐波那契数&lt;br /&gt;
&lt;br /&gt;
* [[Fractals]] 分形&lt;br /&gt;
&lt;br /&gt;
* [[Gingerbreadman map]]&lt;br /&gt;
&lt;br /&gt;
* [[Halo orbit]] Halo 轨道&lt;br /&gt;
&lt;br /&gt;
* [[List of types of systems theory]] 动力系统类型清单&lt;br /&gt;
&lt;br /&gt;
* [[Oscillation]] 振动性&lt;br /&gt;
&lt;br /&gt;
* [[Postcognitivism]]&lt;br /&gt;
&lt;br /&gt;
* [[Recurrent neural network]] 递归神经网络&lt;br /&gt;
&lt;br /&gt;
* [[Combinatorics and dynamical systems]] 组合数学和动力系统&lt;br /&gt;
&lt;br /&gt;
* [[Synergetics (Haken)|Synergetics]] 协同学(Haken)&lt;br /&gt;
&lt;br /&gt;
* [[Systemography]]&lt;br /&gt;
&lt;br /&gt;
{{div col end}}&lt;br /&gt;
&lt;br /&gt;
;Related scientists&lt;br /&gt;
&lt;br /&gt;
Related scientists&lt;br /&gt;
&lt;br /&gt;
相关科学家&lt;br /&gt;
&lt;br /&gt;
{{div col|colwidth=20em}}&lt;br /&gt;
&lt;br /&gt;
* [[People in systems and control]]&lt;br /&gt;
&lt;br /&gt;
* [[Dmitri Anosov]]&lt;br /&gt;
&lt;br /&gt;
* [[Vladimir Arnold]]&lt;br /&gt;
&lt;br /&gt;
* [[Nikolay Bogolyubov]]&lt;br /&gt;
&lt;br /&gt;
* [[Andrey Kolmogorov]]&lt;br /&gt;
&lt;br /&gt;
* [[Nikolay Mitrofanovich Krylov|Nikolay Krylov]]&lt;br /&gt;
&lt;br /&gt;
* [[Jürgen Moser]]&lt;br /&gt;
&lt;br /&gt;
* [[Yakov G. Sinai]]&lt;br /&gt;
&lt;br /&gt;
* [[Stephen Smale]]&lt;br /&gt;
&lt;br /&gt;
* [[Hillel Furstenberg]]&lt;br /&gt;
&lt;br /&gt;
* [[Grigory Margulis]]&lt;br /&gt;
&lt;br /&gt;
* [[Elon Lindenstrauss]]&lt;br /&gt;
&lt;br /&gt;
{{div col end}}&lt;br /&gt;
&lt;br /&gt;
== Notes 参考资料==&lt;br /&gt;
&lt;br /&gt;
{{reflist}}&lt;br /&gt;
&lt;br /&gt;
== Further reading 拓展阅读==&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Frederick D. |last1=Abraham |first2=Ralph |last2=Abraham |authorlink2=Ralph Abraham (mathematician)|first3=Christopher D. |last3=Shaw |title=A Visual Introduction to Dynamical Systems Theory for Psychology |url=https://books.google.com/books?id=oMbaAAAAMAAJ |year=1990 |publisher=Aerial Press |isbn=978-0-942344-09-7 |oclc=24345312}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=Edward J. |last=Beltrami |title=Mathematics for Dynamic Modeling |url=https://books.google.com/books?id=MmoiJPsuFW8C |year=1998 |publisher=Academic Press |isbn=978-0-12-085566-7 |edition=2nd |oclc=36713294}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=Otomar |last=Hájek |title=Dynamical systems in the plane |url=https://books.google.com/books?id=czhPAQAAIAAJ |year=1968 |publisher=Academic Press |oclc=343328 |authorlink=Otomar Hájek |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=David G. |last=Luenberger |title=Introduction to dynamic systems: theory, models, and applications |url=https://books.google.com/books?id=mvlQAAAAMAAJ |year=1979 |publisher=Wiley |isbn=978-0-471-02594-8 |oclc=4195122 |authorlink=David Luenberger |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Anthony |last1=Michel |author2=Kaining Wang |author3=Bo Hu |title=Qualitative Theory of Dynamical Systems |url=https://books.google.com/books?id=ZPGBnZGV2_cC |year=2001 |publisher=Taylor &amp;amp; Francis |isbn=978-0-8247-0526-8 |oclc=45873628}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Louis |last1=Padulo |first2=Michael A. |last2=Arbib |authorlink2=Michael A. Arbib |title=System theory: a unified state-space approach to continuous and discrete systems |url=https://books.google.com/books?id=6UPvAAAAMAAJ |year=1974 |publisher=Saunders |isbn=9780721670355 |oclc=947600 |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |first=Steven H. |last=Strogatz |title=Nonlinear Dynamics and Chaos: With Applications to Physics, Biology, Chemistry, and Engineering |year=1994 |publisher=Addison Wesley |isbn=978-0-7382-0453-6 |oclc=49839504 |authorlink=Steven Strogatz |ref=harv |url-access=registration |url=https://archive.org/details/nonlineardynamic00stro }}&lt;br /&gt;
&lt;br /&gt;
== External links 外部链接==&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20080613053119/http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html Dynamic Systems 动力系统] Encyclopedia of Cognitive Science entry. --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|这是一个嵌套的链接，但好像只能鼠标点击并超链接到内嵌的那个]]）认知科学百科全书&lt;br /&gt;
&lt;br /&gt;
*[http://mathworld.wolfram.com/DynamicalSystem.html Definition of dynamical system 动力系统的定义] in MathWorld. 在MathWorld.wolfram.com储存的定义&lt;br /&gt;
&lt;br /&gt;
*[http://www.dynamicalsystems.org/ DSWeb] Dynamical Systems Magazine 动力系统杂志&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Areas of mathematics | state=collapsed}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:Dynamical systems]]&lt;br /&gt;
&lt;br /&gt;
Category:Dynamical systems&lt;br /&gt;
&lt;br /&gt;
类别: 动力系统&lt;br /&gt;
&lt;br /&gt;
[[Category:Complex systems theory]]&lt;br /&gt;
&lt;br /&gt;
Category:Complex systems theory&lt;br /&gt;
&lt;br /&gt;
范畴: 复杂系统理论&lt;br /&gt;
&lt;br /&gt;
[[Category:Computational fields of study]]&lt;br /&gt;
&lt;br /&gt;
Category:Computational fields of study&lt;br /&gt;
&lt;br /&gt;
类别: 研究的计算领域&lt;br /&gt;
&lt;br /&gt;
&amp;lt;noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;small&amp;gt;This page was moved from [[wikipedia:en:Dynamical systems theory]]. Its edit history can be viewed at [[动力系统/edithistory]]&amp;lt;/small&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:待整理页面]]&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
===书籍推荐===&lt;br /&gt;
====[https://www.amazon.co.uk/Chaos-Making-Science-James-Gleick/dp/0749386061 Chaos: Making a New Science]====&lt;br /&gt;
The million-copy bestseller by National Book Award nominee and Pulitzer Prize finalist James Gleick—the author of Time Travel: A History—that reveals the science behind chaos theory。&lt;br /&gt;
Very readable, focuses on the scientists and mathematicians behind many of the key results in chaos.&lt;br /&gt;
本书由普利茨奖获得者James Gleick撰写。它是一本易读科普书籍，侧重介绍对混沌概念的发展做出重大贡献的科学家和数学家们。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://www.amazon.com/dp/0199566445/ref=cm_sw_su_dp Chaos and Fractals: An Elementary Introduction]====&lt;br /&gt;
This book provides the reader with an elementary introduction to chaos and fractals, suitable for students with a background in elementary algebra, without assuming prior coursework in calculus or physics. &lt;br /&gt;
这是一本关于混沌和分形的入门书籍。读者需要有一定的线性代数基础，但是不需要有微积分或物理学的基础。&lt;br /&gt;
&lt;br /&gt;
====[https://www.amazon.co.uk/Chaos-Very-Short-Introduction-Introductions/dp/0192853783/ref=pd_lpo_14_img_1/257-2017232-0516612?_encoding=UTF8&amp;amp;pd_rd_i=0192853783&amp;amp;pd_rd_r=eebee69a-fad3-43e3-bbeb-b883f2c59bf5&amp;amp;pd_rd_w=g6knH&amp;amp;pd_rd_wg=sx6z5&amp;amp;pf_rd_p=7b8e3b03-1439-4489-abd4-4a138cf4eca6&amp;amp;pf_rd_r=YTB0XXCR2DM8049PYP1Y&amp;amp;psc=1&amp;amp;refRID=YTB0XXCR2DM8049PYP1Y 牛津通识读本: Chaos]====&lt;br /&gt;
This book would not have been possible without my parents, of course, but I owe a greater debt than most to their faith, doubt, and hope, and to the love and patience of a, b, and c. Professionally my greatest debt is to Ed Spiegel, a father of chaos and my thesis Professor, mentor, and friend.&lt;br /&gt;
本书隶属于牛津通识读本系列。该书由Ed Spiegel的学生Leonard Smith撰写，语言生动简明。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
===集智课程推荐===&lt;br /&gt;
====[https://campus.swarma.org/course/1655 圣塔菲课程：Introduction to Dynamical Systems and Chaos]====&lt;br /&gt;
本课程中，主要介绍动力学系统和混沌系统，您将学到'''蝴蝶效应 Butterfly effect'''、'''奇异吸引子 Attractors'''等基本概念，以及如何应用于您感兴趣的领域。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://campus.swarma.org/course/1641 动力系统分析]====&lt;br /&gt;
本课程主要讲授连续和离散动力系统的定态、极限环及其稳定性分析、动力学系统的结构稳定性和常见的分支类型以及分析方法，混沌概念等。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E5%8A%A8%E5%8A%9B%E7%B3%BB%E7%BB%9F%E7%90%86%E8%AE%BA_Dynamical_Systems_Theory&amp;diff=10097</id>
		<title>动力系统理论 Dynamical Systems Theory</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E5%8A%A8%E5%8A%9B%E7%B3%BB%E7%BB%9F%E7%90%86%E8%AE%BA_Dynamical_Systems_Theory&amp;diff=10097"/>
		<updated>2020-07-10T15:26:14Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。&lt;br /&gt;
&lt;br /&gt;
{{Use dmy dates|date=May 2019|cs1-dates=y}}&lt;br /&gt;
&lt;br /&gt;
'''Dynamical systems theory''' is an area of [[mathematics]] used to describe the behavior of the  [[complex systems|complex]] [[dynamical system]]s, usually by employing [[differential equations]] or [[difference equations]]. When differential equations are employed, the theory is called [[continuous time|''continuous dynamical systems'']]. From a physical point of view, continuous dynamical systems is a generalization of [[classical mechanics]], a generalization where the [[equations of motion]] are postulated directly and are not constrained to be [[Euler–Lagrange equation]]s of a [[Principle of least action|least action principle]]. When difference equations are employed, the theory is called [[discrete time|''discrete dynamical systems'']]. When the time variable runs over a set that is discrete over some intervals and continuous over other intervals or is any arbitrary time-set such as a [[cantor set]], one gets [[dynamic equations on time scales]]. Some situations may also be modeled by mixed operators, such as [[differential-difference equations]].&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory is an area of mathematics used to describe the behavior of the  complex dynamical systems, usually by employing differential equations or difference equations. When differential equations are employed, the theory is called continuous dynamical systems. From a physical point of view, continuous dynamical systems is a generalization of classical mechanics, a generalization where the equations of motion are postulated directly and are not constrained to be Euler–Lagrange equations of a least action principle. When difference equations are employed, the theory is called discrete dynamical systems. When the time variable runs over a set that is discrete over some intervals and continuous over other intervals or is any arbitrary time-set such as a cantor set, one gets dynamic equations on time scales. Some situations may also be modeled by mixed operators, such as differential-difference equations.&lt;br /&gt;
&lt;br /&gt;
  &lt;br /&gt;
'''动力系统理论 Dynamical Systems Theory'''是一个用来描述复杂动力系统行为的数学领域，通常使用微分方程或差分方程。当采用微分方程时，该理论被称为连续动力系统。从物理学的角度来看，连续动力系统是经典力学的推广，也是运动方程的推广，不受极小作用原理Euler–Lagrange方程的约束。当采用差分方程时，该理论被称为离散动力系统。&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;当时间变量在一个离散的集合上运行，在另一个离散的集合上连续，或者像cantor集一样在任意的时间集合上运行时，人们就能得到时间尺度上的动力方程。&amp;lt;/font&amp;gt; &amp;lt;font color=&amp;quot;blue&amp;quot;&amp;gt; 当时间变量运行在一个某些区间离散、其他区间连续的集合、或者像cantor集一样任意的时间集合上时，人们就能得到时间尺度上的动力方程&amp;lt;/font&amp;gt;&lt;br /&gt;
'''算子 Operators'''是一个函数空间到函数空间上的映射O：X→X，广义的讲，对任何函数进行某一项操作都可以认为是一个算子，如求幂次、求微分等。动力系统的有些情况也可以用'''混合算子 Mixed Operators'''来建模，如微分-差分方程。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This theory deals with the long-term qualitative behavior of dynamical systems, and studies the nature of, and when possible the solutions of, the [[equations of motion]] of systems that are often primarily [[mechanics|mechanical]] or otherwise physical in nature, such as [[planetary orbit]]s and the behaviour of [[electronic circuit]]s, as well as systems that arise in [[biology]], [[economics]], and elsewhere. Much of modern research is focused on the study of [[chaotic system]]s.&lt;br /&gt;
&lt;br /&gt;
This theory deals with the long-term qualitative behavior of dynamical systems, and studies the nature of, and when possible the solutions of, the equations of motion of systems that are often primarily mechanical or otherwise physical in nature, such as planetary orbits and the behaviour of electronic circuits, as well as systems that arise in biology, economics, and elsewhere. Much of modern research is focused on the study of chaotic systems.&lt;br /&gt;
&lt;br /&gt;
这个理论处理动力系统的长期定性行为。如果能够得到解的话，还可以研究系统的运动方程。这些方程通常运用到机械或物理研究领域，如行星轨道和电子电路，以及出现在生物学，经济学和其他地方的系统。现代的研究大多集中在对混沌系统的研究上。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This field of study is also called just ''dynamical systems'', ''mathematical dynamical systems theory'' or the ''mathematical theory of dynamical systems''.&lt;br /&gt;
&lt;br /&gt;
This field of study is also called just dynamical systems, mathematical dynamical systems theory or the mathematical theory of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
这个研究领域被称为动力系统，数学动力系统理论或动力系统的数学理论。&lt;br /&gt;
&lt;br /&gt;
[[Image:Lorenz attractor yb.svg|thumb|240px|right|The [[Lorenz attractor]] is an example of a [[non-linear]] dynamical system. Studying this system helped give rise to [[chaos theory]].]]&lt;br /&gt;
&lt;br /&gt;
The [[Lorenz attractor is an example of a non-linear dynamical system. Studying this system helped give rise to chaos theory.]]&lt;br /&gt;
&lt;br /&gt;
'''洛伦兹吸引子 Lorenz Attractor'''是非线性动力系统的一个例子。对这个系统的研究产生了混沌理论。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Overview 综述 ==&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory and [[chaos theory]] deal with the long-term qualitative behavior of [[dynamical system]]s. Here, the focus is not on finding precise solutions to the equations defining the dynamical system (which is often hopeless), but rather to answer questions like &amp;quot;Will the system settle down to a steady state in the long term, and if so, what are the possible steady states?&amp;quot;, or &amp;quot;Does the long-term behavior of the system depend on its initial condition?&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory and chaos theory deal with the long-term qualitative behavior of dynamical systems. Here, the focus is not on finding precise solutions to the equations defining the dynamical system (which is often hopeless), but rather to answer questions like &amp;quot;Will the system settle down to a steady state in the long term, and if so, what are the possible steady states?&amp;quot;, or &amp;quot;Does the long-term behavior of the system depend on its initial condition?&amp;quot;&lt;br /&gt;
&lt;br /&gt;
动力系统理论和'''混沌理论 Chaos Theory'''是用来处理动力系统的长期定性行为的理论。寻找动力系统方程的精确解通常是很难达到的。这两个理论的重点不在于找到精确解，而是回答如下的问题，如“系统长期来看是否会稳定下来，如果可以，那么可能的稳定状态是什么样的?”，或“系统长期的行为是否取决于其初始条件?”&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
An important goal is to describe the fixed points, or steady states of a given dynamical system; these are values of the variable that don't change over time. Some of these fixed points are ''attractive'', meaning that if the system starts out in a nearby state, it converges towards the fixed point.&lt;br /&gt;
&lt;br /&gt;
An important goal is to describe the fixed points, or steady states of a given dynamical system; these are values of the variable that don't change over time. Some of these fixed points are attractive, meaning that if the system starts out in a nearby state, it converges towards the fixed point.&lt;br /&gt;
&lt;br /&gt;
描述给定动力系统的不动点或'''定态 Steady States'''是一个重要的目标。不动点或定态的变量值不会随时间的变化而变化。一些不动点是有吸引力的（attractive），即如果系统的初始值在它的附近，系统最终会收敛到这个不动点。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Similarly, one is interested in ''periodic points'', states of the system that repeat after several timesteps. Periodic points can also be attractive. [[Sharkovskii's theorem]] is an interesting statement about the number of periodic points of a one-dimensional discrete dynamical system.&lt;br /&gt;
&lt;br /&gt;
Similarly, one is interested in periodic points, states of the system that repeat after several timesteps. Periodic points can also be attractive. Sharkovskii's theorem is an interesting statement about the number of periodic points of a one-dimensional discrete dynamical system.&lt;br /&gt;
&lt;br /&gt;
人们还对动力系统的'''周期点 Periodic Points'''感兴趣，即系统在几个时间步之后会不断重复的状态。周期点也可以是有吸引力的。Sharkovskii定理描述了一维离散动力系统的周期点的个数。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Even simple [[nonlinear dynamical system]]s often exhibit seemingly random behavior that has been called ''chaos''.&amp;lt;ref&amp;gt;{{cite journal |last=Grebogi |first=C. |last2=Ott |first2=E. |last3=Yorke |first3=J. |year=1987 |title=Chaos, Strange Attractors, and Fractal Basin Boundaries in Nonlinear Dynamics |journal=[[Science (journal)|Science]] |volume=238 |issue=4827 |pages=632–638 |jstor=1700479 |doi=10.1126/science.238.4827.632 |pmid=17816542 |bibcode=1987Sci...238..632G }}&amp;lt;/ref&amp;gt; The branch of dynamical systems that deals with the clean definition and investigation of chaos is called ''[[chaos theory]]''.&lt;br /&gt;
&lt;br /&gt;
Even simple nonlinear dynamical systems often exhibit seemingly random behavior that has been called chaos. The branch of dynamical systems that deals with the clean definition and investigation of chaos is called chaos theory.&lt;br /&gt;
&lt;br /&gt;
即使是简单的非线性动力系统也常常表现出看似随机的行为，这种行为被称为混沌。混沌理论主要研究混沌的清晰定义和混沌的现象，它是动力系统理论的一个分支。&lt;br /&gt;
&lt;br /&gt;
== History 历史==&lt;br /&gt;
&lt;br /&gt;
The concept of dynamical systems theory has its origins in [[Newtonian mechanics]]. There, as in other natural sciences and engineering disciplines, the evolution rule of dynamical systems is given implicitly by a relation that gives the state of the system only a short time into the future.&lt;br /&gt;
&lt;br /&gt;
The concept of dynamical systems theory has its origins in Newtonian mechanics. There, as in other natural sciences and engineering disciplines, the evolution rule of dynamical systems is given implicitly by a relation that gives the state of the system only a short time into the future.&lt;br /&gt;
&lt;br /&gt;
动态系统理论的概念起源于牛顿运动定律。与其他自然科学和工程学科一样，动力系统的演化规律也是通过一种预测系统在未来很短时间内的状态的关系隐含地给出的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Before the advent of [[computer|fast computing machines]], solving a dynamical system required sophisticated mathematical techniques and could only be accomplished for a small class of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
Before the advent of fast computing machines, solving a dynamical system required sophisticated mathematical techniques and could only be accomplished for a small class of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
在高速计算机器出现之前，解决动力系统问题需要复杂的数学技能，而且还只能解决一小类动力系统问题。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Some excellent presentations of mathematical dynamic system theory include {{harvtxt|Beltrami|1990}}, {{harvtxt|Luenberger|1979}}, {{harvtxt|Padulo|Arbib|1974}}, and {{harvtxt|Strogatz|1994}}.&amp;lt;ref&amp;gt;Jerome R. Busemeyer (2008), [http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html &amp;quot;Dynamic Systems&amp;quot;]. To Appear in: ''Encyclopedia of cognitive science'', Macmillan. Retrieved 8 May 2008.  {{webarchive |url=https://web.archive.org/web/20080613053119/http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html |date=June 13, 2008 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Some excellent presentations of mathematical dynamic system theory include , , , and . To Appear in: ''Encyclopedia of cognitive science'', Macmillan. Retrieved 8 May 2008&lt;br /&gt;
&lt;br /&gt;
优秀的数学动力系统理论包括，，，和。--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|存疑]]）。&lt;br /&gt;
&lt;br /&gt;
== Concepts 概念==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Dynamical systems 动力系统===&lt;br /&gt;
&lt;br /&gt;
{{main|Dynamical system (definition)}}&lt;br /&gt;
&lt;br /&gt;
The [[dynamical system]] concept is a mathematical [[formal system|formalization]] for any fixed &amp;quot;rule&amp;quot; that describes the [[time]] dependence of a point's position in its [[ambient space]].  Examples include the [[mathematical model]]s that describe the swinging of a clock pendulum, the flow of water in a pipe, and the number of fish each spring in a lake.&lt;br /&gt;
&lt;br /&gt;
The dynamical system concept is a mathematical formalization for any fixed &amp;quot;rule&amp;quot; that describes the time dependence of a point's position in its ambient space.  Examples include the mathematical models that describe the swinging of a clock pendulum, the flow of water in a pipe, and the number of fish each spring in a lake.&lt;br /&gt;
&lt;br /&gt;
动力系统是一个对任何描述了点的位置在周围环境随时间变化的“固定”规则的数学式。举例来说，描述钟摆摆动、管道中的水流以及每年春天湖中鱼的数量的数学模型，都属于动力系统的概念范畴。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A dynamical system has a ''state'' determined by a collection of [[real numbers]], or more generally by a [[Set (mathematics)|set]] of [[Point (geometry)|points]] in an appropriate ''state space''.  Small changes in the state of the system correspond to small changes in the numbers.  The numbers are also the coordinates of a geometrical space—a [[manifold]].   The ''evolution rule'' of the dynamical system is a [[function (mathematics)|fixed rule]] that describes what future states follow from the current state.  The rule may be [[Deterministic system (mathematics)|deterministic]] (for a given time interval only one future state follows from the current state) or [[stochastic differential equation|stochastic]] (the evolution of the state is subject to random shocks).&lt;br /&gt;
&lt;br /&gt;
A dynamical system has a state determined by a collection of real numbers, or more generally by a set of points in an appropriate state space.  Small changes in the state of the system correspond to small changes in the numbers.  The numbers are also the coordinates of a geometrical space—a manifold.   The evolution rule of the dynamical system is a fixed rule that describes what future states follow from the current state.  The rule may be deterministic (for a given time interval only one future state follows from the current state) or stochastic (the evolution of the state is subject to random shocks).&lt;br /&gt;
&lt;br /&gt;
动力系统的状态是由一组实数决定的，更广泛地说，是由适当的状态空间中的一组点决定的。系统状态的微小变化对应于数字的变化。这些数字也是几何空间——'''流形 Manifold'''——的坐标组。动力系统的演化是描述了在当前状态之后出现的未来状态的固定规则。这个规则可以是确定性的(在给定的时间间隔内，有且仅有一个未来状态在当前状态之后出现)，或随机性的(状态的演化受到随机因素的影响)。&lt;br /&gt;
&lt;br /&gt;
=== Dynamicism 动态主义===&lt;br /&gt;
&lt;br /&gt;
[[Dynamicism]], also termed the ''dynamic hypothesis'' or the ''dynamic hypothesis in cognitive science'' or ''dynamic cognition'', is a new approach in [[cognitive science]] exemplified by the work of philosopher [[Tim van Gelder]]. It argues that [[differential equations]] are more suited to modelling [[cognition]] than more traditional [[computer]] models.&lt;br /&gt;
&lt;br /&gt;
Dynamicism, also termed the dynamic hypothesis or the dynamic hypothesis in cognitive science or dynamic cognition, is a new approach in cognitive science exemplified by the work of philosopher Tim van Gelder. It argues that differential equations are more suited to modelling cognition than more traditional computer models.&lt;br /&gt;
&lt;br /&gt;
'''动态主义 Dynamicism'''，又称动态假设，或称认知科学、动态认知中的动态假设，是以哲学家Tim van Gelder的著作为代表的认知科学的一种新取向。动态主义认为微分方程比传统的计算机模型更适合于建立认知模型。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Nonlinear system 非线性系统===&lt;br /&gt;
&lt;br /&gt;
{{main|Nonlinear system}}&lt;br /&gt;
&lt;br /&gt;
In [[mathematics]], a [[nonlinear system]] is a system that is not [[linear system|linear]]—i.e., a system that does not satisfy the [[superposition principle]]. Less technically, a nonlinear system is any problem where the variable(s) to solve for cannot be written as a linear sum of independent components. A [[Homogeneity (physics)|nonhomogeneous]] system, which is linear apart from the presence of a function of the [[independent variable]]s, is nonlinear according to a strict definition, but such systems are usually studied alongside linear systems, because they can be transformed to a linear system as long as a particular solution is known.&lt;br /&gt;
&lt;br /&gt;
In mathematics, a nonlinear system is a system that is not linear—i.e., a system that does not satisfy the superposition principle. Less technically, a nonlinear system is any problem where the variable(s) to solve for cannot be written as a linear sum of independent components. A nonhomogeneous system, which is linear apart from the presence of a function of the independent variables, is nonlinear according to a strict definition, but such systems are usually studied alongside linear systems, because they can be transformed to a linear system as long as a particular solution is known.&lt;br /&gt;
&lt;br /&gt;
在数学中，'''非线性系统 Nonlinear System'''是指系统不是线性的——也就是说，一个不满足叠加原理的系统。更通俗地说，非线性系统是待求解变量不能被写成其独立分量的线性和的系统。非齐次系统根据定义严格来说是非线性的，除了它的自变量包含函数以外其他部分都是线性的。但非齐次系统通常与线性系统一起研究，因为只要知道特解，它们就可以转化为线性系统。&lt;br /&gt;
&lt;br /&gt;
== Related fields 相关领域==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Arithmetic dynamics 算术动态系统===&lt;br /&gt;
&lt;br /&gt;
:[[Arithmetic dynamics]] is a field that emerged in the 1990s that amalgamates two areas of mathematics, [[dynamical systems]] and [[number theory]]. Classically, discrete dynamics refers to the study of the [[Iterated function|iteration]] of self-maps of the [[complex plane]] or [[real line]]. Arithmetic dynamics is the study of the number-theoretic properties of integer, rational, {{math|&amp;lt;var&amp;gt;p&amp;lt;/var&amp;gt;}}-adic, and/or algebraic points under repeated application of a [[polynomial]] or [[rational function]].&lt;br /&gt;
&lt;br /&gt;
Arithmetic dynamics is a field that emerged in the 1990s that amalgamates two areas of mathematics, dynamical systems and number theory. Classically, discrete dynamics refers to the study of the iteration of self-maps of the complex plane or real line. Arithmetic dynamics is the study of the number-theoretic properties of integer, rational, -adic, and/or algebraic points under repeated application of a polynomial or rational function.&lt;br /&gt;
&lt;br /&gt;
'''算术动态系统 Arithmetic Dynamics'''是20世纪90年代出现的一个领域，融合了动力系统和数论这两个数学领域。经典的离散动力学研究复平面或实直线的自映射的迭代。算术动态系统研究内容是在多项式或有理函数中的整数、有理数、并元 --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|存疑]]） 和/或代数点的数论性质。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Chaos theory 混沌理论===&lt;br /&gt;
&lt;br /&gt;
:[[Chaos theory]] describes the behavior of certain [[dynamical system (definition)|dynamical system]]s – that is, systems whose state evolves with time – that may exhibit dynamics that are highly sensitive to initial conditions (popularly referred to as the [[butterfly effect]]). As a result of this sensitivity, which manifests itself as an exponential growth of perturbations in the initial conditions, the behavior of chaotic systems appears [[randomness|random]]. This happens even though these systems are [[deterministic system (philosophy)|deterministic]], meaning that their future dynamics are fully defined by their initial conditions, with no random elements involved. This behavior is known as deterministic chaos, or simply ''chaos''.&lt;br /&gt;
&lt;br /&gt;
Chaos theory describes the behavior of certain dynamical systems – that is, systems whose state evolves with time – that may exhibit dynamics that are highly sensitive to initial conditions (popularly referred to as the butterfly effect). As a result of this sensitivity, which manifests itself as an exponential growth of perturbations in the initial conditions, the behavior of chaotic systems appears random. This happens even though these systems are deterministic, meaning that their future dynamics are fully defined by their initial conditions, with no random elements involved. This behavior is known as deterministic chaos, or simply chaos.&lt;br /&gt;
&lt;br /&gt;
混沌理论描述了某些状态随时间演化的动力系统的行为，这些系统可能表现出对初始条件高度敏感的特点（通常被称为'''蝴蝶效应 Butterfly Effect'''）。由于扰动受初始条件影响而指数增长，因此混沌系统具有敏感性，敏感性使它的行为看起来是随机的。但是这种敏感性也会出现在确定的动力系统中，即未来的动力学完全由它的初始条件定义，没有任何随机因素参与的系统中。这种现象被称为确定性混沌，或简单混沌。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Complex systems 复杂系统===&lt;br /&gt;
&lt;br /&gt;
:[[Complex systems]] is a scientific field that studies the common properties of [[system]]s considered [[Complexity|complex]] in [[nature]], [[society]], and [[science]]. It is also called ''complex systems theory'', ''complexity science'', ''study of complex systems'' and/or ''sciences of complexity''. The key problems of such systems are  difficulties with their formal [[Scientific modelling|modeling]] and [[simulation]]. From such perspective, in different research contexts complex systems are defined on the base of their different attributes.&lt;br /&gt;
&lt;br /&gt;
Complex systems is a scientific field that studies the common properties of systems considered complex in nature, society, and science. It is also called complex systems theory, complexity science, study of complex systems and/or sciences of complexity. The key problems of such systems are  difficulties with their formal modeling and simulation. From such perspective, in different research contexts complex systems are defined on the base of their different attributes.&lt;br /&gt;
&lt;br /&gt;
'''复杂系统 Complex Systems'''是研究自然、社会和科学中复杂现象的共同性质的科学领域。它也被称为复杂系统理论、复杂性科学、复杂系统研究和关于复杂性的科学。这些系统的关键问题在于对系统的形式化建模与仿真。因此，复杂系统是根据在不同的研究语境中的不同属性来定义的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
:The study of complex systems is bringing new vitality to many areas of science where a more typical [[reductionist]] strategy has fallen short. ''Complex systems'' is therefore often used as a broad term encompassing a research approach to problems in many diverse disciplines including [[neurosciences]], [[social sciences]], [[meteorology]], [[chemistry]], [[physics]], [[computer science]], [[psychology]], [[artificial life]], [[evolutionary computation]], [[economics]], earthquake prediction, [[molecular biology]] and inquiries into the nature of living [[cell (biology)|cell]]s themselves.&lt;br /&gt;
&lt;br /&gt;
The study of complex systems is bringing new vitality to many areas of science where a more typical reductionist strategy has fallen short. Complex systems is therefore often used as a broad term encompassing a research approach to problems in many diverse disciplines including neurosciences, social sciences, meteorology, chemistry, physics, computer science, psychology, artificial life, evolutionary computation, economics, earthquake prediction, molecular biology and inquiries into the nature of living cells themselves.&lt;br /&gt;
&lt;br /&gt;
还原论策略已经不足以研究许多科学领域的问题，而复杂系统的研究则为科学带来了广泛的新活力。复杂系统通常被用作一个应用广泛的研究方法术语，并涵盖许多不同的学科，包括神经科学、社会科学、气象学、化学、物理学、计算机科学、心理学、人工生命、进化计算、经济学、地震预测、分子生物学以及对活细胞的研究等。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Control theory 控制理论===&lt;br /&gt;
&lt;br /&gt;
:[[Control theory]] is an interdisciplinary branch of [[engineering]] and [[mathematics]], in part it deals with influencing the behavior of [[dynamical system]]s.&lt;br /&gt;
&lt;br /&gt;
Control theory is an interdisciplinary branch of engineering and mathematics, in part it deals with influencing the behavior of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
'''控制理论 Control Theory'''是工程和数学的一个交叉学科，它的其中一部分研究影响动力系统行为的各种因素。&lt;br /&gt;
&lt;br /&gt;
控制理论是一个研究如何调整动态系统特性的理论，它也是工程和数学的一个交叉学科，逐渐的应用在许多社会科学中，例如心理学、社会学（社会学中的控制理论）、犯罪学及'''金融系统 Financial System'''。控制理论一般的目的是借由控制器的动作让系统稳定，也就是系统维持在设定值，而且不会在设定值附近晃动。设定值一般维持不变的控制称为调节，设定值快速变化，要求跟踪速度加速度等的控制称为伺服。它的其中一部分研究影响动力系统行为的各种因素。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Ergodic theory 遍历理论===&lt;br /&gt;
&lt;br /&gt;
:[[Ergodic theory]] is a branch of [[mathematics]] that studies [[dynamical system]]s with an [[invariant measure]] and related problems. Its initial development was motivated by problems of [[statistical physics]].&lt;br /&gt;
&lt;br /&gt;
Ergodic theory is a branch of mathematics that studies dynamical systems with an invariant measure and related problems. Its initial development was motivated by problems of statistical physics.&lt;br /&gt;
&lt;br /&gt;
'''遍历理论 Ergodic Theory'''是数学的一个分支，研究有不变测度相关问题的动力系统。它最初的发展受到了统计物理学的推动。&lt;br /&gt;
遍历理论是研究保测变换的渐近性态的数学分支。它起源于为统计力学提供基础的&amp;quot;遍历假设&amp;quot;研究，并与动力系统理论、概率论、信息论、泛函分析、数论等数学分支有着密切的联系。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Functional analysis 泛函分析===&lt;br /&gt;
&lt;br /&gt;
:[[Functional analysis]] is the branch of [[mathematics]], and specifically of [[mathematical analysis|analysis]], concerned with the study of [[vector space]]s and [[operator (mathematics)|operator]]s acting upon them. It has its historical roots in the study of [[functional space]]s, in particular transformations of [[function (mathematics)|functions]], such as the [[Fourier transform]], as well as in the study of [[differential equations|differential]] and [[integral equations]]. This usage of the word ''[[functional (mathematics)|functional]]'' goes back to the [[calculus of variations]], implying a function whose argument is a function. Its use in general has been attributed to mathematician and physicist [[Vito Volterra]] and its founding is largely attributed to mathematician [[Stefan Banach]].&lt;br /&gt;
&lt;br /&gt;
Functional analysis is the branch of mathematics, and specifically of analysis, concerned with the study of vector spaces and operators acting upon them. It has its historical roots in the study of functional spaces, in particular transformations of functions, such as the Fourier transform, as well as in the study of differential and integral equations. This usage of the word functional goes back to the calculus of variations, implying a function whose argument is a function. Its use in general has been attributed to mathematician and physicist Vito Volterra and its founding is largely attributed to mathematician Stefan Banach.&lt;br /&gt;
&lt;br /&gt;
'''泛函分析 Functional analysis'''是数学分析的一个分支，研究向量空间和作用于向量空间的算子。它源于对函数空间的研究，特别是对函数变换的研究，例如傅里叶变换，微积分方程的研究等。泛函分析的名称“Functional Analysis”中，“functional”这个词的用法可以追溯到变分法，也就是说函数的参数是一个函数。这个词的使用一般被认为归功于数学家和物理学家Vito Volterra，和数学家Stefan Banach。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Graph dynamical systems 图动力系统===&lt;br /&gt;
&lt;br /&gt;
:The concept of [[graph dynamical system]]s (GDS) can be used to capture a wide range of processes taking place on graphs or networks. A major theme in the mathematical and computational analysis of graph dynamical systems is to relate their structural properties (e.g. the network connectivity) and the global dynamics that result.&lt;br /&gt;
&lt;br /&gt;
The concept of graph dynamical systems (GDS) can be used to capture a wide range of processes taking place on graphs or networks. A major theme in the mathematical and computational analysis of graph dynamical systems is to relate their structural properties (e.g. the network connectivity) and the global dynamics that result.&lt;br /&gt;
&lt;br /&gt;
'''图动力系统 Graph dynamical systems (GDS)'''可以用来描绘图或网络上发生的各种过程。图动力系统的数学和计算分析的一个主要主题是关联它们的结构性质(例如:网络连接)和结构性质造成的网络整体的动态结果。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Projected dynamical systems 投影动力系统===&lt;br /&gt;
&lt;br /&gt;
:[[Projected dynamical systems]] it is a [[mathematics|mathematical]] theory investigating the behaviour of [[dynamical system]]s where solutions are restricted to a constraint set. The discipline shares connections to and applications with both the static world of [[Optimization (mathematics)|optimization]] and [[Equilibrium point|equilibrium]] problems and the dynamical world of [[ordinary differential equations]]. A projected dynamical system is given by the [[flow (mathematics)|flow]] to the projected differential equation.&lt;br /&gt;
&lt;br /&gt;
Projected dynamical systems it is a mathematical theory investigating the behaviour of dynamical systems where solutions are restricted to a constraint set. The discipline shares connections to and applications with both the static world of optimization and equilibrium problems and the dynamical world of ordinary differential equations. A projected dynamical system is given by the flow to the projected differential equation.&lt;br /&gt;
&lt;br /&gt;
'''投影动力系统 Projected Dynamical Systems'''是研究解在一个约束集内的动力系统行为的数学理论。这门学科与静态世界中的最优化和平衡问题以及动态世界中的常微分方程都有联系，并且都有相互联系的应用。一个投影动力系统是由投影微分方程的'''流形 flow'''给定的。&lt;br /&gt;
通过对投影微分方程的流分析，给出了一个投影动力系统的表达式：&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\frac{dx(t)}{dt} = \Pi_K(x(t),-F(x(t)))&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中K为约束集。这种形式的微分方程因具有不连续的向量场而值得注意。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Symbolic dynamics 符号动力学===&lt;br /&gt;
&lt;br /&gt;
:[[Symbolic dynamics]] is the practice of modelling a topological or smooth [[dynamical system]] by a discrete space consisting of infinite [[sequence]]s of abstract symbols, each of which corresponds to a state of the system, with the dynamics (evolution) given by the [[shift operator]].&lt;br /&gt;
&lt;br /&gt;
Symbolic dynamics is the practice of modelling a topological or smooth dynamical system by a discrete space consisting of infinite sequences of abstract symbols, each of which corresponds to a state of the system, with the dynamics (evolution) given by the shift operator.&lt;br /&gt;
&lt;br /&gt;
'''符号动力学 Symbolic Dynamics'''是通过一个由抽象符号的无限序列组成的离散空间建立一个拓扑或光滑动力系统的方法。每一个抽象符号的无限序列序列对应于系统的一个状态，并由移位算子给出动力学(演化)。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== System dynamics 系统动力学===&lt;br /&gt;
&lt;br /&gt;
:[[System dynamics]] is an approach to understanding the behaviour of systems over time.  It deals with internal feedback loops and time delays that affect the behaviour and state of the entire system.&amp;lt;ref name=&amp;quot;sysdyn&amp;quot;&amp;gt;[http://sysdyn.clexchange.org MIT System Dynamics in Education Project (SDEP)&amp;lt;!-- Bot generated title --&amp;gt;] {{webarchive|url=https://web.archive.org/web/20080509163801/http://sysdyn.clexchange.org/ |date=2008-05-09 }}&amp;lt;/ref&amp;gt;  What makes using system dynamics different from other approaches to studying systems is the use of [[feedback]] loops and [[Stock and flow|stocks and flows]].  These elements help describe how even seemingly simple systems display baffling [[nonlinearity]].&lt;br /&gt;
&lt;br /&gt;
System dynamics is an approach to understanding the behaviour of systems over time.  It deals with internal feedback loops and time delays that affect the behaviour and state of the entire system.  What makes using system dynamics different from other approaches to studying systems is the use of feedback loops and stocks and flows.  These elements help describe how even seemingly simple systems display baffling nonlinearity.&lt;br /&gt;
&lt;br /&gt;
'''系统动力学 System Dynamics'''是一种理解系统随时间变化行为的方法。它是用来处理影响整个系统行为和状态的内部反馈回路和时间延迟的方法。系统动力学不同于其他系统研究方法的地方在于它使用了反馈环、股票（stocks）和流形（flows）--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|如何翻译stocks 和 folows]]）的元素。这些元素有助于描述看似简单的系统如何显示复杂的非线性行为。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Topological dynamics 拓扑动力学===&lt;br /&gt;
&lt;br /&gt;
:[[Topological dynamics]] is a branch of the theory of dynamical systems in which qualitative, asymptotic properties of dynamical systems are studied from the viewpoint of [[general topology]].&lt;br /&gt;
&lt;br /&gt;
Topological dynamics is a branch of the theory of dynamical systems in which qualitative, asymptotic properties of dynamical systems are studied from the viewpoint of general topology.&lt;br /&gt;
&lt;br /&gt;
'''拓扑动力学 Topological Dynamics'''是动力系统理论的一个分支。在拓朴动力学中，动力系统的定性性质和渐近性质是从一般拓扑学的观点来研究的。&lt;br /&gt;
&lt;br /&gt;
== Applications 应用==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== In human development 在人类发展中的应用===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In [[Developmental psychology|human development]], dynamical systems theory has been used to enhance and simplify Erik Erikson's [[eight stages of psychosocial development]] and offers a standard method of examining the universal pattern of human development. This method is based on the self-organizing and [[fractal]] properties of the [[Fibonacci sequence]].&amp;lt;ref name=Sacco&amp;gt;{{cite journal|last=Sacco|first=R.G.|title=Re-envisaging the eight developmental stages of Erik Erikson: The Fibonacci Life-Chart Method (FLCM)|journal=Journal of Educational and Developmental Psychology|date=2013|volume=3|issue=1|pages=140–146|doi=10.5539/jedp.v3n1p140|doi-access=free}}&amp;lt;/ref&amp;gt; Using mathematical modeling, a natural progression of human development with eight life stages has been identified:  early infancy (0–2 years), toddler (2–4 years), early childhood (4–7 years), middle childhood (7–11 years), adolescence (11–18 years), young adulthood (18–29 years), middle adulthood (29–48 years), and older adulthood (48–78+ years).&amp;lt;ref name=Sacco/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In human development, dynamical systems theory has been used to enhance and simplify Erik Erikson's eight stages of psychosocial development and offers a standard method of examining the universal pattern of human development. This method is based on the self-organizing and fractal properties of the Fibonacci sequence. Using mathematical modeling, a natural progression of human development with eight life stages has been identified:  early infancy (0–2 years), toddler (2–4 years), early childhood (4–7 years), middle childhood (7–11 years), adolescence (11–18 years), young adulthood (18–29 years), middle adulthood (29–48 years), and older adulthood (48–78+ years).&lt;br /&gt;
&lt;br /&gt;
在人类发展方面，动力系统理论已经被用来增强和简化 Erik Erikson 的'''社会心理发展8阶段理论 Eight Stages of Psychosocial Development'''，并提供了一个检验人类发展普遍模式的标准方法。该方法基于斐波那契数列的'''自组织性 self-organizing'''和'''分形 Fractal''' 特性。利用数学模型，人类发展的自然进程被分为8个生命阶段: 早期婴儿期(0-2岁)、幼儿期(2-4岁)、童年早期(4-7岁)、童年中期(7-11岁)、青春期(11-18岁)、成年早期(18-29岁)、成年中期(29-48岁)和老年成年期(48-78岁及以上)。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
According to this model, stage transitions between age intervals represent self-organization processes at multiple levels (e.g., molecules, genes, cell, organ, organ system, organism, behavior, and environment). For example, at the stage transition from [[adolescence]] to [[young adulthood]], and after reaching the critical point of 18 years of age (young adulthood), a peak in [[testosterone]] is observed in males&amp;lt;ref&amp;gt;{{cite journal |last1=Kelsey |first1=T. W. |title=A validated age-related normative model for male total testosterone shows increasing variance but no decline after age 40 years. |journal=PLOS One |volume=9 |issue=10 |pages=e109346 |doi=10.1371/journal.pone.0109346|pmid=25295520 |year=2014 |pmc=4190174 |bibcode=2014PLoSO...9j9346K }}&amp;lt;/ref&amp;gt; and the period of optimal [[fertility]] begins in females.&amp;lt;ref&amp;gt;{{cite book |last1=Tulandi |first1=T. |title=Preservation of fertility |date=2004 |publisher=Taylor &amp;amp; Francis |pages=1–20}}&amp;lt;/ref&amp;gt; Similarly, at age 30 optimal fertility begins to decline in females,&amp;lt;ref name=&amp;quot;Social Science 2008&amp;quot;&amp;gt;{{cite journal |last1=Blanchflower |first1=D. G. |title=Is well-being U-shaped over the life cycle? |journal=Social Science &amp;amp; Medicine |volume=66 |issue=8 |pages=1733–1749 |doi=10.1016/j.socscimed.2008.01.030|pmid=18316146 |year=2008 |citeseerx=10.1.1.63.5221 }}&amp;lt;/ref&amp;gt; and at the stage transition from [[middle adulthood]] to older adulthood at 48 years, the average age of onset of [[menopause]] occurs.&amp;lt;ref name=&amp;quot;Social Science 2008&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
According to this model, stage transitions between age intervals represent self-organization processes at multiple levels (e.g., molecules, genes, cell, organ, organ system, organism, behavior, and environment). For example, at the stage transition from adolescence to young adulthood, and after reaching the critical point of 18 years of age (young adulthood), a peak in testosterone is observed in males and the period of optimal fertility begins in females. Similarly, at age 30 optimal fertility begins to decline in females, and at the stage transition from middle adulthood to older adulthood at 48 years, the average age of onset of menopause occurs.&lt;br /&gt;
&lt;br /&gt;
根据这个模型，年龄的阶段转换代表了多层次的自组织过程(例如，分子、基因、细胞、器官、器官系统、生物体、行为和环境)。例如，在从青春期向成年早期过渡的阶段中，在达到18岁这一关键年龄之后，男性的睾丸激素达到高峰，女性的最佳生育期开始。同样，在30岁时，女性的最佳生育能力开始下降；在从成年中期过渡到老年成年期时，48岁是绝经的平均年龄。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
These events are physical bioattractors of aging from the perspective of Fibonacci mathematical modeling and dynamically systems theory. In practical terms, prediction in human development becomes possible in the same statistical sense in which the average temperature or precipitation at different times of the year can be used for [[weather forecasting]]. Each of the predetermined stages of human development follows an optimal epigenetic biological pattern. This phenomenon can be explained by the occurrence of Fibonacci numbers in biological [[DNA]]&amp;lt;ref&amp;gt;{{cite journal |last1=Perez |first1=J. C. (2010). |title=Codon populations in single-stranded whole human genome DNA are fractal and fine-tuned by the Golden Ratio 1.618. |journal=Interdisciplinary Sciences: Computational Life Sciences |volume=2 |issue=3 |pages=228–240 |doi=10.1007/s12539-010-0022-0|pmid=20658335 |year=2010 }}&amp;lt;/ref&amp;gt; and self-organizing properties of the Fibonacci numbers that converge on the [[golden ratio]].&lt;br /&gt;
&lt;br /&gt;
These events are physical bioattractors of aging from the perspective of Fibonacci mathematical modeling and dynamically systems theory. In practical terms, prediction in human development becomes possible in the same statistical sense in which the average temperature or precipitation at different times of the year can be used for weather forecasting. Each of the predetermined stages of human development follows an optimal epigenetic biological pattern. This phenomenon can be explained by the occurrence of Fibonacci numbers in biological DNA and self-organizing properties of the Fibonacci numbers that converge on the golden ratio.&lt;br /&gt;
&lt;br /&gt;
从斐波那契数学模型和动力系统理论的角度来看，上述事件是衰老的'''物理生物吸引子Physical Bioattractors'''。实际上，正如一年中不同时间的平均气温和降水量可以用来预测天气，预测人类的发展在统计意义上同样是可能的。人类发展的每个'''预定阶段Predetermined Stages'''都遵循最佳的'''表观遗传生物模式 Epigenetic Biological Pattern'''。这种现象可以用 DNA 中的斐波那契数和收敛于黄金分割比的斐波那契数的自组织特性来解释。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== In biomechanics 在运动生物力学中的应用===&lt;br /&gt;
&lt;br /&gt;
In [[sports biomechanics]], dynamical systems theory has emerged in the movement sciences as a viable framework for modeling athletic performance. From a dynamical systems perspective, the human movement system is a highly intricate network of co-dependent sub-systems (e.g. respiratory, circulatory, nervous, skeletomuscular, perceptual) that are composed of a large number of interacting components (e.g. blood cells, oxygen molecules, muscle tissue, metabolic enzymes, connective tissue and bone). In dynamical systems theory, movement patterns emerge through generic processes of self-organization found in physical and biological systems.&amp;lt;ref&amp;gt;Paul S Glazier, Keith Davids, Roger M Bartlett (2003). [http://www.sportsci.org/jour/03/psg.htm &amp;quot;DYNAMICAL SYSTEMS THEORY: a Relevant Framework for Performance-Oriented Sports Biomechanics Research&amp;quot;]. in: Sportscience 7. Accessed 2008-05-08.&amp;lt;/ref&amp;gt; There is no research validation of any of the claims associated to the conceptual application of this framework.&lt;br /&gt;
&lt;br /&gt;
In sports biomechanics, dynamical systems theory has emerged in the movement sciences as a viable framework for modeling athletic performance. From a dynamical systems perspective, the human movement system is a highly intricate network of co-dependent sub-systems (e.g. respiratory, circulatory, nervous, skeletomuscular, perceptual) that are composed of a large number of interacting components (e.g. blood cells, oxygen molecules, muscle tissue, metabolic enzymes, connective tissue and bone). In dynamical systems theory, movement patterns emerge through generic processes of self-organization found in physical and biological systems. There is no research validation of any of the claims associated to the conceptual application of this framework.&lt;br /&gt;
&lt;br /&gt;
在运动生物力学中，动力系统理论新兴地成为对运动表现建模的可行框架。从动力系统的角度来看，人类的运动系统是由高度复杂和相互依赖的子系统网络（如呼吸、循环、神经、骨骼肌系统和知觉系统等）组成的，它们由大量相互作用的部分组成（包括血细胞、氧分子、肌肉组织、代谢酶、结缔组织和骨骼等)。动力系统理论中，运动模式通过物理系统和生物系统中的一般自组织过程出现。没有任何研究证实与这一框架的概念相关的任何主张。&lt;br /&gt;
&lt;br /&gt;
=== In cognitive science 在认知科学中的应用===&lt;br /&gt;
&lt;br /&gt;
Dynamical system theory has been applied in the field of [[neurodynamics|neuroscience]] and [[cognitive science|cognitive development]], especially in [[the neo-Piagetian theories of cognitive development]]. It is the belief that cognitive development is best represented by physical theories rather than theories based on syntax and [[AI]]. It also believed that differential equations are the most appropriate tool for modeling human behavior. These equations are interpreted to represent an agent's cognitive trajectory through [[state space]]. In other words, dynamicists argue that [[psychology]] should be (or is) the description (via differential equations) of the cognitions and behaviors of an agent under certain environmental and internal pressures. The language of chaos theory is also frequently adopted.&lt;br /&gt;
&lt;br /&gt;
Dynamical system theory has been applied in the field of neuroscience and cognitive development, especially in the neo-Piagetian theories of cognitive development. It is the belief that cognitive development is best represented by physical theories rather than theories based on syntax and AI. It also believed that differential equations are the most appropriate tool for modeling human behavior. These equations are interpreted to represent an agent's cognitive trajectory through state space. In other words, dynamicists argue that psychology should be (or is) the description (via differential equations) of the cognitions and behaviors of an agent under certain environmental and internal pressures. The language of chaos theory is also frequently adopted.&lt;br /&gt;
&lt;br /&gt;
动力系统理论已经被应用于神经科学和认知发展领域，特别是在认知发展的'''新皮亚杰学派 neo-Piagetian'''中。人们相信，物理学理论比句法学理论和人工智能理论更能代表认知发展。人们还相信微分方程是人类行为建模最合适的工具。人们认为微分方程可以解释为通过状态空间代表一个主体的认知轨迹的算式。换句话说，动力学家认为心理学应该(或者是)(通过微分方程)描述在一定的环境和内部压力下的主体的认知和行为的学科。混沌理论在相关领域也经常被采用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In it, the learner's mind reaches a state of disequilibrium where old patterns have broken down. This is the phase transition of cognitive development. [[Self-organization]] (the spontaneous creation of coherent forms) sets in as activity levels link to each other. Newly formed macroscopic and microscopic structures support each other, speeding up the process. These links form the structure of a new state of order in the mind through a process called ''scalloping'' (the repeated building up and collapsing of complex performance.) This new, novel state is progressive, discrete, idiosyncratic and unpredictable.&amp;lt;ref&amp;gt;{{cite journal|title=The Promise of Dynamic Systems Approaches for an Integrated Account of Human Development|journal=Child Development|date=2000-02-25|first=Mark D.|last=Lewis|volume=71|issue=1|pages=36–43|id= |url=http://home.oise.utoronto.ca/~mlewis/Manuscripts/Promise.pdf|accessdate=2008-04-04|doi=10.1111/1467-8624.00116|pmid=10836556 |citeseerx=10.1.1.72.3668}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In it, the learner's mind reaches a state of disequilibrium where old patterns have broken down. This is the phase transition of cognitive development. Self-organization (the spontaneous creation of coherent forms) sets in as activity levels link to each other. Newly formed macroscopic and microscopic structures support each other, speeding up the process. These links form the structure of a new state of order in the mind through a process called scalloping (the repeated building up and collapsing of complex performance.) This new, novel state is progressive, discrete, idiosyncratic and unpredictable.&lt;br /&gt;
&lt;br /&gt;
在学习的过程中，旧的模式被打破了，学习者的思维达到了一种不平衡的状态。这是认知发展的阶段性转变。自组织(连贯的自发创造(the spontaneous creation of coherent forms))在'''活动水平 Activity Levels'''相互联系时产生。新形成的宏观和微观结构相互支持，加速了这一过程。这些联系在头脑中形成了一种具有新状态的结构，这个过程被称为“扇贝化 Scalloping”，也就是头脑的复杂性能的不断累积和崩溃的过程 --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|扇贝化的翻译拿不准，这句话的描述比较抽象]]）。这种新的状态是渐进的、离散的、异质的的和不可预知的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Dynamic systems theory has recently been used to explain a long-unanswered problem in child development referred to as the [[A-not-B error]].&amp;lt;ref&amp;gt;{{cite journal|title=Development as a dynamic system|journal=Trends in Cognitive Sciences|date=2003-07-30|first=Linda B.|last=Smith|author2=Esther Thelen|volume=7|issue=8|pages=343–8|id= |url=http://www.indiana.edu/~cogdev/labwork/dynamicsystem.pdf|accessdate=2008-04-04|doi=10.1016/S1364-6613(03)00156-6|pmid=12907229|citeseerx=10.1.1.294.2037}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Dynamic systems theory has recently been used to explain a long-unanswered problem in child development referred to as the A-not-B error.&lt;br /&gt;
&lt;br /&gt;
动力系统理论最近还被用来解释儿童发展中一个长期没有答案的问题，即 A-not-B 错误。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===In second language development 在二语习得中的应用===&lt;br /&gt;
&lt;br /&gt;
{{Main|Dynamic approach to second language development}}&lt;br /&gt;
&lt;br /&gt;
The application of Dynamic Systems Theory to study [[second language acquisition]] is attributed to [[Diane Larsen-Freeman]] who published an article in 1997 in which she claimed that [[second language acquisition]] should be viewed as a developmental process which includes [[language attrition]] as well as language acquisition.&amp;lt;ref&amp;gt;{{cite web|url=https://academic.oup.com/applij/article-abstract/18/2/141/134192|title=Chaos/Complexity Science and Second Language Acquisition|date=1997|publisher=Applied Linguistics}}&amp;lt;/ref&amp;gt; In her article she claimed that language should be viewed as a dynamic system which is dynamic, complex, nonlinear, chaotic, unpredictable, sensitive to initial conditions, open, self-organizing, feedback sensitive, and adaptive.&lt;br /&gt;
&lt;br /&gt;
The application of Dynamic Systems Theory to study second language acquisition is attributed to Diane Larsen-Freeman who published an article in 1997 in which she claimed that second language acquisition should be viewed as a developmental process which includes language attrition as well as language acquisition. In her article she claimed that language should be viewed as a dynamic system which is dynamic, complex, nonlinear, chaotic, unpredictable, sensitive to initial conditions, open, self-organizing, feedback sensitive, and adaptive.&lt;br /&gt;
&lt;br /&gt;
动力系统理论在二语习得研究中的应用归功于 Diane Larsen-Freeman，她在1997年发表的一篇文章中认为，二语习得应该被看作是一个包括语言流失和习得在内的发展过程。她在文章中认为，语言应该被看作是一个动态的、复杂的、非线性的、混沌的、不可预知的、对初始条件敏感的、开放的、自组织的、反馈敏感的和适应性的动力系统。&lt;br /&gt;
&lt;br /&gt;
== See also 参见==&lt;br /&gt;
&lt;br /&gt;
;Related subjects&lt;br /&gt;
&lt;br /&gt;
Related subjects&lt;br /&gt;
&lt;br /&gt;
相关科目&lt;br /&gt;
&lt;br /&gt;
{{div col|colwidth=20em}}&lt;br /&gt;
&lt;br /&gt;
* [[List of dynamical system topics]] 动力系统主题清单&lt;br /&gt;
&lt;br /&gt;
* [[Baker's map]]&lt;br /&gt;
&lt;br /&gt;
* [[Biological applications of bifurcation theory]] 分支理论的生物学应用&lt;br /&gt;
&lt;br /&gt;
* [[Dynamical system (definition)]] 动力系统（定义）&lt;br /&gt;
&lt;br /&gt;
* [[Embodied Embedded Cognition]] 具身认知&lt;br /&gt;
&lt;br /&gt;
* [[Fibonacci numbers]] 斐波那契数&lt;br /&gt;
&lt;br /&gt;
* [[Fractals]] 分形&lt;br /&gt;
&lt;br /&gt;
* [[Gingerbreadman map]]&lt;br /&gt;
&lt;br /&gt;
* [[Halo orbit]] Halo 轨道&lt;br /&gt;
&lt;br /&gt;
* [[List of types of systems theory]] 动力系统类型清单&lt;br /&gt;
&lt;br /&gt;
* [[Oscillation]] 振动性&lt;br /&gt;
&lt;br /&gt;
* [[Postcognitivism]]&lt;br /&gt;
&lt;br /&gt;
* [[Recurrent neural network]] 递归神经网络&lt;br /&gt;
&lt;br /&gt;
* [[Combinatorics and dynamical systems]] 组合数学和动力系统&lt;br /&gt;
&lt;br /&gt;
* [[Synergetics (Haken)|Synergetics]] 协同学(Haken)&lt;br /&gt;
&lt;br /&gt;
* [[Systemography]]&lt;br /&gt;
&lt;br /&gt;
{{div col end}}&lt;br /&gt;
&lt;br /&gt;
;Related scientists&lt;br /&gt;
&lt;br /&gt;
Related scientists&lt;br /&gt;
&lt;br /&gt;
相关科学家&lt;br /&gt;
&lt;br /&gt;
{{div col|colwidth=20em}}&lt;br /&gt;
&lt;br /&gt;
* [[People in systems and control]]&lt;br /&gt;
&lt;br /&gt;
* [[Dmitri Anosov]]&lt;br /&gt;
&lt;br /&gt;
* [[Vladimir Arnold]]&lt;br /&gt;
&lt;br /&gt;
* [[Nikolay Bogolyubov]]&lt;br /&gt;
&lt;br /&gt;
* [[Andrey Kolmogorov]]&lt;br /&gt;
&lt;br /&gt;
* [[Nikolay Mitrofanovich Krylov|Nikolay Krylov]]&lt;br /&gt;
&lt;br /&gt;
* [[Jürgen Moser]]&lt;br /&gt;
&lt;br /&gt;
* [[Yakov G. Sinai]]&lt;br /&gt;
&lt;br /&gt;
* [[Stephen Smale]]&lt;br /&gt;
&lt;br /&gt;
* [[Hillel Furstenberg]]&lt;br /&gt;
&lt;br /&gt;
* [[Grigory Margulis]]&lt;br /&gt;
&lt;br /&gt;
* [[Elon Lindenstrauss]]&lt;br /&gt;
&lt;br /&gt;
{{div col end}}&lt;br /&gt;
&lt;br /&gt;
== Notes 参考资料==&lt;br /&gt;
&lt;br /&gt;
{{reflist}}&lt;br /&gt;
&lt;br /&gt;
== Further reading 拓展阅读==&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Frederick D. |last1=Abraham |first2=Ralph |last2=Abraham |authorlink2=Ralph Abraham (mathematician)|first3=Christopher D. |last3=Shaw |title=A Visual Introduction to Dynamical Systems Theory for Psychology |url=https://books.google.com/books?id=oMbaAAAAMAAJ |year=1990 |publisher=Aerial Press |isbn=978-0-942344-09-7 |oclc=24345312}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=Edward J. |last=Beltrami |title=Mathematics for Dynamic Modeling |url=https://books.google.com/books?id=MmoiJPsuFW8C |year=1998 |publisher=Academic Press |isbn=978-0-12-085566-7 |edition=2nd |oclc=36713294}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=Otomar |last=Hájek |title=Dynamical systems in the plane |url=https://books.google.com/books?id=czhPAQAAIAAJ |year=1968 |publisher=Academic Press |oclc=343328 |authorlink=Otomar Hájek |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=David G. |last=Luenberger |title=Introduction to dynamic systems: theory, models, and applications |url=https://books.google.com/books?id=mvlQAAAAMAAJ |year=1979 |publisher=Wiley |isbn=978-0-471-02594-8 |oclc=4195122 |authorlink=David Luenberger |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Anthony |last1=Michel |author2=Kaining Wang |author3=Bo Hu |title=Qualitative Theory of Dynamical Systems |url=https://books.google.com/books?id=ZPGBnZGV2_cC |year=2001 |publisher=Taylor &amp;amp; Francis |isbn=978-0-8247-0526-8 |oclc=45873628}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Louis |last1=Padulo |first2=Michael A. |last2=Arbib |authorlink2=Michael A. Arbib |title=System theory: a unified state-space approach to continuous and discrete systems |url=https://books.google.com/books?id=6UPvAAAAMAAJ |year=1974 |publisher=Saunders |isbn=9780721670355 |oclc=947600 |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |first=Steven H. |last=Strogatz |title=Nonlinear Dynamics and Chaos: With Applications to Physics, Biology, Chemistry, and Engineering |year=1994 |publisher=Addison Wesley |isbn=978-0-7382-0453-6 |oclc=49839504 |authorlink=Steven Strogatz |ref=harv |url-access=registration |url=https://archive.org/details/nonlineardynamic00stro }}&lt;br /&gt;
&lt;br /&gt;
== External links 外部链接==&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20080613053119/http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html Dynamic Systems 动力系统] Encyclopedia of Cognitive Science entry. --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|这是一个嵌套的链接，但好像只能鼠标点击并超链接到内嵌的那个]]）认知科学百科全书&lt;br /&gt;
&lt;br /&gt;
*[http://mathworld.wolfram.com/DynamicalSystem.html Definition of dynamical system 动力系统的定义] in MathWorld. 在MathWorld.wolfram.com储存的定义&lt;br /&gt;
&lt;br /&gt;
*[http://www.dynamicalsystems.org/ DSWeb] Dynamical Systems Magazine 动力系统杂志&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Areas of mathematics | state=collapsed}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:Dynamical systems]]&lt;br /&gt;
&lt;br /&gt;
Category:Dynamical systems&lt;br /&gt;
&lt;br /&gt;
类别: 动力系统&lt;br /&gt;
&lt;br /&gt;
[[Category:Complex systems theory]]&lt;br /&gt;
&lt;br /&gt;
Category:Complex systems theory&lt;br /&gt;
&lt;br /&gt;
范畴: 复杂系统理论&lt;br /&gt;
&lt;br /&gt;
[[Category:Computational fields of study]]&lt;br /&gt;
&lt;br /&gt;
Category:Computational fields of study&lt;br /&gt;
&lt;br /&gt;
类别: 研究的计算领域&lt;br /&gt;
&lt;br /&gt;
&amp;lt;noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;small&amp;gt;This page was moved from [[wikipedia:en:Dynamical systems theory]]. Its edit history can be viewed at [[动力系统/edithistory]]&amp;lt;/small&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:待整理页面]]&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
===书籍推荐===&lt;br /&gt;
====[https://www.amazon.co.uk/Chaos-Making-Science-James-Gleick/dp/0749386061 Chaos: Making a New Science]====&lt;br /&gt;
The million-copy bestseller by National Book Award nominee and Pulitzer Prize finalist James Gleick—the author of Time Travel: A History—that reveals the science behind chaos theory。&lt;br /&gt;
Very readable, focuses on the scientists and mathematicians behind many of the key results in chaos.&lt;br /&gt;
本书由普利茨奖获得者James Gleick撰写。它是一本易读科普书籍，侧重介绍对混沌概念的发展做出重大贡献的科学家和数学家们。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://www.amazon.com/dp/0199566445/ref=cm_sw_su_dp Chaos and Fractals: An Elementary Introduction]====&lt;br /&gt;
This book provides the reader with an elementary introduction to chaos and fractals, suitable for students with a background in elementary algebra, without assuming prior coursework in calculus or physics. &lt;br /&gt;
这是一本关于混沌和分形的入门书籍。读者需要有一定的线性代数基础，但是不需要有微积分或物理学的基础。&lt;br /&gt;
&lt;br /&gt;
====[https://www.amazon.co.uk/Chaos-Very-Short-Introduction-Introductions/dp/0192853783/ref=pd_lpo_14_img_1/257-2017232-0516612?_encoding=UTF8&amp;amp;pd_rd_i=0192853783&amp;amp;pd_rd_r=eebee69a-fad3-43e3-bbeb-b883f2c59bf5&amp;amp;pd_rd_w=g6knH&amp;amp;pd_rd_wg=sx6z5&amp;amp;pf_rd_p=7b8e3b03-1439-4489-abd4-4a138cf4eca6&amp;amp;pf_rd_r=YTB0XXCR2DM8049PYP1Y&amp;amp;psc=1&amp;amp;refRID=YTB0XXCR2DM8049PYP1Y 牛津通识读本: Chaos]====&lt;br /&gt;
This book would not have been possible without my parents, of course, but I owe a greater debt than most to their faith, doubt, and hope, and to the love and patience of a, b, and c. Professionally my greatest debt is to Ed Spiegel, a father of chaos and my thesis Professor, mentor, and friend.&lt;br /&gt;
本书隶属于牛津通识读本系列。该书由Ed Spiegel的学生Leonard Smith撰写，语言生动简明。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
===集智课程推荐===&lt;br /&gt;
====[https://campus.swarma.org/course/1655 圣塔菲课程：Introduction to Dynamical Systems and Chaos]====&lt;br /&gt;
本课程中，主要介绍动力学系统和混沌系统，您将学到'''蝴蝶效应 Butterfly effect'''、'''奇异吸引子 Attractors'''等基本概念，以及如何应用于您感兴趣的领域。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://campus.swarma.org/course/1641 动力系统分析]====&lt;br /&gt;
本课程主要讲授连续和离散动力系统的定态、极限环及其稳定性分析、动力学系统的结构稳定性和常见的分支类型以及分析方法，混沌概念等。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E5%8A%A8%E5%8A%9B%E7%B3%BB%E7%BB%9F%E7%90%86%E8%AE%BA_Dynamical_Systems_Theory&amp;diff=10096</id>
		<title>动力系统理论 Dynamical Systems Theory</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E5%8A%A8%E5%8A%9B%E7%B3%BB%E7%BB%9F%E7%90%86%E8%AE%BA_Dynamical_Systems_Theory&amp;diff=10096"/>
		<updated>2020-07-10T15:23:01Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。&lt;br /&gt;
&lt;br /&gt;
{{Use dmy dates|date=May 2019|cs1-dates=y}}&lt;br /&gt;
&lt;br /&gt;
'''Dynamical systems theory''' is an area of [[mathematics]] used to describe the behavior of the  [[complex systems|complex]] [[dynamical system]]s, usually by employing [[differential equations]] or [[difference equations]]. When differential equations are employed, the theory is called [[continuous time|''continuous dynamical systems'']]. From a physical point of view, continuous dynamical systems is a generalization of [[classical mechanics]], a generalization where the [[equations of motion]] are postulated directly and are not constrained to be [[Euler–Lagrange equation]]s of a [[Principle of least action|least action principle]]. When difference equations are employed, the theory is called [[discrete time|''discrete dynamical systems'']]. When the time variable runs over a set that is discrete over some intervals and continuous over other intervals or is any arbitrary time-set such as a [[cantor set]], one gets [[dynamic equations on time scales]]. Some situations may also be modeled by mixed operators, such as [[differential-difference equations]].&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory is an area of mathematics used to describe the behavior of the  complex dynamical systems, usually by employing differential equations or difference equations. When differential equations are employed, the theory is called continuous dynamical systems. From a physical point of view, continuous dynamical systems is a generalization of classical mechanics, a generalization where the equations of motion are postulated directly and are not constrained to be Euler–Lagrange equations of a least action principle. When difference equations are employed, the theory is called discrete dynamical systems. When the time variable runs over a set that is discrete over some intervals and continuous over other intervals or is any arbitrary time-set such as a cantor set, one gets dynamic equations on time scales. Some situations may also be modeled by mixed operators, such as differential-difference equations.&lt;br /&gt;
&lt;br /&gt;
  &lt;br /&gt;
'''动力系统理论 Dynamical Systems Theory'''是一个用来描述复杂动力系统行为的数学领域，通常使用微分方程或差分方程。当采用微分方程时，该理论被称为连续动力系统。从物理学的角度来看，连续动力系统是经典力学的推广，也是运动方程的推广，不受极小作用原理Euler–Lagrange方程的约束。当采用差分方程时，该理论被称为离散动力系统。&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;当时间变量在一个离散的集合上运行，在另一个离散的集合上连续，或者像cantor集一样在任意的时间集合上运行时，人们就能得到时间尺度上的动力方程。&amp;lt;/font&amp;gt;&lt;br /&gt;
'''算子 Operators'''是一个函数空间到函数空间上的映射O：X→X，广义的讲，对任何函数进行某一项操作都可以认为是一个算子，如求幂次、求微分等。动力系统的有些情况也可以用'''混合算子 Mixed Operators'''来建模，如微分-差分方程。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This theory deals with the long-term qualitative behavior of dynamical systems, and studies the nature of, and when possible the solutions of, the [[equations of motion]] of systems that are often primarily [[mechanics|mechanical]] or otherwise physical in nature, such as [[planetary orbit]]s and the behaviour of [[electronic circuit]]s, as well as systems that arise in [[biology]], [[economics]], and elsewhere. Much of modern research is focused on the study of [[chaotic system]]s.&lt;br /&gt;
&lt;br /&gt;
This theory deals with the long-term qualitative behavior of dynamical systems, and studies the nature of, and when possible the solutions of, the equations of motion of systems that are often primarily mechanical or otherwise physical in nature, such as planetary orbits and the behaviour of electronic circuits, as well as systems that arise in biology, economics, and elsewhere. Much of modern research is focused on the study of chaotic systems.&lt;br /&gt;
&lt;br /&gt;
这个理论处理动力系统的长期定性行为。如果能够得到解的话，还可以研究系统的运动方程。这些方程通常运用到机械或物理研究领域，如行星轨道和电子电路，以及出现在生物学，经济学和其他地方的系统。现代的研究大多集中在对混沌系统的研究上。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This field of study is also called just ''dynamical systems'', ''mathematical dynamical systems theory'' or the ''mathematical theory of dynamical systems''.&lt;br /&gt;
&lt;br /&gt;
This field of study is also called just dynamical systems, mathematical dynamical systems theory or the mathematical theory of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
这个研究领域被称为动力系统，数学动力系统理论或动力系统的数学理论。&lt;br /&gt;
&lt;br /&gt;
[[Image:Lorenz attractor yb.svg|thumb|240px|right|The [[Lorenz attractor]] is an example of a [[non-linear]] dynamical system. Studying this system helped give rise to [[chaos theory]].]]&lt;br /&gt;
&lt;br /&gt;
The [[Lorenz attractor is an example of a non-linear dynamical system. Studying this system helped give rise to chaos theory.]]&lt;br /&gt;
&lt;br /&gt;
'''洛伦兹吸引子 Lorenz Attractor'''是非线性动力系统的一个例子。对这个系统的研究产生了混沌理论。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Overview 综述 ==&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory and [[chaos theory]] deal with the long-term qualitative behavior of [[dynamical system]]s. Here, the focus is not on finding precise solutions to the equations defining the dynamical system (which is often hopeless), but rather to answer questions like &amp;quot;Will the system settle down to a steady state in the long term, and if so, what are the possible steady states?&amp;quot;, or &amp;quot;Does the long-term behavior of the system depend on its initial condition?&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory and chaos theory deal with the long-term qualitative behavior of dynamical systems. Here, the focus is not on finding precise solutions to the equations defining the dynamical system (which is often hopeless), but rather to answer questions like &amp;quot;Will the system settle down to a steady state in the long term, and if so, what are the possible steady states?&amp;quot;, or &amp;quot;Does the long-term behavior of the system depend on its initial condition?&amp;quot;&lt;br /&gt;
&lt;br /&gt;
动力系统理论和'''混沌理论 Chaos Theory'''是用来处理动力系统的长期定性行为的理论。寻找动力系统方程的精确解通常是很难达到的。这两个理论的重点不在于找到精确解，而是回答如下的问题，如“系统长期来看是否会稳定下来，如果可以，那么可能的稳定状态是什么样的?”，或“系统长期的行为是否取决于其初始条件?”&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
An important goal is to describe the fixed points, or steady states of a given dynamical system; these are values of the variable that don't change over time. Some of these fixed points are ''attractive'', meaning that if the system starts out in a nearby state, it converges towards the fixed point.&lt;br /&gt;
&lt;br /&gt;
An important goal is to describe the fixed points, or steady states of a given dynamical system; these are values of the variable that don't change over time. Some of these fixed points are attractive, meaning that if the system starts out in a nearby state, it converges towards the fixed point.&lt;br /&gt;
&lt;br /&gt;
描述给定动力系统的不动点或'''定态 Steady States'''是一个重要的目标。不动点或定态的变量值不会随时间的变化而变化。一些不动点是有吸引力的（attractive），即如果系统的初始值在它的附近，系统最终会收敛到这个不动点。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Similarly, one is interested in ''periodic points'', states of the system that repeat after several timesteps. Periodic points can also be attractive. [[Sharkovskii's theorem]] is an interesting statement about the number of periodic points of a one-dimensional discrete dynamical system.&lt;br /&gt;
&lt;br /&gt;
Similarly, one is interested in periodic points, states of the system that repeat after several timesteps. Periodic points can also be attractive. Sharkovskii's theorem is an interesting statement about the number of periodic points of a one-dimensional discrete dynamical system.&lt;br /&gt;
&lt;br /&gt;
人们还对动力系统的'''周期点 Periodic Points'''感兴趣，即系统在几个时间步之后会不断重复的状态。周期点也可以是有吸引力的。Sharkovskii定理描述了一维离散动力系统的周期点的个数。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Even simple [[nonlinear dynamical system]]s often exhibit seemingly random behavior that has been called ''chaos''.&amp;lt;ref&amp;gt;{{cite journal |last=Grebogi |first=C. |last2=Ott |first2=E. |last3=Yorke |first3=J. |year=1987 |title=Chaos, Strange Attractors, and Fractal Basin Boundaries in Nonlinear Dynamics |journal=[[Science (journal)|Science]] |volume=238 |issue=4827 |pages=632–638 |jstor=1700479 |doi=10.1126/science.238.4827.632 |pmid=17816542 |bibcode=1987Sci...238..632G }}&amp;lt;/ref&amp;gt; The branch of dynamical systems that deals with the clean definition and investigation of chaos is called ''[[chaos theory]]''.&lt;br /&gt;
&lt;br /&gt;
Even simple nonlinear dynamical systems often exhibit seemingly random behavior that has been called chaos. The branch of dynamical systems that deals with the clean definition and investigation of chaos is called chaos theory.&lt;br /&gt;
&lt;br /&gt;
即使是简单的非线性动力系统也常常表现出看似随机的行为，这种行为被称为混沌。混沌理论主要研究混沌的清晰定义和混沌的现象，它是动力系统理论的一个分支。&lt;br /&gt;
&lt;br /&gt;
== History 历史==&lt;br /&gt;
&lt;br /&gt;
The concept of dynamical systems theory has its origins in [[Newtonian mechanics]]. There, as in other natural sciences and engineering disciplines, the evolution rule of dynamical systems is given implicitly by a relation that gives the state of the system only a short time into the future.&lt;br /&gt;
&lt;br /&gt;
The concept of dynamical systems theory has its origins in Newtonian mechanics. There, as in other natural sciences and engineering disciplines, the evolution rule of dynamical systems is given implicitly by a relation that gives the state of the system only a short time into the future.&lt;br /&gt;
&lt;br /&gt;
动态系统理论的概念起源于牛顿运动定律。与其他自然科学和工程学科一样，动力系统的演化规律也是通过一种预测系统在未来很短时间内的状态的关系隐含地给出的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Before the advent of [[computer|fast computing machines]], solving a dynamical system required sophisticated mathematical techniques and could only be accomplished for a small class of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
Before the advent of fast computing machines, solving a dynamical system required sophisticated mathematical techniques and could only be accomplished for a small class of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
在高速计算机器出现之前，解决动力系统问题需要复杂的数学技能，而且还只能解决一小类动力系统问题。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Some excellent presentations of mathematical dynamic system theory include {{harvtxt|Beltrami|1990}}, {{harvtxt|Luenberger|1979}}, {{harvtxt|Padulo|Arbib|1974}}, and {{harvtxt|Strogatz|1994}}.&amp;lt;ref&amp;gt;Jerome R. Busemeyer (2008), [http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html &amp;quot;Dynamic Systems&amp;quot;]. To Appear in: ''Encyclopedia of cognitive science'', Macmillan. Retrieved 8 May 2008.  {{webarchive |url=https://web.archive.org/web/20080613053119/http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html |date=June 13, 2008 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Some excellent presentations of mathematical dynamic system theory include , , , and . To Appear in: ''Encyclopedia of cognitive science'', Macmillan. Retrieved 8 May 2008&lt;br /&gt;
&lt;br /&gt;
优秀的数学动力系统理论包括，，，和。--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|存疑]]）。&lt;br /&gt;
&lt;br /&gt;
== Concepts 概念==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Dynamical systems 动力系统===&lt;br /&gt;
&lt;br /&gt;
{{main|Dynamical system (definition)}}&lt;br /&gt;
&lt;br /&gt;
The [[dynamical system]] concept is a mathematical [[formal system|formalization]] for any fixed &amp;quot;rule&amp;quot; that describes the [[time]] dependence of a point's position in its [[ambient space]].  Examples include the [[mathematical model]]s that describe the swinging of a clock pendulum, the flow of water in a pipe, and the number of fish each spring in a lake.&lt;br /&gt;
&lt;br /&gt;
The dynamical system concept is a mathematical formalization for any fixed &amp;quot;rule&amp;quot; that describes the time dependence of a point's position in its ambient space.  Examples include the mathematical models that describe the swinging of a clock pendulum, the flow of water in a pipe, and the number of fish each spring in a lake.&lt;br /&gt;
&lt;br /&gt;
动力系统是一个对任何描述了点的位置在周围环境随时间变化的“固定”规则的数学式。举例来说，描述钟摆摆动、管道中的水流以及每年春天湖中鱼的数量的数学模型，都属于动力系统的概念范畴。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A dynamical system has a ''state'' determined by a collection of [[real numbers]], or more generally by a [[Set (mathematics)|set]] of [[Point (geometry)|points]] in an appropriate ''state space''.  Small changes in the state of the system correspond to small changes in the numbers.  The numbers are also the coordinates of a geometrical space—a [[manifold]].   The ''evolution rule'' of the dynamical system is a [[function (mathematics)|fixed rule]] that describes what future states follow from the current state.  The rule may be [[Deterministic system (mathematics)|deterministic]] (for a given time interval only one future state follows from the current state) or [[stochastic differential equation|stochastic]] (the evolution of the state is subject to random shocks).&lt;br /&gt;
&lt;br /&gt;
A dynamical system has a state determined by a collection of real numbers, or more generally by a set of points in an appropriate state space.  Small changes in the state of the system correspond to small changes in the numbers.  The numbers are also the coordinates of a geometrical space—a manifold.   The evolution rule of the dynamical system is a fixed rule that describes what future states follow from the current state.  The rule may be deterministic (for a given time interval only one future state follows from the current state) or stochastic (the evolution of the state is subject to random shocks).&lt;br /&gt;
&lt;br /&gt;
动力系统的状态是由一组实数决定的，更广泛地说，是由适当的状态空间中的一组点决定的。系统状态的微小变化对应于数字的变化。这些数字也是几何空间——'''流形 Manifold'''——的坐标组。动力系统的演化是描述了在当前状态之后出现的未来状态的固定规则。这个规则可以是确定性的(在给定的时间间隔内，有且仅有一个未来状态在当前状态之后出现)，或随机性的(状态的演化受到随机因素的影响)。&lt;br /&gt;
&lt;br /&gt;
=== Dynamicism 动态主义===&lt;br /&gt;
&lt;br /&gt;
[[Dynamicism]], also termed the ''dynamic hypothesis'' or the ''dynamic hypothesis in cognitive science'' or ''dynamic cognition'', is a new approach in [[cognitive science]] exemplified by the work of philosopher [[Tim van Gelder]]. It argues that [[differential equations]] are more suited to modelling [[cognition]] than more traditional [[computer]] models.&lt;br /&gt;
&lt;br /&gt;
Dynamicism, also termed the dynamic hypothesis or the dynamic hypothesis in cognitive science or dynamic cognition, is a new approach in cognitive science exemplified by the work of philosopher Tim van Gelder. It argues that differential equations are more suited to modelling cognition than more traditional computer models.&lt;br /&gt;
&lt;br /&gt;
'''动态主义 Dynamicism'''，又称动态假设，或称认知科学、动态认知中的动态假设，是以哲学家Tim van Gelder的著作为代表的认知科学的一种新取向。动态主义认为微分方程比传统的计算机模型更适合于建立认知模型。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Nonlinear system 非线性系统===&lt;br /&gt;
&lt;br /&gt;
{{main|Nonlinear system}}&lt;br /&gt;
&lt;br /&gt;
In [[mathematics]], a [[nonlinear system]] is a system that is not [[linear system|linear]]—i.e., a system that does not satisfy the [[superposition principle]]. Less technically, a nonlinear system is any problem where the variable(s) to solve for cannot be written as a linear sum of independent components. A [[Homogeneity (physics)|nonhomogeneous]] system, which is linear apart from the presence of a function of the [[independent variable]]s, is nonlinear according to a strict definition, but such systems are usually studied alongside linear systems, because they can be transformed to a linear system as long as a particular solution is known.&lt;br /&gt;
&lt;br /&gt;
In mathematics, a nonlinear system is a system that is not linear—i.e., a system that does not satisfy the superposition principle. Less technically, a nonlinear system is any problem where the variable(s) to solve for cannot be written as a linear sum of independent components. A nonhomogeneous system, which is linear apart from the presence of a function of the independent variables, is nonlinear according to a strict definition, but such systems are usually studied alongside linear systems, because they can be transformed to a linear system as long as a particular solution is known.&lt;br /&gt;
&lt;br /&gt;
在数学中，'''非线性系统 Nonlinear System'''是指系统不是线性的——也就是说，一个不满足叠加原理的系统。更通俗地说，非线性系统是待求解变量不能被写成其独立分量的线性和的系统。非齐次系统根据定义严格来说是非线性的，除了它的自变量包含函数以外其他部分都是线性的。但非齐次系统通常与线性系统一起研究，因为只要知道特解，它们就可以转化为线性系统。&lt;br /&gt;
&lt;br /&gt;
== Related fields 相关领域==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Arithmetic dynamics 算术动态系统===&lt;br /&gt;
&lt;br /&gt;
:[[Arithmetic dynamics]] is a field that emerged in the 1990s that amalgamates two areas of mathematics, [[dynamical systems]] and [[number theory]]. Classically, discrete dynamics refers to the study of the [[Iterated function|iteration]] of self-maps of the [[complex plane]] or [[real line]]. Arithmetic dynamics is the study of the number-theoretic properties of integer, rational, {{math|&amp;lt;var&amp;gt;p&amp;lt;/var&amp;gt;}}-adic, and/or algebraic points under repeated application of a [[polynomial]] or [[rational function]].&lt;br /&gt;
&lt;br /&gt;
Arithmetic dynamics is a field that emerged in the 1990s that amalgamates two areas of mathematics, dynamical systems and number theory. Classically, discrete dynamics refers to the study of the iteration of self-maps of the complex plane or real line. Arithmetic dynamics is the study of the number-theoretic properties of integer, rational, -adic, and/or algebraic points under repeated application of a polynomial or rational function.&lt;br /&gt;
&lt;br /&gt;
'''算术动态系统 Arithmetic Dynamics'''是20世纪90年代出现的一个领域，融合了动力系统和数论这两个数学领域。经典的离散动力学研究复平面或实直线的自映射的迭代。算术动态系统研究内容是在多项式或有理函数中的整数、有理数、并元 --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|存疑]]） 和/或代数点的数论性质。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Chaos theory 混沌理论===&lt;br /&gt;
&lt;br /&gt;
:[[Chaos theory]] describes the behavior of certain [[dynamical system (definition)|dynamical system]]s – that is, systems whose state evolves with time – that may exhibit dynamics that are highly sensitive to initial conditions (popularly referred to as the [[butterfly effect]]). As a result of this sensitivity, which manifests itself as an exponential growth of perturbations in the initial conditions, the behavior of chaotic systems appears [[randomness|random]]. This happens even though these systems are [[deterministic system (philosophy)|deterministic]], meaning that their future dynamics are fully defined by their initial conditions, with no random elements involved. This behavior is known as deterministic chaos, or simply ''chaos''.&lt;br /&gt;
&lt;br /&gt;
Chaos theory describes the behavior of certain dynamical systems – that is, systems whose state evolves with time – that may exhibit dynamics that are highly sensitive to initial conditions (popularly referred to as the butterfly effect). As a result of this sensitivity, which manifests itself as an exponential growth of perturbations in the initial conditions, the behavior of chaotic systems appears random. This happens even though these systems are deterministic, meaning that their future dynamics are fully defined by their initial conditions, with no random elements involved. This behavior is known as deterministic chaos, or simply chaos.&lt;br /&gt;
&lt;br /&gt;
混沌理论描述了某些状态随时间演化的动力系统的行为，这些系统可能表现出对初始条件高度敏感的特点（通常被称为'''蝴蝶效应 Butterfly Effect'''）。由于扰动受初始条件影响而指数增长，因此混沌系统具有敏感性，敏感性使它的行为看起来是随机的。但是这种敏感性也会出现在确定的动力系统中，即未来的动力学完全由它的初始条件定义，没有任何随机因素参与的系统中。这种现象被称为确定性混沌，或简单混沌。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Complex systems 复杂系统===&lt;br /&gt;
&lt;br /&gt;
:[[Complex systems]] is a scientific field that studies the common properties of [[system]]s considered [[Complexity|complex]] in [[nature]], [[society]], and [[science]]. It is also called ''complex systems theory'', ''complexity science'', ''study of complex systems'' and/or ''sciences of complexity''. The key problems of such systems are  difficulties with their formal [[Scientific modelling|modeling]] and [[simulation]]. From such perspective, in different research contexts complex systems are defined on the base of their different attributes.&lt;br /&gt;
&lt;br /&gt;
Complex systems is a scientific field that studies the common properties of systems considered complex in nature, society, and science. It is also called complex systems theory, complexity science, study of complex systems and/or sciences of complexity. The key problems of such systems are  difficulties with their formal modeling and simulation. From such perspective, in different research contexts complex systems are defined on the base of their different attributes.&lt;br /&gt;
&lt;br /&gt;
'''复杂系统 Complex Systems'''是研究自然、社会和科学中复杂现象的共同性质的科学领域。它也被称为复杂系统理论、复杂性科学、复杂系统研究和关于复杂性的科学。这些系统的关键问题在于对系统的形式化建模与仿真。因此，复杂系统是根据在不同的研究语境中的不同属性来定义的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
:The study of complex systems is bringing new vitality to many areas of science where a more typical [[reductionist]] strategy has fallen short. ''Complex systems'' is therefore often used as a broad term encompassing a research approach to problems in many diverse disciplines including [[neurosciences]], [[social sciences]], [[meteorology]], [[chemistry]], [[physics]], [[computer science]], [[psychology]], [[artificial life]], [[evolutionary computation]], [[economics]], earthquake prediction, [[molecular biology]] and inquiries into the nature of living [[cell (biology)|cell]]s themselves.&lt;br /&gt;
&lt;br /&gt;
The study of complex systems is bringing new vitality to many areas of science where a more typical reductionist strategy has fallen short. Complex systems is therefore often used as a broad term encompassing a research approach to problems in many diverse disciplines including neurosciences, social sciences, meteorology, chemistry, physics, computer science, psychology, artificial life, evolutionary computation, economics, earthquake prediction, molecular biology and inquiries into the nature of living cells themselves.&lt;br /&gt;
&lt;br /&gt;
还原论策略已经不足以研究许多科学领域的问题，而复杂系统的研究则为科学带来了广泛的新活力。复杂系统通常被用作一个应用广泛的研究方法术语，并涵盖许多不同的学科，包括神经科学、社会科学、气象学、化学、物理学、计算机科学、心理学、人工生命、进化计算、经济学、地震预测、分子生物学以及对活细胞的研究等。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Control theory 控制理论===&lt;br /&gt;
&lt;br /&gt;
:[[Control theory]] is an interdisciplinary branch of [[engineering]] and [[mathematics]], in part it deals with influencing the behavior of [[dynamical system]]s.&lt;br /&gt;
&lt;br /&gt;
Control theory is an interdisciplinary branch of engineering and mathematics, in part it deals with influencing the behavior of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
'''控制理论 Control Theory'''是工程和数学的一个交叉学科，它的其中一部分研究影响动力系统行为的各种因素。&lt;br /&gt;
&lt;br /&gt;
控制理论是一个研究如何调整动态系统特性的理论，它也是工程和数学的一个交叉学科，逐渐的应用在许多社会科学中，例如心理学、社会学（社会学中的控制理论）、犯罪学及'''金融系统 Financial System'''。控制理论一般的目的是借由控制器的动作让系统稳定，也就是系统维持在设定值，而且不会在设定值附近晃动。设定值一般维持不变的控制称为调节，设定值快速变化，要求跟踪速度加速度等的控制称为伺服。它的其中一部分研究影响动力系统行为的各种因素。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Ergodic theory 遍历理论===&lt;br /&gt;
&lt;br /&gt;
:[[Ergodic theory]] is a branch of [[mathematics]] that studies [[dynamical system]]s with an [[invariant measure]] and related problems. Its initial development was motivated by problems of [[statistical physics]].&lt;br /&gt;
&lt;br /&gt;
Ergodic theory is a branch of mathematics that studies dynamical systems with an invariant measure and related problems. Its initial development was motivated by problems of statistical physics.&lt;br /&gt;
&lt;br /&gt;
'''遍历理论 Ergodic Theory'''是数学的一个分支，研究有不变测度相关问题的动力系统。它最初的发展受到了统计物理学的推动。&lt;br /&gt;
遍历理论是研究保测变换的渐近性态的数学分支。它起源于为统计力学提供基础的&amp;quot;遍历假设&amp;quot;研究，并与动力系统理论、概率论、信息论、泛函分析、数论等数学分支有着密切的联系。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Functional analysis 泛函分析===&lt;br /&gt;
&lt;br /&gt;
:[[Functional analysis]] is the branch of [[mathematics]], and specifically of [[mathematical analysis|analysis]], concerned with the study of [[vector space]]s and [[operator (mathematics)|operator]]s acting upon them. It has its historical roots in the study of [[functional space]]s, in particular transformations of [[function (mathematics)|functions]], such as the [[Fourier transform]], as well as in the study of [[differential equations|differential]] and [[integral equations]]. This usage of the word ''[[functional (mathematics)|functional]]'' goes back to the [[calculus of variations]], implying a function whose argument is a function. Its use in general has been attributed to mathematician and physicist [[Vito Volterra]] and its founding is largely attributed to mathematician [[Stefan Banach]].&lt;br /&gt;
&lt;br /&gt;
Functional analysis is the branch of mathematics, and specifically of analysis, concerned with the study of vector spaces and operators acting upon them. It has its historical roots in the study of functional spaces, in particular transformations of functions, such as the Fourier transform, as well as in the study of differential and integral equations. This usage of the word functional goes back to the calculus of variations, implying a function whose argument is a function. Its use in general has been attributed to mathematician and physicist Vito Volterra and its founding is largely attributed to mathematician Stefan Banach.&lt;br /&gt;
&lt;br /&gt;
'''泛函分析 Functional analysis'''是数学分析的一个分支，研究向量空间和作用于向量空间的算子。它源于对函数空间的研究，特别是对函数变换的研究，例如傅里叶变换，微积分方程的研究等。泛函分析的名称“Functional Analysis”中，“functional”这个词的用法可以追溯到变分法，也就是说函数的参数是一个函数。这个词的使用一般被认为归功于数学家和物理学家Vito Volterra，和数学家Stefan Banach。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Graph dynamical systems 图动力系统===&lt;br /&gt;
&lt;br /&gt;
:The concept of [[graph dynamical system]]s (GDS) can be used to capture a wide range of processes taking place on graphs or networks. A major theme in the mathematical and computational analysis of graph dynamical systems is to relate their structural properties (e.g. the network connectivity) and the global dynamics that result.&lt;br /&gt;
&lt;br /&gt;
The concept of graph dynamical systems (GDS) can be used to capture a wide range of processes taking place on graphs or networks. A major theme in the mathematical and computational analysis of graph dynamical systems is to relate their structural properties (e.g. the network connectivity) and the global dynamics that result.&lt;br /&gt;
&lt;br /&gt;
'''图动力系统 Graph dynamical systems (GDS)'''可以用来描绘图或网络上发生的各种过程。图动力系统的数学和计算分析的一个主要主题是关联它们的结构性质(例如:网络连接)和结构性质造成的网络整体的动态结果。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Projected dynamical systems 投影动力系统===&lt;br /&gt;
&lt;br /&gt;
:[[Projected dynamical systems]] it is a [[mathematics|mathematical]] theory investigating the behaviour of [[dynamical system]]s where solutions are restricted to a constraint set. The discipline shares connections to and applications with both the static world of [[Optimization (mathematics)|optimization]] and [[Equilibrium point|equilibrium]] problems and the dynamical world of [[ordinary differential equations]]. A projected dynamical system is given by the [[flow (mathematics)|flow]] to the projected differential equation.&lt;br /&gt;
&lt;br /&gt;
Projected dynamical systems it is a mathematical theory investigating the behaviour of dynamical systems where solutions are restricted to a constraint set. The discipline shares connections to and applications with both the static world of optimization and equilibrium problems and the dynamical world of ordinary differential equations. A projected dynamical system is given by the flow to the projected differential equation.&lt;br /&gt;
&lt;br /&gt;
'''投影动力系统 Projected Dynamical Systems'''是研究解在一个约束集内的动力系统行为的数学理论。这门学科与静态世界中的最优化和平衡问题以及动态世界中的常微分方程都有联系，并且都有相互联系的应用。一个投影动力系统是由投影微分方程的'''流形 flow'''给定的。&lt;br /&gt;
通过对投影微分方程的流分析，给出了一个投影动力系统的表达式：&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\frac{dx(t)}{dt} = \Pi_K(x(t),-F(x(t)))&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中K为约束集。这种形式的微分方程因具有不连续的向量场而值得注意。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Symbolic dynamics 符号动力学===&lt;br /&gt;
&lt;br /&gt;
:[[Symbolic dynamics]] is the practice of modelling a topological or smooth [[dynamical system]] by a discrete space consisting of infinite [[sequence]]s of abstract symbols, each of which corresponds to a state of the system, with the dynamics (evolution) given by the [[shift operator]].&lt;br /&gt;
&lt;br /&gt;
Symbolic dynamics is the practice of modelling a topological or smooth dynamical system by a discrete space consisting of infinite sequences of abstract symbols, each of which corresponds to a state of the system, with the dynamics (evolution) given by the shift operator.&lt;br /&gt;
&lt;br /&gt;
'''符号动力学 Symbolic Dynamics'''是通过一个由抽象符号的无限序列组成的离散空间建立一个拓扑或光滑动力系统的方法。每一个抽象符号的无限序列序列对应于系统的一个状态，并由移位算子给出动力学(演化)。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== System dynamics 系统动力学===&lt;br /&gt;
&lt;br /&gt;
:[[System dynamics]] is an approach to understanding the behaviour of systems over time.  It deals with internal feedback loops and time delays that affect the behaviour and state of the entire system.&amp;lt;ref name=&amp;quot;sysdyn&amp;quot;&amp;gt;[http://sysdyn.clexchange.org MIT System Dynamics in Education Project (SDEP)&amp;lt;!-- Bot generated title --&amp;gt;] {{webarchive|url=https://web.archive.org/web/20080509163801/http://sysdyn.clexchange.org/ |date=2008-05-09 }}&amp;lt;/ref&amp;gt;  What makes using system dynamics different from other approaches to studying systems is the use of [[feedback]] loops and [[Stock and flow|stocks and flows]].  These elements help describe how even seemingly simple systems display baffling [[nonlinearity]].&lt;br /&gt;
&lt;br /&gt;
System dynamics is an approach to understanding the behaviour of systems over time.  It deals with internal feedback loops and time delays that affect the behaviour and state of the entire system.  What makes using system dynamics different from other approaches to studying systems is the use of feedback loops and stocks and flows.  These elements help describe how even seemingly simple systems display baffling nonlinearity.&lt;br /&gt;
&lt;br /&gt;
'''系统动力学 System Dynamics'''是一种理解系统随时间变化行为的方法。它是用来处理影响整个系统行为和状态的内部反馈回路和时间延迟的方法。系统动力学不同于其他系统研究方法的地方在于它使用了反馈环、股票（stocks）和流形（flows）--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|如何翻译stocks 和 folows]]）的元素。这些元素有助于描述看似简单的系统如何显示复杂的非线性行为。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Topological dynamics 拓扑动力学===&lt;br /&gt;
&lt;br /&gt;
:[[Topological dynamics]] is a branch of the theory of dynamical systems in which qualitative, asymptotic properties of dynamical systems are studied from the viewpoint of [[general topology]].&lt;br /&gt;
&lt;br /&gt;
Topological dynamics is a branch of the theory of dynamical systems in which qualitative, asymptotic properties of dynamical systems are studied from the viewpoint of general topology.&lt;br /&gt;
&lt;br /&gt;
'''拓扑动力学 Topological Dynamics'''是动力系统理论的一个分支。在拓朴动力学中，动力系统的定性性质和渐近性质是从一般拓扑学的观点来研究的。&lt;br /&gt;
&lt;br /&gt;
== Applications 应用==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== In human development 在人类发展中的应用===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In [[Developmental psychology|human development]], dynamical systems theory has been used to enhance and simplify Erik Erikson's [[eight stages of psychosocial development]] and offers a standard method of examining the universal pattern of human development. This method is based on the self-organizing and [[fractal]] properties of the [[Fibonacci sequence]].&amp;lt;ref name=Sacco&amp;gt;{{cite journal|last=Sacco|first=R.G.|title=Re-envisaging the eight developmental stages of Erik Erikson: The Fibonacci Life-Chart Method (FLCM)|journal=Journal of Educational and Developmental Psychology|date=2013|volume=3|issue=1|pages=140–146|doi=10.5539/jedp.v3n1p140|doi-access=free}}&amp;lt;/ref&amp;gt; Using mathematical modeling, a natural progression of human development with eight life stages has been identified:  early infancy (0–2 years), toddler (2–4 years), early childhood (4–7 years), middle childhood (7–11 years), adolescence (11–18 years), young adulthood (18–29 years), middle adulthood (29–48 years), and older adulthood (48–78+ years).&amp;lt;ref name=Sacco/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In human development, dynamical systems theory has been used to enhance and simplify Erik Erikson's eight stages of psychosocial development and offers a standard method of examining the universal pattern of human development. This method is based on the self-organizing and fractal properties of the Fibonacci sequence. Using mathematical modeling, a natural progression of human development with eight life stages has been identified:  early infancy (0–2 years), toddler (2–4 years), early childhood (4–7 years), middle childhood (7–11 years), adolescence (11–18 years), young adulthood (18–29 years), middle adulthood (29–48 years), and older adulthood (48–78+ years).&lt;br /&gt;
&lt;br /&gt;
在人类发展方面，动力系统理论已经被用来增强和简化 Erik Erikson 的'''社会心理发展8阶段理论 Eight Stages of Psychosocial Development'''，并提供了一个检验人类发展普遍模式的标准方法。该方法基于斐波那契数列的'''自组织性 self-organizing'''和'''分形 Fractal''' 特性。利用数学模型，人类发展的自然进程被分为8个生命阶段: 早期婴儿期(0-2岁)、幼儿期(2-4岁)、童年早期(4-7岁)、童年中期(7-11岁)、青春期(11-18岁)、成年早期(18-29岁)、成年中期(29-48岁)和老年成年期(48-78岁及以上)。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
According to this model, stage transitions between age intervals represent self-organization processes at multiple levels (e.g., molecules, genes, cell, organ, organ system, organism, behavior, and environment). For example, at the stage transition from [[adolescence]] to [[young adulthood]], and after reaching the critical point of 18 years of age (young adulthood), a peak in [[testosterone]] is observed in males&amp;lt;ref&amp;gt;{{cite journal |last1=Kelsey |first1=T. W. |title=A validated age-related normative model for male total testosterone shows increasing variance but no decline after age 40 years. |journal=PLOS One |volume=9 |issue=10 |pages=e109346 |doi=10.1371/journal.pone.0109346|pmid=25295520 |year=2014 |pmc=4190174 |bibcode=2014PLoSO...9j9346K }}&amp;lt;/ref&amp;gt; and the period of optimal [[fertility]] begins in females.&amp;lt;ref&amp;gt;{{cite book |last1=Tulandi |first1=T. |title=Preservation of fertility |date=2004 |publisher=Taylor &amp;amp; Francis |pages=1–20}}&amp;lt;/ref&amp;gt; Similarly, at age 30 optimal fertility begins to decline in females,&amp;lt;ref name=&amp;quot;Social Science 2008&amp;quot;&amp;gt;{{cite journal |last1=Blanchflower |first1=D. G. |title=Is well-being U-shaped over the life cycle? |journal=Social Science &amp;amp; Medicine |volume=66 |issue=8 |pages=1733–1749 |doi=10.1016/j.socscimed.2008.01.030|pmid=18316146 |year=2008 |citeseerx=10.1.1.63.5221 }}&amp;lt;/ref&amp;gt; and at the stage transition from [[middle adulthood]] to older adulthood at 48 years, the average age of onset of [[menopause]] occurs.&amp;lt;ref name=&amp;quot;Social Science 2008&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
According to this model, stage transitions between age intervals represent self-organization processes at multiple levels (e.g., molecules, genes, cell, organ, organ system, organism, behavior, and environment). For example, at the stage transition from adolescence to young adulthood, and after reaching the critical point of 18 years of age (young adulthood), a peak in testosterone is observed in males and the period of optimal fertility begins in females. Similarly, at age 30 optimal fertility begins to decline in females, and at the stage transition from middle adulthood to older adulthood at 48 years, the average age of onset of menopause occurs.&lt;br /&gt;
&lt;br /&gt;
根据这个模型，年龄的阶段转换代表了多层次的自组织过程(例如，分子、基因、细胞、器官、器官系统、生物体、行为和环境)。例如，在从青春期向成年早期过渡的阶段中，在达到18岁这一关键年龄之后，男性的睾丸激素达到高峰，女性的最佳生育期开始。同样，在30岁时，女性的最佳生育能力开始下降；在从成年中期过渡到老年成年期时，48岁是绝经的平均年龄。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
These events are physical bioattractors of aging from the perspective of Fibonacci mathematical modeling and dynamically systems theory. In practical terms, prediction in human development becomes possible in the same statistical sense in which the average temperature or precipitation at different times of the year can be used for [[weather forecasting]]. Each of the predetermined stages of human development follows an optimal epigenetic biological pattern. This phenomenon can be explained by the occurrence of Fibonacci numbers in biological [[DNA]]&amp;lt;ref&amp;gt;{{cite journal |last1=Perez |first1=J. C. (2010). |title=Codon populations in single-stranded whole human genome DNA are fractal and fine-tuned by the Golden Ratio 1.618. |journal=Interdisciplinary Sciences: Computational Life Sciences |volume=2 |issue=3 |pages=228–240 |doi=10.1007/s12539-010-0022-0|pmid=20658335 |year=2010 }}&amp;lt;/ref&amp;gt; and self-organizing properties of the Fibonacci numbers that converge on the [[golden ratio]].&lt;br /&gt;
&lt;br /&gt;
These events are physical bioattractors of aging from the perspective of Fibonacci mathematical modeling and dynamically systems theory. In practical terms, prediction in human development becomes possible in the same statistical sense in which the average temperature or precipitation at different times of the year can be used for weather forecasting. Each of the predetermined stages of human development follows an optimal epigenetic biological pattern. This phenomenon can be explained by the occurrence of Fibonacci numbers in biological DNA and self-organizing properties of the Fibonacci numbers that converge on the golden ratio.&lt;br /&gt;
&lt;br /&gt;
从斐波那契数学模型和动力系统理论的角度来看，上述事件是衰老的'''物理生物吸引子Physical Bioattractors'''。实际上，正如一年中不同时间的平均气温和降水量可以用来预测天气，预测人类的发展在统计意义上同样是可能的。人类发展的每个'''预定阶段Predetermined Stages'''都遵循最佳的'''表观遗传生物模式 Epigenetic Biological Pattern'''。这种现象可以用 DNA 中的斐波那契数和收敛于黄金分割比的斐波那契数的自组织特性来解释。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== In biomechanics 在运动生物力学中的应用===&lt;br /&gt;
&lt;br /&gt;
In [[sports biomechanics]], dynamical systems theory has emerged in the movement sciences as a viable framework for modeling athletic performance. From a dynamical systems perspective, the human movement system is a highly intricate network of co-dependent sub-systems (e.g. respiratory, circulatory, nervous, skeletomuscular, perceptual) that are composed of a large number of interacting components (e.g. blood cells, oxygen molecules, muscle tissue, metabolic enzymes, connective tissue and bone). In dynamical systems theory, movement patterns emerge through generic processes of self-organization found in physical and biological systems.&amp;lt;ref&amp;gt;Paul S Glazier, Keith Davids, Roger M Bartlett (2003). [http://www.sportsci.org/jour/03/psg.htm &amp;quot;DYNAMICAL SYSTEMS THEORY: a Relevant Framework for Performance-Oriented Sports Biomechanics Research&amp;quot;]. in: Sportscience 7. Accessed 2008-05-08.&amp;lt;/ref&amp;gt; There is no research validation of any of the claims associated to the conceptual application of this framework.&lt;br /&gt;
&lt;br /&gt;
In sports biomechanics, dynamical systems theory has emerged in the movement sciences as a viable framework for modeling athletic performance. From a dynamical systems perspective, the human movement system is a highly intricate network of co-dependent sub-systems (e.g. respiratory, circulatory, nervous, skeletomuscular, perceptual) that are composed of a large number of interacting components (e.g. blood cells, oxygen molecules, muscle tissue, metabolic enzymes, connective tissue and bone). In dynamical systems theory, movement patterns emerge through generic processes of self-organization found in physical and biological systems. There is no research validation of any of the claims associated to the conceptual application of this framework.&lt;br /&gt;
&lt;br /&gt;
在运动生物力学中，动力系统理论新兴地成为对运动表现建模的可行框架。从动力系统的角度来看，人类的运动系统是由高度复杂和相互依赖的子系统网络（如呼吸、循环、神经、骨骼肌系统和知觉系统等）组成的，它们由大量相互作用的部分组成（包括血细胞、氧分子、肌肉组织、代谢酶、结缔组织和骨骼等)。动力系统理论中，运动模式通过物理系统和生物系统中的一般自组织过程出现。没有任何研究证实与这一框架的概念相关的任何主张。&lt;br /&gt;
&lt;br /&gt;
=== In cognitive science 在认知科学中的应用===&lt;br /&gt;
&lt;br /&gt;
Dynamical system theory has been applied in the field of [[neurodynamics|neuroscience]] and [[cognitive science|cognitive development]], especially in [[the neo-Piagetian theories of cognitive development]]. It is the belief that cognitive development is best represented by physical theories rather than theories based on syntax and [[AI]]. It also believed that differential equations are the most appropriate tool for modeling human behavior. These equations are interpreted to represent an agent's cognitive trajectory through [[state space]]. In other words, dynamicists argue that [[psychology]] should be (or is) the description (via differential equations) of the cognitions and behaviors of an agent under certain environmental and internal pressures. The language of chaos theory is also frequently adopted.&lt;br /&gt;
&lt;br /&gt;
Dynamical system theory has been applied in the field of neuroscience and cognitive development, especially in the neo-Piagetian theories of cognitive development. It is the belief that cognitive development is best represented by physical theories rather than theories based on syntax and AI. It also believed that differential equations are the most appropriate tool for modeling human behavior. These equations are interpreted to represent an agent's cognitive trajectory through state space. In other words, dynamicists argue that psychology should be (or is) the description (via differential equations) of the cognitions and behaviors of an agent under certain environmental and internal pressures. The language of chaos theory is also frequently adopted.&lt;br /&gt;
&lt;br /&gt;
动力系统理论已经被应用于神经科学和认知发展领域，特别是在认知发展的'''新皮亚杰学派 neo-Piagetian'''中。人们相信，物理学理论比句法学理论和人工智能理论更能代表认知发展。人们还相信微分方程是人类行为建模最合适的工具。人们认为微分方程可以解释为通过状态空间代表一个主体的认知轨迹的算式。换句话说，动力学家认为心理学应该(或者是)(通过微分方程)描述在一定的环境和内部压力下的主体的认知和行为的学科。混沌理论在相关领域也经常被采用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In it, the learner's mind reaches a state of disequilibrium where old patterns have broken down. This is the phase transition of cognitive development. [[Self-organization]] (the spontaneous creation of coherent forms) sets in as activity levels link to each other. Newly formed macroscopic and microscopic structures support each other, speeding up the process. These links form the structure of a new state of order in the mind through a process called ''scalloping'' (the repeated building up and collapsing of complex performance.) This new, novel state is progressive, discrete, idiosyncratic and unpredictable.&amp;lt;ref&amp;gt;{{cite journal|title=The Promise of Dynamic Systems Approaches for an Integrated Account of Human Development|journal=Child Development|date=2000-02-25|first=Mark D.|last=Lewis|volume=71|issue=1|pages=36–43|id= |url=http://home.oise.utoronto.ca/~mlewis/Manuscripts/Promise.pdf|accessdate=2008-04-04|doi=10.1111/1467-8624.00116|pmid=10836556 |citeseerx=10.1.1.72.3668}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In it, the learner's mind reaches a state of disequilibrium where old patterns have broken down. This is the phase transition of cognitive development. Self-organization (the spontaneous creation of coherent forms) sets in as activity levels link to each other. Newly formed macroscopic and microscopic structures support each other, speeding up the process. These links form the structure of a new state of order in the mind through a process called scalloping (the repeated building up and collapsing of complex performance.) This new, novel state is progressive, discrete, idiosyncratic and unpredictable.&lt;br /&gt;
&lt;br /&gt;
在学习的过程中，旧的模式被打破了，学习者的思维达到了一种不平衡的状态。这是认知发展的阶段性转变。自组织(连贯的自发创造(the spontaneous creation of coherent forms))在'''活动水平 Activity Levels'''相互联系时产生。新形成的宏观和微观结构相互支持，加速了这一过程。这些联系在头脑中形成了一种具有新状态的结构，这个过程被称为“扇贝化 Scalloping”，也就是头脑的复杂性能的不断累积和崩溃的过程 --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|扇贝化的翻译拿不准，这句话的描述比较抽象]]）。这种新的状态是渐进的、离散的、异质的的和不可预知的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Dynamic systems theory has recently been used to explain a long-unanswered problem in child development referred to as the [[A-not-B error]].&amp;lt;ref&amp;gt;{{cite journal|title=Development as a dynamic system|journal=Trends in Cognitive Sciences|date=2003-07-30|first=Linda B.|last=Smith|author2=Esther Thelen|volume=7|issue=8|pages=343–8|id= |url=http://www.indiana.edu/~cogdev/labwork/dynamicsystem.pdf|accessdate=2008-04-04|doi=10.1016/S1364-6613(03)00156-6|pmid=12907229|citeseerx=10.1.1.294.2037}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Dynamic systems theory has recently been used to explain a long-unanswered problem in child development referred to as the A-not-B error.&lt;br /&gt;
&lt;br /&gt;
动力系统理论最近还被用来解释儿童发展中一个长期没有答案的问题，即 A-not-B 错误。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===In second language development 在二语习得中的应用===&lt;br /&gt;
&lt;br /&gt;
{{Main|Dynamic approach to second language development}}&lt;br /&gt;
&lt;br /&gt;
The application of Dynamic Systems Theory to study [[second language acquisition]] is attributed to [[Diane Larsen-Freeman]] who published an article in 1997 in which she claimed that [[second language acquisition]] should be viewed as a developmental process which includes [[language attrition]] as well as language acquisition.&amp;lt;ref&amp;gt;{{cite web|url=https://academic.oup.com/applij/article-abstract/18/2/141/134192|title=Chaos/Complexity Science and Second Language Acquisition|date=1997|publisher=Applied Linguistics}}&amp;lt;/ref&amp;gt; In her article she claimed that language should be viewed as a dynamic system which is dynamic, complex, nonlinear, chaotic, unpredictable, sensitive to initial conditions, open, self-organizing, feedback sensitive, and adaptive.&lt;br /&gt;
&lt;br /&gt;
The application of Dynamic Systems Theory to study second language acquisition is attributed to Diane Larsen-Freeman who published an article in 1997 in which she claimed that second language acquisition should be viewed as a developmental process which includes language attrition as well as language acquisition. In her article she claimed that language should be viewed as a dynamic system which is dynamic, complex, nonlinear, chaotic, unpredictable, sensitive to initial conditions, open, self-organizing, feedback sensitive, and adaptive.&lt;br /&gt;
&lt;br /&gt;
动力系统理论在二语习得研究中的应用归功于 Diane Larsen-Freeman，她在1997年发表的一篇文章中认为，二语习得应该被看作是一个包括语言流失和习得在内的发展过程。她在文章中认为，语言应该被看作是一个动态的、复杂的、非线性的、混沌的、不可预知的、对初始条件敏感的、开放的、自组织的、反馈敏感的和适应性的动力系统。&lt;br /&gt;
&lt;br /&gt;
== See also 参见==&lt;br /&gt;
&lt;br /&gt;
;Related subjects&lt;br /&gt;
&lt;br /&gt;
Related subjects&lt;br /&gt;
&lt;br /&gt;
相关科目&lt;br /&gt;
&lt;br /&gt;
{{div col|colwidth=20em}}&lt;br /&gt;
&lt;br /&gt;
* [[List of dynamical system topics]] 动力系统主题清单&lt;br /&gt;
&lt;br /&gt;
* [[Baker's map]]&lt;br /&gt;
&lt;br /&gt;
* [[Biological applications of bifurcation theory]] 分支理论的生物学应用&lt;br /&gt;
&lt;br /&gt;
* [[Dynamical system (definition)]] 动力系统（定义）&lt;br /&gt;
&lt;br /&gt;
* [[Embodied Embedded Cognition]] 具身认知&lt;br /&gt;
&lt;br /&gt;
* [[Fibonacci numbers]] 斐波那契数&lt;br /&gt;
&lt;br /&gt;
* [[Fractals]] 分形&lt;br /&gt;
&lt;br /&gt;
* [[Gingerbreadman map]]&lt;br /&gt;
&lt;br /&gt;
* [[Halo orbit]] Halo 轨道&lt;br /&gt;
&lt;br /&gt;
* [[List of types of systems theory]] 动力系统类型清单&lt;br /&gt;
&lt;br /&gt;
* [[Oscillation]] 振动性&lt;br /&gt;
&lt;br /&gt;
* [[Postcognitivism]]&lt;br /&gt;
&lt;br /&gt;
* [[Recurrent neural network]] 递归神经网络&lt;br /&gt;
&lt;br /&gt;
* [[Combinatorics and dynamical systems]] 组合数学和动力系统&lt;br /&gt;
&lt;br /&gt;
* [[Synergetics (Haken)|Synergetics]] 协同学(Haken)&lt;br /&gt;
&lt;br /&gt;
* [[Systemography]]&lt;br /&gt;
&lt;br /&gt;
{{div col end}}&lt;br /&gt;
&lt;br /&gt;
;Related scientists&lt;br /&gt;
&lt;br /&gt;
Related scientists&lt;br /&gt;
&lt;br /&gt;
相关科学家&lt;br /&gt;
&lt;br /&gt;
{{div col|colwidth=20em}}&lt;br /&gt;
&lt;br /&gt;
* [[People in systems and control]]&lt;br /&gt;
&lt;br /&gt;
* [[Dmitri Anosov]]&lt;br /&gt;
&lt;br /&gt;
* [[Vladimir Arnold]]&lt;br /&gt;
&lt;br /&gt;
* [[Nikolay Bogolyubov]]&lt;br /&gt;
&lt;br /&gt;
* [[Andrey Kolmogorov]]&lt;br /&gt;
&lt;br /&gt;
* [[Nikolay Mitrofanovich Krylov|Nikolay Krylov]]&lt;br /&gt;
&lt;br /&gt;
* [[Jürgen Moser]]&lt;br /&gt;
&lt;br /&gt;
* [[Yakov G. Sinai]]&lt;br /&gt;
&lt;br /&gt;
* [[Stephen Smale]]&lt;br /&gt;
&lt;br /&gt;
* [[Hillel Furstenberg]]&lt;br /&gt;
&lt;br /&gt;
* [[Grigory Margulis]]&lt;br /&gt;
&lt;br /&gt;
* [[Elon Lindenstrauss]]&lt;br /&gt;
&lt;br /&gt;
{{div col end}}&lt;br /&gt;
&lt;br /&gt;
== Notes 参考资料==&lt;br /&gt;
&lt;br /&gt;
{{reflist}}&lt;br /&gt;
&lt;br /&gt;
== Further reading 拓展阅读==&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Frederick D. |last1=Abraham |first2=Ralph |last2=Abraham |authorlink2=Ralph Abraham (mathematician)|first3=Christopher D. |last3=Shaw |title=A Visual Introduction to Dynamical Systems Theory for Psychology |url=https://books.google.com/books?id=oMbaAAAAMAAJ |year=1990 |publisher=Aerial Press |isbn=978-0-942344-09-7 |oclc=24345312}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=Edward J. |last=Beltrami |title=Mathematics for Dynamic Modeling |url=https://books.google.com/books?id=MmoiJPsuFW8C |year=1998 |publisher=Academic Press |isbn=978-0-12-085566-7 |edition=2nd |oclc=36713294}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=Otomar |last=Hájek |title=Dynamical systems in the plane |url=https://books.google.com/books?id=czhPAQAAIAAJ |year=1968 |publisher=Academic Press |oclc=343328 |authorlink=Otomar Hájek |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=David G. |last=Luenberger |title=Introduction to dynamic systems: theory, models, and applications |url=https://books.google.com/books?id=mvlQAAAAMAAJ |year=1979 |publisher=Wiley |isbn=978-0-471-02594-8 |oclc=4195122 |authorlink=David Luenberger |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Anthony |last1=Michel |author2=Kaining Wang |author3=Bo Hu |title=Qualitative Theory of Dynamical Systems |url=https://books.google.com/books?id=ZPGBnZGV2_cC |year=2001 |publisher=Taylor &amp;amp; Francis |isbn=978-0-8247-0526-8 |oclc=45873628}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Louis |last1=Padulo |first2=Michael A. |last2=Arbib |authorlink2=Michael A. Arbib |title=System theory: a unified state-space approach to continuous and discrete systems |url=https://books.google.com/books?id=6UPvAAAAMAAJ |year=1974 |publisher=Saunders |isbn=9780721670355 |oclc=947600 |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |first=Steven H. |last=Strogatz |title=Nonlinear Dynamics and Chaos: With Applications to Physics, Biology, Chemistry, and Engineering |year=1994 |publisher=Addison Wesley |isbn=978-0-7382-0453-6 |oclc=49839504 |authorlink=Steven Strogatz |ref=harv |url-access=registration |url=https://archive.org/details/nonlineardynamic00stro }}&lt;br /&gt;
&lt;br /&gt;
== External links 外部链接==&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20080613053119/http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html Dynamic Systems 动力系统] Encyclopedia of Cognitive Science entry. --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|这是一个嵌套的链接，但好像只能鼠标点击并超链接到内嵌的那个]]）认知科学百科全书&lt;br /&gt;
&lt;br /&gt;
*[http://mathworld.wolfram.com/DynamicalSystem.html Definition of dynamical system 动力系统的定义] in MathWorld. 在MathWorld.wolfram.com储存的定义&lt;br /&gt;
&lt;br /&gt;
*[http://www.dynamicalsystems.org/ DSWeb] Dynamical Systems Magazine 动力系统杂志&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Areas of mathematics | state=collapsed}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:Dynamical systems]]&lt;br /&gt;
&lt;br /&gt;
Category:Dynamical systems&lt;br /&gt;
&lt;br /&gt;
类别: 动力系统&lt;br /&gt;
&lt;br /&gt;
[[Category:Complex systems theory]]&lt;br /&gt;
&lt;br /&gt;
Category:Complex systems theory&lt;br /&gt;
&lt;br /&gt;
范畴: 复杂系统理论&lt;br /&gt;
&lt;br /&gt;
[[Category:Computational fields of study]]&lt;br /&gt;
&lt;br /&gt;
Category:Computational fields of study&lt;br /&gt;
&lt;br /&gt;
类别: 研究的计算领域&lt;br /&gt;
&lt;br /&gt;
&amp;lt;noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;small&amp;gt;This page was moved from [[wikipedia:en:Dynamical systems theory]]. Its edit history can be viewed at [[动力系统/edithistory]]&amp;lt;/small&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:待整理页面]]&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
===书籍推荐===&lt;br /&gt;
====[https://www.amazon.co.uk/Chaos-Making-Science-James-Gleick/dp/0749386061 Chaos: Making a New Science]====&lt;br /&gt;
The million-copy bestseller by National Book Award nominee and Pulitzer Prize finalist James Gleick—the author of Time Travel: A History—that reveals the science behind chaos theory。&lt;br /&gt;
Very readable, focuses on the scientists and mathematicians behind many of the key results in chaos.&lt;br /&gt;
本书由普利茨奖获得者James Gleick撰写。它是一本易读科普书籍，侧重介绍对混沌概念的发展做出重大贡献的科学家和数学家们。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://www.amazon.com/dp/0199566445/ref=cm_sw_su_dp Chaos and Fractals: An Elementary Introduction]====&lt;br /&gt;
This book provides the reader with an elementary introduction to chaos and fractals, suitable for students with a background in elementary algebra, without assuming prior coursework in calculus or physics. &lt;br /&gt;
这是一本关于混沌和分形的入门书籍。读者需要有一定的线性代数基础，但是不需要有微积分或物理学的基础。&lt;br /&gt;
&lt;br /&gt;
====[https://www.amazon.co.uk/Chaos-Very-Short-Introduction-Introductions/dp/0192853783/ref=pd_lpo_14_img_1/257-2017232-0516612?_encoding=UTF8&amp;amp;pd_rd_i=0192853783&amp;amp;pd_rd_r=eebee69a-fad3-43e3-bbeb-b883f2c59bf5&amp;amp;pd_rd_w=g6knH&amp;amp;pd_rd_wg=sx6z5&amp;amp;pf_rd_p=7b8e3b03-1439-4489-abd4-4a138cf4eca6&amp;amp;pf_rd_r=YTB0XXCR2DM8049PYP1Y&amp;amp;psc=1&amp;amp;refRID=YTB0XXCR2DM8049PYP1Y 牛津通识读本: Chaos]====&lt;br /&gt;
This book would not have been possible without my parents, of course, but I owe a greater debt than most to their faith, doubt, and hope, and to the love and patience of a, b, and c. Professionally my greatest debt is to Ed Spiegel, a father of chaos and my thesis Professor, mentor, and friend.&lt;br /&gt;
本书隶属于牛津通识读本系列。该书由Ed Spiegel的学生Leonard Smith撰写，语言生动简明。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
===集智课程推荐===&lt;br /&gt;
====[https://campus.swarma.org/course/1655 圣塔菲课程：Introduction to Dynamical Systems and Chaos]====&lt;br /&gt;
本课程中，主要介绍动力学系统和混沌系统，您将学到'''蝴蝶效应 Butterfly effect'''、'''奇异吸引子 Attractors'''等基本概念，以及如何应用于您感兴趣的领域。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://campus.swarma.org/course/1641 动力系统分析]====&lt;br /&gt;
本课程主要讲授连续和离散动力系统的定态、极限环及其稳定性分析、动力学系统的结构稳定性和常见的分支类型以及分析方法，混沌概念等。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E5%8A%A8%E5%8A%9B%E7%B3%BB%E7%BB%9F%E7%90%86%E8%AE%BA_Dynamical_Systems_Theory&amp;diff=10095</id>
		<title>动力系统理论 Dynamical Systems Theory</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E5%8A%A8%E5%8A%9B%E7%B3%BB%E7%BB%9F%E7%90%86%E8%AE%BA_Dynamical_Systems_Theory&amp;diff=10095"/>
		<updated>2020-07-10T15:21:30Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。&lt;br /&gt;
&lt;br /&gt;
{{Use dmy dates|date=May 2019|cs1-dates=y}}&lt;br /&gt;
&lt;br /&gt;
'''Dynamical systems theory''' is an area of [[mathematics]] used to describe the behavior of the  [[complex systems|complex]] [[dynamical system]]s, usually by employing [[differential equations]] or [[difference equations]]. When differential equations are employed, the theory is called [[continuous time|''continuous dynamical systems'']]. From a physical point of view, continuous dynamical systems is a generalization of [[classical mechanics]], a generalization where the [[equations of motion]] are postulated directly and are not constrained to be [[Euler–Lagrange equation]]s of a [[Principle of least action|least action principle]]. When difference equations are employed, the theory is called [[discrete time|''discrete dynamical systems'']]. When the time variable runs over a set that is discrete over some intervals and continuous over other intervals or is any arbitrary time-set such as a [[cantor set]], one gets [[dynamic equations on time scales]]. Some situations may also be modeled by mixed operators, such as [[differential-difference equations]].&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory is an area of mathematics used to describe the behavior of the  complex dynamical systems, usually by employing differential equations or difference equations. When differential equations are employed, the theory is called continuous dynamical systems. From a physical point of view, continuous dynamical systems is a generalization of classical mechanics, a generalization where the equations of motion are postulated directly and are not constrained to be Euler–Lagrange equations of a least action principle. When difference equations are employed, the theory is called discrete dynamical systems. When the time variable runs over a set that is discrete over some intervals and continuous over other intervals or is any arbitrary time-set such as a cantor set, one gets dynamic equations on time scales. Some situations may also be modeled by mixed operators, such as differential-difference equations.&lt;br /&gt;
&lt;br /&gt;
  &lt;br /&gt;
'''动力系统理论 Dynamical Systems Theory'''是一个用来描述复杂动力系统行为的数学领域，通常使用微分方程或差分方程。当采用微分方程时，该理论被称为连续动力系统。从物理学的角度来看，连续动力系统是经典力学的推广，也是运动方程的推广，不受极小作用原理Euler–Lagrange方程的约束。当采用差分方程时，该理论被称为离散动力系统。{1e当时间变量在一个离散的集合上运行，在另一个离散的集合上连续，或者像cantor集一样在任意的时间集合上运行时，人们就能得到时间尺度上的动力方程。}&lt;br /&gt;
'''算子 Operators'''是一个函数空间到函数空间上的映射O：X→X，广义的讲，对任何函数进行某一项操作都可以认为是一个算子，如求幂次、求微分等。动力系统的有些情况也可以用'''混合算子 Mixed Operators'''来建模，如微分-差分方程。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This theory deals with the long-term qualitative behavior of dynamical systems, and studies the nature of, and when possible the solutions of, the [[equations of motion]] of systems that are often primarily [[mechanics|mechanical]] or otherwise physical in nature, such as [[planetary orbit]]s and the behaviour of [[electronic circuit]]s, as well as systems that arise in [[biology]], [[economics]], and elsewhere. Much of modern research is focused on the study of [[chaotic system]]s.&lt;br /&gt;
&lt;br /&gt;
This theory deals with the long-term qualitative behavior of dynamical systems, and studies the nature of, and when possible the solutions of, the equations of motion of systems that are often primarily mechanical or otherwise physical in nature, such as planetary orbits and the behaviour of electronic circuits, as well as systems that arise in biology, economics, and elsewhere. Much of modern research is focused on the study of chaotic systems.&lt;br /&gt;
&lt;br /&gt;
这个理论处理动力系统的长期定性行为。如果能够得到解的话，还可以研究系统的运动方程。这些方程通常运用到机械或物理研究领域，如行星轨道和电子电路，以及出现在生物学，经济学和其他地方的系统。现代的研究大多集中在对混沌系统的研究上。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This field of study is also called just ''dynamical systems'', ''mathematical dynamical systems theory'' or the ''mathematical theory of dynamical systems''.&lt;br /&gt;
&lt;br /&gt;
This field of study is also called just dynamical systems, mathematical dynamical systems theory or the mathematical theory of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
这个研究领域被称为动力系统，数学动力系统理论或动力系统的数学理论。&lt;br /&gt;
&lt;br /&gt;
[[Image:Lorenz attractor yb.svg|thumb|240px|right|The [[Lorenz attractor]] is an example of a [[non-linear]] dynamical system. Studying this system helped give rise to [[chaos theory]].]]&lt;br /&gt;
&lt;br /&gt;
The [[Lorenz attractor is an example of a non-linear dynamical system. Studying this system helped give rise to chaos theory.]]&lt;br /&gt;
&lt;br /&gt;
'''洛伦兹吸引子 Lorenz Attractor'''是非线性动力系统的一个例子。对这个系统的研究产生了混沌理论。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Overview 综述 ==&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory and [[chaos theory]] deal with the long-term qualitative behavior of [[dynamical system]]s. Here, the focus is not on finding precise solutions to the equations defining the dynamical system (which is often hopeless), but rather to answer questions like &amp;quot;Will the system settle down to a steady state in the long term, and if so, what are the possible steady states?&amp;quot;, or &amp;quot;Does the long-term behavior of the system depend on its initial condition?&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Dynamical systems theory and chaos theory deal with the long-term qualitative behavior of dynamical systems. Here, the focus is not on finding precise solutions to the equations defining the dynamical system (which is often hopeless), but rather to answer questions like &amp;quot;Will the system settle down to a steady state in the long term, and if so, what are the possible steady states?&amp;quot;, or &amp;quot;Does the long-term behavior of the system depend on its initial condition?&amp;quot;&lt;br /&gt;
&lt;br /&gt;
动力系统理论和'''混沌理论 Chaos Theory'''是用来处理动力系统的长期定性行为的理论。寻找动力系统方程的精确解通常是很难达到的。这两个理论的重点不在于找到精确解，而是回答如下的问题，如“系统长期来看是否会稳定下来，如果可以，那么可能的稳定状态是什么样的?”，或“系统长期的行为是否取决于其初始条件?”&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
An important goal is to describe the fixed points, or steady states of a given dynamical system; these are values of the variable that don't change over time. Some of these fixed points are ''attractive'', meaning that if the system starts out in a nearby state, it converges towards the fixed point.&lt;br /&gt;
&lt;br /&gt;
An important goal is to describe the fixed points, or steady states of a given dynamical system; these are values of the variable that don't change over time. Some of these fixed points are attractive, meaning that if the system starts out in a nearby state, it converges towards the fixed point.&lt;br /&gt;
&lt;br /&gt;
描述给定动力系统的不动点或'''定态 Steady States'''是一个重要的目标。不动点或定态的变量值不会随时间的变化而变化。一些不动点是有吸引力的（attractive），即如果系统的初始值在它的附近，系统最终会收敛到这个不动点。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Similarly, one is interested in ''periodic points'', states of the system that repeat after several timesteps. Periodic points can also be attractive. [[Sharkovskii's theorem]] is an interesting statement about the number of periodic points of a one-dimensional discrete dynamical system.&lt;br /&gt;
&lt;br /&gt;
Similarly, one is interested in periodic points, states of the system that repeat after several timesteps. Periodic points can also be attractive. Sharkovskii's theorem is an interesting statement about the number of periodic points of a one-dimensional discrete dynamical system.&lt;br /&gt;
&lt;br /&gt;
人们还对动力系统的'''周期点 Periodic Points'''感兴趣，即系统在几个时间步之后会不断重复的状态。周期点也可以是有吸引力的。Sharkovskii定理描述了一维离散动力系统的周期点的个数。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Even simple [[nonlinear dynamical system]]s often exhibit seemingly random behavior that has been called ''chaos''.&amp;lt;ref&amp;gt;{{cite journal |last=Grebogi |first=C. |last2=Ott |first2=E. |last3=Yorke |first3=J. |year=1987 |title=Chaos, Strange Attractors, and Fractal Basin Boundaries in Nonlinear Dynamics |journal=[[Science (journal)|Science]] |volume=238 |issue=4827 |pages=632–638 |jstor=1700479 |doi=10.1126/science.238.4827.632 |pmid=17816542 |bibcode=1987Sci...238..632G }}&amp;lt;/ref&amp;gt; The branch of dynamical systems that deals with the clean definition and investigation of chaos is called ''[[chaos theory]]''.&lt;br /&gt;
&lt;br /&gt;
Even simple nonlinear dynamical systems often exhibit seemingly random behavior that has been called chaos. The branch of dynamical systems that deals with the clean definition and investigation of chaos is called chaos theory.&lt;br /&gt;
&lt;br /&gt;
即使是简单的非线性动力系统也常常表现出看似随机的行为，这种行为被称为混沌。混沌理论主要研究混沌的清晰定义和混沌的现象，它是动力系统理论的一个分支。&lt;br /&gt;
&lt;br /&gt;
== History 历史==&lt;br /&gt;
&lt;br /&gt;
The concept of dynamical systems theory has its origins in [[Newtonian mechanics]]. There, as in other natural sciences and engineering disciplines, the evolution rule of dynamical systems is given implicitly by a relation that gives the state of the system only a short time into the future.&lt;br /&gt;
&lt;br /&gt;
The concept of dynamical systems theory has its origins in Newtonian mechanics. There, as in other natural sciences and engineering disciplines, the evolution rule of dynamical systems is given implicitly by a relation that gives the state of the system only a short time into the future.&lt;br /&gt;
&lt;br /&gt;
动态系统理论的概念起源于牛顿运动定律。与其他自然科学和工程学科一样，动力系统的演化规律也是通过一种预测系统在未来很短时间内的状态的关系隐含地给出的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Before the advent of [[computer|fast computing machines]], solving a dynamical system required sophisticated mathematical techniques and could only be accomplished for a small class of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
Before the advent of fast computing machines, solving a dynamical system required sophisticated mathematical techniques and could only be accomplished for a small class of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
在高速计算机器出现之前，解决动力系统问题需要复杂的数学技能，而且还只能解决一小类动力系统问题。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Some excellent presentations of mathematical dynamic system theory include {{harvtxt|Beltrami|1990}}, {{harvtxt|Luenberger|1979}}, {{harvtxt|Padulo|Arbib|1974}}, and {{harvtxt|Strogatz|1994}}.&amp;lt;ref&amp;gt;Jerome R. Busemeyer (2008), [http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html &amp;quot;Dynamic Systems&amp;quot;]. To Appear in: ''Encyclopedia of cognitive science'', Macmillan. Retrieved 8 May 2008.  {{webarchive |url=https://web.archive.org/web/20080613053119/http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html |date=June 13, 2008 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Some excellent presentations of mathematical dynamic system theory include , , , and . To Appear in: ''Encyclopedia of cognitive science'', Macmillan. Retrieved 8 May 2008&lt;br /&gt;
&lt;br /&gt;
优秀的数学动力系统理论包括，，，和。--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|存疑]]）。&lt;br /&gt;
&lt;br /&gt;
== Concepts 概念==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Dynamical systems 动力系统===&lt;br /&gt;
&lt;br /&gt;
{{main|Dynamical system (definition)}}&lt;br /&gt;
&lt;br /&gt;
The [[dynamical system]] concept is a mathematical [[formal system|formalization]] for any fixed &amp;quot;rule&amp;quot; that describes the [[time]] dependence of a point's position in its [[ambient space]].  Examples include the [[mathematical model]]s that describe the swinging of a clock pendulum, the flow of water in a pipe, and the number of fish each spring in a lake.&lt;br /&gt;
&lt;br /&gt;
The dynamical system concept is a mathematical formalization for any fixed &amp;quot;rule&amp;quot; that describes the time dependence of a point's position in its ambient space.  Examples include the mathematical models that describe the swinging of a clock pendulum, the flow of water in a pipe, and the number of fish each spring in a lake.&lt;br /&gt;
&lt;br /&gt;
动力系统是一个对任何描述了点的位置在周围环境随时间变化的“固定”规则的数学式。举例来说，描述钟摆摆动、管道中的水流以及每年春天湖中鱼的数量的数学模型，都属于动力系统的概念范畴。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A dynamical system has a ''state'' determined by a collection of [[real numbers]], or more generally by a [[Set (mathematics)|set]] of [[Point (geometry)|points]] in an appropriate ''state space''.  Small changes in the state of the system correspond to small changes in the numbers.  The numbers are also the coordinates of a geometrical space—a [[manifold]].   The ''evolution rule'' of the dynamical system is a [[function (mathematics)|fixed rule]] that describes what future states follow from the current state.  The rule may be [[Deterministic system (mathematics)|deterministic]] (for a given time interval only one future state follows from the current state) or [[stochastic differential equation|stochastic]] (the evolution of the state is subject to random shocks).&lt;br /&gt;
&lt;br /&gt;
A dynamical system has a state determined by a collection of real numbers, or more generally by a set of points in an appropriate state space.  Small changes in the state of the system correspond to small changes in the numbers.  The numbers are also the coordinates of a geometrical space—a manifold.   The evolution rule of the dynamical system is a fixed rule that describes what future states follow from the current state.  The rule may be deterministic (for a given time interval only one future state follows from the current state) or stochastic (the evolution of the state is subject to random shocks).&lt;br /&gt;
&lt;br /&gt;
动力系统的状态是由一组实数决定的，更广泛地说，是由适当的状态空间中的一组点决定的。系统状态的微小变化对应于数字的变化。这些数字也是几何空间——'''流形 Manifold'''——的坐标组。动力系统的演化是描述了在当前状态之后出现的未来状态的固定规则。这个规则可以是确定性的(在给定的时间间隔内，有且仅有一个未来状态在当前状态之后出现)，或随机性的(状态的演化受到随机因素的影响)。&lt;br /&gt;
&lt;br /&gt;
=== Dynamicism 动态主义===&lt;br /&gt;
&lt;br /&gt;
[[Dynamicism]], also termed the ''dynamic hypothesis'' or the ''dynamic hypothesis in cognitive science'' or ''dynamic cognition'', is a new approach in [[cognitive science]] exemplified by the work of philosopher [[Tim van Gelder]]. It argues that [[differential equations]] are more suited to modelling [[cognition]] than more traditional [[computer]] models.&lt;br /&gt;
&lt;br /&gt;
Dynamicism, also termed the dynamic hypothesis or the dynamic hypothesis in cognitive science or dynamic cognition, is a new approach in cognitive science exemplified by the work of philosopher Tim van Gelder. It argues that differential equations are more suited to modelling cognition than more traditional computer models.&lt;br /&gt;
&lt;br /&gt;
'''动态主义 Dynamicism'''，又称动态假设，或称认知科学、动态认知中的动态假设，是以哲学家Tim van Gelder的著作为代表的认知科学的一种新取向。动态主义认为微分方程比传统的计算机模型更适合于建立认知模型。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Nonlinear system 非线性系统===&lt;br /&gt;
&lt;br /&gt;
{{main|Nonlinear system}}&lt;br /&gt;
&lt;br /&gt;
In [[mathematics]], a [[nonlinear system]] is a system that is not [[linear system|linear]]—i.e., a system that does not satisfy the [[superposition principle]]. Less technically, a nonlinear system is any problem where the variable(s) to solve for cannot be written as a linear sum of independent components. A [[Homogeneity (physics)|nonhomogeneous]] system, which is linear apart from the presence of a function of the [[independent variable]]s, is nonlinear according to a strict definition, but such systems are usually studied alongside linear systems, because they can be transformed to a linear system as long as a particular solution is known.&lt;br /&gt;
&lt;br /&gt;
In mathematics, a nonlinear system is a system that is not linear—i.e., a system that does not satisfy the superposition principle. Less technically, a nonlinear system is any problem where the variable(s) to solve for cannot be written as a linear sum of independent components. A nonhomogeneous system, which is linear apart from the presence of a function of the independent variables, is nonlinear according to a strict definition, but such systems are usually studied alongside linear systems, because they can be transformed to a linear system as long as a particular solution is known.&lt;br /&gt;
&lt;br /&gt;
在数学中，'''非线性系统 Nonlinear System'''是指系统不是线性的——也就是说，一个不满足叠加原理的系统。更通俗地说，非线性系统是待求解变量不能被写成其独立分量的线性和的系统。非齐次系统根据定义严格来说是非线性的，除了它的自变量包含函数以外其他部分都是线性的。但非齐次系统通常与线性系统一起研究，因为只要知道特解，它们就可以转化为线性系统。&lt;br /&gt;
&lt;br /&gt;
== Related fields 相关领域==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Arithmetic dynamics 算术动态系统===&lt;br /&gt;
&lt;br /&gt;
:[[Arithmetic dynamics]] is a field that emerged in the 1990s that amalgamates two areas of mathematics, [[dynamical systems]] and [[number theory]]. Classically, discrete dynamics refers to the study of the [[Iterated function|iteration]] of self-maps of the [[complex plane]] or [[real line]]. Arithmetic dynamics is the study of the number-theoretic properties of integer, rational, {{math|&amp;lt;var&amp;gt;p&amp;lt;/var&amp;gt;}}-adic, and/or algebraic points under repeated application of a [[polynomial]] or [[rational function]].&lt;br /&gt;
&lt;br /&gt;
Arithmetic dynamics is a field that emerged in the 1990s that amalgamates two areas of mathematics, dynamical systems and number theory. Classically, discrete dynamics refers to the study of the iteration of self-maps of the complex plane or real line. Arithmetic dynamics is the study of the number-theoretic properties of integer, rational, -adic, and/or algebraic points under repeated application of a polynomial or rational function.&lt;br /&gt;
&lt;br /&gt;
'''算术动态系统 Arithmetic Dynamics'''是20世纪90年代出现的一个领域，融合了动力系统和数论这两个数学领域。经典的离散动力学研究复平面或实直线的自映射的迭代。算术动态系统研究内容是在多项式或有理函数中的整数、有理数、并元 --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|存疑]]） 和/或代数点的数论性质。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Chaos theory 混沌理论===&lt;br /&gt;
&lt;br /&gt;
:[[Chaos theory]] describes the behavior of certain [[dynamical system (definition)|dynamical system]]s – that is, systems whose state evolves with time – that may exhibit dynamics that are highly sensitive to initial conditions (popularly referred to as the [[butterfly effect]]). As a result of this sensitivity, which manifests itself as an exponential growth of perturbations in the initial conditions, the behavior of chaotic systems appears [[randomness|random]]. This happens even though these systems are [[deterministic system (philosophy)|deterministic]], meaning that their future dynamics are fully defined by their initial conditions, with no random elements involved. This behavior is known as deterministic chaos, or simply ''chaos''.&lt;br /&gt;
&lt;br /&gt;
Chaos theory describes the behavior of certain dynamical systems – that is, systems whose state evolves with time – that may exhibit dynamics that are highly sensitive to initial conditions (popularly referred to as the butterfly effect). As a result of this sensitivity, which manifests itself as an exponential growth of perturbations in the initial conditions, the behavior of chaotic systems appears random. This happens even though these systems are deterministic, meaning that their future dynamics are fully defined by their initial conditions, with no random elements involved. This behavior is known as deterministic chaos, or simply chaos.&lt;br /&gt;
&lt;br /&gt;
混沌理论描述了某些状态随时间演化的动力系统的行为，这些系统可能表现出对初始条件高度敏感的特点（通常被称为'''蝴蝶效应 Butterfly Effect'''）。由于扰动受初始条件影响而指数增长，因此混沌系统具有敏感性，敏感性使它的行为看起来是随机的。但是这种敏感性也会出现在确定的动力系统中，即未来的动力学完全由它的初始条件定义，没有任何随机因素参与的系统中。这种现象被称为确定性混沌，或简单混沌。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Complex systems 复杂系统===&lt;br /&gt;
&lt;br /&gt;
:[[Complex systems]] is a scientific field that studies the common properties of [[system]]s considered [[Complexity|complex]] in [[nature]], [[society]], and [[science]]. It is also called ''complex systems theory'', ''complexity science'', ''study of complex systems'' and/or ''sciences of complexity''. The key problems of such systems are  difficulties with their formal [[Scientific modelling|modeling]] and [[simulation]]. From such perspective, in different research contexts complex systems are defined on the base of their different attributes.&lt;br /&gt;
&lt;br /&gt;
Complex systems is a scientific field that studies the common properties of systems considered complex in nature, society, and science. It is also called complex systems theory, complexity science, study of complex systems and/or sciences of complexity. The key problems of such systems are  difficulties with their formal modeling and simulation. From such perspective, in different research contexts complex systems are defined on the base of their different attributes.&lt;br /&gt;
&lt;br /&gt;
'''复杂系统 Complex Systems'''是研究自然、社会和科学中复杂现象的共同性质的科学领域。它也被称为复杂系统理论、复杂性科学、复杂系统研究和关于复杂性的科学。这些系统的关键问题在于对系统的形式化建模与仿真。因此，复杂系统是根据在不同的研究语境中的不同属性来定义的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
:The study of complex systems is bringing new vitality to many areas of science where a more typical [[reductionist]] strategy has fallen short. ''Complex systems'' is therefore often used as a broad term encompassing a research approach to problems in many diverse disciplines including [[neurosciences]], [[social sciences]], [[meteorology]], [[chemistry]], [[physics]], [[computer science]], [[psychology]], [[artificial life]], [[evolutionary computation]], [[economics]], earthquake prediction, [[molecular biology]] and inquiries into the nature of living [[cell (biology)|cell]]s themselves.&lt;br /&gt;
&lt;br /&gt;
The study of complex systems is bringing new vitality to many areas of science where a more typical reductionist strategy has fallen short. Complex systems is therefore often used as a broad term encompassing a research approach to problems in many diverse disciplines including neurosciences, social sciences, meteorology, chemistry, physics, computer science, psychology, artificial life, evolutionary computation, economics, earthquake prediction, molecular biology and inquiries into the nature of living cells themselves.&lt;br /&gt;
&lt;br /&gt;
还原论策略已经不足以研究许多科学领域的问题，而复杂系统的研究则为科学带来了广泛的新活力。复杂系统通常被用作一个应用广泛的研究方法术语，并涵盖许多不同的学科，包括神经科学、社会科学、气象学、化学、物理学、计算机科学、心理学、人工生命、进化计算、经济学、地震预测、分子生物学以及对活细胞的研究等。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Control theory 控制理论===&lt;br /&gt;
&lt;br /&gt;
:[[Control theory]] is an interdisciplinary branch of [[engineering]] and [[mathematics]], in part it deals with influencing the behavior of [[dynamical system]]s.&lt;br /&gt;
&lt;br /&gt;
Control theory is an interdisciplinary branch of engineering and mathematics, in part it deals with influencing the behavior of dynamical systems.&lt;br /&gt;
&lt;br /&gt;
'''控制理论 Control Theory'''是工程和数学的一个交叉学科，它的其中一部分研究影响动力系统行为的各种因素。&lt;br /&gt;
&lt;br /&gt;
控制理论是一个研究如何调整动态系统特性的理论，它也是工程和数学的一个交叉学科，逐渐的应用在许多社会科学中，例如心理学、社会学（社会学中的控制理论）、犯罪学及'''金融系统 Financial System'''。控制理论一般的目的是借由控制器的动作让系统稳定，也就是系统维持在设定值，而且不会在设定值附近晃动。设定值一般维持不变的控制称为调节，设定值快速变化，要求跟踪速度加速度等的控制称为伺服。它的其中一部分研究影响动力系统行为的各种因素。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Ergodic theory 遍历理论===&lt;br /&gt;
&lt;br /&gt;
:[[Ergodic theory]] is a branch of [[mathematics]] that studies [[dynamical system]]s with an [[invariant measure]] and related problems. Its initial development was motivated by problems of [[statistical physics]].&lt;br /&gt;
&lt;br /&gt;
Ergodic theory is a branch of mathematics that studies dynamical systems with an invariant measure and related problems. Its initial development was motivated by problems of statistical physics.&lt;br /&gt;
&lt;br /&gt;
'''遍历理论 Ergodic Theory'''是数学的一个分支，研究有不变测度相关问题的动力系统。它最初的发展受到了统计物理学的推动。&lt;br /&gt;
遍历理论是研究保测变换的渐近性态的数学分支。它起源于为统计力学提供基础的&amp;quot;遍历假设&amp;quot;研究，并与动力系统理论、概率论、信息论、泛函分析、数论等数学分支有着密切的联系。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Functional analysis 泛函分析===&lt;br /&gt;
&lt;br /&gt;
:[[Functional analysis]] is the branch of [[mathematics]], and specifically of [[mathematical analysis|analysis]], concerned with the study of [[vector space]]s and [[operator (mathematics)|operator]]s acting upon them. It has its historical roots in the study of [[functional space]]s, in particular transformations of [[function (mathematics)|functions]], such as the [[Fourier transform]], as well as in the study of [[differential equations|differential]] and [[integral equations]]. This usage of the word ''[[functional (mathematics)|functional]]'' goes back to the [[calculus of variations]], implying a function whose argument is a function. Its use in general has been attributed to mathematician and physicist [[Vito Volterra]] and its founding is largely attributed to mathematician [[Stefan Banach]].&lt;br /&gt;
&lt;br /&gt;
Functional analysis is the branch of mathematics, and specifically of analysis, concerned with the study of vector spaces and operators acting upon them. It has its historical roots in the study of functional spaces, in particular transformations of functions, such as the Fourier transform, as well as in the study of differential and integral equations. This usage of the word functional goes back to the calculus of variations, implying a function whose argument is a function. Its use in general has been attributed to mathematician and physicist Vito Volterra and its founding is largely attributed to mathematician Stefan Banach.&lt;br /&gt;
&lt;br /&gt;
'''泛函分析 Functional analysis'''是数学分析的一个分支，研究向量空间和作用于向量空间的算子。它源于对函数空间的研究，特别是对函数变换的研究，例如傅里叶变换，微积分方程的研究等。泛函分析的名称“Functional Analysis”中，“functional”这个词的用法可以追溯到变分法，也就是说函数的参数是一个函数。这个词的使用一般被认为归功于数学家和物理学家Vito Volterra，和数学家Stefan Banach。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Graph dynamical systems 图动力系统===&lt;br /&gt;
&lt;br /&gt;
:The concept of [[graph dynamical system]]s (GDS) can be used to capture a wide range of processes taking place on graphs or networks. A major theme in the mathematical and computational analysis of graph dynamical systems is to relate their structural properties (e.g. the network connectivity) and the global dynamics that result.&lt;br /&gt;
&lt;br /&gt;
The concept of graph dynamical systems (GDS) can be used to capture a wide range of processes taking place on graphs or networks. A major theme in the mathematical and computational analysis of graph dynamical systems is to relate their structural properties (e.g. the network connectivity) and the global dynamics that result.&lt;br /&gt;
&lt;br /&gt;
'''图动力系统 Graph dynamical systems (GDS)'''可以用来描绘图或网络上发生的各种过程。图动力系统的数学和计算分析的一个主要主题是关联它们的结构性质(例如:网络连接)和结构性质造成的网络整体的动态结果。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Projected dynamical systems 投影动力系统===&lt;br /&gt;
&lt;br /&gt;
:[[Projected dynamical systems]] it is a [[mathematics|mathematical]] theory investigating the behaviour of [[dynamical system]]s where solutions are restricted to a constraint set. The discipline shares connections to and applications with both the static world of [[Optimization (mathematics)|optimization]] and [[Equilibrium point|equilibrium]] problems and the dynamical world of [[ordinary differential equations]]. A projected dynamical system is given by the [[flow (mathematics)|flow]] to the projected differential equation.&lt;br /&gt;
&lt;br /&gt;
Projected dynamical systems it is a mathematical theory investigating the behaviour of dynamical systems where solutions are restricted to a constraint set. The discipline shares connections to and applications with both the static world of optimization and equilibrium problems and the dynamical world of ordinary differential equations. A projected dynamical system is given by the flow to the projected differential equation.&lt;br /&gt;
&lt;br /&gt;
'''投影动力系统 Projected Dynamical Systems'''是研究解在一个约束集内的动力系统行为的数学理论。这门学科与静态世界中的最优化和平衡问题以及动态世界中的常微分方程都有联系，并且都有相互联系的应用。一个投影动力系统是由投影微分方程的'''流形 flow'''给定的。&lt;br /&gt;
通过对投影微分方程的流分析，给出了一个投影动力系统的表达式：&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\frac{dx(t)}{dt} = \Pi_K(x(t),-F(x(t)))&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中K为约束集。这种形式的微分方程因具有不连续的向量场而值得注意。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Symbolic dynamics 符号动力学===&lt;br /&gt;
&lt;br /&gt;
:[[Symbolic dynamics]] is the practice of modelling a topological or smooth [[dynamical system]] by a discrete space consisting of infinite [[sequence]]s of abstract symbols, each of which corresponds to a state of the system, with the dynamics (evolution) given by the [[shift operator]].&lt;br /&gt;
&lt;br /&gt;
Symbolic dynamics is the practice of modelling a topological or smooth dynamical system by a discrete space consisting of infinite sequences of abstract symbols, each of which corresponds to a state of the system, with the dynamics (evolution) given by the shift operator.&lt;br /&gt;
&lt;br /&gt;
'''符号动力学 Symbolic Dynamics'''是通过一个由抽象符号的无限序列组成的离散空间建立一个拓扑或光滑动力系统的方法。每一个抽象符号的无限序列序列对应于系统的一个状态，并由移位算子给出动力学(演化)。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== System dynamics 系统动力学===&lt;br /&gt;
&lt;br /&gt;
:[[System dynamics]] is an approach to understanding the behaviour of systems over time.  It deals with internal feedback loops and time delays that affect the behaviour and state of the entire system.&amp;lt;ref name=&amp;quot;sysdyn&amp;quot;&amp;gt;[http://sysdyn.clexchange.org MIT System Dynamics in Education Project (SDEP)&amp;lt;!-- Bot generated title --&amp;gt;] {{webarchive|url=https://web.archive.org/web/20080509163801/http://sysdyn.clexchange.org/ |date=2008-05-09 }}&amp;lt;/ref&amp;gt;  What makes using system dynamics different from other approaches to studying systems is the use of [[feedback]] loops and [[Stock and flow|stocks and flows]].  These elements help describe how even seemingly simple systems display baffling [[nonlinearity]].&lt;br /&gt;
&lt;br /&gt;
System dynamics is an approach to understanding the behaviour of systems over time.  It deals with internal feedback loops and time delays that affect the behaviour and state of the entire system.  What makes using system dynamics different from other approaches to studying systems is the use of feedback loops and stocks and flows.  These elements help describe how even seemingly simple systems display baffling nonlinearity.&lt;br /&gt;
&lt;br /&gt;
'''系统动力学 System Dynamics'''是一种理解系统随时间变化行为的方法。它是用来处理影响整个系统行为和状态的内部反馈回路和时间延迟的方法。系统动力学不同于其他系统研究方法的地方在于它使用了反馈环、股票（stocks）和流形（flows）--[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|如何翻译stocks 和 folows]]）的元素。这些元素有助于描述看似简单的系统如何显示复杂的非线性行为。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Topological dynamics 拓扑动力学===&lt;br /&gt;
&lt;br /&gt;
:[[Topological dynamics]] is a branch of the theory of dynamical systems in which qualitative, asymptotic properties of dynamical systems are studied from the viewpoint of [[general topology]].&lt;br /&gt;
&lt;br /&gt;
Topological dynamics is a branch of the theory of dynamical systems in which qualitative, asymptotic properties of dynamical systems are studied from the viewpoint of general topology.&lt;br /&gt;
&lt;br /&gt;
'''拓扑动力学 Topological Dynamics'''是动力系统理论的一个分支。在拓朴动力学中，动力系统的定性性质和渐近性质是从一般拓扑学的观点来研究的。&lt;br /&gt;
&lt;br /&gt;
== Applications 应用==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== In human development 在人类发展中的应用===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In [[Developmental psychology|human development]], dynamical systems theory has been used to enhance and simplify Erik Erikson's [[eight stages of psychosocial development]] and offers a standard method of examining the universal pattern of human development. This method is based on the self-organizing and [[fractal]] properties of the [[Fibonacci sequence]].&amp;lt;ref name=Sacco&amp;gt;{{cite journal|last=Sacco|first=R.G.|title=Re-envisaging the eight developmental stages of Erik Erikson: The Fibonacci Life-Chart Method (FLCM)|journal=Journal of Educational and Developmental Psychology|date=2013|volume=3|issue=1|pages=140–146|doi=10.5539/jedp.v3n1p140|doi-access=free}}&amp;lt;/ref&amp;gt; Using mathematical modeling, a natural progression of human development with eight life stages has been identified:  early infancy (0–2 years), toddler (2–4 years), early childhood (4–7 years), middle childhood (7–11 years), adolescence (11–18 years), young adulthood (18–29 years), middle adulthood (29–48 years), and older adulthood (48–78+ years).&amp;lt;ref name=Sacco/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In human development, dynamical systems theory has been used to enhance and simplify Erik Erikson's eight stages of psychosocial development and offers a standard method of examining the universal pattern of human development. This method is based on the self-organizing and fractal properties of the Fibonacci sequence. Using mathematical modeling, a natural progression of human development with eight life stages has been identified:  early infancy (0–2 years), toddler (2–4 years), early childhood (4–7 years), middle childhood (7–11 years), adolescence (11–18 years), young adulthood (18–29 years), middle adulthood (29–48 years), and older adulthood (48–78+ years).&lt;br /&gt;
&lt;br /&gt;
在人类发展方面，动力系统理论已经被用来增强和简化 Erik Erikson 的'''社会心理发展8阶段理论 Eight Stages of Psychosocial Development'''，并提供了一个检验人类发展普遍模式的标准方法。该方法基于斐波那契数列的'''自组织性 self-organizing'''和'''分形 Fractal''' 特性。利用数学模型，人类发展的自然进程被分为8个生命阶段: 早期婴儿期(0-2岁)、幼儿期(2-4岁)、童年早期(4-7岁)、童年中期(7-11岁)、青春期(11-18岁)、成年早期(18-29岁)、成年中期(29-48岁)和老年成年期(48-78岁及以上)。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
According to this model, stage transitions between age intervals represent self-organization processes at multiple levels (e.g., molecules, genes, cell, organ, organ system, organism, behavior, and environment). For example, at the stage transition from [[adolescence]] to [[young adulthood]], and after reaching the critical point of 18 years of age (young adulthood), a peak in [[testosterone]] is observed in males&amp;lt;ref&amp;gt;{{cite journal |last1=Kelsey |first1=T. W. |title=A validated age-related normative model for male total testosterone shows increasing variance but no decline after age 40 years. |journal=PLOS One |volume=9 |issue=10 |pages=e109346 |doi=10.1371/journal.pone.0109346|pmid=25295520 |year=2014 |pmc=4190174 |bibcode=2014PLoSO...9j9346K }}&amp;lt;/ref&amp;gt; and the period of optimal [[fertility]] begins in females.&amp;lt;ref&amp;gt;{{cite book |last1=Tulandi |first1=T. |title=Preservation of fertility |date=2004 |publisher=Taylor &amp;amp; Francis |pages=1–20}}&amp;lt;/ref&amp;gt; Similarly, at age 30 optimal fertility begins to decline in females,&amp;lt;ref name=&amp;quot;Social Science 2008&amp;quot;&amp;gt;{{cite journal |last1=Blanchflower |first1=D. G. |title=Is well-being U-shaped over the life cycle? |journal=Social Science &amp;amp; Medicine |volume=66 |issue=8 |pages=1733–1749 |doi=10.1016/j.socscimed.2008.01.030|pmid=18316146 |year=2008 |citeseerx=10.1.1.63.5221 }}&amp;lt;/ref&amp;gt; and at the stage transition from [[middle adulthood]] to older adulthood at 48 years, the average age of onset of [[menopause]] occurs.&amp;lt;ref name=&amp;quot;Social Science 2008&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
According to this model, stage transitions between age intervals represent self-organization processes at multiple levels (e.g., molecules, genes, cell, organ, organ system, organism, behavior, and environment). For example, at the stage transition from adolescence to young adulthood, and after reaching the critical point of 18 years of age (young adulthood), a peak in testosterone is observed in males and the period of optimal fertility begins in females. Similarly, at age 30 optimal fertility begins to decline in females, and at the stage transition from middle adulthood to older adulthood at 48 years, the average age of onset of menopause occurs.&lt;br /&gt;
&lt;br /&gt;
根据这个模型，年龄的阶段转换代表了多层次的自组织过程(例如，分子、基因、细胞、器官、器官系统、生物体、行为和环境)。例如，在从青春期向成年早期过渡的阶段中，在达到18岁这一关键年龄之后，男性的睾丸激素达到高峰，女性的最佳生育期开始。同样，在30岁时，女性的最佳生育能力开始下降；在从成年中期过渡到老年成年期时，48岁是绝经的平均年龄。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
These events are physical bioattractors of aging from the perspective of Fibonacci mathematical modeling and dynamically systems theory. In practical terms, prediction in human development becomes possible in the same statistical sense in which the average temperature or precipitation at different times of the year can be used for [[weather forecasting]]. Each of the predetermined stages of human development follows an optimal epigenetic biological pattern. This phenomenon can be explained by the occurrence of Fibonacci numbers in biological [[DNA]]&amp;lt;ref&amp;gt;{{cite journal |last1=Perez |first1=J. C. (2010). |title=Codon populations in single-stranded whole human genome DNA are fractal and fine-tuned by the Golden Ratio 1.618. |journal=Interdisciplinary Sciences: Computational Life Sciences |volume=2 |issue=3 |pages=228–240 |doi=10.1007/s12539-010-0022-0|pmid=20658335 |year=2010 }}&amp;lt;/ref&amp;gt; and self-organizing properties of the Fibonacci numbers that converge on the [[golden ratio]].&lt;br /&gt;
&lt;br /&gt;
These events are physical bioattractors of aging from the perspective of Fibonacci mathematical modeling and dynamically systems theory. In practical terms, prediction in human development becomes possible in the same statistical sense in which the average temperature or precipitation at different times of the year can be used for weather forecasting. Each of the predetermined stages of human development follows an optimal epigenetic biological pattern. This phenomenon can be explained by the occurrence of Fibonacci numbers in biological DNA and self-organizing properties of the Fibonacci numbers that converge on the golden ratio.&lt;br /&gt;
&lt;br /&gt;
从斐波那契数学模型和动力系统理论的角度来看，上述事件是衰老的'''物理生物吸引子Physical Bioattractors'''。实际上，正如一年中不同时间的平均气温和降水量可以用来预测天气，预测人类的发展在统计意义上同样是可能的。人类发展的每个'''预定阶段Predetermined Stages'''都遵循最佳的'''表观遗传生物模式 Epigenetic Biological Pattern'''。这种现象可以用 DNA 中的斐波那契数和收敛于黄金分割比的斐波那契数的自组织特性来解释。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== In biomechanics 在运动生物力学中的应用===&lt;br /&gt;
&lt;br /&gt;
In [[sports biomechanics]], dynamical systems theory has emerged in the movement sciences as a viable framework for modeling athletic performance. From a dynamical systems perspective, the human movement system is a highly intricate network of co-dependent sub-systems (e.g. respiratory, circulatory, nervous, skeletomuscular, perceptual) that are composed of a large number of interacting components (e.g. blood cells, oxygen molecules, muscle tissue, metabolic enzymes, connective tissue and bone). In dynamical systems theory, movement patterns emerge through generic processes of self-organization found in physical and biological systems.&amp;lt;ref&amp;gt;Paul S Glazier, Keith Davids, Roger M Bartlett (2003). [http://www.sportsci.org/jour/03/psg.htm &amp;quot;DYNAMICAL SYSTEMS THEORY: a Relevant Framework for Performance-Oriented Sports Biomechanics Research&amp;quot;]. in: Sportscience 7. Accessed 2008-05-08.&amp;lt;/ref&amp;gt; There is no research validation of any of the claims associated to the conceptual application of this framework.&lt;br /&gt;
&lt;br /&gt;
In sports biomechanics, dynamical systems theory has emerged in the movement sciences as a viable framework for modeling athletic performance. From a dynamical systems perspective, the human movement system is a highly intricate network of co-dependent sub-systems (e.g. respiratory, circulatory, nervous, skeletomuscular, perceptual) that are composed of a large number of interacting components (e.g. blood cells, oxygen molecules, muscle tissue, metabolic enzymes, connective tissue and bone). In dynamical systems theory, movement patterns emerge through generic processes of self-organization found in physical and biological systems. There is no research validation of any of the claims associated to the conceptual application of this framework.&lt;br /&gt;
&lt;br /&gt;
在运动生物力学中，动力系统理论新兴地成为对运动表现建模的可行框架。从动力系统的角度来看，人类的运动系统是由高度复杂和相互依赖的子系统网络（如呼吸、循环、神经、骨骼肌系统和知觉系统等）组成的，它们由大量相互作用的部分组成（包括血细胞、氧分子、肌肉组织、代谢酶、结缔组织和骨骼等)。动力系统理论中，运动模式通过物理系统和生物系统中的一般自组织过程出现。没有任何研究证实与这一框架的概念相关的任何主张。&lt;br /&gt;
&lt;br /&gt;
=== In cognitive science 在认知科学中的应用===&lt;br /&gt;
&lt;br /&gt;
Dynamical system theory has been applied in the field of [[neurodynamics|neuroscience]] and [[cognitive science|cognitive development]], especially in [[the neo-Piagetian theories of cognitive development]]. It is the belief that cognitive development is best represented by physical theories rather than theories based on syntax and [[AI]]. It also believed that differential equations are the most appropriate tool for modeling human behavior. These equations are interpreted to represent an agent's cognitive trajectory through [[state space]]. In other words, dynamicists argue that [[psychology]] should be (or is) the description (via differential equations) of the cognitions and behaviors of an agent under certain environmental and internal pressures. The language of chaos theory is also frequently adopted.&lt;br /&gt;
&lt;br /&gt;
Dynamical system theory has been applied in the field of neuroscience and cognitive development, especially in the neo-Piagetian theories of cognitive development. It is the belief that cognitive development is best represented by physical theories rather than theories based on syntax and AI. It also believed that differential equations are the most appropriate tool for modeling human behavior. These equations are interpreted to represent an agent's cognitive trajectory through state space. In other words, dynamicists argue that psychology should be (or is) the description (via differential equations) of the cognitions and behaviors of an agent under certain environmental and internal pressures. The language of chaos theory is also frequently adopted.&lt;br /&gt;
&lt;br /&gt;
动力系统理论已经被应用于神经科学和认知发展领域，特别是在认知发展的'''新皮亚杰学派 neo-Piagetian'''中。人们相信，物理学理论比句法学理论和人工智能理论更能代表认知发展。人们还相信微分方程是人类行为建模最合适的工具。人们认为微分方程可以解释为通过状态空间代表一个主体的认知轨迹的算式。换句话说，动力学家认为心理学应该(或者是)(通过微分方程)描述在一定的环境和内部压力下的主体的认知和行为的学科。混沌理论在相关领域也经常被采用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In it, the learner's mind reaches a state of disequilibrium where old patterns have broken down. This is the phase transition of cognitive development. [[Self-organization]] (the spontaneous creation of coherent forms) sets in as activity levels link to each other. Newly formed macroscopic and microscopic structures support each other, speeding up the process. These links form the structure of a new state of order in the mind through a process called ''scalloping'' (the repeated building up and collapsing of complex performance.) This new, novel state is progressive, discrete, idiosyncratic and unpredictable.&amp;lt;ref&amp;gt;{{cite journal|title=The Promise of Dynamic Systems Approaches for an Integrated Account of Human Development|journal=Child Development|date=2000-02-25|first=Mark D.|last=Lewis|volume=71|issue=1|pages=36–43|id= |url=http://home.oise.utoronto.ca/~mlewis/Manuscripts/Promise.pdf|accessdate=2008-04-04|doi=10.1111/1467-8624.00116|pmid=10836556 |citeseerx=10.1.1.72.3668}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In it, the learner's mind reaches a state of disequilibrium where old patterns have broken down. This is the phase transition of cognitive development. Self-organization (the spontaneous creation of coherent forms) sets in as activity levels link to each other. Newly formed macroscopic and microscopic structures support each other, speeding up the process. These links form the structure of a new state of order in the mind through a process called scalloping (the repeated building up and collapsing of complex performance.) This new, novel state is progressive, discrete, idiosyncratic and unpredictable.&lt;br /&gt;
&lt;br /&gt;
在学习的过程中，旧的模式被打破了，学习者的思维达到了一种不平衡的状态。这是认知发展的阶段性转变。自组织(连贯的自发创造(the spontaneous creation of coherent forms))在'''活动水平 Activity Levels'''相互联系时产生。新形成的宏观和微观结构相互支持，加速了这一过程。这些联系在头脑中形成了一种具有新状态的结构，这个过程被称为“扇贝化 Scalloping”，也就是头脑的复杂性能的不断累积和崩溃的过程 --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|扇贝化的翻译拿不准，这句话的描述比较抽象]]）。这种新的状态是渐进的、离散的、异质的的和不可预知的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Dynamic systems theory has recently been used to explain a long-unanswered problem in child development referred to as the [[A-not-B error]].&amp;lt;ref&amp;gt;{{cite journal|title=Development as a dynamic system|journal=Trends in Cognitive Sciences|date=2003-07-30|first=Linda B.|last=Smith|author2=Esther Thelen|volume=7|issue=8|pages=343–8|id= |url=http://www.indiana.edu/~cogdev/labwork/dynamicsystem.pdf|accessdate=2008-04-04|doi=10.1016/S1364-6613(03)00156-6|pmid=12907229|citeseerx=10.1.1.294.2037}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Dynamic systems theory has recently been used to explain a long-unanswered problem in child development referred to as the A-not-B error.&lt;br /&gt;
&lt;br /&gt;
动力系统理论最近还被用来解释儿童发展中一个长期没有答案的问题，即 A-not-B 错误。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===In second language development 在二语习得中的应用===&lt;br /&gt;
&lt;br /&gt;
{{Main|Dynamic approach to second language development}}&lt;br /&gt;
&lt;br /&gt;
The application of Dynamic Systems Theory to study [[second language acquisition]] is attributed to [[Diane Larsen-Freeman]] who published an article in 1997 in which she claimed that [[second language acquisition]] should be viewed as a developmental process which includes [[language attrition]] as well as language acquisition.&amp;lt;ref&amp;gt;{{cite web|url=https://academic.oup.com/applij/article-abstract/18/2/141/134192|title=Chaos/Complexity Science and Second Language Acquisition|date=1997|publisher=Applied Linguistics}}&amp;lt;/ref&amp;gt; In her article she claimed that language should be viewed as a dynamic system which is dynamic, complex, nonlinear, chaotic, unpredictable, sensitive to initial conditions, open, self-organizing, feedback sensitive, and adaptive.&lt;br /&gt;
&lt;br /&gt;
The application of Dynamic Systems Theory to study second language acquisition is attributed to Diane Larsen-Freeman who published an article in 1997 in which she claimed that second language acquisition should be viewed as a developmental process which includes language attrition as well as language acquisition. In her article she claimed that language should be viewed as a dynamic system which is dynamic, complex, nonlinear, chaotic, unpredictable, sensitive to initial conditions, open, self-organizing, feedback sensitive, and adaptive.&lt;br /&gt;
&lt;br /&gt;
动力系统理论在二语习得研究中的应用归功于 Diane Larsen-Freeman，她在1997年发表的一篇文章中认为，二语习得应该被看作是一个包括语言流失和习得在内的发展过程。她在文章中认为，语言应该被看作是一个动态的、复杂的、非线性的、混沌的、不可预知的、对初始条件敏感的、开放的、自组织的、反馈敏感的和适应性的动力系统。&lt;br /&gt;
&lt;br /&gt;
== See also 参见==&lt;br /&gt;
&lt;br /&gt;
;Related subjects&lt;br /&gt;
&lt;br /&gt;
Related subjects&lt;br /&gt;
&lt;br /&gt;
相关科目&lt;br /&gt;
&lt;br /&gt;
{{div col|colwidth=20em}}&lt;br /&gt;
&lt;br /&gt;
* [[List of dynamical system topics]] 动力系统主题清单&lt;br /&gt;
&lt;br /&gt;
* [[Baker's map]]&lt;br /&gt;
&lt;br /&gt;
* [[Biological applications of bifurcation theory]] 分支理论的生物学应用&lt;br /&gt;
&lt;br /&gt;
* [[Dynamical system (definition)]] 动力系统（定义）&lt;br /&gt;
&lt;br /&gt;
* [[Embodied Embedded Cognition]] 具身认知&lt;br /&gt;
&lt;br /&gt;
* [[Fibonacci numbers]] 斐波那契数&lt;br /&gt;
&lt;br /&gt;
* [[Fractals]] 分形&lt;br /&gt;
&lt;br /&gt;
* [[Gingerbreadman map]]&lt;br /&gt;
&lt;br /&gt;
* [[Halo orbit]] Halo 轨道&lt;br /&gt;
&lt;br /&gt;
* [[List of types of systems theory]] 动力系统类型清单&lt;br /&gt;
&lt;br /&gt;
* [[Oscillation]] 振动性&lt;br /&gt;
&lt;br /&gt;
* [[Postcognitivism]]&lt;br /&gt;
&lt;br /&gt;
* [[Recurrent neural network]] 递归神经网络&lt;br /&gt;
&lt;br /&gt;
* [[Combinatorics and dynamical systems]] 组合数学和动力系统&lt;br /&gt;
&lt;br /&gt;
* [[Synergetics (Haken)|Synergetics]] 协同学(Haken)&lt;br /&gt;
&lt;br /&gt;
* [[Systemography]]&lt;br /&gt;
&lt;br /&gt;
{{div col end}}&lt;br /&gt;
&lt;br /&gt;
;Related scientists&lt;br /&gt;
&lt;br /&gt;
Related scientists&lt;br /&gt;
&lt;br /&gt;
相关科学家&lt;br /&gt;
&lt;br /&gt;
{{div col|colwidth=20em}}&lt;br /&gt;
&lt;br /&gt;
* [[People in systems and control]]&lt;br /&gt;
&lt;br /&gt;
* [[Dmitri Anosov]]&lt;br /&gt;
&lt;br /&gt;
* [[Vladimir Arnold]]&lt;br /&gt;
&lt;br /&gt;
* [[Nikolay Bogolyubov]]&lt;br /&gt;
&lt;br /&gt;
* [[Andrey Kolmogorov]]&lt;br /&gt;
&lt;br /&gt;
* [[Nikolay Mitrofanovich Krylov|Nikolay Krylov]]&lt;br /&gt;
&lt;br /&gt;
* [[Jürgen Moser]]&lt;br /&gt;
&lt;br /&gt;
* [[Yakov G. Sinai]]&lt;br /&gt;
&lt;br /&gt;
* [[Stephen Smale]]&lt;br /&gt;
&lt;br /&gt;
* [[Hillel Furstenberg]]&lt;br /&gt;
&lt;br /&gt;
* [[Grigory Margulis]]&lt;br /&gt;
&lt;br /&gt;
* [[Elon Lindenstrauss]]&lt;br /&gt;
&lt;br /&gt;
{{div col end}}&lt;br /&gt;
&lt;br /&gt;
== Notes 参考资料==&lt;br /&gt;
&lt;br /&gt;
{{reflist}}&lt;br /&gt;
&lt;br /&gt;
== Further reading 拓展阅读==&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Frederick D. |last1=Abraham |first2=Ralph |last2=Abraham |authorlink2=Ralph Abraham (mathematician)|first3=Christopher D. |last3=Shaw |title=A Visual Introduction to Dynamical Systems Theory for Psychology |url=https://books.google.com/books?id=oMbaAAAAMAAJ |year=1990 |publisher=Aerial Press |isbn=978-0-942344-09-7 |oclc=24345312}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=Edward J. |last=Beltrami |title=Mathematics for Dynamic Modeling |url=https://books.google.com/books?id=MmoiJPsuFW8C |year=1998 |publisher=Academic Press |isbn=978-0-12-085566-7 |edition=2nd |oclc=36713294}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=Otomar |last=Hájek |title=Dynamical systems in the plane |url=https://books.google.com/books?id=czhPAQAAIAAJ |year=1968 |publisher=Academic Press |oclc=343328 |authorlink=Otomar Hájek |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first=David G. |last=Luenberger |title=Introduction to dynamic systems: theory, models, and applications |url=https://books.google.com/books?id=mvlQAAAAMAAJ |year=1979 |publisher=Wiley |isbn=978-0-471-02594-8 |oclc=4195122 |authorlink=David Luenberger |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Anthony |last1=Michel |author2=Kaining Wang |author3=Bo Hu |title=Qualitative Theory of Dynamical Systems |url=https://books.google.com/books?id=ZPGBnZGV2_cC |year=2001 |publisher=Taylor &amp;amp; Francis |isbn=978-0-8247-0526-8 |oclc=45873628}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book |first1=Louis |last1=Padulo |first2=Michael A. |last2=Arbib |authorlink2=Michael A. Arbib |title=System theory: a unified state-space approach to continuous and discrete systems |url=https://books.google.com/books?id=6UPvAAAAMAAJ |year=1974 |publisher=Saunders |isbn=9780721670355 |oclc=947600 |ref=harv}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |first=Steven H. |last=Strogatz |title=Nonlinear Dynamics and Chaos: With Applications to Physics, Biology, Chemistry, and Engineering |year=1994 |publisher=Addison Wesley |isbn=978-0-7382-0453-6 |oclc=49839504 |authorlink=Steven Strogatz |ref=harv |url-access=registration |url=https://archive.org/details/nonlineardynamic00stro }}&lt;br /&gt;
&lt;br /&gt;
== External links 外部链接==&lt;br /&gt;
&lt;br /&gt;
*[https://web.archive.org/web/20080613053119/http://www.cogs.indiana.edu/Publications/techreps2000/241/241.html Dynamic Systems 动力系统] Encyclopedia of Cognitive Science entry. --[[用户:嘉树|嘉树]]（[[用户讨论:嘉树|这是一个嵌套的链接，但好像只能鼠标点击并超链接到内嵌的那个]]）认知科学百科全书&lt;br /&gt;
&lt;br /&gt;
*[http://mathworld.wolfram.com/DynamicalSystem.html Definition of dynamical system 动力系统的定义] in MathWorld. 在MathWorld.wolfram.com储存的定义&lt;br /&gt;
&lt;br /&gt;
*[http://www.dynamicalsystems.org/ DSWeb] Dynamical Systems Magazine 动力系统杂志&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Areas of mathematics | state=collapsed}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:Dynamical systems]]&lt;br /&gt;
&lt;br /&gt;
Category:Dynamical systems&lt;br /&gt;
&lt;br /&gt;
类别: 动力系统&lt;br /&gt;
&lt;br /&gt;
[[Category:Complex systems theory]]&lt;br /&gt;
&lt;br /&gt;
Category:Complex systems theory&lt;br /&gt;
&lt;br /&gt;
范畴: 复杂系统理论&lt;br /&gt;
&lt;br /&gt;
[[Category:Computational fields of study]]&lt;br /&gt;
&lt;br /&gt;
Category:Computational fields of study&lt;br /&gt;
&lt;br /&gt;
类别: 研究的计算领域&lt;br /&gt;
&lt;br /&gt;
&amp;lt;noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;small&amp;gt;This page was moved from [[wikipedia:en:Dynamical systems theory]]. Its edit history can be viewed at [[动力系统/edithistory]]&amp;lt;/small&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:待整理页面]]&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
===书籍推荐===&lt;br /&gt;
====[https://www.amazon.co.uk/Chaos-Making-Science-James-Gleick/dp/0749386061 Chaos: Making a New Science]====&lt;br /&gt;
The million-copy bestseller by National Book Award nominee and Pulitzer Prize finalist James Gleick—the author of Time Travel: A History—that reveals the science behind chaos theory。&lt;br /&gt;
Very readable, focuses on the scientists and mathematicians behind many of the key results in chaos.&lt;br /&gt;
本书由普利茨奖获得者James Gleick撰写。它是一本易读科普书籍，侧重介绍对混沌概念的发展做出重大贡献的科学家和数学家们。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://www.amazon.com/dp/0199566445/ref=cm_sw_su_dp Chaos and Fractals: An Elementary Introduction]====&lt;br /&gt;
This book provides the reader with an elementary introduction to chaos and fractals, suitable for students with a background in elementary algebra, without assuming prior coursework in calculus or physics. &lt;br /&gt;
这是一本关于混沌和分形的入门书籍。读者需要有一定的线性代数基础，但是不需要有微积分或物理学的基础。&lt;br /&gt;
&lt;br /&gt;
====[https://www.amazon.co.uk/Chaos-Very-Short-Introduction-Introductions/dp/0192853783/ref=pd_lpo_14_img_1/257-2017232-0516612?_encoding=UTF8&amp;amp;pd_rd_i=0192853783&amp;amp;pd_rd_r=eebee69a-fad3-43e3-bbeb-b883f2c59bf5&amp;amp;pd_rd_w=g6knH&amp;amp;pd_rd_wg=sx6z5&amp;amp;pf_rd_p=7b8e3b03-1439-4489-abd4-4a138cf4eca6&amp;amp;pf_rd_r=YTB0XXCR2DM8049PYP1Y&amp;amp;psc=1&amp;amp;refRID=YTB0XXCR2DM8049PYP1Y 牛津通识读本: Chaos]====&lt;br /&gt;
This book would not have been possible without my parents, of course, but I owe a greater debt than most to their faith, doubt, and hope, and to the love and patience of a, b, and c. Professionally my greatest debt is to Ed Spiegel, a father of chaos and my thesis Professor, mentor, and friend.&lt;br /&gt;
本书隶属于牛津通识读本系列。该书由Ed Spiegel的学生Leonard Smith撰写，语言生动简明。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
===集智课程推荐===&lt;br /&gt;
====[https://campus.swarma.org/course/1655 圣塔菲课程：Introduction to Dynamical Systems and Chaos]====&lt;br /&gt;
本课程中，主要介绍动力学系统和混沌系统，您将学到'''蝴蝶效应 Butterfly effect'''、'''奇异吸引子 Attractors'''等基本概念，以及如何应用于您感兴趣的领域。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====[https://campus.swarma.org/course/1641 动力系统分析]====&lt;br /&gt;
本课程主要讲授连续和离散动力系统的定态、极限环及其稳定性分析、动力学系统的结构稳定性和常见的分支类型以及分析方法，混沌概念等。&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E9%93%BE%E8%B7%AF%E9%A2%84%E6%B5%8B&amp;diff=7645</id>
		<title>链路预测</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E9%93%BE%E8%B7%AF%E9%A2%84%E6%B5%8B&amp;diff=7645"/>
		<updated>2020-05-10T14:50:56Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：/* 参考资料 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{#seo:|keywords=链路预测 Link Prediction  |description=通过已知的网络节点以及网络结构等信息，预测网络中尚未产生连边的两个节点之间产生连接的可能性。 }}&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
'''链路预测 Link Prediction'''是指如何通过已知的网络节点以及网络结构等信息，预测网络中尚未产生连边的两个节点之间产生连接的可能性。这种预测既包含了对未知链接 Existing yet unknown link，也称丢失链接 Missing link 的预测，也包含了对未来链接 Future link 的预测。&lt;br /&gt;
&lt;br /&gt;
链路预测是将复杂网络与信息科学联系起来的重要桥梁之一，它所要处理的是信息科学中最基本的问题——缺失信息的还原与预测。链路预测相关研究不仅能够推动网络科学和信息科学理论上的发展，而且具有巨大的实际应用价值，譬如可以知道蛋白质相互作用实验、进行在线社交推荐、找出交通传输网络中有特别重要作用的连边等。&lt;br /&gt;
&lt;br /&gt;
==研究方法==&lt;br /&gt;
===基于相似性的链路预测===&lt;br /&gt;
&lt;br /&gt;
*基于局部信息的相似性指标&lt;br /&gt;
&lt;br /&gt;
社会网络分析中经典的三元闭包 Triadic closure 原则指出，如果A、B	两个人拥有一个共同的朋友C，那么这两个人今后也很有可能成为朋友，从而使得3个节点构成一个闭合的三角形ABC。对于一般的网络，我们可以把这一原则推广如下：两个节点的共同邻居越多，这两个节点就越相似，从而更倾向于相互连接。最简单的基于'''共同邻居 Common neighbors''' 的节点相似性指标定义如下：&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
s_{xy}^{CN} =  |Γ(x)| \cap |Γ(y)|&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
在相似性指标定义的基础上，还可以考虑两个节点的共同邻居的相对数量。下表列出了10种基于节点局部信息的相似性指标，第1种是计算共同邻居相似度的基本公式，其中第2至7种相似性指标是直接基于共同邻居指标的不同的规范化而得到的，表中的 k(x) = |Γ(x)| 为节点x的度。第8种指标PA是基于BA无标度网络模型中新加入节点倾向于和度大的节点相连的优先连接机制而提出的。&lt;br /&gt;
&lt;br /&gt;
第9种指标AA的基本思想是度小的共同邻居节点的贡献大于度大的共同邻居节点，因此根据共同邻居节点的度为每个节点赋予一个权重值。这一点很容易理解，例如在微博中受关注较多的人往往是某个领域的专家或名人，因此共同关注他们的人之间可能并不拥有特别相似的兴趣——一个中学生和一个企业家都有可能是姚晨的粉丝。相反，如果两个人共同关注了一个粉丝很少的人（非名人），那么说明这两个人确实具有相同的兴趣爱好或者重叠的社交圈，因此有更高概率相连。又如在推荐系统中，共同购买冷门产品的两个用户往往比共同购买热门产品的用户更相似。&lt;br /&gt;
[[File:Table1.png|600px|thumb|10种基于节点局部信息的相似性指标|center]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
第2个指标Salton指标&amp;lt;ref name=&amp;quot;[2]&amp;quot;&amp;gt;Salton G, McGill M J () [https://pattern.swarma.org/paper?id=15e10152-92c8-11ea-81db-0242ac1a0005 Introduction to Modern Information Retrieval].&amp;lt;/ref&amp;gt;又称余弦相似性，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{|Γ(x)| \cap |Γ(y)|}{\sqrt{k(x)k(y)}}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第3个指标Jaccard指标&amp;lt;ref name=&amp;quot;[3]&amp;quot;&amp;gt;Jaccard P. () [https://pattern.swarma.org/paper?id=70c8a48a-92c8-11ea-9f7f-0242ac1a0005 Etude de la distribution florale dans une portion des Alpes et du Jura].&amp;lt;/ref&amp;gt;是于100多年前由Jaccard提出的，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{|Γ(x)| \cap |Γ(y)|}{|Γ(x)| \bigcup  |Γ(y)|}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第4个指标Sorensen指标&amp;lt;ref name=&amp;quot;[4]&amp;quot;&amp;gt;Sørensen, T, Sørensen, T A, Sørensen, T J (1948) [https://pattern.swarma.org/paper?id=ea7f2902-6e74-11ea-9db3-0242ac1a0005 A method of establishing groups of equal amplitude in plant sociology based on similarity of species content and its application to analyses of the vegetation on Danish commons].&amp;lt;/ref&amp;gt;常用于生态学研究，其定义为 &amp;lt;math&amp;gt;s{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{kx + ky}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第5个指标大度节点有利指标&amp;lt;ref name=&amp;quot;[5]&amp;quot;&amp;gt;E. Ravasz,A. L. Somera,D. A. Mongru,Z. N. Oltvai,A. -L. Barabasi (2002) [https://pattern.swarma.org/paper?id=6eb98b7e-6e91-11ea-81b9-0242ac1a0005 Hierarchical organization of modularity in metabolic networks].arXiv:0209244.&amp;lt;/ref&amp;gt;（Hub promoted index，HPI）被用来定量刻画新陈代谢网络中每对反应物的拓扑相似程度，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{min\{k_x,k_y\}}&amp;lt;/math&amp;gt;，由于分母只由度较小的节点决定，在此定义下可知大度节点（hub）与其他节点之间更容易具有高的相似性。&lt;br /&gt;
&lt;br /&gt;
第6个指标大度节点不利指标&amp;lt;ref name=&amp;quot;[6]&amp;quot;&amp;gt;Tao Zhou,Linyuan Lu,Yi-Cheng Zhang (2009) [https://pattern.swarma.org/paper?id=7a2b26ba-6e92-11ea-9ee2-0242ac1a0005 Predicting Missing Links via Local Information].arXiv:0901.0553.&amp;lt;/ref&amp;gt;（hub depressed index, HDI）定义与HPI相似，只是分母取两端节点度的最大值，即 &amp;lt;math&amp;gt;s_{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{max\{k_x,k_y\}}&amp;lt;/math&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
第7个指标LHN-I指标&amp;lt;ref name=&amp;quot;[7]&amp;quot;&amp;gt;E. A. Leicht,Petter Holme,M. E. J. Newman (2005) [https://pattern.swarma.org/paper?id=71890c4e-6f0e-11ea-b30e-0242ac1a0005 Vertex similarity in networks].arXiv:0510143.&amp;lt;/ref&amp;gt;是由Leicht，Holme和Newman提出，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{{k_xk_y}}&amp;lt;/math&amp;gt;，其中分母&amp;lt;math&amp;gt;k_xk_y&amp;lt;/math&amp;gt; 正比于节点&amp;lt;math&amp;gt;v_x&amp;lt;/math&amp;gt;和节点&amp;lt;math&amp;gt;v_y&amp;lt;/math&amp;gt;共同邻居数的期望值，即 &amp;lt;math&amp;gt;E( |Γ(x)| \cap |Γ(y)|)&amp;lt;/math&amp;gt;。在下面这篇文献中，Leicht等人同时提出了另一个基于路径的指标，为了有所区别，将此局部指标命名为LHN-I指标，将基于路径的指标命名为LHN-II指标：&lt;br /&gt;
&lt;br /&gt;
第8个指标PA（preferential attachment）是基于BA无标度网络模型中新加入节点倾向于和度大的节点相连的优先连接机制而提出的，在这种机制的链路预测中，每一步首先去除一条链接，然后再添加一条链接，新链接连接节点&amp;lt;math&amp;gt;v_x&amp;lt;/math&amp;gt;和&amp;lt;math&amp;gt;v_y&amp;lt;/math&amp;gt;的概率就正比于两节点度的乘积，由此可以定义两节点间的优先连接相似性：&amp;lt;math&amp;gt;s_{xy}= k_xk_y&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第9个指标AA（Adamic-Adar）&amp;lt;ref name=&amp;quot;[8]&amp;quot;&amp;gt;Adar, Adamic L A, E (2003) [https://pattern.swarma.org/paper?id=e4726a06-6f2d-11ea-8846-0242ac1a0005 Friends and neighbors on the web].Social networks.25.(211--230)&amp;lt;/ref&amp;gt;的基本思想是度小的共同邻居节点的贡献大于度大的共同邻居节点，因此根据共同邻居节点的度为每个节点赋予一个权重值。这一点很容易理解，例如在微博中受关注较多的人往往是某个领域的专家或名人，因此共同关注他们的人之间可能并不拥有特别相似的兴趣——一个中学生和一个企业家都有可能是姚晨的粉丝。相反，如果两个人共同关注了一个粉丝很少的人（非名人），那么说明这两个人确实具有相同的兴趣爱好或者重叠的社交圈，因此有更高概率相连。又如在推荐系统中，共同购买冷门产品的两个用户往往比共同购买热门产品的用户更相似。AA指标根据共同邻居节点的度为每个节点赋予一个权重值，该权重等于该节点的度的对数分之一，即AA指标的定义为：&amp;lt;math&amp;gt;s_{xy}=\sum _{z\in \Gamma (x)\bigcap \Gamma (y)}\frac{1}{logk_z}&amp;lt;/math&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
第10种指标RA是受网络资源分配过程的启发，周涛等人提出的“'''资源分配指标 Resource allocation'''”，其与AA指标有异曲同工之妙。RA和AA指标最大的区别就在于赋予共同邻居节点权重的方式不同，前者是以 1/k 的形式递减，后者是以 1/logk 的形式递减。可见，当网络的平均度较小时，RA和AA差别不大；但是当平均度较大时，就有很大的区别了。研究显示，RA指标在刻画加权网络和社区挖掘应用中的表现胜过AA指标，图灵奖得主Hopdroft的一篇论文也显示，可以利用社区等中观结构信息改进局部指标，其中RA指标改进后的效果最佳。&lt;br /&gt;
&lt;br /&gt;
*基于路径的相似性指标&lt;br /&gt;
&lt;br /&gt;
基于共同邻居的相似性指标的优势在于计算复杂度较低，但是由于使用的信息非常有限，预测精度受到限制，因此发展出了基于路径的相似性指标，主要有3个，分别是局部路径指标 Local path 、Katz指标和LHN-II指标。&lt;br /&gt;
&lt;br /&gt;
1.局部路径指标&lt;br /&gt;
&lt;br /&gt;
周涛等人在共同邻居的基础上考虑三阶路径的因素，提出了基于局部路径的相似性指标，其定义为 &amp;lt;math&amp;gt; S=A^2+\alpha A^3&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 为可调参数，A 表示网络的邻接矩阵， &amp;lt;math&amp;gt;(A^3)_{xy}&amp;lt;/math&amp;gt;表示节点 &amp;lt;math&amp;gt;V_x&amp;lt;/math&amp;gt; 和 &amp;lt;math&amp;gt;V_y&amp;lt;/math&amp;gt; 之间长度为3的路径数目。当&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; = 0时，LP指标就退化为 CN 指标。 CN 指标本质上也可看成基于路径的指标，只是它仅考虑了二阶路径数目。局部路径指标可以扩展为更高阶的情形，即考虑n阶路径的情况：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt; S^n=A^2+\alpha\cdot A^3+\alpha^2\cdot A^4+\cdots +\alpha^{n-2}\cdot A^n &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
随着 n 的增加，局部路径指标的计算复杂度越来越大。一般而言，考虑 n 阶路径的计算复杂度为O(N&amp;lt;k&amp;gt;^n)。但是当 n 趋于无穷大的时候，局部路径指标相当于考虑网络全部路径的Katz指标，此时计算量反而有可能下降，因为可转变为计算矩阵的逆&amp;lt;ref name=&amp;quot;[10]&amp;quot;&amp;gt;Linyuan Lü, Ci-Hang Jin,  Tao Zhou () [https://pattern.swarma.org/paper?id=ba461814-70a3-11ea-8026-0242ac1a0005 Similarity Index Based on Local Paths for Link Prediction of Complex Networks].&amp;lt;/ref&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
2.Katz指标&lt;br /&gt;
&lt;br /&gt;
Katz指标考虑了所有网络的路径，因此其定义为：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S_{xy}=\sum_{l=1}^{\infty }\alpha^l\cdot\left |  paths_{x,y}^{&amp;lt;l&amp;gt;} \right |= \alpha A_{xy}+\alpha^2\cdot (A^2)_{xy}+\alpha^3\cdot (A^3)_{xy}+\cdots  &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\alpha &amp;gt; 0&amp;lt;/math&amp;gt; 为控制路径权重的可调参数，&amp;lt;math&amp;gt;\left |  paths_{x,y}^{&amp;lt;l&amp;gt;} \right |&amp;lt;/math&amp;gt;表示连接节点 &amp;lt;math&amp;gt;V_x&amp;lt;/math&amp;gt;和  &amp;lt;math&amp;gt;V_y&amp;lt;/math&amp;gt; 的路径中长度为 l 的路径数。要使上述级数收敛，则参数&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 应小于邻接矩阵最大特征值的倒数，此定义还可以表示为：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S = (I - \alpha\cdot A)^{-1} - I&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
显然，当参数&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 很小时，高阶路径的贡献也较小，使得 Katz 指标的预测结果接近于局部路径指标&amp;lt;ref name=&amp;quot;[11]&amp;quot;&amp;gt;Leo Katz (1953) [https://pattern.swarma.org/paper?id=b2dee81c-70b2-11ea-b7f9-0242ac1a0005 A new status index derived from sociometric analysis].psychometrika.18.1:(39-43)&amp;lt;/ref&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
3.LHN-II指标&lt;br /&gt;
&lt;br /&gt;
LHN-II 指标是 Leicht，Holme 和 Newman 提出的另一种相似性计算方法，他的基本思想是基于'''一般等价 Regular equivalence''' 提出的。与结构等价不同，一般等价的定义更广泛。在一般等价的定义下，如果两个节点所连接的节点之间相似，那么这两个节点也相似，即使它们之间没有共同的邻居节点。&lt;br /&gt;
&lt;br /&gt;
下图给出了一个简单的例子来帮助我们理解结构等价和一般等价的区别。根据结构等价的定义，在公司A内部，由于员工a和员工b都认识员工e和员工f（即它们有两个共同邻居节点），于是称员工a和员工b是结构等价的。同理，员工e和员工f也是结构等价的，同样地，在公司B中，员工c和员工d是结构等价的，员工g和员工h也是结构等价的。现在考虑员工a和员工c是否相似？根据一般等价的定义，由于员工a连接的节点e、f与员工c连接的节点g、h分别是相似的，那么我们可以认为员工a和员工c也是相似的，同理，在一般等价的意义下，员工b和员工d也是相似。从这个例子可以看出，结构相似性或称结构等价更强调的是两个节点是否在同一个环境下，也就是说是否连接了相同的节点；然而一般等价考虑的是这两个节点是否处于同样的角色，即使他们没有相同的邻居节点，但是由于各自的邻居节点之间本身相似，这两个节点也相似。一般等价意义下的相似性是LHN-II指标的核心。&lt;br /&gt;
&lt;br /&gt;
[[File:一般等价和结构等价示例.png|600px|thumb|一般等价和结构等价示例（图中实线表示连接，虚线表示相似关系）|center]]&lt;br /&gt;
&lt;br /&gt;
从一般等价的角度考虑，LHN-II指标认为如果两个节点的邻居节点之间是相似的，那么这两个节点也是相似的。它与Katz指标的区别主要是把Katz指标中的&amp;lt;math&amp;gt; (A^{n})_{xy} &amp;lt;/math&amp;gt;变成 &amp;lt;math&amp;gt;  (A^{n})_{xy}&amp;lt;/math&amp;gt; 的期望值，注意到 &amp;lt;math&amp;gt; (A^{n})_{xy}&amp;lt;/math&amp;gt; 的期望值为 &amp;lt;math&amp;gt; E\left [ (A^l)_{xy} \right ]=\frac{k_xk_y}{M}\lambda _1^{l-1}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\lambda_1&amp;lt;/math&amp;gt;为矩阵A的最大特征值，则LHN-II指标的表达式如下：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 S_{xy}^{LHN2}=\delta _{xy} + \sum_{l=1}^{\infty }\Phi ^l \frac{(A^l)_{xy}}{E\left [ (A^l)_{xy} \right ]}&lt;br /&gt;
=\delta _{xy} + \frac{2M}{k_xk_y}\sum_{l=1}^{\infty }\Phi ^l\lambda _1^{1-l}(A^l)_{xy}&lt;br /&gt;
=\left [ 1 - \frac{2 M \lambda_1}{k_xk_y} \right ]\delta _{xy} + \frac{2 M \lambda_1}{k_xk_y}\left [ (I-\frac{\Phi}{\lambda_1} A )^{-1} \right ]_{xy}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\delta _{xy}&amp;lt;/math&amp;gt;为 Kronecker &amp;lt;math&amp;gt;\delta&amp;lt;/math&amp;gt; 函数，&amp;lt;math&amp;gt; \Phi&amp;lt;/math&amp;gt; 为取值小于1的参数。上式最后一个等式的第一项是可以去掉的对角阵，从而相似性矩阵可以写为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S=2M\lambda_1D^{-1}(I-\frac{\Phi A}{\lambda_1})^{-1}D^{-1}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中''D''为度值矩阵，&amp;lt;math&amp;gt;D_{xy} = \delta_{xy} \cdot k_{x}&amp;lt;/math&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
*基于随机游走的节点相似性指标&lt;br /&gt;
&lt;br /&gt;
还有相当数量的相似性指标是基于随机游走过程定义的，包括'''平均通勤时间 Average commute time''' 、'''Cos+指标'''、'''有重启的随机游走 Random walk with restart'''、'''SimRank'''指标、'''局部随机游走指标 Local random walk''' 和'''有叠加效应的随机游走指标 Superposed random walk'''等。&lt;br /&gt;
&lt;br /&gt;
1.平均通勤时间 ACT &amp;lt;ref name=&amp;quot;[12]&amp;quot;&amp;gt;D. J. Klein,M. Randić (1993) [https://pattern.swarma.org/paper?id=b5177044-70c7-11ea-b241-0242ac1a0005 Resistance distance].journal of mathematical chemistry.12.1:(81-95)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
设&amp;lt;math&amp;gt;m(x,y)&amp;lt;/math&amp;gt; 为一个随机粒子从节点x到节点y平均需要走的步数，那么节点x和y的平均通勤时间定义为：&amp;lt;math&amp;gt;n(x , y) = m(x , y) + m(y , x) &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其数值解可通过求该网络拉普拉斯矩阵&amp;lt;math&amp;gt;L&amp;lt;/math&amp;gt; 的伪逆&amp;lt;math&amp;gt; L^+&amp;lt;/math&amp;gt; 获得，即 &amp;lt;math&amp;gt;n(x,y)=M(l^+_{xx} +l^+_{yy} - 2l^+_{xy})&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;l^{+}_{xy}&amp;lt;/math&amp;gt;表示矩阵&amp;lt;math&amp;gt;L^+ &amp;lt;/math&amp;gt;中相应位置的元素。如果两个节点的平均通勤时间越小，那么两个节点越进阶。由此，定义基于ACT的相似性为（在此可忽略常数M）&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{ACT}=\frac{1}{l^+_{xx} +l^+_{yy} - 2l^+_{xy}}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
2.余弦相似性指标 Cos+指标&amp;lt;ref name=&amp;quot;[13]&amp;quot;&amp;gt;Fouss F, Pirotte A, Renders J M (2007) [https://pattern.swarma.org/paper?id=f3ce12c4-70c8-11ea-8ff9-0242ac1a0005 Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation].IEEE Transactions on knowledge and data engineering.19.(355-369)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
在由向量&amp;lt;math&amp;gt;v_x = \Lambda ^{1/2}U^{T}e_{x}&amp;lt;/math&amp;gt;展开的欧式空间内，&amp;lt;math&amp;gt;L^+ &amp;lt;/math&amp;gt;中的元素&amp;lt;math&amp;gt;l^{+}_{xy}&amp;lt;/math&amp;gt;可表示为两向量&amp;lt;math&amp;gt;v_x&amp;lt;/math&amp;gt;和&amp;lt;math&amp;gt;v_y&amp;lt;/math&amp;gt;的内积，即&amp;lt;math&amp;gt; l^{+}_{xy} = v_{x}^{T} v_y&amp;lt;/math&amp;gt;，其中&amp;lt;math&amp;gt;U&amp;lt;/math&amp;gt;是一个标准正交矩阵，由&amp;lt;math&amp;gt;L^+&amp;lt;/math&amp;gt;特征向量按照对应的特征根从大到小排列，&amp;lt;math&amp;gt;\Lambda&amp;lt;/math&amp;gt;为以特征根为对角元素的对角矩阵，&amp;lt;math&amp;gt;e_{x}&amp;lt;/math&amp;gt; 表示一个一维向量且只有第x个元素为1，其他都为0。由此定义余弦相似性如下：&lt;br /&gt;
&lt;br /&gt;
s_{xy}^{cos+}=cos(x,y)^+=\frac{l_{xy}^+}{\sqrt{l^+_{xx} \cdot l^+_{yy}}}&lt;br /&gt;
&lt;br /&gt;
3.重启的随机游走 RWR&amp;lt;ref name=&amp;quot;[14]&amp;quot;&amp;gt;Brin, S, Page, L (1998) [https://pattern.swarma.org/paper?id=15405998-70ca-11ea-b1b5-0242ac1a0005 The anatomy of a large-scale hypertextual web search engine].&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
这个指标可以看成是PageRank 算法的拓展应用。它假设随机游走粒子在每走一步的时候都以一定概率返回初始位置。设粒子返回概率为 1-c，&amp;lt;math&amp;gt;P&amp;lt;/math&amp;gt; 为网络的马尔科夫概率转移矩阵，其元素 &amp;lt;math&amp;gt;P_{xy} = a_{xy}/k_{x} &amp;lt;/math&amp;gt;表示节点x处的粒子下一步走到节点y的概率。其中如果节点x和节点y相连，则&amp;lt;math&amp;gt;a_{xy}=1&amp;lt;/math&amp;gt;，否则&amp;lt;math&amp;gt;a_{xy}=0&amp;lt;/math&amp;gt;。某一粒子初始时刻在节点x处，那么t+1时刻该粒子到达网络各个节点的概率向量为&lt;br /&gt;
&amp;lt;math&amp;gt;q_{x}(t+1) = c \cdot P^{T}q_{x}(t) + (1-c) e_{x}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;e_{x}&amp;lt;/math&amp;gt;表示初始状态（其定义与Cos+中相同），上式的稳态解为&amp;lt;math&amp;gt;q_{x} = (1-c)(I-cP^{T})^{-1}e_{x}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中元素&amp;lt;math&amp;gt;q_{xy}&amp;lt;/math&amp;gt;为从节点x出发的粒子最终有多少概率走到节点y。由此定义RWR相似性如下：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{RWR} = q_{xy} + q_{yx} &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
4.SimRank指标 SimR&amp;lt;ref name=&amp;quot;[15]&amp;quot;&amp;gt;Jeh G, Widom J. SimRank (2002) [https://pattern.swarma.org/paper?id=593e78e0-70cb-11ea-9743-0242ac1a0005 a measure of structural-context similarity].(538-543)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
它的基本假设是，如果两节点所连接的节点相似，那么这两个节点就相似。其自洽定义式为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{simR}=C\frac{\sum_{v_z\in \Gamma (x)}\sum_{{v_z}'\in \Gamma (y)}s_{zz'}^{simR}}{k_xk_y}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中假定 &amp;lt;math&amp;gt;s_{xx} =1, C \in [0,1] &amp;lt;/math&amp;gt;为相似性传递时的衰减参数。&lt;br /&gt;
&lt;br /&gt;
SimR指标同时考虑了结构等价和一般等价。当节点x的邻居z同时也是节点y的邻居时，该指标考虑了结构等价；当节点x不等于节点y时，该指标概率了一般等价。可以证明，SimR指标可以用来描述两个分别从节点x和y出发的粒子平均过多久会相遇。&lt;br /&gt;
&lt;br /&gt;
5.局部随机游走指标 LRW&amp;lt;ref name=&amp;quot;[16]&amp;quot;&amp;gt;Weiping Liu,Linyuan Lu (2010) [https://pattern.swarma.org/paper?id=98d1a08e-70eb-11ea-a520-0242ac1a0005 Link Prediction Based on Local Random Walk].arXiv:1001.2467.89.(58007)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
上述4种随机游走指标是基于全局的随机游走，这类指标往往计算复杂度很高，因此很难在大规模网络上应用。刘伟平和吕琳媛提出了一种基于网络局部随机游走的相似性指标LRW，它只考虑有限步数的随机游走过程。一个粒子 t 时刻从节点x出发，定义&amp;lt;math&amp;gt;π_{xy} (t) &amp;lt;/math&amp;gt;为 t+1 时刻这个粒子正好走到节点y的概率，那么可得到系统演化方程：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\pi_{x} (t + 1) = P^T\pi_{x}(t)，t=0,1,…&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\pi_{x}(0) &amp;lt;/math&amp;gt;为一个&amp;lt;math&amp;gt;Nx1 &amp;lt;/math&amp;gt;的向量，只有第x 个元素为1，其他为0，即&amp;lt;math&amp;gt;\pi_{x}(0) =e_x&amp;lt;/math&amp;gt;。设定各个节点的初始资源分布为&amp;lt;math&amp;gt;q_x&amp;lt;/math&amp;gt;，那么基于t步随机游走的相似性为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{LRW} = q_{xy} + q_{yx}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
6.叠加的局部随机游走指标 SRW&amp;lt;ref name=&amp;quot;[16]&amp;quot;&amp;gt;Weiping Liu,Linyuan Lu (2010) [https://pattern.swarma.org/paper?id=98d1a08e-70eb-11ea-a520-0242ac1a0005 Link Prediction Based on Local Random Walk].arXiv:1001.2467.89.(58007)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
这个指标给邻近目标节点的点更多的机会与目标节点相连，充分考虑了很多真实网络连接上的局域性特点，它是在LRW的基础上，将t步及其以前的结果加总，便得到SRW的值，即：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{SRW}(t)=\sum_{t}^{l=1}s_{xy}^{LRW}(l) = q_x\sum_{t}^{l=1}\pi_{xy}(l) + q_y\sum_{t}^{l=1}\pi_{yx}(l)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===基于似然分析的链路预测===&lt;br /&gt;
&lt;br /&gt;
基于相似性的链路预测方法，是最简单的一种分析框架，除此之外，还有另一种最复杂的链路预测分析框架——基于似然分析的链路预测。这个框架本身远远复杂于基于相似性的框架，而且框架中的每一个组成成分自身都非常复杂，但这个框架下衍生出的算法除了给出链路预测的结果之外，还给出了我们对于网络结构的深刻洞见，例如“'''层次结构模型 Hierachical structure model'''”给出了网路层次组织形态的定量刻画，“'''随机分块模型 Stochastic block model'''”类似于社区分解一样把网络划分成了若干子块。这些对理解网络结构特征方面的贡献，是基于相似性的框架所不能提供的。&lt;br /&gt;
&lt;br /&gt;
基于似然分析的链路预测的基本思路是：根据网络结构的产生和组织方式以及目前已经观察到的链路计算网络的似然值，并认为真实的网络使得网络似然值最大，然后再根据网络似然最大化计算每一对未连接的节点产生连边的可能性。&lt;br /&gt;
&lt;br /&gt;
*层次结构模型 HSM&amp;lt;ref name=&amp;quot;[17]&amp;quot;&amp;gt;Aaron Clauset,Cristopher Moore,M. E. J. Newman (2008) [https://pattern.swarma.org/paper?id=1ca0e946-70ed-11ea-82c3-0242ac1a0005 Hierarchical structure and the prediction of missing links in networks].arXiv:0811.0484.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
层次结构模型假设真实的网络都存在某种层次性，网络的连接则可看作是这种内在层次结构的反映。该方法的计算步骤如下：&lt;br /&gt;
&lt;br /&gt;
1.一个N个节点的网络可以用一个包含N个叶子节点的族谱树表示，这N个叶子节点将由N-1个非叶子节点连接起来，其中每个非叶子节点都有一个概率值，则两个叶子节点连接的概率就等于他们最近共同祖先节点的概率值。给定一个族谱树，将网络的似然值最大化，就可以得到非叶子节点的概率值，并由此计算出这一个族谱树所对应的网络最大的似然值。&lt;br /&gt;
&lt;br /&gt;
2.使用马尔科夫链蒙特卡洛方法对网络不同的族谱树进行抽样，使得每个族谱树出现的频次正比于该树对应的最大的网络似然值。两个节点连边的概率就等于所有抽样出来的族谱树中两个节点连边概率的平均值。注意似然高的族谱树会出现多次，因此对这个平均概率的贡献也大。&lt;br /&gt;
&lt;br /&gt;
3.把平均连边概率看做是相似性框架中的相似性指标&amp;lt;math&amp;gt;s_{xy}&amp;lt;/math&amp;gt;，按照这个值从大到小排序，排在前面的就是预测的连边。&lt;br /&gt;
&lt;br /&gt;
需要指出的是，层次结构模型在处理具有明显层次结构的网络（如恐怖袭击网络和草原食物链）时具有较高的精确度，但在处理一般性网络时效果并不一定突出。&lt;br /&gt;
&lt;br /&gt;
*随机分块模型 SBM&lt;br /&gt;
&lt;br /&gt;
与层次结构模型的思想类似，随机分块模型假设网络中的节点可以被分为若干集合，两个节点间连接的概率只与相应的集合有关。换句话说，同一个群众所有节点的地位是相同的。随机分块模型特别适合刻画节点所属群的成员身份对于其连接行为有关键影响的情况，例如，著名的“角色模型”就包含了随机分块模型的理念。&amp;lt;ref name=&amp;quot;[18]&amp;quot;&amp;gt;Roger Guimerà,Marta Sales-Pardo,Luís A. N. Amaral (2006) [https://pattern.swarma.org/paper?id=aa2a88c0-7107-11ea-a3cf-0242ac1a0005 Classes of complex networks defined by role-to-role connectivity profiles].nature physics.3.1:(63-69)&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;[19]&amp;quot;&amp;gt;Joerg Reichardt,Douglas R. White (2007) [https://pattern.swarma.org/paper?id=f20b0e20-7108-11ea-9e3d-0242ac1a0005 Role models for complex networks].arXiv:0708.0958.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
随机分块模型的效果要好于层次结构模型。同时，该方法还可以剔除网络的错误连边，如纠正蛋白质相互作用网络中的错误连边。&lt;br /&gt;
&lt;br /&gt;
*闭路模型 Loop model&amp;lt;ref name=&amp;quot;[20]&amp;quot;&amp;gt;吕琳媛,Xiaolong Ren,周涛 (2016) [https://pattern.swarma.org/paper?id=f5d29350-710a-11ea-9346-0242ac1a0005 网络链路预测：概念与前沿].&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
似然分析的更一般的框架是：给定一个网络系统，特定网络哈密顿量的负指数被统计分配函数归一化后，就得到这个网络出现的似然，一条未被观察到的连边存在的可能性就等于添加这条连边后网络的似然值。闭路模型考虑网络结构形成中的“局部性原则”，并由此定义了网络的哈密顿量。实验表明，闭路模型的预测精度大于层次结构模型和随机分块模型。&lt;br /&gt;
&lt;br /&gt;
===基于机器学习的链路预测===&lt;br /&gt;
&lt;br /&gt;
用机器学习的思路进行链路预测，主要分为基于特征分类方法、基于概率图模型方法和基于矩阵分解方法三大类。&lt;br /&gt;
&lt;br /&gt;
*基于特征分类方法&amp;lt;ref name=&amp;quot;[21]&amp;quot;&amp;gt;Al Hasan, M, Chaoji, V, Salem, S (2006) [https://pattern.swarma.org/paper?id=0cae2084-710c-11ea-bbd8-0242ac1a0005 Link prediction using supervised learning].counter-terrorism and security..30.(798--805)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
网络中的链路预测问题可以看成机器学习中的分类问题，其中每个数据点对应一对节点之间关系的标记，假定两个节点之间存在连边，则数据点的值为+1，否则为-1。特征选取是分类问题中最重要的问题之一，目前研究较多的主要包括基于节点与边的属性特征和基于节点所处网络的拓扑结构特征（如CN、AA、Katz、最短路径）等。哈桑 Hasan 等人提取合著网络中科学家研究领域的关键词作为特征，用监督学习中一些常用的分类算法（如决策树、K近邻法、多层感知器、支持向量机、径向基网络）对缺失的连边进行较为精准的预测，其中以支持向量机方法表现最佳。&lt;br /&gt;
&lt;br /&gt;
*基于概率图模型&amp;lt;ref name=&amp;quot;[22]&amp;quot;&amp;gt;Backstrom, L, Leskovec, J (2011) [https://pattern.swarma.org/paper?id=8ccaa454-710c-11ea-9eeb-0242ac1a0005 Supervised random walks: predicting and recommending links in social networks].Proceedings of the fourth ACM international conference on Web search and data mining.(635--644)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
基于概率图模型的链路预测方法使用图模型来表达节点之间的连边概率，根据模型中概率依赖关系，可分为有向无环的贝叶斯网络和无向的马尔科夫网络。随机分块模型和层次结构模型分别是典型的基于贝叶斯网络和基于马尔科夫网络的链路预测方法。基于概率图模型的链路预测方法有很多，典型的还有有监督随机游走链路预测算法，将网络结构信息与节点和连边的属性信息结合起来，给每条边分配不同的转移概率。与其他有监督的机器学习方法相比，该算法无须知道网络的特征和相关的领域知识。&lt;br /&gt;
&lt;br /&gt;
*基于矩阵分解&lt;br /&gt;
&lt;br /&gt;
基于矩阵分解的链路预测方法是基于网络邻接矩阵的代数谱变换而得到的方法，来预测网络中链路的存在性和链路的权值&amp;lt;ref name=&amp;quot;[23]&amp;quot;&amp;gt;Kunegis, J, Lommatzsch, A (2009) [https://pattern.swarma.org/paper?id=2908af64-710d-11ea-b513-0242ac1a0005 Learning spectral graph transformations for link prediction].Proceedings of the 26th Annual International Conference on Machine Learning.(561--568)&amp;lt;/ref&amp;gt;。相比其他几种机器学习方法，该方法要学习的参数少很多，但计算复杂度较高。链路预测问题可以视为邻接矩阵填充问题，并可以通过双线性回归模型将节点和链路的显特征和隐特征结合起来用矩阵分解方法解决&amp;lt;ref name=&amp;quot;[24]&amp;quot;&amp;gt;Menon A K, Elkan, C (2011) [https://pattern.swarma.org/paper?id=7f0ab830-710d-11ea-9143-0242ac1a0005 Link prediction via matrix factorization].(437--452)&amp;lt;/ref&amp;gt;。边缘去噪模型将根据给定关系矩阵求未知边或丢失边的问题变成一个矩阵降噪去噪问题&amp;lt;ref name=&amp;quot;[25]&amp;quot;&amp;gt;Chen, Z, Zhang, W. (2014) [https://pattern.swarma.org/paper?id=d925d57a-710d-11ea-90c5-0242ac1a0005 A marginalized denoising method for link prediction in relational data].Proceedings of the 2014 SIAM International Conference on Data Mining. Society for Industrial and Applied Mathematics.(298--306)&amp;lt;/ref&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
关于不同的链路预测研究方法的分类可以参考下表：&lt;br /&gt;
[[File:Link preditction method.png|600px|thumb|三类不同的链路预测方法（*表示该方法含有参数）|center]]&lt;br /&gt;
&lt;br /&gt;
==应用场景==&lt;br /&gt;
链路预测有着广泛的应用场景：在生物领域，利用蛋白质间相互作用关系的结构信息进行链路预测，可以为实验的测定提前提供参考依据，从而降低实验成本、提高成功率；在社交网络领域，链路预测可以对社交网络中的好友关系、朋友推荐进行预测，从而提高用户对社交网站的体验满意度和使用黏性；在电子商务领域，除了传统的协同过滤推荐算法外，利用网络结构信息（如网络三角形结构）等特征进行商品推荐也取得了显著的优势；此外，通过识别隐藏的链边或异常的链边对信息不完全或含有噪音的网络进行重构，可以提高网络的传输能力，这对于航空网络重构有很大的启发意义。&lt;br /&gt;
[[File:Figure2.png|400px|thumb|链路预测应用场景示意图（图片来自网络）|center]]&lt;br /&gt;
&lt;br /&gt;
除此之外，链路预测的算法和思想通过一些变换还可以用来解决一些看似没有太大关系的问题。例如，对疾病信号和股票指数的预测。基于链路预测的思想和方法，我们还可以设计基于节点相似性的社团划分以及对网络演化模型的定量化评估方法。链路预测还可以帮助提高节点标签预测的精度，特别是在已知标签节点稀疏的情况下效果显著。这一方法可以应用于判断一篇学术论文的类型，判断一本书的政治态度（中立、自由派或保守派），或者判断一个手机用户是否产生了更换电信运营商的念头。&lt;br /&gt;
&lt;br /&gt;
==代表人物==&lt;br /&gt;
*'''吕琳媛'''&lt;br /&gt;
吕琳媛主要研究方向为复杂网络信息挖掘领域，包括海量信息导航、挖掘、推荐和预测。目前担任阿里巴巴复杂科学研究中心副主任，中欧联合实验室执行主任，中国工业与应用数学学会复杂网络与系统控制专业委员会委员，杭州市特聘专家。&lt;br /&gt;
[[File:Lvlinyuan.png|400px|thumb|吕琳媛，阿里巴巴复杂科学研究中心副主任|center]]&lt;br /&gt;
&lt;br /&gt;
近年来主持/参与国家级项目5项（2016年获得国家自然科学基金优秀青年基金），省部级项目4项，横向课题4项。 在相关领域发表学术论文 50余篇，其中SCI论文39篇，总影响因子122，发表期刊包括Physics Reports，PNAS，Nature Communications等国际知名学术期刊。三篇论文入选ESI全球Top-1%高引用论文，论文SCI引用1200余次，谷歌学术引用3000余次，其中9篇论文引用超过100次。2013年出版学术专著《链路预测》获得第四届中国大学出版社图书奖优秀学术著作一等奖。申请发明专利12项。2015年荣获浙江省杰出青年基金，2014年荣获中国计算机学会自然科学二等奖，中国网络科学论坛青年希望奖，首届CCF-腾讯犀牛鸟基金优秀奖。&lt;br /&gt;
&lt;br /&gt;
*'''周涛'''&lt;br /&gt;
周涛主要从事复杂性科学和大数据挖掘算法和应用研究，先后攻克推荐系统准确性-多样性困境、复杂网络链路可预测性、H指数-度-核心度关系等图挖掘领域的重要难题，成果发表在PNAS, Nature Communications, Physics Reports, KDD和ICDM等国际顶尖期刊和会议上。目前论文google总引用超过14000次，其中8篇论文入选ESI高引用论文，H指数为57，2014和2015连续两年入选Elsevier最具国际影响力中国科学家名单。&lt;br /&gt;
[[File:Zhoutao.png|400px|thumb|周涛，第十二届中国青年科技奖|center]]&lt;br /&gt;
&lt;br /&gt;
因其在科学研究上的杰出表现，2011年获得第十二届中国青年科技奖（最年轻获奖者），2011年入选四川省“百人计划”，2012年获得国家首批优秀青年科学基金资助，2013年入选国家“万人计划”首批青年拔尖人才支持计划，2014年获得四川省科技进步一等奖、中国计算机学会自然科学奖，2015年获得共青团中央授予的“最美青年科技工作者”称号，并与屠呦呦等七名个人和北斗导航等三个团队共同当选2015年度中国十大科技创新人物。&lt;br /&gt;
&lt;br /&gt;
*'''马克·纽曼 Mark Newman'''&lt;br /&gt;
Newman是一名英裔美国物理学家，也是密歇根大学 University of Michigan 物理学系的阿纳托尔·拉波特 Anatol Rapoport 杰出教授，也是圣达菲研究所 Santa Fe Institute 的外部教员。他因在复杂网络和复杂系统领域的基础性贡献而闻名，为此他被授予2014年拉格朗日奖。&lt;br /&gt;
[[File:Newman.png|400px|thumb|Mark Newman，密歇根大学物理学系阿纳托尔·拉波特杰出教授|center]]&lt;br /&gt;
&lt;br /&gt;
Newman以其对复杂网络的研究而著称，尤其是在科学家的协作模式，随机图论 Random graph theory，社区结构 Community structure，渗流理论 Percolation theory 和网络流行病学 Network epidemiology方面的工作。他作为共同发明人，与迈克尔·卡斯特 Michael Gastner 一起，发明了一种可以产生密度均衡地图 Density-equalizing maps 或统计地图 Cartograms的方法，该方法构成了Worldmapper网站的基础。他们的工作在2004年美国总统大选后受到关注，成为了当时被广泛传播的一种选举结果地图的基础，（他们）根据各州的人口数调整了州的规模，以便更准确地了解每个党派的选民投票人数。&lt;br /&gt;
&lt;br /&gt;
*'''克里斯托弗·大卫·摩尔 Cristopher David Moore'''&lt;br /&gt;
克里斯托弗·大卫·摩尔 Cristopher David Moore，也称为克里斯·摩尔 Cris Moore 是美国计算机科学家，数学家和物理学家。他是圣达菲研究所的驻校教师，曾任新墨西哥大学 University of New Mexico 的正教授。&lt;br /&gt;
[[File:Cristopher_David_Moore.png|400px|thumb|Cristopher David Moore，圣达菲研究所的驻校教师|center]]&lt;br /&gt;
&lt;br /&gt;
1993年，Moore 发现了一种新颖的解决三体问题的方法，表明在牛顿力学中，三个等质量的物体有可能沿着一条八字形曲线、在同一条轨道相互跟随。Moore 在网络科学领域也很活跃，在该领域有许多著名的出版物。在与Clauset和Mark Newman的合作中，Moore开发了复杂网络的层次聚类概率模型，并表明他们的模型可以在面对网络连接结构发生变化时可靠地预测聚类结果。&lt;br /&gt;
&lt;br /&gt;
*'''亚伦·克劳斯特 Aaron Clauset '''&lt;br /&gt;
Aaron Clauset是一位美国计算机科学家，致力于网络科学，机器学习和复杂系统领域。目前，他在科罗拉多大学博尔德分校 University of Colorado Boulder 教授计算机科学，也是圣菲研究所的外部教员。&lt;br /&gt;
[[File:Aaron_Clauset.png|400px|thumb|  Aaron Clauset，圣菲研究所的外部教员|center]]&lt;br /&gt;
&lt;br /&gt;
Clauset因与Cosma Shalizi和Mark Newman进行的合作研究而闻名，他们针对经验数据中是否存在幂律模式开发了严格的统计检验，并且证明了许多宣称符合幂律分布的网络实际上并不是幂律分布。他还因开发检测复杂网络中的社区结构算法的工作而著称，特别是和Newman、Moore合作发展的网络层次聚类模型。在其他方面，Clauslet 与麦克斯韦·扬 Maxwell Young 、克里斯蒂安·斯克雷德·格莱蒂奇 Kristian Skrede Gleditsch 共同完成了一些独特发现：世界范围内恐怖事件发生的频率和严重性服从幂律分布。&lt;br /&gt;
&lt;br /&gt;
2015年，Clauset 因开发和评估一种网络结构特征的新方法而获得了美国国家科学基金会颁发的著名的CAREER奖。2016年，Clauset因在网络结构方面（包括Internet映射，推断缺失链接和社区结构），以及对人类冲突和社会分层所做的启发性分析方面做出的贡献而获得网络科学学会颁发的网络科学领域的Erdös-Rényi奖。&lt;br /&gt;
&lt;br /&gt;
==参考资料==&lt;br /&gt;
*汪小帆,李翔,陈关荣.《网络科学导论》.北京：高等教育出版社,2012年：178-186&lt;br /&gt;
*吕琳媛,周涛.《链路预测》.北京：高等教育出版社,2013年：57-93&lt;br /&gt;
*吕琳媛,任晓龙,周涛.《网络链路预测：概念与前沿》[J].《中国计算机学会通讯》,2016年,第4期&lt;br /&gt;
*Link Prediction Group 网站：http://www.linkprediction.org/&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
*链接预测可用于分析网络将如何发展，或者在给定信息不完整情况下来发现“丢失”的链接，对于这个问题，有研究者提出了一种新的，结合广义群贴近度中心性和半值相互作用指数的拟局部方法（即考虑半径k内节点的方法），详见 [https://swarma.org/?p=18249 《链路预测的博弈算法》]&lt;br /&gt;
[[File:链路预测的博弈算法.jpg|400px|thumb|[https://swarma.org/?p=18249 《链路预测的博弈算法》]|center]]&lt;br /&gt;
*深度学习已经成功地在图像识别、语音识别、自然语言处理、游戏与博弈等领域取得了突飞猛进的发展，并渗透到了我们的日常生活中。那么，我们有没有可能将这种技术借剪到复杂网 络的研究之中呢？近年来，人们凭借着网络嵌入（Network Embedding）、图卷积神经网络（Graph Convolutional Neural Network）、图注意力模型（Graph Attention Network）等新技术，已经开发了若干图结构上的深度学习算法，并取得了一定的成功应用。北师大系统科学学院教授、博导张江老师亲授[https://campus.swarma.org/play/coursedetail?id=10504 《当复杂网络遇上机器学习》]，将对这些算法以及应用，包括各式各样的网络嵌入算法、节点分类问题、链路预测问题、图分类问题、网络动力学预测问题等做一简单介绍，并对网络上的深度学习问题进行了展望。&lt;br /&gt;
[[File:当复杂网络遇上机器学习.png|400px|thumb|[https://campus.swarma.org/play/coursedetail?id=10504 《当复杂网络遇上机器学习》]|center]]&lt;br /&gt;
*网络上的注意力模型（Graph Attention Model）是一种通用的网络嵌入算法，它能够在节点分类、链路预测等问题上得到极高的精度。它可以模仿一个机器头对网络中的节点进行信息读取和分析，然后将综合的结果放到节点的向量中的过程。[https://campus.swarma.org/play/coursedetail?id=10385 《网络上的注意力模型》]课程将详细介绍这一模型及其应用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''''本中文词条由[[用户:木子二月鸟|木子二月鸟]]用户参与编译，  [[用户: 苏格兰| 苏格兰]]用户审校，欢迎在讨论页面留言'''''。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''本词条内容源自wikipedia及公开资料，遵守 CC3.0协议。'''&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E9%93%BE%E8%B7%AF%E9%A2%84%E6%B5%8B&amp;diff=7644</id>
		<title>链路预测</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E9%93%BE%E8%B7%AF%E9%A2%84%E6%B5%8B&amp;diff=7644"/>
		<updated>2020-05-10T14:49:43Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：/* 基于机器学习的链路预测 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{#seo:|keywords=链路预测 Link Prediction  |description=通过已知的网络节点以及网络结构等信息，预测网络中尚未产生连边的两个节点之间产生连接的可能性。 }}&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
'''链路预测 Link Prediction'''是指如何通过已知的网络节点以及网络结构等信息，预测网络中尚未产生连边的两个节点之间产生连接的可能性。这种预测既包含了对未知链接 Existing yet unknown link，也称丢失链接 Missing link 的预测，也包含了对未来链接 Future link 的预测。&lt;br /&gt;
&lt;br /&gt;
链路预测是将复杂网络与信息科学联系起来的重要桥梁之一，它所要处理的是信息科学中最基本的问题——缺失信息的还原与预测。链路预测相关研究不仅能够推动网络科学和信息科学理论上的发展，而且具有巨大的实际应用价值，譬如可以知道蛋白质相互作用实验、进行在线社交推荐、找出交通传输网络中有特别重要作用的连边等。&lt;br /&gt;
&lt;br /&gt;
==研究方法==&lt;br /&gt;
===基于相似性的链路预测===&lt;br /&gt;
&lt;br /&gt;
*基于局部信息的相似性指标&lt;br /&gt;
&lt;br /&gt;
社会网络分析中经典的三元闭包 Triadic closure 原则指出，如果A、B	两个人拥有一个共同的朋友C，那么这两个人今后也很有可能成为朋友，从而使得3个节点构成一个闭合的三角形ABC。对于一般的网络，我们可以把这一原则推广如下：两个节点的共同邻居越多，这两个节点就越相似，从而更倾向于相互连接。最简单的基于'''共同邻居 Common neighbors''' 的节点相似性指标定义如下：&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
s_{xy}^{CN} =  |Γ(x)| \cap |Γ(y)|&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
在相似性指标定义的基础上，还可以考虑两个节点的共同邻居的相对数量。下表列出了10种基于节点局部信息的相似性指标，第1种是计算共同邻居相似度的基本公式，其中第2至7种相似性指标是直接基于共同邻居指标的不同的规范化而得到的，表中的 k(x) = |Γ(x)| 为节点x的度。第8种指标PA是基于BA无标度网络模型中新加入节点倾向于和度大的节点相连的优先连接机制而提出的。&lt;br /&gt;
&lt;br /&gt;
第9种指标AA的基本思想是度小的共同邻居节点的贡献大于度大的共同邻居节点，因此根据共同邻居节点的度为每个节点赋予一个权重值。这一点很容易理解，例如在微博中受关注较多的人往往是某个领域的专家或名人，因此共同关注他们的人之间可能并不拥有特别相似的兴趣——一个中学生和一个企业家都有可能是姚晨的粉丝。相反，如果两个人共同关注了一个粉丝很少的人（非名人），那么说明这两个人确实具有相同的兴趣爱好或者重叠的社交圈，因此有更高概率相连。又如在推荐系统中，共同购买冷门产品的两个用户往往比共同购买热门产品的用户更相似。&lt;br /&gt;
[[File:Table1.png|600px|thumb|10种基于节点局部信息的相似性指标|center]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
第2个指标Salton指标&amp;lt;ref name=&amp;quot;[2]&amp;quot;&amp;gt;Salton G, McGill M J () [https://pattern.swarma.org/paper?id=15e10152-92c8-11ea-81db-0242ac1a0005 Introduction to Modern Information Retrieval].&amp;lt;/ref&amp;gt;又称余弦相似性，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{|Γ(x)| \cap |Γ(y)|}{\sqrt{k(x)k(y)}}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第3个指标Jaccard指标&amp;lt;ref name=&amp;quot;[3]&amp;quot;&amp;gt;Jaccard P. () [https://pattern.swarma.org/paper?id=70c8a48a-92c8-11ea-9f7f-0242ac1a0005 Etude de la distribution florale dans une portion des Alpes et du Jura].&amp;lt;/ref&amp;gt;是于100多年前由Jaccard提出的，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{|Γ(x)| \cap |Γ(y)|}{|Γ(x)| \bigcup  |Γ(y)|}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第4个指标Sorensen指标&amp;lt;ref name=&amp;quot;[4]&amp;quot;&amp;gt;Sørensen, T, Sørensen, T A, Sørensen, T J (1948) [https://pattern.swarma.org/paper?id=ea7f2902-6e74-11ea-9db3-0242ac1a0005 A method of establishing groups of equal amplitude in plant sociology based on similarity of species content and its application to analyses of the vegetation on Danish commons].&amp;lt;/ref&amp;gt;常用于生态学研究，其定义为 &amp;lt;math&amp;gt;s{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{kx + ky}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第5个指标大度节点有利指标&amp;lt;ref name=&amp;quot;[5]&amp;quot;&amp;gt;E. Ravasz,A. L. Somera,D. A. Mongru,Z. N. Oltvai,A. -L. Barabasi (2002) [https://pattern.swarma.org/paper?id=6eb98b7e-6e91-11ea-81b9-0242ac1a0005 Hierarchical organization of modularity in metabolic networks].arXiv:0209244.&amp;lt;/ref&amp;gt;（Hub promoted index，HPI）被用来定量刻画新陈代谢网络中每对反应物的拓扑相似程度，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{min\{k_x,k_y\}}&amp;lt;/math&amp;gt;，由于分母只由度较小的节点决定，在此定义下可知大度节点（hub）与其他节点之间更容易具有高的相似性。&lt;br /&gt;
&lt;br /&gt;
第6个指标大度节点不利指标&amp;lt;ref name=&amp;quot;[6]&amp;quot;&amp;gt;Tao Zhou,Linyuan Lu,Yi-Cheng Zhang (2009) [https://pattern.swarma.org/paper?id=7a2b26ba-6e92-11ea-9ee2-0242ac1a0005 Predicting Missing Links via Local Information].arXiv:0901.0553.&amp;lt;/ref&amp;gt;（hub depressed index, HDI）定义与HPI相似，只是分母取两端节点度的最大值，即 &amp;lt;math&amp;gt;s_{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{max\{k_x,k_y\}}&amp;lt;/math&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
第7个指标LHN-I指标&amp;lt;ref name=&amp;quot;[7]&amp;quot;&amp;gt;E. A. Leicht,Petter Holme,M. E. J. Newman (2005) [https://pattern.swarma.org/paper?id=71890c4e-6f0e-11ea-b30e-0242ac1a0005 Vertex similarity in networks].arXiv:0510143.&amp;lt;/ref&amp;gt;是由Leicht，Holme和Newman提出，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{{k_xk_y}}&amp;lt;/math&amp;gt;，其中分母&amp;lt;math&amp;gt;k_xk_y&amp;lt;/math&amp;gt; 正比于节点&amp;lt;math&amp;gt;v_x&amp;lt;/math&amp;gt;和节点&amp;lt;math&amp;gt;v_y&amp;lt;/math&amp;gt;共同邻居数的期望值，即 &amp;lt;math&amp;gt;E( |Γ(x)| \cap |Γ(y)|)&amp;lt;/math&amp;gt;。在下面这篇文献中，Leicht等人同时提出了另一个基于路径的指标，为了有所区别，将此局部指标命名为LHN-I指标，将基于路径的指标命名为LHN-II指标：&lt;br /&gt;
&lt;br /&gt;
第8个指标PA（preferential attachment）是基于BA无标度网络模型中新加入节点倾向于和度大的节点相连的优先连接机制而提出的，在这种机制的链路预测中，每一步首先去除一条链接，然后再添加一条链接，新链接连接节点&amp;lt;math&amp;gt;v_x&amp;lt;/math&amp;gt;和&amp;lt;math&amp;gt;v_y&amp;lt;/math&amp;gt;的概率就正比于两节点度的乘积，由此可以定义两节点间的优先连接相似性：&amp;lt;math&amp;gt;s_{xy}= k_xk_y&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第9个指标AA（Adamic-Adar）&amp;lt;ref name=&amp;quot;[8]&amp;quot;&amp;gt;Adar, Adamic L A, E (2003) [https://pattern.swarma.org/paper?id=e4726a06-6f2d-11ea-8846-0242ac1a0005 Friends and neighbors on the web].Social networks.25.(211--230)&amp;lt;/ref&amp;gt;的基本思想是度小的共同邻居节点的贡献大于度大的共同邻居节点，因此根据共同邻居节点的度为每个节点赋予一个权重值。这一点很容易理解，例如在微博中受关注较多的人往往是某个领域的专家或名人，因此共同关注他们的人之间可能并不拥有特别相似的兴趣——一个中学生和一个企业家都有可能是姚晨的粉丝。相反，如果两个人共同关注了一个粉丝很少的人（非名人），那么说明这两个人确实具有相同的兴趣爱好或者重叠的社交圈，因此有更高概率相连。又如在推荐系统中，共同购买冷门产品的两个用户往往比共同购买热门产品的用户更相似。AA指标根据共同邻居节点的度为每个节点赋予一个权重值，该权重等于该节点的度的对数分之一，即AA指标的定义为：&amp;lt;math&amp;gt;s_{xy}=\sum _{z\in \Gamma (x)\bigcap \Gamma (y)}\frac{1}{logk_z}&amp;lt;/math&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
第10种指标RA是受网络资源分配过程的启发，周涛等人提出的“'''资源分配指标 Resource allocation'''”，其与AA指标有异曲同工之妙。RA和AA指标最大的区别就在于赋予共同邻居节点权重的方式不同，前者是以 1/k 的形式递减，后者是以 1/logk 的形式递减。可见，当网络的平均度较小时，RA和AA差别不大；但是当平均度较大时，就有很大的区别了。研究显示，RA指标在刻画加权网络和社区挖掘应用中的表现胜过AA指标，图灵奖得主Hopdroft的一篇论文也显示，可以利用社区等中观结构信息改进局部指标，其中RA指标改进后的效果最佳。&lt;br /&gt;
&lt;br /&gt;
*基于路径的相似性指标&lt;br /&gt;
&lt;br /&gt;
基于共同邻居的相似性指标的优势在于计算复杂度较低，但是由于使用的信息非常有限，预测精度受到限制，因此发展出了基于路径的相似性指标，主要有3个，分别是局部路径指标 Local path 、Katz指标和LHN-II指标。&lt;br /&gt;
&lt;br /&gt;
1.局部路径指标&lt;br /&gt;
&lt;br /&gt;
周涛等人在共同邻居的基础上考虑三阶路径的因素，提出了基于局部路径的相似性指标，其定义为 &amp;lt;math&amp;gt; S=A^2+\alpha A^3&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 为可调参数，A 表示网络的邻接矩阵， &amp;lt;math&amp;gt;(A^3)_{xy}&amp;lt;/math&amp;gt;表示节点 &amp;lt;math&amp;gt;V_x&amp;lt;/math&amp;gt; 和 &amp;lt;math&amp;gt;V_y&amp;lt;/math&amp;gt; 之间长度为3的路径数目。当&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; = 0时，LP指标就退化为 CN 指标。 CN 指标本质上也可看成基于路径的指标，只是它仅考虑了二阶路径数目。局部路径指标可以扩展为更高阶的情形，即考虑n阶路径的情况：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt; S^n=A^2+\alpha\cdot A^3+\alpha^2\cdot A^4+\cdots +\alpha^{n-2}\cdot A^n &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
随着 n 的增加，局部路径指标的计算复杂度越来越大。一般而言，考虑 n 阶路径的计算复杂度为O(N&amp;lt;k&amp;gt;^n)。但是当 n 趋于无穷大的时候，局部路径指标相当于考虑网络全部路径的Katz指标，此时计算量反而有可能下降，因为可转变为计算矩阵的逆&amp;lt;ref name=&amp;quot;[10]&amp;quot;&amp;gt;Linyuan Lü, Ci-Hang Jin,  Tao Zhou () [https://pattern.swarma.org/paper?id=ba461814-70a3-11ea-8026-0242ac1a0005 Similarity Index Based on Local Paths for Link Prediction of Complex Networks].&amp;lt;/ref&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
2.Katz指标&lt;br /&gt;
&lt;br /&gt;
Katz指标考虑了所有网络的路径，因此其定义为：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S_{xy}=\sum_{l=1}^{\infty }\alpha^l\cdot\left |  paths_{x,y}^{&amp;lt;l&amp;gt;} \right |= \alpha A_{xy}+\alpha^2\cdot (A^2)_{xy}+\alpha^3\cdot (A^3)_{xy}+\cdots  &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\alpha &amp;gt; 0&amp;lt;/math&amp;gt; 为控制路径权重的可调参数，&amp;lt;math&amp;gt;\left |  paths_{x,y}^{&amp;lt;l&amp;gt;} \right |&amp;lt;/math&amp;gt;表示连接节点 &amp;lt;math&amp;gt;V_x&amp;lt;/math&amp;gt;和  &amp;lt;math&amp;gt;V_y&amp;lt;/math&amp;gt; 的路径中长度为 l 的路径数。要使上述级数收敛，则参数&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 应小于邻接矩阵最大特征值的倒数，此定义还可以表示为：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S = (I - \alpha\cdot A)^{-1} - I&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
显然，当参数&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 很小时，高阶路径的贡献也较小，使得 Katz 指标的预测结果接近于局部路径指标&amp;lt;ref name=&amp;quot;[11]&amp;quot;&amp;gt;Leo Katz (1953) [https://pattern.swarma.org/paper?id=b2dee81c-70b2-11ea-b7f9-0242ac1a0005 A new status index derived from sociometric analysis].psychometrika.18.1:(39-43)&amp;lt;/ref&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
3.LHN-II指标&lt;br /&gt;
&lt;br /&gt;
LHN-II 指标是 Leicht，Holme 和 Newman 提出的另一种相似性计算方法，他的基本思想是基于'''一般等价 Regular equivalence''' 提出的。与结构等价不同，一般等价的定义更广泛。在一般等价的定义下，如果两个节点所连接的节点之间相似，那么这两个节点也相似，即使它们之间没有共同的邻居节点。&lt;br /&gt;
&lt;br /&gt;
下图给出了一个简单的例子来帮助我们理解结构等价和一般等价的区别。根据结构等价的定义，在公司A内部，由于员工a和员工b都认识员工e和员工f（即它们有两个共同邻居节点），于是称员工a和员工b是结构等价的。同理，员工e和员工f也是结构等价的，同样地，在公司B中，员工c和员工d是结构等价的，员工g和员工h也是结构等价的。现在考虑员工a和员工c是否相似？根据一般等价的定义，由于员工a连接的节点e、f与员工c连接的节点g、h分别是相似的，那么我们可以认为员工a和员工c也是相似的，同理，在一般等价的意义下，员工b和员工d也是相似。从这个例子可以看出，结构相似性或称结构等价更强调的是两个节点是否在同一个环境下，也就是说是否连接了相同的节点；然而一般等价考虑的是这两个节点是否处于同样的角色，即使他们没有相同的邻居节点，但是由于各自的邻居节点之间本身相似，这两个节点也相似。一般等价意义下的相似性是LHN-II指标的核心。&lt;br /&gt;
&lt;br /&gt;
[[File:一般等价和结构等价示例.png|600px|thumb|一般等价和结构等价示例（图中实线表示连接，虚线表示相似关系）|center]]&lt;br /&gt;
&lt;br /&gt;
从一般等价的角度考虑，LHN-II指标认为如果两个节点的邻居节点之间是相似的，那么这两个节点也是相似的。它与Katz指标的区别主要是把Katz指标中的&amp;lt;math&amp;gt; (A^{n})_{xy} &amp;lt;/math&amp;gt;变成 &amp;lt;math&amp;gt;  (A^{n})_{xy}&amp;lt;/math&amp;gt; 的期望值，注意到 &amp;lt;math&amp;gt; (A^{n})_{xy}&amp;lt;/math&amp;gt; 的期望值为 &amp;lt;math&amp;gt; E\left [ (A^l)_{xy} \right ]=\frac{k_xk_y}{M}\lambda _1^{l-1}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\lambda_1&amp;lt;/math&amp;gt;为矩阵A的最大特征值，则LHN-II指标的表达式如下：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 S_{xy}^{LHN2}=\delta _{xy} + \sum_{l=1}^{\infty }\Phi ^l \frac{(A^l)_{xy}}{E\left [ (A^l)_{xy} \right ]}&lt;br /&gt;
=\delta _{xy} + \frac{2M}{k_xk_y}\sum_{l=1}^{\infty }\Phi ^l\lambda _1^{1-l}(A^l)_{xy}&lt;br /&gt;
=\left [ 1 - \frac{2 M \lambda_1}{k_xk_y} \right ]\delta _{xy} + \frac{2 M \lambda_1}{k_xk_y}\left [ (I-\frac{\Phi}{\lambda_1} A )^{-1} \right ]_{xy}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\delta _{xy}&amp;lt;/math&amp;gt;为 Kronecker &amp;lt;math&amp;gt;\delta&amp;lt;/math&amp;gt; 函数，&amp;lt;math&amp;gt; \Phi&amp;lt;/math&amp;gt; 为取值小于1的参数。上式最后一个等式的第一项是可以去掉的对角阵，从而相似性矩阵可以写为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S=2M\lambda_1D^{-1}(I-\frac{\Phi A}{\lambda_1})^{-1}D^{-1}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中''D''为度值矩阵，&amp;lt;math&amp;gt;D_{xy} = \delta_{xy} \cdot k_{x}&amp;lt;/math&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
*基于随机游走的节点相似性指标&lt;br /&gt;
&lt;br /&gt;
还有相当数量的相似性指标是基于随机游走过程定义的，包括'''平均通勤时间 Average commute time''' 、'''Cos+指标'''、'''有重启的随机游走 Random walk with restart'''、'''SimRank'''指标、'''局部随机游走指标 Local random walk''' 和'''有叠加效应的随机游走指标 Superposed random walk'''等。&lt;br /&gt;
&lt;br /&gt;
1.平均通勤时间 ACT &amp;lt;ref name=&amp;quot;[12]&amp;quot;&amp;gt;D. J. Klein,M. Randić (1993) [https://pattern.swarma.org/paper?id=b5177044-70c7-11ea-b241-0242ac1a0005 Resistance distance].journal of mathematical chemistry.12.1:(81-95)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
设&amp;lt;math&amp;gt;m(x,y)&amp;lt;/math&amp;gt; 为一个随机粒子从节点x到节点y平均需要走的步数，那么节点x和y的平均通勤时间定义为：&amp;lt;math&amp;gt;n(x , y) = m(x , y) + m(y , x) &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其数值解可通过求该网络拉普拉斯矩阵&amp;lt;math&amp;gt;L&amp;lt;/math&amp;gt; 的伪逆&amp;lt;math&amp;gt; L^+&amp;lt;/math&amp;gt; 获得，即 &amp;lt;math&amp;gt;n(x,y)=M(l^+_{xx} +l^+_{yy} - 2l^+_{xy})&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;l^{+}_{xy}&amp;lt;/math&amp;gt;表示矩阵&amp;lt;math&amp;gt;L^+ &amp;lt;/math&amp;gt;中相应位置的元素。如果两个节点的平均通勤时间越小，那么两个节点越进阶。由此，定义基于ACT的相似性为（在此可忽略常数M）&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{ACT}=\frac{1}{l^+_{xx} +l^+_{yy} - 2l^+_{xy}}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
2.余弦相似性指标 Cos+指标&amp;lt;ref name=&amp;quot;[13]&amp;quot;&amp;gt;Fouss F, Pirotte A, Renders J M (2007) [https://pattern.swarma.org/paper?id=f3ce12c4-70c8-11ea-8ff9-0242ac1a0005 Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation].IEEE Transactions on knowledge and data engineering.19.(355-369)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
在由向量&amp;lt;math&amp;gt;v_x = \Lambda ^{1/2}U^{T}e_{x}&amp;lt;/math&amp;gt;展开的欧式空间内，&amp;lt;math&amp;gt;L^+ &amp;lt;/math&amp;gt;中的元素&amp;lt;math&amp;gt;l^{+}_{xy}&amp;lt;/math&amp;gt;可表示为两向量&amp;lt;math&amp;gt;v_x&amp;lt;/math&amp;gt;和&amp;lt;math&amp;gt;v_y&amp;lt;/math&amp;gt;的内积，即&amp;lt;math&amp;gt; l^{+}_{xy} = v_{x}^{T} v_y&amp;lt;/math&amp;gt;，其中&amp;lt;math&amp;gt;U&amp;lt;/math&amp;gt;是一个标准正交矩阵，由&amp;lt;math&amp;gt;L^+&amp;lt;/math&amp;gt;特征向量按照对应的特征根从大到小排列，&amp;lt;math&amp;gt;\Lambda&amp;lt;/math&amp;gt;为以特征根为对角元素的对角矩阵，&amp;lt;math&amp;gt;e_{x}&amp;lt;/math&amp;gt; 表示一个一维向量且只有第x个元素为1，其他都为0。由此定义余弦相似性如下：&lt;br /&gt;
&lt;br /&gt;
s_{xy}^{cos+}=cos(x,y)^+=\frac{l_{xy}^+}{\sqrt{l^+_{xx} \cdot l^+_{yy}}}&lt;br /&gt;
&lt;br /&gt;
3.重启的随机游走 RWR&amp;lt;ref name=&amp;quot;[14]&amp;quot;&amp;gt;Brin, S, Page, L (1998) [https://pattern.swarma.org/paper?id=15405998-70ca-11ea-b1b5-0242ac1a0005 The anatomy of a large-scale hypertextual web search engine].&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
这个指标可以看成是PageRank 算法的拓展应用。它假设随机游走粒子在每走一步的时候都以一定概率返回初始位置。设粒子返回概率为 1-c，&amp;lt;math&amp;gt;P&amp;lt;/math&amp;gt; 为网络的马尔科夫概率转移矩阵，其元素 &amp;lt;math&amp;gt;P_{xy} = a_{xy}/k_{x} &amp;lt;/math&amp;gt;表示节点x处的粒子下一步走到节点y的概率。其中如果节点x和节点y相连，则&amp;lt;math&amp;gt;a_{xy}=1&amp;lt;/math&amp;gt;，否则&amp;lt;math&amp;gt;a_{xy}=0&amp;lt;/math&amp;gt;。某一粒子初始时刻在节点x处，那么t+1时刻该粒子到达网络各个节点的概率向量为&lt;br /&gt;
&amp;lt;math&amp;gt;q_{x}(t+1) = c \cdot P^{T}q_{x}(t) + (1-c) e_{x}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;e_{x}&amp;lt;/math&amp;gt;表示初始状态（其定义与Cos+中相同），上式的稳态解为&amp;lt;math&amp;gt;q_{x} = (1-c)(I-cP^{T})^{-1}e_{x}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中元素&amp;lt;math&amp;gt;q_{xy}&amp;lt;/math&amp;gt;为从节点x出发的粒子最终有多少概率走到节点y。由此定义RWR相似性如下：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{RWR} = q_{xy} + q_{yx} &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
4.SimRank指标 SimR&amp;lt;ref name=&amp;quot;[15]&amp;quot;&amp;gt;Jeh G, Widom J. SimRank (2002) [https://pattern.swarma.org/paper?id=593e78e0-70cb-11ea-9743-0242ac1a0005 a measure of structural-context similarity].(538-543)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
它的基本假设是，如果两节点所连接的节点相似，那么这两个节点就相似。其自洽定义式为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{simR}=C\frac{\sum_{v_z\in \Gamma (x)}\sum_{{v_z}'\in \Gamma (y)}s_{zz'}^{simR}}{k_xk_y}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中假定 &amp;lt;math&amp;gt;s_{xx} =1, C \in [0,1] &amp;lt;/math&amp;gt;为相似性传递时的衰减参数。&lt;br /&gt;
&lt;br /&gt;
SimR指标同时考虑了结构等价和一般等价。当节点x的邻居z同时也是节点y的邻居时，该指标考虑了结构等价；当节点x不等于节点y时，该指标概率了一般等价。可以证明，SimR指标可以用来描述两个分别从节点x和y出发的粒子平均过多久会相遇。&lt;br /&gt;
&lt;br /&gt;
5.局部随机游走指标 LRW&amp;lt;ref name=&amp;quot;[16]&amp;quot;&amp;gt;Weiping Liu,Linyuan Lu (2010) [https://pattern.swarma.org/paper?id=98d1a08e-70eb-11ea-a520-0242ac1a0005 Link Prediction Based on Local Random Walk].arXiv:1001.2467.89.(58007)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
上述4种随机游走指标是基于全局的随机游走，这类指标往往计算复杂度很高，因此很难在大规模网络上应用。刘伟平和吕琳媛提出了一种基于网络局部随机游走的相似性指标LRW，它只考虑有限步数的随机游走过程。一个粒子 t 时刻从节点x出发，定义&amp;lt;math&amp;gt;π_{xy} (t) &amp;lt;/math&amp;gt;为 t+1 时刻这个粒子正好走到节点y的概率，那么可得到系统演化方程：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\pi_{x} (t + 1) = P^T\pi_{x}(t)，t=0,1,…&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\pi_{x}(0) &amp;lt;/math&amp;gt;为一个&amp;lt;math&amp;gt;Nx1 &amp;lt;/math&amp;gt;的向量，只有第x 个元素为1，其他为0，即&amp;lt;math&amp;gt;\pi_{x}(0) =e_x&amp;lt;/math&amp;gt;。设定各个节点的初始资源分布为&amp;lt;math&amp;gt;q_x&amp;lt;/math&amp;gt;，那么基于t步随机游走的相似性为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{LRW} = q_{xy} + q_{yx}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
6.叠加的局部随机游走指标 SRW&amp;lt;ref name=&amp;quot;[16]&amp;quot;&amp;gt;Weiping Liu,Linyuan Lu (2010) [https://pattern.swarma.org/paper?id=98d1a08e-70eb-11ea-a520-0242ac1a0005 Link Prediction Based on Local Random Walk].arXiv:1001.2467.89.(58007)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
这个指标给邻近目标节点的点更多的机会与目标节点相连，充分考虑了很多真实网络连接上的局域性特点，它是在LRW的基础上，将t步及其以前的结果加总，便得到SRW的值，即：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{SRW}(t)=\sum_{t}^{l=1}s_{xy}^{LRW}(l) = q_x\sum_{t}^{l=1}\pi_{xy}(l) + q_y\sum_{t}^{l=1}\pi_{yx}(l)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===基于似然分析的链路预测===&lt;br /&gt;
&lt;br /&gt;
基于相似性的链路预测方法，是最简单的一种分析框架，除此之外，还有另一种最复杂的链路预测分析框架——基于似然分析的链路预测。这个框架本身远远复杂于基于相似性的框架，而且框架中的每一个组成成分自身都非常复杂，但这个框架下衍生出的算法除了给出链路预测的结果之外，还给出了我们对于网络结构的深刻洞见，例如“'''层次结构模型 Hierachical structure model'''”给出了网路层次组织形态的定量刻画，“'''随机分块模型 Stochastic block model'''”类似于社区分解一样把网络划分成了若干子块。这些对理解网络结构特征方面的贡献，是基于相似性的框架所不能提供的。&lt;br /&gt;
&lt;br /&gt;
基于似然分析的链路预测的基本思路是：根据网络结构的产生和组织方式以及目前已经观察到的链路计算网络的似然值，并认为真实的网络使得网络似然值最大，然后再根据网络似然最大化计算每一对未连接的节点产生连边的可能性。&lt;br /&gt;
&lt;br /&gt;
*层次结构模型 HSM&amp;lt;ref name=&amp;quot;[17]&amp;quot;&amp;gt;Aaron Clauset,Cristopher Moore,M. E. J. Newman (2008) [https://pattern.swarma.org/paper?id=1ca0e946-70ed-11ea-82c3-0242ac1a0005 Hierarchical structure and the prediction of missing links in networks].arXiv:0811.0484.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
层次结构模型假设真实的网络都存在某种层次性，网络的连接则可看作是这种内在层次结构的反映。该方法的计算步骤如下：&lt;br /&gt;
&lt;br /&gt;
1.一个N个节点的网络可以用一个包含N个叶子节点的族谱树表示，这N个叶子节点将由N-1个非叶子节点连接起来，其中每个非叶子节点都有一个概率值，则两个叶子节点连接的概率就等于他们最近共同祖先节点的概率值。给定一个族谱树，将网络的似然值最大化，就可以得到非叶子节点的概率值，并由此计算出这一个族谱树所对应的网络最大的似然值。&lt;br /&gt;
&lt;br /&gt;
2.使用马尔科夫链蒙特卡洛方法对网络不同的族谱树进行抽样，使得每个族谱树出现的频次正比于该树对应的最大的网络似然值。两个节点连边的概率就等于所有抽样出来的族谱树中两个节点连边概率的平均值。注意似然高的族谱树会出现多次，因此对这个平均概率的贡献也大。&lt;br /&gt;
&lt;br /&gt;
3.把平均连边概率看做是相似性框架中的相似性指标&amp;lt;math&amp;gt;s_{xy}&amp;lt;/math&amp;gt;，按照这个值从大到小排序，排在前面的就是预测的连边。&lt;br /&gt;
&lt;br /&gt;
需要指出的是，层次结构模型在处理具有明显层次结构的网络（如恐怖袭击网络和草原食物链）时具有较高的精确度，但在处理一般性网络时效果并不一定突出。&lt;br /&gt;
&lt;br /&gt;
*随机分块模型 SBM&lt;br /&gt;
&lt;br /&gt;
与层次结构模型的思想类似，随机分块模型假设网络中的节点可以被分为若干集合，两个节点间连接的概率只与相应的集合有关。换句话说，同一个群众所有节点的地位是相同的。随机分块模型特别适合刻画节点所属群的成员身份对于其连接行为有关键影响的情况，例如，著名的“角色模型”就包含了随机分块模型的理念。&amp;lt;ref name=&amp;quot;[18]&amp;quot;&amp;gt;Roger Guimerà,Marta Sales-Pardo,Luís A. N. Amaral (2006) [https://pattern.swarma.org/paper?id=aa2a88c0-7107-11ea-a3cf-0242ac1a0005 Classes of complex networks defined by role-to-role connectivity profiles].nature physics.3.1:(63-69)&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;[19]&amp;quot;&amp;gt;Joerg Reichardt,Douglas R. White (2007) [https://pattern.swarma.org/paper?id=f20b0e20-7108-11ea-9e3d-0242ac1a0005 Role models for complex networks].arXiv:0708.0958.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
随机分块模型的效果要好于层次结构模型。同时，该方法还可以剔除网络的错误连边，如纠正蛋白质相互作用网络中的错误连边。&lt;br /&gt;
&lt;br /&gt;
*闭路模型 Loop model&amp;lt;ref name=&amp;quot;[20]&amp;quot;&amp;gt;吕琳媛,Xiaolong Ren,周涛 (2016) [https://pattern.swarma.org/paper?id=f5d29350-710a-11ea-9346-0242ac1a0005 网络链路预测：概念与前沿].&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
似然分析的更一般的框架是：给定一个网络系统，特定网络哈密顿量的负指数被统计分配函数归一化后，就得到这个网络出现的似然，一条未被观察到的连边存在的可能性就等于添加这条连边后网络的似然值。闭路模型考虑网络结构形成中的“局部性原则”，并由此定义了网络的哈密顿量。实验表明，闭路模型的预测精度大于层次结构模型和随机分块模型。&lt;br /&gt;
&lt;br /&gt;
===基于机器学习的链路预测===&lt;br /&gt;
&lt;br /&gt;
用机器学习的思路进行链路预测，主要分为基于特征分类方法、基于概率图模型方法和基于矩阵分解方法三大类。&lt;br /&gt;
&lt;br /&gt;
*基于特征分类方法&amp;lt;ref name=&amp;quot;[21]&amp;quot;&amp;gt;Al Hasan, M, Chaoji, V, Salem, S (2006) [https://pattern.swarma.org/paper?id=0cae2084-710c-11ea-bbd8-0242ac1a0005 Link prediction using supervised learning].counter-terrorism and security..30.(798--805)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
网络中的链路预测问题可以看成机器学习中的分类问题，其中每个数据点对应一对节点之间关系的标记，假定两个节点之间存在连边，则数据点的值为+1，否则为-1。特征选取是分类问题中最重要的问题之一，目前研究较多的主要包括基于节点与边的属性特征和基于节点所处网络的拓扑结构特征（如CN、AA、Katz、最短路径）等。哈桑 Hasan 等人提取合著网络中科学家研究领域的关键词作为特征，用监督学习中一些常用的分类算法（如决策树、K近邻法、多层感知器、支持向量机、径向基网络）对缺失的连边进行较为精准的预测，其中以支持向量机方法表现最佳。&lt;br /&gt;
&lt;br /&gt;
*基于概率图模型&amp;lt;ref name=&amp;quot;[22]&amp;quot;&amp;gt;Backstrom, L, Leskovec, J (2011) [https://pattern.swarma.org/paper?id=8ccaa454-710c-11ea-9eeb-0242ac1a0005 Supervised random walks: predicting and recommending links in social networks].Proceedings of the fourth ACM international conference on Web search and data mining.(635--644)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
基于概率图模型的链路预测方法使用图模型来表达节点之间的连边概率，根据模型中概率依赖关系，可分为有向无环的贝叶斯网络和无向的马尔科夫网络。随机分块模型和层次结构模型分别是典型的基于贝叶斯网络和基于马尔科夫网络的链路预测方法。基于概率图模型的链路预测方法有很多，典型的还有有监督随机游走链路预测算法，将网络结构信息与节点和连边的属性信息结合起来，给每条边分配不同的转移概率。与其他有监督的机器学习方法相比，该算法无须知道网络的特征和相关的领域知识。&lt;br /&gt;
&lt;br /&gt;
*基于矩阵分解&lt;br /&gt;
&lt;br /&gt;
基于矩阵分解的链路预测方法是基于网络邻接矩阵的代数谱变换而得到的方法，来预测网络中链路的存在性和链路的权值&amp;lt;ref name=&amp;quot;[23]&amp;quot;&amp;gt;Kunegis, J, Lommatzsch, A (2009) [https://pattern.swarma.org/paper?id=2908af64-710d-11ea-b513-0242ac1a0005 Learning spectral graph transformations for link prediction].Proceedings of the 26th Annual International Conference on Machine Learning.(561--568)&amp;lt;/ref&amp;gt;。相比其他几种机器学习方法，该方法要学习的参数少很多，但计算复杂度较高。链路预测问题可以视为邻接矩阵填充问题，并可以通过双线性回归模型将节点和链路的显特征和隐特征结合起来用矩阵分解方法解决&amp;lt;ref name=&amp;quot;[24]&amp;quot;&amp;gt;Menon A K, Elkan, C (2011) [https://pattern.swarma.org/paper?id=7f0ab830-710d-11ea-9143-0242ac1a0005 Link prediction via matrix factorization].(437--452)&amp;lt;/ref&amp;gt;。边缘去噪模型将根据给定关系矩阵求未知边或丢失边的问题变成一个矩阵降噪去噪问题&amp;lt;ref name=&amp;quot;[25]&amp;quot;&amp;gt;Chen, Z, Zhang, W. (2014) [https://pattern.swarma.org/paper?id=d925d57a-710d-11ea-90c5-0242ac1a0005 A marginalized denoising method for link prediction in relational data].Proceedings of the 2014 SIAM International Conference on Data Mining. Society for Industrial and Applied Mathematics.(298--306)&amp;lt;/ref&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
关于不同的链路预测研究方法的分类可以参考下表：&lt;br /&gt;
[[File:Link preditction method.png|600px|thumb|三类不同的链路预测方法（*表示该方法含有参数）|center]]&lt;br /&gt;
&lt;br /&gt;
==应用场景==&lt;br /&gt;
链路预测有着广泛的应用场景：在生物领域，利用蛋白质间相互作用关系的结构信息进行链路预测，可以为实验的测定提前提供参考依据，从而降低实验成本、提高成功率；在社交网络领域，链路预测可以对社交网络中的好友关系、朋友推荐进行预测，从而提高用户对社交网站的体验满意度和使用黏性；在电子商务领域，除了传统的协同过滤推荐算法外，利用网络结构信息（如网络三角形结构）等特征进行商品推荐也取得了显著的优势；此外，通过识别隐藏的链边或异常的链边对信息不完全或含有噪音的网络进行重构，可以提高网络的传输能力，这对于航空网络重构有很大的启发意义。&lt;br /&gt;
[[File:Figure2.png|400px|thumb|链路预测应用场景示意图（图片来自网络）|center]]&lt;br /&gt;
&lt;br /&gt;
除此之外，链路预测的算法和思想通过一些变换还可以用来解决一些看似没有太大关系的问题。例如，对疾病信号和股票指数的预测。基于链路预测的思想和方法，我们还可以设计基于节点相似性的社团划分以及对网络演化模型的定量化评估方法。链路预测还可以帮助提高节点标签预测的精度，特别是在已知标签节点稀疏的情况下效果显著。这一方法可以应用于判断一篇学术论文的类型，判断一本书的政治态度（中立、自由派或保守派），或者判断一个手机用户是否产生了更换电信运营商的念头。&lt;br /&gt;
&lt;br /&gt;
==代表人物==&lt;br /&gt;
*'''吕琳媛'''&lt;br /&gt;
吕琳媛主要研究方向为复杂网络信息挖掘领域，包括海量信息导航、挖掘、推荐和预测。目前担任阿里巴巴复杂科学研究中心副主任，中欧联合实验室执行主任，中国工业与应用数学学会复杂网络与系统控制专业委员会委员，杭州市特聘专家。&lt;br /&gt;
[[File:Lvlinyuan.png|400px|thumb|吕琳媛，阿里巴巴复杂科学研究中心副主任|center]]&lt;br /&gt;
&lt;br /&gt;
近年来主持/参与国家级项目5项（2016年获得国家自然科学基金优秀青年基金），省部级项目4项，横向课题4项。 在相关领域发表学术论文 50余篇，其中SCI论文39篇，总影响因子122，发表期刊包括Physics Reports，PNAS，Nature Communications等国际知名学术期刊。三篇论文入选ESI全球Top-1%高引用论文，论文SCI引用1200余次，谷歌学术引用3000余次，其中9篇论文引用超过100次。2013年出版学术专著《链路预测》获得第四届中国大学出版社图书奖优秀学术著作一等奖。申请发明专利12项。2015年荣获浙江省杰出青年基金，2014年荣获中国计算机学会自然科学二等奖，中国网络科学论坛青年希望奖，首届CCF-腾讯犀牛鸟基金优秀奖。&lt;br /&gt;
&lt;br /&gt;
*'''周涛'''&lt;br /&gt;
周涛主要从事复杂性科学和大数据挖掘算法和应用研究，先后攻克推荐系统准确性-多样性困境、复杂网络链路可预测性、H指数-度-核心度关系等图挖掘领域的重要难题，成果发表在PNAS, Nature Communications, Physics Reports, KDD和ICDM等国际顶尖期刊和会议上。目前论文google总引用超过14000次，其中8篇论文入选ESI高引用论文，H指数为57，2014和2015连续两年入选Elsevier最具国际影响力中国科学家名单。&lt;br /&gt;
[[File:Zhoutao.png|400px|thumb|周涛，第十二届中国青年科技奖|center]]&lt;br /&gt;
&lt;br /&gt;
因其在科学研究上的杰出表现，2011年获得第十二届中国青年科技奖（最年轻获奖者），2011年入选四川省“百人计划”，2012年获得国家首批优秀青年科学基金资助，2013年入选国家“万人计划”首批青年拔尖人才支持计划，2014年获得四川省科技进步一等奖、中国计算机学会自然科学奖，2015年获得共青团中央授予的“最美青年科技工作者”称号，并与屠呦呦等七名个人和北斗导航等三个团队共同当选2015年度中国十大科技创新人物。&lt;br /&gt;
&lt;br /&gt;
*'''马克·纽曼 Mark Newman'''&lt;br /&gt;
Newman是一名英裔美国物理学家，也是密歇根大学 University of Michigan 物理学系的阿纳托尔·拉波特 Anatol Rapoport 杰出教授，也是圣达菲研究所 Santa Fe Institute 的外部教员。他因在复杂网络和复杂系统领域的基础性贡献而闻名，为此他被授予2014年拉格朗日奖。&lt;br /&gt;
[[File:Newman.png|400px|thumb|Mark Newman，密歇根大学物理学系阿纳托尔·拉波特杰出教授|center]]&lt;br /&gt;
&lt;br /&gt;
Newman以其对复杂网络的研究而著称，尤其是在科学家的协作模式，随机图论 Random graph theory，社区结构 Community structure，渗流理论 Percolation theory 和网络流行病学 Network epidemiology方面的工作。他作为共同发明人，与迈克尔·卡斯特 Michael Gastner 一起，发明了一种可以产生密度均衡地图 Density-equalizing maps 或统计地图 Cartograms的方法，该方法构成了Worldmapper网站的基础。他们的工作在2004年美国总统大选后受到关注，成为了当时被广泛传播的一种选举结果地图的基础，（他们）根据各州的人口数调整了州的规模，以便更准确地了解每个党派的选民投票人数。&lt;br /&gt;
&lt;br /&gt;
*'''克里斯托弗·大卫·摩尔 Cristopher David Moore'''&lt;br /&gt;
克里斯托弗·大卫·摩尔 Cristopher David Moore，也称为克里斯·摩尔 Cris Moore 是美国计算机科学家，数学家和物理学家。他是圣达菲研究所的驻校教师，曾任新墨西哥大学 University of New Mexico 的正教授。&lt;br /&gt;
[[File:Cristopher_David_Moore.png|400px|thumb|Cristopher David Moore，圣达菲研究所的驻校教师|center]]&lt;br /&gt;
&lt;br /&gt;
1993年，Moore 发现了一种新颖的解决三体问题的方法，表明在牛顿力学中，三个等质量的物体有可能沿着一条八字形曲线、在同一条轨道相互跟随。Moore 在网络科学领域也很活跃，在该领域有许多著名的出版物。在与Clauset和Mark Newman的合作中，Moore开发了复杂网络的层次聚类概率模型，并表明他们的模型可以在面对网络连接结构发生变化时可靠地预测聚类结果。&lt;br /&gt;
&lt;br /&gt;
*'''亚伦·克劳斯特 Aaron Clauset '''&lt;br /&gt;
Aaron Clauset是一位美国计算机科学家，致力于网络科学，机器学习和复杂系统领域。目前，他在科罗拉多大学博尔德分校 University of Colorado Boulder 教授计算机科学，也是圣菲研究所的外部教员。&lt;br /&gt;
[[File:Aaron_Clauset.png|400px|thumb|  Aaron Clauset，圣菲研究所的外部教员|center]]&lt;br /&gt;
&lt;br /&gt;
Clauset因与Cosma Shalizi和Mark Newman进行的合作研究而闻名，他们针对经验数据中是否存在幂律模式开发了严格的统计检验，并且证明了许多宣称符合幂律分布的网络实际上并不是幂律分布。他还因开发检测复杂网络中的社区结构算法的工作而著称，特别是和Newman、Moore合作发展的网络层次聚类模型。在其他方面，Clauslet 与麦克斯韦·扬 Maxwell Young 、克里斯蒂安·斯克雷德·格莱蒂奇 Kristian Skrede Gleditsch 共同完成了一些独特发现：世界范围内恐怖事件发生的频率和严重性服从幂律分布。&lt;br /&gt;
&lt;br /&gt;
2015年，Clauset 因开发和评估一种网络结构特征的新方法而获得了美国国家科学基金会颁发的著名的CAREER奖。2016年，Clauset因在网络结构方面（包括Internet映射，推断缺失链接和社区结构），以及对人类冲突和社会分层所做的启发性分析方面做出的贡献而获得网络科学学会颁发的网络科学领域的Erdös-Rényi奖。&lt;br /&gt;
&lt;br /&gt;
==参考资料==&lt;br /&gt;
*汪小帆,李翔,陈关荣.《网络科学导论》.北京：高等教育出版社,2012年：178-186&lt;br /&gt;
*吕琳媛,周涛.《链路预测》.北京：高等教育出版社,2013年：57-93&lt;br /&gt;
*吕琳媛,任晓龙,周涛.《网络链路预测：概念与前沿》[J].《中国计算机学会通讯》,2016年,第4期&lt;br /&gt;
*Clauset A, Moore C, Newman M E J. Hierarchical structure and the prediction of missing links in networks [J]. Nature, 2008,453(7191): 98-101.&lt;br /&gt;
*Link Prediction Group 网站：http://www.linkprediction.org/&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
*链接预测可用于分析网络将如何发展，或者在给定信息不完整情况下来发现“丢失”的链接，对于这个问题，有研究者提出了一种新的，结合广义群贴近度中心性和半值相互作用指数的拟局部方法（即考虑半径k内节点的方法），详见 [https://swarma.org/?p=18249 《链路预测的博弈算法》]&lt;br /&gt;
[[File:链路预测的博弈算法.jpg|400px|thumb|[https://swarma.org/?p=18249 《链路预测的博弈算法》]|center]]&lt;br /&gt;
*深度学习已经成功地在图像识别、语音识别、自然语言处理、游戏与博弈等领域取得了突飞猛进的发展，并渗透到了我们的日常生活中。那么，我们有没有可能将这种技术借剪到复杂网 络的研究之中呢？近年来，人们凭借着网络嵌入（Network Embedding）、图卷积神经网络（Graph Convolutional Neural Network）、图注意力模型（Graph Attention Network）等新技术，已经开发了若干图结构上的深度学习算法，并取得了一定的成功应用。北师大系统科学学院教授、博导张江老师亲授[https://campus.swarma.org/play/coursedetail?id=10504 《当复杂网络遇上机器学习》]，将对这些算法以及应用，包括各式各样的网络嵌入算法、节点分类问题、链路预测问题、图分类问题、网络动力学预测问题等做一简单介绍，并对网络上的深度学习问题进行了展望。&lt;br /&gt;
[[File:当复杂网络遇上机器学习.png|400px|thumb|[https://campus.swarma.org/play/coursedetail?id=10504 《当复杂网络遇上机器学习》]|center]]&lt;br /&gt;
*网络上的注意力模型（Graph Attention Model）是一种通用的网络嵌入算法，它能够在节点分类、链路预测等问题上得到极高的精度。它可以模仿一个机器头对网络中的节点进行信息读取和分析，然后将综合的结果放到节点的向量中的过程。[https://campus.swarma.org/play/coursedetail?id=10385 《网络上的注意力模型》]课程将详细介绍这一模型及其应用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''''本中文词条由[[用户:木子二月鸟|木子二月鸟]]用户参与编译，  [[用户: 苏格兰| 苏格兰]]用户审校，欢迎在讨论页面留言'''''。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''本词条内容源自wikipedia及公开资料，遵守 CC3.0协议。'''&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E9%93%BE%E8%B7%AF%E9%A2%84%E6%B5%8B&amp;diff=7643</id>
		<title>链路预测</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E9%93%BE%E8%B7%AF%E9%A2%84%E6%B5%8B&amp;diff=7643"/>
		<updated>2020-05-10T14:48:19Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：/* 基于机器学习的链路预测 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{#seo:|keywords=链路预测 Link Prediction  |description=通过已知的网络节点以及网络结构等信息，预测网络中尚未产生连边的两个节点之间产生连接的可能性。 }}&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
'''链路预测 Link Prediction'''是指如何通过已知的网络节点以及网络结构等信息，预测网络中尚未产生连边的两个节点之间产生连接的可能性。这种预测既包含了对未知链接 Existing yet unknown link，也称丢失链接 Missing link 的预测，也包含了对未来链接 Future link 的预测。&lt;br /&gt;
&lt;br /&gt;
链路预测是将复杂网络与信息科学联系起来的重要桥梁之一，它所要处理的是信息科学中最基本的问题——缺失信息的还原与预测。链路预测相关研究不仅能够推动网络科学和信息科学理论上的发展，而且具有巨大的实际应用价值，譬如可以知道蛋白质相互作用实验、进行在线社交推荐、找出交通传输网络中有特别重要作用的连边等。&lt;br /&gt;
&lt;br /&gt;
==研究方法==&lt;br /&gt;
===基于相似性的链路预测===&lt;br /&gt;
&lt;br /&gt;
*基于局部信息的相似性指标&lt;br /&gt;
&lt;br /&gt;
社会网络分析中经典的三元闭包 Triadic closure 原则指出，如果A、B	两个人拥有一个共同的朋友C，那么这两个人今后也很有可能成为朋友，从而使得3个节点构成一个闭合的三角形ABC。对于一般的网络，我们可以把这一原则推广如下：两个节点的共同邻居越多，这两个节点就越相似，从而更倾向于相互连接。最简单的基于'''共同邻居 Common neighbors''' 的节点相似性指标定义如下：&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
s_{xy}^{CN} =  |Γ(x)| \cap |Γ(y)|&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
在相似性指标定义的基础上，还可以考虑两个节点的共同邻居的相对数量。下表列出了10种基于节点局部信息的相似性指标，第1种是计算共同邻居相似度的基本公式，其中第2至7种相似性指标是直接基于共同邻居指标的不同的规范化而得到的，表中的 k(x) = |Γ(x)| 为节点x的度。第8种指标PA是基于BA无标度网络模型中新加入节点倾向于和度大的节点相连的优先连接机制而提出的。&lt;br /&gt;
&lt;br /&gt;
第9种指标AA的基本思想是度小的共同邻居节点的贡献大于度大的共同邻居节点，因此根据共同邻居节点的度为每个节点赋予一个权重值。这一点很容易理解，例如在微博中受关注较多的人往往是某个领域的专家或名人，因此共同关注他们的人之间可能并不拥有特别相似的兴趣——一个中学生和一个企业家都有可能是姚晨的粉丝。相反，如果两个人共同关注了一个粉丝很少的人（非名人），那么说明这两个人确实具有相同的兴趣爱好或者重叠的社交圈，因此有更高概率相连。又如在推荐系统中，共同购买冷门产品的两个用户往往比共同购买热门产品的用户更相似。&lt;br /&gt;
[[File:Table1.png|600px|thumb|10种基于节点局部信息的相似性指标|center]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
第2个指标Salton指标&amp;lt;ref name=&amp;quot;[2]&amp;quot;&amp;gt;Salton G, McGill M J () [https://pattern.swarma.org/paper?id=15e10152-92c8-11ea-81db-0242ac1a0005 Introduction to Modern Information Retrieval].&amp;lt;/ref&amp;gt;又称余弦相似性，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{|Γ(x)| \cap |Γ(y)|}{\sqrt{k(x)k(y)}}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第3个指标Jaccard指标&amp;lt;ref name=&amp;quot;[3]&amp;quot;&amp;gt;Jaccard P. () [https://pattern.swarma.org/paper?id=70c8a48a-92c8-11ea-9f7f-0242ac1a0005 Etude de la distribution florale dans une portion des Alpes et du Jura].&amp;lt;/ref&amp;gt;是于100多年前由Jaccard提出的，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{|Γ(x)| \cap |Γ(y)|}{|Γ(x)| \bigcup  |Γ(y)|}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第4个指标Sorensen指标&amp;lt;ref name=&amp;quot;[4]&amp;quot;&amp;gt;Sørensen, T, Sørensen, T A, Sørensen, T J (1948) [https://pattern.swarma.org/paper?id=ea7f2902-6e74-11ea-9db3-0242ac1a0005 A method of establishing groups of equal amplitude in plant sociology based on similarity of species content and its application to analyses of the vegetation on Danish commons].&amp;lt;/ref&amp;gt;常用于生态学研究，其定义为 &amp;lt;math&amp;gt;s{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{kx + ky}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第5个指标大度节点有利指标&amp;lt;ref name=&amp;quot;[5]&amp;quot;&amp;gt;E. Ravasz,A. L. Somera,D. A. Mongru,Z. N. Oltvai,A. -L. Barabasi (2002) [https://pattern.swarma.org/paper?id=6eb98b7e-6e91-11ea-81b9-0242ac1a0005 Hierarchical organization of modularity in metabolic networks].arXiv:0209244.&amp;lt;/ref&amp;gt;（Hub promoted index，HPI）被用来定量刻画新陈代谢网络中每对反应物的拓扑相似程度，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{min\{k_x,k_y\}}&amp;lt;/math&amp;gt;，由于分母只由度较小的节点决定，在此定义下可知大度节点（hub）与其他节点之间更容易具有高的相似性。&lt;br /&gt;
&lt;br /&gt;
第6个指标大度节点不利指标&amp;lt;ref name=&amp;quot;[6]&amp;quot;&amp;gt;Tao Zhou,Linyuan Lu,Yi-Cheng Zhang (2009) [https://pattern.swarma.org/paper?id=7a2b26ba-6e92-11ea-9ee2-0242ac1a0005 Predicting Missing Links via Local Information].arXiv:0901.0553.&amp;lt;/ref&amp;gt;（hub depressed index, HDI）定义与HPI相似，只是分母取两端节点度的最大值，即 &amp;lt;math&amp;gt;s_{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{max\{k_x,k_y\}}&amp;lt;/math&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
第7个指标LHN-I指标&amp;lt;ref name=&amp;quot;[7]&amp;quot;&amp;gt;E. A. Leicht,Petter Holme,M. E. J. Newman (2005) [https://pattern.swarma.org/paper?id=71890c4e-6f0e-11ea-b30e-0242ac1a0005 Vertex similarity in networks].arXiv:0510143.&amp;lt;/ref&amp;gt;是由Leicht，Holme和Newman提出，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{{k_xk_y}}&amp;lt;/math&amp;gt;，其中分母&amp;lt;math&amp;gt;k_xk_y&amp;lt;/math&amp;gt; 正比于节点&amp;lt;math&amp;gt;v_x&amp;lt;/math&amp;gt;和节点&amp;lt;math&amp;gt;v_y&amp;lt;/math&amp;gt;共同邻居数的期望值，即 &amp;lt;math&amp;gt;E( |Γ(x)| \cap |Γ(y)|)&amp;lt;/math&amp;gt;。在下面这篇文献中，Leicht等人同时提出了另一个基于路径的指标，为了有所区别，将此局部指标命名为LHN-I指标，将基于路径的指标命名为LHN-II指标：&lt;br /&gt;
&lt;br /&gt;
第8个指标PA（preferential attachment）是基于BA无标度网络模型中新加入节点倾向于和度大的节点相连的优先连接机制而提出的，在这种机制的链路预测中，每一步首先去除一条链接，然后再添加一条链接，新链接连接节点&amp;lt;math&amp;gt;v_x&amp;lt;/math&amp;gt;和&amp;lt;math&amp;gt;v_y&amp;lt;/math&amp;gt;的概率就正比于两节点度的乘积，由此可以定义两节点间的优先连接相似性：&amp;lt;math&amp;gt;s_{xy}= k_xk_y&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第9个指标AA（Adamic-Adar）&amp;lt;ref name=&amp;quot;[8]&amp;quot;&amp;gt;Adar, Adamic L A, E (2003) [https://pattern.swarma.org/paper?id=e4726a06-6f2d-11ea-8846-0242ac1a0005 Friends and neighbors on the web].Social networks.25.(211--230)&amp;lt;/ref&amp;gt;的基本思想是度小的共同邻居节点的贡献大于度大的共同邻居节点，因此根据共同邻居节点的度为每个节点赋予一个权重值。这一点很容易理解，例如在微博中受关注较多的人往往是某个领域的专家或名人，因此共同关注他们的人之间可能并不拥有特别相似的兴趣——一个中学生和一个企业家都有可能是姚晨的粉丝。相反，如果两个人共同关注了一个粉丝很少的人（非名人），那么说明这两个人确实具有相同的兴趣爱好或者重叠的社交圈，因此有更高概率相连。又如在推荐系统中，共同购买冷门产品的两个用户往往比共同购买热门产品的用户更相似。AA指标根据共同邻居节点的度为每个节点赋予一个权重值，该权重等于该节点的度的对数分之一，即AA指标的定义为：&amp;lt;math&amp;gt;s_{xy}=\sum _{z\in \Gamma (x)\bigcap \Gamma (y)}\frac{1}{logk_z}&amp;lt;/math&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
第10种指标RA是受网络资源分配过程的启发，周涛等人提出的“'''资源分配指标 Resource allocation'''”，其与AA指标有异曲同工之妙。RA和AA指标最大的区别就在于赋予共同邻居节点权重的方式不同，前者是以 1/k 的形式递减，后者是以 1/logk 的形式递减。可见，当网络的平均度较小时，RA和AA差别不大；但是当平均度较大时，就有很大的区别了。研究显示，RA指标在刻画加权网络和社区挖掘应用中的表现胜过AA指标，图灵奖得主Hopdroft的一篇论文也显示，可以利用社区等中观结构信息改进局部指标，其中RA指标改进后的效果最佳。&lt;br /&gt;
&lt;br /&gt;
*基于路径的相似性指标&lt;br /&gt;
&lt;br /&gt;
基于共同邻居的相似性指标的优势在于计算复杂度较低，但是由于使用的信息非常有限，预测精度受到限制，因此发展出了基于路径的相似性指标，主要有3个，分别是局部路径指标 Local path 、Katz指标和LHN-II指标。&lt;br /&gt;
&lt;br /&gt;
1.局部路径指标&lt;br /&gt;
&lt;br /&gt;
周涛等人在共同邻居的基础上考虑三阶路径的因素，提出了基于局部路径的相似性指标，其定义为 &amp;lt;math&amp;gt; S=A^2+\alpha A^3&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 为可调参数，A 表示网络的邻接矩阵， &amp;lt;math&amp;gt;(A^3)_{xy}&amp;lt;/math&amp;gt;表示节点 &amp;lt;math&amp;gt;V_x&amp;lt;/math&amp;gt; 和 &amp;lt;math&amp;gt;V_y&amp;lt;/math&amp;gt; 之间长度为3的路径数目。当&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; = 0时，LP指标就退化为 CN 指标。 CN 指标本质上也可看成基于路径的指标，只是它仅考虑了二阶路径数目。局部路径指标可以扩展为更高阶的情形，即考虑n阶路径的情况：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt; S^n=A^2+\alpha\cdot A^3+\alpha^2\cdot A^4+\cdots +\alpha^{n-2}\cdot A^n &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
随着 n 的增加，局部路径指标的计算复杂度越来越大。一般而言，考虑 n 阶路径的计算复杂度为O(N&amp;lt;k&amp;gt;^n)。但是当 n 趋于无穷大的时候，局部路径指标相当于考虑网络全部路径的Katz指标，此时计算量反而有可能下降，因为可转变为计算矩阵的逆&amp;lt;ref name=&amp;quot;[10]&amp;quot;&amp;gt;Linyuan Lü, Ci-Hang Jin,  Tao Zhou () [https://pattern.swarma.org/paper?id=ba461814-70a3-11ea-8026-0242ac1a0005 Similarity Index Based on Local Paths for Link Prediction of Complex Networks].&amp;lt;/ref&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
2.Katz指标&lt;br /&gt;
&lt;br /&gt;
Katz指标考虑了所有网络的路径，因此其定义为：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S_{xy}=\sum_{l=1}^{\infty }\alpha^l\cdot\left |  paths_{x,y}^{&amp;lt;l&amp;gt;} \right |= \alpha A_{xy}+\alpha^2\cdot (A^2)_{xy}+\alpha^3\cdot (A^3)_{xy}+\cdots  &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\alpha &amp;gt; 0&amp;lt;/math&amp;gt; 为控制路径权重的可调参数，&amp;lt;math&amp;gt;\left |  paths_{x,y}^{&amp;lt;l&amp;gt;} \right |&amp;lt;/math&amp;gt;表示连接节点 &amp;lt;math&amp;gt;V_x&amp;lt;/math&amp;gt;和  &amp;lt;math&amp;gt;V_y&amp;lt;/math&amp;gt; 的路径中长度为 l 的路径数。要使上述级数收敛，则参数&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 应小于邻接矩阵最大特征值的倒数，此定义还可以表示为：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S = (I - \alpha\cdot A)^{-1} - I&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
显然，当参数&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 很小时，高阶路径的贡献也较小，使得 Katz 指标的预测结果接近于局部路径指标&amp;lt;ref name=&amp;quot;[11]&amp;quot;&amp;gt;Leo Katz (1953) [https://pattern.swarma.org/paper?id=b2dee81c-70b2-11ea-b7f9-0242ac1a0005 A new status index derived from sociometric analysis].psychometrika.18.1:(39-43)&amp;lt;/ref&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
3.LHN-II指标&lt;br /&gt;
&lt;br /&gt;
LHN-II 指标是 Leicht，Holme 和 Newman 提出的另一种相似性计算方法，他的基本思想是基于'''一般等价 Regular equivalence''' 提出的。与结构等价不同，一般等价的定义更广泛。在一般等价的定义下，如果两个节点所连接的节点之间相似，那么这两个节点也相似，即使它们之间没有共同的邻居节点。&lt;br /&gt;
&lt;br /&gt;
下图给出了一个简单的例子来帮助我们理解结构等价和一般等价的区别。根据结构等价的定义，在公司A内部，由于员工a和员工b都认识员工e和员工f（即它们有两个共同邻居节点），于是称员工a和员工b是结构等价的。同理，员工e和员工f也是结构等价的，同样地，在公司B中，员工c和员工d是结构等价的，员工g和员工h也是结构等价的。现在考虑员工a和员工c是否相似？根据一般等价的定义，由于员工a连接的节点e、f与员工c连接的节点g、h分别是相似的，那么我们可以认为员工a和员工c也是相似的，同理，在一般等价的意义下，员工b和员工d也是相似。从这个例子可以看出，结构相似性或称结构等价更强调的是两个节点是否在同一个环境下，也就是说是否连接了相同的节点；然而一般等价考虑的是这两个节点是否处于同样的角色，即使他们没有相同的邻居节点，但是由于各自的邻居节点之间本身相似，这两个节点也相似。一般等价意义下的相似性是LHN-II指标的核心。&lt;br /&gt;
&lt;br /&gt;
[[File:一般等价和结构等价示例.png|600px|thumb|一般等价和结构等价示例（图中实线表示连接，虚线表示相似关系）|center]]&lt;br /&gt;
&lt;br /&gt;
从一般等价的角度考虑，LHN-II指标认为如果两个节点的邻居节点之间是相似的，那么这两个节点也是相似的。它与Katz指标的区别主要是把Katz指标中的&amp;lt;math&amp;gt; (A^{n})_{xy} &amp;lt;/math&amp;gt;变成 &amp;lt;math&amp;gt;  (A^{n})_{xy}&amp;lt;/math&amp;gt; 的期望值，注意到 &amp;lt;math&amp;gt; (A^{n})_{xy}&amp;lt;/math&amp;gt; 的期望值为 &amp;lt;math&amp;gt; E\left [ (A^l)_{xy} \right ]=\frac{k_xk_y}{M}\lambda _1^{l-1}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\lambda_1&amp;lt;/math&amp;gt;为矩阵A的最大特征值，则LHN-II指标的表达式如下：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 S_{xy}^{LHN2}=\delta _{xy} + \sum_{l=1}^{\infty }\Phi ^l \frac{(A^l)_{xy}}{E\left [ (A^l)_{xy} \right ]}&lt;br /&gt;
=\delta _{xy} + \frac{2M}{k_xk_y}\sum_{l=1}^{\infty }\Phi ^l\lambda _1^{1-l}(A^l)_{xy}&lt;br /&gt;
=\left [ 1 - \frac{2 M \lambda_1}{k_xk_y} \right ]\delta _{xy} + \frac{2 M \lambda_1}{k_xk_y}\left [ (I-\frac{\Phi}{\lambda_1} A )^{-1} \right ]_{xy}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\delta _{xy}&amp;lt;/math&amp;gt;为 Kronecker &amp;lt;math&amp;gt;\delta&amp;lt;/math&amp;gt; 函数，&amp;lt;math&amp;gt; \Phi&amp;lt;/math&amp;gt; 为取值小于1的参数。上式最后一个等式的第一项是可以去掉的对角阵，从而相似性矩阵可以写为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S=2M\lambda_1D^{-1}(I-\frac{\Phi A}{\lambda_1})^{-1}D^{-1}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中''D''为度值矩阵，&amp;lt;math&amp;gt;D_{xy} = \delta_{xy} \cdot k_{x}&amp;lt;/math&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
*基于随机游走的节点相似性指标&lt;br /&gt;
&lt;br /&gt;
还有相当数量的相似性指标是基于随机游走过程定义的，包括'''平均通勤时间 Average commute time''' 、'''Cos+指标'''、'''有重启的随机游走 Random walk with restart'''、'''SimRank'''指标、'''局部随机游走指标 Local random walk''' 和'''有叠加效应的随机游走指标 Superposed random walk'''等。&lt;br /&gt;
&lt;br /&gt;
1.平均通勤时间 ACT &amp;lt;ref name=&amp;quot;[12]&amp;quot;&amp;gt;D. J. Klein,M. Randić (1993) [https://pattern.swarma.org/paper?id=b5177044-70c7-11ea-b241-0242ac1a0005 Resistance distance].journal of mathematical chemistry.12.1:(81-95)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
设&amp;lt;math&amp;gt;m(x,y)&amp;lt;/math&amp;gt; 为一个随机粒子从节点x到节点y平均需要走的步数，那么节点x和y的平均通勤时间定义为：&amp;lt;math&amp;gt;n(x , y) = m(x , y) + m(y , x) &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其数值解可通过求该网络拉普拉斯矩阵&amp;lt;math&amp;gt;L&amp;lt;/math&amp;gt; 的伪逆&amp;lt;math&amp;gt; L^+&amp;lt;/math&amp;gt; 获得，即 &amp;lt;math&amp;gt;n(x,y)=M(l^+_{xx} +l^+_{yy} - 2l^+_{xy})&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;l^{+}_{xy}&amp;lt;/math&amp;gt;表示矩阵&amp;lt;math&amp;gt;L^+ &amp;lt;/math&amp;gt;中相应位置的元素。如果两个节点的平均通勤时间越小，那么两个节点越进阶。由此，定义基于ACT的相似性为（在此可忽略常数M）&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{ACT}=\frac{1}{l^+_{xx} +l^+_{yy} - 2l^+_{xy}}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
2.余弦相似性指标 Cos+指标&amp;lt;ref name=&amp;quot;[13]&amp;quot;&amp;gt;Fouss F, Pirotte A, Renders J M (2007) [https://pattern.swarma.org/paper?id=f3ce12c4-70c8-11ea-8ff9-0242ac1a0005 Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation].IEEE Transactions on knowledge and data engineering.19.(355-369)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
在由向量&amp;lt;math&amp;gt;v_x = \Lambda ^{1/2}U^{T}e_{x}&amp;lt;/math&amp;gt;展开的欧式空间内，&amp;lt;math&amp;gt;L^+ &amp;lt;/math&amp;gt;中的元素&amp;lt;math&amp;gt;l^{+}_{xy}&amp;lt;/math&amp;gt;可表示为两向量&amp;lt;math&amp;gt;v_x&amp;lt;/math&amp;gt;和&amp;lt;math&amp;gt;v_y&amp;lt;/math&amp;gt;的内积，即&amp;lt;math&amp;gt; l^{+}_{xy} = v_{x}^{T} v_y&amp;lt;/math&amp;gt;，其中&amp;lt;math&amp;gt;U&amp;lt;/math&amp;gt;是一个标准正交矩阵，由&amp;lt;math&amp;gt;L^+&amp;lt;/math&amp;gt;特征向量按照对应的特征根从大到小排列，&amp;lt;math&amp;gt;\Lambda&amp;lt;/math&amp;gt;为以特征根为对角元素的对角矩阵，&amp;lt;math&amp;gt;e_{x}&amp;lt;/math&amp;gt; 表示一个一维向量且只有第x个元素为1，其他都为0。由此定义余弦相似性如下：&lt;br /&gt;
&lt;br /&gt;
s_{xy}^{cos+}=cos(x,y)^+=\frac{l_{xy}^+}{\sqrt{l^+_{xx} \cdot l^+_{yy}}}&lt;br /&gt;
&lt;br /&gt;
3.重启的随机游走 RWR&amp;lt;ref name=&amp;quot;[14]&amp;quot;&amp;gt;Brin, S, Page, L (1998) [https://pattern.swarma.org/paper?id=15405998-70ca-11ea-b1b5-0242ac1a0005 The anatomy of a large-scale hypertextual web search engine].&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
这个指标可以看成是PageRank 算法的拓展应用。它假设随机游走粒子在每走一步的时候都以一定概率返回初始位置。设粒子返回概率为 1-c，&amp;lt;math&amp;gt;P&amp;lt;/math&amp;gt; 为网络的马尔科夫概率转移矩阵，其元素 &amp;lt;math&amp;gt;P_{xy} = a_{xy}/k_{x} &amp;lt;/math&amp;gt;表示节点x处的粒子下一步走到节点y的概率。其中如果节点x和节点y相连，则&amp;lt;math&amp;gt;a_{xy}=1&amp;lt;/math&amp;gt;，否则&amp;lt;math&amp;gt;a_{xy}=0&amp;lt;/math&amp;gt;。某一粒子初始时刻在节点x处，那么t+1时刻该粒子到达网络各个节点的概率向量为&lt;br /&gt;
&amp;lt;math&amp;gt;q_{x}(t+1) = c \cdot P^{T}q_{x}(t) + (1-c) e_{x}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;e_{x}&amp;lt;/math&amp;gt;表示初始状态（其定义与Cos+中相同），上式的稳态解为&amp;lt;math&amp;gt;q_{x} = (1-c)(I-cP^{T})^{-1}e_{x}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中元素&amp;lt;math&amp;gt;q_{xy}&amp;lt;/math&amp;gt;为从节点x出发的粒子最终有多少概率走到节点y。由此定义RWR相似性如下：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{RWR} = q_{xy} + q_{yx} &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
4.SimRank指标 SimR&amp;lt;ref name=&amp;quot;[15]&amp;quot;&amp;gt;Jeh G, Widom J. SimRank (2002) [https://pattern.swarma.org/paper?id=593e78e0-70cb-11ea-9743-0242ac1a0005 a measure of structural-context similarity].(538-543)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
它的基本假设是，如果两节点所连接的节点相似，那么这两个节点就相似。其自洽定义式为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{simR}=C\frac{\sum_{v_z\in \Gamma (x)}\sum_{{v_z}'\in \Gamma (y)}s_{zz'}^{simR}}{k_xk_y}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中假定 &amp;lt;math&amp;gt;s_{xx} =1, C \in [0,1] &amp;lt;/math&amp;gt;为相似性传递时的衰减参数。&lt;br /&gt;
&lt;br /&gt;
SimR指标同时考虑了结构等价和一般等价。当节点x的邻居z同时也是节点y的邻居时，该指标考虑了结构等价；当节点x不等于节点y时，该指标概率了一般等价。可以证明，SimR指标可以用来描述两个分别从节点x和y出发的粒子平均过多久会相遇。&lt;br /&gt;
&lt;br /&gt;
5.局部随机游走指标 LRW&amp;lt;ref name=&amp;quot;[16]&amp;quot;&amp;gt;Weiping Liu,Linyuan Lu (2010) [https://pattern.swarma.org/paper?id=98d1a08e-70eb-11ea-a520-0242ac1a0005 Link Prediction Based on Local Random Walk].arXiv:1001.2467.89.(58007)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
上述4种随机游走指标是基于全局的随机游走，这类指标往往计算复杂度很高，因此很难在大规模网络上应用。刘伟平和吕琳媛提出了一种基于网络局部随机游走的相似性指标LRW，它只考虑有限步数的随机游走过程。一个粒子 t 时刻从节点x出发，定义&amp;lt;math&amp;gt;π_{xy} (t) &amp;lt;/math&amp;gt;为 t+1 时刻这个粒子正好走到节点y的概率，那么可得到系统演化方程：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\pi_{x} (t + 1) = P^T\pi_{x}(t)，t=0,1,…&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\pi_{x}(0) &amp;lt;/math&amp;gt;为一个&amp;lt;math&amp;gt;Nx1 &amp;lt;/math&amp;gt;的向量，只有第x 个元素为1，其他为0，即&amp;lt;math&amp;gt;\pi_{x}(0) =e_x&amp;lt;/math&amp;gt;。设定各个节点的初始资源分布为&amp;lt;math&amp;gt;q_x&amp;lt;/math&amp;gt;，那么基于t步随机游走的相似性为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{LRW} = q_{xy} + q_{yx}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
6.叠加的局部随机游走指标 SRW&amp;lt;ref name=&amp;quot;[16]&amp;quot;&amp;gt;Weiping Liu,Linyuan Lu (2010) [https://pattern.swarma.org/paper?id=98d1a08e-70eb-11ea-a520-0242ac1a0005 Link Prediction Based on Local Random Walk].arXiv:1001.2467.89.(58007)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
这个指标给邻近目标节点的点更多的机会与目标节点相连，充分考虑了很多真实网络连接上的局域性特点，它是在LRW的基础上，将t步及其以前的结果加总，便得到SRW的值，即：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{SRW}(t)=\sum_{t}^{l=1}s_{xy}^{LRW}(l) = q_x\sum_{t}^{l=1}\pi_{xy}(l) + q_y\sum_{t}^{l=1}\pi_{yx}(l)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===基于似然分析的链路预测===&lt;br /&gt;
&lt;br /&gt;
基于相似性的链路预测方法，是最简单的一种分析框架，除此之外，还有另一种最复杂的链路预测分析框架——基于似然分析的链路预测。这个框架本身远远复杂于基于相似性的框架，而且框架中的每一个组成成分自身都非常复杂，但这个框架下衍生出的算法除了给出链路预测的结果之外，还给出了我们对于网络结构的深刻洞见，例如“'''层次结构模型 Hierachical structure model'''”给出了网路层次组织形态的定量刻画，“'''随机分块模型 Stochastic block model'''”类似于社区分解一样把网络划分成了若干子块。这些对理解网络结构特征方面的贡献，是基于相似性的框架所不能提供的。&lt;br /&gt;
&lt;br /&gt;
基于似然分析的链路预测的基本思路是：根据网络结构的产生和组织方式以及目前已经观察到的链路计算网络的似然值，并认为真实的网络使得网络似然值最大，然后再根据网络似然最大化计算每一对未连接的节点产生连边的可能性。&lt;br /&gt;
&lt;br /&gt;
*层次结构模型 HSM&amp;lt;ref name=&amp;quot;[17]&amp;quot;&amp;gt;Aaron Clauset,Cristopher Moore,M. E. J. Newman (2008) [https://pattern.swarma.org/paper?id=1ca0e946-70ed-11ea-82c3-0242ac1a0005 Hierarchical structure and the prediction of missing links in networks].arXiv:0811.0484.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
层次结构模型假设真实的网络都存在某种层次性，网络的连接则可看作是这种内在层次结构的反映。该方法的计算步骤如下：&lt;br /&gt;
&lt;br /&gt;
1.一个N个节点的网络可以用一个包含N个叶子节点的族谱树表示，这N个叶子节点将由N-1个非叶子节点连接起来，其中每个非叶子节点都有一个概率值，则两个叶子节点连接的概率就等于他们最近共同祖先节点的概率值。给定一个族谱树，将网络的似然值最大化，就可以得到非叶子节点的概率值，并由此计算出这一个族谱树所对应的网络最大的似然值。&lt;br /&gt;
&lt;br /&gt;
2.使用马尔科夫链蒙特卡洛方法对网络不同的族谱树进行抽样，使得每个族谱树出现的频次正比于该树对应的最大的网络似然值。两个节点连边的概率就等于所有抽样出来的族谱树中两个节点连边概率的平均值。注意似然高的族谱树会出现多次，因此对这个平均概率的贡献也大。&lt;br /&gt;
&lt;br /&gt;
3.把平均连边概率看做是相似性框架中的相似性指标&amp;lt;math&amp;gt;s_{xy}&amp;lt;/math&amp;gt;，按照这个值从大到小排序，排在前面的就是预测的连边。&lt;br /&gt;
&lt;br /&gt;
需要指出的是，层次结构模型在处理具有明显层次结构的网络（如恐怖袭击网络和草原食物链）时具有较高的精确度，但在处理一般性网络时效果并不一定突出。&lt;br /&gt;
&lt;br /&gt;
*随机分块模型 SBM&lt;br /&gt;
&lt;br /&gt;
与层次结构模型的思想类似，随机分块模型假设网络中的节点可以被分为若干集合，两个节点间连接的概率只与相应的集合有关。换句话说，同一个群众所有节点的地位是相同的。随机分块模型特别适合刻画节点所属群的成员身份对于其连接行为有关键影响的情况，例如，著名的“角色模型”就包含了随机分块模型的理念。&amp;lt;ref name=&amp;quot;[18]&amp;quot;&amp;gt;Roger Guimerà,Marta Sales-Pardo,Luís A. N. Amaral (2006) [https://pattern.swarma.org/paper?id=aa2a88c0-7107-11ea-a3cf-0242ac1a0005 Classes of complex networks defined by role-to-role connectivity profiles].nature physics.3.1:(63-69)&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;[19]&amp;quot;&amp;gt;Joerg Reichardt,Douglas R. White (2007) [https://pattern.swarma.org/paper?id=f20b0e20-7108-11ea-9e3d-0242ac1a0005 Role models for complex networks].arXiv:0708.0958.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
随机分块模型的效果要好于层次结构模型。同时，该方法还可以剔除网络的错误连边，如纠正蛋白质相互作用网络中的错误连边。&lt;br /&gt;
&lt;br /&gt;
*闭路模型 Loop model&amp;lt;ref name=&amp;quot;[20]&amp;quot;&amp;gt;吕琳媛,Xiaolong Ren,周涛 (2016) [https://pattern.swarma.org/paper?id=f5d29350-710a-11ea-9346-0242ac1a0005 网络链路预测：概念与前沿].&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
似然分析的更一般的框架是：给定一个网络系统，特定网络哈密顿量的负指数被统计分配函数归一化后，就得到这个网络出现的似然，一条未被观察到的连边存在的可能性就等于添加这条连边后网络的似然值。闭路模型考虑网络结构形成中的“局部性原则”，并由此定义了网络的哈密顿量。实验表明，闭路模型的预测精度大于层次结构模型和随机分块模型。&lt;br /&gt;
&lt;br /&gt;
===基于机器学习的链路预测===&lt;br /&gt;
&lt;br /&gt;
用机器学习的思路进行链路预测，主要分为基于特征分类方法、基于概率图模型方法和基于矩阵分解方法三大类。&lt;br /&gt;
&lt;br /&gt;
*基于特征分类方法&amp;lt;ref name=&amp;quot;[20]&amp;quot;&amp;gt;Al Hasan, M, Chaoji, V, Salem, S (2006) [https://pattern.swarma.org/paper?id=0cae2084-710c-11ea-bbd8-0242ac1a0005 Link prediction using supervised learning].counter-terrorism and security..30.(798--805)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
网络中的链路预测问题可以看成机器学习中的分类问题，其中每个数据点对应一对节点之间关系的标记，假定两个节点之间存在连边，则数据点的值为+1，否则为-1。特征选取是分类问题中最重要的问题之一，目前研究较多的主要包括基于节点与边的属性特征和基于节点所处网络的拓扑结构特征（如CN、AA、Katz、最短路径）等。哈桑 Hasan 等人提取合著网络中科学家研究领域的关键词作为特征，用监督学习中一些常用的分类算法（如决策树、K近邻法、多层感知器、支持向量机、径向基网络）对缺失的连边进行较为精准的预测，其中以支持向量机方法表现最佳。&lt;br /&gt;
&lt;br /&gt;
*基于概率图模型&amp;lt;ref name=&amp;quot;[21]&amp;quot;&amp;gt;Backstrom, L, Leskovec, J (2011) [https://pattern.swarma.org/paper?id=8ccaa454-710c-11ea-9eeb-0242ac1a0005 Supervised random walks: predicting and recommending links in social networks].Proceedings of the fourth ACM international conference on Web search and data mining.(635--644)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
基于概率图模型的链路预测方法使用图模型来表达节点之间的连边概率，根据模型中概率依赖关系，可分为有向无环的贝叶斯网络和无向的马尔科夫网络。随机分块模型和层次结构模型分别是典型的基于贝叶斯网络和基于马尔科夫网络的链路预测方法。基于概率图模型的链路预测方法有很多，典型的还有有监督随机游走链路预测算法，将网络结构信息与节点和连边的属性信息结合起来，给每条边分配不同的转移概率。与其他有监督的机器学习方法相比，该算法无须知道网络的特征和相关的领域知识。&lt;br /&gt;
&lt;br /&gt;
*基于矩阵分解&lt;br /&gt;
&lt;br /&gt;
基于矩阵分解的链路预测方法是基于网络邻接矩阵的代数谱变换而得到的方法，来预测网络中链路的存在性和链路的权值&amp;lt;ref name=&amp;quot;[22]&amp;quot;&amp;gt;Kunegis, J, Lommatzsch, A (2009) [https://pattern.swarma.org/paper?id=2908af64-710d-11ea-b513-0242ac1a0005 Learning spectral graph transformations for link prediction].Proceedings of the 26th Annual International Conference on Machine Learning.(561--568)&amp;lt;/ref&amp;gt;。相比其他几种机器学习方法，该方法要学习的参数少很多，但计算复杂度较高。链路预测问题可以视为邻接矩阵填充问题，并可以通过双线性回归模型将节点和链路的显特征和隐特征结合起来用矩阵分解方法解决&amp;lt;ref name=&amp;quot;[23]&amp;quot;&amp;gt;Menon A K, Elkan, C (2011) [https://pattern.swarma.org/paper?id=7f0ab830-710d-11ea-9143-0242ac1a0005 Link prediction via matrix factorization].(437--452)&amp;lt;/ref&amp;gt;。边缘去噪模型将根据给定关系矩阵求未知边或丢失边的问题变成一个矩阵降噪去噪问题&amp;lt;ref name=&amp;quot;[24]&amp;quot;&amp;gt;Chen, Z, Zhang, W. (2014) [https://pattern.swarma.org/paper?id=d925d57a-710d-11ea-90c5-0242ac1a0005 A marginalized denoising method for link prediction in relational data].Proceedings of the 2014 SIAM International Conference on Data Mining. Society for Industrial and Applied Mathematics.(298--306)&amp;lt;/ref&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
关于不同的链路预测研究方法的分类可以参考下表：&lt;br /&gt;
[[File:Link preditction method.png|600px|thumb|三类不同的链路预测方法（*表示该方法含有参数）|center]]&lt;br /&gt;
&lt;br /&gt;
==应用场景==&lt;br /&gt;
链路预测有着广泛的应用场景：在生物领域，利用蛋白质间相互作用关系的结构信息进行链路预测，可以为实验的测定提前提供参考依据，从而降低实验成本、提高成功率；在社交网络领域，链路预测可以对社交网络中的好友关系、朋友推荐进行预测，从而提高用户对社交网站的体验满意度和使用黏性；在电子商务领域，除了传统的协同过滤推荐算法外，利用网络结构信息（如网络三角形结构）等特征进行商品推荐也取得了显著的优势；此外，通过识别隐藏的链边或异常的链边对信息不完全或含有噪音的网络进行重构，可以提高网络的传输能力，这对于航空网络重构有很大的启发意义。&lt;br /&gt;
[[File:Figure2.png|400px|thumb|链路预测应用场景示意图（图片来自网络）|center]]&lt;br /&gt;
&lt;br /&gt;
除此之外，链路预测的算法和思想通过一些变换还可以用来解决一些看似没有太大关系的问题。例如，对疾病信号和股票指数的预测。基于链路预测的思想和方法，我们还可以设计基于节点相似性的社团划分以及对网络演化模型的定量化评估方法。链路预测还可以帮助提高节点标签预测的精度，特别是在已知标签节点稀疏的情况下效果显著。这一方法可以应用于判断一篇学术论文的类型，判断一本书的政治态度（中立、自由派或保守派），或者判断一个手机用户是否产生了更换电信运营商的念头。&lt;br /&gt;
&lt;br /&gt;
==代表人物==&lt;br /&gt;
*'''吕琳媛'''&lt;br /&gt;
吕琳媛主要研究方向为复杂网络信息挖掘领域，包括海量信息导航、挖掘、推荐和预测。目前担任阿里巴巴复杂科学研究中心副主任，中欧联合实验室执行主任，中国工业与应用数学学会复杂网络与系统控制专业委员会委员，杭州市特聘专家。&lt;br /&gt;
[[File:Lvlinyuan.png|400px|thumb|吕琳媛，阿里巴巴复杂科学研究中心副主任|center]]&lt;br /&gt;
&lt;br /&gt;
近年来主持/参与国家级项目5项（2016年获得国家自然科学基金优秀青年基金），省部级项目4项，横向课题4项。 在相关领域发表学术论文 50余篇，其中SCI论文39篇，总影响因子122，发表期刊包括Physics Reports，PNAS，Nature Communications等国际知名学术期刊。三篇论文入选ESI全球Top-1%高引用论文，论文SCI引用1200余次，谷歌学术引用3000余次，其中9篇论文引用超过100次。2013年出版学术专著《链路预测》获得第四届中国大学出版社图书奖优秀学术著作一等奖。申请发明专利12项。2015年荣获浙江省杰出青年基金，2014年荣获中国计算机学会自然科学二等奖，中国网络科学论坛青年希望奖，首届CCF-腾讯犀牛鸟基金优秀奖。&lt;br /&gt;
&lt;br /&gt;
*'''周涛'''&lt;br /&gt;
周涛主要从事复杂性科学和大数据挖掘算法和应用研究，先后攻克推荐系统准确性-多样性困境、复杂网络链路可预测性、H指数-度-核心度关系等图挖掘领域的重要难题，成果发表在PNAS, Nature Communications, Physics Reports, KDD和ICDM等国际顶尖期刊和会议上。目前论文google总引用超过14000次，其中8篇论文入选ESI高引用论文，H指数为57，2014和2015连续两年入选Elsevier最具国际影响力中国科学家名单。&lt;br /&gt;
[[File:Zhoutao.png|400px|thumb|周涛，第十二届中国青年科技奖|center]]&lt;br /&gt;
&lt;br /&gt;
因其在科学研究上的杰出表现，2011年获得第十二届中国青年科技奖（最年轻获奖者），2011年入选四川省“百人计划”，2012年获得国家首批优秀青年科学基金资助，2013年入选国家“万人计划”首批青年拔尖人才支持计划，2014年获得四川省科技进步一等奖、中国计算机学会自然科学奖，2015年获得共青团中央授予的“最美青年科技工作者”称号，并与屠呦呦等七名个人和北斗导航等三个团队共同当选2015年度中国十大科技创新人物。&lt;br /&gt;
&lt;br /&gt;
*'''马克·纽曼 Mark Newman'''&lt;br /&gt;
Newman是一名英裔美国物理学家，也是密歇根大学 University of Michigan 物理学系的阿纳托尔·拉波特 Anatol Rapoport 杰出教授，也是圣达菲研究所 Santa Fe Institute 的外部教员。他因在复杂网络和复杂系统领域的基础性贡献而闻名，为此他被授予2014年拉格朗日奖。&lt;br /&gt;
[[File:Newman.png|400px|thumb|Mark Newman，密歇根大学物理学系阿纳托尔·拉波特杰出教授|center]]&lt;br /&gt;
&lt;br /&gt;
Newman以其对复杂网络的研究而著称，尤其是在科学家的协作模式，随机图论 Random graph theory，社区结构 Community structure，渗流理论 Percolation theory 和网络流行病学 Network epidemiology方面的工作。他作为共同发明人，与迈克尔·卡斯特 Michael Gastner 一起，发明了一种可以产生密度均衡地图 Density-equalizing maps 或统计地图 Cartograms的方法，该方法构成了Worldmapper网站的基础。他们的工作在2004年美国总统大选后受到关注，成为了当时被广泛传播的一种选举结果地图的基础，（他们）根据各州的人口数调整了州的规模，以便更准确地了解每个党派的选民投票人数。&lt;br /&gt;
&lt;br /&gt;
*'''克里斯托弗·大卫·摩尔 Cristopher David Moore'''&lt;br /&gt;
克里斯托弗·大卫·摩尔 Cristopher David Moore，也称为克里斯·摩尔 Cris Moore 是美国计算机科学家，数学家和物理学家。他是圣达菲研究所的驻校教师，曾任新墨西哥大学 University of New Mexico 的正教授。&lt;br /&gt;
[[File:Cristopher_David_Moore.png|400px|thumb|Cristopher David Moore，圣达菲研究所的驻校教师|center]]&lt;br /&gt;
&lt;br /&gt;
1993年，Moore 发现了一种新颖的解决三体问题的方法，表明在牛顿力学中，三个等质量的物体有可能沿着一条八字形曲线、在同一条轨道相互跟随。Moore 在网络科学领域也很活跃，在该领域有许多著名的出版物。在与Clauset和Mark Newman的合作中，Moore开发了复杂网络的层次聚类概率模型，并表明他们的模型可以在面对网络连接结构发生变化时可靠地预测聚类结果。&lt;br /&gt;
&lt;br /&gt;
*'''亚伦·克劳斯特 Aaron Clauset '''&lt;br /&gt;
Aaron Clauset是一位美国计算机科学家，致力于网络科学，机器学习和复杂系统领域。目前，他在科罗拉多大学博尔德分校 University of Colorado Boulder 教授计算机科学，也是圣菲研究所的外部教员。&lt;br /&gt;
[[File:Aaron_Clauset.png|400px|thumb|  Aaron Clauset，圣菲研究所的外部教员|center]]&lt;br /&gt;
&lt;br /&gt;
Clauset因与Cosma Shalizi和Mark Newman进行的合作研究而闻名，他们针对经验数据中是否存在幂律模式开发了严格的统计检验，并且证明了许多宣称符合幂律分布的网络实际上并不是幂律分布。他还因开发检测复杂网络中的社区结构算法的工作而著称，特别是和Newman、Moore合作发展的网络层次聚类模型。在其他方面，Clauslet 与麦克斯韦·扬 Maxwell Young 、克里斯蒂安·斯克雷德·格莱蒂奇 Kristian Skrede Gleditsch 共同完成了一些独特发现：世界范围内恐怖事件发生的频率和严重性服从幂律分布。&lt;br /&gt;
&lt;br /&gt;
2015年，Clauset 因开发和评估一种网络结构特征的新方法而获得了美国国家科学基金会颁发的著名的CAREER奖。2016年，Clauset因在网络结构方面（包括Internet映射，推断缺失链接和社区结构），以及对人类冲突和社会分层所做的启发性分析方面做出的贡献而获得网络科学学会颁发的网络科学领域的Erdös-Rényi奖。&lt;br /&gt;
&lt;br /&gt;
==参考资料==&lt;br /&gt;
*汪小帆,李翔,陈关荣.《网络科学导论》.北京：高等教育出版社,2012年：178-186&lt;br /&gt;
*吕琳媛,周涛.《链路预测》.北京：高等教育出版社,2013年：57-93&lt;br /&gt;
*吕琳媛,任晓龙,周涛.《网络链路预测：概念与前沿》[J].《中国计算机学会通讯》,2016年,第4期&lt;br /&gt;
*Clauset A, Moore C, Newman M E J. Hierarchical structure and the prediction of missing links in networks [J]. Nature, 2008,453(7191): 98-101.&lt;br /&gt;
*Link Prediction Group 网站：http://www.linkprediction.org/&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
*链接预测可用于分析网络将如何发展，或者在给定信息不完整情况下来发现“丢失”的链接，对于这个问题，有研究者提出了一种新的，结合广义群贴近度中心性和半值相互作用指数的拟局部方法（即考虑半径k内节点的方法），详见 [https://swarma.org/?p=18249 《链路预测的博弈算法》]&lt;br /&gt;
[[File:链路预测的博弈算法.jpg|400px|thumb|[https://swarma.org/?p=18249 《链路预测的博弈算法》]|center]]&lt;br /&gt;
*深度学习已经成功地在图像识别、语音识别、自然语言处理、游戏与博弈等领域取得了突飞猛进的发展，并渗透到了我们的日常生活中。那么，我们有没有可能将这种技术借剪到复杂网 络的研究之中呢？近年来，人们凭借着网络嵌入（Network Embedding）、图卷积神经网络（Graph Convolutional Neural Network）、图注意力模型（Graph Attention Network）等新技术，已经开发了若干图结构上的深度学习算法，并取得了一定的成功应用。北师大系统科学学院教授、博导张江老师亲授[https://campus.swarma.org/play/coursedetail?id=10504 《当复杂网络遇上机器学习》]，将对这些算法以及应用，包括各式各样的网络嵌入算法、节点分类问题、链路预测问题、图分类问题、网络动力学预测问题等做一简单介绍，并对网络上的深度学习问题进行了展望。&lt;br /&gt;
[[File:当复杂网络遇上机器学习.png|400px|thumb|[https://campus.swarma.org/play/coursedetail?id=10504 《当复杂网络遇上机器学习》]|center]]&lt;br /&gt;
*网络上的注意力模型（Graph Attention Model）是一种通用的网络嵌入算法，它能够在节点分类、链路预测等问题上得到极高的精度。它可以模仿一个机器头对网络中的节点进行信息读取和分析，然后将综合的结果放到节点的向量中的过程。[https://campus.swarma.org/play/coursedetail?id=10385 《网络上的注意力模型》]课程将详细介绍这一模型及其应用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''''本中文词条由[[用户:木子二月鸟|木子二月鸟]]用户参与编译，  [[用户: 苏格兰| 苏格兰]]用户审校，欢迎在讨论页面留言'''''。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''本词条内容源自wikipedia及公开资料，遵守 CC3.0协议。'''&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E9%93%BE%E8%B7%AF%E9%A2%84%E6%B5%8B&amp;diff=7640</id>
		<title>链路预测</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E9%93%BE%E8%B7%AF%E9%A2%84%E6%B5%8B&amp;diff=7640"/>
		<updated>2020-05-10T14:46:07Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：/* 基于似然分析的链路预测 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{#seo:|keywords=链路预测 Link Prediction  |description=通过已知的网络节点以及网络结构等信息，预测网络中尚未产生连边的两个节点之间产生连接的可能性。 }}&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
'''链路预测 Link Prediction'''是指如何通过已知的网络节点以及网络结构等信息，预测网络中尚未产生连边的两个节点之间产生连接的可能性。这种预测既包含了对未知链接 Existing yet unknown link，也称丢失链接 Missing link 的预测，也包含了对未来链接 Future link 的预测。&lt;br /&gt;
&lt;br /&gt;
链路预测是将复杂网络与信息科学联系起来的重要桥梁之一，它所要处理的是信息科学中最基本的问题——缺失信息的还原与预测。链路预测相关研究不仅能够推动网络科学和信息科学理论上的发展，而且具有巨大的实际应用价值，譬如可以知道蛋白质相互作用实验、进行在线社交推荐、找出交通传输网络中有特别重要作用的连边等。&lt;br /&gt;
&lt;br /&gt;
==研究方法==&lt;br /&gt;
===基于相似性的链路预测===&lt;br /&gt;
&lt;br /&gt;
*基于局部信息的相似性指标&lt;br /&gt;
&lt;br /&gt;
社会网络分析中经典的三元闭包 Triadic closure 原则指出，如果A、B	两个人拥有一个共同的朋友C，那么这两个人今后也很有可能成为朋友，从而使得3个节点构成一个闭合的三角形ABC。对于一般的网络，我们可以把这一原则推广如下：两个节点的共同邻居越多，这两个节点就越相似，从而更倾向于相互连接。最简单的基于'''共同邻居 Common neighbors''' 的节点相似性指标定义如下：&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
s_{xy}^{CN} =  |Γ(x)| \cap |Γ(y)|&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
在相似性指标定义的基础上，还可以考虑两个节点的共同邻居的相对数量。下表列出了10种基于节点局部信息的相似性指标，第1种是计算共同邻居相似度的基本公式，其中第2至7种相似性指标是直接基于共同邻居指标的不同的规范化而得到的，表中的 k(x) = |Γ(x)| 为节点x的度。第8种指标PA是基于BA无标度网络模型中新加入节点倾向于和度大的节点相连的优先连接机制而提出的。&lt;br /&gt;
&lt;br /&gt;
第9种指标AA的基本思想是度小的共同邻居节点的贡献大于度大的共同邻居节点，因此根据共同邻居节点的度为每个节点赋予一个权重值。这一点很容易理解，例如在微博中受关注较多的人往往是某个领域的专家或名人，因此共同关注他们的人之间可能并不拥有特别相似的兴趣——一个中学生和一个企业家都有可能是姚晨的粉丝。相反，如果两个人共同关注了一个粉丝很少的人（非名人），那么说明这两个人确实具有相同的兴趣爱好或者重叠的社交圈，因此有更高概率相连。又如在推荐系统中，共同购买冷门产品的两个用户往往比共同购买热门产品的用户更相似。&lt;br /&gt;
[[File:Table1.png|600px|thumb|10种基于节点局部信息的相似性指标|center]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
第2个指标Salton指标&amp;lt;ref name=&amp;quot;[2]&amp;quot;&amp;gt;Salton G, McGill M J () [https://pattern.swarma.org/paper?id=15e10152-92c8-11ea-81db-0242ac1a0005 Introduction to Modern Information Retrieval].&amp;lt;/ref&amp;gt;又称余弦相似性，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{|Γ(x)| \cap |Γ(y)|}{\sqrt{k(x)k(y)}}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第3个指标Jaccard指标&amp;lt;ref name=&amp;quot;[3]&amp;quot;&amp;gt;Jaccard P. () [https://pattern.swarma.org/paper?id=70c8a48a-92c8-11ea-9f7f-0242ac1a0005 Etude de la distribution florale dans une portion des Alpes et du Jura].&amp;lt;/ref&amp;gt;是于100多年前由Jaccard提出的，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{|Γ(x)| \cap |Γ(y)|}{|Γ(x)| \bigcup  |Γ(y)|}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第4个指标Sorensen指标&amp;lt;ref name=&amp;quot;[4]&amp;quot;&amp;gt;Sørensen, T, Sørensen, T A, Sørensen, T J (1948) [https://pattern.swarma.org/paper?id=ea7f2902-6e74-11ea-9db3-0242ac1a0005 A method of establishing groups of equal amplitude in plant sociology based on similarity of species content and its application to analyses of the vegetation on Danish commons].&amp;lt;/ref&amp;gt;常用于生态学研究，其定义为 &amp;lt;math&amp;gt;s{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{kx + ky}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第5个指标大度节点有利指标&amp;lt;ref name=&amp;quot;[5]&amp;quot;&amp;gt;E. Ravasz,A. L. Somera,D. A. Mongru,Z. N. Oltvai,A. -L. Barabasi (2002) [https://pattern.swarma.org/paper?id=6eb98b7e-6e91-11ea-81b9-0242ac1a0005 Hierarchical organization of modularity in metabolic networks].arXiv:0209244.&amp;lt;/ref&amp;gt;（Hub promoted index，HPI）被用来定量刻画新陈代谢网络中每对反应物的拓扑相似程度，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{min\{k_x,k_y\}}&amp;lt;/math&amp;gt;，由于分母只由度较小的节点决定，在此定义下可知大度节点（hub）与其他节点之间更容易具有高的相似性。&lt;br /&gt;
&lt;br /&gt;
第6个指标大度节点不利指标&amp;lt;ref name=&amp;quot;[6]&amp;quot;&amp;gt;Tao Zhou,Linyuan Lu,Yi-Cheng Zhang (2009) [https://pattern.swarma.org/paper?id=7a2b26ba-6e92-11ea-9ee2-0242ac1a0005 Predicting Missing Links via Local Information].arXiv:0901.0553.&amp;lt;/ref&amp;gt;（hub depressed index, HDI）定义与HPI相似，只是分母取两端节点度的最大值，即 &amp;lt;math&amp;gt;s_{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{max\{k_x,k_y\}}&amp;lt;/math&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
第7个指标LHN-I指标&amp;lt;ref name=&amp;quot;[7]&amp;quot;&amp;gt;E. A. Leicht,Petter Holme,M. E. J. Newman (2005) [https://pattern.swarma.org/paper?id=71890c4e-6f0e-11ea-b30e-0242ac1a0005 Vertex similarity in networks].arXiv:0510143.&amp;lt;/ref&amp;gt;是由Leicht，Holme和Newman提出，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{{k_xk_y}}&amp;lt;/math&amp;gt;，其中分母&amp;lt;math&amp;gt;k_xk_y&amp;lt;/math&amp;gt; 正比于节点&amp;lt;math&amp;gt;v_x&amp;lt;/math&amp;gt;和节点&amp;lt;math&amp;gt;v_y&amp;lt;/math&amp;gt;共同邻居数的期望值，即 &amp;lt;math&amp;gt;E( |Γ(x)| \cap |Γ(y)|)&amp;lt;/math&amp;gt;。在下面这篇文献中，Leicht等人同时提出了另一个基于路径的指标，为了有所区别，将此局部指标命名为LHN-I指标，将基于路径的指标命名为LHN-II指标：&lt;br /&gt;
&lt;br /&gt;
第8个指标PA（preferential attachment）是基于BA无标度网络模型中新加入节点倾向于和度大的节点相连的优先连接机制而提出的，在这种机制的链路预测中，每一步首先去除一条链接，然后再添加一条链接，新链接连接节点&amp;lt;math&amp;gt;v_x&amp;lt;/math&amp;gt;和&amp;lt;math&amp;gt;v_y&amp;lt;/math&amp;gt;的概率就正比于两节点度的乘积，由此可以定义两节点间的优先连接相似性：&amp;lt;math&amp;gt;s_{xy}= k_xk_y&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第9个指标AA（Adamic-Adar）&amp;lt;ref name=&amp;quot;[8]&amp;quot;&amp;gt;Adar, Adamic L A, E (2003) [https://pattern.swarma.org/paper?id=e4726a06-6f2d-11ea-8846-0242ac1a0005 Friends and neighbors on the web].Social networks.25.(211--230)&amp;lt;/ref&amp;gt;的基本思想是度小的共同邻居节点的贡献大于度大的共同邻居节点，因此根据共同邻居节点的度为每个节点赋予一个权重值。这一点很容易理解，例如在微博中受关注较多的人往往是某个领域的专家或名人，因此共同关注他们的人之间可能并不拥有特别相似的兴趣——一个中学生和一个企业家都有可能是姚晨的粉丝。相反，如果两个人共同关注了一个粉丝很少的人（非名人），那么说明这两个人确实具有相同的兴趣爱好或者重叠的社交圈，因此有更高概率相连。又如在推荐系统中，共同购买冷门产品的两个用户往往比共同购买热门产品的用户更相似。AA指标根据共同邻居节点的度为每个节点赋予一个权重值，该权重等于该节点的度的对数分之一，即AA指标的定义为：&amp;lt;math&amp;gt;s_{xy}=\sum _{z\in \Gamma (x)\bigcap \Gamma (y)}\frac{1}{logk_z}&amp;lt;/math&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
第10种指标RA是受网络资源分配过程的启发，周涛等人提出的“'''资源分配指标 Resource allocation'''”，其与AA指标有异曲同工之妙。RA和AA指标最大的区别就在于赋予共同邻居节点权重的方式不同，前者是以 1/k 的形式递减，后者是以 1/logk 的形式递减。可见，当网络的平均度较小时，RA和AA差别不大；但是当平均度较大时，就有很大的区别了。研究显示，RA指标在刻画加权网络和社区挖掘应用中的表现胜过AA指标，图灵奖得主Hopdroft的一篇论文也显示，可以利用社区等中观结构信息改进局部指标，其中RA指标改进后的效果最佳。&lt;br /&gt;
&lt;br /&gt;
*基于路径的相似性指标&lt;br /&gt;
&lt;br /&gt;
基于共同邻居的相似性指标的优势在于计算复杂度较低，但是由于使用的信息非常有限，预测精度受到限制，因此发展出了基于路径的相似性指标，主要有3个，分别是局部路径指标 Local path 、Katz指标和LHN-II指标。&lt;br /&gt;
&lt;br /&gt;
1.局部路径指标&lt;br /&gt;
&lt;br /&gt;
周涛等人在共同邻居的基础上考虑三阶路径的因素，提出了基于局部路径的相似性指标，其定义为 &amp;lt;math&amp;gt; S=A^2+\alpha A^3&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 为可调参数，A 表示网络的邻接矩阵， &amp;lt;math&amp;gt;(A^3)_{xy}&amp;lt;/math&amp;gt;表示节点 &amp;lt;math&amp;gt;V_x&amp;lt;/math&amp;gt; 和 &amp;lt;math&amp;gt;V_y&amp;lt;/math&amp;gt; 之间长度为3的路径数目。当&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; = 0时，LP指标就退化为 CN 指标。 CN 指标本质上也可看成基于路径的指标，只是它仅考虑了二阶路径数目。局部路径指标可以扩展为更高阶的情形，即考虑n阶路径的情况：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt; S^n=A^2+\alpha\cdot A^3+\alpha^2\cdot A^4+\cdots +\alpha^{n-2}\cdot A^n &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
随着 n 的增加，局部路径指标的计算复杂度越来越大。一般而言，考虑 n 阶路径的计算复杂度为O(N&amp;lt;k&amp;gt;^n)。但是当 n 趋于无穷大的时候，局部路径指标相当于考虑网络全部路径的Katz指标，此时计算量反而有可能下降，因为可转变为计算矩阵的逆&amp;lt;ref name=&amp;quot;[10]&amp;quot;&amp;gt;Linyuan Lü, Ci-Hang Jin,  Tao Zhou () [https://pattern.swarma.org/paper?id=ba461814-70a3-11ea-8026-0242ac1a0005 Similarity Index Based on Local Paths for Link Prediction of Complex Networks].&amp;lt;/ref&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
2.Katz指标&lt;br /&gt;
&lt;br /&gt;
Katz指标考虑了所有网络的路径，因此其定义为：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S_{xy}=\sum_{l=1}^{\infty }\alpha^l\cdot\left |  paths_{x,y}^{&amp;lt;l&amp;gt;} \right |= \alpha A_{xy}+\alpha^2\cdot (A^2)_{xy}+\alpha^3\cdot (A^3)_{xy}+\cdots  &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\alpha &amp;gt; 0&amp;lt;/math&amp;gt; 为控制路径权重的可调参数，&amp;lt;math&amp;gt;\left |  paths_{x,y}^{&amp;lt;l&amp;gt;} \right |&amp;lt;/math&amp;gt;表示连接节点 &amp;lt;math&amp;gt;V_x&amp;lt;/math&amp;gt;和  &amp;lt;math&amp;gt;V_y&amp;lt;/math&amp;gt; 的路径中长度为 l 的路径数。要使上述级数收敛，则参数&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 应小于邻接矩阵最大特征值的倒数，此定义还可以表示为：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S = (I - \alpha\cdot A)^{-1} - I&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
显然，当参数&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 很小时，高阶路径的贡献也较小，使得 Katz 指标的预测结果接近于局部路径指标&amp;lt;ref name=&amp;quot;[11]&amp;quot;&amp;gt;Leo Katz (1953) [https://pattern.swarma.org/paper?id=b2dee81c-70b2-11ea-b7f9-0242ac1a0005 A new status index derived from sociometric analysis].psychometrika.18.1:(39-43)&amp;lt;/ref&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
3.LHN-II指标&lt;br /&gt;
&lt;br /&gt;
LHN-II 指标是 Leicht，Holme 和 Newman 提出的另一种相似性计算方法，他的基本思想是基于'''一般等价 Regular equivalence''' 提出的。与结构等价不同，一般等价的定义更广泛。在一般等价的定义下，如果两个节点所连接的节点之间相似，那么这两个节点也相似，即使它们之间没有共同的邻居节点。&lt;br /&gt;
&lt;br /&gt;
下图给出了一个简单的例子来帮助我们理解结构等价和一般等价的区别。根据结构等价的定义，在公司A内部，由于员工a和员工b都认识员工e和员工f（即它们有两个共同邻居节点），于是称员工a和员工b是结构等价的。同理，员工e和员工f也是结构等价的，同样地，在公司B中，员工c和员工d是结构等价的，员工g和员工h也是结构等价的。现在考虑员工a和员工c是否相似？根据一般等价的定义，由于员工a连接的节点e、f与员工c连接的节点g、h分别是相似的，那么我们可以认为员工a和员工c也是相似的，同理，在一般等价的意义下，员工b和员工d也是相似。从这个例子可以看出，结构相似性或称结构等价更强调的是两个节点是否在同一个环境下，也就是说是否连接了相同的节点；然而一般等价考虑的是这两个节点是否处于同样的角色，即使他们没有相同的邻居节点，但是由于各自的邻居节点之间本身相似，这两个节点也相似。一般等价意义下的相似性是LHN-II指标的核心。&lt;br /&gt;
&lt;br /&gt;
[[File:一般等价和结构等价示例.png|600px|thumb|一般等价和结构等价示例（图中实线表示连接，虚线表示相似关系）|center]]&lt;br /&gt;
&lt;br /&gt;
从一般等价的角度考虑，LHN-II指标认为如果两个节点的邻居节点之间是相似的，那么这两个节点也是相似的。它与Katz指标的区别主要是把Katz指标中的&amp;lt;math&amp;gt; (A^{n})_{xy} &amp;lt;/math&amp;gt;变成 &amp;lt;math&amp;gt;  (A^{n})_{xy}&amp;lt;/math&amp;gt; 的期望值，注意到 &amp;lt;math&amp;gt; (A^{n})_{xy}&amp;lt;/math&amp;gt; 的期望值为 &amp;lt;math&amp;gt; E\left [ (A^l)_{xy} \right ]=\frac{k_xk_y}{M}\lambda _1^{l-1}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\lambda_1&amp;lt;/math&amp;gt;为矩阵A的最大特征值，则LHN-II指标的表达式如下：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 S_{xy}^{LHN2}=\delta _{xy} + \sum_{l=1}^{\infty }\Phi ^l \frac{(A^l)_{xy}}{E\left [ (A^l)_{xy} \right ]}&lt;br /&gt;
=\delta _{xy} + \frac{2M}{k_xk_y}\sum_{l=1}^{\infty }\Phi ^l\lambda _1^{1-l}(A^l)_{xy}&lt;br /&gt;
=\left [ 1 - \frac{2 M \lambda_1}{k_xk_y} \right ]\delta _{xy} + \frac{2 M \lambda_1}{k_xk_y}\left [ (I-\frac{\Phi}{\lambda_1} A )^{-1} \right ]_{xy}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\delta _{xy}&amp;lt;/math&amp;gt;为 Kronecker &amp;lt;math&amp;gt;\delta&amp;lt;/math&amp;gt; 函数，&amp;lt;math&amp;gt; \Phi&amp;lt;/math&amp;gt; 为取值小于1的参数。上式最后一个等式的第一项是可以去掉的对角阵，从而相似性矩阵可以写为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S=2M\lambda_1D^{-1}(I-\frac{\Phi A}{\lambda_1})^{-1}D^{-1}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中''D''为度值矩阵，&amp;lt;math&amp;gt;D_{xy} = \delta_{xy} \cdot k_{x}&amp;lt;/math&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
*基于随机游走的节点相似性指标&lt;br /&gt;
&lt;br /&gt;
还有相当数量的相似性指标是基于随机游走过程定义的，包括'''平均通勤时间 Average commute time''' 、'''Cos+指标'''、'''有重启的随机游走 Random walk with restart'''、'''SimRank'''指标、'''局部随机游走指标 Local random walk''' 和'''有叠加效应的随机游走指标 Superposed random walk'''等。&lt;br /&gt;
&lt;br /&gt;
1.平均通勤时间 ACT &amp;lt;ref name=&amp;quot;[12]&amp;quot;&amp;gt;D. J. Klein,M. Randić (1993) [https://pattern.swarma.org/paper?id=b5177044-70c7-11ea-b241-0242ac1a0005 Resistance distance].journal of mathematical chemistry.12.1:(81-95)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
设&amp;lt;math&amp;gt;m(x,y)&amp;lt;/math&amp;gt; 为一个随机粒子从节点x到节点y平均需要走的步数，那么节点x和y的平均通勤时间定义为：&amp;lt;math&amp;gt;n(x , y) = m(x , y) + m(y , x) &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其数值解可通过求该网络拉普拉斯矩阵&amp;lt;math&amp;gt;L&amp;lt;/math&amp;gt; 的伪逆&amp;lt;math&amp;gt; L^+&amp;lt;/math&amp;gt; 获得，即 &amp;lt;math&amp;gt;n(x,y)=M(l^+_{xx} +l^+_{yy} - 2l^+_{xy})&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;l^{+}_{xy}&amp;lt;/math&amp;gt;表示矩阵&amp;lt;math&amp;gt;L^+ &amp;lt;/math&amp;gt;中相应位置的元素。如果两个节点的平均通勤时间越小，那么两个节点越进阶。由此，定义基于ACT的相似性为（在此可忽略常数M）&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{ACT}=\frac{1}{l^+_{xx} +l^+_{yy} - 2l^+_{xy}}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
2.余弦相似性指标 Cos+指标&amp;lt;ref name=&amp;quot;[13]&amp;quot;&amp;gt;Fouss F, Pirotte A, Renders J M (2007) [https://pattern.swarma.org/paper?id=f3ce12c4-70c8-11ea-8ff9-0242ac1a0005 Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation].IEEE Transactions on knowledge and data engineering.19.(355-369)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
在由向量&amp;lt;math&amp;gt;v_x = \Lambda ^{1/2}U^{T}e_{x}&amp;lt;/math&amp;gt;展开的欧式空间内，&amp;lt;math&amp;gt;L^+ &amp;lt;/math&amp;gt;中的元素&amp;lt;math&amp;gt;l^{+}_{xy}&amp;lt;/math&amp;gt;可表示为两向量&amp;lt;math&amp;gt;v_x&amp;lt;/math&amp;gt;和&amp;lt;math&amp;gt;v_y&amp;lt;/math&amp;gt;的内积，即&amp;lt;math&amp;gt; l^{+}_{xy} = v_{x}^{T} v_y&amp;lt;/math&amp;gt;，其中&amp;lt;math&amp;gt;U&amp;lt;/math&amp;gt;是一个标准正交矩阵，由&amp;lt;math&amp;gt;L^+&amp;lt;/math&amp;gt;特征向量按照对应的特征根从大到小排列，&amp;lt;math&amp;gt;\Lambda&amp;lt;/math&amp;gt;为以特征根为对角元素的对角矩阵，&amp;lt;math&amp;gt;e_{x}&amp;lt;/math&amp;gt; 表示一个一维向量且只有第x个元素为1，其他都为0。由此定义余弦相似性如下：&lt;br /&gt;
&lt;br /&gt;
s_{xy}^{cos+}=cos(x,y)^+=\frac{l_{xy}^+}{\sqrt{l^+_{xx} \cdot l^+_{yy}}}&lt;br /&gt;
&lt;br /&gt;
3.重启的随机游走 RWR&amp;lt;ref name=&amp;quot;[14]&amp;quot;&amp;gt;Brin, S, Page, L (1998) [https://pattern.swarma.org/paper?id=15405998-70ca-11ea-b1b5-0242ac1a0005 The anatomy of a large-scale hypertextual web search engine].&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
这个指标可以看成是PageRank 算法的拓展应用。它假设随机游走粒子在每走一步的时候都以一定概率返回初始位置。设粒子返回概率为 1-c，&amp;lt;math&amp;gt;P&amp;lt;/math&amp;gt; 为网络的马尔科夫概率转移矩阵，其元素 &amp;lt;math&amp;gt;P_{xy} = a_{xy}/k_{x} &amp;lt;/math&amp;gt;表示节点x处的粒子下一步走到节点y的概率。其中如果节点x和节点y相连，则&amp;lt;math&amp;gt;a_{xy}=1&amp;lt;/math&amp;gt;，否则&amp;lt;math&amp;gt;a_{xy}=0&amp;lt;/math&amp;gt;。某一粒子初始时刻在节点x处，那么t+1时刻该粒子到达网络各个节点的概率向量为&lt;br /&gt;
&amp;lt;math&amp;gt;q_{x}(t+1) = c \cdot P^{T}q_{x}(t) + (1-c) e_{x}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;e_{x}&amp;lt;/math&amp;gt;表示初始状态（其定义与Cos+中相同），上式的稳态解为&amp;lt;math&amp;gt;q_{x} = (1-c)(I-cP^{T})^{-1}e_{x}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中元素&amp;lt;math&amp;gt;q_{xy}&amp;lt;/math&amp;gt;为从节点x出发的粒子最终有多少概率走到节点y。由此定义RWR相似性如下：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{RWR} = q_{xy} + q_{yx} &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
4.SimRank指标 SimR&amp;lt;ref name=&amp;quot;[15]&amp;quot;&amp;gt;Jeh G, Widom J. SimRank (2002) [https://pattern.swarma.org/paper?id=593e78e0-70cb-11ea-9743-0242ac1a0005 a measure of structural-context similarity].(538-543)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
它的基本假设是，如果两节点所连接的节点相似，那么这两个节点就相似。其自洽定义式为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{simR}=C\frac{\sum_{v_z\in \Gamma (x)}\sum_{{v_z}'\in \Gamma (y)}s_{zz'}^{simR}}{k_xk_y}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中假定 &amp;lt;math&amp;gt;s_{xx} =1, C \in [0,1] &amp;lt;/math&amp;gt;为相似性传递时的衰减参数。&lt;br /&gt;
&lt;br /&gt;
SimR指标同时考虑了结构等价和一般等价。当节点x的邻居z同时也是节点y的邻居时，该指标考虑了结构等价；当节点x不等于节点y时，该指标概率了一般等价。可以证明，SimR指标可以用来描述两个分别从节点x和y出发的粒子平均过多久会相遇。&lt;br /&gt;
&lt;br /&gt;
5.局部随机游走指标 LRW&amp;lt;ref name=&amp;quot;[16]&amp;quot;&amp;gt;Weiping Liu,Linyuan Lu (2010) [https://pattern.swarma.org/paper?id=98d1a08e-70eb-11ea-a520-0242ac1a0005 Link Prediction Based on Local Random Walk].arXiv:1001.2467.89.(58007)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
上述4种随机游走指标是基于全局的随机游走，这类指标往往计算复杂度很高，因此很难在大规模网络上应用。刘伟平和吕琳媛提出了一种基于网络局部随机游走的相似性指标LRW，它只考虑有限步数的随机游走过程。一个粒子 t 时刻从节点x出发，定义&amp;lt;math&amp;gt;π_{xy} (t) &amp;lt;/math&amp;gt;为 t+1 时刻这个粒子正好走到节点y的概率，那么可得到系统演化方程：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\pi_{x} (t + 1) = P^T\pi_{x}(t)，t=0,1,…&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\pi_{x}(0) &amp;lt;/math&amp;gt;为一个&amp;lt;math&amp;gt;Nx1 &amp;lt;/math&amp;gt;的向量，只有第x 个元素为1，其他为0，即&amp;lt;math&amp;gt;\pi_{x}(0) =e_x&amp;lt;/math&amp;gt;。设定各个节点的初始资源分布为&amp;lt;math&amp;gt;q_x&amp;lt;/math&amp;gt;，那么基于t步随机游走的相似性为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{LRW} = q_{xy} + q_{yx}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
6.叠加的局部随机游走指标 SRW&amp;lt;ref name=&amp;quot;[16]&amp;quot;&amp;gt;Weiping Liu,Linyuan Lu (2010) [https://pattern.swarma.org/paper?id=98d1a08e-70eb-11ea-a520-0242ac1a0005 Link Prediction Based on Local Random Walk].arXiv:1001.2467.89.(58007)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
这个指标给邻近目标节点的点更多的机会与目标节点相连，充分考虑了很多真实网络连接上的局域性特点，它是在LRW的基础上，将t步及其以前的结果加总，便得到SRW的值，即：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{SRW}(t)=\sum_{t}^{l=1}s_{xy}^{LRW}(l) = q_x\sum_{t}^{l=1}\pi_{xy}(l) + q_y\sum_{t}^{l=1}\pi_{yx}(l)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===基于似然分析的链路预测===&lt;br /&gt;
&lt;br /&gt;
基于相似性的链路预测方法，是最简单的一种分析框架，除此之外，还有另一种最复杂的链路预测分析框架——基于似然分析的链路预测。这个框架本身远远复杂于基于相似性的框架，而且框架中的每一个组成成分自身都非常复杂，但这个框架下衍生出的算法除了给出链路预测的结果之外，还给出了我们对于网络结构的深刻洞见，例如“'''层次结构模型 Hierachical structure model'''”给出了网路层次组织形态的定量刻画，“'''随机分块模型 Stochastic block model'''”类似于社区分解一样把网络划分成了若干子块。这些对理解网络结构特征方面的贡献，是基于相似性的框架所不能提供的。&lt;br /&gt;
&lt;br /&gt;
基于似然分析的链路预测的基本思路是：根据网络结构的产生和组织方式以及目前已经观察到的链路计算网络的似然值，并认为真实的网络使得网络似然值最大，然后再根据网络似然最大化计算每一对未连接的节点产生连边的可能性。&lt;br /&gt;
&lt;br /&gt;
*层次结构模型 HSM&amp;lt;ref name=&amp;quot;[17]&amp;quot;&amp;gt;Aaron Clauset,Cristopher Moore,M. E. J. Newman (2008) [https://pattern.swarma.org/paper?id=1ca0e946-70ed-11ea-82c3-0242ac1a0005 Hierarchical structure and the prediction of missing links in networks].arXiv:0811.0484.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
层次结构模型假设真实的网络都存在某种层次性，网络的连接则可看作是这种内在层次结构的反映。该方法的计算步骤如下：&lt;br /&gt;
&lt;br /&gt;
1.一个N个节点的网络可以用一个包含N个叶子节点的族谱树表示，这N个叶子节点将由N-1个非叶子节点连接起来，其中每个非叶子节点都有一个概率值，则两个叶子节点连接的概率就等于他们最近共同祖先节点的概率值。给定一个族谱树，将网络的似然值最大化，就可以得到非叶子节点的概率值，并由此计算出这一个族谱树所对应的网络最大的似然值。&lt;br /&gt;
&lt;br /&gt;
2.使用马尔科夫链蒙特卡洛方法对网络不同的族谱树进行抽样，使得每个族谱树出现的频次正比于该树对应的最大的网络似然值。两个节点连边的概率就等于所有抽样出来的族谱树中两个节点连边概率的平均值。注意似然高的族谱树会出现多次，因此对这个平均概率的贡献也大。&lt;br /&gt;
&lt;br /&gt;
3.把平均连边概率看做是相似性框架中的相似性指标&amp;lt;math&amp;gt;s_{xy}&amp;lt;/math&amp;gt;，按照这个值从大到小排序，排在前面的就是预测的连边。&lt;br /&gt;
&lt;br /&gt;
需要指出的是，层次结构模型在处理具有明显层次结构的网络（如恐怖袭击网络和草原食物链）时具有较高的精确度，但在处理一般性网络时效果并不一定突出。&lt;br /&gt;
&lt;br /&gt;
*随机分块模型 SBM&lt;br /&gt;
&lt;br /&gt;
与层次结构模型的思想类似，随机分块模型假设网络中的节点可以被分为若干集合，两个节点间连接的概率只与相应的集合有关。换句话说，同一个群众所有节点的地位是相同的。随机分块模型特别适合刻画节点所属群的成员身份对于其连接行为有关键影响的情况，例如，著名的“角色模型”就包含了随机分块模型的理念。&amp;lt;ref name=&amp;quot;[18]&amp;quot;&amp;gt;Roger Guimerà,Marta Sales-Pardo,Luís A. N. Amaral (2006) [https://pattern.swarma.org/paper?id=aa2a88c0-7107-11ea-a3cf-0242ac1a0005 Classes of complex networks defined by role-to-role connectivity profiles].nature physics.3.1:(63-69)&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;[19]&amp;quot;&amp;gt;Joerg Reichardt,Douglas R. White (2007) [https://pattern.swarma.org/paper?id=f20b0e20-7108-11ea-9e3d-0242ac1a0005 Role models for complex networks].arXiv:0708.0958.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
随机分块模型的效果要好于层次结构模型。同时，该方法还可以剔除网络的错误连边，如纠正蛋白质相互作用网络中的错误连边。&lt;br /&gt;
&lt;br /&gt;
*闭路模型 Loop model&amp;lt;ref name=&amp;quot;[20]&amp;quot;&amp;gt;吕琳媛,Xiaolong Ren,周涛 (2016) [https://pattern.swarma.org/paper?id=f5d29350-710a-11ea-9346-0242ac1a0005 网络链路预测：概念与前沿].&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
似然分析的更一般的框架是：给定一个网络系统，特定网络哈密顿量的负指数被统计分配函数归一化后，就得到这个网络出现的似然，一条未被观察到的连边存在的可能性就等于添加这条连边后网络的似然值。闭路模型考虑网络结构形成中的“局部性原则”，并由此定义了网络的哈密顿量。实验表明，闭路模型的预测精度大于层次结构模型和随机分块模型。&lt;br /&gt;
&lt;br /&gt;
===基于机器学习的链路预测===&lt;br /&gt;
&lt;br /&gt;
用机器学习的思路进行链路预测，主要分为基于特征分类方法、基于概率图模型方法和基于矩阵分解方法三大类。&lt;br /&gt;
&lt;br /&gt;
*基于特征分类方法&lt;br /&gt;
&lt;br /&gt;
网络中的链路预测问题可以看成机器学习中的分类问题，其中每个数据点对应一对节点之间关系的标记，假定两个节点之间存在连边，则数据点的值为+1，否则为-1。特征选取是分类问题中最重要的问题之一，目前研究较多的主要包括基于节点与边的属性特征和基于节点所处网络的拓扑结构特征（如CN、AA、Katz、最短路径）等。哈桑 Hasan 等人提取合著网络中科学家研究领域的关键词作为特征，用监督学习中一些常用的分类算法（如决策树、K近邻法、多层感知器、支持向量机、径向基网络）对缺失的连边进行较为精准的预测，其中以支持向量机方法表现最佳。&lt;br /&gt;
&lt;br /&gt;
*基于概率图模型&lt;br /&gt;
&lt;br /&gt;
基于概率图模型的链路预测方法使用图模型来表达节点之间的连边概率，根据模型中概率依赖关系，可分为有向无环的贝叶斯网络和无向的马尔科夫网络。随机分块模型和层次结构模型分别是典型的基于贝叶斯网络和基于马尔科夫网络的链路预测方法。基于概率图模型的链路预测方法有很多，典型的还有有监督随机游走链路预测算法，将网络结构信息与节点和连边的属性信息结合起来，给每条边分配不同的转移概率。与其他有监督的机器学习方法相比，该算法无须知道网络的特征和相关的领域知识。&lt;br /&gt;
&lt;br /&gt;
*基于矩阵分解&lt;br /&gt;
&lt;br /&gt;
基于矩阵分解的链路预测方法是基于网络邻接矩阵的代数谱变换而得到的方法，来预测网络中链路的存在性和链路的权值。相比其他几种机器学习方法，该方法要学习的参数少很多，但计算复杂度较高。链路预测问题可以视为邻接矩阵填充问题，并可以通过双线性回归模型将节点和链路的显特征和隐特征结合起来用矩阵分解方法解决。边缘去噪模型将根据给定关系矩阵求未知边或丢失边的问题变成一个矩阵降噪去噪问题。&lt;br /&gt;
&lt;br /&gt;
关于不同的链路预测研究方法的分类可以参考下表：&lt;br /&gt;
[[File:Link preditction method.png|600px|thumb|三类不同的链路预测方法（*表示该方法含有参数）|center]]&lt;br /&gt;
&lt;br /&gt;
==应用场景==&lt;br /&gt;
链路预测有着广泛的应用场景：在生物领域，利用蛋白质间相互作用关系的结构信息进行链路预测，可以为实验的测定提前提供参考依据，从而降低实验成本、提高成功率；在社交网络领域，链路预测可以对社交网络中的好友关系、朋友推荐进行预测，从而提高用户对社交网站的体验满意度和使用黏性；在电子商务领域，除了传统的协同过滤推荐算法外，利用网络结构信息（如网络三角形结构）等特征进行商品推荐也取得了显著的优势；此外，通过识别隐藏的链边或异常的链边对信息不完全或含有噪音的网络进行重构，可以提高网络的传输能力，这对于航空网络重构有很大的启发意义。&lt;br /&gt;
[[File:Figure2.png|400px|thumb|链路预测应用场景示意图（图片来自网络）|center]]&lt;br /&gt;
&lt;br /&gt;
除此之外，链路预测的算法和思想通过一些变换还可以用来解决一些看似没有太大关系的问题。例如，对疾病信号和股票指数的预测。基于链路预测的思想和方法，我们还可以设计基于节点相似性的社团划分以及对网络演化模型的定量化评估方法。链路预测还可以帮助提高节点标签预测的精度，特别是在已知标签节点稀疏的情况下效果显著。这一方法可以应用于判断一篇学术论文的类型，判断一本书的政治态度（中立、自由派或保守派），或者判断一个手机用户是否产生了更换电信运营商的念头。&lt;br /&gt;
&lt;br /&gt;
==代表人物==&lt;br /&gt;
*'''吕琳媛'''&lt;br /&gt;
吕琳媛主要研究方向为复杂网络信息挖掘领域，包括海量信息导航、挖掘、推荐和预测。目前担任阿里巴巴复杂科学研究中心副主任，中欧联合实验室执行主任，中国工业与应用数学学会复杂网络与系统控制专业委员会委员，杭州市特聘专家。&lt;br /&gt;
[[File:Lvlinyuan.png|400px|thumb|吕琳媛，阿里巴巴复杂科学研究中心副主任|center]]&lt;br /&gt;
&lt;br /&gt;
近年来主持/参与国家级项目5项（2016年获得国家自然科学基金优秀青年基金），省部级项目4项，横向课题4项。 在相关领域发表学术论文 50余篇，其中SCI论文39篇，总影响因子122，发表期刊包括Physics Reports，PNAS，Nature Communications等国际知名学术期刊。三篇论文入选ESI全球Top-1%高引用论文，论文SCI引用1200余次，谷歌学术引用3000余次，其中9篇论文引用超过100次。2013年出版学术专著《链路预测》获得第四届中国大学出版社图书奖优秀学术著作一等奖。申请发明专利12项。2015年荣获浙江省杰出青年基金，2014年荣获中国计算机学会自然科学二等奖，中国网络科学论坛青年希望奖，首届CCF-腾讯犀牛鸟基金优秀奖。&lt;br /&gt;
&lt;br /&gt;
*'''周涛'''&lt;br /&gt;
周涛主要从事复杂性科学和大数据挖掘算法和应用研究，先后攻克推荐系统准确性-多样性困境、复杂网络链路可预测性、H指数-度-核心度关系等图挖掘领域的重要难题，成果发表在PNAS, Nature Communications, Physics Reports, KDD和ICDM等国际顶尖期刊和会议上。目前论文google总引用超过14000次，其中8篇论文入选ESI高引用论文，H指数为57，2014和2015连续两年入选Elsevier最具国际影响力中国科学家名单。&lt;br /&gt;
[[File:Zhoutao.png|400px|thumb|周涛，第十二届中国青年科技奖|center]]&lt;br /&gt;
&lt;br /&gt;
因其在科学研究上的杰出表现，2011年获得第十二届中国青年科技奖（最年轻获奖者），2011年入选四川省“百人计划”，2012年获得国家首批优秀青年科学基金资助，2013年入选国家“万人计划”首批青年拔尖人才支持计划，2014年获得四川省科技进步一等奖、中国计算机学会自然科学奖，2015年获得共青团中央授予的“最美青年科技工作者”称号，并与屠呦呦等七名个人和北斗导航等三个团队共同当选2015年度中国十大科技创新人物。&lt;br /&gt;
&lt;br /&gt;
*'''马克·纽曼 Mark Newman'''&lt;br /&gt;
Newman是一名英裔美国物理学家，也是密歇根大学 University of Michigan 物理学系的阿纳托尔·拉波特 Anatol Rapoport 杰出教授，也是圣达菲研究所 Santa Fe Institute 的外部教员。他因在复杂网络和复杂系统领域的基础性贡献而闻名，为此他被授予2014年拉格朗日奖。&lt;br /&gt;
[[File:Newman.png|400px|thumb|Mark Newman，密歇根大学物理学系阿纳托尔·拉波特杰出教授|center]]&lt;br /&gt;
&lt;br /&gt;
Newman以其对复杂网络的研究而著称，尤其是在科学家的协作模式，随机图论 Random graph theory，社区结构 Community structure，渗流理论 Percolation theory 和网络流行病学 Network epidemiology方面的工作。他作为共同发明人，与迈克尔·卡斯特 Michael Gastner 一起，发明了一种可以产生密度均衡地图 Density-equalizing maps 或统计地图 Cartograms的方法，该方法构成了Worldmapper网站的基础。他们的工作在2004年美国总统大选后受到关注，成为了当时被广泛传播的一种选举结果地图的基础，（他们）根据各州的人口数调整了州的规模，以便更准确地了解每个党派的选民投票人数。&lt;br /&gt;
&lt;br /&gt;
*'''克里斯托弗·大卫·摩尔 Cristopher David Moore'''&lt;br /&gt;
克里斯托弗·大卫·摩尔 Cristopher David Moore，也称为克里斯·摩尔 Cris Moore 是美国计算机科学家，数学家和物理学家。他是圣达菲研究所的驻校教师，曾任新墨西哥大学 University of New Mexico 的正教授。&lt;br /&gt;
[[File:Cristopher_David_Moore.png|400px|thumb|Cristopher David Moore，圣达菲研究所的驻校教师|center]]&lt;br /&gt;
&lt;br /&gt;
1993年，Moore 发现了一种新颖的解决三体问题的方法，表明在牛顿力学中，三个等质量的物体有可能沿着一条八字形曲线、在同一条轨道相互跟随。Moore 在网络科学领域也很活跃，在该领域有许多著名的出版物。在与Clauset和Mark Newman的合作中，Moore开发了复杂网络的层次聚类概率模型，并表明他们的模型可以在面对网络连接结构发生变化时可靠地预测聚类结果。&lt;br /&gt;
&lt;br /&gt;
*'''亚伦·克劳斯特 Aaron Clauset '''&lt;br /&gt;
Aaron Clauset是一位美国计算机科学家，致力于网络科学，机器学习和复杂系统领域。目前，他在科罗拉多大学博尔德分校 University of Colorado Boulder 教授计算机科学，也是圣菲研究所的外部教员。&lt;br /&gt;
[[File:Aaron_Clauset.png|400px|thumb|  Aaron Clauset，圣菲研究所的外部教员|center]]&lt;br /&gt;
&lt;br /&gt;
Clauset因与Cosma Shalizi和Mark Newman进行的合作研究而闻名，他们针对经验数据中是否存在幂律模式开发了严格的统计检验，并且证明了许多宣称符合幂律分布的网络实际上并不是幂律分布。他还因开发检测复杂网络中的社区结构算法的工作而著称，特别是和Newman、Moore合作发展的网络层次聚类模型。在其他方面，Clauslet 与麦克斯韦·扬 Maxwell Young 、克里斯蒂安·斯克雷德·格莱蒂奇 Kristian Skrede Gleditsch 共同完成了一些独特发现：世界范围内恐怖事件发生的频率和严重性服从幂律分布。&lt;br /&gt;
&lt;br /&gt;
2015年，Clauset 因开发和评估一种网络结构特征的新方法而获得了美国国家科学基金会颁发的著名的CAREER奖。2016年，Clauset因在网络结构方面（包括Internet映射，推断缺失链接和社区结构），以及对人类冲突和社会分层所做的启发性分析方面做出的贡献而获得网络科学学会颁发的网络科学领域的Erdös-Rényi奖。&lt;br /&gt;
&lt;br /&gt;
==参考资料==&lt;br /&gt;
*汪小帆,李翔,陈关荣.《网络科学导论》.北京：高等教育出版社,2012年：178-186&lt;br /&gt;
*吕琳媛,周涛.《链路预测》.北京：高等教育出版社,2013年：57-93&lt;br /&gt;
*吕琳媛,任晓龙,周涛.《网络链路预测：概念与前沿》[J].《中国计算机学会通讯》,2016年,第4期&lt;br /&gt;
*Clauset A, Moore C, Newman M E J. Hierarchical structure and the prediction of missing links in networks [J]. Nature, 2008,453(7191): 98-101.&lt;br /&gt;
*Link Prediction Group 网站：http://www.linkprediction.org/&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
*链接预测可用于分析网络将如何发展，或者在给定信息不完整情况下来发现“丢失”的链接，对于这个问题，有研究者提出了一种新的，结合广义群贴近度中心性和半值相互作用指数的拟局部方法（即考虑半径k内节点的方法），详见 [https://swarma.org/?p=18249 《链路预测的博弈算法》]&lt;br /&gt;
[[File:链路预测的博弈算法.jpg|400px|thumb|[https://swarma.org/?p=18249 《链路预测的博弈算法》]|center]]&lt;br /&gt;
*深度学习已经成功地在图像识别、语音识别、自然语言处理、游戏与博弈等领域取得了突飞猛进的发展，并渗透到了我们的日常生活中。那么，我们有没有可能将这种技术借剪到复杂网 络的研究之中呢？近年来，人们凭借着网络嵌入（Network Embedding）、图卷积神经网络（Graph Convolutional Neural Network）、图注意力模型（Graph Attention Network）等新技术，已经开发了若干图结构上的深度学习算法，并取得了一定的成功应用。北师大系统科学学院教授、博导张江老师亲授[https://campus.swarma.org/play/coursedetail?id=10504 《当复杂网络遇上机器学习》]，将对这些算法以及应用，包括各式各样的网络嵌入算法、节点分类问题、链路预测问题、图分类问题、网络动力学预测问题等做一简单介绍，并对网络上的深度学习问题进行了展望。&lt;br /&gt;
[[File:当复杂网络遇上机器学习.png|400px|thumb|[https://campus.swarma.org/play/coursedetail?id=10504 《当复杂网络遇上机器学习》]|center]]&lt;br /&gt;
*网络上的注意力模型（Graph Attention Model）是一种通用的网络嵌入算法，它能够在节点分类、链路预测等问题上得到极高的精度。它可以模仿一个机器头对网络中的节点进行信息读取和分析，然后将综合的结果放到节点的向量中的过程。[https://campus.swarma.org/play/coursedetail?id=10385 《网络上的注意力模型》]课程将详细介绍这一模型及其应用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''''本中文词条由[[用户:木子二月鸟|木子二月鸟]]用户参与编译，  [[用户: 苏格兰| 苏格兰]]用户审校，欢迎在讨论页面留言'''''。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''本词条内容源自wikipedia及公开资料，遵守 CC3.0协议。'''&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E9%93%BE%E8%B7%AF%E9%A2%84%E6%B5%8B&amp;diff=7637</id>
		<title>链路预测</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E9%93%BE%E8%B7%AF%E9%A2%84%E6%B5%8B&amp;diff=7637"/>
		<updated>2020-05-10T14:43:04Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{#seo:|keywords=链路预测 Link Prediction  |description=通过已知的网络节点以及网络结构等信息，预测网络中尚未产生连边的两个节点之间产生连接的可能性。 }}&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
'''链路预测 Link Prediction'''是指如何通过已知的网络节点以及网络结构等信息，预测网络中尚未产生连边的两个节点之间产生连接的可能性。这种预测既包含了对未知链接 Existing yet unknown link，也称丢失链接 Missing link 的预测，也包含了对未来链接 Future link 的预测。&lt;br /&gt;
&lt;br /&gt;
链路预测是将复杂网络与信息科学联系起来的重要桥梁之一，它所要处理的是信息科学中最基本的问题——缺失信息的还原与预测。链路预测相关研究不仅能够推动网络科学和信息科学理论上的发展，而且具有巨大的实际应用价值，譬如可以知道蛋白质相互作用实验、进行在线社交推荐、找出交通传输网络中有特别重要作用的连边等。&lt;br /&gt;
&lt;br /&gt;
==研究方法==&lt;br /&gt;
===基于相似性的链路预测===&lt;br /&gt;
&lt;br /&gt;
*基于局部信息的相似性指标&lt;br /&gt;
&lt;br /&gt;
社会网络分析中经典的三元闭包 Triadic closure 原则指出，如果A、B	两个人拥有一个共同的朋友C，那么这两个人今后也很有可能成为朋友，从而使得3个节点构成一个闭合的三角形ABC。对于一般的网络，我们可以把这一原则推广如下：两个节点的共同邻居越多，这两个节点就越相似，从而更倾向于相互连接。最简单的基于'''共同邻居 Common neighbors''' 的节点相似性指标定义如下：&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
s_{xy}^{CN} =  |Γ(x)| \cap |Γ(y)|&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
在相似性指标定义的基础上，还可以考虑两个节点的共同邻居的相对数量。下表列出了10种基于节点局部信息的相似性指标，第1种是计算共同邻居相似度的基本公式，其中第2至7种相似性指标是直接基于共同邻居指标的不同的规范化而得到的，表中的 k(x) = |Γ(x)| 为节点x的度。第8种指标PA是基于BA无标度网络模型中新加入节点倾向于和度大的节点相连的优先连接机制而提出的。&lt;br /&gt;
&lt;br /&gt;
第9种指标AA的基本思想是度小的共同邻居节点的贡献大于度大的共同邻居节点，因此根据共同邻居节点的度为每个节点赋予一个权重值。这一点很容易理解，例如在微博中受关注较多的人往往是某个领域的专家或名人，因此共同关注他们的人之间可能并不拥有特别相似的兴趣——一个中学生和一个企业家都有可能是姚晨的粉丝。相反，如果两个人共同关注了一个粉丝很少的人（非名人），那么说明这两个人确实具有相同的兴趣爱好或者重叠的社交圈，因此有更高概率相连。又如在推荐系统中，共同购买冷门产品的两个用户往往比共同购买热门产品的用户更相似。&lt;br /&gt;
[[File:Table1.png|600px|thumb|10种基于节点局部信息的相似性指标|center]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
第2个指标Salton指标&amp;lt;ref name=&amp;quot;[2]&amp;quot;&amp;gt;Salton G, McGill M J () [https://pattern.swarma.org/paper?id=15e10152-92c8-11ea-81db-0242ac1a0005 Introduction to Modern Information Retrieval].&amp;lt;/ref&amp;gt;又称余弦相似性，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{|Γ(x)| \cap |Γ(y)|}{\sqrt{k(x)k(y)}}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第3个指标Jaccard指标&amp;lt;ref name=&amp;quot;[3]&amp;quot;&amp;gt;Jaccard P. () [https://pattern.swarma.org/paper?id=70c8a48a-92c8-11ea-9f7f-0242ac1a0005 Etude de la distribution florale dans une portion des Alpes et du Jura].&amp;lt;/ref&amp;gt;是于100多年前由Jaccard提出的，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{|Γ(x)| \cap |Γ(y)|}{|Γ(x)| \bigcup  |Γ(y)|}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第4个指标Sorensen指标&amp;lt;ref name=&amp;quot;[4]&amp;quot;&amp;gt;Sørensen, T, Sørensen, T A, Sørensen, T J (1948) [https://pattern.swarma.org/paper?id=ea7f2902-6e74-11ea-9db3-0242ac1a0005 A method of establishing groups of equal amplitude in plant sociology based on similarity of species content and its application to analyses of the vegetation on Danish commons].&amp;lt;/ref&amp;gt;常用于生态学研究，其定义为 &amp;lt;math&amp;gt;s{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{kx + ky}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第5个指标大度节点有利指标&amp;lt;ref name=&amp;quot;[5]&amp;quot;&amp;gt;E. Ravasz,A. L. Somera,D. A. Mongru,Z. N. Oltvai,A. -L. Barabasi (2002) [https://pattern.swarma.org/paper?id=6eb98b7e-6e91-11ea-81b9-0242ac1a0005 Hierarchical organization of modularity in metabolic networks].arXiv:0209244.&amp;lt;/ref&amp;gt;（Hub promoted index，HPI）被用来定量刻画新陈代谢网络中每对反应物的拓扑相似程度，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{min\{k_x,k_y\}}&amp;lt;/math&amp;gt;，由于分母只由度较小的节点决定，在此定义下可知大度节点（hub）与其他节点之间更容易具有高的相似性。&lt;br /&gt;
&lt;br /&gt;
第6个指标大度节点不利指标&amp;lt;ref name=&amp;quot;[6]&amp;quot;&amp;gt;Tao Zhou,Linyuan Lu,Yi-Cheng Zhang (2009) [https://pattern.swarma.org/paper?id=7a2b26ba-6e92-11ea-9ee2-0242ac1a0005 Predicting Missing Links via Local Information].arXiv:0901.0553.&amp;lt;/ref&amp;gt;（hub depressed index, HDI）定义与HPI相似，只是分母取两端节点度的最大值，即 &amp;lt;math&amp;gt;s_{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{max\{k_x,k_y\}}&amp;lt;/math&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
第7个指标LHN-I指标&amp;lt;ref name=&amp;quot;[7]&amp;quot;&amp;gt;E. A. Leicht,Petter Holme,M. E. J. Newman (2005) [https://pattern.swarma.org/paper?id=71890c4e-6f0e-11ea-b30e-0242ac1a0005 Vertex similarity in networks].arXiv:0510143.&amp;lt;/ref&amp;gt;是由Leicht，Holme和Newman提出，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{{k_xk_y}}&amp;lt;/math&amp;gt;，其中分母&amp;lt;math&amp;gt;k_xk_y&amp;lt;/math&amp;gt; 正比于节点&amp;lt;math&amp;gt;v_x&amp;lt;/math&amp;gt;和节点&amp;lt;math&amp;gt;v_y&amp;lt;/math&amp;gt;共同邻居数的期望值，即 &amp;lt;math&amp;gt;E( |Γ(x)| \cap |Γ(y)|)&amp;lt;/math&amp;gt;。在下面这篇文献中，Leicht等人同时提出了另一个基于路径的指标，为了有所区别，将此局部指标命名为LHN-I指标，将基于路径的指标命名为LHN-II指标：&lt;br /&gt;
&lt;br /&gt;
第8个指标PA（preferential attachment）是基于BA无标度网络模型中新加入节点倾向于和度大的节点相连的优先连接机制而提出的，在这种机制的链路预测中，每一步首先去除一条链接，然后再添加一条链接，新链接连接节点&amp;lt;math&amp;gt;v_x&amp;lt;/math&amp;gt;和&amp;lt;math&amp;gt;v_y&amp;lt;/math&amp;gt;的概率就正比于两节点度的乘积，由此可以定义两节点间的优先连接相似性：&amp;lt;math&amp;gt;s_{xy}= k_xk_y&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第9个指标AA（Adamic-Adar）&amp;lt;ref name=&amp;quot;[8]&amp;quot;&amp;gt;Adar, Adamic L A, E (2003) [https://pattern.swarma.org/paper?id=e4726a06-6f2d-11ea-8846-0242ac1a0005 Friends and neighbors on the web].Social networks.25.(211--230)&amp;lt;/ref&amp;gt;的基本思想是度小的共同邻居节点的贡献大于度大的共同邻居节点，因此根据共同邻居节点的度为每个节点赋予一个权重值。这一点很容易理解，例如在微博中受关注较多的人往往是某个领域的专家或名人，因此共同关注他们的人之间可能并不拥有特别相似的兴趣——一个中学生和一个企业家都有可能是姚晨的粉丝。相反，如果两个人共同关注了一个粉丝很少的人（非名人），那么说明这两个人确实具有相同的兴趣爱好或者重叠的社交圈，因此有更高概率相连。又如在推荐系统中，共同购买冷门产品的两个用户往往比共同购买热门产品的用户更相似。AA指标根据共同邻居节点的度为每个节点赋予一个权重值，该权重等于该节点的度的对数分之一，即AA指标的定义为：&amp;lt;math&amp;gt;s_{xy}=\sum _{z\in \Gamma (x)\bigcap \Gamma (y)}\frac{1}{logk_z}&amp;lt;/math&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
第10种指标RA是受网络资源分配过程的启发，周涛等人提出的“'''资源分配指标 Resource allocation'''”，其与AA指标有异曲同工之妙。RA和AA指标最大的区别就在于赋予共同邻居节点权重的方式不同，前者是以 1/k 的形式递减，后者是以 1/logk 的形式递减。可见，当网络的平均度较小时，RA和AA差别不大；但是当平均度较大时，就有很大的区别了。研究显示，RA指标在刻画加权网络和社区挖掘应用中的表现胜过AA指标，图灵奖得主Hopdroft的一篇论文也显示，可以利用社区等中观结构信息改进局部指标，其中RA指标改进后的效果最佳。&lt;br /&gt;
&lt;br /&gt;
*基于路径的相似性指标&lt;br /&gt;
&lt;br /&gt;
基于共同邻居的相似性指标的优势在于计算复杂度较低，但是由于使用的信息非常有限，预测精度受到限制，因此发展出了基于路径的相似性指标，主要有3个，分别是局部路径指标 Local path 、Katz指标和LHN-II指标。&lt;br /&gt;
&lt;br /&gt;
1.局部路径指标&lt;br /&gt;
&lt;br /&gt;
周涛等人在共同邻居的基础上考虑三阶路径的因素，提出了基于局部路径的相似性指标，其定义为 &amp;lt;math&amp;gt; S=A^2+\alpha A^3&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 为可调参数，A 表示网络的邻接矩阵， &amp;lt;math&amp;gt;(A^3)_{xy}&amp;lt;/math&amp;gt;表示节点 &amp;lt;math&amp;gt;V_x&amp;lt;/math&amp;gt; 和 &amp;lt;math&amp;gt;V_y&amp;lt;/math&amp;gt; 之间长度为3的路径数目。当&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; = 0时，LP指标就退化为 CN 指标。 CN 指标本质上也可看成基于路径的指标，只是它仅考虑了二阶路径数目。局部路径指标可以扩展为更高阶的情形，即考虑n阶路径的情况：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt; S^n=A^2+\alpha\cdot A^3+\alpha^2\cdot A^4+\cdots +\alpha^{n-2}\cdot A^n &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
随着 n 的增加，局部路径指标的计算复杂度越来越大。一般而言，考虑 n 阶路径的计算复杂度为O(N&amp;lt;k&amp;gt;^n)。但是当 n 趋于无穷大的时候，局部路径指标相当于考虑网络全部路径的Katz指标，此时计算量反而有可能下降，因为可转变为计算矩阵的逆&amp;lt;ref name=&amp;quot;[10]&amp;quot;&amp;gt;Linyuan Lü, Ci-Hang Jin,  Tao Zhou () [https://pattern.swarma.org/paper?id=ba461814-70a3-11ea-8026-0242ac1a0005 Similarity Index Based on Local Paths for Link Prediction of Complex Networks].&amp;lt;/ref&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
2.Katz指标&lt;br /&gt;
&lt;br /&gt;
Katz指标考虑了所有网络的路径，因此其定义为：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S_{xy}=\sum_{l=1}^{\infty }\alpha^l\cdot\left |  paths_{x,y}^{&amp;lt;l&amp;gt;} \right |= \alpha A_{xy}+\alpha^2\cdot (A^2)_{xy}+\alpha^3\cdot (A^3)_{xy}+\cdots  &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\alpha &amp;gt; 0&amp;lt;/math&amp;gt; 为控制路径权重的可调参数，&amp;lt;math&amp;gt;\left |  paths_{x,y}^{&amp;lt;l&amp;gt;} \right |&amp;lt;/math&amp;gt;表示连接节点 &amp;lt;math&amp;gt;V_x&amp;lt;/math&amp;gt;和  &amp;lt;math&amp;gt;V_y&amp;lt;/math&amp;gt; 的路径中长度为 l 的路径数。要使上述级数收敛，则参数&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 应小于邻接矩阵最大特征值的倒数，此定义还可以表示为：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S = (I - \alpha\cdot A)^{-1} - I&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
显然，当参数&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 很小时，高阶路径的贡献也较小，使得 Katz 指标的预测结果接近于局部路径指标&amp;lt;ref name=&amp;quot;[11]&amp;quot;&amp;gt;Leo Katz (1953) [https://pattern.swarma.org/paper?id=b2dee81c-70b2-11ea-b7f9-0242ac1a0005 A new status index derived from sociometric analysis].psychometrika.18.1:(39-43)&amp;lt;/ref&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
3.LHN-II指标&lt;br /&gt;
&lt;br /&gt;
LHN-II 指标是 Leicht，Holme 和 Newman 提出的另一种相似性计算方法，他的基本思想是基于'''一般等价 Regular equivalence''' 提出的。与结构等价不同，一般等价的定义更广泛。在一般等价的定义下，如果两个节点所连接的节点之间相似，那么这两个节点也相似，即使它们之间没有共同的邻居节点。&lt;br /&gt;
&lt;br /&gt;
下图给出了一个简单的例子来帮助我们理解结构等价和一般等价的区别。根据结构等价的定义，在公司A内部，由于员工a和员工b都认识员工e和员工f（即它们有两个共同邻居节点），于是称员工a和员工b是结构等价的。同理，员工e和员工f也是结构等价的，同样地，在公司B中，员工c和员工d是结构等价的，员工g和员工h也是结构等价的。现在考虑员工a和员工c是否相似？根据一般等价的定义，由于员工a连接的节点e、f与员工c连接的节点g、h分别是相似的，那么我们可以认为员工a和员工c也是相似的，同理，在一般等价的意义下，员工b和员工d也是相似。从这个例子可以看出，结构相似性或称结构等价更强调的是两个节点是否在同一个环境下，也就是说是否连接了相同的节点；然而一般等价考虑的是这两个节点是否处于同样的角色，即使他们没有相同的邻居节点，但是由于各自的邻居节点之间本身相似，这两个节点也相似。一般等价意义下的相似性是LHN-II指标的核心。&lt;br /&gt;
&lt;br /&gt;
[[File:一般等价和结构等价示例.png|600px|thumb|一般等价和结构等价示例（图中实线表示连接，虚线表示相似关系）|center]]&lt;br /&gt;
&lt;br /&gt;
从一般等价的角度考虑，LHN-II指标认为如果两个节点的邻居节点之间是相似的，那么这两个节点也是相似的。它与Katz指标的区别主要是把Katz指标中的&amp;lt;math&amp;gt; (A^{n})_{xy} &amp;lt;/math&amp;gt;变成 &amp;lt;math&amp;gt;  (A^{n})_{xy}&amp;lt;/math&amp;gt; 的期望值，注意到 &amp;lt;math&amp;gt; (A^{n})_{xy}&amp;lt;/math&amp;gt; 的期望值为 &amp;lt;math&amp;gt; E\left [ (A^l)_{xy} \right ]=\frac{k_xk_y}{M}\lambda _1^{l-1}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\lambda_1&amp;lt;/math&amp;gt;为矩阵A的最大特征值，则LHN-II指标的表达式如下：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 S_{xy}^{LHN2}=\delta _{xy} + \sum_{l=1}^{\infty }\Phi ^l \frac{(A^l)_{xy}}{E\left [ (A^l)_{xy} \right ]}&lt;br /&gt;
=\delta _{xy} + \frac{2M}{k_xk_y}\sum_{l=1}^{\infty }\Phi ^l\lambda _1^{1-l}(A^l)_{xy}&lt;br /&gt;
=\left [ 1 - \frac{2 M \lambda_1}{k_xk_y} \right ]\delta _{xy} + \frac{2 M \lambda_1}{k_xk_y}\left [ (I-\frac{\Phi}{\lambda_1} A )^{-1} \right ]_{xy}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\delta _{xy}&amp;lt;/math&amp;gt;为 Kronecker &amp;lt;math&amp;gt;\delta&amp;lt;/math&amp;gt; 函数，&amp;lt;math&amp;gt; \Phi&amp;lt;/math&amp;gt; 为取值小于1的参数。上式最后一个等式的第一项是可以去掉的对角阵，从而相似性矩阵可以写为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S=2M\lambda_1D^{-1}(I-\frac{\Phi A}{\lambda_1})^{-1}D^{-1}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中''D''为度值矩阵，&amp;lt;math&amp;gt;D_{xy} = \delta_{xy} \cdot k_{x}&amp;lt;/math&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
*基于随机游走的节点相似性指标&lt;br /&gt;
&lt;br /&gt;
还有相当数量的相似性指标是基于随机游走过程定义的，包括'''平均通勤时间 Average commute time''' 、'''Cos+指标'''、'''有重启的随机游走 Random walk with restart'''、'''SimRank'''指标、'''局部随机游走指标 Local random walk''' 和'''有叠加效应的随机游走指标 Superposed random walk'''等。&lt;br /&gt;
&lt;br /&gt;
1.平均通勤时间 ACT &amp;lt;ref name=&amp;quot;[12]&amp;quot;&amp;gt;D. J. Klein,M. Randić (1993) [https://pattern.swarma.org/paper?id=b5177044-70c7-11ea-b241-0242ac1a0005 Resistance distance].journal of mathematical chemistry.12.1:(81-95)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
设&amp;lt;math&amp;gt;m(x,y)&amp;lt;/math&amp;gt; 为一个随机粒子从节点x到节点y平均需要走的步数，那么节点x和y的平均通勤时间定义为：&amp;lt;math&amp;gt;n(x , y) = m(x , y) + m(y , x) &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其数值解可通过求该网络拉普拉斯矩阵&amp;lt;math&amp;gt;L&amp;lt;/math&amp;gt; 的伪逆&amp;lt;math&amp;gt; L^+&amp;lt;/math&amp;gt; 获得，即 &amp;lt;math&amp;gt;n(x,y)=M(l^+_{xx} +l^+_{yy} - 2l^+_{xy})&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;l^{+}_{xy}&amp;lt;/math&amp;gt;表示矩阵&amp;lt;math&amp;gt;L^+ &amp;lt;/math&amp;gt;中相应位置的元素。如果两个节点的平均通勤时间越小，那么两个节点越进阶。由此，定义基于ACT的相似性为（在此可忽略常数M）&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{ACT}=\frac{1}{l^+_{xx} +l^+_{yy} - 2l^+_{xy}}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
2.余弦相似性指标 Cos+指标&amp;lt;ref name=&amp;quot;[13]&amp;quot;&amp;gt;Fouss F, Pirotte A, Renders J M (2007) [https://pattern.swarma.org/paper?id=f3ce12c4-70c8-11ea-8ff9-0242ac1a0005 Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation].IEEE Transactions on knowledge and data engineering.19.(355-369)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
在由向量&amp;lt;math&amp;gt;v_x = \Lambda ^{1/2}U^{T}e_{x}&amp;lt;/math&amp;gt;展开的欧式空间内，&amp;lt;math&amp;gt;L^+ &amp;lt;/math&amp;gt;中的元素&amp;lt;math&amp;gt;l^{+}_{xy}&amp;lt;/math&amp;gt;可表示为两向量&amp;lt;math&amp;gt;v_x&amp;lt;/math&amp;gt;和&amp;lt;math&amp;gt;v_y&amp;lt;/math&amp;gt;的内积，即&amp;lt;math&amp;gt; l^{+}_{xy} = v_{x}^{T} v_y&amp;lt;/math&amp;gt;，其中&amp;lt;math&amp;gt;U&amp;lt;/math&amp;gt;是一个标准正交矩阵，由&amp;lt;math&amp;gt;L^+&amp;lt;/math&amp;gt;特征向量按照对应的特征根从大到小排列，&amp;lt;math&amp;gt;\Lambda&amp;lt;/math&amp;gt;为以特征根为对角元素的对角矩阵，&amp;lt;math&amp;gt;e_{x}&amp;lt;/math&amp;gt; 表示一个一维向量且只有第x个元素为1，其他都为0。由此定义余弦相似性如下：&lt;br /&gt;
&lt;br /&gt;
s_{xy}^{cos+}=cos(x,y)^+=\frac{l_{xy}^+}{\sqrt{l^+_{xx} \cdot l^+_{yy}}}&lt;br /&gt;
&lt;br /&gt;
3.重启的随机游走 RWR&amp;lt;ref name=&amp;quot;[14]&amp;quot;&amp;gt;Brin, S, Page, L (1998) [https://pattern.swarma.org/paper?id=15405998-70ca-11ea-b1b5-0242ac1a0005 The anatomy of a large-scale hypertextual web search engine].&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
这个指标可以看成是PageRank 算法的拓展应用。它假设随机游走粒子在每走一步的时候都以一定概率返回初始位置。设粒子返回概率为 1-c，&amp;lt;math&amp;gt;P&amp;lt;/math&amp;gt; 为网络的马尔科夫概率转移矩阵，其元素 &amp;lt;math&amp;gt;P_{xy} = a_{xy}/k_{x} &amp;lt;/math&amp;gt;表示节点x处的粒子下一步走到节点y的概率。其中如果节点x和节点y相连，则&amp;lt;math&amp;gt;a_{xy}=1&amp;lt;/math&amp;gt;，否则&amp;lt;math&amp;gt;a_{xy}=0&amp;lt;/math&amp;gt;。某一粒子初始时刻在节点x处，那么t+1时刻该粒子到达网络各个节点的概率向量为&lt;br /&gt;
&amp;lt;math&amp;gt;q_{x}(t+1) = c \cdot P^{T}q_{x}(t) + (1-c) e_{x}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;e_{x}&amp;lt;/math&amp;gt;表示初始状态（其定义与Cos+中相同），上式的稳态解为&amp;lt;math&amp;gt;q_{x} = (1-c)(I-cP^{T})^{-1}e_{x}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中元素&amp;lt;math&amp;gt;q_{xy}&amp;lt;/math&amp;gt;为从节点x出发的粒子最终有多少概率走到节点y。由此定义RWR相似性如下：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{RWR} = q_{xy} + q_{yx} &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
4.SimRank指标 SimR&amp;lt;ref name=&amp;quot;[15]&amp;quot;&amp;gt;Jeh G, Widom J. SimRank (2002) [https://pattern.swarma.org/paper?id=593e78e0-70cb-11ea-9743-0242ac1a0005 a measure of structural-context similarity].(538-543)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
它的基本假设是，如果两节点所连接的节点相似，那么这两个节点就相似。其自洽定义式为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{simR}=C\frac{\sum_{v_z\in \Gamma (x)}\sum_{{v_z}'\in \Gamma (y)}s_{zz'}^{simR}}{k_xk_y}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中假定 &amp;lt;math&amp;gt;s_{xx} =1, C \in [0,1] &amp;lt;/math&amp;gt;为相似性传递时的衰减参数。&lt;br /&gt;
&lt;br /&gt;
SimR指标同时考虑了结构等价和一般等价。当节点x的邻居z同时也是节点y的邻居时，该指标考虑了结构等价；当节点x不等于节点y时，该指标概率了一般等价。可以证明，SimR指标可以用来描述两个分别从节点x和y出发的粒子平均过多久会相遇。&lt;br /&gt;
&lt;br /&gt;
5.局部随机游走指标 LRW&amp;lt;ref name=&amp;quot;[16]&amp;quot;&amp;gt;Weiping Liu,Linyuan Lu (2010) [https://pattern.swarma.org/paper?id=98d1a08e-70eb-11ea-a520-0242ac1a0005 Link Prediction Based on Local Random Walk].arXiv:1001.2467.89.(58007)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
上述4种随机游走指标是基于全局的随机游走，这类指标往往计算复杂度很高，因此很难在大规模网络上应用。刘伟平和吕琳媛提出了一种基于网络局部随机游走的相似性指标LRW，它只考虑有限步数的随机游走过程。一个粒子 t 时刻从节点x出发，定义&amp;lt;math&amp;gt;π_{xy} (t) &amp;lt;/math&amp;gt;为 t+1 时刻这个粒子正好走到节点y的概率，那么可得到系统演化方程：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\pi_{x} (t + 1) = P^T\pi_{x}(t)，t=0,1,…&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\pi_{x}(0) &amp;lt;/math&amp;gt;为一个&amp;lt;math&amp;gt;Nx1 &amp;lt;/math&amp;gt;的向量，只有第x 个元素为1，其他为0，即&amp;lt;math&amp;gt;\pi_{x}(0) =e_x&amp;lt;/math&amp;gt;。设定各个节点的初始资源分布为&amp;lt;math&amp;gt;q_x&amp;lt;/math&amp;gt;，那么基于t步随机游走的相似性为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{LRW} = q_{xy} + q_{yx}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
6.叠加的局部随机游走指标 SRW&amp;lt;ref name=&amp;quot;[16]&amp;quot;&amp;gt;Weiping Liu,Linyuan Lu (2010) [https://pattern.swarma.org/paper?id=98d1a08e-70eb-11ea-a520-0242ac1a0005 Link Prediction Based on Local Random Walk].arXiv:1001.2467.89.(58007)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
这个指标给邻近目标节点的点更多的机会与目标节点相连，充分考虑了很多真实网络连接上的局域性特点，它是在LRW的基础上，将t步及其以前的结果加总，便得到SRW的值，即：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{SRW}(t)=\sum_{t}^{l=1}s_{xy}^{LRW}(l) = q_x\sum_{t}^{l=1}\pi_{xy}(l) + q_y\sum_{t}^{l=1}\pi_{yx}(l)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===基于似然分析的链路预测===&lt;br /&gt;
&lt;br /&gt;
基于相似性的链路预测方法，是最简单的一种分析框架，除此之外，还有另一种最复杂的链路预测分析框架——基于似然分析的链路预测。这个框架本身远远复杂于基于相似性的框架，而且框架中的每一个组成成分自身都非常复杂，但这个框架下衍生出的算法除了给出链路预测的结果之外，还给出了我们对于网络结构的深刻洞见，例如“'''层次结构模型 Hierachical structure model'''”给出了网路层次组织形态的定量刻画，“'''随机分块模型 Stochastic block model'''”类似于社区分解一样把网络划分成了若干子块。这些对理解网络结构特征方面的贡献，是基于相似性的框架所不能提供的。&lt;br /&gt;
&lt;br /&gt;
基于似然分析的链路预测的基本思路是：根据网络结构的产生和组织方式以及目前已经观察到的链路计算网络的似然值，并认为真实的网络使得网络似然值最大，然后再根据网络似然最大化计算每一对未连接的节点产生连边的可能性。&lt;br /&gt;
&lt;br /&gt;
*层次结构模型 HSM&lt;br /&gt;
&lt;br /&gt;
层次结构模型假设真实的网络都存在某种层次性，网络的连接则可看作是这种内在层次结构的反映。该方法的计算步骤如下：&lt;br /&gt;
&lt;br /&gt;
1.一个N个节点的网络可以用一个包含N个叶子节点的族谱树表示，这N个叶子节点将由N-1个非叶子节点连接起来，其中每个非叶子节点都有一个概率值，则两个叶子节点连接的概率就等于他们最近共同祖先节点的概率值。给定一个族谱树，将网络的似然值最大化，就可以得到非叶子节点的概率值，并由此计算出这一个族谱树所对应的网络最大的似然值。&lt;br /&gt;
&lt;br /&gt;
2.使用马尔科夫链蒙特卡洛方法对网络不同的族谱树进行抽样，使得每个族谱树出现的频次正比于该树对应的最大的网络似然值。两个节点连边的概率就等于所有抽样出来的族谱树中两个节点连边概率的平均值。注意似然高的族谱树会出现多次，因此对这个平均概率的贡献也大。&lt;br /&gt;
&lt;br /&gt;
3.把平均连边概率看做是相似性框架中的相似性指标&amp;lt;math&amp;gt;s_{xy}&amp;lt;/math&amp;gt;，按照这个值从大到小排序，排在前面的就是预测的连边。&lt;br /&gt;
&lt;br /&gt;
需要指出的是，层次结构模型在处理具有明显层次结构的网络（如恐怖袭击网络和草原食物链）时具有较高的精确度，但在处理一般性网络时效果并不一定突出。&lt;br /&gt;
&lt;br /&gt;
*随机分块模型 SBM&lt;br /&gt;
&lt;br /&gt;
与层次结构模型的思想类似，随机分块模型假设网络中的节点可以被分为若干集合，两个节点间连接的概率只与相应的集合有关。换句话说，同一个群众所有节点的地位是相同的。随机分块模型特别适合刻画节点所属群的成员身份对于其连接行为有关键影响的情况，例如，著名的“角色模型”就包含了随机分块模型的理念。&lt;br /&gt;
&lt;br /&gt;
随机分块模型的效果要好于层次结构模型。同时，该方法还可以剔除网络的错误连边，如纠正蛋白质相互作用网络中的错误连边。&lt;br /&gt;
&lt;br /&gt;
*闭路模型 Loop model&lt;br /&gt;
&lt;br /&gt;
似然分析的更一般的框架是：给定一个网络系统，特定网络哈密顿量的负指数被统计分配函数归一化后，就得到这个网络出现的似然，一条未被观察到的连边存在的可能性就等于添加这条连边后网络的似然值。闭路模型考虑网络结构形成中的“局部性原则”，并由此定义了网络的哈密顿量。实验表明，闭路模型的预测精度大于层次结构模型和随机分块模型。&lt;br /&gt;
&lt;br /&gt;
===基于机器学习的链路预测===&lt;br /&gt;
&lt;br /&gt;
用机器学习的思路进行链路预测，主要分为基于特征分类方法、基于概率图模型方法和基于矩阵分解方法三大类。&lt;br /&gt;
&lt;br /&gt;
*基于特征分类方法&lt;br /&gt;
&lt;br /&gt;
网络中的链路预测问题可以看成机器学习中的分类问题，其中每个数据点对应一对节点之间关系的标记，假定两个节点之间存在连边，则数据点的值为+1，否则为-1。特征选取是分类问题中最重要的问题之一，目前研究较多的主要包括基于节点与边的属性特征和基于节点所处网络的拓扑结构特征（如CN、AA、Katz、最短路径）等。哈桑 Hasan 等人提取合著网络中科学家研究领域的关键词作为特征，用监督学习中一些常用的分类算法（如决策树、K近邻法、多层感知器、支持向量机、径向基网络）对缺失的连边进行较为精准的预测，其中以支持向量机方法表现最佳。&lt;br /&gt;
&lt;br /&gt;
*基于概率图模型&lt;br /&gt;
&lt;br /&gt;
基于概率图模型的链路预测方法使用图模型来表达节点之间的连边概率，根据模型中概率依赖关系，可分为有向无环的贝叶斯网络和无向的马尔科夫网络。随机分块模型和层次结构模型分别是典型的基于贝叶斯网络和基于马尔科夫网络的链路预测方法。基于概率图模型的链路预测方法有很多，典型的还有有监督随机游走链路预测算法，将网络结构信息与节点和连边的属性信息结合起来，给每条边分配不同的转移概率。与其他有监督的机器学习方法相比，该算法无须知道网络的特征和相关的领域知识。&lt;br /&gt;
&lt;br /&gt;
*基于矩阵分解&lt;br /&gt;
&lt;br /&gt;
基于矩阵分解的链路预测方法是基于网络邻接矩阵的代数谱变换而得到的方法，来预测网络中链路的存在性和链路的权值。相比其他几种机器学习方法，该方法要学习的参数少很多，但计算复杂度较高。链路预测问题可以视为邻接矩阵填充问题，并可以通过双线性回归模型将节点和链路的显特征和隐特征结合起来用矩阵分解方法解决。边缘去噪模型将根据给定关系矩阵求未知边或丢失边的问题变成一个矩阵降噪去噪问题。&lt;br /&gt;
&lt;br /&gt;
关于不同的链路预测研究方法的分类可以参考下表：&lt;br /&gt;
[[File:Link preditction method.png|600px|thumb|三类不同的链路预测方法（*表示该方法含有参数）|center]]&lt;br /&gt;
&lt;br /&gt;
==应用场景==&lt;br /&gt;
链路预测有着广泛的应用场景：在生物领域，利用蛋白质间相互作用关系的结构信息进行链路预测，可以为实验的测定提前提供参考依据，从而降低实验成本、提高成功率；在社交网络领域，链路预测可以对社交网络中的好友关系、朋友推荐进行预测，从而提高用户对社交网站的体验满意度和使用黏性；在电子商务领域，除了传统的协同过滤推荐算法外，利用网络结构信息（如网络三角形结构）等特征进行商品推荐也取得了显著的优势；此外，通过识别隐藏的链边或异常的链边对信息不完全或含有噪音的网络进行重构，可以提高网络的传输能力，这对于航空网络重构有很大的启发意义。&lt;br /&gt;
[[File:Figure2.png|400px|thumb|链路预测应用场景示意图（图片来自网络）|center]]&lt;br /&gt;
&lt;br /&gt;
除此之外，链路预测的算法和思想通过一些变换还可以用来解决一些看似没有太大关系的问题。例如，对疾病信号和股票指数的预测。基于链路预测的思想和方法，我们还可以设计基于节点相似性的社团划分以及对网络演化模型的定量化评估方法。链路预测还可以帮助提高节点标签预测的精度，特别是在已知标签节点稀疏的情况下效果显著。这一方法可以应用于判断一篇学术论文的类型，判断一本书的政治态度（中立、自由派或保守派），或者判断一个手机用户是否产生了更换电信运营商的念头。&lt;br /&gt;
&lt;br /&gt;
==代表人物==&lt;br /&gt;
*'''吕琳媛'''&lt;br /&gt;
吕琳媛主要研究方向为复杂网络信息挖掘领域，包括海量信息导航、挖掘、推荐和预测。目前担任阿里巴巴复杂科学研究中心副主任，中欧联合实验室执行主任，中国工业与应用数学学会复杂网络与系统控制专业委员会委员，杭州市特聘专家。&lt;br /&gt;
[[File:Lvlinyuan.png|400px|thumb|吕琳媛，阿里巴巴复杂科学研究中心副主任|center]]&lt;br /&gt;
&lt;br /&gt;
近年来主持/参与国家级项目5项（2016年获得国家自然科学基金优秀青年基金），省部级项目4项，横向课题4项。 在相关领域发表学术论文 50余篇，其中SCI论文39篇，总影响因子122，发表期刊包括Physics Reports，PNAS，Nature Communications等国际知名学术期刊。三篇论文入选ESI全球Top-1%高引用论文，论文SCI引用1200余次，谷歌学术引用3000余次，其中9篇论文引用超过100次。2013年出版学术专著《链路预测》获得第四届中国大学出版社图书奖优秀学术著作一等奖。申请发明专利12项。2015年荣获浙江省杰出青年基金，2014年荣获中国计算机学会自然科学二等奖，中国网络科学论坛青年希望奖，首届CCF-腾讯犀牛鸟基金优秀奖。&lt;br /&gt;
&lt;br /&gt;
*'''周涛'''&lt;br /&gt;
周涛主要从事复杂性科学和大数据挖掘算法和应用研究，先后攻克推荐系统准确性-多样性困境、复杂网络链路可预测性、H指数-度-核心度关系等图挖掘领域的重要难题，成果发表在PNAS, Nature Communications, Physics Reports, KDD和ICDM等国际顶尖期刊和会议上。目前论文google总引用超过14000次，其中8篇论文入选ESI高引用论文，H指数为57，2014和2015连续两年入选Elsevier最具国际影响力中国科学家名单。&lt;br /&gt;
[[File:Zhoutao.png|400px|thumb|周涛，第十二届中国青年科技奖|center]]&lt;br /&gt;
&lt;br /&gt;
因其在科学研究上的杰出表现，2011年获得第十二届中国青年科技奖（最年轻获奖者），2011年入选四川省“百人计划”，2012年获得国家首批优秀青年科学基金资助，2013年入选国家“万人计划”首批青年拔尖人才支持计划，2014年获得四川省科技进步一等奖、中国计算机学会自然科学奖，2015年获得共青团中央授予的“最美青年科技工作者”称号，并与屠呦呦等七名个人和北斗导航等三个团队共同当选2015年度中国十大科技创新人物。&lt;br /&gt;
&lt;br /&gt;
*'''马克·纽曼 Mark Newman'''&lt;br /&gt;
Newman是一名英裔美国物理学家，也是密歇根大学 University of Michigan 物理学系的阿纳托尔·拉波特 Anatol Rapoport 杰出教授，也是圣达菲研究所 Santa Fe Institute 的外部教员。他因在复杂网络和复杂系统领域的基础性贡献而闻名，为此他被授予2014年拉格朗日奖。&lt;br /&gt;
[[File:Newman.png|400px|thumb|Mark Newman，密歇根大学物理学系阿纳托尔·拉波特杰出教授|center]]&lt;br /&gt;
&lt;br /&gt;
Newman以其对复杂网络的研究而著称，尤其是在科学家的协作模式，随机图论 Random graph theory，社区结构 Community structure，渗流理论 Percolation theory 和网络流行病学 Network epidemiology方面的工作。他作为共同发明人，与迈克尔·卡斯特 Michael Gastner 一起，发明了一种可以产生密度均衡地图 Density-equalizing maps 或统计地图 Cartograms的方法，该方法构成了Worldmapper网站的基础。他们的工作在2004年美国总统大选后受到关注，成为了当时被广泛传播的一种选举结果地图的基础，（他们）根据各州的人口数调整了州的规模，以便更准确地了解每个党派的选民投票人数。&lt;br /&gt;
&lt;br /&gt;
*'''克里斯托弗·大卫·摩尔 Cristopher David Moore'''&lt;br /&gt;
克里斯托弗·大卫·摩尔 Cristopher David Moore，也称为克里斯·摩尔 Cris Moore 是美国计算机科学家，数学家和物理学家。他是圣达菲研究所的驻校教师，曾任新墨西哥大学 University of New Mexico 的正教授。&lt;br /&gt;
[[File:Cristopher_David_Moore.png|400px|thumb|Cristopher David Moore，圣达菲研究所的驻校教师|center]]&lt;br /&gt;
&lt;br /&gt;
1993年，Moore 发现了一种新颖的解决三体问题的方法，表明在牛顿力学中，三个等质量的物体有可能沿着一条八字形曲线、在同一条轨道相互跟随。Moore 在网络科学领域也很活跃，在该领域有许多著名的出版物。在与Clauset和Mark Newman的合作中，Moore开发了复杂网络的层次聚类概率模型，并表明他们的模型可以在面对网络连接结构发生变化时可靠地预测聚类结果。&lt;br /&gt;
&lt;br /&gt;
*'''亚伦·克劳斯特 Aaron Clauset '''&lt;br /&gt;
Aaron Clauset是一位美国计算机科学家，致力于网络科学，机器学习和复杂系统领域。目前，他在科罗拉多大学博尔德分校 University of Colorado Boulder 教授计算机科学，也是圣菲研究所的外部教员。&lt;br /&gt;
[[File:Aaron_Clauset.png|400px|thumb|  Aaron Clauset，圣菲研究所的外部教员|center]]&lt;br /&gt;
&lt;br /&gt;
Clauset因与Cosma Shalizi和Mark Newman进行的合作研究而闻名，他们针对经验数据中是否存在幂律模式开发了严格的统计检验，并且证明了许多宣称符合幂律分布的网络实际上并不是幂律分布。他还因开发检测复杂网络中的社区结构算法的工作而著称，特别是和Newman、Moore合作发展的网络层次聚类模型。在其他方面，Clauslet 与麦克斯韦·扬 Maxwell Young 、克里斯蒂安·斯克雷德·格莱蒂奇 Kristian Skrede Gleditsch 共同完成了一些独特发现：世界范围内恐怖事件发生的频率和严重性服从幂律分布。&lt;br /&gt;
&lt;br /&gt;
2015年，Clauset 因开发和评估一种网络结构特征的新方法而获得了美国国家科学基金会颁发的著名的CAREER奖。2016年，Clauset因在网络结构方面（包括Internet映射，推断缺失链接和社区结构），以及对人类冲突和社会分层所做的启发性分析方面做出的贡献而获得网络科学学会颁发的网络科学领域的Erdös-Rényi奖。&lt;br /&gt;
&lt;br /&gt;
==参考资料==&lt;br /&gt;
*汪小帆,李翔,陈关荣.《网络科学导论》.北京：高等教育出版社,2012年：178-186&lt;br /&gt;
*吕琳媛,周涛.《链路预测》.北京：高等教育出版社,2013年：57-93&lt;br /&gt;
*吕琳媛,任晓龙,周涛.《网络链路预测：概念与前沿》[J].《中国计算机学会通讯》,2016年,第4期&lt;br /&gt;
*Clauset A, Moore C, Newman M E J. Hierarchical structure and the prediction of missing links in networks [J]. Nature, 2008,453(7191): 98-101.&lt;br /&gt;
*Link Prediction Group 网站：http://www.linkprediction.org/&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
*链接预测可用于分析网络将如何发展，或者在给定信息不完整情况下来发现“丢失”的链接，对于这个问题，有研究者提出了一种新的，结合广义群贴近度中心性和半值相互作用指数的拟局部方法（即考虑半径k内节点的方法），详见 [https://swarma.org/?p=18249 《链路预测的博弈算法》]&lt;br /&gt;
[[File:链路预测的博弈算法.jpg|400px|thumb|[https://swarma.org/?p=18249 《链路预测的博弈算法》]|center]]&lt;br /&gt;
*深度学习已经成功地在图像识别、语音识别、自然语言处理、游戏与博弈等领域取得了突飞猛进的发展，并渗透到了我们的日常生活中。那么，我们有没有可能将这种技术借剪到复杂网 络的研究之中呢？近年来，人们凭借着网络嵌入（Network Embedding）、图卷积神经网络（Graph Convolutional Neural Network）、图注意力模型（Graph Attention Network）等新技术，已经开发了若干图结构上的深度学习算法，并取得了一定的成功应用。北师大系统科学学院教授、博导张江老师亲授[https://campus.swarma.org/play/coursedetail?id=10504 《当复杂网络遇上机器学习》]，将对这些算法以及应用，包括各式各样的网络嵌入算法、节点分类问题、链路预测问题、图分类问题、网络动力学预测问题等做一简单介绍，并对网络上的深度学习问题进行了展望。&lt;br /&gt;
[[File:当复杂网络遇上机器学习.png|400px|thumb|[https://campus.swarma.org/play/coursedetail?id=10504 《当复杂网络遇上机器学习》]|center]]&lt;br /&gt;
*网络上的注意力模型（Graph Attention Model）是一种通用的网络嵌入算法，它能够在节点分类、链路预测等问题上得到极高的精度。它可以模仿一个机器头对网络中的节点进行信息读取和分析，然后将综合的结果放到节点的向量中的过程。[https://campus.swarma.org/play/coursedetail?id=10385 《网络上的注意力模型》]课程将详细介绍这一模型及其应用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''''本中文词条由[[用户:木子二月鸟|木子二月鸟]]用户参与编译，  [[用户: 苏格兰| 苏格兰]]用户审校，欢迎在讨论页面留言'''''。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''本词条内容源自wikipedia及公开资料，遵守 CC3.0协议。'''&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E9%93%BE%E8%B7%AF%E9%A2%84%E6%B5%8B&amp;diff=7635</id>
		<title>链路预测</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E9%93%BE%E8%B7%AF%E9%A2%84%E6%B5%8B&amp;diff=7635"/>
		<updated>2020-05-10T14:41:13Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：/* 基于相似性的链路预测 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{#seo:|keywords=链路预测 Link Prediction  |description=通过已知的网络节点以及网络结构等信息，预测网络中尚未产生连边的两个节点之间产生连接的可能性。 }}&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
'''链路预测 Link Prediction'''是指如何通过已知的网络节点以及网络结构等信息，预测网络中尚未产生连边的两个节点之间产生连接的可能性。这种预测既包含了对未知链接 Existing yet unknown link，也称丢失链接 Missing link 的预测，也包含了对未来链接 Future link 的预测。&lt;br /&gt;
&lt;br /&gt;
链路预测是将复杂网络与信息科学联系起来的重要桥梁之一，它所要处理的是信息科学中最基本的问题——缺失信息的还原与预测。链路预测相关研究不仅能够推动网络科学和信息科学理论上的发展，而且具有巨大的实际应用价值，譬如可以知道蛋白质相互作用实验、进行在线社交推荐、找出交通传输网络中有特别重要作用的连边等。&lt;br /&gt;
&lt;br /&gt;
==研究方法==&lt;br /&gt;
===基于相似性的链路预测===&lt;br /&gt;
&lt;br /&gt;
*基于局部信息的相似性指标&lt;br /&gt;
&lt;br /&gt;
社会网络分析中经典的三元闭包 Triadic closure 原则指出，如果A、B	两个人拥有一个共同的朋友C，那么这两个人今后也很有可能成为朋友，从而使得3个节点构成一个闭合的三角形ABC。对于一般的网络，我们可以把这一原则推广如下：两个节点的共同邻居越多，这两个节点就越相似，从而更倾向于相互连接。最简单的基于'''共同邻居 Common neighbors''' 的节点相似性指标定义如下：&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
s_{xy}^{CN} =  |Γ(x)| \cap |Γ(y)|&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
在相似性指标定义的基础上，还可以考虑两个节点的共同邻居的相对数量。下表列出了10种基于节点局部信息的相似性指标，第1种是计算共同邻居相似度的基本公式，其中第2至7种相似性指标是直接基于共同邻居指标的不同的规范化而得到的，表中的 k(x) = |Γ(x)| 为节点x的度。第8种指标PA是基于BA无标度网络模型中新加入节点倾向于和度大的节点相连的优先连接机制而提出的。&lt;br /&gt;
&lt;br /&gt;
第9种指标AA的基本思想是度小的共同邻居节点的贡献大于度大的共同邻居节点，因此根据共同邻居节点的度为每个节点赋予一个权重值。这一点很容易理解，例如在微博中受关注较多的人往往是某个领域的专家或名人，因此共同关注他们的人之间可能并不拥有特别相似的兴趣——一个中学生和一个企业家都有可能是姚晨的粉丝。相反，如果两个人共同关注了一个粉丝很少的人（非名人），那么说明这两个人确实具有相同的兴趣爱好或者重叠的社交圈，因此有更高概率相连。又如在推荐系统中，共同购买冷门产品的两个用户往往比共同购买热门产品的用户更相似。&lt;br /&gt;
[[File:Table1.png|600px|thumb|10种基于节点局部信息的相似性指标|center]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
第2个指标Salton指标&amp;lt;ref name=&amp;quot;[2]&amp;quot;&amp;gt;Salton G, McGill M J () [https://pattern.swarma.org/paper?id=15e10152-92c8-11ea-81db-0242ac1a0005 Introduction to Modern Information Retrieval].&amp;lt;/ref&amp;gt;又称余弦相似性，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{|Γ(x)| \cap |Γ(y)|}{\sqrt{k(x)k(y)}}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第3个指标Jaccard指标&amp;lt;ref name=&amp;quot;[3]&amp;quot;&amp;gt;Jaccard P. () [https://pattern.swarma.org/paper?id=70c8a48a-92c8-11ea-9f7f-0242ac1a0005 Etude de la distribution florale dans une portion des Alpes et du Jura].&amp;lt;/ref&amp;gt;是于100多年前由Jaccard提出的，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{|Γ(x)| \cap |Γ(y)|}{|Γ(x)| \bigcup  |Γ(y)|}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第4个指标Sorensen指标&amp;lt;ref name=&amp;quot;[4]&amp;quot;&amp;gt;Sørensen, T, Sørensen, T A, Sørensen, T J (1948) [https://pattern.swarma.org/paper?id=ea7f2902-6e74-11ea-9db3-0242ac1a0005 A method of establishing groups of equal amplitude in plant sociology based on similarity of species content and its application to analyses of the vegetation on Danish commons].&amp;lt;/ref&amp;gt;常用于生态学研究，其定义为 &amp;lt;math&amp;gt;s{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{kx + ky}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第5个指标大度节点有利指标&amp;lt;ref name=&amp;quot;[5]&amp;quot;&amp;gt;E. Ravasz,A. L. Somera,D. A. Mongru,Z. N. Oltvai,A. -L. Barabasi (2002) [https://pattern.swarma.org/paper?id=6eb98b7e-6e91-11ea-81b9-0242ac1a0005 Hierarchical organization of modularity in metabolic networks].arXiv:0209244.&amp;lt;/ref&amp;gt;（Hub promoted index，HPI）被用来定量刻画新陈代谢网络中每对反应物的拓扑相似程度，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{min\{k_x,k_y\}}&amp;lt;/math&amp;gt;，由于分母只由度较小的节点决定，在此定义下可知大度节点（hub）与其他节点之间更容易具有高的相似性。&lt;br /&gt;
&lt;br /&gt;
第6个指标大度节点不利指标&amp;lt;ref name=&amp;quot;[6]&amp;quot;&amp;gt;Tao Zhou,Linyuan Lu,Yi-Cheng Zhang (2009) [https://pattern.swarma.org/paper?id=7a2b26ba-6e92-11ea-9ee2-0242ac1a0005 Predicting Missing Links via Local Information].arXiv:0901.0553.&amp;lt;/ref&amp;gt;（hub depressed index, HDI）定义与HPI相似，只是分母取两端节点度的最大值，即 &amp;lt;math&amp;gt;s_{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{max\{k_x,k_y\}}&amp;lt;/math&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
第7个指标LHN-I指标&amp;lt;ref name=&amp;quot;[7]&amp;quot;&amp;gt;E. A. Leicht,Petter Holme,M. E. J. Newman (2005) [https://pattern.swarma.org/paper?id=71890c4e-6f0e-11ea-b30e-0242ac1a0005 Vertex similarity in networks].arXiv:0510143.&amp;lt;/ref&amp;gt;是由Leicht，Holme和Newman提出，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{{k_xk_y}}&amp;lt;/math&amp;gt;，其中分母&amp;lt;math&amp;gt;k_xk_y&amp;lt;/math&amp;gt; 正比于节点&amp;lt;math&amp;gt;v_x&amp;lt;/math&amp;gt;和节点&amp;lt;math&amp;gt;v_y&amp;lt;/math&amp;gt;共同邻居数的期望值，即 &amp;lt;math&amp;gt;E( |Γ(x)| \cap |Γ(y)|)&amp;lt;/math&amp;gt;。在下面这篇文献中，Leicht等人同时提出了另一个基于路径的指标，为了有所区别，将此局部指标命名为LHN-I指标，将基于路径的指标命名为LHN-II指标：&lt;br /&gt;
&lt;br /&gt;
第8个指标PA（preferential attachment）是基于BA无标度网络模型中新加入节点倾向于和度大的节点相连的优先连接机制而提出的，在这种机制的链路预测中，每一步首先去除一条链接，然后再添加一条链接，新链接连接节点&amp;lt;math&amp;gt;v_x&amp;lt;/math&amp;gt;和&amp;lt;math&amp;gt;v_y&amp;lt;/math&amp;gt;的概率就正比于两节点度的乘积，由此可以定义两节点间的优先连接相似性：&amp;lt;math&amp;gt;s_{xy}= k_xk_y&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第9个指标AA（Adamic-Adar）&amp;lt;ref name=&amp;quot;[8]&amp;quot;&amp;gt;Adar, Adamic L A, E (2003) [https://pattern.swarma.org/paper?id=e4726a06-6f2d-11ea-8846-0242ac1a0005 Friends and neighbors on the web].Social networks.25.(211--230)&amp;lt;/ref&amp;gt;的基本思想是度小的共同邻居节点的贡献大于度大的共同邻居节点，因此根据共同邻居节点的度为每个节点赋予一个权重值。这一点很容易理解，例如在微博中受关注较多的人往往是某个领域的专家或名人，因此共同关注他们的人之间可能并不拥有特别相似的兴趣——一个中学生和一个企业家都有可能是姚晨的粉丝。相反，如果两个人共同关注了一个粉丝很少的人（非名人），那么说明这两个人确实具有相同的兴趣爱好或者重叠的社交圈，因此有更高概率相连。又如在推荐系统中，共同购买冷门产品的两个用户往往比共同购买热门产品的用户更相似。AA指标根据共同邻居节点的度为每个节点赋予一个权重值，该权重等于该节点的度的对数分之一，即AA指标的定义为：&amp;lt;math&amp;gt;s_{xy}=\sum _{z\in \Gamma (x)\bigcap \Gamma (y)}\frac{1}{logk_z}&amp;lt;/math&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
第10种指标RA是受网络资源分配过程的启发，周涛等人提出的“'''资源分配指标 Resource allocation'''”，其与AA指标有异曲同工之妙。RA和AA指标最大的区别就在于赋予共同邻居节点权重的方式不同，前者是以 1/k 的形式递减，后者是以 1/logk 的形式递减。可见，当网络的平均度较小时，RA和AA差别不大；但是当平均度较大时，就有很大的区别了。研究显示，RA指标在刻画加权网络和社区挖掘应用中的表现胜过AA指标，图灵奖得主Hopdroft的一篇论文也显示，可以利用社区等中观结构信息改进局部指标，其中RA指标改进后的效果最佳。&lt;br /&gt;
&lt;br /&gt;
*基于路径的相似性指标&lt;br /&gt;
&lt;br /&gt;
基于共同邻居的相似性指标的优势在于计算复杂度较低，但是由于使用的信息非常有限，预测精度受到限制，因此发展出了基于路径的相似性指标，主要有3个，分别是局部路径指标 Local path 、Katz指标和LHN-II指标。&lt;br /&gt;
&lt;br /&gt;
1.局部路径指标&lt;br /&gt;
&lt;br /&gt;
周涛等人在共同邻居的基础上考虑三阶路径的因素，提出了基于局部路径的相似性指标，其定义为 &amp;lt;math&amp;gt; S=A^2+\alpha A^3&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 为可调参数，A 表示网络的邻接矩阵， &amp;lt;math&amp;gt;(A^3)_{xy}&amp;lt;/math&amp;gt;表示节点 &amp;lt;math&amp;gt;V_x&amp;lt;/math&amp;gt; 和 &amp;lt;math&amp;gt;V_y&amp;lt;/math&amp;gt; 之间长度为3的路径数目。当&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; = 0时，LP指标就退化为 CN 指标。 CN 指标本质上也可看成基于路径的指标，只是它仅考虑了二阶路径数目。局部路径指标可以扩展为更高阶的情形，即考虑n阶路径的情况：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt; S^n=A^2+\alpha\cdot A^3+\alpha^2\cdot A^4+\cdots +\alpha^{n-2}\cdot A^n &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
随着 n 的增加，局部路径指标的计算复杂度越来越大。一般而言，考虑 n 阶路径的计算复杂度为O(N&amp;lt;k&amp;gt;^n)。但是当 n 趋于无穷大的时候，局部路径指标相当于考虑网络全部路径的Katz指标，此时计算量反而有可能下降，因为可转变为计算矩阵的逆&amp;lt;ref name=&amp;quot;[10]&amp;quot;&amp;gt;Linyuan Lü, Ci-Hang Jin,  Tao Zhou () [https://pattern.swarma.org/paper?id=ba461814-70a3-11ea-8026-0242ac1a0005 Similarity Index Based on Local Paths for Link Prediction of Complex Networks].&amp;lt;/ref&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
2.Katz指标&lt;br /&gt;
&lt;br /&gt;
Katz指标考虑了所有网络的路径，因此其定义为：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S_{xy}=\sum_{l=1}^{\infty }\alpha^l\cdot\left |  paths_{x,y}^{&amp;lt;l&amp;gt;} \right |= \alpha A_{xy}+\alpha^2\cdot (A^2)_{xy}+\alpha^3\cdot (A^3)_{xy}+\cdots  &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\alpha &amp;gt; 0&amp;lt;/math&amp;gt; 为控制路径权重的可调参数，&amp;lt;math&amp;gt;\left |  paths_{x,y}^{&amp;lt;l&amp;gt;} \right |&amp;lt;/math&amp;gt;表示连接节点 &amp;lt;math&amp;gt;V_x&amp;lt;/math&amp;gt;和  &amp;lt;math&amp;gt;V_y&amp;lt;/math&amp;gt; 的路径中长度为 l 的路径数。要使上述级数收敛，则参数&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 应小于邻接矩阵最大特征值的倒数，此定义还可以表示为：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S = (I - \alpha\cdot A)^{-1} - I&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
显然，当参数&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 很小时，高阶路径的贡献也较小，使得 Katz 指标的预测结果接近于局部路径指标&amp;lt;ref name=&amp;quot;[11]&amp;quot;&amp;gt;Leo Katz (1953) [https://pattern.swarma.org/paper?id=b2dee81c-70b2-11ea-b7f9-0242ac1a0005 A new status index derived from sociometric analysis].psychometrika.18.1:(39-43)&amp;lt;/ref&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
3.LHN-II指标&lt;br /&gt;
&lt;br /&gt;
LHN-II 指标是 Leicht，Holme 和 Newman 提出的另一种相似性计算方法，他的基本思想是基于'''一般等价 Regular equivalence''' 提出的。与结构等价不同，一般等价的定义更广泛。在一般等价的定义下，如果两个节点所连接的节点之间相似，那么这两个节点也相似，即使它们之间没有共同的邻居节点。&lt;br /&gt;
&lt;br /&gt;
下图给出了一个简单的例子来帮助我们理解结构等价和一般等价的区别。根据结构等价的定义，在公司A内部，由于员工a和员工b都认识员工e和员工f（即它们有两个共同邻居节点），于是称员工a和员工b是结构等价的。同理，员工e和员工f也是结构等价的，同样地，在公司B中，员工c和员工d是结构等价的，员工g和员工h也是结构等价的。现在考虑员工a和员工c是否相似？根据一般等价的定义，由于员工a连接的节点e、f与员工c连接的节点g、h分别是相似的，那么我们可以认为员工a和员工c也是相似的，同理，在一般等价的意义下，员工b和员工d也是相似。从这个例子可以看出，结构相似性或称结构等价更强调的是两个节点是否在同一个环境下，也就是说是否连接了相同的节点；然而一般等价考虑的是这两个节点是否处于同样的角色，即使他们没有相同的邻居节点，但是由于各自的邻居节点之间本身相似，这两个节点也相似。一般等价意义下的相似性是LHN-II指标的核心。&lt;br /&gt;
&lt;br /&gt;
[[File:一般等价和结构等价示例.png|600px|thumb|一般等价和结构等价示例（图中实线表示连接，虚线表示相似关系）|center]]&lt;br /&gt;
&lt;br /&gt;
从一般等价的角度考虑，LHN-II指标认为如果两个节点的邻居节点之间是相似的，那么这两个节点也是相似的。它与Katz指标的区别主要是把Katz指标中的&amp;lt;math&amp;gt; (A^{n})_{xy} &amp;lt;/math&amp;gt;变成 &amp;lt;math&amp;gt;  (A^{n})_{xy}&amp;lt;/math&amp;gt; 的期望值，注意到 &amp;lt;math&amp;gt; (A^{n})_{xy}&amp;lt;/math&amp;gt; 的期望值为 &amp;lt;math&amp;gt; E\left [ (A^l)_{xy} \right ]=\frac{k_xk_y}{M}\lambda _1^{l-1}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\lambda_1&amp;lt;/math&amp;gt;为矩阵A的最大特征值，则LHN-II指标的表达式如下：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 S_{xy}^{LHN2}=\delta _{xy} + \sum_{l=1}^{\infty }\Phi ^l \frac{(A^l)_{xy}}{E\left [ (A^l)_{xy} \right ]}&lt;br /&gt;
=\delta _{xy} + \frac{2M}{k_xk_y}\sum_{l=1}^{\infty }\Phi ^l\lambda _1^{1-l}(A^l)_{xy}&lt;br /&gt;
=\left [ 1 - \frac{2 M \lambda_1}{k_xk_y} \right ]\delta _{xy} + \frac{2 M \lambda_1}{k_xk_y}\left [ (I-\frac{\Phi}{\lambda_1} A )^{-1} \right ]_{xy}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\delta _{xy}&amp;lt;/math&amp;gt;为 Kronecker &amp;lt;math&amp;gt;\delta&amp;lt;/math&amp;gt; 函数，&amp;lt;math&amp;gt; \Phi&amp;lt;/math&amp;gt; 为取值小于1的参数。上式最后一个等式的第一项是可以去掉的对角阵，从而相似性矩阵可以写为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S=2M\lambda_1D^{-1}(I-\frac{\Phi A}{\lambda_1})^{-1}D^{-1}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中''D''为度值矩阵，&amp;lt;math&amp;gt;D_{xy} = \delta_{xy} \cdot k_{x}&amp;lt;/math&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
*基于随机游走的节点相似性指标&lt;br /&gt;
&lt;br /&gt;
还有相当数量的相似性指标是基于随机游走过程定义的，包括'''平均通勤时间 Average commute time''' 、'''Cos+指标'''、'''有重启的随机游走 Random walk with restart'''、'''SimRank'''指标、'''局部随机游走指标 Local random walk''' 和'''有叠加效应的随机游走指标 Superposed random walk'''等。&lt;br /&gt;
&lt;br /&gt;
1.平均通勤时间 ACT &amp;lt;ref name=&amp;quot;[12]&amp;quot;&amp;gt;D. J. Klein,M. Randić (1993) [https://pattern.swarma.org/paper?id=b5177044-70c7-11ea-b241-0242ac1a0005 Resistance distance].journal of mathematical chemistry.12.1:(81-95)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
设&amp;lt;math&amp;gt;m(x,y)&amp;lt;/math&amp;gt; 为一个随机粒子从节点x到节点y平均需要走的步数，那么节点x和y的平均通勤时间定义为：&amp;lt;math&amp;gt;n(x , y) = m(x , y) + m(y , x) &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其数值解可通过求该网络拉普拉斯矩阵&amp;lt;math&amp;gt;L&amp;lt;/math&amp;gt; 的伪逆&amp;lt;math&amp;gt; L^+&amp;lt;/math&amp;gt; 获得，即 &amp;lt;math&amp;gt;n(x,y)=M(l^+_{xx} +l^+_{yy} - 2l^+_{xy})&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;l^{+}_{xy}&amp;lt;/math&amp;gt;表示矩阵&amp;lt;math&amp;gt;L^+ &amp;lt;/math&amp;gt;中相应位置的元素。如果两个节点的平均通勤时间越小，那么两个节点越进阶。由此，定义基于ACT的相似性为（在此可忽略常数M）&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{ACT}=\frac{1}{l^+_{xx} +l^+_{yy} - 2l^+_{xy}}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
2.余弦相似性指标 Cos+指标&amp;lt;ref name=&amp;quot;13&amp;quot;&amp;gt;Fouss F, Pirotte A, Renders J M (2007) [https://pattern.swarma.org/paper?id=f3ce12c4-70c8-11ea-8ff9-0242ac1a0005 Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation].IEEE Transactions on knowledge and data engineering.19.(355-369)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
在由向量&amp;lt;math&amp;gt;v_x = \Lambda ^{1/2}U^{T}e_{x}&amp;lt;/math&amp;gt;展开的欧式空间内，&amp;lt;math&amp;gt;L^+ &amp;lt;/math&amp;gt;中的元素&amp;lt;math&amp;gt;l^{+}_{xy}&amp;lt;/math&amp;gt;可表示为两向量&amp;lt;math&amp;gt;v_x&amp;lt;/math&amp;gt;和&amp;lt;math&amp;gt;v_y&amp;lt;/math&amp;gt;的内积，即&amp;lt;math&amp;gt; l^{+}_{xy} = v_{x}^{T} v_y&amp;lt;/math&amp;gt;，其中&amp;lt;math&amp;gt;U&amp;lt;/math&amp;gt;是一个标准正交矩阵，由&amp;lt;math&amp;gt;L^+&amp;lt;/math&amp;gt;特征向量按照对应的特征根从大到小排列，&amp;lt;math&amp;gt;\Lambda&amp;lt;/math&amp;gt;为以特征根为对角元素的对角矩阵，&amp;lt;math&amp;gt;e_{x}&amp;lt;/math&amp;gt; 表示一个一维向量且只有第x个元素为1，其他都为0。由此定义余弦相似性如下：&lt;br /&gt;
&lt;br /&gt;
s_{xy}^{cos+}=cos(x,y)^+=\frac{l_{xy}^+}{\sqrt{l^+_{xx} \cdot l^+_{yy}}}&lt;br /&gt;
&lt;br /&gt;
3.重启的随机游走 RWR&amp;lt;ref name=&amp;quot;[14]&amp;quot;&amp;gt;Brin, S, Page, L (1998) [https://pattern.swarma.org/paper?id=15405998-70ca-11ea-b1b5-0242ac1a0005 The anatomy of a large-scale hypertextual web search engine].&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
这个指标可以看成是PageRank 算法的拓展应用。它假设随机游走粒子在每走一步的时候都以一定概率返回初始位置。设粒子返回概率为 1-c，&amp;lt;math&amp;gt;P&amp;lt;/math&amp;gt; 为网络的马尔科夫概率转移矩阵，其元素 &amp;lt;math&amp;gt;P_{xy} = a_{xy}/k_{x} &amp;lt;/math&amp;gt;表示节点x处的粒子下一步走到节点y的概率。其中如果节点x和节点y相连，则&amp;lt;math&amp;gt;a_{xy}=1&amp;lt;/math&amp;gt;，否则&amp;lt;math&amp;gt;a_{xy}=0&amp;lt;/math&amp;gt;。某一粒子初始时刻在节点x处，那么t+1时刻该粒子到达网络各个节点的概率向量为&lt;br /&gt;
&amp;lt;math&amp;gt;q_{x}(t+1) = c \cdot P^{T}q_{x}(t) + (1-c) e_{x}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;e_{x}&amp;lt;/math&amp;gt;表示初始状态（其定义与Cos+中相同），上式的稳态解为&amp;lt;math&amp;gt;q_{x} = (1-c)(I-cP^{T})^{-1}e_{x}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中元素&amp;lt;math&amp;gt;q_{xy}&amp;lt;/math&amp;gt;为从节点x出发的粒子最终有多少概率走到节点y。由此定义RWR相似性如下：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{RWR} = q_{xy} + q_{yx} &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
4.SimRank指标 SimR&amp;lt;ref name=&amp;quot;[14]&amp;quot;&amp;gt;Jeh G, Widom J. SimRank (2002) [https://pattern.swarma.org/paper?id=593e78e0-70cb-11ea-9743-0242ac1a0005 a measure of structural-context similarity].(538-543)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
它的基本假设是，如果两节点所连接的节点相似，那么这两个节点就相似。其自洽定义式为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{simR}=C\frac{\sum_{v_z\in \Gamma (x)}\sum_{{v_z}'\in \Gamma (y)}s_{zz'}^{simR}}{k_xk_y}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中假定 &amp;lt;math&amp;gt;s_{xx} =1, C \in [0,1] &amp;lt;/math&amp;gt;为相似性传递时的衰减参数。&lt;br /&gt;
&lt;br /&gt;
SimR指标同时考虑了结构等价和一般等价。当节点x的邻居z同时也是节点y的邻居时，该指标考虑了结构等价；当节点x不等于节点y时，该指标概率了一般等价。可以证明，SimR指标可以用来描述两个分别从节点x和y出发的粒子平均过多久会相遇。&lt;br /&gt;
&lt;br /&gt;
5.局部随机游走指标 LRW&amp;lt;ref name=&amp;quot;[15]&amp;quot;&amp;gt;Weiping Liu,Linyuan Lu (2010) [https://pattern.swarma.org/paper?id=98d1a08e-70eb-11ea-a520-0242ac1a0005 Link Prediction Based on Local Random Walk].arXiv:1001.2467.89.(58007)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
上述4种随机游走指标是基于全局的随机游走，这类指标往往计算复杂度很高，因此很难在大规模网络上应用。刘伟平和吕琳媛提出了一种基于网络局部随机游走的相似性指标LRW，它只考虑有限步数的随机游走过程。一个粒子 t 时刻从节点x出发，定义&amp;lt;math&amp;gt;π_{xy} (t) &amp;lt;/math&amp;gt;为 t+1 时刻这个粒子正好走到节点y的概率，那么可得到系统演化方程：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\pi_{x} (t + 1) = P^T\pi_{x}(t)，t=0,1,…&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\pi_{x}(0) &amp;lt;/math&amp;gt;为一个&amp;lt;math&amp;gt;Nx1 &amp;lt;/math&amp;gt;的向量，只有第x 个元素为1，其他为0，即&amp;lt;math&amp;gt;\pi_{x}(0) =e_x&amp;lt;/math&amp;gt;。设定各个节点的初始资源分布为&amp;lt;math&amp;gt;q_x&amp;lt;/math&amp;gt;，那么基于t步随机游走的相似性为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{LRW} = q_{xy} + q_{yx}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
6.叠加的局部随机游走指标 SRW&amp;lt;ref name=&amp;quot;[15]&amp;quot;&amp;gt;Weiping Liu,Linyuan Lu (2010) [https://pattern.swarma.org/paper?id=98d1a08e-70eb-11ea-a520-0242ac1a0005 Link Prediction Based on Local Random Walk].arXiv:1001.2467.89.(58007)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
这个指标给邻近目标节点的点更多的机会与目标节点相连，充分考虑了很多真实网络连接上的局域性特点，它是在LRW的基础上，将t步及其以前的结果加总，便得到SRW的值，即：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{SRW}(t)=\sum_{t}^{l=1}s_{xy}^{LRW}(l) = q_x\sum_{t}^{l=1}\pi_{xy}(l) + q_y\sum_{t}^{l=1}\pi_{yx}(l)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===基于似然分析的链路预测===&lt;br /&gt;
&lt;br /&gt;
基于相似性的链路预测方法，是最简单的一种分析框架，除此之外，还有另一种最复杂的链路预测分析框架——基于似然分析的链路预测。这个框架本身远远复杂于基于相似性的框架，而且框架中的每一个组成成分自身都非常复杂，但这个框架下衍生出的算法除了给出链路预测的结果之外，还给出了我们对于网络结构的深刻洞见，例如“'''层次结构模型 Hierachical structure model'''”给出了网路层次组织形态的定量刻画，“'''随机分块模型 Stochastic block model'''”类似于社区分解一样把网络划分成了若干子块。这些对理解网络结构特征方面的贡献，是基于相似性的框架所不能提供的。&lt;br /&gt;
&lt;br /&gt;
基于似然分析的链路预测的基本思路是：根据网络结构的产生和组织方式以及目前已经观察到的链路计算网络的似然值，并认为真实的网络使得网络似然值最大，然后再根据网络似然最大化计算每一对未连接的节点产生连边的可能性。&lt;br /&gt;
&lt;br /&gt;
*层次结构模型 HSM&lt;br /&gt;
&lt;br /&gt;
层次结构模型假设真实的网络都存在某种层次性，网络的连接则可看作是这种内在层次结构的反映。该方法的计算步骤如下：&lt;br /&gt;
&lt;br /&gt;
1.一个N个节点的网络可以用一个包含N个叶子节点的族谱树表示，这N个叶子节点将由N-1个非叶子节点连接起来，其中每个非叶子节点都有一个概率值，则两个叶子节点连接的概率就等于他们最近共同祖先节点的概率值。给定一个族谱树，将网络的似然值最大化，就可以得到非叶子节点的概率值，并由此计算出这一个族谱树所对应的网络最大的似然值。&lt;br /&gt;
&lt;br /&gt;
2.使用马尔科夫链蒙特卡洛方法对网络不同的族谱树进行抽样，使得每个族谱树出现的频次正比于该树对应的最大的网络似然值。两个节点连边的概率就等于所有抽样出来的族谱树中两个节点连边概率的平均值。注意似然高的族谱树会出现多次，因此对这个平均概率的贡献也大。&lt;br /&gt;
&lt;br /&gt;
3.把平均连边概率看做是相似性框架中的相似性指标&amp;lt;math&amp;gt;s_{xy}&amp;lt;/math&amp;gt;，按照这个值从大到小排序，排在前面的就是预测的连边。&lt;br /&gt;
&lt;br /&gt;
需要指出的是，层次结构模型在处理具有明显层次结构的网络（如恐怖袭击网络和草原食物链）时具有较高的精确度，但在处理一般性网络时效果并不一定突出。&lt;br /&gt;
&lt;br /&gt;
*随机分块模型 SBM&lt;br /&gt;
&lt;br /&gt;
与层次结构模型的思想类似，随机分块模型假设网络中的节点可以被分为若干集合，两个节点间连接的概率只与相应的集合有关。换句话说，同一个群众所有节点的地位是相同的。随机分块模型特别适合刻画节点所属群的成员身份对于其连接行为有关键影响的情况，例如，著名的“角色模型”就包含了随机分块模型的理念。&lt;br /&gt;
&lt;br /&gt;
随机分块模型的效果要好于层次结构模型。同时，该方法还可以剔除网络的错误连边，如纠正蛋白质相互作用网络中的错误连边。&lt;br /&gt;
&lt;br /&gt;
*闭路模型 Loop model&lt;br /&gt;
&lt;br /&gt;
似然分析的更一般的框架是：给定一个网络系统，特定网络哈密顿量的负指数被统计分配函数归一化后，就得到这个网络出现的似然，一条未被观察到的连边存在的可能性就等于添加这条连边后网络的似然值。闭路模型考虑网络结构形成中的“局部性原则”，并由此定义了网络的哈密顿量。实验表明，闭路模型的预测精度大于层次结构模型和随机分块模型。&lt;br /&gt;
&lt;br /&gt;
===基于机器学习的链路预测===&lt;br /&gt;
&lt;br /&gt;
用机器学习的思路进行链路预测，主要分为基于特征分类方法、基于概率图模型方法和基于矩阵分解方法三大类。&lt;br /&gt;
&lt;br /&gt;
*基于特征分类方法&lt;br /&gt;
&lt;br /&gt;
网络中的链路预测问题可以看成机器学习中的分类问题，其中每个数据点对应一对节点之间关系的标记，假定两个节点之间存在连边，则数据点的值为+1，否则为-1。特征选取是分类问题中最重要的问题之一，目前研究较多的主要包括基于节点与边的属性特征和基于节点所处网络的拓扑结构特征（如CN、AA、Katz、最短路径）等。哈桑 Hasan 等人提取合著网络中科学家研究领域的关键词作为特征，用监督学习中一些常用的分类算法（如决策树、K近邻法、多层感知器、支持向量机、径向基网络）对缺失的连边进行较为精准的预测，其中以支持向量机方法表现最佳。&lt;br /&gt;
&lt;br /&gt;
*基于概率图模型&lt;br /&gt;
&lt;br /&gt;
基于概率图模型的链路预测方法使用图模型来表达节点之间的连边概率，根据模型中概率依赖关系，可分为有向无环的贝叶斯网络和无向的马尔科夫网络。随机分块模型和层次结构模型分别是典型的基于贝叶斯网络和基于马尔科夫网络的链路预测方法。基于概率图模型的链路预测方法有很多，典型的还有有监督随机游走链路预测算法，将网络结构信息与节点和连边的属性信息结合起来，给每条边分配不同的转移概率。与其他有监督的机器学习方法相比，该算法无须知道网络的特征和相关的领域知识。&lt;br /&gt;
&lt;br /&gt;
*基于矩阵分解&lt;br /&gt;
&lt;br /&gt;
基于矩阵分解的链路预测方法是基于网络邻接矩阵的代数谱变换而得到的方法，来预测网络中链路的存在性和链路的权值。相比其他几种机器学习方法，该方法要学习的参数少很多，但计算复杂度较高。链路预测问题可以视为邻接矩阵填充问题，并可以通过双线性回归模型将节点和链路的显特征和隐特征结合起来用矩阵分解方法解决。边缘去噪模型将根据给定关系矩阵求未知边或丢失边的问题变成一个矩阵降噪去噪问题。&lt;br /&gt;
&lt;br /&gt;
关于不同的链路预测研究方法的分类可以参考下表：&lt;br /&gt;
[[File:Link preditction method.png|600px|thumb|三类不同的链路预测方法（*表示该方法含有参数）|center]]&lt;br /&gt;
&lt;br /&gt;
==应用场景==&lt;br /&gt;
链路预测有着广泛的应用场景：在生物领域，利用蛋白质间相互作用关系的结构信息进行链路预测，可以为实验的测定提前提供参考依据，从而降低实验成本、提高成功率；在社交网络领域，链路预测可以对社交网络中的好友关系、朋友推荐进行预测，从而提高用户对社交网站的体验满意度和使用黏性；在电子商务领域，除了传统的协同过滤推荐算法外，利用网络结构信息（如网络三角形结构）等特征进行商品推荐也取得了显著的优势；此外，通过识别隐藏的链边或异常的链边对信息不完全或含有噪音的网络进行重构，可以提高网络的传输能力，这对于航空网络重构有很大的启发意义。&lt;br /&gt;
[[File:Figure2.png|400px|thumb|链路预测应用场景示意图（图片来自网络）|center]]&lt;br /&gt;
&lt;br /&gt;
除此之外，链路预测的算法和思想通过一些变换还可以用来解决一些看似没有太大关系的问题。例如，对疾病信号和股票指数的预测。基于链路预测的思想和方法，我们还可以设计基于节点相似性的社团划分以及对网络演化模型的定量化评估方法。链路预测还可以帮助提高节点标签预测的精度，特别是在已知标签节点稀疏的情况下效果显著。这一方法可以应用于判断一篇学术论文的类型，判断一本书的政治态度（中立、自由派或保守派），或者判断一个手机用户是否产生了更换电信运营商的念头。&lt;br /&gt;
&lt;br /&gt;
==代表人物==&lt;br /&gt;
*'''吕琳媛'''&lt;br /&gt;
吕琳媛主要研究方向为复杂网络信息挖掘领域，包括海量信息导航、挖掘、推荐和预测。目前担任阿里巴巴复杂科学研究中心副主任，中欧联合实验室执行主任，中国工业与应用数学学会复杂网络与系统控制专业委员会委员，杭州市特聘专家。&lt;br /&gt;
[[File:Lvlinyuan.png|400px|thumb|吕琳媛，阿里巴巴复杂科学研究中心副主任|center]]&lt;br /&gt;
&lt;br /&gt;
近年来主持/参与国家级项目5项（2016年获得国家自然科学基金优秀青年基金），省部级项目4项，横向课题4项。 在相关领域发表学术论文 50余篇，其中SCI论文39篇，总影响因子122，发表期刊包括Physics Reports，PNAS，Nature Communications等国际知名学术期刊。三篇论文入选ESI全球Top-1%高引用论文，论文SCI引用1200余次，谷歌学术引用3000余次，其中9篇论文引用超过100次。2013年出版学术专著《链路预测》获得第四届中国大学出版社图书奖优秀学术著作一等奖。申请发明专利12项。2015年荣获浙江省杰出青年基金，2014年荣获中国计算机学会自然科学二等奖，中国网络科学论坛青年希望奖，首届CCF-腾讯犀牛鸟基金优秀奖。&lt;br /&gt;
&lt;br /&gt;
*'''周涛'''&lt;br /&gt;
周涛主要从事复杂性科学和大数据挖掘算法和应用研究，先后攻克推荐系统准确性-多样性困境、复杂网络链路可预测性、H指数-度-核心度关系等图挖掘领域的重要难题，成果发表在PNAS, Nature Communications, Physics Reports, KDD和ICDM等国际顶尖期刊和会议上。目前论文google总引用超过14000次，其中8篇论文入选ESI高引用论文，H指数为57，2014和2015连续两年入选Elsevier最具国际影响力中国科学家名单。&lt;br /&gt;
[[File:Zhoutao.png|400px|thumb|周涛，第十二届中国青年科技奖|center]]&lt;br /&gt;
&lt;br /&gt;
因其在科学研究上的杰出表现，2011年获得第十二届中国青年科技奖（最年轻获奖者），2011年入选四川省“百人计划”，2012年获得国家首批优秀青年科学基金资助，2013年入选国家“万人计划”首批青年拔尖人才支持计划，2014年获得四川省科技进步一等奖、中国计算机学会自然科学奖，2015年获得共青团中央授予的“最美青年科技工作者”称号，并与屠呦呦等七名个人和北斗导航等三个团队共同当选2015年度中国十大科技创新人物。&lt;br /&gt;
&lt;br /&gt;
*'''马克·纽曼 Mark Newman'''&lt;br /&gt;
Newman是一名英裔美国物理学家，也是密歇根大学 University of Michigan 物理学系的阿纳托尔·拉波特 Anatol Rapoport 杰出教授，也是圣达菲研究所 Santa Fe Institute 的外部教员。他因在复杂网络和复杂系统领域的基础性贡献而闻名，为此他被授予2014年拉格朗日奖。&lt;br /&gt;
[[File:Newman.png|400px|thumb|Mark Newman，密歇根大学物理学系阿纳托尔·拉波特杰出教授|center]]&lt;br /&gt;
&lt;br /&gt;
Newman以其对复杂网络的研究而著称，尤其是在科学家的协作模式，随机图论 Random graph theory，社区结构 Community structure，渗流理论 Percolation theory 和网络流行病学 Network epidemiology方面的工作。他作为共同发明人，与迈克尔·卡斯特 Michael Gastner 一起，发明了一种可以产生密度均衡地图 Density-equalizing maps 或统计地图 Cartograms的方法，该方法构成了Worldmapper网站的基础。他们的工作在2004年美国总统大选后受到关注，成为了当时被广泛传播的一种选举结果地图的基础，（他们）根据各州的人口数调整了州的规模，以便更准确地了解每个党派的选民投票人数。&lt;br /&gt;
&lt;br /&gt;
*'''克里斯托弗·大卫·摩尔 Cristopher David Moore'''&lt;br /&gt;
克里斯托弗·大卫·摩尔 Cristopher David Moore，也称为克里斯·摩尔 Cris Moore 是美国计算机科学家，数学家和物理学家。他是圣达菲研究所的驻校教师，曾任新墨西哥大学 University of New Mexico 的正教授。&lt;br /&gt;
[[File:Cristopher_David_Moore.png|400px|thumb|Cristopher David Moore，圣达菲研究所的驻校教师|center]]&lt;br /&gt;
&lt;br /&gt;
1993年，Moore 发现了一种新颖的解决三体问题的方法，表明在牛顿力学中，三个等质量的物体有可能沿着一条八字形曲线、在同一条轨道相互跟随。Moore 在网络科学领域也很活跃，在该领域有许多著名的出版物。在与Clauset和Mark Newman的合作中，Moore开发了复杂网络的层次聚类概率模型，并表明他们的模型可以在面对网络连接结构发生变化时可靠地预测聚类结果。&lt;br /&gt;
&lt;br /&gt;
*'''亚伦·克劳斯特 Aaron Clauset '''&lt;br /&gt;
Aaron Clauset是一位美国计算机科学家，致力于网络科学，机器学习和复杂系统领域。目前，他在科罗拉多大学博尔德分校 University of Colorado Boulder 教授计算机科学，也是圣菲研究所的外部教员。&lt;br /&gt;
[[File:Aaron_Clauset.png|400px|thumb|  Aaron Clauset，圣菲研究所的外部教员|center]]&lt;br /&gt;
&lt;br /&gt;
Clauset因与Cosma Shalizi和Mark Newman进行的合作研究而闻名，他们针对经验数据中是否存在幂律模式开发了严格的统计检验，并且证明了许多宣称符合幂律分布的网络实际上并不是幂律分布。他还因开发检测复杂网络中的社区结构算法的工作而著称，特别是和Newman、Moore合作发展的网络层次聚类模型。在其他方面，Clauslet 与麦克斯韦·扬 Maxwell Young 、克里斯蒂安·斯克雷德·格莱蒂奇 Kristian Skrede Gleditsch 共同完成了一些独特发现：世界范围内恐怖事件发生的频率和严重性服从幂律分布。&lt;br /&gt;
&lt;br /&gt;
2015年，Clauset 因开发和评估一种网络结构特征的新方法而获得了美国国家科学基金会颁发的著名的CAREER奖。2016年，Clauset因在网络结构方面（包括Internet映射，推断缺失链接和社区结构），以及对人类冲突和社会分层所做的启发性分析方面做出的贡献而获得网络科学学会颁发的网络科学领域的Erdös-Rényi奖。&lt;br /&gt;
&lt;br /&gt;
==参考资料==&lt;br /&gt;
*汪小帆,李翔,陈关荣.《网络科学导论》.北京：高等教育出版社,2012年：178-186&lt;br /&gt;
*吕琳媛,周涛.《链路预测》.北京：高等教育出版社,2013年：57-93&lt;br /&gt;
*吕琳媛,任晓龙,周涛.《网络链路预测：概念与前沿》[J].《中国计算机学会通讯》,2016年,第4期&lt;br /&gt;
*Clauset A, Moore C, Newman M E J. Hierarchical structure and the prediction of missing links in networks [J]. Nature, 2008,453(7191): 98-101.&lt;br /&gt;
*Link Prediction Group 网站：http://www.linkprediction.org/&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
*链接预测可用于分析网络将如何发展，或者在给定信息不完整情况下来发现“丢失”的链接，对于这个问题，有研究者提出了一种新的，结合广义群贴近度中心性和半值相互作用指数的拟局部方法（即考虑半径k内节点的方法），详见 [https://swarma.org/?p=18249 《链路预测的博弈算法》]&lt;br /&gt;
[[File:链路预测的博弈算法.jpg|400px|thumb|[https://swarma.org/?p=18249 《链路预测的博弈算法》]|center]]&lt;br /&gt;
*深度学习已经成功地在图像识别、语音识别、自然语言处理、游戏与博弈等领域取得了突飞猛进的发展，并渗透到了我们的日常生活中。那么，我们有没有可能将这种技术借剪到复杂网 络的研究之中呢？近年来，人们凭借着网络嵌入（Network Embedding）、图卷积神经网络（Graph Convolutional Neural Network）、图注意力模型（Graph Attention Network）等新技术，已经开发了若干图结构上的深度学习算法，并取得了一定的成功应用。北师大系统科学学院教授、博导张江老师亲授[https://campus.swarma.org/play/coursedetail?id=10504 《当复杂网络遇上机器学习》]，将对这些算法以及应用，包括各式各样的网络嵌入算法、节点分类问题、链路预测问题、图分类问题、网络动力学预测问题等做一简单介绍，并对网络上的深度学习问题进行了展望。&lt;br /&gt;
[[File:当复杂网络遇上机器学习.png|400px|thumb|[https://campus.swarma.org/play/coursedetail?id=10504 《当复杂网络遇上机器学习》]|center]]&lt;br /&gt;
*网络上的注意力模型（Graph Attention Model）是一种通用的网络嵌入算法，它能够在节点分类、链路预测等问题上得到极高的精度。它可以模仿一个机器头对网络中的节点进行信息读取和分析，然后将综合的结果放到节点的向量中的过程。[https://campus.swarma.org/play/coursedetail?id=10385 《网络上的注意力模型》]课程将详细介绍这一模型及其应用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''''本中文词条由[[用户:木子二月鸟|木子二月鸟]]用户参与编译，  [[用户: 苏格兰| 苏格兰]]用户审校，欢迎在讨论页面留言'''''。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''本词条内容源自wikipedia及公开资料，遵守 CC3.0协议。'''&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E9%93%BE%E8%B7%AF%E9%A2%84%E6%B5%8B&amp;diff=7633</id>
		<title>链路预测</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E9%93%BE%E8%B7%AF%E9%A2%84%E6%B5%8B&amp;diff=7633"/>
		<updated>2020-05-10T14:23:55Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{#seo:|keywords=链路预测 Link Prediction  |description=通过已知的网络节点以及网络结构等信息，预测网络中尚未产生连边的两个节点之间产生连接的可能性。 }}&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
'''链路预测 Link Prediction'''是指如何通过已知的网络节点以及网络结构等信息，预测网络中尚未产生连边的两个节点之间产生连接的可能性。这种预测既包含了对未知链接 Existing yet unknown link，也称丢失链接 Missing link 的预测，也包含了对未来链接 Future link 的预测。&lt;br /&gt;
&lt;br /&gt;
链路预测是将复杂网络与信息科学联系起来的重要桥梁之一，它所要处理的是信息科学中最基本的问题——缺失信息的还原与预测。链路预测相关研究不仅能够推动网络科学和信息科学理论上的发展，而且具有巨大的实际应用价值，譬如可以知道蛋白质相互作用实验、进行在线社交推荐、找出交通传输网络中有特别重要作用的连边等。&lt;br /&gt;
&lt;br /&gt;
==研究方法==&lt;br /&gt;
===基于相似性的链路预测===&lt;br /&gt;
&lt;br /&gt;
*基于局部信息的相似性指标&lt;br /&gt;
&lt;br /&gt;
社会网络分析中经典的三元闭包 Triadic closure 原则指出，如果A、B	两个人拥有一个共同的朋友C，那么这两个人今后也很有可能成为朋友，从而使得3个节点构成一个闭合的三角形ABC。对于一般的网络，我们可以把这一原则推广如下：两个节点的共同邻居越多，这两个节点就越相似，从而更倾向于相互连接。最简单的基于'''共同邻居 Common neighbors''' 的节点相似性指标定义如下：&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
s_{xy}^{CN} =  |Γ(x)| \cap |Γ(y)|&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
在相似性指标定义的基础上，还可以考虑两个节点的共同邻居的相对数量。下表列出了10种基于节点局部信息的相似性指标，第1种是计算共同邻居相似度的基本公式，其中第2至7种相似性指标是直接基于共同邻居指标的不同的规范化而得到的，表中的 k(x) = |Γ(x)| 为节点x的度。第8种指标PA是基于BA无标度网络模型中新加入节点倾向于和度大的节点相连的优先连接机制而提出的。&lt;br /&gt;
&lt;br /&gt;
第9种指标AA的基本思想是度小的共同邻居节点的贡献大于度大的共同邻居节点，因此根据共同邻居节点的度为每个节点赋予一个权重值。这一点很容易理解，例如在微博中受关注较多的人往往是某个领域的专家或名人，因此共同关注他们的人之间可能并不拥有特别相似的兴趣——一个中学生和一个企业家都有可能是姚晨的粉丝。相反，如果两个人共同关注了一个粉丝很少的人（非名人），那么说明这两个人确实具有相同的兴趣爱好或者重叠的社交圈，因此有更高概率相连。又如在推荐系统中，共同购买冷门产品的两个用户往往比共同购买热门产品的用户更相似。&lt;br /&gt;
[[File:Table1.png|600px|thumb|10种基于节点局部信息的相似性指标|center]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
第2个指标Salton指标&amp;lt;ref name=&amp;quot;[2]&amp;quot;&amp;gt;Salton G, McGill M J () [https://pattern.swarma.org/paper?id=15e10152-92c8-11ea-81db-0242ac1a0005 Introduction to Modern Information Retrieval].&amp;lt;/ref&amp;gt;又称余弦相似性，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{|Γ(x)| \cap |Γ(y)|}{\sqrt{k(x)k(y)}}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第3个指标Jaccard指标&amp;lt;ref name=&amp;quot;[3]&amp;quot;&amp;gt;Jaccard P. () [https://pattern.swarma.org/paper?id=70c8a48a-92c8-11ea-9f7f-0242ac1a0005 Etude de la distribution florale dans une portion des Alpes et du Jura].&amp;lt;/ref&amp;gt;是于100多年前由Jaccard提出的，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{|Γ(x)| \cap |Γ(y)|}{|Γ(x)| \bigcup  |Γ(y)|}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第4个指标Sorensen指标&amp;lt;ref name=&amp;quot;[4]&amp;quot;&amp;gt;Sørensen, T, Sørensen, T A, Sørensen, T J (1948) [https://pattern.swarma.org/paper?id=ea7f2902-6e74-11ea-9db3-0242ac1a0005 A method of establishing groups of equal amplitude in plant sociology based on similarity of species content and its application to analyses of the vegetation on Danish commons].&amp;lt;/ref&amp;gt;常用于生态学研究，其定义为 &amp;lt;math&amp;gt;s{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{kx + ky}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第5个指标大度节点有利指标&amp;lt;ref name=&amp;quot;[5]&amp;quot;&amp;gt;E. Ravasz,A. L. Somera,D. A. Mongru,Z. N. Oltvai,A. -L. Barabasi (2002) [https://pattern.swarma.org/paper?id=6eb98b7e-6e91-11ea-81b9-0242ac1a0005 Hierarchical organization of modularity in metabolic networks].arXiv:0209244.&amp;lt;/ref&amp;gt;（Hub promoted index，HPI）被用来定量刻画新陈代谢网络中每对反应物的拓扑相似程度，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{min\{k_x,k_y\}}&amp;lt;/math&amp;gt;，由于分母只由度较小的节点决定，在此定义下可知大度节点（hub）与其他节点之间更容易具有高的相似性。&lt;br /&gt;
&lt;br /&gt;
第6个指标大度节点不利指标&amp;lt;ref name=&amp;quot;[6]&amp;quot;&amp;gt;Tao Zhou,Linyuan Lu,Yi-Cheng Zhang (2009) [https://pattern.swarma.org/paper?id=7a2b26ba-6e92-11ea-9ee2-0242ac1a0005 Predicting Missing Links via Local Information].arXiv:0901.0553.&amp;lt;/ref&amp;gt;（hub depressed index, HDI）定义与HPI相似，只是分母取两端节点度的最大值，即 &amp;lt;math&amp;gt;s_{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{max\{k_x,k_y\}}&amp;lt;/math&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
第7个指标LHN-I指标&amp;lt;ref name=&amp;quot;[7]&amp;quot;&amp;gt;E. A. Leicht,Petter Holme,M. E. J. Newman (2005) [https://pattern.swarma.org/paper?id=71890c4e-6f0e-11ea-b30e-0242ac1a0005 Vertex similarity in networks].arXiv:0510143.&amp;lt;/ref&amp;gt;是由Leicht，Holme和Newman提出，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{{k_xk_y}}&amp;lt;/math&amp;gt;，其中分母&amp;lt;math&amp;gt;k_xk_y&amp;lt;/math&amp;gt; 正比于节点&amp;lt;math&amp;gt;v_x&amp;lt;/math&amp;gt;和节点&amp;lt;math&amp;gt;v_y&amp;lt;/math&amp;gt;共同邻居数的期望值，即 &amp;lt;math&amp;gt;E( |Γ(x)| \cap |Γ(y)|)&amp;lt;/math&amp;gt;。在下面这篇文献中，Leicht等人同时提出了另一个基于路径的指标，为了有所区别，将此局部指标命名为LHN-I指标，将基于路径的指标命名为LHN-II指标：&lt;br /&gt;
&lt;br /&gt;
第8个指标PA（preferential attachment）是基于BA无标度网络模型中新加入节点倾向于和度大的节点相连的优先连接机制而提出的，在这种机制的链路预测中，每一步首先去除一条链接，然后再添加一条链接，新链接连接节点&amp;lt;math&amp;gt;v_x&amp;lt;/math&amp;gt;和&amp;lt;math&amp;gt;v_y&amp;lt;/math&amp;gt;的概率就正比于两节点度的乘积，由此可以定义两节点间的优先连接相似性：&amp;lt;math&amp;gt;s_{xy}= k_xk_y&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第9个指标AA（Adamic-Adar）&amp;lt;ref name=&amp;quot;[8]&amp;quot;&amp;gt;Adar, Adamic L A, E (2003) [https://pattern.swarma.org/paper?id=e4726a06-6f2d-11ea-8846-0242ac1a0005 Friends and neighbors on the web].Social networks.25.(211--230)&amp;lt;/ref&amp;gt;的基本思想是度小的共同邻居节点的贡献大于度大的共同邻居节点，因此根据共同邻居节点的度为每个节点赋予一个权重值。这一点很容易理解，例如在微博中受关注较多的人往往是某个领域的专家或名人，因此共同关注他们的人之间可能并不拥有特别相似的兴趣——一个中学生和一个企业家都有可能是姚晨的粉丝。相反，如果两个人共同关注了一个粉丝很少的人（非名人），那么说明这两个人确实具有相同的兴趣爱好或者重叠的社交圈，因此有更高概率相连。又如在推荐系统中，共同购买冷门产品的两个用户往往比共同购买热门产品的用户更相似。AA指标根据共同邻居节点的度为每个节点赋予一个权重值，该权重等于该节点的度的对数分之一，即AA指标的定义为：&amp;lt;math&amp;gt;s_{xy}=\sum _{z\in \Gamma (x)\bigcap \Gamma (y)}\frac{1}{logk_z}&amp;lt;/math&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
第10种指标RA是受网络资源分配过程的启发，周涛等人提出的“'''资源分配指标 Resource allocation'''”，其与AA指标有异曲同工之妙。RA和AA指标最大的区别就在于赋予共同邻居节点权重的方式不同，前者是以 1/k 的形式递减，后者是以 1/logk 的形式递减。可见，当网络的平均度较小时，RA和AA差别不大；但是当平均度较大时，就有很大的区别了。研究显示，RA指标在刻画加权网络和社区挖掘应用中的表现胜过AA指标，图灵奖得主Hopdroft的一篇论文也显示，可以利用社区等中观结构信息改进局部指标，其中RA指标改进后的效果最佳。&lt;br /&gt;
&lt;br /&gt;
*基于路径的相似性指标&lt;br /&gt;
&lt;br /&gt;
基于共同邻居的相似性指标的优势在于计算复杂度较低，但是由于使用的信息非常有限，预测精度受到限制，因此发展出了基于路径的相似性指标，主要有3个，分别是局部路径指标 Local path 、Katz指标和LHN-II指标。&lt;br /&gt;
&lt;br /&gt;
1.局部路径指标&lt;br /&gt;
&lt;br /&gt;
周涛等人在共同邻居的基础上考虑三阶路径的因素，提出了基于局部路径的相似性指标，其定义为 &amp;lt;math&amp;gt; S=A^2+\alpha A^3&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 为可调参数，A 表示网络的邻接矩阵， &amp;lt;math&amp;gt;(A^3)_{xy}&amp;lt;/math&amp;gt;表示节点 &amp;lt;math&amp;gt;V_x&amp;lt;/math&amp;gt; 和 &amp;lt;math&amp;gt;V_y&amp;lt;/math&amp;gt; 之间长度为3的路径数目。当&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; = 0时，LP指标就退化为 CN 指标。 CN 指标本质上也可看成基于路径的指标，只是它仅考虑了二阶路径数目。局部路径指标可以扩展为更高阶的情形，即考虑n阶路径的情况：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt; S^n=A^2+\alpha\cdot A^3+\alpha^2\cdot A^4+\cdots +\alpha^{n-2}\cdot A^n &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
随着 n 的增加，局部路径指标的计算复杂度越来越大。一般而言，考虑 n 阶路径的计算复杂度为O(N&amp;lt;k&amp;gt;^n)。但是当 n 趋于无穷大的时候，局部路径指标相当于考虑网络全部路径的Katz指标，此时计算量反而有可能下降，因为可转变为计算矩阵的逆。&lt;br /&gt;
&lt;br /&gt;
2.Katz指标&lt;br /&gt;
&lt;br /&gt;
Katz指标考虑了所有网络的路径，因此其定义为：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S_{xy}=\sum_{l=1}^{\infty }\alpha^l\cdot\left |  paths_{x,y}^{&amp;lt;l&amp;gt;} \right |= \alpha A_{xy}+\alpha^2\cdot (A^2)_{xy}+\alpha^3\cdot (A^3)_{xy}+\cdots  &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\alpha &amp;gt; 0&amp;lt;/math&amp;gt; 为控制路径权重的可调参数，&amp;lt;math&amp;gt;\left |  paths_{x,y}^{&amp;lt;l&amp;gt;} \right |&amp;lt;/math&amp;gt;表示连接节点 &amp;lt;math&amp;gt;V_x&amp;lt;/math&amp;gt;和  &amp;lt;math&amp;gt;V_y&amp;lt;/math&amp;gt; 的路径中长度为 l 的路径数。要使上述级数收敛，则参数&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 应小于邻接矩阵最大特征值的倒数，此定义还可以表示为：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S = (I - \alpha\cdot A)^{-1} - I&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
显然，当参数&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 很小时，高阶路径的贡献也较小，使得 Katz 指标的预测结果接近于局部路径指标。&lt;br /&gt;
&lt;br /&gt;
3.LHN-II指标&lt;br /&gt;
&lt;br /&gt;
LHN-II 指标是 Leicht，Holme 和 Newman 提出的另一种相似性计算方法，他的基本思想是基于'''一般等价 Regular equivalence''' 提出的。与结构等价不同，一般等价的定义更广泛。在一般等价的定义下，如果两个节点所连接的节点之间相似，那么这两个节点也相似，即使它们之间没有共同的邻居节点。&lt;br /&gt;
&lt;br /&gt;
下图给出了一个简单的例子来帮助我们理解结构等价和一般等价的区别。根据结构等价的定义，在公司A内部，由于员工a和员工b都认识员工e和员工f（即它们有两个共同邻居节点），于是称员工a和员工b是结构等价的。同理，员工e和员工f也是结构等价的，同样地，在公司B中，员工c和员工d是结构等价的，员工g和员工h也是结构等价的。现在考虑员工a和员工c是否相似？根据一般等价的定义，由于员工a连接的节点e、f与员工c连接的节点g、h分别是相似的，那么我们可以认为员工a和员工c也是相似的，同理，在一般等价的意义下，员工b和员工d也是相似。从这个例子可以看出，结构相似性或称结构等价更强调的是两个节点是否在同一个环境下，也就是说是否连接了相同的节点；然而一般等价考虑的是这两个节点是否处于同样的角色，即使他们没有相同的邻居节点，但是由于各自的邻居节点之间本身相似，这两个节点也相似。一般等价意义下的相似性是LHN-II指标的核心。&lt;br /&gt;
&lt;br /&gt;
[[File:一般等价和结构等价示例.png|600px|thumb|一般等价和结构等价示例（图中实线表示连接，虚线表示相似关系）|center]]&lt;br /&gt;
&lt;br /&gt;
从一般等价的角度考虑，LHN-II指标认为如果两个节点的邻居节点之间是相似的，那么这两个节点也是相似的。它与Katz指标的区别主要是把Katz指标中的&amp;lt;math&amp;gt; (A^{n})_{xy} &amp;lt;/math&amp;gt;变成 &amp;lt;math&amp;gt;  (A^{n})_{xy}&amp;lt;/math&amp;gt; 的期望值，注意到 &amp;lt;math&amp;gt; (A^{n})_{xy}&amp;lt;/math&amp;gt; 的期望值为 &amp;lt;math&amp;gt; E\left [ (A^l)_{xy} \right ]=\frac{k_xk_y}{M}\lambda _1^{l-1}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\lambda_1&amp;lt;/math&amp;gt;为矩阵A的最大特征值，则LHN-II指标的表达式如下：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 S_{xy}^{LHN2}=\delta _{xy} + \sum_{l=1}^{\infty }\Phi ^l \frac{(A^l)_{xy}}{E\left [ (A^l)_{xy} \right ]}&lt;br /&gt;
=\delta _{xy} + \frac{2M}{k_xk_y}\sum_{l=1}^{\infty }\Phi ^l\lambda _1^{1-l}(A^l)_{xy}&lt;br /&gt;
=\left [ 1 - \frac{2 M \lambda_1}{k_xk_y} \right ]\delta _{xy} + \frac{2 M \lambda_1}{k_xk_y}\left [ (I-\frac{\Phi}{\lambda_1} A )^{-1} \right ]_{xy}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\delta _{xy}&amp;lt;/math&amp;gt;为 Kronecker &amp;lt;math&amp;gt;\delta&amp;lt;/math&amp;gt; 函数，&amp;lt;math&amp;gt; \Phi&amp;lt;/math&amp;gt; 为取值小于1的参数。上式最后一个等式的第一项是可以去掉的对角阵，从而相似性矩阵可以写为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S=2M\lambda_1D^{-1}(I-\frac{\Phi A}{\lambda_1})^{-1}D^{-1}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中''D''为度值矩阵，&amp;lt;math&amp;gt;D_{xy} = \delta_{xy} \cdot k_{x}&amp;lt;/math&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
*基于随机游走的节点相似性指标&lt;br /&gt;
&lt;br /&gt;
还有相当数量的相似性指标是基于随机游走过程定义的，包括'''平均通勤时间 Average commute time''' 、'''Cos+指标'''、'''有重启的随机游走 Random walk with restart'''、'''SimRank'''指标、'''局部随机游走指标 Local random walk''' 和'''有叠加效应的随机游走指标 Superposed random walk'''等。&lt;br /&gt;
&lt;br /&gt;
1.平均通勤时间 ACT &lt;br /&gt;
&lt;br /&gt;
设&amp;lt;math&amp;gt;m(x,y)&amp;lt;/math&amp;gt; 为一个随机粒子从节点x到节点y平均需要走的步数，那么节点x和y的平均通勤时间定义为：&amp;lt;math&amp;gt;n(x , y) = m(x , y) + m(y , x) &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其数值解可通过求该网络拉普拉斯矩阵&amp;lt;math&amp;gt;L&amp;lt;/math&amp;gt; 的伪逆&amp;lt;math&amp;gt; L^+&amp;lt;/math&amp;gt; 获得，即 &amp;lt;math&amp;gt;n(x,y)=M(l^+_{xx} +l^+_{yy} - 2l^+_{xy})&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;l^{+}_{xy}&amp;lt;/math&amp;gt;表示矩阵&amp;lt;math&amp;gt;L^+ &amp;lt;/math&amp;gt;中相应位置的元素。如果两个节点的平均通勤时间越小，那么两个节点越进阶。由此，定义基于ACT的相似性为（在此可忽略常数M）&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{ACT}=\frac{1}{l^+_{xx} +l^+_{yy} - 2l^+_{xy}}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
2.余弦相似性指标 Cos+指标&lt;br /&gt;
&lt;br /&gt;
在由向量&amp;lt;math&amp;gt;v_x = \Lambda ^{1/2}U^{T}e_{x}&amp;lt;/math&amp;gt;展开的欧式空间内，&amp;lt;math&amp;gt;L^+ &amp;lt;/math&amp;gt;中的元素&amp;lt;math&amp;gt;l^{+}_{xy}&amp;lt;/math&amp;gt;可表示为两向量&amp;lt;math&amp;gt;v_x&amp;lt;/math&amp;gt;和&amp;lt;math&amp;gt;v_y&amp;lt;/math&amp;gt;的内积，即&amp;lt;math&amp;gt; l^{+}_{xy} = v_{x}^{T} v_y&amp;lt;/math&amp;gt;，其中&amp;lt;math&amp;gt;U&amp;lt;/math&amp;gt;是一个标准正交矩阵，由&amp;lt;math&amp;gt;L^+&amp;lt;/math&amp;gt;特征向量按照对应的特征根从大到小排列，&amp;lt;math&amp;gt;\Lambda&amp;lt;/math&amp;gt;为以特征根为对角元素的对角矩阵，&amp;lt;math&amp;gt;e_{x}&amp;lt;/math&amp;gt; 表示一个一维向量且只有第x个元素为1，其他都为0。由此定义余弦相似性如下：&lt;br /&gt;
&lt;br /&gt;
s_{xy}^{cos+}=cos(x,y)^+=\frac{l_{xy}^+}{\sqrt{l^+_{xx} \cdot l^+_{yy}}}&lt;br /&gt;
&lt;br /&gt;
3.重启的随机游走 RWR&lt;br /&gt;
&lt;br /&gt;
这个指标可以看成是PageRank 算法的拓展应用。它假设随机游走粒子在每走一步的时候都以一定概率返回初始位置。设粒子返回概率为 1-c，&amp;lt;math&amp;gt;P&amp;lt;/math&amp;gt; 为网络的马尔科夫概率转移矩阵，其元素 &amp;lt;math&amp;gt;P_{xy} = a_{xy}/k_{x} &amp;lt;/math&amp;gt;表示节点x处的粒子下一步走到节点y的概率。其中如果节点x和节点y相连，则&amp;lt;math&amp;gt;a_{xy}=1&amp;lt;/math&amp;gt;，否则&amp;lt;math&amp;gt;a_{xy}=0&amp;lt;/math&amp;gt;。某一粒子初始时刻在节点x处，那么t+1时刻该粒子到达网络各个节点的概率向量为&lt;br /&gt;
&amp;lt;math&amp;gt;q_{x}(t+1) = c \cdot P^{T}q_{x}(t) + (1-c) e_{x}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;e_{x}&amp;lt;/math&amp;gt;表示初始状态（其定义与Cos+中相同），上式的稳态解为&amp;lt;math&amp;gt;q_{x} = (1-c)(I-cP^{T})^{-1}e_{x}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中元素&amp;lt;math&amp;gt;q_{xy}&amp;lt;/math&amp;gt;为从节点x出发的粒子最终有多少概率走到节点y。由此定义RWR相似性如下：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{RWR} = q_{xy} + q_{yx} &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
4.SimRank指标 SimR&lt;br /&gt;
&lt;br /&gt;
它的基本假设是，如果两节点所连接的节点相似，那么这两个节点就相似。其自洽定义式为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{simR}=C\frac{\sum_{v_z\in \Gamma (x)}\sum_{{v_z}'\in \Gamma (y)}s_{zz'}^{simR}}{k_xk_y}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中假定 &amp;lt;math&amp;gt;s_{xx} =1, C \in [0,1] &amp;lt;/math&amp;gt;为相似性传递时的衰减参数。&lt;br /&gt;
&lt;br /&gt;
SimR指标同时考虑了结构等价和一般等价。当节点x的邻居z同时也是节点y的邻居时，该指标考虑了结构等价；当节点x不等于节点y时，该指标概率了一般等价。可以证明，SimR指标可以用来描述两个分别从节点x和y出发的粒子平均过多久会相遇。&lt;br /&gt;
&lt;br /&gt;
5.局部随机游走指标 LRW&lt;br /&gt;
&lt;br /&gt;
上述4种随机游走指标是基于全局的随机游走，这类指标往往计算复杂度很高，因此很难在大规模网络上应用。刘伟平和吕琳媛提出了一种基于网络局部随机游走的相似性指标LRW，它只考虑有限步数的随机游走过程。一个粒子 t 时刻从节点x出发，定义&amp;lt;math&amp;gt;π_{xy} (t) &amp;lt;/math&amp;gt;为 t+1 时刻这个粒子正好走到节点y的概率，那么可得到系统演化方程：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\pi_{x} (t + 1) = P^T\pi_{x}(t)，t=0,1,…&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\pi_{x}(0) &amp;lt;/math&amp;gt;为一个&amp;lt;math&amp;gt;Nx1 &amp;lt;/math&amp;gt;的向量，只有第x 个元素为1，其他为0，即&amp;lt;math&amp;gt;\pi_{x}(0) =e_x&amp;lt;/math&amp;gt;。设定各个节点的初始资源分布为&amp;lt;math&amp;gt;q_x&amp;lt;/math&amp;gt;，那么基于t步随机游走的相似性为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{LRW} = q_{xy} + q_{yx}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
6.叠加的局部随机游走指标 SRW&lt;br /&gt;
&lt;br /&gt;
这个指标给邻近目标节点的点更多的机会与目标节点相连，充分考虑了很多真实网络连接上的局域性特点，它是在LRW的基础上，将t步及其以前的结果加总，便得到SRW的值，即：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{SRW}(t)=\sum_{t}^{l=1}s_{xy}^{LRW}(l) = q_x\sum_{t}^{l=1}\pi_{xy}(l) + q_y\sum_{t}^{l=1}\pi_{yx}(l)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===基于似然分析的链路预测===&lt;br /&gt;
&lt;br /&gt;
基于相似性的链路预测方法，是最简单的一种分析框架，除此之外，还有另一种最复杂的链路预测分析框架——基于似然分析的链路预测。这个框架本身远远复杂于基于相似性的框架，而且框架中的每一个组成成分自身都非常复杂，但这个框架下衍生出的算法除了给出链路预测的结果之外，还给出了我们对于网络结构的深刻洞见，例如“'''层次结构模型 Hierachical structure model'''”给出了网路层次组织形态的定量刻画，“'''随机分块模型 Stochastic block model'''”类似于社区分解一样把网络划分成了若干子块。这些对理解网络结构特征方面的贡献，是基于相似性的框架所不能提供的。&lt;br /&gt;
&lt;br /&gt;
基于似然分析的链路预测的基本思路是：根据网络结构的产生和组织方式以及目前已经观察到的链路计算网络的似然值，并认为真实的网络使得网络似然值最大，然后再根据网络似然最大化计算每一对未连接的节点产生连边的可能性。&lt;br /&gt;
&lt;br /&gt;
*层次结构模型 HSM&lt;br /&gt;
&lt;br /&gt;
层次结构模型假设真实的网络都存在某种层次性，网络的连接则可看作是这种内在层次结构的反映。该方法的计算步骤如下：&lt;br /&gt;
&lt;br /&gt;
1.一个N个节点的网络可以用一个包含N个叶子节点的族谱树表示，这N个叶子节点将由N-1个非叶子节点连接起来，其中每个非叶子节点都有一个概率值，则两个叶子节点连接的概率就等于他们最近共同祖先节点的概率值。给定一个族谱树，将网络的似然值最大化，就可以得到非叶子节点的概率值，并由此计算出这一个族谱树所对应的网络最大的似然值。&lt;br /&gt;
&lt;br /&gt;
2.使用马尔科夫链蒙特卡洛方法对网络不同的族谱树进行抽样，使得每个族谱树出现的频次正比于该树对应的最大的网络似然值。两个节点连边的概率就等于所有抽样出来的族谱树中两个节点连边概率的平均值。注意似然高的族谱树会出现多次，因此对这个平均概率的贡献也大。&lt;br /&gt;
&lt;br /&gt;
3.把平均连边概率看做是相似性框架中的相似性指标&amp;lt;math&amp;gt;s_{xy}&amp;lt;/math&amp;gt;，按照这个值从大到小排序，排在前面的就是预测的连边。&lt;br /&gt;
&lt;br /&gt;
需要指出的是，层次结构模型在处理具有明显层次结构的网络（如恐怖袭击网络和草原食物链）时具有较高的精确度，但在处理一般性网络时效果并不一定突出。&lt;br /&gt;
&lt;br /&gt;
*随机分块模型 SBM&lt;br /&gt;
&lt;br /&gt;
与层次结构模型的思想类似，随机分块模型假设网络中的节点可以被分为若干集合，两个节点间连接的概率只与相应的集合有关。换句话说，同一个群众所有节点的地位是相同的。随机分块模型特别适合刻画节点所属群的成员身份对于其连接行为有关键影响的情况，例如，著名的“角色模型”就包含了随机分块模型的理念。&lt;br /&gt;
&lt;br /&gt;
随机分块模型的效果要好于层次结构模型。同时，该方法还可以剔除网络的错误连边，如纠正蛋白质相互作用网络中的错误连边。&lt;br /&gt;
&lt;br /&gt;
*闭路模型 Loop model&lt;br /&gt;
&lt;br /&gt;
似然分析的更一般的框架是：给定一个网络系统，特定网络哈密顿量的负指数被统计分配函数归一化后，就得到这个网络出现的似然，一条未被观察到的连边存在的可能性就等于添加这条连边后网络的似然值。闭路模型考虑网络结构形成中的“局部性原则”，并由此定义了网络的哈密顿量。实验表明，闭路模型的预测精度大于层次结构模型和随机分块模型。&lt;br /&gt;
&lt;br /&gt;
===基于机器学习的链路预测===&lt;br /&gt;
&lt;br /&gt;
用机器学习的思路进行链路预测，主要分为基于特征分类方法、基于概率图模型方法和基于矩阵分解方法三大类。&lt;br /&gt;
&lt;br /&gt;
*基于特征分类方法&lt;br /&gt;
&lt;br /&gt;
网络中的链路预测问题可以看成机器学习中的分类问题，其中每个数据点对应一对节点之间关系的标记，假定两个节点之间存在连边，则数据点的值为+1，否则为-1。特征选取是分类问题中最重要的问题之一，目前研究较多的主要包括基于节点与边的属性特征和基于节点所处网络的拓扑结构特征（如CN、AA、Katz、最短路径）等。哈桑 Hasan 等人提取合著网络中科学家研究领域的关键词作为特征，用监督学习中一些常用的分类算法（如决策树、K近邻法、多层感知器、支持向量机、径向基网络）对缺失的连边进行较为精准的预测，其中以支持向量机方法表现最佳。&lt;br /&gt;
&lt;br /&gt;
*基于概率图模型&lt;br /&gt;
&lt;br /&gt;
基于概率图模型的链路预测方法使用图模型来表达节点之间的连边概率，根据模型中概率依赖关系，可分为有向无环的贝叶斯网络和无向的马尔科夫网络。随机分块模型和层次结构模型分别是典型的基于贝叶斯网络和基于马尔科夫网络的链路预测方法。基于概率图模型的链路预测方法有很多，典型的还有有监督随机游走链路预测算法，将网络结构信息与节点和连边的属性信息结合起来，给每条边分配不同的转移概率。与其他有监督的机器学习方法相比，该算法无须知道网络的特征和相关的领域知识。&lt;br /&gt;
&lt;br /&gt;
*基于矩阵分解&lt;br /&gt;
&lt;br /&gt;
基于矩阵分解的链路预测方法是基于网络邻接矩阵的代数谱变换而得到的方法，来预测网络中链路的存在性和链路的权值。相比其他几种机器学习方法，该方法要学习的参数少很多，但计算复杂度较高。链路预测问题可以视为邻接矩阵填充问题，并可以通过双线性回归模型将节点和链路的显特征和隐特征结合起来用矩阵分解方法解决。边缘去噪模型将根据给定关系矩阵求未知边或丢失边的问题变成一个矩阵降噪去噪问题。&lt;br /&gt;
&lt;br /&gt;
关于不同的链路预测研究方法的分类可以参考下表：&lt;br /&gt;
[[File:Link preditction method.png|600px|thumb|三类不同的链路预测方法（*表示该方法含有参数）|center]]&lt;br /&gt;
&lt;br /&gt;
==应用场景==&lt;br /&gt;
链路预测有着广泛的应用场景：在生物领域，利用蛋白质间相互作用关系的结构信息进行链路预测，可以为实验的测定提前提供参考依据，从而降低实验成本、提高成功率；在社交网络领域，链路预测可以对社交网络中的好友关系、朋友推荐进行预测，从而提高用户对社交网站的体验满意度和使用黏性；在电子商务领域，除了传统的协同过滤推荐算法外，利用网络结构信息（如网络三角形结构）等特征进行商品推荐也取得了显著的优势；此外，通过识别隐藏的链边或异常的链边对信息不完全或含有噪音的网络进行重构，可以提高网络的传输能力，这对于航空网络重构有很大的启发意义。&lt;br /&gt;
[[File:Figure2.png|400px|thumb|链路预测应用场景示意图（图片来自网络）|center]]&lt;br /&gt;
&lt;br /&gt;
除此之外，链路预测的算法和思想通过一些变换还可以用来解决一些看似没有太大关系的问题。例如，对疾病信号和股票指数的预测。基于链路预测的思想和方法，我们还可以设计基于节点相似性的社团划分以及对网络演化模型的定量化评估方法。链路预测还可以帮助提高节点标签预测的精度，特别是在已知标签节点稀疏的情况下效果显著。这一方法可以应用于判断一篇学术论文的类型，判断一本书的政治态度（中立、自由派或保守派），或者判断一个手机用户是否产生了更换电信运营商的念头。&lt;br /&gt;
&lt;br /&gt;
==代表人物==&lt;br /&gt;
*'''吕琳媛'''&lt;br /&gt;
吕琳媛主要研究方向为复杂网络信息挖掘领域，包括海量信息导航、挖掘、推荐和预测。目前担任阿里巴巴复杂科学研究中心副主任，中欧联合实验室执行主任，中国工业与应用数学学会复杂网络与系统控制专业委员会委员，杭州市特聘专家。&lt;br /&gt;
[[File:Lvlinyuan.png|400px|thumb|吕琳媛，阿里巴巴复杂科学研究中心副主任|center]]&lt;br /&gt;
&lt;br /&gt;
近年来主持/参与国家级项目5项（2016年获得国家自然科学基金优秀青年基金），省部级项目4项，横向课题4项。 在相关领域发表学术论文 50余篇，其中SCI论文39篇，总影响因子122，发表期刊包括Physics Reports，PNAS，Nature Communications等国际知名学术期刊。三篇论文入选ESI全球Top-1%高引用论文，论文SCI引用1200余次，谷歌学术引用3000余次，其中9篇论文引用超过100次。2013年出版学术专著《链路预测》获得第四届中国大学出版社图书奖优秀学术著作一等奖。申请发明专利12项。2015年荣获浙江省杰出青年基金，2014年荣获中国计算机学会自然科学二等奖，中国网络科学论坛青年希望奖，首届CCF-腾讯犀牛鸟基金优秀奖。&lt;br /&gt;
&lt;br /&gt;
*'''周涛'''&lt;br /&gt;
周涛主要从事复杂性科学和大数据挖掘算法和应用研究，先后攻克推荐系统准确性-多样性困境、复杂网络链路可预测性、H指数-度-核心度关系等图挖掘领域的重要难题，成果发表在PNAS, Nature Communications, Physics Reports, KDD和ICDM等国际顶尖期刊和会议上。目前论文google总引用超过14000次，其中8篇论文入选ESI高引用论文，H指数为57，2014和2015连续两年入选Elsevier最具国际影响力中国科学家名单。&lt;br /&gt;
[[File:Zhoutao.png|400px|thumb|周涛，第十二届中国青年科技奖|center]]&lt;br /&gt;
&lt;br /&gt;
因其在科学研究上的杰出表现，2011年获得第十二届中国青年科技奖（最年轻获奖者），2011年入选四川省“百人计划”，2012年获得国家首批优秀青年科学基金资助，2013年入选国家“万人计划”首批青年拔尖人才支持计划，2014年获得四川省科技进步一等奖、中国计算机学会自然科学奖，2015年获得共青团中央授予的“最美青年科技工作者”称号，并与屠呦呦等七名个人和北斗导航等三个团队共同当选2015年度中国十大科技创新人物。&lt;br /&gt;
&lt;br /&gt;
*'''马克·纽曼 Mark Newman'''&lt;br /&gt;
Newman是一名英裔美国物理学家，也是密歇根大学 University of Michigan 物理学系的阿纳托尔·拉波特 Anatol Rapoport 杰出教授，也是圣达菲研究所 Santa Fe Institute 的外部教员。他因在复杂网络和复杂系统领域的基础性贡献而闻名，为此他被授予2014年拉格朗日奖。&lt;br /&gt;
[[File:Newman.png|400px|thumb|Mark Newman，密歇根大学物理学系阿纳托尔·拉波特杰出教授|center]]&lt;br /&gt;
&lt;br /&gt;
Newman以其对复杂网络的研究而著称，尤其是在科学家的协作模式，随机图论 Random graph theory，社区结构 Community structure，渗流理论 Percolation theory 和网络流行病学 Network epidemiology方面的工作。他作为共同发明人，与迈克尔·卡斯特 Michael Gastner 一起，发明了一种可以产生密度均衡地图 Density-equalizing maps 或统计地图 Cartograms的方法，该方法构成了Worldmapper网站的基础。他们的工作在2004年美国总统大选后受到关注，成为了当时被广泛传播的一种选举结果地图的基础，（他们）根据各州的人口数调整了州的规模，以便更准确地了解每个党派的选民投票人数。&lt;br /&gt;
&lt;br /&gt;
*'''克里斯托弗·大卫·摩尔 Cristopher David Moore'''&lt;br /&gt;
克里斯托弗·大卫·摩尔 Cristopher David Moore，也称为克里斯·摩尔 Cris Moore 是美国计算机科学家，数学家和物理学家。他是圣达菲研究所的驻校教师，曾任新墨西哥大学 University of New Mexico 的正教授。&lt;br /&gt;
[[File:Cristopher_David_Moore.png|400px|thumb|Cristopher David Moore，圣达菲研究所的驻校教师|center]]&lt;br /&gt;
&lt;br /&gt;
1993年，Moore 发现了一种新颖的解决三体问题的方法，表明在牛顿力学中，三个等质量的物体有可能沿着一条八字形曲线、在同一条轨道相互跟随。Moore 在网络科学领域也很活跃，在该领域有许多著名的出版物。在与Clauset和Mark Newman的合作中，Moore开发了复杂网络的层次聚类概率模型，并表明他们的模型可以在面对网络连接结构发生变化时可靠地预测聚类结果。&lt;br /&gt;
&lt;br /&gt;
*'''亚伦·克劳斯特 Aaron Clauset '''&lt;br /&gt;
Aaron Clauset是一位美国计算机科学家，致力于网络科学，机器学习和复杂系统领域。目前，他在科罗拉多大学博尔德分校 University of Colorado Boulder 教授计算机科学，也是圣菲研究所的外部教员。&lt;br /&gt;
[[File:Aaron_Clauset.png|400px|thumb|  Aaron Clauset，圣菲研究所的外部教员|center]]&lt;br /&gt;
&lt;br /&gt;
Clauset因与Cosma Shalizi和Mark Newman进行的合作研究而闻名，他们针对经验数据中是否存在幂律模式开发了严格的统计检验，并且证明了许多宣称符合幂律分布的网络实际上并不是幂律分布。他还因开发检测复杂网络中的社区结构算法的工作而著称，特别是和Newman、Moore合作发展的网络层次聚类模型。在其他方面，Clauslet 与麦克斯韦·扬 Maxwell Young 、克里斯蒂安·斯克雷德·格莱蒂奇 Kristian Skrede Gleditsch 共同完成了一些独特发现：世界范围内恐怖事件发生的频率和严重性服从幂律分布。&lt;br /&gt;
&lt;br /&gt;
2015年，Clauset 因开发和评估一种网络结构特征的新方法而获得了美国国家科学基金会颁发的著名的CAREER奖。2016年，Clauset因在网络结构方面（包括Internet映射，推断缺失链接和社区结构），以及对人类冲突和社会分层所做的启发性分析方面做出的贡献而获得网络科学学会颁发的网络科学领域的Erdös-Rényi奖。&lt;br /&gt;
&lt;br /&gt;
==参考资料==&lt;br /&gt;
*汪小帆,李翔,陈关荣.《网络科学导论》.北京：高等教育出版社,2012年：178-186&lt;br /&gt;
*吕琳媛,周涛.《链路预测》.北京：高等教育出版社,2013年：57-93&lt;br /&gt;
*吕琳媛,任晓龙,周涛.《网络链路预测：概念与前沿》[J].《中国计算机学会通讯》,2016年,第4期&lt;br /&gt;
*Clauset A, Moore C, Newman M E J. Hierarchical structure and the prediction of missing links in networks [J]. Nature, 2008,453(7191): 98-101.&lt;br /&gt;
*Link Prediction Group 网站：http://www.linkprediction.org/&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
*链接预测可用于分析网络将如何发展，或者在给定信息不完整情况下来发现“丢失”的链接，对于这个问题，有研究者提出了一种新的，结合广义群贴近度中心性和半值相互作用指数的拟局部方法（即考虑半径k内节点的方法），详见 [https://swarma.org/?p=18249 《链路预测的博弈算法》]&lt;br /&gt;
[[File:链路预测的博弈算法.jpg|400px|thumb|[https://swarma.org/?p=18249 《链路预测的博弈算法》]|center]]&lt;br /&gt;
*深度学习已经成功地在图像识别、语音识别、自然语言处理、游戏与博弈等领域取得了突飞猛进的发展，并渗透到了我们的日常生活中。那么，我们有没有可能将这种技术借剪到复杂网 络的研究之中呢？近年来，人们凭借着网络嵌入（Network Embedding）、图卷积神经网络（Graph Convolutional Neural Network）、图注意力模型（Graph Attention Network）等新技术，已经开发了若干图结构上的深度学习算法，并取得了一定的成功应用。北师大系统科学学院教授、博导张江老师亲授[https://campus.swarma.org/play/coursedetail?id=10504 《当复杂网络遇上机器学习》]，将对这些算法以及应用，包括各式各样的网络嵌入算法、节点分类问题、链路预测问题、图分类问题、网络动力学预测问题等做一简单介绍，并对网络上的深度学习问题进行了展望。&lt;br /&gt;
[[File:当复杂网络遇上机器学习.png|400px|thumb|[https://campus.swarma.org/play/coursedetail?id=10504 《当复杂网络遇上机器学习》]|center]]&lt;br /&gt;
*网络上的注意力模型（Graph Attention Model）是一种通用的网络嵌入算法，它能够在节点分类、链路预测等问题上得到极高的精度。它可以模仿一个机器头对网络中的节点进行信息读取和分析，然后将综合的结果放到节点的向量中的过程。[https://campus.swarma.org/play/coursedetail?id=10385 《网络上的注意力模型》]课程将详细介绍这一模型及其应用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''''本中文词条由[[用户:木子二月鸟|木子二月鸟]]用户参与编译，  [[用户: 苏格兰| 苏格兰]]用户审校，欢迎在讨论页面留言'''''。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''本词条内容源自wikipedia及公开资料，遵守 CC3.0协议。'''&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E9%93%BE%E8%B7%AF%E9%A2%84%E6%B5%8B&amp;diff=7632</id>
		<title>链路预测</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E9%93%BE%E8%B7%AF%E9%A2%84%E6%B5%8B&amp;diff=7632"/>
		<updated>2020-05-10T14:21:21Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：/* 基于相似性的链路预测 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{#seo:|keywords=链路预测 Link Prediction  |description=通过已知的网络节点以及网络结构等信息，预测网络中尚未产生连边的两个节点之间产生连接的可能性。 }}&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
'''链路预测 Link Prediction'''是指如何通过已知的网络节点以及网络结构等信息，预测网络中尚未产生连边的两个节点之间产生连接的可能性。这种预测既包含了对未知链接 Existing yet unknown link，也称丢失链接 Missing link 的预测，也包含了对未来链接 Future link 的预测。&lt;br /&gt;
&lt;br /&gt;
链路预测是将复杂网络与信息科学联系起来的重要桥梁之一，它所要处理的是信息科学中最基本的问题——缺失信息的还原与预测。链路预测相关研究不仅能够推动网络科学和信息科学理论上的发展，而且具有巨大的实际应用价值，譬如可以知道蛋白质相互作用实验、进行在线社交推荐、找出交通传输网络中有特别重要作用的连边等。&lt;br /&gt;
&lt;br /&gt;
==研究方法==&lt;br /&gt;
===基于相似性的链路预测===&lt;br /&gt;
&lt;br /&gt;
*基于局部信息的相似性指标&lt;br /&gt;
&lt;br /&gt;
社会网络分析中经典的三元闭包 Triadic closure 原则指出，如果A、B	两个人拥有一个共同的朋友C，那么这两个人今后也很有可能成为朋友，从而使得3个节点构成一个闭合的三角形ABC。对于一般的网络，我们可以把这一原则推广如下：两个节点的共同邻居越多，这两个节点就越相似，从而更倾向于相互连接。最简单的基于'''共同邻居 Common neighbors''' 的节点相似性指标定义如下：&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
s_{xy}^{CN} =  |Γ(x)| \cap |Γ(y)|&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
在相似性指标定义的基础上，还可以考虑两个节点的共同邻居的相对数量。下表列出了10种基于节点局部信息的相似性指标，第1种是计算共同邻居相似度的基本公式，其中第2至7种相似性指标是直接基于共同邻居指标的不同的规范化而得到的，表中的 k(x) = |Γ(x)| 为节点x的度。第8种指标PA是基于BA无标度网络模型中新加入节点倾向于和度大的节点相连的优先连接机制而提出的。&lt;br /&gt;
&lt;br /&gt;
第9种指标AA的基本思想是度小的共同邻居节点的贡献大于度大的共同邻居节点，因此根据共同邻居节点的度为每个节点赋予一个权重值。这一点很容易理解，例如在微博中受关注较多的人往往是某个领域的专家或名人，因此共同关注他们的人之间可能并不拥有特别相似的兴趣——一个中学生和一个企业家都有可能是姚晨的粉丝。相反，如果两个人共同关注了一个粉丝很少的人（非名人），那么说明这两个人确实具有相同的兴趣爱好或者重叠的社交圈，因此有更高概率相连。又如在推荐系统中，共同购买冷门产品的两个用户往往比共同购买热门产品的用户更相似。&lt;br /&gt;
[[File:Table1.png|600px|thumb|10种基于节点局部信息的相似性指标|center]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
第2个指标Salton指标&amp;lt;ref name=&amp;quot;2&amp;quot;&amp;gt;Salton G, McGill M J () [https://pattern.swarma.org/paper?id=15e10152-92c8-11ea-81db-0242ac1a0005 Introduction to Modern Information Retrieval].&amp;lt;/ref&amp;gt;又称余弦相似性，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{|Γ(x)| \cap |Γ(y)|}{\sqrt{k(x)k(y)}}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第3个指标Jaccard指标&amp;lt;ref name=&amp;quot;3&amp;quot;&amp;gt;Jaccard P. () [https://pattern.swarma.org/paper?id=70c8a48a-92c8-11ea-9f7f-0242ac1a0005 Etude de la distribution florale dans une portion des Alpes et du Jura].&amp;lt;/ref&amp;gt;是于100多年前由Jaccard提出的，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{|Γ(x)| \cap |Γ(y)|}{|Γ(x)| \bigcup  |Γ(y)|}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第4个指标Sorensen指标&amp;lt;ref name=&amp;quot;4&amp;quot;&amp;gt;Sørensen, T, Sørensen, T A, Sørensen, T J (1948) [https://pattern.swarma.org/paper?id=ea7f2902-6e74-11ea-9db3-0242ac1a0005 A method of establishing groups of equal amplitude in plant sociology based on similarity of species content and its application to analyses of the vegetation on Danish commons].&amp;lt;/ref&amp;gt;常用于生态学研究，其定义为 &amp;lt;math&amp;gt;s{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{kx + ky}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第5个指标大度节点有利指标&amp;lt;ref name=&amp;quot;5&amp;quot;&amp;gt;E. Ravasz,A. L. Somera,D. A. Mongru,Z. N. Oltvai,A. -L. Barabasi (2002) [https://pattern.swarma.org/paper?id=6eb98b7e-6e91-11ea-81b9-0242ac1a0005 Hierarchical organization of modularity in metabolic networks].arXiv:0209244.&amp;lt;/ref&amp;gt;（Hub promoted index，HPI）被用来定量刻画新陈代谢网络中每对反应物的拓扑相似程度，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{min\{k_x,k_y\}}&amp;lt;/math&amp;gt;，由于分母只由度较小的节点决定，在此定义下可知大度节点（hub）与其他节点之间更容易具有高的相似性。&lt;br /&gt;
&lt;br /&gt;
第6个指标大度节点不利指标&amp;lt;ref name=&amp;quot;6&amp;quot;&amp;gt;Tao Zhou,Linyuan Lu,Yi-Cheng Zhang (2009) [https://pattern.swarma.org/paper?id=7a2b26ba-6e92-11ea-9ee2-0242ac1a0005 Predicting Missing Links via Local Information].arXiv:0901.0553.&amp;lt;/ref&amp;gt;（hub depressed index, HDI）定义与HPI相似，只是分母取两端节点度的最大值，即 &amp;lt;math&amp;gt;s_{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{max\{k_x,k_y\}}&amp;lt;/math&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
第7个指标LHN-I指标&amp;lt;ref name=&amp;quot;7&amp;quot;&amp;gt;E. A. Leicht,Petter Holme,M. E. J. Newman (2005) [https://pattern.swarma.org/paper?id=71890c4e-6f0e-11ea-b30e-0242ac1a0005 Vertex similarity in networks].arXiv:0510143.&amp;lt;/ref&amp;gt;是由Leicht，Holme和Newman提出，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{{k_xk_y}}&amp;lt;/math&amp;gt;，其中分母&amp;lt;math&amp;gt;k_xk_y&amp;lt;/math&amp;gt; 正比于节点&amp;lt;math&amp;gt;v_x&amp;lt;/math&amp;gt;和节点&amp;lt;math&amp;gt;v_y&amp;lt;/math&amp;gt;共同邻居数的期望值，即 &amp;lt;math&amp;gt;E( |Γ(x)| \cap |Γ(y)|)&amp;lt;/math&amp;gt;。在下面这篇文献中，Leicht等人同时提出了另一个基于路径的指标，为了有所区别，将此局部指标命名为LHN-I指标，将基于路径的指标命名为LHN-II指标：&lt;br /&gt;
&lt;br /&gt;
第8个指标PA（preferential attachment）是基于BA无标度网络模型中新加入节点倾向于和度大的节点相连的优先连接机制而提出的，在这种机制的链路预测中，每一步首先去除一条链接，然后再添加一条链接，新链接连接节点&amp;lt;math&amp;gt;v_x&amp;lt;/math&amp;gt;和&amp;lt;math&amp;gt;v_y&amp;lt;/math&amp;gt;的概率就正比于两节点度的乘积，由此可以定义两节点间的优先连接相似性：&amp;lt;math&amp;gt;s_{xy}= k_xk_y&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第9个指标AA（Adamic-Adar）&amp;lt;ref name=&amp;quot;8&amp;quot;&amp;gt;Adar, Adamic L A, E (2003) [https://pattern.swarma.org/paper?id=e4726a06-6f2d-11ea-8846-0242ac1a0005 Friends and neighbors on the web].Social networks.25.(211--230)&amp;lt;/ref&amp;gt;的基本思想是度小的共同邻居节点的贡献大于度大的共同邻居节点，因此根据共同邻居节点的度为每个节点赋予一个权重值。这一点很容易理解，例如在微博中受关注较多的人往往是某个领域的专家或名人，因此共同关注他们的人之间可能并不拥有特别相似的兴趣——一个中学生和一个企业家都有可能是姚晨的粉丝。相反，如果两个人共同关注了一个粉丝很少的人（非名人），那么说明这两个人确实具有相同的兴趣爱好或者重叠的社交圈，因此有更高概率相连。又如在推荐系统中，共同购买冷门产品的两个用户往往比共同购买热门产品的用户更相似。AA指标根据共同邻居节点的度为每个节点赋予一个权重值，该权重等于该节点的度的对数分之一，即AA指标的定义为：&amp;lt;math&amp;gt;s_{xy}=\sum _{z\in \Gamma (x)\bigcap \Gamma (y)}\frac{1}{logk_z}&amp;lt;/math&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
第10种指标RA是受网络资源分配过程的启发，周涛等人提出的“'''资源分配指标 Resource allocation'''”，其与AA指标有异曲同工之妙。RA和AA指标最大的区别就在于赋予共同邻居节点权重的方式不同，前者是以 1/k 的形式递减，后者是以 1/logk 的形式递减。可见，当网络的平均度较小时，RA和AA差别不大；但是当平均度较大时，就有很大的区别了。研究显示，RA指标在刻画加权网络和社区挖掘应用中的表现胜过AA指标，图灵奖得主Hopdroft的一篇论文也显示，可以利用社区等中观结构信息改进局部指标，其中RA指标改进后的效果最佳。&lt;br /&gt;
&lt;br /&gt;
*基于路径的相似性指标&lt;br /&gt;
&lt;br /&gt;
基于共同邻居的相似性指标的优势在于计算复杂度较低，但是由于使用的信息非常有限，预测精度受到限制，因此发展出了基于路径的相似性指标，主要有3个，分别是局部路径指标 Local path 、Katz指标和LHN-II指标。&lt;br /&gt;
&lt;br /&gt;
1.局部路径指标&lt;br /&gt;
&lt;br /&gt;
周涛等人在共同邻居的基础上考虑三阶路径的因素，提出了基于局部路径的相似性指标，其定义为 &amp;lt;math&amp;gt; S=A^2+\alpha A^3&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 为可调参数，A 表示网络的邻接矩阵， &amp;lt;math&amp;gt;(A^3)_{xy}&amp;lt;/math&amp;gt;表示节点 &amp;lt;math&amp;gt;V_x&amp;lt;/math&amp;gt; 和 &amp;lt;math&amp;gt;V_y&amp;lt;/math&amp;gt; 之间长度为3的路径数目。当&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; = 0时，LP指标就退化为 CN 指标。 CN 指标本质上也可看成基于路径的指标，只是它仅考虑了二阶路径数目。局部路径指标可以扩展为更高阶的情形，即考虑n阶路径的情况：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt; S^n=A^2+\alpha\cdot A^3+\alpha^2\cdot A^4+\cdots +\alpha^{n-2}\cdot A^n &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
随着 n 的增加，局部路径指标的计算复杂度越来越大。一般而言，考虑 n 阶路径的计算复杂度为O(N&amp;lt;k&amp;gt;^n)。但是当 n 趋于无穷大的时候，局部路径指标相当于考虑网络全部路径的Katz指标，此时计算量反而有可能下降，因为可转变为计算矩阵的逆。&lt;br /&gt;
&lt;br /&gt;
2.Katz指标&lt;br /&gt;
&lt;br /&gt;
Katz指标考虑了所有网络的路径，因此其定义为：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S_{xy}=\sum_{l=1}^{\infty }\alpha^l\cdot\left |  paths_{x,y}^{&amp;lt;l&amp;gt;} \right |= \alpha A_{xy}+\alpha^2\cdot (A^2)_{xy}+\alpha^3\cdot (A^3)_{xy}+\cdots  &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\alpha &amp;gt; 0&amp;lt;/math&amp;gt; 为控制路径权重的可调参数，&amp;lt;math&amp;gt;\left |  paths_{x,y}^{&amp;lt;l&amp;gt;} \right |&amp;lt;/math&amp;gt;表示连接节点 &amp;lt;math&amp;gt;V_x&amp;lt;/math&amp;gt;和  &amp;lt;math&amp;gt;V_y&amp;lt;/math&amp;gt; 的路径中长度为 l 的路径数。要使上述级数收敛，则参数&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 应小于邻接矩阵最大特征值的倒数，此定义还可以表示为：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S = (I - \alpha\cdot A)^{-1} - I&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
显然，当参数&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 很小时，高阶路径的贡献也较小，使得 Katz 指标的预测结果接近于局部路径指标。&lt;br /&gt;
&lt;br /&gt;
3.LHN-II指标&lt;br /&gt;
&lt;br /&gt;
LHN-II 指标是 Leicht，Holme 和 Newman 提出的另一种相似性计算方法，他的基本思想是基于'''一般等价 Regular equivalence''' 提出的。与结构等价不同，一般等价的定义更广泛。在一般等价的定义下，如果两个节点所连接的节点之间相似，那么这两个节点也相似，即使它们之间没有共同的邻居节点。&lt;br /&gt;
&lt;br /&gt;
下图给出了一个简单的例子来帮助我们理解结构等价和一般等价的区别。根据结构等价的定义，在公司A内部，由于员工a和员工b都认识员工e和员工f（即它们有两个共同邻居节点），于是称员工a和员工b是结构等价的。同理，员工e和员工f也是结构等价的，同样地，在公司B中，员工c和员工d是结构等价的，员工g和员工h也是结构等价的。现在考虑员工a和员工c是否相似？根据一般等价的定义，由于员工a连接的节点e、f与员工c连接的节点g、h分别是相似的，那么我们可以认为员工a和员工c也是相似的，同理，在一般等价的意义下，员工b和员工d也是相似。从这个例子可以看出，结构相似性或称结构等价更强调的是两个节点是否在同一个环境下，也就是说是否连接了相同的节点；然而一般等价考虑的是这两个节点是否处于同样的角色，即使他们没有相同的邻居节点，但是由于各自的邻居节点之间本身相似，这两个节点也相似。一般等价意义下的相似性是LHN-II指标的核心。&lt;br /&gt;
&lt;br /&gt;
[[File:一般等价和结构等价示例.png|600px|thumb|一般等价和结构等价示例（图中实线表示连接，虚线表示相似关系）|center]]&lt;br /&gt;
&lt;br /&gt;
从一般等价的角度考虑，LHN-II指标认为如果两个节点的邻居节点之间是相似的，那么这两个节点也是相似的。它与Katz指标的区别主要是把Katz指标中的&amp;lt;math&amp;gt; (A^{n})_{xy} &amp;lt;/math&amp;gt;变成 &amp;lt;math&amp;gt;  (A^{n})_{xy}&amp;lt;/math&amp;gt; 的期望值，注意到 &amp;lt;math&amp;gt; (A^{n})_{xy}&amp;lt;/math&amp;gt; 的期望值为 &amp;lt;math&amp;gt; E\left [ (A^l)_{xy} \right ]=\frac{k_xk_y}{M}\lambda _1^{l-1}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\lambda_1&amp;lt;/math&amp;gt;为矩阵A的最大特征值，则LHN-II指标的表达式如下：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 S_{xy}^{LHN2}=\delta _{xy} + \sum_{l=1}^{\infty }\Phi ^l \frac{(A^l)_{xy}}{E\left [ (A^l)_{xy} \right ]}&lt;br /&gt;
=\delta _{xy} + \frac{2M}{k_xk_y}\sum_{l=1}^{\infty }\Phi ^l\lambda _1^{1-l}(A^l)_{xy}&lt;br /&gt;
=\left [ 1 - \frac{2 M \lambda_1}{k_xk_y} \right ]\delta _{xy} + \frac{2 M \lambda_1}{k_xk_y}\left [ (I-\frac{\Phi}{\lambda_1} A )^{-1} \right ]_{xy}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\delta _{xy}&amp;lt;/math&amp;gt;为 Kronecker &amp;lt;math&amp;gt;\delta&amp;lt;/math&amp;gt; 函数，&amp;lt;math&amp;gt; \Phi&amp;lt;/math&amp;gt; 为取值小于1的参数。上式最后一个等式的第一项是可以去掉的对角阵，从而相似性矩阵可以写为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S=2M\lambda_1D^{-1}(I-\frac{\Phi A}{\lambda_1})^{-1}D^{-1}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中''D''为度值矩阵，&amp;lt;math&amp;gt;D_{xy} = \delta_{xy} \cdot k_{x}&amp;lt;/math&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
*基于随机游走的节点相似性指标&lt;br /&gt;
&lt;br /&gt;
还有相当数量的相似性指标是基于随机游走过程定义的，包括'''平均通勤时间 Average commute time''' 、'''Cos+指标'''、'''有重启的随机游走 Random walk with restart'''、'''SimRank'''指标、'''局部随机游走指标 Local random walk''' 和'''有叠加效应的随机游走指标 Superposed random walk'''等。&lt;br /&gt;
&lt;br /&gt;
1.平均通勤时间 ACT &lt;br /&gt;
&lt;br /&gt;
设&amp;lt;math&amp;gt;m(x,y)&amp;lt;/math&amp;gt; 为一个随机粒子从节点x到节点y平均需要走的步数，那么节点x和y的平均通勤时间定义为：&amp;lt;math&amp;gt;n(x , y) = m(x , y) + m(y , x) &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其数值解可通过求该网络拉普拉斯矩阵&amp;lt;math&amp;gt;L&amp;lt;/math&amp;gt; 的伪逆&amp;lt;math&amp;gt; L^+&amp;lt;/math&amp;gt; 获得，即 &amp;lt;math&amp;gt;n(x,y)=M(l^+_{xx} +l^+_{yy} - 2l^+_{xy})&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;l^{+}_{xy}&amp;lt;/math&amp;gt;表示矩阵&amp;lt;math&amp;gt;L^+ &amp;lt;/math&amp;gt;中相应位置的元素。如果两个节点的平均通勤时间越小，那么两个节点越进阶。由此，定义基于ACT的相似性为（在此可忽略常数M）&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{ACT}=\frac{1}{l^+_{xx} +l^+_{yy} - 2l^+_{xy}}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
2.余弦相似性指标 Cos+指标&lt;br /&gt;
&lt;br /&gt;
在由向量&amp;lt;math&amp;gt;v_x = \Lambda ^{1/2}U^{T}e_{x}&amp;lt;/math&amp;gt;展开的欧式空间内，&amp;lt;math&amp;gt;L^+ &amp;lt;/math&amp;gt;中的元素&amp;lt;math&amp;gt;l^{+}_{xy}&amp;lt;/math&amp;gt;可表示为两向量&amp;lt;math&amp;gt;v_x&amp;lt;/math&amp;gt;和&amp;lt;math&amp;gt;v_y&amp;lt;/math&amp;gt;的内积，即&amp;lt;math&amp;gt; l^{+}_{xy} = v_{x}^{T} v_y&amp;lt;/math&amp;gt;，其中&amp;lt;math&amp;gt;U&amp;lt;/math&amp;gt;是一个标准正交矩阵，由&amp;lt;math&amp;gt;L^+&amp;lt;/math&amp;gt;特征向量按照对应的特征根从大到小排列，&amp;lt;math&amp;gt;\Lambda&amp;lt;/math&amp;gt;为以特征根为对角元素的对角矩阵，&amp;lt;math&amp;gt;e_{x}&amp;lt;/math&amp;gt; 表示一个一维向量且只有第x个元素为1，其他都为0。由此定义余弦相似性如下：&lt;br /&gt;
&lt;br /&gt;
s_{xy}^{cos+}=cos(x,y)^+=\frac{l_{xy}^+}{\sqrt{l^+_{xx} \cdot l^+_{yy}}}&lt;br /&gt;
&lt;br /&gt;
3.重启的随机游走 RWR&lt;br /&gt;
&lt;br /&gt;
这个指标可以看成是PageRank 算法的拓展应用。它假设随机游走粒子在每走一步的时候都以一定概率返回初始位置。设粒子返回概率为 1-c，&amp;lt;math&amp;gt;P&amp;lt;/math&amp;gt; 为网络的马尔科夫概率转移矩阵，其元素 &amp;lt;math&amp;gt;P_{xy} = a_{xy}/k_{x} &amp;lt;/math&amp;gt;表示节点x处的粒子下一步走到节点y的概率。其中如果节点x和节点y相连，则&amp;lt;math&amp;gt;a_{xy}=1&amp;lt;/math&amp;gt;，否则&amp;lt;math&amp;gt;a_{xy}=0&amp;lt;/math&amp;gt;。某一粒子初始时刻在节点x处，那么t+1时刻该粒子到达网络各个节点的概率向量为&lt;br /&gt;
&amp;lt;math&amp;gt;q_{x}(t+1) = c \cdot P^{T}q_{x}(t) + (1-c) e_{x}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;e_{x}&amp;lt;/math&amp;gt;表示初始状态（其定义与Cos+中相同），上式的稳态解为&amp;lt;math&amp;gt;q_{x} = (1-c)(I-cP^{T})^{-1}e_{x}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中元素&amp;lt;math&amp;gt;q_{xy}&amp;lt;/math&amp;gt;为从节点x出发的粒子最终有多少概率走到节点y。由此定义RWR相似性如下：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{RWR} = q_{xy} + q_{yx} &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
4.SimRank指标 SimR&lt;br /&gt;
&lt;br /&gt;
它的基本假设是，如果两节点所连接的节点相似，那么这两个节点就相似。其自洽定义式为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{simR}=C\frac{\sum_{v_z\in \Gamma (x)}\sum_{{v_z}'\in \Gamma (y)}s_{zz'}^{simR}}{k_xk_y}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中假定 &amp;lt;math&amp;gt;s_{xx} =1, C \in [0,1] &amp;lt;/math&amp;gt;为相似性传递时的衰减参数。&lt;br /&gt;
&lt;br /&gt;
SimR指标同时考虑了结构等价和一般等价。当节点x的邻居z同时也是节点y的邻居时，该指标考虑了结构等价；当节点x不等于节点y时，该指标概率了一般等价。可以证明，SimR指标可以用来描述两个分别从节点x和y出发的粒子平均过多久会相遇。&lt;br /&gt;
&lt;br /&gt;
5.局部随机游走指标 LRW&lt;br /&gt;
&lt;br /&gt;
上述4种随机游走指标是基于全局的随机游走，这类指标往往计算复杂度很高，因此很难在大规模网络上应用。刘伟平和吕琳媛提出了一种基于网络局部随机游走的相似性指标LRW，它只考虑有限步数的随机游走过程。一个粒子 t 时刻从节点x出发，定义&amp;lt;math&amp;gt;π_{xy} (t) &amp;lt;/math&amp;gt;为 t+1 时刻这个粒子正好走到节点y的概率，那么可得到系统演化方程：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\pi_{x} (t + 1) = P^T\pi_{x}(t)，t=0,1,…&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\pi_{x}(0) &amp;lt;/math&amp;gt;为一个&amp;lt;math&amp;gt;Nx1 &amp;lt;/math&amp;gt;的向量，只有第x 个元素为1，其他为0，即&amp;lt;math&amp;gt;\pi_{x}(0) =e_x&amp;lt;/math&amp;gt;。设定各个节点的初始资源分布为&amp;lt;math&amp;gt;q_x&amp;lt;/math&amp;gt;，那么基于t步随机游走的相似性为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{LRW} = q_{xy} + q_{yx}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
6.叠加的局部随机游走指标 SRW&lt;br /&gt;
&lt;br /&gt;
这个指标给邻近目标节点的点更多的机会与目标节点相连，充分考虑了很多真实网络连接上的局域性特点，它是在LRW的基础上，将t步及其以前的结果加总，便得到SRW的值，即：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{SRW}(t)=\sum_{t}^{l=1}s_{xy}^{LRW}(l) = q_x\sum_{t}^{l=1}\pi_{xy}(l) + q_y\sum_{t}^{l=1}\pi_{yx}(l)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===基于似然分析的链路预测===&lt;br /&gt;
&lt;br /&gt;
基于相似性的链路预测方法，是最简单的一种分析框架，除此之外，还有另一种最复杂的链路预测分析框架——基于似然分析的链路预测。这个框架本身远远复杂于基于相似性的框架，而且框架中的每一个组成成分自身都非常复杂，但这个框架下衍生出的算法除了给出链路预测的结果之外，还给出了我们对于网络结构的深刻洞见，例如“'''层次结构模型 Hierachical structure model'''”给出了网路层次组织形态的定量刻画，“'''随机分块模型 Stochastic block model'''”类似于社区分解一样把网络划分成了若干子块。这些对理解网络结构特征方面的贡献，是基于相似性的框架所不能提供的。&lt;br /&gt;
&lt;br /&gt;
基于似然分析的链路预测的基本思路是：根据网络结构的产生和组织方式以及目前已经观察到的链路计算网络的似然值，并认为真实的网络使得网络似然值最大，然后再根据网络似然最大化计算每一对未连接的节点产生连边的可能性。&lt;br /&gt;
&lt;br /&gt;
*层次结构模型 HSM&lt;br /&gt;
&lt;br /&gt;
层次结构模型假设真实的网络都存在某种层次性，网络的连接则可看作是这种内在层次结构的反映。该方法的计算步骤如下：&lt;br /&gt;
&lt;br /&gt;
1.一个N个节点的网络可以用一个包含N个叶子节点的族谱树表示，这N个叶子节点将由N-1个非叶子节点连接起来，其中每个非叶子节点都有一个概率值，则两个叶子节点连接的概率就等于他们最近共同祖先节点的概率值。给定一个族谱树，将网络的似然值最大化，就可以得到非叶子节点的概率值，并由此计算出这一个族谱树所对应的网络最大的似然值。&lt;br /&gt;
&lt;br /&gt;
2.使用马尔科夫链蒙特卡洛方法对网络不同的族谱树进行抽样，使得每个族谱树出现的频次正比于该树对应的最大的网络似然值。两个节点连边的概率就等于所有抽样出来的族谱树中两个节点连边概率的平均值。注意似然高的族谱树会出现多次，因此对这个平均概率的贡献也大。&lt;br /&gt;
&lt;br /&gt;
3.把平均连边概率看做是相似性框架中的相似性指标&amp;lt;math&amp;gt;s_{xy}&amp;lt;/math&amp;gt;，按照这个值从大到小排序，排在前面的就是预测的连边。&lt;br /&gt;
&lt;br /&gt;
需要指出的是，层次结构模型在处理具有明显层次结构的网络（如恐怖袭击网络和草原食物链）时具有较高的精确度，但在处理一般性网络时效果并不一定突出。&lt;br /&gt;
&lt;br /&gt;
*随机分块模型 SBM&lt;br /&gt;
&lt;br /&gt;
与层次结构模型的思想类似，随机分块模型假设网络中的节点可以被分为若干集合，两个节点间连接的概率只与相应的集合有关。换句话说，同一个群众所有节点的地位是相同的。随机分块模型特别适合刻画节点所属群的成员身份对于其连接行为有关键影响的情况，例如，著名的“角色模型”就包含了随机分块模型的理念。&lt;br /&gt;
&lt;br /&gt;
随机分块模型的效果要好于层次结构模型。同时，该方法还可以剔除网络的错误连边，如纠正蛋白质相互作用网络中的错误连边。&lt;br /&gt;
&lt;br /&gt;
*闭路模型 Loop model&lt;br /&gt;
&lt;br /&gt;
似然分析的更一般的框架是：给定一个网络系统，特定网络哈密顿量的负指数被统计分配函数归一化后，就得到这个网络出现的似然，一条未被观察到的连边存在的可能性就等于添加这条连边后网络的似然值。闭路模型考虑网络结构形成中的“局部性原则”，并由此定义了网络的哈密顿量。实验表明，闭路模型的预测精度大于层次结构模型和随机分块模型。&lt;br /&gt;
&lt;br /&gt;
===基于机器学习的链路预测===&lt;br /&gt;
&lt;br /&gt;
用机器学习的思路进行链路预测，主要分为基于特征分类方法、基于概率图模型方法和基于矩阵分解方法三大类。&lt;br /&gt;
&lt;br /&gt;
*基于特征分类方法&lt;br /&gt;
&lt;br /&gt;
网络中的链路预测问题可以看成机器学习中的分类问题，其中每个数据点对应一对节点之间关系的标记，假定两个节点之间存在连边，则数据点的值为+1，否则为-1。特征选取是分类问题中最重要的问题之一，目前研究较多的主要包括基于节点与边的属性特征和基于节点所处网络的拓扑结构特征（如CN、AA、Katz、最短路径）等。哈桑 Hasan 等人提取合著网络中科学家研究领域的关键词作为特征，用监督学习中一些常用的分类算法（如决策树、K近邻法、多层感知器、支持向量机、径向基网络）对缺失的连边进行较为精准的预测，其中以支持向量机方法表现最佳。&lt;br /&gt;
&lt;br /&gt;
*基于概率图模型&lt;br /&gt;
&lt;br /&gt;
基于概率图模型的链路预测方法使用图模型来表达节点之间的连边概率，根据模型中概率依赖关系，可分为有向无环的贝叶斯网络和无向的马尔科夫网络。随机分块模型和层次结构模型分别是典型的基于贝叶斯网络和基于马尔科夫网络的链路预测方法。基于概率图模型的链路预测方法有很多，典型的还有有监督随机游走链路预测算法，将网络结构信息与节点和连边的属性信息结合起来，给每条边分配不同的转移概率。与其他有监督的机器学习方法相比，该算法无须知道网络的特征和相关的领域知识。&lt;br /&gt;
&lt;br /&gt;
*基于矩阵分解&lt;br /&gt;
&lt;br /&gt;
基于矩阵分解的链路预测方法是基于网络邻接矩阵的代数谱变换而得到的方法，来预测网络中链路的存在性和链路的权值。相比其他几种机器学习方法，该方法要学习的参数少很多，但计算复杂度较高。链路预测问题可以视为邻接矩阵填充问题，并可以通过双线性回归模型将节点和链路的显特征和隐特征结合起来用矩阵分解方法解决。边缘去噪模型将根据给定关系矩阵求未知边或丢失边的问题变成一个矩阵降噪去噪问题。&lt;br /&gt;
&lt;br /&gt;
关于不同的链路预测研究方法的分类可以参考下表：&lt;br /&gt;
[[File:Link preditction method.png|600px|thumb|三类不同的链路预测方法（*表示该方法含有参数）|center]]&lt;br /&gt;
&lt;br /&gt;
==应用场景==&lt;br /&gt;
链路预测有着广泛的应用场景：在生物领域，利用蛋白质间相互作用关系的结构信息进行链路预测，可以为实验的测定提前提供参考依据，从而降低实验成本、提高成功率；在社交网络领域，链路预测可以对社交网络中的好友关系、朋友推荐进行预测，从而提高用户对社交网站的体验满意度和使用黏性；在电子商务领域，除了传统的协同过滤推荐算法外，利用网络结构信息（如网络三角形结构）等特征进行商品推荐也取得了显著的优势；此外，通过识别隐藏的链边或异常的链边对信息不完全或含有噪音的网络进行重构，可以提高网络的传输能力，这对于航空网络重构有很大的启发意义。&lt;br /&gt;
[[File:Figure2.png|400px|thumb|链路预测应用场景示意图（图片来自网络）|center]]&lt;br /&gt;
&lt;br /&gt;
除此之外，链路预测的算法和思想通过一些变换还可以用来解决一些看似没有太大关系的问题。例如，对疾病信号和股票指数的预测。基于链路预测的思想和方法，我们还可以设计基于节点相似性的社团划分以及对网络演化模型的定量化评估方法。链路预测还可以帮助提高节点标签预测的精度，特别是在已知标签节点稀疏的情况下效果显著。这一方法可以应用于判断一篇学术论文的类型，判断一本书的政治态度（中立、自由派或保守派），或者判断一个手机用户是否产生了更换电信运营商的念头。&lt;br /&gt;
&lt;br /&gt;
==代表人物==&lt;br /&gt;
*'''吕琳媛'''&lt;br /&gt;
吕琳媛主要研究方向为复杂网络信息挖掘领域，包括海量信息导航、挖掘、推荐和预测。目前担任阿里巴巴复杂科学研究中心副主任，中欧联合实验室执行主任，中国工业与应用数学学会复杂网络与系统控制专业委员会委员，杭州市特聘专家。&lt;br /&gt;
[[File:Lvlinyuan.png|400px|thumb|吕琳媛，阿里巴巴复杂科学研究中心副主任|center]]&lt;br /&gt;
&lt;br /&gt;
近年来主持/参与国家级项目5项（2016年获得国家自然科学基金优秀青年基金），省部级项目4项，横向课题4项。 在相关领域发表学术论文 50余篇，其中SCI论文39篇，总影响因子122，发表期刊包括Physics Reports，PNAS，Nature Communications等国际知名学术期刊。三篇论文入选ESI全球Top-1%高引用论文，论文SCI引用1200余次，谷歌学术引用3000余次，其中9篇论文引用超过100次。2013年出版学术专著《链路预测》获得第四届中国大学出版社图书奖优秀学术著作一等奖。申请发明专利12项。2015年荣获浙江省杰出青年基金，2014年荣获中国计算机学会自然科学二等奖，中国网络科学论坛青年希望奖，首届CCF-腾讯犀牛鸟基金优秀奖。&lt;br /&gt;
&lt;br /&gt;
*'''周涛'''&lt;br /&gt;
周涛主要从事复杂性科学和大数据挖掘算法和应用研究，先后攻克推荐系统准确性-多样性困境、复杂网络链路可预测性、H指数-度-核心度关系等图挖掘领域的重要难题，成果发表在PNAS, Nature Communications, Physics Reports, KDD和ICDM等国际顶尖期刊和会议上。目前论文google总引用超过14000次，其中8篇论文入选ESI高引用论文，H指数为57，2014和2015连续两年入选Elsevier最具国际影响力中国科学家名单。&lt;br /&gt;
[[File:Zhoutao.png|400px|thumb|周涛，第十二届中国青年科技奖|center]]&lt;br /&gt;
&lt;br /&gt;
因其在科学研究上的杰出表现，2011年获得第十二届中国青年科技奖（最年轻获奖者），2011年入选四川省“百人计划”，2012年获得国家首批优秀青年科学基金资助，2013年入选国家“万人计划”首批青年拔尖人才支持计划，2014年获得四川省科技进步一等奖、中国计算机学会自然科学奖，2015年获得共青团中央授予的“最美青年科技工作者”称号，并与屠呦呦等七名个人和北斗导航等三个团队共同当选2015年度中国十大科技创新人物。&lt;br /&gt;
&lt;br /&gt;
*'''马克·纽曼 Mark Newman'''&lt;br /&gt;
Newman是一名英裔美国物理学家，也是密歇根大学 University of Michigan 物理学系的阿纳托尔·拉波特 Anatol Rapoport 杰出教授，也是圣达菲研究所 Santa Fe Institute 的外部教员。他因在复杂网络和复杂系统领域的基础性贡献而闻名，为此他被授予2014年拉格朗日奖。&lt;br /&gt;
[[File:Newman.png|400px|thumb|Mark Newman，密歇根大学物理学系阿纳托尔·拉波特杰出教授|center]]&lt;br /&gt;
&lt;br /&gt;
Newman以其对复杂网络的研究而著称，尤其是在科学家的协作模式，随机图论 Random graph theory，社区结构 Community structure，渗流理论 Percolation theory 和网络流行病学 Network epidemiology方面的工作。他作为共同发明人，与迈克尔·卡斯特 Michael Gastner 一起，发明了一种可以产生密度均衡地图 Density-equalizing maps 或统计地图 Cartograms的方法，该方法构成了Worldmapper网站的基础。他们的工作在2004年美国总统大选后受到关注，成为了当时被广泛传播的一种选举结果地图的基础，（他们）根据各州的人口数调整了州的规模，以便更准确地了解每个党派的选民投票人数。&lt;br /&gt;
&lt;br /&gt;
*'''克里斯托弗·大卫·摩尔 Cristopher David Moore'''&lt;br /&gt;
克里斯托弗·大卫·摩尔 Cristopher David Moore，也称为克里斯·摩尔 Cris Moore 是美国计算机科学家，数学家和物理学家。他是圣达菲研究所的驻校教师，曾任新墨西哥大学 University of New Mexico 的正教授。&lt;br /&gt;
[[File:Cristopher_David_Moore.png|400px|thumb|Cristopher David Moore，圣达菲研究所的驻校教师|center]]&lt;br /&gt;
&lt;br /&gt;
1993年，Moore 发现了一种新颖的解决三体问题的方法，表明在牛顿力学中，三个等质量的物体有可能沿着一条八字形曲线、在同一条轨道相互跟随。Moore 在网络科学领域也很活跃，在该领域有许多著名的出版物。在与Clauset和Mark Newman的合作中，Moore开发了复杂网络的层次聚类概率模型，并表明他们的模型可以在面对网络连接结构发生变化时可靠地预测聚类结果。&lt;br /&gt;
&lt;br /&gt;
*'''亚伦·克劳斯特 Aaron Clauset '''&lt;br /&gt;
Aaron Clauset是一位美国计算机科学家，致力于网络科学，机器学习和复杂系统领域。目前，他在科罗拉多大学博尔德分校 University of Colorado Boulder 教授计算机科学，也是圣菲研究所的外部教员。&lt;br /&gt;
[[File:Aaron_Clauset.png|400px|thumb|  Aaron Clauset，圣菲研究所的外部教员|center]]&lt;br /&gt;
&lt;br /&gt;
Clauset因与Cosma Shalizi和Mark Newman进行的合作研究而闻名，他们针对经验数据中是否存在幂律模式开发了严格的统计检验，并且证明了许多宣称符合幂律分布的网络实际上并不是幂律分布。他还因开发检测复杂网络中的社区结构算法的工作而著称，特别是和Newman、Moore合作发展的网络层次聚类模型。在其他方面，Clauslet 与麦克斯韦·扬 Maxwell Young 、克里斯蒂安·斯克雷德·格莱蒂奇 Kristian Skrede Gleditsch 共同完成了一些独特发现：世界范围内恐怖事件发生的频率和严重性服从幂律分布。&lt;br /&gt;
&lt;br /&gt;
2015年，Clauset 因开发和评估一种网络结构特征的新方法而获得了美国国家科学基金会颁发的著名的CAREER奖。2016年，Clauset因在网络结构方面（包括Internet映射，推断缺失链接和社区结构），以及对人类冲突和社会分层所做的启发性分析方面做出的贡献而获得网络科学学会颁发的网络科学领域的Erdös-Rényi奖。&lt;br /&gt;
&lt;br /&gt;
==参考资料==&lt;br /&gt;
*汪小帆,李翔,陈关荣.《网络科学导论》.北京：高等教育出版社,2012年：178-186&lt;br /&gt;
*吕琳媛,周涛.《链路预测》.北京：高等教育出版社,2013年：57-93&lt;br /&gt;
*吕琳媛,任晓龙,周涛.《网络链路预测：概念与前沿》[J].《中国计算机学会通讯》,2016年,第4期&lt;br /&gt;
*Clauset A, Moore C, Newman M E J. Hierarchical structure and the prediction of missing links in networks [J]. Nature, 2008,453(7191): 98-101.&lt;br /&gt;
*&amp;lt;ref name=&amp;quot;&amp;quot;&amp;gt;Sørensen, T, Sørensen, T A, Sørensen, T J (1948) [https://pattern.swarma.org/paper?id=ea7f2902-6e74-11ea-9db3-0242ac1a0005 A method of establishing groups of equal amplitude in plant sociology based on similarity of species content and its application to analyses of the vegetation on Danish commons].&amp;lt;/ref&amp;gt;&lt;br /&gt;
*Link Prediction Group 网站：http://www.linkprediction.org/&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
*链接预测可用于分析网络将如何发展，或者在给定信息不完整情况下来发现“丢失”的链接，对于这个问题，有研究者提出了一种新的，结合广义群贴近度中心性和半值相互作用指数的拟局部方法（即考虑半径k内节点的方法），详见 [https://swarma.org/?p=18249 《链路预测的博弈算法》]&lt;br /&gt;
[[File:链路预测的博弈算法.jpg|400px|thumb|[https://swarma.org/?p=18249 《链路预测的博弈算法》]|center]]&lt;br /&gt;
*深度学习已经成功地在图像识别、语音识别、自然语言处理、游戏与博弈等领域取得了突飞猛进的发展，并渗透到了我们的日常生活中。那么，我们有没有可能将这种技术借剪到复杂网 络的研究之中呢？近年来，人们凭借着网络嵌入（Network Embedding）、图卷积神经网络（Graph Convolutional Neural Network）、图注意力模型（Graph Attention Network）等新技术，已经开发了若干图结构上的深度学习算法，并取得了一定的成功应用。北师大系统科学学院教授、博导张江老师亲授[https://campus.swarma.org/play/coursedetail?id=10504 《当复杂网络遇上机器学习》]，将对这些算法以及应用，包括各式各样的网络嵌入算法、节点分类问题、链路预测问题、图分类问题、网络动力学预测问题等做一简单介绍，并对网络上的深度学习问题进行了展望。&lt;br /&gt;
[[File:当复杂网络遇上机器学习.png|400px|thumb|[https://campus.swarma.org/play/coursedetail?id=10504 《当复杂网络遇上机器学习》]|center]]&lt;br /&gt;
*网络上的注意力模型（Graph Attention Model）是一种通用的网络嵌入算法，它能够在节点分类、链路预测等问题上得到极高的精度。它可以模仿一个机器头对网络中的节点进行信息读取和分析，然后将综合的结果放到节点的向量中的过程。[https://campus.swarma.org/play/coursedetail?id=10385 《网络上的注意力模型》]课程将详细介绍这一模型及其应用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''''本中文词条由[[用户:木子二月鸟|木子二月鸟]]用户参与编译，  [[用户: 苏格兰| 苏格兰]]用户审校，欢迎在讨论页面留言'''''。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''本词条内容源自wikipedia及公开资料，遵守 CC3.0协议。'''&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E9%93%BE%E8%B7%AF%E9%A2%84%E6%B5%8B&amp;diff=7631</id>
		<title>链路预测</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E9%93%BE%E8%B7%AF%E9%A2%84%E6%B5%8B&amp;diff=7631"/>
		<updated>2020-05-10T14:19:54Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：/* 基于相似性的链路预测 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{#seo:|keywords=链路预测 Link Prediction  |description=通过已知的网络节点以及网络结构等信息，预测网络中尚未产生连边的两个节点之间产生连接的可能性。 }}&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
'''链路预测 Link Prediction'''是指如何通过已知的网络节点以及网络结构等信息，预测网络中尚未产生连边的两个节点之间产生连接的可能性。这种预测既包含了对未知链接 Existing yet unknown link，也称丢失链接 Missing link 的预测，也包含了对未来链接 Future link 的预测。&lt;br /&gt;
&lt;br /&gt;
链路预测是将复杂网络与信息科学联系起来的重要桥梁之一，它所要处理的是信息科学中最基本的问题——缺失信息的还原与预测。链路预测相关研究不仅能够推动网络科学和信息科学理论上的发展，而且具有巨大的实际应用价值，譬如可以知道蛋白质相互作用实验、进行在线社交推荐、找出交通传输网络中有特别重要作用的连边等。&lt;br /&gt;
&lt;br /&gt;
==研究方法==&lt;br /&gt;
===基于相似性的链路预测===&lt;br /&gt;
&lt;br /&gt;
*基于局部信息的相似性指标&lt;br /&gt;
&lt;br /&gt;
社会网络分析中经典的三元闭包 Triadic closure 原则指出，如果A、B	两个人拥有一个共同的朋友C，那么这两个人今后也很有可能成为朋友，从而使得3个节点构成一个闭合的三角形ABC。对于一般的网络，我们可以把这一原则推广如下：两个节点的共同邻居越多，这两个节点就越相似，从而更倾向于相互连接。最简单的基于'''共同邻居 Common neighbors''' 的节点相似性指标定义如下：&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
s_{xy}^{CN} =  |Γ(x)| \cap |Γ(y)|&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
在相似性指标定义的基础上，还可以考虑两个节点的共同邻居的相对数量。下表列出了10种基于节点局部信息的相似性指标，第1种是计算共同邻居相似度的基本公式，其中第2至7种相似性指标是直接基于共同邻居指标的不同的规范化而得到的，表中的 k(x) = |Γ(x)| 为节点x的度。第8种指标PA是基于BA无标度网络模型中新加入节点倾向于和度大的节点相连的优先连接机制而提出的。&lt;br /&gt;
&lt;br /&gt;
第9种指标AA的基本思想是度小的共同邻居节点的贡献大于度大的共同邻居节点，因此根据共同邻居节点的度为每个节点赋予一个权重值。这一点很容易理解，例如在微博中受关注较多的人往往是某个领域的专家或名人，因此共同关注他们的人之间可能并不拥有特别相似的兴趣——一个中学生和一个企业家都有可能是姚晨的粉丝。相反，如果两个人共同关注了一个粉丝很少的人（非名人），那么说明这两个人确实具有相同的兴趣爱好或者重叠的社交圈，因此有更高概率相连。又如在推荐系统中，共同购买冷门产品的两个用户往往比共同购买热门产品的用户更相似。&lt;br /&gt;
[[File:Table1.png|600px|thumb|10种基于节点局部信息的相似性指标|center]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
第2个指标Salton指标&amp;lt;ref name=&amp;quot;&amp;quot;&amp;gt;Salton G, McGill M J () [https://pattern.swarma.org/paper?id=15e10152-92c8-11ea-81db-0242ac1a0005 Introduction to Modern Information Retrieval].&amp;lt;/ref&amp;gt;又称余弦相似性，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{|Γ(x)| \cap |Γ(y)|}{\sqrt{k(x)k(y)}}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第3个指标Jaccard指标&amp;lt;ref name=&amp;quot;&amp;quot;&amp;gt;Jaccard P. () [https://pattern.swarma.org/paper?id=70c8a48a-92c8-11ea-9f7f-0242ac1a0005 Etude de la distribution florale dans une portion des Alpes et du Jura].&amp;lt;/ref&amp;gt;是于100多年前由Jaccard提出的，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{|Γ(x)| \cap |Γ(y)|}{|Γ(x)| \bigcup  |Γ(y)|}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第4个指标Sorensen指标&amp;lt;ref name=&amp;quot;&amp;quot;&amp;gt;Sørensen, T, Sørensen, T A, Sørensen, T J (1948) [https://pattern.swarma.org/paper?id=ea7f2902-6e74-11ea-9db3-0242ac1a0005 A method of establishing groups of equal amplitude in plant sociology based on similarity of species content and its application to analyses of the vegetation on Danish commons].&amp;lt;/ref&amp;gt;常用于生态学研究，其定义为 &amp;lt;math&amp;gt;s{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{kx + ky}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第5个指标大度节点有利指标&amp;lt;ref name=&amp;quot;&amp;quot;&amp;gt;E. Ravasz,A. L. Somera,D. A. Mongru,Z. N. Oltvai,A. -L. Barabasi (2002) [https://pattern.swarma.org/paper?id=6eb98b7e-6e91-11ea-81b9-0242ac1a0005 Hierarchical organization of modularity in metabolic networks].arXiv:0209244.&amp;lt;/ref&amp;gt;（Hub promoted index，HPI）被用来定量刻画新陈代谢网络中每对反应物的拓扑相似程度，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{min\{k_x,k_y\}}&amp;lt;/math&amp;gt;，由于分母只由度较小的节点决定，在此定义下可知大度节点（hub）与其他节点之间更容易具有高的相似性。&lt;br /&gt;
&lt;br /&gt;
第6个指标大度节点不利指标&amp;lt;ref name=&amp;quot;&amp;quot;&amp;gt;Tao Zhou,Linyuan Lu,Yi-Cheng Zhang (2009) [https://pattern.swarma.org/paper?id=7a2b26ba-6e92-11ea-9ee2-0242ac1a0005 Predicting Missing Links via Local Information].arXiv:0901.0553.&amp;lt;/ref&amp;gt;（hub depressed index, HDI）定义与HPI相似，只是分母取两端节点度的最大值，即 &amp;lt;math&amp;gt;s_{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{max\{k_x,k_y\}}&amp;lt;/math&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
第7个指标LHN-I指标&amp;lt;ref name=&amp;quot;&amp;quot;&amp;gt;E. A. Leicht,Petter Holme,M. E. J. Newman (2005) [https://pattern.swarma.org/paper?id=71890c4e-6f0e-11ea-b30e-0242ac1a0005 Vertex similarity in networks].arXiv:0510143.&amp;lt;/ref&amp;gt;是由Leicht，Holme和Newman提出，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{{k_xk_y}}&amp;lt;/math&amp;gt;，其中分母&amp;lt;math&amp;gt;k_xk_y&amp;lt;/math&amp;gt; 正比于节点&amp;lt;math&amp;gt;v_x&amp;lt;/math&amp;gt;和节点&amp;lt;math&amp;gt;v_y&amp;lt;/math&amp;gt;共同邻居数的期望值，即 &amp;lt;math&amp;gt;E( |Γ(x)| \cap |Γ(y)|)&amp;lt;/math&amp;gt;。在下面这篇文献中，Leicht等人同时提出了另一个基于路径的指标，为了有所区别，将此局部指标命名为LHN-I指标，将基于路径的指标命名为LHN-II指标：&lt;br /&gt;
&lt;br /&gt;
第8个指标PA（preferential attachment）是基于BA无标度网络模型中新加入节点倾向于和度大的节点相连的优先连接机制而提出的，在这种机制的链路预测中，每一步首先去除一条链接，然后再添加一条链接，新链接连接节点&amp;lt;math&amp;gt;v_x&amp;lt;/math&amp;gt;和&amp;lt;math&amp;gt;v_y&amp;lt;/math&amp;gt;的概率就正比于两节点度的乘积，由此可以定义两节点间的优先连接相似性：&amp;lt;math&amp;gt;s_{xy}= k_xk_y&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第9个指标AA（Adamic-Adar）&amp;lt;ref name=&amp;quot;&amp;quot;&amp;gt;Adar, Adamic L A, E (2003) [https://pattern.swarma.org/paper?id=e4726a06-6f2d-11ea-8846-0242ac1a0005 Friends and neighbors on the web].Social networks.25.(211--230)&amp;lt;/ref&amp;gt;的基本思想是度小的共同邻居节点的贡献大于度大的共同邻居节点，因此根据共同邻居节点的度为每个节点赋予一个权重值。这一点很容易理解，例如在微博中受关注较多的人往往是某个领域的专家或名人，因此共同关注他们的人之间可能并不拥有特别相似的兴趣——一个中学生和一个企业家都有可能是姚晨的粉丝。相反，如果两个人共同关注了一个粉丝很少的人（非名人），那么说明这两个人确实具有相同的兴趣爱好或者重叠的社交圈，因此有更高概率相连。又如在推荐系统中，共同购买冷门产品的两个用户往往比共同购买热门产品的用户更相似。AA指标根据共同邻居节点的度为每个节点赋予一个权重值，该权重等于该节点的度的对数分之一，即AA指标的定义为：&amp;lt;math&amp;gt;s_{xy}=\sum _{z\in \Gamma (x)\bigcap \Gamma (y)}\frac{1}{logk_z}&amp;lt;/math&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
第10种指标RA是受网络资源分配过程的启发，周涛等人提出的“'''资源分配指标 Resource allocation'''”，其与AA指标有异曲同工之妙。RA和AA指标最大的区别就在于赋予共同邻居节点权重的方式不同，前者是以 1/k 的形式递减，后者是以 1/logk 的形式递减。可见，当网络的平均度较小时，RA和AA差别不大；但是当平均度较大时，就有很大的区别了。研究显示，RA指标在刻画加权网络和社区挖掘应用中的表现胜过AA指标，图灵奖得主Hopdroft的一篇论文也显示，可以利用社区等中观结构信息改进局部指标，其中RA指标改进后的效果最佳。&lt;br /&gt;
&lt;br /&gt;
*基于路径的相似性指标&lt;br /&gt;
&lt;br /&gt;
基于共同邻居的相似性指标的优势在于计算复杂度较低，但是由于使用的信息非常有限，预测精度受到限制，因此发展出了基于路径的相似性指标，主要有3个，分别是局部路径指标 Local path 、Katz指标和LHN-II指标。&lt;br /&gt;
&lt;br /&gt;
1.局部路径指标&lt;br /&gt;
&lt;br /&gt;
周涛等人在共同邻居的基础上考虑三阶路径的因素，提出了基于局部路径的相似性指标，其定义为 &amp;lt;math&amp;gt; S=A^2+\alpha A^3&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 为可调参数，A 表示网络的邻接矩阵， &amp;lt;math&amp;gt;(A^3)_{xy}&amp;lt;/math&amp;gt;表示节点 &amp;lt;math&amp;gt;V_x&amp;lt;/math&amp;gt; 和 &amp;lt;math&amp;gt;V_y&amp;lt;/math&amp;gt; 之间长度为3的路径数目。当&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; = 0时，LP指标就退化为 CN 指标。 CN 指标本质上也可看成基于路径的指标，只是它仅考虑了二阶路径数目。局部路径指标可以扩展为更高阶的情形，即考虑n阶路径的情况：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt; S^n=A^2+\alpha\cdot A^3+\alpha^2\cdot A^4+\cdots +\alpha^{n-2}\cdot A^n &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
随着 n 的增加，局部路径指标的计算复杂度越来越大。一般而言，考虑 n 阶路径的计算复杂度为O(N&amp;lt;k&amp;gt;^n)。但是当 n 趋于无穷大的时候，局部路径指标相当于考虑网络全部路径的Katz指标，此时计算量反而有可能下降，因为可转变为计算矩阵的逆。&lt;br /&gt;
&lt;br /&gt;
2.Katz指标&lt;br /&gt;
&lt;br /&gt;
Katz指标考虑了所有网络的路径，因此其定义为：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S_{xy}=\sum_{l=1}^{\infty }\alpha^l\cdot\left |  paths_{x,y}^{&amp;lt;l&amp;gt;} \right |= \alpha A_{xy}+\alpha^2\cdot (A^2)_{xy}+\alpha^3\cdot (A^3)_{xy}+\cdots  &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\alpha &amp;gt; 0&amp;lt;/math&amp;gt; 为控制路径权重的可调参数，&amp;lt;math&amp;gt;\left |  paths_{x,y}^{&amp;lt;l&amp;gt;} \right |&amp;lt;/math&amp;gt;表示连接节点 &amp;lt;math&amp;gt;V_x&amp;lt;/math&amp;gt;和  &amp;lt;math&amp;gt;V_y&amp;lt;/math&amp;gt; 的路径中长度为 l 的路径数。要使上述级数收敛，则参数&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 应小于邻接矩阵最大特征值的倒数，此定义还可以表示为：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S = (I - \alpha\cdot A)^{-1} - I&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
显然，当参数&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 很小时，高阶路径的贡献也较小，使得 Katz 指标的预测结果接近于局部路径指标。&lt;br /&gt;
&lt;br /&gt;
3.LHN-II指标&lt;br /&gt;
&lt;br /&gt;
LHN-II 指标是 Leicht，Holme 和 Newman 提出的另一种相似性计算方法，他的基本思想是基于'''一般等价 Regular equivalence''' 提出的。与结构等价不同，一般等价的定义更广泛。在一般等价的定义下，如果两个节点所连接的节点之间相似，那么这两个节点也相似，即使它们之间没有共同的邻居节点。&lt;br /&gt;
&lt;br /&gt;
下图给出了一个简单的例子来帮助我们理解结构等价和一般等价的区别。根据结构等价的定义，在公司A内部，由于员工a和员工b都认识员工e和员工f（即它们有两个共同邻居节点），于是称员工a和员工b是结构等价的。同理，员工e和员工f也是结构等价的，同样地，在公司B中，员工c和员工d是结构等价的，员工g和员工h也是结构等价的。现在考虑员工a和员工c是否相似？根据一般等价的定义，由于员工a连接的节点e、f与员工c连接的节点g、h分别是相似的，那么我们可以认为员工a和员工c也是相似的，同理，在一般等价的意义下，员工b和员工d也是相似。从这个例子可以看出，结构相似性或称结构等价更强调的是两个节点是否在同一个环境下，也就是说是否连接了相同的节点；然而一般等价考虑的是这两个节点是否处于同样的角色，即使他们没有相同的邻居节点，但是由于各自的邻居节点之间本身相似，这两个节点也相似。一般等价意义下的相似性是LHN-II指标的核心。&lt;br /&gt;
&lt;br /&gt;
[[File:一般等价和结构等价示例.png|600px|thumb|一般等价和结构等价示例（图中实线表示连接，虚线表示相似关系）|center]]&lt;br /&gt;
&lt;br /&gt;
从一般等价的角度考虑，LHN-II指标认为如果两个节点的邻居节点之间是相似的，那么这两个节点也是相似的。它与Katz指标的区别主要是把Katz指标中的&amp;lt;math&amp;gt; (A^{n})_{xy} &amp;lt;/math&amp;gt;变成 &amp;lt;math&amp;gt;  (A^{n})_{xy}&amp;lt;/math&amp;gt; 的期望值，注意到 &amp;lt;math&amp;gt; (A^{n})_{xy}&amp;lt;/math&amp;gt; 的期望值为 &amp;lt;math&amp;gt; E\left [ (A^l)_{xy} \right ]=\frac{k_xk_y}{M}\lambda _1^{l-1}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\lambda_1&amp;lt;/math&amp;gt;为矩阵A的最大特征值，则LHN-II指标的表达式如下：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 S_{xy}^{LHN2}=\delta _{xy} + \sum_{l=1}^{\infty }\Phi ^l \frac{(A^l)_{xy}}{E\left [ (A^l)_{xy} \right ]}&lt;br /&gt;
=\delta _{xy} + \frac{2M}{k_xk_y}\sum_{l=1}^{\infty }\Phi ^l\lambda _1^{1-l}(A^l)_{xy}&lt;br /&gt;
=\left [ 1 - \frac{2 M \lambda_1}{k_xk_y} \right ]\delta _{xy} + \frac{2 M \lambda_1}{k_xk_y}\left [ (I-\frac{\Phi}{\lambda_1} A )^{-1} \right ]_{xy}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\delta _{xy}&amp;lt;/math&amp;gt;为 Kronecker &amp;lt;math&amp;gt;\delta&amp;lt;/math&amp;gt; 函数，&amp;lt;math&amp;gt; \Phi&amp;lt;/math&amp;gt; 为取值小于1的参数。上式最后一个等式的第一项是可以去掉的对角阵，从而相似性矩阵可以写为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S=2M\lambda_1D^{-1}(I-\frac{\Phi A}{\lambda_1})^{-1}D^{-1}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中''D''为度值矩阵，&amp;lt;math&amp;gt;D_{xy} = \delta_{xy} \cdot k_{x}&amp;lt;/math&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
*基于随机游走的节点相似性指标&lt;br /&gt;
&lt;br /&gt;
还有相当数量的相似性指标是基于随机游走过程定义的，包括'''平均通勤时间 Average commute time''' 、'''Cos+指标'''、'''有重启的随机游走 Random walk with restart'''、'''SimRank'''指标、'''局部随机游走指标 Local random walk''' 和'''有叠加效应的随机游走指标 Superposed random walk'''等。&lt;br /&gt;
&lt;br /&gt;
1.平均通勤时间 ACT &lt;br /&gt;
&lt;br /&gt;
设&amp;lt;math&amp;gt;m(x,y)&amp;lt;/math&amp;gt; 为一个随机粒子从节点x到节点y平均需要走的步数，那么节点x和y的平均通勤时间定义为：&amp;lt;math&amp;gt;n(x , y) = m(x , y) + m(y , x) &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其数值解可通过求该网络拉普拉斯矩阵&amp;lt;math&amp;gt;L&amp;lt;/math&amp;gt; 的伪逆&amp;lt;math&amp;gt; L^+&amp;lt;/math&amp;gt; 获得，即 &amp;lt;math&amp;gt;n(x,y)=M(l^+_{xx} +l^+_{yy} - 2l^+_{xy})&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;l^{+}_{xy}&amp;lt;/math&amp;gt;表示矩阵&amp;lt;math&amp;gt;L^+ &amp;lt;/math&amp;gt;中相应位置的元素。如果两个节点的平均通勤时间越小，那么两个节点越进阶。由此，定义基于ACT的相似性为（在此可忽略常数M）&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{ACT}=\frac{1}{l^+_{xx} +l^+_{yy} - 2l^+_{xy}}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
2.余弦相似性指标 Cos+指标&lt;br /&gt;
&lt;br /&gt;
在由向量&amp;lt;math&amp;gt;v_x = \Lambda ^{1/2}U^{T}e_{x}&amp;lt;/math&amp;gt;展开的欧式空间内，&amp;lt;math&amp;gt;L^+ &amp;lt;/math&amp;gt;中的元素&amp;lt;math&amp;gt;l^{+}_{xy}&amp;lt;/math&amp;gt;可表示为两向量&amp;lt;math&amp;gt;v_x&amp;lt;/math&amp;gt;和&amp;lt;math&amp;gt;v_y&amp;lt;/math&amp;gt;的内积，即&amp;lt;math&amp;gt; l^{+}_{xy} = v_{x}^{T} v_y&amp;lt;/math&amp;gt;，其中&amp;lt;math&amp;gt;U&amp;lt;/math&amp;gt;是一个标准正交矩阵，由&amp;lt;math&amp;gt;L^+&amp;lt;/math&amp;gt;特征向量按照对应的特征根从大到小排列，&amp;lt;math&amp;gt;\Lambda&amp;lt;/math&amp;gt;为以特征根为对角元素的对角矩阵，&amp;lt;math&amp;gt;e_{x}&amp;lt;/math&amp;gt; 表示一个一维向量且只有第x个元素为1，其他都为0。由此定义余弦相似性如下：&lt;br /&gt;
&lt;br /&gt;
s_{xy}^{cos+}=cos(x,y)^+=\frac{l_{xy}^+}{\sqrt{l^+_{xx} \cdot l^+_{yy}}}&lt;br /&gt;
&lt;br /&gt;
3.重启的随机游走 RWR&lt;br /&gt;
&lt;br /&gt;
这个指标可以看成是PageRank 算法的拓展应用。它假设随机游走粒子在每走一步的时候都以一定概率返回初始位置。设粒子返回概率为 1-c，&amp;lt;math&amp;gt;P&amp;lt;/math&amp;gt; 为网络的马尔科夫概率转移矩阵，其元素 &amp;lt;math&amp;gt;P_{xy} = a_{xy}/k_{x} &amp;lt;/math&amp;gt;表示节点x处的粒子下一步走到节点y的概率。其中如果节点x和节点y相连，则&amp;lt;math&amp;gt;a_{xy}=1&amp;lt;/math&amp;gt;，否则&amp;lt;math&amp;gt;a_{xy}=0&amp;lt;/math&amp;gt;。某一粒子初始时刻在节点x处，那么t+1时刻该粒子到达网络各个节点的概率向量为&lt;br /&gt;
&amp;lt;math&amp;gt;q_{x}(t+1) = c \cdot P^{T}q_{x}(t) + (1-c) e_{x}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;e_{x}&amp;lt;/math&amp;gt;表示初始状态（其定义与Cos+中相同），上式的稳态解为&amp;lt;math&amp;gt;q_{x} = (1-c)(I-cP^{T})^{-1}e_{x}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中元素&amp;lt;math&amp;gt;q_{xy}&amp;lt;/math&amp;gt;为从节点x出发的粒子最终有多少概率走到节点y。由此定义RWR相似性如下：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{RWR} = q_{xy} + q_{yx} &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
4.SimRank指标 SimR&lt;br /&gt;
&lt;br /&gt;
它的基本假设是，如果两节点所连接的节点相似，那么这两个节点就相似。其自洽定义式为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{simR}=C\frac{\sum_{v_z\in \Gamma (x)}\sum_{{v_z}'\in \Gamma (y)}s_{zz'}^{simR}}{k_xk_y}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中假定 &amp;lt;math&amp;gt;s_{xx} =1, C \in [0,1] &amp;lt;/math&amp;gt;为相似性传递时的衰减参数。&lt;br /&gt;
&lt;br /&gt;
SimR指标同时考虑了结构等价和一般等价。当节点x的邻居z同时也是节点y的邻居时，该指标考虑了结构等价；当节点x不等于节点y时，该指标概率了一般等价。可以证明，SimR指标可以用来描述两个分别从节点x和y出发的粒子平均过多久会相遇。&lt;br /&gt;
&lt;br /&gt;
5.局部随机游走指标 LRW&lt;br /&gt;
&lt;br /&gt;
上述4种随机游走指标是基于全局的随机游走，这类指标往往计算复杂度很高，因此很难在大规模网络上应用。刘伟平和吕琳媛提出了一种基于网络局部随机游走的相似性指标LRW，它只考虑有限步数的随机游走过程。一个粒子 t 时刻从节点x出发，定义&amp;lt;math&amp;gt;π_{xy} (t) &amp;lt;/math&amp;gt;为 t+1 时刻这个粒子正好走到节点y的概率，那么可得到系统演化方程：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\pi_{x} (t + 1) = P^T\pi_{x}(t)，t=0,1,…&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\pi_{x}(0) &amp;lt;/math&amp;gt;为一个&amp;lt;math&amp;gt;Nx1 &amp;lt;/math&amp;gt;的向量，只有第x 个元素为1，其他为0，即&amp;lt;math&amp;gt;\pi_{x}(0) =e_x&amp;lt;/math&amp;gt;。设定各个节点的初始资源分布为&amp;lt;math&amp;gt;q_x&amp;lt;/math&amp;gt;，那么基于t步随机游走的相似性为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{LRW} = q_{xy} + q_{yx}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
6.叠加的局部随机游走指标 SRW&lt;br /&gt;
&lt;br /&gt;
这个指标给邻近目标节点的点更多的机会与目标节点相连，充分考虑了很多真实网络连接上的局域性特点，它是在LRW的基础上，将t步及其以前的结果加总，便得到SRW的值，即：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{SRW}(t)=\sum_{t}^{l=1}s_{xy}^{LRW}(l) = q_x\sum_{t}^{l=1}\pi_{xy}(l) + q_y\sum_{t}^{l=1}\pi_{yx}(l)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===基于似然分析的链路预测===&lt;br /&gt;
&lt;br /&gt;
基于相似性的链路预测方法，是最简单的一种分析框架，除此之外，还有另一种最复杂的链路预测分析框架——基于似然分析的链路预测。这个框架本身远远复杂于基于相似性的框架，而且框架中的每一个组成成分自身都非常复杂，但这个框架下衍生出的算法除了给出链路预测的结果之外，还给出了我们对于网络结构的深刻洞见，例如“'''层次结构模型 Hierachical structure model'''”给出了网路层次组织形态的定量刻画，“'''随机分块模型 Stochastic block model'''”类似于社区分解一样把网络划分成了若干子块。这些对理解网络结构特征方面的贡献，是基于相似性的框架所不能提供的。&lt;br /&gt;
&lt;br /&gt;
基于似然分析的链路预测的基本思路是：根据网络结构的产生和组织方式以及目前已经观察到的链路计算网络的似然值，并认为真实的网络使得网络似然值最大，然后再根据网络似然最大化计算每一对未连接的节点产生连边的可能性。&lt;br /&gt;
&lt;br /&gt;
*层次结构模型 HSM&lt;br /&gt;
&lt;br /&gt;
层次结构模型假设真实的网络都存在某种层次性，网络的连接则可看作是这种内在层次结构的反映。该方法的计算步骤如下：&lt;br /&gt;
&lt;br /&gt;
1.一个N个节点的网络可以用一个包含N个叶子节点的族谱树表示，这N个叶子节点将由N-1个非叶子节点连接起来，其中每个非叶子节点都有一个概率值，则两个叶子节点连接的概率就等于他们最近共同祖先节点的概率值。给定一个族谱树，将网络的似然值最大化，就可以得到非叶子节点的概率值，并由此计算出这一个族谱树所对应的网络最大的似然值。&lt;br /&gt;
&lt;br /&gt;
2.使用马尔科夫链蒙特卡洛方法对网络不同的族谱树进行抽样，使得每个族谱树出现的频次正比于该树对应的最大的网络似然值。两个节点连边的概率就等于所有抽样出来的族谱树中两个节点连边概率的平均值。注意似然高的族谱树会出现多次，因此对这个平均概率的贡献也大。&lt;br /&gt;
&lt;br /&gt;
3.把平均连边概率看做是相似性框架中的相似性指标&amp;lt;math&amp;gt;s_{xy}&amp;lt;/math&amp;gt;，按照这个值从大到小排序，排在前面的就是预测的连边。&lt;br /&gt;
&lt;br /&gt;
需要指出的是，层次结构模型在处理具有明显层次结构的网络（如恐怖袭击网络和草原食物链）时具有较高的精确度，但在处理一般性网络时效果并不一定突出。&lt;br /&gt;
&lt;br /&gt;
*随机分块模型 SBM&lt;br /&gt;
&lt;br /&gt;
与层次结构模型的思想类似，随机分块模型假设网络中的节点可以被分为若干集合，两个节点间连接的概率只与相应的集合有关。换句话说，同一个群众所有节点的地位是相同的。随机分块模型特别适合刻画节点所属群的成员身份对于其连接行为有关键影响的情况，例如，著名的“角色模型”就包含了随机分块模型的理念。&lt;br /&gt;
&lt;br /&gt;
随机分块模型的效果要好于层次结构模型。同时，该方法还可以剔除网络的错误连边，如纠正蛋白质相互作用网络中的错误连边。&lt;br /&gt;
&lt;br /&gt;
*闭路模型 Loop model&lt;br /&gt;
&lt;br /&gt;
似然分析的更一般的框架是：给定一个网络系统，特定网络哈密顿量的负指数被统计分配函数归一化后，就得到这个网络出现的似然，一条未被观察到的连边存在的可能性就等于添加这条连边后网络的似然值。闭路模型考虑网络结构形成中的“局部性原则”，并由此定义了网络的哈密顿量。实验表明，闭路模型的预测精度大于层次结构模型和随机分块模型。&lt;br /&gt;
&lt;br /&gt;
===基于机器学习的链路预测===&lt;br /&gt;
&lt;br /&gt;
用机器学习的思路进行链路预测，主要分为基于特征分类方法、基于概率图模型方法和基于矩阵分解方法三大类。&lt;br /&gt;
&lt;br /&gt;
*基于特征分类方法&lt;br /&gt;
&lt;br /&gt;
网络中的链路预测问题可以看成机器学习中的分类问题，其中每个数据点对应一对节点之间关系的标记，假定两个节点之间存在连边，则数据点的值为+1，否则为-1。特征选取是分类问题中最重要的问题之一，目前研究较多的主要包括基于节点与边的属性特征和基于节点所处网络的拓扑结构特征（如CN、AA、Katz、最短路径）等。哈桑 Hasan 等人提取合著网络中科学家研究领域的关键词作为特征，用监督学习中一些常用的分类算法（如决策树、K近邻法、多层感知器、支持向量机、径向基网络）对缺失的连边进行较为精准的预测，其中以支持向量机方法表现最佳。&lt;br /&gt;
&lt;br /&gt;
*基于概率图模型&lt;br /&gt;
&lt;br /&gt;
基于概率图模型的链路预测方法使用图模型来表达节点之间的连边概率，根据模型中概率依赖关系，可分为有向无环的贝叶斯网络和无向的马尔科夫网络。随机分块模型和层次结构模型分别是典型的基于贝叶斯网络和基于马尔科夫网络的链路预测方法。基于概率图模型的链路预测方法有很多，典型的还有有监督随机游走链路预测算法，将网络结构信息与节点和连边的属性信息结合起来，给每条边分配不同的转移概率。与其他有监督的机器学习方法相比，该算法无须知道网络的特征和相关的领域知识。&lt;br /&gt;
&lt;br /&gt;
*基于矩阵分解&lt;br /&gt;
&lt;br /&gt;
基于矩阵分解的链路预测方法是基于网络邻接矩阵的代数谱变换而得到的方法，来预测网络中链路的存在性和链路的权值。相比其他几种机器学习方法，该方法要学习的参数少很多，但计算复杂度较高。链路预测问题可以视为邻接矩阵填充问题，并可以通过双线性回归模型将节点和链路的显特征和隐特征结合起来用矩阵分解方法解决。边缘去噪模型将根据给定关系矩阵求未知边或丢失边的问题变成一个矩阵降噪去噪问题。&lt;br /&gt;
&lt;br /&gt;
关于不同的链路预测研究方法的分类可以参考下表：&lt;br /&gt;
[[File:Link preditction method.png|600px|thumb|三类不同的链路预测方法（*表示该方法含有参数）|center]]&lt;br /&gt;
&lt;br /&gt;
==应用场景==&lt;br /&gt;
链路预测有着广泛的应用场景：在生物领域，利用蛋白质间相互作用关系的结构信息进行链路预测，可以为实验的测定提前提供参考依据，从而降低实验成本、提高成功率；在社交网络领域，链路预测可以对社交网络中的好友关系、朋友推荐进行预测，从而提高用户对社交网站的体验满意度和使用黏性；在电子商务领域，除了传统的协同过滤推荐算法外，利用网络结构信息（如网络三角形结构）等特征进行商品推荐也取得了显著的优势；此外，通过识别隐藏的链边或异常的链边对信息不完全或含有噪音的网络进行重构，可以提高网络的传输能力，这对于航空网络重构有很大的启发意义。&lt;br /&gt;
[[File:Figure2.png|400px|thumb|链路预测应用场景示意图（图片来自网络）|center]]&lt;br /&gt;
&lt;br /&gt;
除此之外，链路预测的算法和思想通过一些变换还可以用来解决一些看似没有太大关系的问题。例如，对疾病信号和股票指数的预测。基于链路预测的思想和方法，我们还可以设计基于节点相似性的社团划分以及对网络演化模型的定量化评估方法。链路预测还可以帮助提高节点标签预测的精度，特别是在已知标签节点稀疏的情况下效果显著。这一方法可以应用于判断一篇学术论文的类型，判断一本书的政治态度（中立、自由派或保守派），或者判断一个手机用户是否产生了更换电信运营商的念头。&lt;br /&gt;
&lt;br /&gt;
==代表人物==&lt;br /&gt;
*'''吕琳媛'''&lt;br /&gt;
吕琳媛主要研究方向为复杂网络信息挖掘领域，包括海量信息导航、挖掘、推荐和预测。目前担任阿里巴巴复杂科学研究中心副主任，中欧联合实验室执行主任，中国工业与应用数学学会复杂网络与系统控制专业委员会委员，杭州市特聘专家。&lt;br /&gt;
[[File:Lvlinyuan.png|400px|thumb|吕琳媛，阿里巴巴复杂科学研究中心副主任|center]]&lt;br /&gt;
&lt;br /&gt;
近年来主持/参与国家级项目5项（2016年获得国家自然科学基金优秀青年基金），省部级项目4项，横向课题4项。 在相关领域发表学术论文 50余篇，其中SCI论文39篇，总影响因子122，发表期刊包括Physics Reports，PNAS，Nature Communications等国际知名学术期刊。三篇论文入选ESI全球Top-1%高引用论文，论文SCI引用1200余次，谷歌学术引用3000余次，其中9篇论文引用超过100次。2013年出版学术专著《链路预测》获得第四届中国大学出版社图书奖优秀学术著作一等奖。申请发明专利12项。2015年荣获浙江省杰出青年基金，2014年荣获中国计算机学会自然科学二等奖，中国网络科学论坛青年希望奖，首届CCF-腾讯犀牛鸟基金优秀奖。&lt;br /&gt;
&lt;br /&gt;
*'''周涛'''&lt;br /&gt;
周涛主要从事复杂性科学和大数据挖掘算法和应用研究，先后攻克推荐系统准确性-多样性困境、复杂网络链路可预测性、H指数-度-核心度关系等图挖掘领域的重要难题，成果发表在PNAS, Nature Communications, Physics Reports, KDD和ICDM等国际顶尖期刊和会议上。目前论文google总引用超过14000次，其中8篇论文入选ESI高引用论文，H指数为57，2014和2015连续两年入选Elsevier最具国际影响力中国科学家名单。&lt;br /&gt;
[[File:Zhoutao.png|400px|thumb|周涛，第十二届中国青年科技奖|center]]&lt;br /&gt;
&lt;br /&gt;
因其在科学研究上的杰出表现，2011年获得第十二届中国青年科技奖（最年轻获奖者），2011年入选四川省“百人计划”，2012年获得国家首批优秀青年科学基金资助，2013年入选国家“万人计划”首批青年拔尖人才支持计划，2014年获得四川省科技进步一等奖、中国计算机学会自然科学奖，2015年获得共青团中央授予的“最美青年科技工作者”称号，并与屠呦呦等七名个人和北斗导航等三个团队共同当选2015年度中国十大科技创新人物。&lt;br /&gt;
&lt;br /&gt;
*'''马克·纽曼 Mark Newman'''&lt;br /&gt;
Newman是一名英裔美国物理学家，也是密歇根大学 University of Michigan 物理学系的阿纳托尔·拉波特 Anatol Rapoport 杰出教授，也是圣达菲研究所 Santa Fe Institute 的外部教员。他因在复杂网络和复杂系统领域的基础性贡献而闻名，为此他被授予2014年拉格朗日奖。&lt;br /&gt;
[[File:Newman.png|400px|thumb|Mark Newman，密歇根大学物理学系阿纳托尔·拉波特杰出教授|center]]&lt;br /&gt;
&lt;br /&gt;
Newman以其对复杂网络的研究而著称，尤其是在科学家的协作模式，随机图论 Random graph theory，社区结构 Community structure，渗流理论 Percolation theory 和网络流行病学 Network epidemiology方面的工作。他作为共同发明人，与迈克尔·卡斯特 Michael Gastner 一起，发明了一种可以产生密度均衡地图 Density-equalizing maps 或统计地图 Cartograms的方法，该方法构成了Worldmapper网站的基础。他们的工作在2004年美国总统大选后受到关注，成为了当时被广泛传播的一种选举结果地图的基础，（他们）根据各州的人口数调整了州的规模，以便更准确地了解每个党派的选民投票人数。&lt;br /&gt;
&lt;br /&gt;
*'''克里斯托弗·大卫·摩尔 Cristopher David Moore'''&lt;br /&gt;
克里斯托弗·大卫·摩尔 Cristopher David Moore，也称为克里斯·摩尔 Cris Moore 是美国计算机科学家，数学家和物理学家。他是圣达菲研究所的驻校教师，曾任新墨西哥大学 University of New Mexico 的正教授。&lt;br /&gt;
[[File:Cristopher_David_Moore.png|400px|thumb|Cristopher David Moore，圣达菲研究所的驻校教师|center]]&lt;br /&gt;
&lt;br /&gt;
1993年，Moore 发现了一种新颖的解决三体问题的方法，表明在牛顿力学中，三个等质量的物体有可能沿着一条八字形曲线、在同一条轨道相互跟随。Moore 在网络科学领域也很活跃，在该领域有许多著名的出版物。在与Clauset和Mark Newman的合作中，Moore开发了复杂网络的层次聚类概率模型，并表明他们的模型可以在面对网络连接结构发生变化时可靠地预测聚类结果。&lt;br /&gt;
&lt;br /&gt;
*'''亚伦·克劳斯特 Aaron Clauset '''&lt;br /&gt;
Aaron Clauset是一位美国计算机科学家，致力于网络科学，机器学习和复杂系统领域。目前，他在科罗拉多大学博尔德分校 University of Colorado Boulder 教授计算机科学，也是圣菲研究所的外部教员。&lt;br /&gt;
[[File:Aaron_Clauset.png|400px|thumb|  Aaron Clauset，圣菲研究所的外部教员|center]]&lt;br /&gt;
&lt;br /&gt;
Clauset因与Cosma Shalizi和Mark Newman进行的合作研究而闻名，他们针对经验数据中是否存在幂律模式开发了严格的统计检验，并且证明了许多宣称符合幂律分布的网络实际上并不是幂律分布。他还因开发检测复杂网络中的社区结构算法的工作而著称，特别是和Newman、Moore合作发展的网络层次聚类模型。在其他方面，Clauslet 与麦克斯韦·扬 Maxwell Young 、克里斯蒂安·斯克雷德·格莱蒂奇 Kristian Skrede Gleditsch 共同完成了一些独特发现：世界范围内恐怖事件发生的频率和严重性服从幂律分布。&lt;br /&gt;
&lt;br /&gt;
2015年，Clauset 因开发和评估一种网络结构特征的新方法而获得了美国国家科学基金会颁发的著名的CAREER奖。2016年，Clauset因在网络结构方面（包括Internet映射，推断缺失链接和社区结构），以及对人类冲突和社会分层所做的启发性分析方面做出的贡献而获得网络科学学会颁发的网络科学领域的Erdös-Rényi奖。&lt;br /&gt;
&lt;br /&gt;
==参考资料==&lt;br /&gt;
*汪小帆,李翔,陈关荣.《网络科学导论》.北京：高等教育出版社,2012年：178-186&lt;br /&gt;
*吕琳媛,周涛.《链路预测》.北京：高等教育出版社,2013年：57-93&lt;br /&gt;
*吕琳媛,任晓龙,周涛.《网络链路预测：概念与前沿》[J].《中国计算机学会通讯》,2016年,第4期&lt;br /&gt;
*Clauset A, Moore C, Newman M E J. Hierarchical structure and the prediction of missing links in networks [J]. Nature, 2008,453(7191): 98-101.&lt;br /&gt;
*&amp;lt;ref name=&amp;quot;&amp;quot;&amp;gt;Sørensen, T, Sørensen, T A, Sørensen, T J (1948) [https://pattern.swarma.org/paper?id=ea7f2902-6e74-11ea-9db3-0242ac1a0005 A method of establishing groups of equal amplitude in plant sociology based on similarity of species content and its application to analyses of the vegetation on Danish commons].&amp;lt;/ref&amp;gt;&lt;br /&gt;
*Link Prediction Group 网站：http://www.linkprediction.org/&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
*链接预测可用于分析网络将如何发展，或者在给定信息不完整情况下来发现“丢失”的链接，对于这个问题，有研究者提出了一种新的，结合广义群贴近度中心性和半值相互作用指数的拟局部方法（即考虑半径k内节点的方法），详见 [https://swarma.org/?p=18249 《链路预测的博弈算法》]&lt;br /&gt;
[[File:链路预测的博弈算法.jpg|400px|thumb|[https://swarma.org/?p=18249 《链路预测的博弈算法》]|center]]&lt;br /&gt;
*深度学习已经成功地在图像识别、语音识别、自然语言处理、游戏与博弈等领域取得了突飞猛进的发展，并渗透到了我们的日常生活中。那么，我们有没有可能将这种技术借剪到复杂网 络的研究之中呢？近年来，人们凭借着网络嵌入（Network Embedding）、图卷积神经网络（Graph Convolutional Neural Network）、图注意力模型（Graph Attention Network）等新技术，已经开发了若干图结构上的深度学习算法，并取得了一定的成功应用。北师大系统科学学院教授、博导张江老师亲授[https://campus.swarma.org/play/coursedetail?id=10504 《当复杂网络遇上机器学习》]，将对这些算法以及应用，包括各式各样的网络嵌入算法、节点分类问题、链路预测问题、图分类问题、网络动力学预测问题等做一简单介绍，并对网络上的深度学习问题进行了展望。&lt;br /&gt;
[[File:当复杂网络遇上机器学习.png|400px|thumb|[https://campus.swarma.org/play/coursedetail?id=10504 《当复杂网络遇上机器学习》]|center]]&lt;br /&gt;
*网络上的注意力模型（Graph Attention Model）是一种通用的网络嵌入算法，它能够在节点分类、链路预测等问题上得到极高的精度。它可以模仿一个机器头对网络中的节点进行信息读取和分析，然后将综合的结果放到节点的向量中的过程。[https://campus.swarma.org/play/coursedetail?id=10385 《网络上的注意力模型》]课程将详细介绍这一模型及其应用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''''本中文词条由[[用户:木子二月鸟|木子二月鸟]]用户参与编译，  [[用户: 苏格兰| 苏格兰]]用户审校，欢迎在讨论页面留言'''''。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''本词条内容源自wikipedia及公开资料，遵守 CC3.0协议。'''&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E9%93%BE%E8%B7%AF%E9%A2%84%E6%B5%8B&amp;diff=7630</id>
		<title>链路预测</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E9%93%BE%E8%B7%AF%E9%A2%84%E6%B5%8B&amp;diff=7630"/>
		<updated>2020-05-10T14:09:02Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：/* 基于相似性的链路预测 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{#seo:|keywords=链路预测 Link Prediction  |description=通过已知的网络节点以及网络结构等信息，预测网络中尚未产生连边的两个节点之间产生连接的可能性。 }}&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
'''链路预测 Link Prediction'''是指如何通过已知的网络节点以及网络结构等信息，预测网络中尚未产生连边的两个节点之间产生连接的可能性。这种预测既包含了对未知链接 Existing yet unknown link，也称丢失链接 Missing link 的预测，也包含了对未来链接 Future link 的预测。&lt;br /&gt;
&lt;br /&gt;
链路预测是将复杂网络与信息科学联系起来的重要桥梁之一，它所要处理的是信息科学中最基本的问题——缺失信息的还原与预测。链路预测相关研究不仅能够推动网络科学和信息科学理论上的发展，而且具有巨大的实际应用价值，譬如可以知道蛋白质相互作用实验、进行在线社交推荐、找出交通传输网络中有特别重要作用的连边等。&lt;br /&gt;
&lt;br /&gt;
==研究方法==&lt;br /&gt;
===基于相似性的链路预测===&lt;br /&gt;
&lt;br /&gt;
*基于局部信息的相似性指标&lt;br /&gt;
&lt;br /&gt;
社会网络分析中经典的三元闭包 Triadic closure 原则指出，如果A、B	两个人拥有一个共同的朋友C，那么这两个人今后也很有可能成为朋友，从而使得3个节点构成一个闭合的三角形ABC。对于一般的网络，我们可以把这一原则推广如下：两个节点的共同邻居越多，这两个节点就越相似，从而更倾向于相互连接。最简单的基于'''共同邻居 Common neighbors''' 的节点相似性指标定义如下：&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
s_{xy}^{CN} =  |Γ(x)| \cap |Γ(y)|&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
在相似性指标定义的基础上，还可以考虑两个节点的共同邻居的相对数量。下表列出了10种基于节点局部信息的相似性指标，第1种是计算共同邻居相似度的基本公式，其中第2至7种相似性指标是直接基于共同邻居指标的不同的规范化而得到的，表中的 k(x) = |Γ(x)| 为节点x的度。第8种指标PA是基于BA无标度网络模型中新加入节点倾向于和度大的节点相连的优先连接机制而提出的。&lt;br /&gt;
&lt;br /&gt;
第9种指标AA的基本思想是度小的共同邻居节点的贡献大于度大的共同邻居节点，因此根据共同邻居节点的度为每个节点赋予一个权重值。这一点很容易理解，例如在微博中受关注较多的人往往是某个领域的专家或名人，因此共同关注他们的人之间可能并不拥有特别相似的兴趣——一个中学生和一个企业家都有可能是姚晨的粉丝。相反，如果两个人共同关注了一个粉丝很少的人（非名人），那么说明这两个人确实具有相同的兴趣爱好或者重叠的社交圈，因此有更高概率相连。又如在推荐系统中，共同购买冷门产品的两个用户往往比共同购买热门产品的用户更相似。&lt;br /&gt;
[[File:Table1.png|600px|thumb|10种基于节点局部信息的相似性指标|center]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
第2个指标Salton又称余弦相似性，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{|Γ(x)| \cap |Γ(y)|}{\sqrt{k(x)k(y)}}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第3个指标Jaccard指标是于100多年前由Jaccard提出的，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{|Γ(x)| \cap |Γ(y)|}{|Γ(x)| \bigcup  |Γ(y)|}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第4个指标Sorensen指标常用于生态学研究，其定义为 &amp;lt;math&amp;gt;s{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{kx + ky}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第5个指标大度节点有利指标（Hub promoted index，HPI）被用来定量刻画新陈代谢网络中每对反应物的拓扑相似程度，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{min\{k_x,k_y\}}&amp;lt;/math&amp;gt;，由于分母只由度较小的节点决定，在此定义下可知大度节点（hub）与其他节点之间更容易具有高的相似性。&lt;br /&gt;
&lt;br /&gt;
第6个指标大度节点不利指标（hub depressed index, HDI）定义与HPI相似，只是分母取两端节点度的最大值，即 &amp;lt;math&amp;gt;s_{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{max\{k_x,k_y\}}&amp;lt;/math&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
第7个指标LHN-I指标是由Leicht，Holme和Newman提出，其定义为 &amp;lt;math&amp;gt;s_{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{{k_xk_y}}&amp;lt;/math&amp;gt;，其中分母&amp;lt;math&amp;gt;k_xk_y&amp;lt;/math&amp;gt; 正比于节点&amp;lt;math&amp;gt;v_x&amp;lt;/math&amp;gt;和节点&amp;lt;math&amp;gt;v_y&amp;lt;/math&amp;gt;共同邻居数的期望值，即 &amp;lt;math&amp;gt;E( |Γ(x)| \cap |Γ(y)|)&amp;lt;/math&amp;gt;。在下面这篇文献中，Leicht等人同时提出了另一个基于路径的指标，为了有所区别，将此局部指标命名为LHN-I指标，将基于路径的指标命名为LHN-II指标：&lt;br /&gt;
&lt;br /&gt;
第8个指标PA（preferential attachment）是基于BA无标度网络模型中新加入节点倾向于和度大的节点相连的优先连接机制而提出的，在这种机制的链路预测中，每一步首先去除一条链接，然后再添加一条链接，新链接连接节点&amp;lt;math&amp;gt;v_x&amp;lt;/math&amp;gt;和&amp;lt;math&amp;gt;v_y&amp;lt;/math&amp;gt;的概率就正比于两节点度的乘积，由此可以定义两节点间的优先连接相似性：&amp;lt;math&amp;gt;s_{xy}= k_xk_y&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第9个指标AA（Adamic-Adar）的基本思想是度小的共同邻居节点的贡献大于度大的共同邻居节点，因此根据共同邻居节点的度为每个节点赋予一个权重值。这一点很容易理解，例如在微博中受关注较多的人往往是某个领域的专家或名人，因此共同关注他们的人之间可能并不拥有特别相似的兴趣——一个中学生和一个企业家都有可能是姚晨的粉丝。相反，如果两个人共同关注了一个粉丝很少的人（非名人），那么说明这两个人确实具有相同的兴趣爱好或者重叠的社交圈，因此有更高概率相连。又如在推荐系统中，共同购买冷门产品的两个用户往往比共同购买热门产品的用户更相似。AA指标根据共同邻居节点的度为每个节点赋予一个权重值，该权重等于该节点的度的对数分之一，即AA指标的定义为：&amp;lt;math&amp;gt;s_{xy}=\sum _{z\in \Gamma (x)\bigcap \Gamma (y)}\frac{1}{logk_z}&amp;lt;/math&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
第10种指标RA是受网络资源分配过程的启发，周涛等人提出的“'''资源分配指标 Resource allocation'''”，其与AA指标有异曲同工之妙。RA和AA指标最大的区别就在于赋予共同邻居节点权重的方式不同，前者是以 1/k 的形式递减，后者是以 1/logk 的形式递减。可见，当网络的平均度较小时，RA和AA差别不大；但是当平均度较大时，就有很大的区别了。研究显示，RA指标在刻画加权网络和社区挖掘应用中的表现胜过AA指标，图灵奖得主Hopdroft的一篇论文也显示，可以利用社区等中观结构信息改进局部指标，其中RA指标改进后的效果最佳。&lt;br /&gt;
&lt;br /&gt;
*基于路径的相似性指标&lt;br /&gt;
&lt;br /&gt;
基于共同邻居的相似性指标的优势在于计算复杂度较低，但是由于使用的信息非常有限，预测精度受到限制，因此发展出了基于路径的相似性指标，主要有3个，分别是局部路径指标 Local path 、Katz指标和LHN-II指标。&lt;br /&gt;
&lt;br /&gt;
1.局部路径指标&lt;br /&gt;
&lt;br /&gt;
周涛等人在共同邻居的基础上考虑三阶路径的因素，提出了基于局部路径的相似性指标，其定义为 &amp;lt;math&amp;gt; S=A^2+\alpha A^3&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 为可调参数，A 表示网络的邻接矩阵， &amp;lt;math&amp;gt;(A^3)_{xy}&amp;lt;/math&amp;gt;表示节点 &amp;lt;math&amp;gt;V_x&amp;lt;/math&amp;gt; 和 &amp;lt;math&amp;gt;V_y&amp;lt;/math&amp;gt; 之间长度为3的路径数目。当&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; = 0时，LP指标就退化为 CN 指标。 CN 指标本质上也可看成基于路径的指标，只是它仅考虑了二阶路径数目。局部路径指标可以扩展为更高阶的情形，即考虑n阶路径的情况：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt; S^n=A^2+\alpha\cdot A^3+\alpha^2\cdot A^4+\cdots +\alpha^{n-2}\cdot A^n &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
随着 n 的增加，局部路径指标的计算复杂度越来越大。一般而言，考虑 n 阶路径的计算复杂度为O(N&amp;lt;k&amp;gt;^n)。但是当 n 趋于无穷大的时候，局部路径指标相当于考虑网络全部路径的Katz指标，此时计算量反而有可能下降，因为可转变为计算矩阵的逆。&lt;br /&gt;
&lt;br /&gt;
2.Katz指标&lt;br /&gt;
&lt;br /&gt;
Katz指标考虑了所有网络的路径，因此其定义为：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S_{xy}=\sum_{l=1}^{\infty }\alpha^l\cdot\left |  paths_{x,y}^{&amp;lt;l&amp;gt;} \right |= \alpha A_{xy}+\alpha^2\cdot (A^2)_{xy}+\alpha^3\cdot (A^3)_{xy}+\cdots  &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\alpha &amp;gt; 0&amp;lt;/math&amp;gt; 为控制路径权重的可调参数，&amp;lt;math&amp;gt;\left |  paths_{x,y}^{&amp;lt;l&amp;gt;} \right |&amp;lt;/math&amp;gt;表示连接节点 &amp;lt;math&amp;gt;V_x&amp;lt;/math&amp;gt;和  &amp;lt;math&amp;gt;V_y&amp;lt;/math&amp;gt; 的路径中长度为 l 的路径数。要使上述级数收敛，则参数&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 应小于邻接矩阵最大特征值的倒数，此定义还可以表示为：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S = (I - \alpha\cdot A)^{-1} - I&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
显然，当参数&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 很小时，高阶路径的贡献也较小，使得 Katz 指标的预测结果接近于局部路径指标。&lt;br /&gt;
&lt;br /&gt;
3.LHN-II指标&lt;br /&gt;
&lt;br /&gt;
LHN-II 指标是 Leicht，Holme 和 Newman 提出的另一种相似性计算方法，他的基本思想是基于'''一般等价 Regular equivalence''' 提出的。与结构等价不同，一般等价的定义更广泛。在一般等价的定义下，如果两个节点所连接的节点之间相似，那么这两个节点也相似，即使它们之间没有共同的邻居节点。&lt;br /&gt;
&lt;br /&gt;
下图给出了一个简单的例子来帮助我们理解结构等价和一般等价的区别。根据结构等价的定义，在公司A内部，由于员工a和员工b都认识员工e和员工f（即它们有两个共同邻居节点），于是称员工a和员工b是结构等价的。同理，员工e和员工f也是结构等价的，同样地，在公司B中，员工c和员工d是结构等价的，员工g和员工h也是结构等价的。现在考虑员工a和员工c是否相似？根据一般等价的定义，由于员工a连接的节点e、f与员工c连接的节点g、h分别是相似的，那么我们可以认为员工a和员工c也是相似的，同理，在一般等价的意义下，员工b和员工d也是相似。从这个例子可以看出，结构相似性或称结构等价更强调的是两个节点是否在同一个环境下，也就是说是否连接了相同的节点；然而一般等价考虑的是这两个节点是否处于同样的角色，即使他们没有相同的邻居节点，但是由于各自的邻居节点之间本身相似，这两个节点也相似。一般等价意义下的相似性是LHN-II指标的核心。&lt;br /&gt;
&lt;br /&gt;
[[File:一般等价和结构等价示例.png|600px|thumb|一般等价和结构等价示例（图中实线表示连接，虚线表示相似关系）|center]]&lt;br /&gt;
&lt;br /&gt;
从一般等价的角度考虑，LHN-II指标认为如果两个节点的邻居节点之间是相似的，那么这两个节点也是相似的。它与Katz指标的区别主要是把Katz指标中的&amp;lt;math&amp;gt; (A^{n})_{xy} &amp;lt;/math&amp;gt;变成 &amp;lt;math&amp;gt;  (A^{n})_{xy}&amp;lt;/math&amp;gt; 的期望值，注意到 &amp;lt;math&amp;gt; (A^{n})_{xy}&amp;lt;/math&amp;gt; 的期望值为 &amp;lt;math&amp;gt; E\left [ (A^l)_{xy} \right ]=\frac{k_xk_y}{M}\lambda _1^{l-1}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\lambda_1&amp;lt;/math&amp;gt;为矩阵A的最大特征值，则LHN-II指标的表达式如下：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 S_{xy}^{LHN2}=\delta _{xy} + \sum_{l=1}^{\infty }\Phi ^l \frac{(A^l)_{xy}}{E\left [ (A^l)_{xy} \right ]}&lt;br /&gt;
=\delta _{xy} + \frac{2M}{k_xk_y}\sum_{l=1}^{\infty }\Phi ^l\lambda _1^{1-l}(A^l)_{xy}&lt;br /&gt;
=\left [ 1 - \frac{2 M \lambda_1}{k_xk_y} \right ]\delta _{xy} + \frac{2 M \lambda_1}{k_xk_y}\left [ (I-\frac{\Phi}{\lambda_1} A )^{-1} \right ]_{xy}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\delta _{xy}&amp;lt;/math&amp;gt;为 Kronecker &amp;lt;math&amp;gt;\delta&amp;lt;/math&amp;gt; 函数，&amp;lt;math&amp;gt; \Phi&amp;lt;/math&amp;gt; 为取值小于1的参数。上式最后一个等式的第一项是可以去掉的对角阵，从而相似性矩阵可以写为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S=2M\lambda_1D^{-1}(I-\frac{\Phi A}{\lambda_1})^{-1}D^{-1}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中''D''为度值矩阵，&amp;lt;math&amp;gt;D_{xy} = \delta_{xy} \cdot k_{x}&amp;lt;/math&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
*基于随机游走的节点相似性指标&lt;br /&gt;
&lt;br /&gt;
还有相当数量的相似性指标是基于随机游走过程定义的，包括'''平均通勤时间 Average commute time''' 、'''Cos+指标'''、'''有重启的随机游走 Random walk with restart'''、'''SimRank'''指标、'''局部随机游走指标 Local random walk''' 和'''有叠加效应的随机游走指标 Superposed random walk'''等。&lt;br /&gt;
&lt;br /&gt;
1.平均通勤时间 ACT &lt;br /&gt;
&lt;br /&gt;
设&amp;lt;math&amp;gt;m(x,y)&amp;lt;/math&amp;gt; 为一个随机粒子从节点x到节点y平均需要走的步数，那么节点x和y的平均通勤时间定义为：&amp;lt;math&amp;gt;n(x , y) = m(x , y) + m(y , x) &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其数值解可通过求该网络拉普拉斯矩阵&amp;lt;math&amp;gt;L&amp;lt;/math&amp;gt; 的伪逆&amp;lt;math&amp;gt; L^+&amp;lt;/math&amp;gt; 获得，即 &amp;lt;math&amp;gt;n(x,y)=M(l^+_{xx} +l^+_{yy} - 2l^+_{xy})&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;l^{+}_{xy}&amp;lt;/math&amp;gt;表示矩阵&amp;lt;math&amp;gt;L^+ &amp;lt;/math&amp;gt;中相应位置的元素。如果两个节点的平均通勤时间越小，那么两个节点越进阶。由此，定义基于ACT的相似性为（在此可忽略常数M）&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{ACT}=\frac{1}{l^+_{xx} +l^+_{yy} - 2l^+_{xy}}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
2.余弦相似性指标 Cos+指标&lt;br /&gt;
&lt;br /&gt;
在由向量&amp;lt;math&amp;gt;v_x = \Lambda ^{1/2}U^{T}e_{x}&amp;lt;/math&amp;gt;展开的欧式空间内，&amp;lt;math&amp;gt;L^+ &amp;lt;/math&amp;gt;中的元素&amp;lt;math&amp;gt;l^{+}_{xy}&amp;lt;/math&amp;gt;可表示为两向量&amp;lt;math&amp;gt;v_x&amp;lt;/math&amp;gt;和&amp;lt;math&amp;gt;v_y&amp;lt;/math&amp;gt;的内积，即&amp;lt;math&amp;gt; l^{+}_{xy} = v_{x}^{T} v_y&amp;lt;/math&amp;gt;，其中&amp;lt;math&amp;gt;U&amp;lt;/math&amp;gt;是一个标准正交矩阵，由&amp;lt;math&amp;gt;L^+&amp;lt;/math&amp;gt;特征向量按照对应的特征根从大到小排列，&amp;lt;math&amp;gt;\Lambda&amp;lt;/math&amp;gt;为以特征根为对角元素的对角矩阵，&amp;lt;math&amp;gt;e_{x}&amp;lt;/math&amp;gt; 表示一个一维向量且只有第x个元素为1，其他都为0。由此定义余弦相似性如下：&lt;br /&gt;
&lt;br /&gt;
s_{xy}^{cos+}=cos(x,y)^+=\frac{l_{xy}^+}{\sqrt{l^+_{xx} \cdot l^+_{yy}}}&lt;br /&gt;
&lt;br /&gt;
3.重启的随机游走 RWR&lt;br /&gt;
&lt;br /&gt;
这个指标可以看成是PageRank 算法的拓展应用。它假设随机游走粒子在每走一步的时候都以一定概率返回初始位置。设粒子返回概率为 1-c，&amp;lt;math&amp;gt;P&amp;lt;/math&amp;gt; 为网络的马尔科夫概率转移矩阵，其元素 &amp;lt;math&amp;gt;P_{xy} = a_{xy}/k_{x} &amp;lt;/math&amp;gt;表示节点x处的粒子下一步走到节点y的概率。其中如果节点x和节点y相连，则&amp;lt;math&amp;gt;a_{xy}=1&amp;lt;/math&amp;gt;，否则&amp;lt;math&amp;gt;a_{xy}=0&amp;lt;/math&amp;gt;。某一粒子初始时刻在节点x处，那么t+1时刻该粒子到达网络各个节点的概率向量为&lt;br /&gt;
&amp;lt;math&amp;gt;q_{x}(t+1) = c \cdot P^{T}q_{x}(t) + (1-c) e_{x}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;e_{x}&amp;lt;/math&amp;gt;表示初始状态（其定义与Cos+中相同），上式的稳态解为&amp;lt;math&amp;gt;q_{x} = (1-c)(I-cP^{T})^{-1}e_{x}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中元素&amp;lt;math&amp;gt;q_{xy}&amp;lt;/math&amp;gt;为从节点x出发的粒子最终有多少概率走到节点y。由此定义RWR相似性如下：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{RWR} = q_{xy} + q_{yx} &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
4.SimRank指标 SimR&lt;br /&gt;
&lt;br /&gt;
它的基本假设是，如果两节点所连接的节点相似，那么这两个节点就相似。其自洽定义式为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{simR}=C\frac{\sum_{v_z\in \Gamma (x)}\sum_{{v_z}'\in \Gamma (y)}s_{zz'}^{simR}}{k_xk_y}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中假定 &amp;lt;math&amp;gt;s_{xx} =1, C \in [0,1] &amp;lt;/math&amp;gt;为相似性传递时的衰减参数。&lt;br /&gt;
&lt;br /&gt;
SimR指标同时考虑了结构等价和一般等价。当节点x的邻居z同时也是节点y的邻居时，该指标考虑了结构等价；当节点x不等于节点y时，该指标概率了一般等价。可以证明，SimR指标可以用来描述两个分别从节点x和y出发的粒子平均过多久会相遇。&lt;br /&gt;
&lt;br /&gt;
5.局部随机游走指标 LRW&lt;br /&gt;
&lt;br /&gt;
上述4种随机游走指标是基于全局的随机游走，这类指标往往计算复杂度很高，因此很难在大规模网络上应用。刘伟平和吕琳媛提出了一种基于网络局部随机游走的相似性指标LRW，它只考虑有限步数的随机游走过程。一个粒子 t 时刻从节点x出发，定义&amp;lt;math&amp;gt;π_{xy} (t) &amp;lt;/math&amp;gt;为 t+1 时刻这个粒子正好走到节点y的概率，那么可得到系统演化方程：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\pi_{x} (t + 1) = P^T\pi_{x}(t)，t=0,1,…&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\pi_{x}(0) &amp;lt;/math&amp;gt;为一个&amp;lt;math&amp;gt;Nx1 &amp;lt;/math&amp;gt;的向量，只有第x 个元素为1，其他为0，即&amp;lt;math&amp;gt;\pi_{x}(0) =e_x&amp;lt;/math&amp;gt;。设定各个节点的初始资源分布为&amp;lt;math&amp;gt;q_x&amp;lt;/math&amp;gt;，那么基于t步随机游走的相似性为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{LRW} = q_{xy} + q_{yx}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
6.叠加的局部随机游走指标 SRW&lt;br /&gt;
&lt;br /&gt;
这个指标给邻近目标节点的点更多的机会与目标节点相连，充分考虑了很多真实网络连接上的局域性特点，它是在LRW的基础上，将t步及其以前的结果加总，便得到SRW的值，即：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{SRW}(t)=\sum_{t}^{l=1}s_{xy}^{LRW}(l) = q_x\sum_{t}^{l=1}\pi_{xy}(l) + q_y\sum_{t}^{l=1}\pi_{yx}(l)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===基于似然分析的链路预测===&lt;br /&gt;
&lt;br /&gt;
基于相似性的链路预测方法，是最简单的一种分析框架，除此之外，还有另一种最复杂的链路预测分析框架——基于似然分析的链路预测。这个框架本身远远复杂于基于相似性的框架，而且框架中的每一个组成成分自身都非常复杂，但这个框架下衍生出的算法除了给出链路预测的结果之外，还给出了我们对于网络结构的深刻洞见，例如“'''层次结构模型 Hierachical structure model'''”给出了网路层次组织形态的定量刻画，“'''随机分块模型 Stochastic block model'''”类似于社区分解一样把网络划分成了若干子块。这些对理解网络结构特征方面的贡献，是基于相似性的框架所不能提供的。&lt;br /&gt;
&lt;br /&gt;
基于似然分析的链路预测的基本思路是：根据网络结构的产生和组织方式以及目前已经观察到的链路计算网络的似然值，并认为真实的网络使得网络似然值最大，然后再根据网络似然最大化计算每一对未连接的节点产生连边的可能性。&lt;br /&gt;
&lt;br /&gt;
*层次结构模型 HSM&lt;br /&gt;
&lt;br /&gt;
层次结构模型假设真实的网络都存在某种层次性，网络的连接则可看作是这种内在层次结构的反映。该方法的计算步骤如下：&lt;br /&gt;
&lt;br /&gt;
1.一个N个节点的网络可以用一个包含N个叶子节点的族谱树表示，这N个叶子节点将由N-1个非叶子节点连接起来，其中每个非叶子节点都有一个概率值，则两个叶子节点连接的概率就等于他们最近共同祖先节点的概率值。给定一个族谱树，将网络的似然值最大化，就可以得到非叶子节点的概率值，并由此计算出这一个族谱树所对应的网络最大的似然值。&lt;br /&gt;
&lt;br /&gt;
2.使用马尔科夫链蒙特卡洛方法对网络不同的族谱树进行抽样，使得每个族谱树出现的频次正比于该树对应的最大的网络似然值。两个节点连边的概率就等于所有抽样出来的族谱树中两个节点连边概率的平均值。注意似然高的族谱树会出现多次，因此对这个平均概率的贡献也大。&lt;br /&gt;
&lt;br /&gt;
3.把平均连边概率看做是相似性框架中的相似性指标&amp;lt;math&amp;gt;s_{xy}&amp;lt;/math&amp;gt;，按照这个值从大到小排序，排在前面的就是预测的连边。&lt;br /&gt;
&lt;br /&gt;
需要指出的是，层次结构模型在处理具有明显层次结构的网络（如恐怖袭击网络和草原食物链）时具有较高的精确度，但在处理一般性网络时效果并不一定突出。&lt;br /&gt;
&lt;br /&gt;
*随机分块模型 SBM&lt;br /&gt;
&lt;br /&gt;
与层次结构模型的思想类似，随机分块模型假设网络中的节点可以被分为若干集合，两个节点间连接的概率只与相应的集合有关。换句话说，同一个群众所有节点的地位是相同的。随机分块模型特别适合刻画节点所属群的成员身份对于其连接行为有关键影响的情况，例如，著名的“角色模型”就包含了随机分块模型的理念。&lt;br /&gt;
&lt;br /&gt;
随机分块模型的效果要好于层次结构模型。同时，该方法还可以剔除网络的错误连边，如纠正蛋白质相互作用网络中的错误连边。&lt;br /&gt;
&lt;br /&gt;
*闭路模型 Loop model&lt;br /&gt;
&lt;br /&gt;
似然分析的更一般的框架是：给定一个网络系统，特定网络哈密顿量的负指数被统计分配函数归一化后，就得到这个网络出现的似然，一条未被观察到的连边存在的可能性就等于添加这条连边后网络的似然值。闭路模型考虑网络结构形成中的“局部性原则”，并由此定义了网络的哈密顿量。实验表明，闭路模型的预测精度大于层次结构模型和随机分块模型。&lt;br /&gt;
&lt;br /&gt;
===基于机器学习的链路预测===&lt;br /&gt;
&lt;br /&gt;
用机器学习的思路进行链路预测，主要分为基于特征分类方法、基于概率图模型方法和基于矩阵分解方法三大类。&lt;br /&gt;
&lt;br /&gt;
*基于特征分类方法&lt;br /&gt;
&lt;br /&gt;
网络中的链路预测问题可以看成机器学习中的分类问题，其中每个数据点对应一对节点之间关系的标记，假定两个节点之间存在连边，则数据点的值为+1，否则为-1。特征选取是分类问题中最重要的问题之一，目前研究较多的主要包括基于节点与边的属性特征和基于节点所处网络的拓扑结构特征（如CN、AA、Katz、最短路径）等。哈桑 Hasan 等人提取合著网络中科学家研究领域的关键词作为特征，用监督学习中一些常用的分类算法（如决策树、K近邻法、多层感知器、支持向量机、径向基网络）对缺失的连边进行较为精准的预测，其中以支持向量机方法表现最佳。&lt;br /&gt;
&lt;br /&gt;
*基于概率图模型&lt;br /&gt;
&lt;br /&gt;
基于概率图模型的链路预测方法使用图模型来表达节点之间的连边概率，根据模型中概率依赖关系，可分为有向无环的贝叶斯网络和无向的马尔科夫网络。随机分块模型和层次结构模型分别是典型的基于贝叶斯网络和基于马尔科夫网络的链路预测方法。基于概率图模型的链路预测方法有很多，典型的还有有监督随机游走链路预测算法，将网络结构信息与节点和连边的属性信息结合起来，给每条边分配不同的转移概率。与其他有监督的机器学习方法相比，该算法无须知道网络的特征和相关的领域知识。&lt;br /&gt;
&lt;br /&gt;
*基于矩阵分解&lt;br /&gt;
&lt;br /&gt;
基于矩阵分解的链路预测方法是基于网络邻接矩阵的代数谱变换而得到的方法，来预测网络中链路的存在性和链路的权值。相比其他几种机器学习方法，该方法要学习的参数少很多，但计算复杂度较高。链路预测问题可以视为邻接矩阵填充问题，并可以通过双线性回归模型将节点和链路的显特征和隐特征结合起来用矩阵分解方法解决。边缘去噪模型将根据给定关系矩阵求未知边或丢失边的问题变成一个矩阵降噪去噪问题。&lt;br /&gt;
&lt;br /&gt;
关于不同的链路预测研究方法的分类可以参考下表：&lt;br /&gt;
[[File:Link preditction method.png|600px|thumb|三类不同的链路预测方法（*表示该方法含有参数）|center]]&lt;br /&gt;
&lt;br /&gt;
==应用场景==&lt;br /&gt;
链路预测有着广泛的应用场景：在生物领域，利用蛋白质间相互作用关系的结构信息进行链路预测，可以为实验的测定提前提供参考依据，从而降低实验成本、提高成功率；在社交网络领域，链路预测可以对社交网络中的好友关系、朋友推荐进行预测，从而提高用户对社交网站的体验满意度和使用黏性；在电子商务领域，除了传统的协同过滤推荐算法外，利用网络结构信息（如网络三角形结构）等特征进行商品推荐也取得了显著的优势；此外，通过识别隐藏的链边或异常的链边对信息不完全或含有噪音的网络进行重构，可以提高网络的传输能力，这对于航空网络重构有很大的启发意义。&lt;br /&gt;
[[File:Figure2.png|400px|thumb|链路预测应用场景示意图（图片来自网络）|center]]&lt;br /&gt;
&lt;br /&gt;
除此之外，链路预测的算法和思想通过一些变换还可以用来解决一些看似没有太大关系的问题。例如，对疾病信号和股票指数的预测。基于链路预测的思想和方法，我们还可以设计基于节点相似性的社团划分以及对网络演化模型的定量化评估方法。链路预测还可以帮助提高节点标签预测的精度，特别是在已知标签节点稀疏的情况下效果显著。这一方法可以应用于判断一篇学术论文的类型，判断一本书的政治态度（中立、自由派或保守派），或者判断一个手机用户是否产生了更换电信运营商的念头。&lt;br /&gt;
&lt;br /&gt;
==代表人物==&lt;br /&gt;
*'''吕琳媛'''&lt;br /&gt;
吕琳媛主要研究方向为复杂网络信息挖掘领域，包括海量信息导航、挖掘、推荐和预测。目前担任阿里巴巴复杂科学研究中心副主任，中欧联合实验室执行主任，中国工业与应用数学学会复杂网络与系统控制专业委员会委员，杭州市特聘专家。&lt;br /&gt;
[[File:Lvlinyuan.png|400px|thumb|吕琳媛，阿里巴巴复杂科学研究中心副主任|center]]&lt;br /&gt;
&lt;br /&gt;
近年来主持/参与国家级项目5项（2016年获得国家自然科学基金优秀青年基金），省部级项目4项，横向课题4项。 在相关领域发表学术论文 50余篇，其中SCI论文39篇，总影响因子122，发表期刊包括Physics Reports，PNAS，Nature Communications等国际知名学术期刊。三篇论文入选ESI全球Top-1%高引用论文，论文SCI引用1200余次，谷歌学术引用3000余次，其中9篇论文引用超过100次。2013年出版学术专著《链路预测》获得第四届中国大学出版社图书奖优秀学术著作一等奖。申请发明专利12项。2015年荣获浙江省杰出青年基金，2014年荣获中国计算机学会自然科学二等奖，中国网络科学论坛青年希望奖，首届CCF-腾讯犀牛鸟基金优秀奖。&lt;br /&gt;
&lt;br /&gt;
*'''周涛'''&lt;br /&gt;
周涛主要从事复杂性科学和大数据挖掘算法和应用研究，先后攻克推荐系统准确性-多样性困境、复杂网络链路可预测性、H指数-度-核心度关系等图挖掘领域的重要难题，成果发表在PNAS, Nature Communications, Physics Reports, KDD和ICDM等国际顶尖期刊和会议上。目前论文google总引用超过14000次，其中8篇论文入选ESI高引用论文，H指数为57，2014和2015连续两年入选Elsevier最具国际影响力中国科学家名单。&lt;br /&gt;
[[File:Zhoutao.png|400px|thumb|周涛，第十二届中国青年科技奖|center]]&lt;br /&gt;
&lt;br /&gt;
因其在科学研究上的杰出表现，2011年获得第十二届中国青年科技奖（最年轻获奖者），2011年入选四川省“百人计划”，2012年获得国家首批优秀青年科学基金资助，2013年入选国家“万人计划”首批青年拔尖人才支持计划，2014年获得四川省科技进步一等奖、中国计算机学会自然科学奖，2015年获得共青团中央授予的“最美青年科技工作者”称号，并与屠呦呦等七名个人和北斗导航等三个团队共同当选2015年度中国十大科技创新人物。&lt;br /&gt;
&lt;br /&gt;
*'''马克·纽曼 Mark Newman'''&lt;br /&gt;
Newman是一名英裔美国物理学家，也是密歇根大学 University of Michigan 物理学系的阿纳托尔·拉波特 Anatol Rapoport 杰出教授，也是圣达菲研究所 Santa Fe Institute 的外部教员。他因在复杂网络和复杂系统领域的基础性贡献而闻名，为此他被授予2014年拉格朗日奖。&lt;br /&gt;
[[File:Newman.png|400px|thumb|Mark Newman，密歇根大学物理学系阿纳托尔·拉波特杰出教授|center]]&lt;br /&gt;
&lt;br /&gt;
Newman以其对复杂网络的研究而著称，尤其是在科学家的协作模式，随机图论 Random graph theory，社区结构 Community structure，渗流理论 Percolation theory 和网络流行病学 Network epidemiology方面的工作。他作为共同发明人，与迈克尔·卡斯特 Michael Gastner 一起，发明了一种可以产生密度均衡地图 Density-equalizing maps 或统计地图 Cartograms的方法，该方法构成了Worldmapper网站的基础。他们的工作在2004年美国总统大选后受到关注，成为了当时被广泛传播的一种选举结果地图的基础，（他们）根据各州的人口数调整了州的规模，以便更准确地了解每个党派的选民投票人数。&lt;br /&gt;
&lt;br /&gt;
*'''克里斯托弗·大卫·摩尔 Cristopher David Moore'''&lt;br /&gt;
克里斯托弗·大卫·摩尔 Cristopher David Moore，也称为克里斯·摩尔 Cris Moore 是美国计算机科学家，数学家和物理学家。他是圣达菲研究所的驻校教师，曾任新墨西哥大学 University of New Mexico 的正教授。&lt;br /&gt;
[[File:Cristopher_David_Moore.png|400px|thumb|Cristopher David Moore，圣达菲研究所的驻校教师|center]]&lt;br /&gt;
&lt;br /&gt;
1993年，Moore 发现了一种新颖的解决三体问题的方法，表明在牛顿力学中，三个等质量的物体有可能沿着一条八字形曲线、在同一条轨道相互跟随。Moore 在网络科学领域也很活跃，在该领域有许多著名的出版物。在与Clauset和Mark Newman的合作中，Moore开发了复杂网络的层次聚类概率模型，并表明他们的模型可以在面对网络连接结构发生变化时可靠地预测聚类结果。&lt;br /&gt;
&lt;br /&gt;
*'''亚伦·克劳斯特 Aaron Clauset '''&lt;br /&gt;
Aaron Clauset是一位美国计算机科学家，致力于网络科学，机器学习和复杂系统领域。目前，他在科罗拉多大学博尔德分校 University of Colorado Boulder 教授计算机科学，也是圣菲研究所的外部教员。&lt;br /&gt;
[[File:Aaron_Clauset.png|400px|thumb|  Aaron Clauset，圣菲研究所的外部教员|center]]&lt;br /&gt;
&lt;br /&gt;
Clauset因与Cosma Shalizi和Mark Newman进行的合作研究而闻名，他们针对经验数据中是否存在幂律模式开发了严格的统计检验，并且证明了许多宣称符合幂律分布的网络实际上并不是幂律分布。他还因开发检测复杂网络中的社区结构算法的工作而著称，特别是和Newman、Moore合作发展的网络层次聚类模型。在其他方面，Clauslet 与麦克斯韦·扬 Maxwell Young 、克里斯蒂安·斯克雷德·格莱蒂奇 Kristian Skrede Gleditsch 共同完成了一些独特发现：世界范围内恐怖事件发生的频率和严重性服从幂律分布。&lt;br /&gt;
&lt;br /&gt;
2015年，Clauset 因开发和评估一种网络结构特征的新方法而获得了美国国家科学基金会颁发的著名的CAREER奖。2016年，Clauset因在网络结构方面（包括Internet映射，推断缺失链接和社区结构），以及对人类冲突和社会分层所做的启发性分析方面做出的贡献而获得网络科学学会颁发的网络科学领域的Erdös-Rényi奖。&lt;br /&gt;
&lt;br /&gt;
==参考资料==&lt;br /&gt;
*汪小帆,李翔,陈关荣.《网络科学导论》.北京：高等教育出版社,2012年：178-186&lt;br /&gt;
*吕琳媛,周涛.《链路预测》.北京：高等教育出版社,2013年：57-93&lt;br /&gt;
*吕琳媛,任晓龙,周涛.《网络链路预测：概念与前沿》[J].《中国计算机学会通讯》,2016年,第4期&lt;br /&gt;
*Clauset A, Moore C, Newman M E J. Hierarchical structure and the prediction of missing links in networks [J]. Nature, 2008,453(7191): 98-101.&lt;br /&gt;
*&amp;lt;ref name=&amp;quot;&amp;quot;&amp;gt;Sørensen, T, Sørensen, T A, Sørensen, T J (1948) [https://pattern.swarma.org/paper?id=ea7f2902-6e74-11ea-9db3-0242ac1a0005 A method of establishing groups of equal amplitude in plant sociology based on similarity of species content and its application to analyses of the vegetation on Danish commons].&amp;lt;/ref&amp;gt;&lt;br /&gt;
*Link Prediction Group 网站：http://www.linkprediction.org/&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
*链接预测可用于分析网络将如何发展，或者在给定信息不完整情况下来发现“丢失”的链接，对于这个问题，有研究者提出了一种新的，结合广义群贴近度中心性和半值相互作用指数的拟局部方法（即考虑半径k内节点的方法），详见 [https://swarma.org/?p=18249 《链路预测的博弈算法》]&lt;br /&gt;
[[File:链路预测的博弈算法.jpg|400px|thumb|[https://swarma.org/?p=18249 《链路预测的博弈算法》]|center]]&lt;br /&gt;
*深度学习已经成功地在图像识别、语音识别、自然语言处理、游戏与博弈等领域取得了突飞猛进的发展，并渗透到了我们的日常生活中。那么，我们有没有可能将这种技术借剪到复杂网 络的研究之中呢？近年来，人们凭借着网络嵌入（Network Embedding）、图卷积神经网络（Graph Convolutional Neural Network）、图注意力模型（Graph Attention Network）等新技术，已经开发了若干图结构上的深度学习算法，并取得了一定的成功应用。北师大系统科学学院教授、博导张江老师亲授[https://campus.swarma.org/play/coursedetail?id=10504 《当复杂网络遇上机器学习》]，将对这些算法以及应用，包括各式各样的网络嵌入算法、节点分类问题、链路预测问题、图分类问题、网络动力学预测问题等做一简单介绍，并对网络上的深度学习问题进行了展望。&lt;br /&gt;
[[File:当复杂网络遇上机器学习.png|400px|thumb|[https://campus.swarma.org/play/coursedetail?id=10504 《当复杂网络遇上机器学习》]|center]]&lt;br /&gt;
*网络上的注意力模型（Graph Attention Model）是一种通用的网络嵌入算法，它能够在节点分类、链路预测等问题上得到极高的精度。它可以模仿一个机器头对网络中的节点进行信息读取和分析，然后将综合的结果放到节点的向量中的过程。[https://campus.swarma.org/play/coursedetail?id=10385 《网络上的注意力模型》]课程将详细介绍这一模型及其应用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''''本中文词条由[[用户:木子二月鸟|木子二月鸟]]用户参与编译，  [[用户: 苏格兰| 苏格兰]]用户审校，欢迎在讨论页面留言'''''。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''本词条内容源自wikipedia及公开资料，遵守 CC3.0协议。'''&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E9%93%BE%E8%B7%AF%E9%A2%84%E6%B5%8B&amp;diff=7627</id>
		<title>链路预测</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E9%93%BE%E8%B7%AF%E9%A2%84%E6%B5%8B&amp;diff=7627"/>
		<updated>2020-05-10T14:02:05Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：/* 基于相似性的链路预测 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{#seo:|keywords=链路预测 Link Prediction  |description=通过已知的网络节点以及网络结构等信息，预测网络中尚未产生连边的两个节点之间产生连接的可能性。 }}&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
'''链路预测 Link Prediction'''是指如何通过已知的网络节点以及网络结构等信息，预测网络中尚未产生连边的两个节点之间产生连接的可能性。这种预测既包含了对未知链接 Existing yet unknown link，也称丢失链接 Missing link 的预测，也包含了对未来链接 Future link 的预测。&lt;br /&gt;
&lt;br /&gt;
链路预测是将复杂网络与信息科学联系起来的重要桥梁之一，它所要处理的是信息科学中最基本的问题——缺失信息的还原与预测。链路预测相关研究不仅能够推动网络科学和信息科学理论上的发展，而且具有巨大的实际应用价值，譬如可以知道蛋白质相互作用实验、进行在线社交推荐、找出交通传输网络中有特别重要作用的连边等。&lt;br /&gt;
&lt;br /&gt;
==研究方法==&lt;br /&gt;
===基于相似性的链路预测===&lt;br /&gt;
&lt;br /&gt;
*基于局部信息的相似性指标&lt;br /&gt;
&lt;br /&gt;
社会网络分析中经典的三元闭包 Triadic closure 原则指出，如果A、B	两个人拥有一个共同的朋友C，那么这两个人今后也很有可能成为朋友，从而使得3个节点构成一个闭合的三角形ABC。对于一般的网络，我们可以把这一原则推广如下：两个节点的共同邻居越多，这两个节点就越相似，从而更倾向于相互连接。最简单的基于'''共同邻居 Common neighbors''' 的节点相似性指标定义如下：&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
s_{xy}^{CN} =  |Γ(x)| \cap |Γ(y)|&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
在相似性指标定义的基础上，还可以考虑两个节点的共同邻居的相对数量。下表列出了10种基于节点局部信息的相似性指标，第1种是计算共同邻居相似度的基本公式，其中第2至7种相似性指标是直接基于共同邻居指标的不同的规范化而得到的，表中的 k(x) = |Γ(x)| 为节点x的度。第8种指标PA是基于BA无标度网络模型中新加入节点倾向于和度大的节点相连的优先连接机制而提出的。&lt;br /&gt;
&lt;br /&gt;
第9种指标AA的基本思想是度小的共同邻居节点的贡献大于度大的共同邻居节点，因此根据共同邻居节点的度为每个节点赋予一个权重值。这一点很容易理解，例如在微博中受关注较多的人往往是某个领域的专家或名人，因此共同关注他们的人之间可能并不拥有特别相似的兴趣——一个中学生和一个企业家都有可能是姚晨的粉丝。相反，如果两个人共同关注了一个粉丝很少的人（非名人），那么说明这两个人确实具有相同的兴趣爱好或者重叠的社交圈，因此有更高概率相连。又如在推荐系统中，共同购买冷门产品的两个用户往往比共同购买热门产品的用户更相似。&lt;br /&gt;
[[File:Table1.png|600px|thumb|10种基于节点局部信息的相似性指标|center]]&lt;br /&gt;
&lt;br /&gt;
{|class=&amp;quot;10种基于节点局部信息的相似性指标&amp;quot;&lt;br /&gt;
|+ mfinder&lt;br /&gt;
|-&lt;br /&gt;
!rowspan=&amp;quot;1&amp;quot;|名称 || 定义 || 名称 || 定义&lt;br /&gt;
|-&lt;br /&gt;
|rowspan=&amp;quot;1&amp;quot;|(1)共同邻居（CN）|| &amp;lt;math&amp;gt;s_{xy}^{CN} =  |Γ(x)| \cap |Γ(y)|&amp;lt;/math&amp;gt; || (6)大度节点不利指标（HDI）|| &amp;lt;math&amp;gt;s_{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{max\{k_x,k_y\}}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
第10种指标RA是受网络资源分配过程的启发，周涛等人提出的“'''资源分配指标 Resource allocation'''”，其与AA指标有异曲同工之妙。RA和AA指标最大的区别就在于赋予共同邻居节点权重的方式不同，前者是以 1/k 的形式递减，后者是以 1/logk 的形式递减。可见，当网络的平均度较小时，RA和AA差别不大；但是当平均度较大时，就有很大的区别了。研究显示，RA指标在刻画加权网络和社区挖掘应用中的表现胜过AA指标，图灵奖得主Hopdroft的一篇论文也显示，可以利用社区等中观结构信息改进局部指标，其中RA指标改进后的效果最佳。&lt;br /&gt;
&lt;br /&gt;
*基于路径的相似性指标&lt;br /&gt;
&lt;br /&gt;
基于共同邻居的相似性指标的优势在于计算复杂度较低，但是由于使用的信息非常有限，预测精度受到限制，因此发展出了基于路径的相似性指标，主要有3个，分别是局部路径指标 Local path 、Katz指标和LHN-II指标。&lt;br /&gt;
&lt;br /&gt;
1.局部路径指标&lt;br /&gt;
&lt;br /&gt;
周涛等人在共同邻居的基础上考虑三阶路径的因素，提出了基于局部路径的相似性指标，其定义为 &amp;lt;math&amp;gt; S=A^2+\alpha A^3&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 为可调参数，A 表示网络的邻接矩阵， &amp;lt;math&amp;gt;(A^3)_{xy}&amp;lt;/math&amp;gt;表示节点 &amp;lt;math&amp;gt;V_x&amp;lt;/math&amp;gt; 和 &amp;lt;math&amp;gt;V_y&amp;lt;/math&amp;gt; 之间长度为3的路径数目。当&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; = 0时，LP指标就退化为 CN 指标。 CN 指标本质上也可看成基于路径的指标，只是它仅考虑了二阶路径数目。局部路径指标可以扩展为更高阶的情形，即考虑n阶路径的情况：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt; S^n=A^2+\alpha\cdot A^3+\alpha^2\cdot A^4+\cdots +\alpha^{n-2}\cdot A^n &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
随着 n 的增加，局部路径指标的计算复杂度越来越大。一般而言，考虑 n 阶路径的计算复杂度为O(N&amp;lt;k&amp;gt;^n)。但是当 n 趋于无穷大的时候，局部路径指标相当于考虑网络全部路径的Katz指标，此时计算量反而有可能下降，因为可转变为计算矩阵的逆。&lt;br /&gt;
&lt;br /&gt;
2.Katz指标&lt;br /&gt;
&lt;br /&gt;
Katz指标考虑了所有网络的路径，因此其定义为：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S_{xy}=\sum_{l=1}^{\infty }\alpha^l\cdot\left |  paths_{x,y}^{&amp;lt;l&amp;gt;} \right |= \alpha A_{xy}+\alpha^2\cdot (A^2)_{xy}+\alpha^3\cdot (A^3)_{xy}+\cdots  &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\alpha &amp;gt; 0&amp;lt;/math&amp;gt; 为控制路径权重的可调参数，&amp;lt;math&amp;gt;\left |  paths_{x,y}^{&amp;lt;l&amp;gt;} \right |&amp;lt;/math&amp;gt;表示连接节点 &amp;lt;math&amp;gt;V_x&amp;lt;/math&amp;gt;和  &amp;lt;math&amp;gt;V_y&amp;lt;/math&amp;gt; 的路径中长度为 l 的路径数。要使上述级数收敛，则参数&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 应小于邻接矩阵最大特征值的倒数，此定义还可以表示为：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S = (I - \alpha\cdot A)^{-1} - I&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
显然，当参数&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 很小时，高阶路径的贡献也较小，使得 Katz 指标的预测结果接近于局部路径指标。&lt;br /&gt;
&lt;br /&gt;
3.LHN-II指标&lt;br /&gt;
&lt;br /&gt;
LHN-II 指标是 Leicht，Holme 和 Newman 提出的另一种相似性计算方法，他的基本思想是基于'''一般等价 Regular equivalence''' 提出的。与结构等价不同，一般等价的定义更广泛。在一般等价的定义下，如果两个节点所连接的节点之间相似，那么这两个节点也相似，即使它们之间没有共同的邻居节点。&lt;br /&gt;
&lt;br /&gt;
下图给出了一个简单的例子来帮助我们理解结构等价和一般等价的区别。根据结构等价的定义，在公司A内部，由于员工a和员工b都认识员工e和员工f（即它们有两个共同邻居节点），于是称员工a和员工b是结构等价的。同理，员工e和员工f也是结构等价的，同样地，在公司B中，员工c和员工d是结构等价的，员工g和员工h也是结构等价的。现在考虑员工a和员工c是否相似？根据一般等价的定义，由于员工a连接的节点e、f与员工c连接的节点g、h分别是相似的，那么我们可以认为员工a和员工c也是相似的，同理，在一般等价的意义下，员工b和员工d也是相似。从这个例子可以看出，结构相似性或称结构等价更强调的是两个节点是否在同一个环境下，也就是说是否连接了相同的节点；然而一般等价考虑的是这两个节点是否处于同样的角色，即使他们没有相同的邻居节点，但是由于各自的邻居节点之间本身相似，这两个节点也相似。一般等价意义下的相似性是LHN-II指标的核心。&lt;br /&gt;
&lt;br /&gt;
[[File:一般等价和结构等价示例.png|600px|thumb|一般等价和结构等价示例（图中实线表示连接，虚线表示相似关系）|center]]&lt;br /&gt;
&lt;br /&gt;
从一般等价的角度考虑，LHN-II指标认为如果两个节点的邻居节点之间是相似的，那么这两个节点也是相似的。它与Katz指标的区别主要是把Katz指标中的&amp;lt;math&amp;gt; (A^{n})_{xy} &amp;lt;/math&amp;gt;变成 &amp;lt;math&amp;gt;  (A^{n})_{xy}&amp;lt;/math&amp;gt; 的期望值，注意到 &amp;lt;math&amp;gt; (A^{n})_{xy}&amp;lt;/math&amp;gt; 的期望值为 &amp;lt;math&amp;gt; E\left [ (A^l)_{xy} \right ]=\frac{k_xk_y}{M}\lambda _1^{l-1}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\lambda_1&amp;lt;/math&amp;gt;为矩阵A的最大特征值，则LHN-II指标的表达式如下：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 S_{xy}^{LHN2}=\delta _{xy} + \sum_{l=1}^{\infty }\Phi ^l \frac{(A^l)_{xy}}{E\left [ (A^l)_{xy} \right ]}&lt;br /&gt;
=\delta _{xy} + \frac{2M}{k_xk_y}\sum_{l=1}^{\infty }\Phi ^l\lambda _1^{1-l}(A^l)_{xy}&lt;br /&gt;
=\left [ 1 - \frac{2 M \lambda_1}{k_xk_y} \right ]\delta _{xy} + \frac{2 M \lambda_1}{k_xk_y}\left [ (I-\frac{\Phi}{\lambda_1} A )^{-1} \right ]_{xy}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\delta _{xy}&amp;lt;/math&amp;gt;为 Kronecker &amp;lt;math&amp;gt;\delta&amp;lt;/math&amp;gt; 函数，&amp;lt;math&amp;gt; \Phi&amp;lt;/math&amp;gt; 为取值小于1的参数。上式最后一个等式的第一项是可以去掉的对角阵，从而相似性矩阵可以写为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S=2M\lambda_1D^{-1}(I-\frac{\Phi A}{\lambda_1})^{-1}D^{-1}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中''D''为度值矩阵，&amp;lt;math&amp;gt;D_{xy} = \delta_{xy} \cdot k_{x}&amp;lt;/math&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
*基于随机游走的节点相似性指标&lt;br /&gt;
&lt;br /&gt;
还有相当数量的相似性指标是基于随机游走过程定义的，包括'''平均通勤时间 Average commute time''' 、'''Cos+指标'''、'''有重启的随机游走 Random walk with restart'''、'''SimRank'''指标、'''局部随机游走指标 Local random walk''' 和'''有叠加效应的随机游走指标 Superposed random walk'''等。&lt;br /&gt;
&lt;br /&gt;
1.平均通勤时间 ACT &lt;br /&gt;
&lt;br /&gt;
设&amp;lt;math&amp;gt;m(x,y)&amp;lt;/math&amp;gt; 为一个随机粒子从节点x到节点y平均需要走的步数，那么节点x和y的平均通勤时间定义为：&amp;lt;math&amp;gt;n(x , y) = m(x , y) + m(y , x) &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其数值解可通过求该网络拉普拉斯矩阵&amp;lt;math&amp;gt;L&amp;lt;/math&amp;gt; 的伪逆&amp;lt;math&amp;gt; L^+&amp;lt;/math&amp;gt; 获得，即 &amp;lt;math&amp;gt;n(x,y)=M(l^+_{xx} +l^+_{yy} - 2l^+_{xy})&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;l^{+}_{xy}&amp;lt;/math&amp;gt;表示矩阵&amp;lt;math&amp;gt;L^+ &amp;lt;/math&amp;gt;中相应位置的元素。如果两个节点的平均通勤时间越小，那么两个节点越进阶。由此，定义基于ACT的相似性为（在此可忽略常数M）&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{ACT}=\frac{1}{l^+_{xx} +l^+_{yy} - 2l^+_{xy}}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
2.余弦相似性指标 Cos+指标&lt;br /&gt;
&lt;br /&gt;
在由向量&amp;lt;math&amp;gt;v_x = \Lambda ^{1/2}U^{T}e_{x}&amp;lt;/math&amp;gt;展开的欧式空间内，&amp;lt;math&amp;gt;L^+ &amp;lt;/math&amp;gt;中的元素&amp;lt;math&amp;gt;l^{+}_{xy}&amp;lt;/math&amp;gt;可表示为两向量&amp;lt;math&amp;gt;v_x&amp;lt;/math&amp;gt;和&amp;lt;math&amp;gt;v_y&amp;lt;/math&amp;gt;的内积，即&amp;lt;math&amp;gt; l^{+}_{xy} = v_{x}^{T} v_y&amp;lt;/math&amp;gt;，其中&amp;lt;math&amp;gt;U&amp;lt;/math&amp;gt;是一个标准正交矩阵，由&amp;lt;math&amp;gt;L^+&amp;lt;/math&amp;gt;特征向量按照对应的特征根从大到小排列，&amp;lt;math&amp;gt;\Lambda&amp;lt;/math&amp;gt;为以特征根为对角元素的对角矩阵，&amp;lt;math&amp;gt;e_{x}&amp;lt;/math&amp;gt; 表示一个一维向量且只有第x个元素为1，其他都为0。由此定义余弦相似性如下：&lt;br /&gt;
&lt;br /&gt;
s_{xy}^{cos+}=cos(x,y)^+=\frac{l_{xy}^+}{\sqrt{l^+_{xx} \cdot l^+_{yy}}}&lt;br /&gt;
&lt;br /&gt;
3.重启的随机游走 RWR&lt;br /&gt;
&lt;br /&gt;
这个指标可以看成是PageRank 算法的拓展应用。它假设随机游走粒子在每走一步的时候都以一定概率返回初始位置。设粒子返回概率为 1-c，&amp;lt;math&amp;gt;P&amp;lt;/math&amp;gt; 为网络的马尔科夫概率转移矩阵，其元素 &amp;lt;math&amp;gt;P_{xy} = a_{xy}/k_{x} &amp;lt;/math&amp;gt;表示节点x处的粒子下一步走到节点y的概率。其中如果节点x和节点y相连，则&amp;lt;math&amp;gt;a_{xy}=1&amp;lt;/math&amp;gt;，否则&amp;lt;math&amp;gt;a_{xy}=0&amp;lt;/math&amp;gt;。某一粒子初始时刻在节点x处，那么t+1时刻该粒子到达网络各个节点的概率向量为&lt;br /&gt;
&amp;lt;math&amp;gt;q_{x}(t+1) = c \cdot P^{T}q_{x}(t) + (1-c) e_{x}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;e_{x}&amp;lt;/math&amp;gt;表示初始状态（其定义与Cos+中相同），上式的稳态解为&amp;lt;math&amp;gt;q_{x} = (1-c)(I-cP^{T})^{-1}e_{x}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中元素&amp;lt;math&amp;gt;q_{xy}&amp;lt;/math&amp;gt;为从节点x出发的粒子最终有多少概率走到节点y。由此定义RWR相似性如下：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{RWR} = q_{xy} + q_{yx} &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
4.SimRank指标 SimR&lt;br /&gt;
&lt;br /&gt;
它的基本假设是，如果两节点所连接的节点相似，那么这两个节点就相似。其自洽定义式为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{simR}=C\frac{\sum_{v_z\in \Gamma (x)}\sum_{{v_z}'\in \Gamma (y)}s_{zz'}^{simR}}{k_xk_y}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中假定 &amp;lt;math&amp;gt;s_{xx} =1, C \in [0,1] &amp;lt;/math&amp;gt;为相似性传递时的衰减参数。&lt;br /&gt;
&lt;br /&gt;
SimR指标同时考虑了结构等价和一般等价。当节点x的邻居z同时也是节点y的邻居时，该指标考虑了结构等价；当节点x不等于节点y时，该指标概率了一般等价。可以证明，SimR指标可以用来描述两个分别从节点x和y出发的粒子平均过多久会相遇。&lt;br /&gt;
&lt;br /&gt;
5.局部随机游走指标 LRW&lt;br /&gt;
&lt;br /&gt;
上述4种随机游走指标是基于全局的随机游走，这类指标往往计算复杂度很高，因此很难在大规模网络上应用。刘伟平和吕琳媛提出了一种基于网络局部随机游走的相似性指标LRW，它只考虑有限步数的随机游走过程。一个粒子 t 时刻从节点x出发，定义&amp;lt;math&amp;gt;π_{xy} (t) &amp;lt;/math&amp;gt;为 t+1 时刻这个粒子正好走到节点y的概率，那么可得到系统演化方程：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\pi_{x} (t + 1) = P^T\pi_{x}(t)，t=0,1,…&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\pi_{x}(0) &amp;lt;/math&amp;gt;为一个&amp;lt;math&amp;gt;Nx1 &amp;lt;/math&amp;gt;的向量，只有第x 个元素为1，其他为0，即&amp;lt;math&amp;gt;\pi_{x}(0) =e_x&amp;lt;/math&amp;gt;。设定各个节点的初始资源分布为&amp;lt;math&amp;gt;q_x&amp;lt;/math&amp;gt;，那么基于t步随机游走的相似性为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{LRW} = q_{xy} + q_{yx}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
6.叠加的局部随机游走指标 SRW&lt;br /&gt;
&lt;br /&gt;
这个指标给邻近目标节点的点更多的机会与目标节点相连，充分考虑了很多真实网络连接上的局域性特点，它是在LRW的基础上，将t步及其以前的结果加总，便得到SRW的值，即：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{SRW}(t)=\sum_{t}^{l=1}s_{xy}^{LRW}(l) = q_x\sum_{t}^{l=1}\pi_{xy}(l) + q_y\sum_{t}^{l=1}\pi_{yx}(l)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===基于似然分析的链路预测===&lt;br /&gt;
&lt;br /&gt;
基于相似性的链路预测方法，是最简单的一种分析框架，除此之外，还有另一种最复杂的链路预测分析框架——基于似然分析的链路预测。这个框架本身远远复杂于基于相似性的框架，而且框架中的每一个组成成分自身都非常复杂，但这个框架下衍生出的算法除了给出链路预测的结果之外，还给出了我们对于网络结构的深刻洞见，例如“'''层次结构模型 Hierachical structure model'''”给出了网路层次组织形态的定量刻画，“'''随机分块模型 Stochastic block model'''”类似于社区分解一样把网络划分成了若干子块。这些对理解网络结构特征方面的贡献，是基于相似性的框架所不能提供的。&lt;br /&gt;
&lt;br /&gt;
基于似然分析的链路预测的基本思路是：根据网络结构的产生和组织方式以及目前已经观察到的链路计算网络的似然值，并认为真实的网络使得网络似然值最大，然后再根据网络似然最大化计算每一对未连接的节点产生连边的可能性。&lt;br /&gt;
&lt;br /&gt;
*层次结构模型 HSM&lt;br /&gt;
&lt;br /&gt;
层次结构模型假设真实的网络都存在某种层次性，网络的连接则可看作是这种内在层次结构的反映。该方法的计算步骤如下：&lt;br /&gt;
&lt;br /&gt;
1.一个N个节点的网络可以用一个包含N个叶子节点的族谱树表示，这N个叶子节点将由N-1个非叶子节点连接起来，其中每个非叶子节点都有一个概率值，则两个叶子节点连接的概率就等于他们最近共同祖先节点的概率值。给定一个族谱树，将网络的似然值最大化，就可以得到非叶子节点的概率值，并由此计算出这一个族谱树所对应的网络最大的似然值。&lt;br /&gt;
&lt;br /&gt;
2.使用马尔科夫链蒙特卡洛方法对网络不同的族谱树进行抽样，使得每个族谱树出现的频次正比于该树对应的最大的网络似然值。两个节点连边的概率就等于所有抽样出来的族谱树中两个节点连边概率的平均值。注意似然高的族谱树会出现多次，因此对这个平均概率的贡献也大。&lt;br /&gt;
&lt;br /&gt;
3.把平均连边概率看做是相似性框架中的相似性指标&amp;lt;math&amp;gt;s_{xy}&amp;lt;/math&amp;gt;，按照这个值从大到小排序，排在前面的就是预测的连边。&lt;br /&gt;
&lt;br /&gt;
需要指出的是，层次结构模型在处理具有明显层次结构的网络（如恐怖袭击网络和草原食物链）时具有较高的精确度，但在处理一般性网络时效果并不一定突出。&lt;br /&gt;
&lt;br /&gt;
*随机分块模型 SBM&lt;br /&gt;
&lt;br /&gt;
与层次结构模型的思想类似，随机分块模型假设网络中的节点可以被分为若干集合，两个节点间连接的概率只与相应的集合有关。换句话说，同一个群众所有节点的地位是相同的。随机分块模型特别适合刻画节点所属群的成员身份对于其连接行为有关键影响的情况，例如，著名的“角色模型”就包含了随机分块模型的理念。&lt;br /&gt;
&lt;br /&gt;
随机分块模型的效果要好于层次结构模型。同时，该方法还可以剔除网络的错误连边，如纠正蛋白质相互作用网络中的错误连边。&lt;br /&gt;
&lt;br /&gt;
*闭路模型 Loop model&lt;br /&gt;
&lt;br /&gt;
似然分析的更一般的框架是：给定一个网络系统，特定网络哈密顿量的负指数被统计分配函数归一化后，就得到这个网络出现的似然，一条未被观察到的连边存在的可能性就等于添加这条连边后网络的似然值。闭路模型考虑网络结构形成中的“局部性原则”，并由此定义了网络的哈密顿量。实验表明，闭路模型的预测精度大于层次结构模型和随机分块模型。&lt;br /&gt;
&lt;br /&gt;
===基于机器学习的链路预测===&lt;br /&gt;
&lt;br /&gt;
用机器学习的思路进行链路预测，主要分为基于特征分类方法、基于概率图模型方法和基于矩阵分解方法三大类。&lt;br /&gt;
&lt;br /&gt;
*基于特征分类方法&lt;br /&gt;
&lt;br /&gt;
网络中的链路预测问题可以看成机器学习中的分类问题，其中每个数据点对应一对节点之间关系的标记，假定两个节点之间存在连边，则数据点的值为+1，否则为-1。特征选取是分类问题中最重要的问题之一，目前研究较多的主要包括基于节点与边的属性特征和基于节点所处网络的拓扑结构特征（如CN、AA、Katz、最短路径）等。哈桑 Hasan 等人提取合著网络中科学家研究领域的关键词作为特征，用监督学习中一些常用的分类算法（如决策树、K近邻法、多层感知器、支持向量机、径向基网络）对缺失的连边进行较为精准的预测，其中以支持向量机方法表现最佳。&lt;br /&gt;
&lt;br /&gt;
*基于概率图模型&lt;br /&gt;
&lt;br /&gt;
基于概率图模型的链路预测方法使用图模型来表达节点之间的连边概率，根据模型中概率依赖关系，可分为有向无环的贝叶斯网络和无向的马尔科夫网络。随机分块模型和层次结构模型分别是典型的基于贝叶斯网络和基于马尔科夫网络的链路预测方法。基于概率图模型的链路预测方法有很多，典型的还有有监督随机游走链路预测算法，将网络结构信息与节点和连边的属性信息结合起来，给每条边分配不同的转移概率。与其他有监督的机器学习方法相比，该算法无须知道网络的特征和相关的领域知识。&lt;br /&gt;
&lt;br /&gt;
*基于矩阵分解&lt;br /&gt;
&lt;br /&gt;
基于矩阵分解的链路预测方法是基于网络邻接矩阵的代数谱变换而得到的方法，来预测网络中链路的存在性和链路的权值。相比其他几种机器学习方法，该方法要学习的参数少很多，但计算复杂度较高。链路预测问题可以视为邻接矩阵填充问题，并可以通过双线性回归模型将节点和链路的显特征和隐特征结合起来用矩阵分解方法解决。边缘去噪模型将根据给定关系矩阵求未知边或丢失边的问题变成一个矩阵降噪去噪问题。&lt;br /&gt;
&lt;br /&gt;
关于不同的链路预测研究方法的分类可以参考下表：&lt;br /&gt;
[[File:Link preditction method.png|600px|thumb|三类不同的链路预测方法（*表示该方法含有参数）|center]]&lt;br /&gt;
&lt;br /&gt;
==应用场景==&lt;br /&gt;
链路预测有着广泛的应用场景：在生物领域，利用蛋白质间相互作用关系的结构信息进行链路预测，可以为实验的测定提前提供参考依据，从而降低实验成本、提高成功率；在社交网络领域，链路预测可以对社交网络中的好友关系、朋友推荐进行预测，从而提高用户对社交网站的体验满意度和使用黏性；在电子商务领域，除了传统的协同过滤推荐算法外，利用网络结构信息（如网络三角形结构）等特征进行商品推荐也取得了显著的优势；此外，通过识别隐藏的链边或异常的链边对信息不完全或含有噪音的网络进行重构，可以提高网络的传输能力，这对于航空网络重构有很大的启发意义。&lt;br /&gt;
[[File:Figure2.png|400px|thumb|链路预测应用场景示意图（图片来自网络）|center]]&lt;br /&gt;
&lt;br /&gt;
除此之外，链路预测的算法和思想通过一些变换还可以用来解决一些看似没有太大关系的问题。例如，对疾病信号和股票指数的预测。基于链路预测的思想和方法，我们还可以设计基于节点相似性的社团划分以及对网络演化模型的定量化评估方法。链路预测还可以帮助提高节点标签预测的精度，特别是在已知标签节点稀疏的情况下效果显著。这一方法可以应用于判断一篇学术论文的类型，判断一本书的政治态度（中立、自由派或保守派），或者判断一个手机用户是否产生了更换电信运营商的念头。&lt;br /&gt;
&lt;br /&gt;
==代表人物==&lt;br /&gt;
*'''吕琳媛'''&lt;br /&gt;
吕琳媛主要研究方向为复杂网络信息挖掘领域，包括海量信息导航、挖掘、推荐和预测。目前担任阿里巴巴复杂科学研究中心副主任，中欧联合实验室执行主任，中国工业与应用数学学会复杂网络与系统控制专业委员会委员，杭州市特聘专家。&lt;br /&gt;
[[File:Lvlinyuan.png|400px|thumb|吕琳媛，阿里巴巴复杂科学研究中心副主任|center]]&lt;br /&gt;
&lt;br /&gt;
近年来主持/参与国家级项目5项（2016年获得国家自然科学基金优秀青年基金），省部级项目4项，横向课题4项。 在相关领域发表学术论文 50余篇，其中SCI论文39篇，总影响因子122，发表期刊包括Physics Reports，PNAS，Nature Communications等国际知名学术期刊。三篇论文入选ESI全球Top-1%高引用论文，论文SCI引用1200余次，谷歌学术引用3000余次，其中9篇论文引用超过100次。2013年出版学术专著《链路预测》获得第四届中国大学出版社图书奖优秀学术著作一等奖。申请发明专利12项。2015年荣获浙江省杰出青年基金，2014年荣获中国计算机学会自然科学二等奖，中国网络科学论坛青年希望奖，首届CCF-腾讯犀牛鸟基金优秀奖。&lt;br /&gt;
&lt;br /&gt;
*'''周涛'''&lt;br /&gt;
周涛主要从事复杂性科学和大数据挖掘算法和应用研究，先后攻克推荐系统准确性-多样性困境、复杂网络链路可预测性、H指数-度-核心度关系等图挖掘领域的重要难题，成果发表在PNAS, Nature Communications, Physics Reports, KDD和ICDM等国际顶尖期刊和会议上。目前论文google总引用超过14000次，其中8篇论文入选ESI高引用论文，H指数为57，2014和2015连续两年入选Elsevier最具国际影响力中国科学家名单。&lt;br /&gt;
[[File:Zhoutao.png|400px|thumb|周涛，第十二届中国青年科技奖|center]]&lt;br /&gt;
&lt;br /&gt;
因其在科学研究上的杰出表现，2011年获得第十二届中国青年科技奖（最年轻获奖者），2011年入选四川省“百人计划”，2012年获得国家首批优秀青年科学基金资助，2013年入选国家“万人计划”首批青年拔尖人才支持计划，2014年获得四川省科技进步一等奖、中国计算机学会自然科学奖，2015年获得共青团中央授予的“最美青年科技工作者”称号，并与屠呦呦等七名个人和北斗导航等三个团队共同当选2015年度中国十大科技创新人物。&lt;br /&gt;
&lt;br /&gt;
*'''马克·纽曼 Mark Newman'''&lt;br /&gt;
Newman是一名英裔美国物理学家，也是密歇根大学 University of Michigan 物理学系的阿纳托尔·拉波特 Anatol Rapoport 杰出教授，也是圣达菲研究所 Santa Fe Institute 的外部教员。他因在复杂网络和复杂系统领域的基础性贡献而闻名，为此他被授予2014年拉格朗日奖。&lt;br /&gt;
[[File:Newman.png|400px|thumb|Mark Newman，密歇根大学物理学系阿纳托尔·拉波特杰出教授|center]]&lt;br /&gt;
&lt;br /&gt;
Newman以其对复杂网络的研究而著称，尤其是在科学家的协作模式，随机图论 Random graph theory，社区结构 Community structure，渗流理论 Percolation theory 和网络流行病学 Network epidemiology方面的工作。他作为共同发明人，与迈克尔·卡斯特 Michael Gastner 一起，发明了一种可以产生密度均衡地图 Density-equalizing maps 或统计地图 Cartograms的方法，该方法构成了Worldmapper网站的基础。他们的工作在2004年美国总统大选后受到关注，成为了当时被广泛传播的一种选举结果地图的基础，（他们）根据各州的人口数调整了州的规模，以便更准确地了解每个党派的选民投票人数。&lt;br /&gt;
&lt;br /&gt;
*'''克里斯托弗·大卫·摩尔 Cristopher David Moore'''&lt;br /&gt;
克里斯托弗·大卫·摩尔 Cristopher David Moore，也称为克里斯·摩尔 Cris Moore 是美国计算机科学家，数学家和物理学家。他是圣达菲研究所的驻校教师，曾任新墨西哥大学 University of New Mexico 的正教授。&lt;br /&gt;
[[File:Cristopher_David_Moore.png|400px|thumb|Cristopher David Moore，圣达菲研究所的驻校教师|center]]&lt;br /&gt;
&lt;br /&gt;
1993年，Moore 发现了一种新颖的解决三体问题的方法，表明在牛顿力学中，三个等质量的物体有可能沿着一条八字形曲线、在同一条轨道相互跟随。Moore 在网络科学领域也很活跃，在该领域有许多著名的出版物。在与Clauset和Mark Newman的合作中，Moore开发了复杂网络的层次聚类概率模型，并表明他们的模型可以在面对网络连接结构发生变化时可靠地预测聚类结果。&lt;br /&gt;
&lt;br /&gt;
*'''亚伦·克劳斯特 Aaron Clauset '''&lt;br /&gt;
Aaron Clauset是一位美国计算机科学家，致力于网络科学，机器学习和复杂系统领域。目前，他在科罗拉多大学博尔德分校 University of Colorado Boulder 教授计算机科学，也是圣菲研究所的外部教员。&lt;br /&gt;
[[File:Aaron_Clauset.png|400px|thumb|  Aaron Clauset，圣菲研究所的外部教员|center]]&lt;br /&gt;
&lt;br /&gt;
Clauset因与Cosma Shalizi和Mark Newman进行的合作研究而闻名，他们针对经验数据中是否存在幂律模式开发了严格的统计检验，并且证明了许多宣称符合幂律分布的网络实际上并不是幂律分布。他还因开发检测复杂网络中的社区结构算法的工作而著称，特别是和Newman、Moore合作发展的网络层次聚类模型。在其他方面，Clauslet 与麦克斯韦·扬 Maxwell Young 、克里斯蒂安·斯克雷德·格莱蒂奇 Kristian Skrede Gleditsch 共同完成了一些独特发现：世界范围内恐怖事件发生的频率和严重性服从幂律分布。&lt;br /&gt;
&lt;br /&gt;
2015年，Clauset 因开发和评估一种网络结构特征的新方法而获得了美国国家科学基金会颁发的著名的CAREER奖。2016年，Clauset因在网络结构方面（包括Internet映射，推断缺失链接和社区结构），以及对人类冲突和社会分层所做的启发性分析方面做出的贡献而获得网络科学学会颁发的网络科学领域的Erdös-Rényi奖。&lt;br /&gt;
&lt;br /&gt;
==参考资料==&lt;br /&gt;
*汪小帆,李翔,陈关荣.《网络科学导论》.北京：高等教育出版社,2012年：178-186&lt;br /&gt;
*吕琳媛,周涛.《链路预测》.北京：高等教育出版社,2013年：57-93&lt;br /&gt;
*吕琳媛,任晓龙,周涛.《网络链路预测：概念与前沿》[J].《中国计算机学会通讯》,2016年,第4期&lt;br /&gt;
*Clauset A, Moore C, Newman M E J. Hierarchical structure and the prediction of missing links in networks [J]. Nature, 2008,453(7191): 98-101.&lt;br /&gt;
*&amp;lt;ref name=&amp;quot;&amp;quot;&amp;gt;Sørensen, T, Sørensen, T A, Sørensen, T J (1948) [https://pattern.swarma.org/paper?id=ea7f2902-6e74-11ea-9db3-0242ac1a0005 A method of establishing groups of equal amplitude in plant sociology based on similarity of species content and its application to analyses of the vegetation on Danish commons].&amp;lt;/ref&amp;gt;&lt;br /&gt;
*Link Prediction Group 网站：http://www.linkprediction.org/&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
*链接预测可用于分析网络将如何发展，或者在给定信息不完整情况下来发现“丢失”的链接，对于这个问题，有研究者提出了一种新的，结合广义群贴近度中心性和半值相互作用指数的拟局部方法（即考虑半径k内节点的方法），详见 [https://swarma.org/?p=18249 《链路预测的博弈算法》]&lt;br /&gt;
[[File:链路预测的博弈算法.jpg|400px|thumb|[https://swarma.org/?p=18249 《链路预测的博弈算法》]|center]]&lt;br /&gt;
*深度学习已经成功地在图像识别、语音识别、自然语言处理、游戏与博弈等领域取得了突飞猛进的发展，并渗透到了我们的日常生活中。那么，我们有没有可能将这种技术借剪到复杂网 络的研究之中呢？近年来，人们凭借着网络嵌入（Network Embedding）、图卷积神经网络（Graph Convolutional Neural Network）、图注意力模型（Graph Attention Network）等新技术，已经开发了若干图结构上的深度学习算法，并取得了一定的成功应用。北师大系统科学学院教授、博导张江老师亲授[https://campus.swarma.org/play/coursedetail?id=10504 《当复杂网络遇上机器学习》]，将对这些算法以及应用，包括各式各样的网络嵌入算法、节点分类问题、链路预测问题、图分类问题、网络动力学预测问题等做一简单介绍，并对网络上的深度学习问题进行了展望。&lt;br /&gt;
[[File:当复杂网络遇上机器学习.png|400px|thumb|[https://campus.swarma.org/play/coursedetail?id=10504 《当复杂网络遇上机器学习》]|center]]&lt;br /&gt;
*网络上的注意力模型（Graph Attention Model）是一种通用的网络嵌入算法，它能够在节点分类、链路预测等问题上得到极高的精度。它可以模仿一个机器头对网络中的节点进行信息读取和分析，然后将综合的结果放到节点的向量中的过程。[https://campus.swarma.org/play/coursedetail?id=10385 《网络上的注意力模型》]课程将详细介绍这一模型及其应用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''''本中文词条由[[用户:木子二月鸟|木子二月鸟]]用户参与编译，  [[用户: 苏格兰| 苏格兰]]用户审校，欢迎在讨论页面留言'''''。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''本词条内容源自wikipedia及公开资料，遵守 CC3.0协议。'''&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E9%93%BE%E8%B7%AF%E9%A2%84%E6%B5%8B&amp;diff=7626</id>
		<title>链路预测</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E9%93%BE%E8%B7%AF%E9%A2%84%E6%B5%8B&amp;diff=7626"/>
		<updated>2020-05-10T13:58:09Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：/* 基于相似性的链路预测 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{#seo:|keywords=链路预测 Link Prediction  |description=通过已知的网络节点以及网络结构等信息，预测网络中尚未产生连边的两个节点之间产生连接的可能性。 }}&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
'''链路预测 Link Prediction'''是指如何通过已知的网络节点以及网络结构等信息，预测网络中尚未产生连边的两个节点之间产生连接的可能性。这种预测既包含了对未知链接 Existing yet unknown link，也称丢失链接 Missing link 的预测，也包含了对未来链接 Future link 的预测。&lt;br /&gt;
&lt;br /&gt;
链路预测是将复杂网络与信息科学联系起来的重要桥梁之一，它所要处理的是信息科学中最基本的问题——缺失信息的还原与预测。链路预测相关研究不仅能够推动网络科学和信息科学理论上的发展，而且具有巨大的实际应用价值，譬如可以知道蛋白质相互作用实验、进行在线社交推荐、找出交通传输网络中有特别重要作用的连边等。&lt;br /&gt;
&lt;br /&gt;
==研究方法==&lt;br /&gt;
===基于相似性的链路预测===&lt;br /&gt;
&lt;br /&gt;
*基于局部信息的相似性指标&lt;br /&gt;
&lt;br /&gt;
社会网络分析中经典的三元闭包 Triadic closure 原则指出，如果A、B	两个人拥有一个共同的朋友C，那么这两个人今后也很有可能成为朋友，从而使得3个节点构成一个闭合的三角形ABC。对于一般的网络，我们可以把这一原则推广如下：两个节点的共同邻居越多，这两个节点就越相似，从而更倾向于相互连接。最简单的基于'''共同邻居 Common neighbors''' 的节点相似性指标定义如下：&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
s_{xy}^{CN} =  |Γ(x)| \cap |Γ(y)|&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
在相似性指标定义的基础上，还可以考虑两个节点的共同邻居的相对数量。下表列出了10种基于节点局部信息的相似性指标，第1种是计算共同邻居相似度的基本公式，其中第2至7种相似性指标是直接基于共同邻居指标的不同的规范化而得到的，表中的 k(x) = |Γ(x)| 为节点x的度。第8种指标PA是基于BA无标度网络模型中新加入节点倾向于和度大的节点相连的优先连接机制而提出的。&lt;br /&gt;
&lt;br /&gt;
第9种指标AA的基本思想是度小的共同邻居节点的贡献大于度大的共同邻居节点，因此根据共同邻居节点的度为每个节点赋予一个权重值。这一点很容易理解，例如在微博中受关注较多的人往往是某个领域的专家或名人，因此共同关注他们的人之间可能并不拥有特别相似的兴趣——一个中学生和一个企业家都有可能是姚晨的粉丝。相反，如果两个人共同关注了一个粉丝很少的人（非名人），那么说明这两个人确实具有相同的兴趣爱好或者重叠的社交圈，因此有更高概率相连。又如在推荐系统中，共同购买冷门产品的两个用户往往比共同购买热门产品的用户更相似。&lt;br /&gt;
[[File:Table1.png|600px|thumb|10种基于节点局部信息的相似性指标|center]]&lt;br /&gt;
&lt;br /&gt;
{|class=&amp;quot;10种基于节点局部信息的相似性指标&amp;quot;&lt;br /&gt;
|+ mfinder&lt;br /&gt;
|-&lt;br /&gt;
!rowspan=&amp;quot;1&amp;quot;|名称&lt;br /&gt;
!rowspan=&amp;quot;1&amp;quot;|定义&lt;br /&gt;
!rowspan=&amp;quot;1&amp;quot;|名称&lt;br /&gt;
!rowspan=&amp;quot;1&amp;quot;|定义&lt;br /&gt;
|-&lt;br /&gt;
|rowspan=&amp;quot;1&amp;quot;|(1)共同邻居（CN）.&lt;br /&gt;
|rowspan=&amp;quot;1&amp;quot;|&amp;lt;math&amp;gt;s_{xy}^{CN} =  |Γ(x)| \cap |Γ(y)|&amp;lt;/math&amp;gt;&lt;br /&gt;
|rowspan=&amp;quot;1&amp;quot;|(6)大度节点不利指标（HDI）&lt;br /&gt;
|rowspan=&amp;quot;1&amp;quot;|&amp;lt;math&amp;gt;s_{xy}=\frac{2 x |Γ(x)| \cap |Γ(y)|}{max\{k_x,k_y\}}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
第10种指标RA是受网络资源分配过程的启发，周涛等人提出的“'''资源分配指标 Resource allocation'''”，其与AA指标有异曲同工之妙。RA和AA指标最大的区别就在于赋予共同邻居节点权重的方式不同，前者是以 1/k 的形式递减，后者是以 1/logk 的形式递减。可见，当网络的平均度较小时，RA和AA差别不大；但是当平均度较大时，就有很大的区别了。研究显示，RA指标在刻画加权网络和社区挖掘应用中的表现胜过AA指标，图灵奖得主Hopdroft的一篇论文也显示，可以利用社区等中观结构信息改进局部指标，其中RA指标改进后的效果最佳。&lt;br /&gt;
&lt;br /&gt;
*基于路径的相似性指标&lt;br /&gt;
&lt;br /&gt;
基于共同邻居的相似性指标的优势在于计算复杂度较低，但是由于使用的信息非常有限，预测精度受到限制，因此发展出了基于路径的相似性指标，主要有3个，分别是局部路径指标 Local path 、Katz指标和LHN-II指标。&lt;br /&gt;
&lt;br /&gt;
1.局部路径指标&lt;br /&gt;
&lt;br /&gt;
周涛等人在共同邻居的基础上考虑三阶路径的因素，提出了基于局部路径的相似性指标，其定义为 &amp;lt;math&amp;gt; S=A^2+\alpha A^3&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 为可调参数，A 表示网络的邻接矩阵， &amp;lt;math&amp;gt;(A^3)_{xy}&amp;lt;/math&amp;gt;表示节点 &amp;lt;math&amp;gt;V_x&amp;lt;/math&amp;gt; 和 &amp;lt;math&amp;gt;V_y&amp;lt;/math&amp;gt; 之间长度为3的路径数目。当&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; = 0时，LP指标就退化为 CN 指标。 CN 指标本质上也可看成基于路径的指标，只是它仅考虑了二阶路径数目。局部路径指标可以扩展为更高阶的情形，即考虑n阶路径的情况：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt; S^n=A^2+\alpha\cdot A^3+\alpha^2\cdot A^4+\cdots +\alpha^{n-2}\cdot A^n &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
随着 n 的增加，局部路径指标的计算复杂度越来越大。一般而言，考虑 n 阶路径的计算复杂度为O(N&amp;lt;k&amp;gt;^n)。但是当 n 趋于无穷大的时候，局部路径指标相当于考虑网络全部路径的Katz指标，此时计算量反而有可能下降，因为可转变为计算矩阵的逆。&lt;br /&gt;
&lt;br /&gt;
2.Katz指标&lt;br /&gt;
&lt;br /&gt;
Katz指标考虑了所有网络的路径，因此其定义为：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S_{xy}=\sum_{l=1}^{\infty }\alpha^l\cdot\left |  paths_{x,y}^{&amp;lt;l&amp;gt;} \right |= \alpha A_{xy}+\alpha^2\cdot (A^2)_{xy}+\alpha^3\cdot (A^3)_{xy}+\cdots  &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\alpha &amp;gt; 0&amp;lt;/math&amp;gt; 为控制路径权重的可调参数，&amp;lt;math&amp;gt;\left |  paths_{x,y}^{&amp;lt;l&amp;gt;} \right |&amp;lt;/math&amp;gt;表示连接节点 &amp;lt;math&amp;gt;V_x&amp;lt;/math&amp;gt;和  &amp;lt;math&amp;gt;V_y&amp;lt;/math&amp;gt; 的路径中长度为 l 的路径数。要使上述级数收敛，则参数&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 应小于邻接矩阵最大特征值的倒数，此定义还可以表示为：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S = (I - \alpha\cdot A)^{-1} - I&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
显然，当参数&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 很小时，高阶路径的贡献也较小，使得 Katz 指标的预测结果接近于局部路径指标。&lt;br /&gt;
&lt;br /&gt;
3.LHN-II指标&lt;br /&gt;
&lt;br /&gt;
LHN-II 指标是 Leicht，Holme 和 Newman 提出的另一种相似性计算方法，他的基本思想是基于'''一般等价 Regular equivalence''' 提出的。与结构等价不同，一般等价的定义更广泛。在一般等价的定义下，如果两个节点所连接的节点之间相似，那么这两个节点也相似，即使它们之间没有共同的邻居节点。&lt;br /&gt;
&lt;br /&gt;
下图给出了一个简单的例子来帮助我们理解结构等价和一般等价的区别。根据结构等价的定义，在公司A内部，由于员工a和员工b都认识员工e和员工f（即它们有两个共同邻居节点），于是称员工a和员工b是结构等价的。同理，员工e和员工f也是结构等价的，同样地，在公司B中，员工c和员工d是结构等价的，员工g和员工h也是结构等价的。现在考虑员工a和员工c是否相似？根据一般等价的定义，由于员工a连接的节点e、f与员工c连接的节点g、h分别是相似的，那么我们可以认为员工a和员工c也是相似的，同理，在一般等价的意义下，员工b和员工d也是相似。从这个例子可以看出，结构相似性或称结构等价更强调的是两个节点是否在同一个环境下，也就是说是否连接了相同的节点；然而一般等价考虑的是这两个节点是否处于同样的角色，即使他们没有相同的邻居节点，但是由于各自的邻居节点之间本身相似，这两个节点也相似。一般等价意义下的相似性是LHN-II指标的核心。&lt;br /&gt;
&lt;br /&gt;
[[File:一般等价和结构等价示例.png|600px|thumb|一般等价和结构等价示例（图中实线表示连接，虚线表示相似关系）|center]]&lt;br /&gt;
&lt;br /&gt;
从一般等价的角度考虑，LHN-II指标认为如果两个节点的邻居节点之间是相似的，那么这两个节点也是相似的。它与Katz指标的区别主要是把Katz指标中的&amp;lt;math&amp;gt; (A^{n})_{xy} &amp;lt;/math&amp;gt;变成 &amp;lt;math&amp;gt;  (A^{n})_{xy}&amp;lt;/math&amp;gt; 的期望值，注意到 &amp;lt;math&amp;gt; (A^{n})_{xy}&amp;lt;/math&amp;gt; 的期望值为 &amp;lt;math&amp;gt; E\left [ (A^l)_{xy} \right ]=\frac{k_xk_y}{M}\lambda _1^{l-1}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\lambda_1&amp;lt;/math&amp;gt;为矩阵A的最大特征值，则LHN-II指标的表达式如下：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 S_{xy}^{LHN2}=\delta _{xy} + \sum_{l=1}^{\infty }\Phi ^l \frac{(A^l)_{xy}}{E\left [ (A^l)_{xy} \right ]}&lt;br /&gt;
=\delta _{xy} + \frac{2M}{k_xk_y}\sum_{l=1}^{\infty }\Phi ^l\lambda _1^{1-l}(A^l)_{xy}&lt;br /&gt;
=\left [ 1 - \frac{2 M \lambda_1}{k_xk_y} \right ]\delta _{xy} + \frac{2 M \lambda_1}{k_xk_y}\left [ (I-\frac{\Phi}{\lambda_1} A )^{-1} \right ]_{xy}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\delta _{xy}&amp;lt;/math&amp;gt;为 Kronecker &amp;lt;math&amp;gt;\delta&amp;lt;/math&amp;gt; 函数，&amp;lt;math&amp;gt; \Phi&amp;lt;/math&amp;gt; 为取值小于1的参数。上式最后一个等式的第一项是可以去掉的对角阵，从而相似性矩阵可以写为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S=2M\lambda_1D^{-1}(I-\frac{\Phi A}{\lambda_1})^{-1}D^{-1}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中''D''为度值矩阵，&amp;lt;math&amp;gt;D_{xy} = \delta_{xy} \cdot k_{x}&amp;lt;/math&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
*基于随机游走的节点相似性指标&lt;br /&gt;
&lt;br /&gt;
还有相当数量的相似性指标是基于随机游走过程定义的，包括'''平均通勤时间 Average commute time''' 、'''Cos+指标'''、'''有重启的随机游走 Random walk with restart'''、'''SimRank'''指标、'''局部随机游走指标 Local random walk''' 和'''有叠加效应的随机游走指标 Superposed random walk'''等。&lt;br /&gt;
&lt;br /&gt;
1.平均通勤时间 ACT &lt;br /&gt;
&lt;br /&gt;
设&amp;lt;math&amp;gt;m(x,y)&amp;lt;/math&amp;gt; 为一个随机粒子从节点x到节点y平均需要走的步数，那么节点x和y的平均通勤时间定义为：&amp;lt;math&amp;gt;n(x , y) = m(x , y) + m(y , x) &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其数值解可通过求该网络拉普拉斯矩阵&amp;lt;math&amp;gt;L&amp;lt;/math&amp;gt; 的伪逆&amp;lt;math&amp;gt; L^+&amp;lt;/math&amp;gt; 获得，即 &amp;lt;math&amp;gt;n(x,y)=M(l^+_{xx} +l^+_{yy} - 2l^+_{xy})&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;l^{+}_{xy}&amp;lt;/math&amp;gt;表示矩阵&amp;lt;math&amp;gt;L^+ &amp;lt;/math&amp;gt;中相应位置的元素。如果两个节点的平均通勤时间越小，那么两个节点越进阶。由此，定义基于ACT的相似性为（在此可忽略常数M）&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{ACT}=\frac{1}{l^+_{xx} +l^+_{yy} - 2l^+_{xy}}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
2.余弦相似性指标 Cos+指标&lt;br /&gt;
&lt;br /&gt;
在由向量&amp;lt;math&amp;gt;v_x = \Lambda ^{1/2}U^{T}e_{x}&amp;lt;/math&amp;gt;展开的欧式空间内，&amp;lt;math&amp;gt;L^+ &amp;lt;/math&amp;gt;中的元素&amp;lt;math&amp;gt;l^{+}_{xy}&amp;lt;/math&amp;gt;可表示为两向量&amp;lt;math&amp;gt;v_x&amp;lt;/math&amp;gt;和&amp;lt;math&amp;gt;v_y&amp;lt;/math&amp;gt;的内积，即&amp;lt;math&amp;gt; l^{+}_{xy} = v_{x}^{T} v_y&amp;lt;/math&amp;gt;，其中&amp;lt;math&amp;gt;U&amp;lt;/math&amp;gt;是一个标准正交矩阵，由&amp;lt;math&amp;gt;L^+&amp;lt;/math&amp;gt;特征向量按照对应的特征根从大到小排列，&amp;lt;math&amp;gt;\Lambda&amp;lt;/math&amp;gt;为以特征根为对角元素的对角矩阵，&amp;lt;math&amp;gt;e_{x}&amp;lt;/math&amp;gt; 表示一个一维向量且只有第x个元素为1，其他都为0。由此定义余弦相似性如下：&lt;br /&gt;
&lt;br /&gt;
s_{xy}^{cos+}=cos(x,y)^+=\frac{l_{xy}^+}{\sqrt{l^+_{xx} \cdot l^+_{yy}}}&lt;br /&gt;
&lt;br /&gt;
3.重启的随机游走 RWR&lt;br /&gt;
&lt;br /&gt;
这个指标可以看成是PageRank 算法的拓展应用。它假设随机游走粒子在每走一步的时候都以一定概率返回初始位置。设粒子返回概率为 1-c，&amp;lt;math&amp;gt;P&amp;lt;/math&amp;gt; 为网络的马尔科夫概率转移矩阵，其元素 &amp;lt;math&amp;gt;P_{xy} = a_{xy}/k_{x} &amp;lt;/math&amp;gt;表示节点x处的粒子下一步走到节点y的概率。其中如果节点x和节点y相连，则&amp;lt;math&amp;gt;a_{xy}=1&amp;lt;/math&amp;gt;，否则&amp;lt;math&amp;gt;a_{xy}=0&amp;lt;/math&amp;gt;。某一粒子初始时刻在节点x处，那么t+1时刻该粒子到达网络各个节点的概率向量为&lt;br /&gt;
&amp;lt;math&amp;gt;q_{x}(t+1) = c \cdot P^{T}q_{x}(t) + (1-c) e_{x}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;e_{x}&amp;lt;/math&amp;gt;表示初始状态（其定义与Cos+中相同），上式的稳态解为&amp;lt;math&amp;gt;q_{x} = (1-c)(I-cP^{T})^{-1}e_{x}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中元素&amp;lt;math&amp;gt;q_{xy}&amp;lt;/math&amp;gt;为从节点x出发的粒子最终有多少概率走到节点y。由此定义RWR相似性如下：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{RWR} = q_{xy} + q_{yx} &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
4.SimRank指标 SimR&lt;br /&gt;
&lt;br /&gt;
它的基本假设是，如果两节点所连接的节点相似，那么这两个节点就相似。其自洽定义式为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{simR}=C\frac{\sum_{v_z\in \Gamma (x)}\sum_{{v_z}'\in \Gamma (y)}s_{zz'}^{simR}}{k_xk_y}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中假定 &amp;lt;math&amp;gt;s_{xx} =1, C \in [0,1] &amp;lt;/math&amp;gt;为相似性传递时的衰减参数。&lt;br /&gt;
&lt;br /&gt;
SimR指标同时考虑了结构等价和一般等价。当节点x的邻居z同时也是节点y的邻居时，该指标考虑了结构等价；当节点x不等于节点y时，该指标概率了一般等价。可以证明，SimR指标可以用来描述两个分别从节点x和y出发的粒子平均过多久会相遇。&lt;br /&gt;
&lt;br /&gt;
5.局部随机游走指标 LRW&lt;br /&gt;
&lt;br /&gt;
上述4种随机游走指标是基于全局的随机游走，这类指标往往计算复杂度很高，因此很难在大规模网络上应用。刘伟平和吕琳媛提出了一种基于网络局部随机游走的相似性指标LRW，它只考虑有限步数的随机游走过程。一个粒子 t 时刻从节点x出发，定义&amp;lt;math&amp;gt;π_{xy} (t) &amp;lt;/math&amp;gt;为 t+1 时刻这个粒子正好走到节点y的概率，那么可得到系统演化方程：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\pi_{x} (t + 1) = P^T\pi_{x}(t)，t=0,1,…&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\pi_{x}(0) &amp;lt;/math&amp;gt;为一个&amp;lt;math&amp;gt;Nx1 &amp;lt;/math&amp;gt;的向量，只有第x 个元素为1，其他为0，即&amp;lt;math&amp;gt;\pi_{x}(0) =e_x&amp;lt;/math&amp;gt;。设定各个节点的初始资源分布为&amp;lt;math&amp;gt;q_x&amp;lt;/math&amp;gt;，那么基于t步随机游走的相似性为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{LRW} = q_{xy} + q_{yx}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
6.叠加的局部随机游走指标 SRW&lt;br /&gt;
&lt;br /&gt;
这个指标给邻近目标节点的点更多的机会与目标节点相连，充分考虑了很多真实网络连接上的局域性特点，它是在LRW的基础上，将t步及其以前的结果加总，便得到SRW的值，即：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{SRW}(t)=\sum_{t}^{l=1}s_{xy}^{LRW}(l) = q_x\sum_{t}^{l=1}\pi_{xy}(l) + q_y\sum_{t}^{l=1}\pi_{yx}(l)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===基于似然分析的链路预测===&lt;br /&gt;
&lt;br /&gt;
基于相似性的链路预测方法，是最简单的一种分析框架，除此之外，还有另一种最复杂的链路预测分析框架——基于似然分析的链路预测。这个框架本身远远复杂于基于相似性的框架，而且框架中的每一个组成成分自身都非常复杂，但这个框架下衍生出的算法除了给出链路预测的结果之外，还给出了我们对于网络结构的深刻洞见，例如“'''层次结构模型 Hierachical structure model'''”给出了网路层次组织形态的定量刻画，“'''随机分块模型 Stochastic block model'''”类似于社区分解一样把网络划分成了若干子块。这些对理解网络结构特征方面的贡献，是基于相似性的框架所不能提供的。&lt;br /&gt;
&lt;br /&gt;
基于似然分析的链路预测的基本思路是：根据网络结构的产生和组织方式以及目前已经观察到的链路计算网络的似然值，并认为真实的网络使得网络似然值最大，然后再根据网络似然最大化计算每一对未连接的节点产生连边的可能性。&lt;br /&gt;
&lt;br /&gt;
*层次结构模型 HSM&lt;br /&gt;
&lt;br /&gt;
层次结构模型假设真实的网络都存在某种层次性，网络的连接则可看作是这种内在层次结构的反映。该方法的计算步骤如下：&lt;br /&gt;
&lt;br /&gt;
1.一个N个节点的网络可以用一个包含N个叶子节点的族谱树表示，这N个叶子节点将由N-1个非叶子节点连接起来，其中每个非叶子节点都有一个概率值，则两个叶子节点连接的概率就等于他们最近共同祖先节点的概率值。给定一个族谱树，将网络的似然值最大化，就可以得到非叶子节点的概率值，并由此计算出这一个族谱树所对应的网络最大的似然值。&lt;br /&gt;
&lt;br /&gt;
2.使用马尔科夫链蒙特卡洛方法对网络不同的族谱树进行抽样，使得每个族谱树出现的频次正比于该树对应的最大的网络似然值。两个节点连边的概率就等于所有抽样出来的族谱树中两个节点连边概率的平均值。注意似然高的族谱树会出现多次，因此对这个平均概率的贡献也大。&lt;br /&gt;
&lt;br /&gt;
3.把平均连边概率看做是相似性框架中的相似性指标&amp;lt;math&amp;gt;s_{xy}&amp;lt;/math&amp;gt;，按照这个值从大到小排序，排在前面的就是预测的连边。&lt;br /&gt;
&lt;br /&gt;
需要指出的是，层次结构模型在处理具有明显层次结构的网络（如恐怖袭击网络和草原食物链）时具有较高的精确度，但在处理一般性网络时效果并不一定突出。&lt;br /&gt;
&lt;br /&gt;
*随机分块模型 SBM&lt;br /&gt;
&lt;br /&gt;
与层次结构模型的思想类似，随机分块模型假设网络中的节点可以被分为若干集合，两个节点间连接的概率只与相应的集合有关。换句话说，同一个群众所有节点的地位是相同的。随机分块模型特别适合刻画节点所属群的成员身份对于其连接行为有关键影响的情况，例如，著名的“角色模型”就包含了随机分块模型的理念。&lt;br /&gt;
&lt;br /&gt;
随机分块模型的效果要好于层次结构模型。同时，该方法还可以剔除网络的错误连边，如纠正蛋白质相互作用网络中的错误连边。&lt;br /&gt;
&lt;br /&gt;
*闭路模型 Loop model&lt;br /&gt;
&lt;br /&gt;
似然分析的更一般的框架是：给定一个网络系统，特定网络哈密顿量的负指数被统计分配函数归一化后，就得到这个网络出现的似然，一条未被观察到的连边存在的可能性就等于添加这条连边后网络的似然值。闭路模型考虑网络结构形成中的“局部性原则”，并由此定义了网络的哈密顿量。实验表明，闭路模型的预测精度大于层次结构模型和随机分块模型。&lt;br /&gt;
&lt;br /&gt;
===基于机器学习的链路预测===&lt;br /&gt;
&lt;br /&gt;
用机器学习的思路进行链路预测，主要分为基于特征分类方法、基于概率图模型方法和基于矩阵分解方法三大类。&lt;br /&gt;
&lt;br /&gt;
*基于特征分类方法&lt;br /&gt;
&lt;br /&gt;
网络中的链路预测问题可以看成机器学习中的分类问题，其中每个数据点对应一对节点之间关系的标记，假定两个节点之间存在连边，则数据点的值为+1，否则为-1。特征选取是分类问题中最重要的问题之一，目前研究较多的主要包括基于节点与边的属性特征和基于节点所处网络的拓扑结构特征（如CN、AA、Katz、最短路径）等。哈桑 Hasan 等人提取合著网络中科学家研究领域的关键词作为特征，用监督学习中一些常用的分类算法（如决策树、K近邻法、多层感知器、支持向量机、径向基网络）对缺失的连边进行较为精准的预测，其中以支持向量机方法表现最佳。&lt;br /&gt;
&lt;br /&gt;
*基于概率图模型&lt;br /&gt;
&lt;br /&gt;
基于概率图模型的链路预测方法使用图模型来表达节点之间的连边概率，根据模型中概率依赖关系，可分为有向无环的贝叶斯网络和无向的马尔科夫网络。随机分块模型和层次结构模型分别是典型的基于贝叶斯网络和基于马尔科夫网络的链路预测方法。基于概率图模型的链路预测方法有很多，典型的还有有监督随机游走链路预测算法，将网络结构信息与节点和连边的属性信息结合起来，给每条边分配不同的转移概率。与其他有监督的机器学习方法相比，该算法无须知道网络的特征和相关的领域知识。&lt;br /&gt;
&lt;br /&gt;
*基于矩阵分解&lt;br /&gt;
&lt;br /&gt;
基于矩阵分解的链路预测方法是基于网络邻接矩阵的代数谱变换而得到的方法，来预测网络中链路的存在性和链路的权值。相比其他几种机器学习方法，该方法要学习的参数少很多，但计算复杂度较高。链路预测问题可以视为邻接矩阵填充问题，并可以通过双线性回归模型将节点和链路的显特征和隐特征结合起来用矩阵分解方法解决。边缘去噪模型将根据给定关系矩阵求未知边或丢失边的问题变成一个矩阵降噪去噪问题。&lt;br /&gt;
&lt;br /&gt;
关于不同的链路预测研究方法的分类可以参考下表：&lt;br /&gt;
[[File:Link preditction method.png|600px|thumb|三类不同的链路预测方法（*表示该方法含有参数）|center]]&lt;br /&gt;
&lt;br /&gt;
==应用场景==&lt;br /&gt;
链路预测有着广泛的应用场景：在生物领域，利用蛋白质间相互作用关系的结构信息进行链路预测，可以为实验的测定提前提供参考依据，从而降低实验成本、提高成功率；在社交网络领域，链路预测可以对社交网络中的好友关系、朋友推荐进行预测，从而提高用户对社交网站的体验满意度和使用黏性；在电子商务领域，除了传统的协同过滤推荐算法外，利用网络结构信息（如网络三角形结构）等特征进行商品推荐也取得了显著的优势；此外，通过识别隐藏的链边或异常的链边对信息不完全或含有噪音的网络进行重构，可以提高网络的传输能力，这对于航空网络重构有很大的启发意义。&lt;br /&gt;
[[File:Figure2.png|400px|thumb|链路预测应用场景示意图（图片来自网络）|center]]&lt;br /&gt;
&lt;br /&gt;
除此之外，链路预测的算法和思想通过一些变换还可以用来解决一些看似没有太大关系的问题。例如，对疾病信号和股票指数的预测。基于链路预测的思想和方法，我们还可以设计基于节点相似性的社团划分以及对网络演化模型的定量化评估方法。链路预测还可以帮助提高节点标签预测的精度，特别是在已知标签节点稀疏的情况下效果显著。这一方法可以应用于判断一篇学术论文的类型，判断一本书的政治态度（中立、自由派或保守派），或者判断一个手机用户是否产生了更换电信运营商的念头。&lt;br /&gt;
&lt;br /&gt;
==代表人物==&lt;br /&gt;
*'''吕琳媛'''&lt;br /&gt;
吕琳媛主要研究方向为复杂网络信息挖掘领域，包括海量信息导航、挖掘、推荐和预测。目前担任阿里巴巴复杂科学研究中心副主任，中欧联合实验室执行主任，中国工业与应用数学学会复杂网络与系统控制专业委员会委员，杭州市特聘专家。&lt;br /&gt;
[[File:Lvlinyuan.png|400px|thumb|吕琳媛，阿里巴巴复杂科学研究中心副主任|center]]&lt;br /&gt;
&lt;br /&gt;
近年来主持/参与国家级项目5项（2016年获得国家自然科学基金优秀青年基金），省部级项目4项，横向课题4项。 在相关领域发表学术论文 50余篇，其中SCI论文39篇，总影响因子122，发表期刊包括Physics Reports，PNAS，Nature Communications等国际知名学术期刊。三篇论文入选ESI全球Top-1%高引用论文，论文SCI引用1200余次，谷歌学术引用3000余次，其中9篇论文引用超过100次。2013年出版学术专著《链路预测》获得第四届中国大学出版社图书奖优秀学术著作一等奖。申请发明专利12项。2015年荣获浙江省杰出青年基金，2014年荣获中国计算机学会自然科学二等奖，中国网络科学论坛青年希望奖，首届CCF-腾讯犀牛鸟基金优秀奖。&lt;br /&gt;
&lt;br /&gt;
*'''周涛'''&lt;br /&gt;
周涛主要从事复杂性科学和大数据挖掘算法和应用研究，先后攻克推荐系统准确性-多样性困境、复杂网络链路可预测性、H指数-度-核心度关系等图挖掘领域的重要难题，成果发表在PNAS, Nature Communications, Physics Reports, KDD和ICDM等国际顶尖期刊和会议上。目前论文google总引用超过14000次，其中8篇论文入选ESI高引用论文，H指数为57，2014和2015连续两年入选Elsevier最具国际影响力中国科学家名单。&lt;br /&gt;
[[File:Zhoutao.png|400px|thumb|周涛，第十二届中国青年科技奖|center]]&lt;br /&gt;
&lt;br /&gt;
因其在科学研究上的杰出表现，2011年获得第十二届中国青年科技奖（最年轻获奖者），2011年入选四川省“百人计划”，2012年获得国家首批优秀青年科学基金资助，2013年入选国家“万人计划”首批青年拔尖人才支持计划，2014年获得四川省科技进步一等奖、中国计算机学会自然科学奖，2015年获得共青团中央授予的“最美青年科技工作者”称号，并与屠呦呦等七名个人和北斗导航等三个团队共同当选2015年度中国十大科技创新人物。&lt;br /&gt;
&lt;br /&gt;
*'''马克·纽曼 Mark Newman'''&lt;br /&gt;
Newman是一名英裔美国物理学家，也是密歇根大学 University of Michigan 物理学系的阿纳托尔·拉波特 Anatol Rapoport 杰出教授，也是圣达菲研究所 Santa Fe Institute 的外部教员。他因在复杂网络和复杂系统领域的基础性贡献而闻名，为此他被授予2014年拉格朗日奖。&lt;br /&gt;
[[File:Newman.png|400px|thumb|Mark Newman，密歇根大学物理学系阿纳托尔·拉波特杰出教授|center]]&lt;br /&gt;
&lt;br /&gt;
Newman以其对复杂网络的研究而著称，尤其是在科学家的协作模式，随机图论 Random graph theory，社区结构 Community structure，渗流理论 Percolation theory 和网络流行病学 Network epidemiology方面的工作。他作为共同发明人，与迈克尔·卡斯特 Michael Gastner 一起，发明了一种可以产生密度均衡地图 Density-equalizing maps 或统计地图 Cartograms的方法，该方法构成了Worldmapper网站的基础。他们的工作在2004年美国总统大选后受到关注，成为了当时被广泛传播的一种选举结果地图的基础，（他们）根据各州的人口数调整了州的规模，以便更准确地了解每个党派的选民投票人数。&lt;br /&gt;
&lt;br /&gt;
*'''克里斯托弗·大卫·摩尔 Cristopher David Moore'''&lt;br /&gt;
克里斯托弗·大卫·摩尔 Cristopher David Moore，也称为克里斯·摩尔 Cris Moore 是美国计算机科学家，数学家和物理学家。他是圣达菲研究所的驻校教师，曾任新墨西哥大学 University of New Mexico 的正教授。&lt;br /&gt;
[[File:Cristopher_David_Moore.png|400px|thumb|Cristopher David Moore，圣达菲研究所的驻校教师|center]]&lt;br /&gt;
&lt;br /&gt;
1993年，Moore 发现了一种新颖的解决三体问题的方法，表明在牛顿力学中，三个等质量的物体有可能沿着一条八字形曲线、在同一条轨道相互跟随。Moore 在网络科学领域也很活跃，在该领域有许多著名的出版物。在与Clauset和Mark Newman的合作中，Moore开发了复杂网络的层次聚类概率模型，并表明他们的模型可以在面对网络连接结构发生变化时可靠地预测聚类结果。&lt;br /&gt;
&lt;br /&gt;
*'''亚伦·克劳斯特 Aaron Clauset '''&lt;br /&gt;
Aaron Clauset是一位美国计算机科学家，致力于网络科学，机器学习和复杂系统领域。目前，他在科罗拉多大学博尔德分校 University of Colorado Boulder 教授计算机科学，也是圣菲研究所的外部教员。&lt;br /&gt;
[[File:Aaron_Clauset.png|400px|thumb|  Aaron Clauset，圣菲研究所的外部教员|center]]&lt;br /&gt;
&lt;br /&gt;
Clauset因与Cosma Shalizi和Mark Newman进行的合作研究而闻名，他们针对经验数据中是否存在幂律模式开发了严格的统计检验，并且证明了许多宣称符合幂律分布的网络实际上并不是幂律分布。他还因开发检测复杂网络中的社区结构算法的工作而著称，特别是和Newman、Moore合作发展的网络层次聚类模型。在其他方面，Clauslet 与麦克斯韦·扬 Maxwell Young 、克里斯蒂安·斯克雷德·格莱蒂奇 Kristian Skrede Gleditsch 共同完成了一些独特发现：世界范围内恐怖事件发生的频率和严重性服从幂律分布。&lt;br /&gt;
&lt;br /&gt;
2015年，Clauset 因开发和评估一种网络结构特征的新方法而获得了美国国家科学基金会颁发的著名的CAREER奖。2016年，Clauset因在网络结构方面（包括Internet映射，推断缺失链接和社区结构），以及对人类冲突和社会分层所做的启发性分析方面做出的贡献而获得网络科学学会颁发的网络科学领域的Erdös-Rényi奖。&lt;br /&gt;
&lt;br /&gt;
==参考资料==&lt;br /&gt;
*汪小帆,李翔,陈关荣.《网络科学导论》.北京：高等教育出版社,2012年：178-186&lt;br /&gt;
*吕琳媛,周涛.《链路预测》.北京：高等教育出版社,2013年：57-93&lt;br /&gt;
*吕琳媛,任晓龙,周涛.《网络链路预测：概念与前沿》[J].《中国计算机学会通讯》,2016年,第4期&lt;br /&gt;
*Clauset A, Moore C, Newman M E J. Hierarchical structure and the prediction of missing links in networks [J]. Nature, 2008,453(7191): 98-101.&lt;br /&gt;
*&amp;lt;ref name=&amp;quot;&amp;quot;&amp;gt;Sørensen, T, Sørensen, T A, Sørensen, T J (1948) [https://pattern.swarma.org/paper?id=ea7f2902-6e74-11ea-9db3-0242ac1a0005 A method of establishing groups of equal amplitude in plant sociology based on similarity of species content and its application to analyses of the vegetation on Danish commons].&amp;lt;/ref&amp;gt;&lt;br /&gt;
*Link Prediction Group 网站：http://www.linkprediction.org/&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
*链接预测可用于分析网络将如何发展，或者在给定信息不完整情况下来发现“丢失”的链接，对于这个问题，有研究者提出了一种新的，结合广义群贴近度中心性和半值相互作用指数的拟局部方法（即考虑半径k内节点的方法），详见 [https://swarma.org/?p=18249 《链路预测的博弈算法》]&lt;br /&gt;
[[File:链路预测的博弈算法.jpg|400px|thumb|[https://swarma.org/?p=18249 《链路预测的博弈算法》]|center]]&lt;br /&gt;
*深度学习已经成功地在图像识别、语音识别、自然语言处理、游戏与博弈等领域取得了突飞猛进的发展，并渗透到了我们的日常生活中。那么，我们有没有可能将这种技术借剪到复杂网 络的研究之中呢？近年来，人们凭借着网络嵌入（Network Embedding）、图卷积神经网络（Graph Convolutional Neural Network）、图注意力模型（Graph Attention Network）等新技术，已经开发了若干图结构上的深度学习算法，并取得了一定的成功应用。北师大系统科学学院教授、博导张江老师亲授[https://campus.swarma.org/play/coursedetail?id=10504 《当复杂网络遇上机器学习》]，将对这些算法以及应用，包括各式各样的网络嵌入算法、节点分类问题、链路预测问题、图分类问题、网络动力学预测问题等做一简单介绍，并对网络上的深度学习问题进行了展望。&lt;br /&gt;
[[File:当复杂网络遇上机器学习.png|400px|thumb|[https://campus.swarma.org/play/coursedetail?id=10504 《当复杂网络遇上机器学习》]|center]]&lt;br /&gt;
*网络上的注意力模型（Graph Attention Model）是一种通用的网络嵌入算法，它能够在节点分类、链路预测等问题上得到极高的精度。它可以模仿一个机器头对网络中的节点进行信息读取和分析，然后将综合的结果放到节点的向量中的过程。[https://campus.swarma.org/play/coursedetail?id=10385 《网络上的注意力模型》]课程将详细介绍这一模型及其应用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''''本中文词条由[[用户:木子二月鸟|木子二月鸟]]用户参与编译，  [[用户: 苏格兰| 苏格兰]]用户审校，欢迎在讨论页面留言'''''。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''本词条内容源自wikipedia及公开资料，遵守 CC3.0协议。'''&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E9%93%BE%E8%B7%AF%E9%A2%84%E6%B5%8B&amp;diff=7625</id>
		<title>链路预测</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E9%93%BE%E8%B7%AF%E9%A2%84%E6%B5%8B&amp;diff=7625"/>
		<updated>2020-05-10T13:18:25Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：/* 参考资料 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{#seo:|keywords=链路预测 Link Prediction  |description=通过已知的网络节点以及网络结构等信息，预测网络中尚未产生连边的两个节点之间产生连接的可能性。 }}&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
'''链路预测 Link Prediction'''是指如何通过已知的网络节点以及网络结构等信息，预测网络中尚未产生连边的两个节点之间产生连接的可能性。这种预测既包含了对未知链接 Existing yet unknown link，也称丢失链接 Missing link 的预测，也包含了对未来链接 Future link 的预测。&lt;br /&gt;
&lt;br /&gt;
链路预测是将复杂网络与信息科学联系起来的重要桥梁之一，它所要处理的是信息科学中最基本的问题——缺失信息的还原与预测。链路预测相关研究不仅能够推动网络科学和信息科学理论上的发展，而且具有巨大的实际应用价值，譬如可以知道蛋白质相互作用实验、进行在线社交推荐、找出交通传输网络中有特别重要作用的连边等。&lt;br /&gt;
&lt;br /&gt;
==研究方法==&lt;br /&gt;
===基于相似性的链路预测===&lt;br /&gt;
&lt;br /&gt;
*基于局部信息的相似性指标&lt;br /&gt;
&lt;br /&gt;
社会网络分析中经典的三元闭包 Triadic closure 原则指出，如果A、B	两个人拥有一个共同的朋友C，那么这两个人今后也很有可能成为朋友，从而使得3个节点构成一个闭合的三角形ABC。对于一般的网络，我们可以把这一原则推广如下：两个节点的共同邻居越多，这两个节点就越相似，从而更倾向于相互连接。最简单的基于'''共同邻居 Common neighbors''' 的节点相似性指标定义如下：&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
s_{xy}^{CN} =  |Γ(x)| \cap |Γ(y)|&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
在相似性指标定义的基础上，还可以考虑两个节点的共同邻居的相对数量。下表列出了10种基于节点局部信息的相似性指标，第1种是计算共同邻居相似度的基本公式，其中第2至7种相似性指标是直接基于共同邻居指标的不同的规范化而得到的，表中的 k(x) = |Γ(x)| 为节点x的度。第8种指标PA是基于BA无标度网络模型中新加入节点倾向于和度大的节点相连的优先连接机制而提出的。&lt;br /&gt;
&lt;br /&gt;
第9种指标AA的基本思想是度小的共同邻居节点的贡献大于度大的共同邻居节点，因此根据共同邻居节点的度为每个节点赋予一个权重值。这一点很容易理解，例如在微博中受关注较多的人往往是某个领域的专家或名人，因此共同关注他们的人之间可能并不拥有特别相似的兴趣——一个中学生和一个企业家都有可能是姚晨的粉丝。相反，如果两个人共同关注了一个粉丝很少的人（非名人），那么说明这两个人确实具有相同的兴趣爱好或者重叠的社交圈，因此有更高概率相连。又如在推荐系统中，共同购买冷门产品的两个用户往往比共同购买热门产品的用户更相似。&lt;br /&gt;
[[File:Table1.png|600px|thumb|10种基于节点局部信息的相似性指标|center]]&lt;br /&gt;
&lt;br /&gt;
第10种指标RA是受网络资源分配过程的启发，周涛等人提出的“'''资源分配指标 Resource allocation'''”，其与AA指标有异曲同工之妙。RA和AA指标最大的区别就在于赋予共同邻居节点权重的方式不同，前者是以 1/k 的形式递减，后者是以 1/logk 的形式递减。可见，当网络的平均度较小时，RA和AA差别不大；但是当平均度较大时，就有很大的区别了。研究显示，RA指标在刻画加权网络和社区挖掘应用中的表现胜过AA指标，图灵奖得主Hopdroft的一篇论文也显示，可以利用社区等中观结构信息改进局部指标，其中RA指标改进后的效果最佳。&lt;br /&gt;
&lt;br /&gt;
*基于路径的相似性指标&lt;br /&gt;
&lt;br /&gt;
基于共同邻居的相似性指标的优势在于计算复杂度较低，但是由于使用的信息非常有限，预测精度受到限制，因此发展出了基于路径的相似性指标，主要有3个，分别是局部路径指标 Local path 、Katz指标和LHN-II指标。&lt;br /&gt;
&lt;br /&gt;
1.局部路径指标&lt;br /&gt;
&lt;br /&gt;
周涛等人在共同邻居的基础上考虑三阶路径的因素，提出了基于局部路径的相似性指标，其定义为 &amp;lt;math&amp;gt; S=A^2+\alpha A^3&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 为可调参数，A 表示网络的邻接矩阵， &amp;lt;math&amp;gt;(A^3)_{xy}&amp;lt;/math&amp;gt;表示节点 &amp;lt;math&amp;gt;V_x&amp;lt;/math&amp;gt; 和 &amp;lt;math&amp;gt;V_y&amp;lt;/math&amp;gt; 之间长度为3的路径数目。当&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; = 0时，LP指标就退化为 CN 指标。 CN 指标本质上也可看成基于路径的指标，只是它仅考虑了二阶路径数目。局部路径指标可以扩展为更高阶的情形，即考虑n阶路径的情况：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt; S^n=A^2+\alpha\cdot A^3+\alpha^2\cdot A^4+\cdots +\alpha^{n-2}\cdot A^n &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
随着 n 的增加，局部路径指标的计算复杂度越来越大。一般而言，考虑 n 阶路径的计算复杂度为O(N&amp;lt;k&amp;gt;^n)。但是当 n 趋于无穷大的时候，局部路径指标相当于考虑网络全部路径的Katz指标，此时计算量反而有可能下降，因为可转变为计算矩阵的逆。&lt;br /&gt;
&lt;br /&gt;
2.Katz指标&lt;br /&gt;
&lt;br /&gt;
Katz指标考虑了所有网络的路径，因此其定义为：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S_{xy}=\sum_{l=1}^{\infty }\alpha^l\cdot\left |  paths_{x,y}^{&amp;lt;l&amp;gt;} \right |= \alpha A_{xy}+\alpha^2\cdot (A^2)_{xy}+\alpha^3\cdot (A^3)_{xy}+\cdots  &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\alpha &amp;gt; 0&amp;lt;/math&amp;gt; 为控制路径权重的可调参数，&amp;lt;math&amp;gt;\left |  paths_{x,y}^{&amp;lt;l&amp;gt;} \right |&amp;lt;/math&amp;gt;表示连接节点 &amp;lt;math&amp;gt;V_x&amp;lt;/math&amp;gt;和  &amp;lt;math&amp;gt;V_y&amp;lt;/math&amp;gt; 的路径中长度为 l 的路径数。要使上述级数收敛，则参数&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 应小于邻接矩阵最大特征值的倒数，此定义还可以表示为：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S = (I - \alpha\cdot A)^{-1} - I&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
显然，当参数&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; 很小时，高阶路径的贡献也较小，使得 Katz 指标的预测结果接近于局部路径指标。&lt;br /&gt;
&lt;br /&gt;
3.LHN-II指标&lt;br /&gt;
&lt;br /&gt;
LHN-II 指标是 Leicht，Holme 和 Newman 提出的另一种相似性计算方法，他的基本思想是基于'''一般等价 Regular equivalence''' 提出的。与结构等价不同，一般等价的定义更广泛。在一般等价的定义下，如果两个节点所连接的节点之间相似，那么这两个节点也相似，即使它们之间没有共同的邻居节点。&lt;br /&gt;
&lt;br /&gt;
下图给出了一个简单的例子来帮助我们理解结构等价和一般等价的区别。根据结构等价的定义，在公司A内部，由于员工a和员工b都认识员工e和员工f（即它们有两个共同邻居节点），于是称员工a和员工b是结构等价的。同理，员工e和员工f也是结构等价的，同样地，在公司B中，员工c和员工d是结构等价的，员工g和员工h也是结构等价的。现在考虑员工a和员工c是否相似？根据一般等价的定义，由于员工a连接的节点e、f与员工c连接的节点g、h分别是相似的，那么我们可以认为员工a和员工c也是相似的，同理，在一般等价的意义下，员工b和员工d也是相似。从这个例子可以看出，结构相似性或称结构等价更强调的是两个节点是否在同一个环境下，也就是说是否连接了相同的节点；然而一般等价考虑的是这两个节点是否处于同样的角色，即使他们没有相同的邻居节点，但是由于各自的邻居节点之间本身相似，这两个节点也相似。一般等价意义下的相似性是LHN-II指标的核心。&lt;br /&gt;
&lt;br /&gt;
[[File:一般等价和结构等价示例.png|600px|thumb|一般等价和结构等价示例（图中实线表示连接，虚线表示相似关系）|center]]&lt;br /&gt;
&lt;br /&gt;
从一般等价的角度考虑，LHN-II指标认为如果两个节点的邻居节点之间是相似的，那么这两个节点也是相似的。它与Katz指标的区别主要是把Katz指标中的&amp;lt;math&amp;gt; (A^{n})_{xy} &amp;lt;/math&amp;gt;变成 &amp;lt;math&amp;gt;  (A^{n})_{xy}&amp;lt;/math&amp;gt; 的期望值，注意到 &amp;lt;math&amp;gt; (A^{n})_{xy}&amp;lt;/math&amp;gt; 的期望值为 &amp;lt;math&amp;gt; E\left [ (A^l)_{xy} \right ]=\frac{k_xk_y}{M}\lambda _1^{l-1}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\lambda_1&amp;lt;/math&amp;gt;为矩阵A的最大特征值，则LHN-II指标的表达式如下：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 S_{xy}^{LHN2}=\delta _{xy} + \sum_{l=1}^{\infty }\Phi ^l \frac{(A^l)_{xy}}{E\left [ (A^l)_{xy} \right ]}&lt;br /&gt;
=\delta _{xy} + \frac{2M}{k_xk_y}\sum_{l=1}^{\infty }\Phi ^l\lambda _1^{1-l}(A^l)_{xy}&lt;br /&gt;
=\left [ 1 - \frac{2 M \lambda_1}{k_xk_y} \right ]\delta _{xy} + \frac{2 M \lambda_1}{k_xk_y}\left [ (I-\frac{\Phi}{\lambda_1} A )^{-1} \right ]_{xy}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\delta _{xy}&amp;lt;/math&amp;gt;为 Kronecker &amp;lt;math&amp;gt;\delta&amp;lt;/math&amp;gt; 函数，&amp;lt;math&amp;gt; \Phi&amp;lt;/math&amp;gt; 为取值小于1的参数。上式最后一个等式的第一项是可以去掉的对角阵，从而相似性矩阵可以写为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S=2M\lambda_1D^{-1}(I-\frac{\Phi A}{\lambda_1})^{-1}D^{-1}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中''D''为度值矩阵，&amp;lt;math&amp;gt;D_{xy} = \delta_{xy} \cdot k_{x}&amp;lt;/math&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
*基于随机游走的节点相似性指标&lt;br /&gt;
&lt;br /&gt;
还有相当数量的相似性指标是基于随机游走过程定义的，包括'''平均通勤时间 Average commute time''' 、'''Cos+指标'''、'''有重启的随机游走 Random walk with restart'''、'''SimRank'''指标、'''局部随机游走指标 Local random walk''' 和'''有叠加效应的随机游走指标 Superposed random walk'''等。&lt;br /&gt;
&lt;br /&gt;
1.平均通勤时间 ACT &lt;br /&gt;
&lt;br /&gt;
设&amp;lt;math&amp;gt;m(x,y)&amp;lt;/math&amp;gt; 为一个随机粒子从节点x到节点y平均需要走的步数，那么节点x和y的平均通勤时间定义为：&amp;lt;math&amp;gt;n(x , y) = m(x , y) + m(y , x) &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其数值解可通过求该网络拉普拉斯矩阵&amp;lt;math&amp;gt;L&amp;lt;/math&amp;gt; 的伪逆&amp;lt;math&amp;gt; L^+&amp;lt;/math&amp;gt; 获得，即 &amp;lt;math&amp;gt;n(x,y)=M(l^+_{xx} +l^+_{yy} - 2l^+_{xy})&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;l^{+}_{xy}&amp;lt;/math&amp;gt;表示矩阵&amp;lt;math&amp;gt;L^+ &amp;lt;/math&amp;gt;中相应位置的元素。如果两个节点的平均通勤时间越小，那么两个节点越进阶。由此，定义基于ACT的相似性为（在此可忽略常数M）&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{ACT}=\frac{1}{l^+_{xx} +l^+_{yy} - 2l^+_{xy}}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
2.余弦相似性指标 Cos+指标&lt;br /&gt;
&lt;br /&gt;
在由向量&amp;lt;math&amp;gt;v_x = \Lambda ^{1/2}U^{T}e_{x}&amp;lt;/math&amp;gt;展开的欧式空间内，&amp;lt;math&amp;gt;L^+ &amp;lt;/math&amp;gt;中的元素&amp;lt;math&amp;gt;l^{+}_{xy}&amp;lt;/math&amp;gt;可表示为两向量&amp;lt;math&amp;gt;v_x&amp;lt;/math&amp;gt;和&amp;lt;math&amp;gt;v_y&amp;lt;/math&amp;gt;的内积，即&amp;lt;math&amp;gt; l^{+}_{xy} = v_{x}^{T} v_y&amp;lt;/math&amp;gt;，其中&amp;lt;math&amp;gt;U&amp;lt;/math&amp;gt;是一个标准正交矩阵，由&amp;lt;math&amp;gt;L^+&amp;lt;/math&amp;gt;特征向量按照对应的特征根从大到小排列，&amp;lt;math&amp;gt;\Lambda&amp;lt;/math&amp;gt;为以特征根为对角元素的对角矩阵，&amp;lt;math&amp;gt;e_{x}&amp;lt;/math&amp;gt; 表示一个一维向量且只有第x个元素为1，其他都为0。由此定义余弦相似性如下：&lt;br /&gt;
&lt;br /&gt;
s_{xy}^{cos+}=cos(x,y)^+=\frac{l_{xy}^+}{\sqrt{l^+_{xx} \cdot l^+_{yy}}}&lt;br /&gt;
&lt;br /&gt;
3.重启的随机游走 RWR&lt;br /&gt;
&lt;br /&gt;
这个指标可以看成是PageRank 算法的拓展应用。它假设随机游走粒子在每走一步的时候都以一定概率返回初始位置。设粒子返回概率为 1-c，&amp;lt;math&amp;gt;P&amp;lt;/math&amp;gt; 为网络的马尔科夫概率转移矩阵，其元素 &amp;lt;math&amp;gt;P_{xy} = a_{xy}/k_{x} &amp;lt;/math&amp;gt;表示节点x处的粒子下一步走到节点y的概率。其中如果节点x和节点y相连，则&amp;lt;math&amp;gt;a_{xy}=1&amp;lt;/math&amp;gt;，否则&amp;lt;math&amp;gt;a_{xy}=0&amp;lt;/math&amp;gt;。某一粒子初始时刻在节点x处，那么t+1时刻该粒子到达网络各个节点的概率向量为&lt;br /&gt;
&amp;lt;math&amp;gt;q_{x}(t+1) = c \cdot P^{T}q_{x}(t) + (1-c) e_{x}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;e_{x}&amp;lt;/math&amp;gt;表示初始状态（其定义与Cos+中相同），上式的稳态解为&amp;lt;math&amp;gt;q_{x} = (1-c)(I-cP^{T})^{-1}e_{x}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中元素&amp;lt;math&amp;gt;q_{xy}&amp;lt;/math&amp;gt;为从节点x出发的粒子最终有多少概率走到节点y。由此定义RWR相似性如下：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{RWR} = q_{xy} + q_{yx} &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
4.SimRank指标 SimR&lt;br /&gt;
&lt;br /&gt;
它的基本假设是，如果两节点所连接的节点相似，那么这两个节点就相似。其自洽定义式为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{simR}=C\frac{\sum_{v_z\in \Gamma (x)}\sum_{{v_z}'\in \Gamma (y)}s_{zz'}^{simR}}{k_xk_y}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中假定 &amp;lt;math&amp;gt;s_{xx} =1, C \in [0,1] &amp;lt;/math&amp;gt;为相似性传递时的衰减参数。&lt;br /&gt;
&lt;br /&gt;
SimR指标同时考虑了结构等价和一般等价。当节点x的邻居z同时也是节点y的邻居时，该指标考虑了结构等价；当节点x不等于节点y时，该指标概率了一般等价。可以证明，SimR指标可以用来描述两个分别从节点x和y出发的粒子平均过多久会相遇。&lt;br /&gt;
&lt;br /&gt;
5.局部随机游走指标 LRW&lt;br /&gt;
&lt;br /&gt;
上述4种随机游走指标是基于全局的随机游走，这类指标往往计算复杂度很高，因此很难在大规模网络上应用。刘伟平和吕琳媛提出了一种基于网络局部随机游走的相似性指标LRW，它只考虑有限步数的随机游走过程。一个粒子 t 时刻从节点x出发，定义&amp;lt;math&amp;gt;π_{xy} (t) &amp;lt;/math&amp;gt;为 t+1 时刻这个粒子正好走到节点y的概率，那么可得到系统演化方程：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\pi_{x} (t + 1) = P^T\pi_{x}(t)，t=0,1,…&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中&amp;lt;math&amp;gt;\pi_{x}(0) &amp;lt;/math&amp;gt;为一个&amp;lt;math&amp;gt;Nx1 &amp;lt;/math&amp;gt;的向量，只有第x 个元素为1，其他为0，即&amp;lt;math&amp;gt;\pi_{x}(0) =e_x&amp;lt;/math&amp;gt;。设定各个节点的初始资源分布为&amp;lt;math&amp;gt;q_x&amp;lt;/math&amp;gt;，那么基于t步随机游走的相似性为&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{LRW} = q_{xy} + q_{yx}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
6.叠加的局部随机游走指标 SRW&lt;br /&gt;
&lt;br /&gt;
这个指标给邻近目标节点的点更多的机会与目标节点相连，充分考虑了很多真实网络连接上的局域性特点，它是在LRW的基础上，将t步及其以前的结果加总，便得到SRW的值，即：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;s_{xy}^{SRW}(t)=\sum_{t}^{l=1}s_{xy}^{LRW}(l) = q_x\sum_{t}^{l=1}\pi_{xy}(l) + q_y\sum_{t}^{l=1}\pi_{yx}(l)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===基于似然分析的链路预测===&lt;br /&gt;
&lt;br /&gt;
基于相似性的链路预测方法，是最简单的一种分析框架，除此之外，还有另一种最复杂的链路预测分析框架——基于似然分析的链路预测。这个框架本身远远复杂于基于相似性的框架，而且框架中的每一个组成成分自身都非常复杂，但这个框架下衍生出的算法除了给出链路预测的结果之外，还给出了我们对于网络结构的深刻洞见，例如“'''层次结构模型 Hierachical structure model'''”给出了网路层次组织形态的定量刻画，“'''随机分块模型 Stochastic block model'''”类似于社区分解一样把网络划分成了若干子块。这些对理解网络结构特征方面的贡献，是基于相似性的框架所不能提供的。&lt;br /&gt;
&lt;br /&gt;
基于似然分析的链路预测的基本思路是：根据网络结构的产生和组织方式以及目前已经观察到的链路计算网络的似然值，并认为真实的网络使得网络似然值最大，然后再根据网络似然最大化计算每一对未连接的节点产生连边的可能性。&lt;br /&gt;
&lt;br /&gt;
*层次结构模型 HSM&lt;br /&gt;
&lt;br /&gt;
层次结构模型假设真实的网络都存在某种层次性，网络的连接则可看作是这种内在层次结构的反映。该方法的计算步骤如下：&lt;br /&gt;
&lt;br /&gt;
1.一个N个节点的网络可以用一个包含N个叶子节点的族谱树表示，这N个叶子节点将由N-1个非叶子节点连接起来，其中每个非叶子节点都有一个概率值，则两个叶子节点连接的概率就等于他们最近共同祖先节点的概率值。给定一个族谱树，将网络的似然值最大化，就可以得到非叶子节点的概率值，并由此计算出这一个族谱树所对应的网络最大的似然值。&lt;br /&gt;
&lt;br /&gt;
2.使用马尔科夫链蒙特卡洛方法对网络不同的族谱树进行抽样，使得每个族谱树出现的频次正比于该树对应的最大的网络似然值。两个节点连边的概率就等于所有抽样出来的族谱树中两个节点连边概率的平均值。注意似然高的族谱树会出现多次，因此对这个平均概率的贡献也大。&lt;br /&gt;
&lt;br /&gt;
3.把平均连边概率看做是相似性框架中的相似性指标&amp;lt;math&amp;gt;s_{xy}&amp;lt;/math&amp;gt;，按照这个值从大到小排序，排在前面的就是预测的连边。&lt;br /&gt;
&lt;br /&gt;
需要指出的是，层次结构模型在处理具有明显层次结构的网络（如恐怖袭击网络和草原食物链）时具有较高的精确度，但在处理一般性网络时效果并不一定突出。&lt;br /&gt;
&lt;br /&gt;
*随机分块模型 SBM&lt;br /&gt;
&lt;br /&gt;
与层次结构模型的思想类似，随机分块模型假设网络中的节点可以被分为若干集合，两个节点间连接的概率只与相应的集合有关。换句话说，同一个群众所有节点的地位是相同的。随机分块模型特别适合刻画节点所属群的成员身份对于其连接行为有关键影响的情况，例如，著名的“角色模型”就包含了随机分块模型的理念。&lt;br /&gt;
&lt;br /&gt;
随机分块模型的效果要好于层次结构模型。同时，该方法还可以剔除网络的错误连边，如纠正蛋白质相互作用网络中的错误连边。&lt;br /&gt;
&lt;br /&gt;
*闭路模型 Loop model&lt;br /&gt;
&lt;br /&gt;
似然分析的更一般的框架是：给定一个网络系统，特定网络哈密顿量的负指数被统计分配函数归一化后，就得到这个网络出现的似然，一条未被观察到的连边存在的可能性就等于添加这条连边后网络的似然值。闭路模型考虑网络结构形成中的“局部性原则”，并由此定义了网络的哈密顿量。实验表明，闭路模型的预测精度大于层次结构模型和随机分块模型。&lt;br /&gt;
&lt;br /&gt;
===基于机器学习的链路预测===&lt;br /&gt;
&lt;br /&gt;
用机器学习的思路进行链路预测，主要分为基于特征分类方法、基于概率图模型方法和基于矩阵分解方法三大类。&lt;br /&gt;
&lt;br /&gt;
*基于特征分类方法&lt;br /&gt;
&lt;br /&gt;
网络中的链路预测问题可以看成机器学习中的分类问题，其中每个数据点对应一对节点之间关系的标记，假定两个节点之间存在连边，则数据点的值为+1，否则为-1。特征选取是分类问题中最重要的问题之一，目前研究较多的主要包括基于节点与边的属性特征和基于节点所处网络的拓扑结构特征（如CN、AA、Katz、最短路径）等。哈桑 Hasan 等人提取合著网络中科学家研究领域的关键词作为特征，用监督学习中一些常用的分类算法（如决策树、K近邻法、多层感知器、支持向量机、径向基网络）对缺失的连边进行较为精准的预测，其中以支持向量机方法表现最佳。&lt;br /&gt;
&lt;br /&gt;
*基于概率图模型&lt;br /&gt;
&lt;br /&gt;
基于概率图模型的链路预测方法使用图模型来表达节点之间的连边概率，根据模型中概率依赖关系，可分为有向无环的贝叶斯网络和无向的马尔科夫网络。随机分块模型和层次结构模型分别是典型的基于贝叶斯网络和基于马尔科夫网络的链路预测方法。基于概率图模型的链路预测方法有很多，典型的还有有监督随机游走链路预测算法，将网络结构信息与节点和连边的属性信息结合起来，给每条边分配不同的转移概率。与其他有监督的机器学习方法相比，该算法无须知道网络的特征和相关的领域知识。&lt;br /&gt;
&lt;br /&gt;
*基于矩阵分解&lt;br /&gt;
&lt;br /&gt;
基于矩阵分解的链路预测方法是基于网络邻接矩阵的代数谱变换而得到的方法，来预测网络中链路的存在性和链路的权值。相比其他几种机器学习方法，该方法要学习的参数少很多，但计算复杂度较高。链路预测问题可以视为邻接矩阵填充问题，并可以通过双线性回归模型将节点和链路的显特征和隐特征结合起来用矩阵分解方法解决。边缘去噪模型将根据给定关系矩阵求未知边或丢失边的问题变成一个矩阵降噪去噪问题。&lt;br /&gt;
&lt;br /&gt;
关于不同的链路预测研究方法的分类可以参考下表：&lt;br /&gt;
[[File:Link preditction method.png|600px|thumb|三类不同的链路预测方法（*表示该方法含有参数）|center]]&lt;br /&gt;
&lt;br /&gt;
==应用场景==&lt;br /&gt;
链路预测有着广泛的应用场景：在生物领域，利用蛋白质间相互作用关系的结构信息进行链路预测，可以为实验的测定提前提供参考依据，从而降低实验成本、提高成功率；在社交网络领域，链路预测可以对社交网络中的好友关系、朋友推荐进行预测，从而提高用户对社交网站的体验满意度和使用黏性；在电子商务领域，除了传统的协同过滤推荐算法外，利用网络结构信息（如网络三角形结构）等特征进行商品推荐也取得了显著的优势；此外，通过识别隐藏的链边或异常的链边对信息不完全或含有噪音的网络进行重构，可以提高网络的传输能力，这对于航空网络重构有很大的启发意义。&lt;br /&gt;
[[File:Figure2.png|400px|thumb|链路预测应用场景示意图（图片来自网络）|center]]&lt;br /&gt;
&lt;br /&gt;
除此之外，链路预测的算法和思想通过一些变换还可以用来解决一些看似没有太大关系的问题。例如，对疾病信号和股票指数的预测。基于链路预测的思想和方法，我们还可以设计基于节点相似性的社团划分以及对网络演化模型的定量化评估方法。链路预测还可以帮助提高节点标签预测的精度，特别是在已知标签节点稀疏的情况下效果显著。这一方法可以应用于判断一篇学术论文的类型，判断一本书的政治态度（中立、自由派或保守派），或者判断一个手机用户是否产生了更换电信运营商的念头。&lt;br /&gt;
&lt;br /&gt;
==代表人物==&lt;br /&gt;
*'''吕琳媛'''&lt;br /&gt;
吕琳媛主要研究方向为复杂网络信息挖掘领域，包括海量信息导航、挖掘、推荐和预测。目前担任阿里巴巴复杂科学研究中心副主任，中欧联合实验室执行主任，中国工业与应用数学学会复杂网络与系统控制专业委员会委员，杭州市特聘专家。&lt;br /&gt;
[[File:Lvlinyuan.png|400px|thumb|吕琳媛，阿里巴巴复杂科学研究中心副主任|center]]&lt;br /&gt;
&lt;br /&gt;
近年来主持/参与国家级项目5项（2016年获得国家自然科学基金优秀青年基金），省部级项目4项，横向课题4项。 在相关领域发表学术论文 50余篇，其中SCI论文39篇，总影响因子122，发表期刊包括Physics Reports，PNAS，Nature Communications等国际知名学术期刊。三篇论文入选ESI全球Top-1%高引用论文，论文SCI引用1200余次，谷歌学术引用3000余次，其中9篇论文引用超过100次。2013年出版学术专著《链路预测》获得第四届中国大学出版社图书奖优秀学术著作一等奖。申请发明专利12项。2015年荣获浙江省杰出青年基金，2014年荣获中国计算机学会自然科学二等奖，中国网络科学论坛青年希望奖，首届CCF-腾讯犀牛鸟基金优秀奖。&lt;br /&gt;
&lt;br /&gt;
*'''周涛'''&lt;br /&gt;
周涛主要从事复杂性科学和大数据挖掘算法和应用研究，先后攻克推荐系统准确性-多样性困境、复杂网络链路可预测性、H指数-度-核心度关系等图挖掘领域的重要难题，成果发表在PNAS, Nature Communications, Physics Reports, KDD和ICDM等国际顶尖期刊和会议上。目前论文google总引用超过14000次，其中8篇论文入选ESI高引用论文，H指数为57，2014和2015连续两年入选Elsevier最具国际影响力中国科学家名单。&lt;br /&gt;
[[File:Zhoutao.png|400px|thumb|周涛，第十二届中国青年科技奖|center]]&lt;br /&gt;
&lt;br /&gt;
因其在科学研究上的杰出表现，2011年获得第十二届中国青年科技奖（最年轻获奖者），2011年入选四川省“百人计划”，2012年获得国家首批优秀青年科学基金资助，2013年入选国家“万人计划”首批青年拔尖人才支持计划，2014年获得四川省科技进步一等奖、中国计算机学会自然科学奖，2015年获得共青团中央授予的“最美青年科技工作者”称号，并与屠呦呦等七名个人和北斗导航等三个团队共同当选2015年度中国十大科技创新人物。&lt;br /&gt;
&lt;br /&gt;
*'''马克·纽曼 Mark Newman'''&lt;br /&gt;
Newman是一名英裔美国物理学家，也是密歇根大学 University of Michigan 物理学系的阿纳托尔·拉波特 Anatol Rapoport 杰出教授，也是圣达菲研究所 Santa Fe Institute 的外部教员。他因在复杂网络和复杂系统领域的基础性贡献而闻名，为此他被授予2014年拉格朗日奖。&lt;br /&gt;
[[File:Newman.png|400px|thumb|Mark Newman，密歇根大学物理学系阿纳托尔·拉波特杰出教授|center]]&lt;br /&gt;
&lt;br /&gt;
Newman以其对复杂网络的研究而著称，尤其是在科学家的协作模式，随机图论 Random graph theory，社区结构 Community structure，渗流理论 Percolation theory 和网络流行病学 Network epidemiology方面的工作。他作为共同发明人，与迈克尔·卡斯特 Michael Gastner 一起，发明了一种可以产生密度均衡地图 Density-equalizing maps 或统计地图 Cartograms的方法，该方法构成了Worldmapper网站的基础。他们的工作在2004年美国总统大选后受到关注，成为了当时被广泛传播的一种选举结果地图的基础，（他们）根据各州的人口数调整了州的规模，以便更准确地了解每个党派的选民投票人数。&lt;br /&gt;
&lt;br /&gt;
*'''克里斯托弗·大卫·摩尔 Cristopher David Moore'''&lt;br /&gt;
克里斯托弗·大卫·摩尔 Cristopher David Moore，也称为克里斯·摩尔 Cris Moore 是美国计算机科学家，数学家和物理学家。他是圣达菲研究所的驻校教师，曾任新墨西哥大学 University of New Mexico 的正教授。&lt;br /&gt;
[[File:Cristopher_David_Moore.png|400px|thumb|Cristopher David Moore，圣达菲研究所的驻校教师|center]]&lt;br /&gt;
&lt;br /&gt;
1993年，Moore 发现了一种新颖的解决三体问题的方法，表明在牛顿力学中，三个等质量的物体有可能沿着一条八字形曲线、在同一条轨道相互跟随。Moore 在网络科学领域也很活跃，在该领域有许多著名的出版物。在与Clauset和Mark Newman的合作中，Moore开发了复杂网络的层次聚类概率模型，并表明他们的模型可以在面对网络连接结构发生变化时可靠地预测聚类结果。&lt;br /&gt;
&lt;br /&gt;
*'''亚伦·克劳斯特 Aaron Clauset '''&lt;br /&gt;
Aaron Clauset是一位美国计算机科学家，致力于网络科学，机器学习和复杂系统领域。目前，他在科罗拉多大学博尔德分校 University of Colorado Boulder 教授计算机科学，也是圣菲研究所的外部教员。&lt;br /&gt;
[[File:Aaron_Clauset.png|400px|thumb|  Aaron Clauset，圣菲研究所的外部教员|center]]&lt;br /&gt;
&lt;br /&gt;
Clauset因与Cosma Shalizi和Mark Newman进行的合作研究而闻名，他们针对经验数据中是否存在幂律模式开发了严格的统计检验，并且证明了许多宣称符合幂律分布的网络实际上并不是幂律分布。他还因开发检测复杂网络中的社区结构算法的工作而著称，特别是和Newman、Moore合作发展的网络层次聚类模型。在其他方面，Clauslet 与麦克斯韦·扬 Maxwell Young 、克里斯蒂安·斯克雷德·格莱蒂奇 Kristian Skrede Gleditsch 共同完成了一些独特发现：世界范围内恐怖事件发生的频率和严重性服从幂律分布。&lt;br /&gt;
&lt;br /&gt;
2015年，Clauset 因开发和评估一种网络结构特征的新方法而获得了美国国家科学基金会颁发的著名的CAREER奖。2016年，Clauset因在网络结构方面（包括Internet映射，推断缺失链接和社区结构），以及对人类冲突和社会分层所做的启发性分析方面做出的贡献而获得网络科学学会颁发的网络科学领域的Erdös-Rényi奖。&lt;br /&gt;
&lt;br /&gt;
==参考资料==&lt;br /&gt;
*汪小帆,李翔,陈关荣.《网络科学导论》.北京：高等教育出版社,2012年：178-186&lt;br /&gt;
*吕琳媛,周涛.《链路预测》.北京：高等教育出版社,2013年：57-93&lt;br /&gt;
*吕琳媛,任晓龙,周涛.《网络链路预测：概念与前沿》[J].《中国计算机学会通讯》,2016年,第4期&lt;br /&gt;
*Clauset A, Moore C, Newman M E J. Hierarchical structure and the prediction of missing links in networks [J]. Nature, 2008,453(7191): 98-101.&lt;br /&gt;
*&amp;lt;ref name=&amp;quot;&amp;quot;&amp;gt;Sørensen, T, Sørensen, T A, Sørensen, T J (1948) [https://pattern.swarma.org/paper?id=ea7f2902-6e74-11ea-9db3-0242ac1a0005 A method of establishing groups of equal amplitude in plant sociology based on similarity of species content and its application to analyses of the vegetation on Danish commons].&amp;lt;/ref&amp;gt;&lt;br /&gt;
*Link Prediction Group 网站：http://www.linkprediction.org/&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
*链接预测可用于分析网络将如何发展，或者在给定信息不完整情况下来发现“丢失”的链接，对于这个问题，有研究者提出了一种新的，结合广义群贴近度中心性和半值相互作用指数的拟局部方法（即考虑半径k内节点的方法），详见 [https://swarma.org/?p=18249 《链路预测的博弈算法》]&lt;br /&gt;
[[File:链路预测的博弈算法.jpg|400px|thumb|[https://swarma.org/?p=18249 《链路预测的博弈算法》]|center]]&lt;br /&gt;
*深度学习已经成功地在图像识别、语音识别、自然语言处理、游戏与博弈等领域取得了突飞猛进的发展，并渗透到了我们的日常生活中。那么，我们有没有可能将这种技术借剪到复杂网 络的研究之中呢？近年来，人们凭借着网络嵌入（Network Embedding）、图卷积神经网络（Graph Convolutional Neural Network）、图注意力模型（Graph Attention Network）等新技术，已经开发了若干图结构上的深度学习算法，并取得了一定的成功应用。北师大系统科学学院教授、博导张江老师亲授[https://campus.swarma.org/play/coursedetail?id=10504 《当复杂网络遇上机器学习》]，将对这些算法以及应用，包括各式各样的网络嵌入算法、节点分类问题、链路预测问题、图分类问题、网络动力学预测问题等做一简单介绍，并对网络上的深度学习问题进行了展望。&lt;br /&gt;
[[File:当复杂网络遇上机器学习.png|400px|thumb|[https://campus.swarma.org/play/coursedetail?id=10504 《当复杂网络遇上机器学习》]|center]]&lt;br /&gt;
*网络上的注意力模型（Graph Attention Model）是一种通用的网络嵌入算法，它能够在节点分类、链路预测等问题上得到极高的精度。它可以模仿一个机器头对网络中的节点进行信息读取和分析，然后将综合的结果放到节点的向量中的过程。[https://campus.swarma.org/play/coursedetail?id=10385 《网络上的注意力模型》]课程将详细介绍这一模型及其应用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''''本中文词条由[[用户:木子二月鸟|木子二月鸟]]用户参与编译，  [[用户: 苏格兰| 苏格兰]]用户审校，欢迎在讨论页面留言'''''。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''本词条内容源自wikipedia及公开资料，遵守 CC3.0协议。'''&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E8%87%AA%E7%BB%84%E7%BB%87&amp;diff=7079</id>
		<title>自组织</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E8%87%AA%E7%BB%84%E7%BB%87&amp;diff=7079"/>
		<updated>2020-05-07T03:34:45Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{#seo:|keywords=自组织 Self-organization  |description=也被称为自发秩序，是指一种起源于初始无序系统的部分元素之间的局部相互作用、所产生出某种形式的整体秩序的过程。 }}&lt;br /&gt;
 [[File:Nb3O7(OH)_self-organization2.jpg|400px|thumb|right|abc]]&lt;br /&gt;
&lt;br /&gt;
'''自组织 Self-organization'''， 在社会科学中 也被称为自发秩序，&amp;lt;ref name=&amp;quot;G&amp;amp;P 1971&amp;quot;&amp;gt;Glansdorff, P., Prigogine, I. (1971). ''Thermodynamic Theory of Structure, Stability and Fluctuations'', Wiley-Interscience, London. ISBN:0-471-30280-5&amp;lt;/ref&amp;gt;是指一种起源于初始无序系统的部分元素之间的局部相互作用、所产生出某种形式的整体秩序的过程。当有足够的能量可用时，该过程可以是自发的，不需要任何外部个体 agent进行控制。它通常是由看似随机的波动触发，并由正反馈放大。最终形成的自组织是完全分散的，分布在系统的所有组件中。因此，自组织通常是健壮的，能够生存下来或者自我修复严重的干扰。混沌理论讨论的自组织，如同无序、不可预测的大海中的确定性孤岛。&lt;br /&gt;
&lt;br /&gt;
自组织发生在物理，化学，生物，机器人和认知系统等许多领域。自组织的例子包括结晶，流体的热对流，化学振荡，动物种群，神经回路。&lt;br /&gt;
&lt;br /&gt;
自组织是在'''非均衡 Non-equilibrium '''过程的物理学和化学反应中被发现的，通常将其描述为'''自组装 Self-assembly '''。在生物学中，从分子到生态系统，这一概念已被证明是有效的。 在自然科学和社会科学 例如经济学或人类学 的许多其他学科的文献中也出现了自组织行为的引证。在诸如'''[[元胞自动机]] Cellular automata '''这样的数学系统中也观察到了自组织。自组织是与'''[[涌现 Emergence]] '''概念相关的一个例子。&lt;br /&gt;
自组织依赖于四个基本要素：&lt;br /&gt;
*强烈的动态非线性，通常但不必然涉及正反馈和负反馈&lt;br /&gt;
*探索与开发的平衡&lt;br /&gt;
*多重互动&lt;br /&gt;
*能量的可用性 以克服'''熵增 Entropy '''或无序的自然趋势 &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==原理==&lt;br /&gt;
控制论专家威廉·罗斯·阿什比 W. Ross Ashby 在1947年提出了'''自组织 Self-organization '''的初始原理，它指出任何确定性动态系统都会自动演变成一个均衡状态，这种均衡状态可以描述为一个在盆地周围环绕状态的'''[[吸引子]] Attractor '''。一旦到达那里，系统的进一步演化就被约束以保持在吸引子中。这种约束代表了其组成元素或子系统之间相互依赖或协调的某种形式。用阿什比的话来说，每个子系统都适应了所有其他子系统形成的环境。&lt;br /&gt;
&lt;br /&gt;
控制论专家海因茨·冯·福斯特 Heinz von Foerster 于1960年提出了“ 从噪声中获得秩序 Order from noise ” 的原理。该原理指出，自组织是由随机扰动 “噪声” 促进的，该随机扰动使系统在其状态空间中探索各种状态。这增加了系统到达“强”或“深”吸引子池中的机会，然后系统会迅速进入吸引子本身。生物物理学家亨利·阿特兰 Henri Atlan 通过提出“ 噪声带来的复杂性 Complexity from noise，法语  le principe de complexité par le bruit ” 原理发展了这一概念，该原理首见于1972年出版的《L'organisation biologique et lathéoriede l'information》，然后是1979年出版的《Entre le cristal et lafumée》。热力学家伊利亚·普里戈吉因 Ilya Prigogine 提出了类似的原则，即“波动带来有序 Order through fluctuations ” 或“混乱带来有序 Order out of chaos ”。它也应用在用于解决问题和机器学习的模拟退火方法中。&lt;br /&gt;
&lt;br /&gt;
==历史演变==&lt;br /&gt;
&lt;br /&gt;
系统动态演化可以导致其组织增加的想法由来已久。像德谟克里特 Democritus  和卢克雷修斯 Lucretius 之类的古代原子论者认为，一种有计划的智能对于在自然界中创造秩序是不必要的，他们认为，只要有足够的时间、空间和物质，秩序就会自动产生。&lt;br /&gt;
&lt;br /&gt;
哲学家勒内·笛卡尔 RenéDescartes 在其1637 年《方法论》的第五部分中假设性提出了'''自我组织 Selft-organization '''的概念。他在未发表的作品“世界”中详细阐述了这个想法。&lt;br /&gt;
依曼纽尔·康德 Immanuel Kant 在他的1790年《审判批判》中使用了'''“自组织化 Selft-onganizing”'''一词，他认为只有存在这样的实体——其各个部分或“器官 Organs ”同时是终点和手段时——才是有意义的概念。这样的器官系统一定能够像拥有自己的思想一样行事，也就是说，它能够自我支配。&lt;br /&gt;
&lt;br /&gt;
''“在这样的天然产物中，其每一个部件都因其他剩余部件的存在而存在，也可以说它的存在是为了其他部件和整个整体，这是作为一种手段，或器官……该部件必须是可以产生其他部件的器官——因此每个部件都会相互产生其他部件……只有在这些条件和关系下，这样的产物才能成为一个系统的和自组织的存在，而且因此才能被称为一个物理结束。”''&lt;br /&gt;
&lt;br /&gt;
萨迪·卡诺 Sadi Carnot，1796-1832 和鲁道夫·克劳修斯 Rudolf Clausius，1822-1888 在19世纪发现了热力学第二定律。它指出：总的熵，有时被理解为无序，在一个孤立的系统中总会随着时间而增加。这意味着，如果没有外部联系降低系统中其他部位的'''有序 Order ''' 例如，通过消耗电池的低熵能量来扩散高熵热 ，那么系统无法自发地增加'''有序 Order 。&lt;br /&gt;
&lt;br /&gt;
18世纪的思想家试图理解“形式的普遍定律 Universal laws of form ”，以解释观察到的生物体形式。这个想法与'''拉马克主义 Lamarckism '''联系在一起，并声名狼藉，直到20世纪初 D'Arcy Wentworth Thompson 1860–1948 试图复兴它。&lt;br /&gt;
&lt;br /&gt;
精神病学家和工程师 Ashby 于1947年向当代科学引入了'''“自组织 Self-organizing”'''一词。控制论学者 Heinz von Foerster，戈登·帕斯克 Gordon Pask ，斯塔福德·比尔 Stafford Beer 采纳了这一概念，Heinz von Foerster于1960年6月在伊利诺伊大学阿勒顿公园组织了一次有关“自组织原理 The Principles of Self-Organization ”的会议，该会议引发了一系列关于自组织系统的会议。诺伯特·维纳 Norbert Wiener在他的《控制论》第二版中提出了这个想法：《动物与机器中的控制与通讯》 1961 。&lt;br /&gt;
&lt;br /&gt;
'''自组织 Self-organization '''与60年代的一般系统理论相关，但是直到物理学家 Hermann Haken等人和复杂系统的研究者从更大范围采纳了这一概念才在科学文献中变得司空见惯起来，这些范围包括宇宙学家埃里希•詹茨 Erich Jantsch ，耗散系统的化学，具备系统思维 兴起于1980年代圣塔菲学院 Santa Fe Institute和1990年代复杂适应系统 的'''自创生 Autopoiesis '''机制的生物学和社会学领域，以及如今受'''根茎网络理论 Rhizomatic network theory '''深刻影响而出现的颠覆性技术。&lt;br /&gt;
&lt;br /&gt;
在2008-2009年，'''引导式自组织 Guided self-organization '''的概念开始形成。这种方法旨在针对特定目的调整自组织，以便动态系统可以达到特定的吸引子或结果。这种调整通过限制系统组件之间的局部相互作用，而不是依靠一种明确的控制机制或全局设计蓝图，来限制复杂系统中的自组织过程。通过将任务无关的全局目标与任务相关的对局部相互作用的约束相结合，可以实现预期的结果，例如增加由此带来的内部结构和/或功能。&lt;br /&gt;
&lt;br /&gt;
==按领域==&lt;br /&gt;
&lt;br /&gt;
===物理===&lt;br /&gt;
物理学中的自组织现象包括'''[[相变]] Phase transitions '''和'''自发对称性破缺 Spontaneous symmetry breaking '''，例如'''自发磁化 Spontaneous magnetization ''' ，经典物理学中的晶体生长，激光，超导和量子物理学的'''玻色-爱因斯坦凝聚 Bose–Einstein condensation '''。它在动力学系统，摩擦学，'''自旋泡沫系统 Spin foam systems '''和'''环量子引力 Loop quantum gravity '''的'''自组织临界 Self-organized criticality '''中被发现，也在河流盆地和三角洲，'''枝晶凝固 Dendritic solidification （如雪花）  '''和'''湍流结构  Turbulent structure '''中被发现。&lt;br /&gt;
[[File:Convection_cell.png|300px|thumb|引力场中的对流单元|right]]&lt;br /&gt;
&lt;br /&gt;
===化学===&lt;br /&gt;
化学中的自组织包括分子'''自组装 Molecular self-assembly'''，'''反应扩散系统 Reaction–diffusion systems''' 和'''振荡反应 Oscillating reactions'''，'''自催化网络  Autocatalytic networks'''，'''液晶 Liquid crystals'''，'''网格络合物 Ggrid complexes'''，'''胶质晶体 Colloidal crystals'''，'''自组装单分子层 Self-assembled monolayers'''，'''胶束 Micelles'''，'''嵌段共聚物的微相分离 Microphase separation of block copolymers''' 和'''Langmuir-Blodgett膜  Langmuir–Blodgett films'''。&lt;br /&gt;
[[File:DNA_nanostructures.png|300px|thumb|左侧示意的DNA结构自组装为右侧的结构|right]]&lt;br /&gt;
&lt;br /&gt;
===生物===&lt;br /&gt;
在生物学中，从蛋白质和其它生物大分子的'''自发折叠 Spontaneous folding'''，'''磷脂双分子层 Lipid bilayer '''的形成，发育生物学的'''图案形成 Pattern formation'''和'''形态发生 Morphogenesis'''，人体运动的协调，群居昆虫 如蜜蜂，蚂蚁，白蚁 和哺乳动物的社会行为，到鸟类和鱼类的'''群集行为 Flocking behaviour'''，都可以观察到自组织现象。&lt;br /&gt;
&lt;br /&gt;
[[File:Birds_flocking.png|300px|thumb|鸟类蜂群，生物学中的自我组织的一个例子|right]]&lt;br /&gt;
&lt;br /&gt;
数学生物学家斯图尔特·考夫曼 Stuart Kauffman 和其他结构主义者认为，自组织可能与自然选择在进化生物学的三个领域中共同发挥作用，即'''种群动力学  Population dynamics'''，'''分子进化 Molecular evolution '''和'''形态发生 Morphogenesis'''。但是，这种假设没有考虑能量在驱动细胞中生化反应中的重要作用。任何细胞中的反应系统都是'''自催化 Self-catalyzing'''的，但不是简单的自组织，因为它们是依赖于持续能量输入的热力学开放系统。自组织不是自然选择的替代方法，但是它限制了进化可以做什么，并提供了诸如膜的自组装之类的机制，以便进化利用这种机制。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===计算机科学===&lt;br /&gt;
来自数学和计算机科学的现象，例如'''[[元胞自动机]]  Cellular automata'''，'''[[随机图]]  Random graphs'''，以及'''进化计算 Evolutionary computation '''和'''人工生命 Artificial life '''的某些实例，都表现出了自组织的特征。在群体机器人 Swarm robotics 中，自组织被用来产生涌现行为 Emergent behavior。尤其是随机图理论作为复杂系统的一般原理，已被用作自组织的正当理由。在多主体系统领域，理解如何设计一个能够表现出自组织行为的系统是一个活跃的研究领域。优化算法也可以认为是自组织化 Self-organizing的，因为它们旨在找到问题的最优解。如果将这个解视为迭代系统的一个状态，则最优解是系统选定的收敛结构。自组织网络包括''' [[小世界网络]]  Small-world networks '''和''' [[无标度网络]] Scale-free networks'''。它们来自自下而上的相互作用，这与组织内部的自上而下的层次网络不同，后者不是自组织的。有人认为云计算系统本质上也是自组织的，但尽管它们具有一定的自治性，它们并不是自我管理的，因为它们的目标不是降低自身的复杂性。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===控制论===&lt;br /&gt;
诺伯特·维纳认为黑盒的'''自动串行识别 Automatic serial identification '''及其随后的'''复制 Reproduction '''作为控制论中的自组织。维纳所称的'''锁相 Phase locking '''或'''“频率吸引 Attraction of frequencies”'''的重要性在他的《控制论——动物与机器中的控制与通信》第二版中进行了讨论。 埃里克·德雷克斯勒 K. Eric Drexler 将'''自我复制 Self-replication '''视为纳米和'''通用组装 universal assembly '''的关键步骤。相比之下，当 Ross Ashby 的同态调节器——四个同时连通的检流计——受到干扰时，会收敛于许多可能的稳定状态之一。Ross Ashby使用各种状态计数方法来描述稳定状态，并推导出'''“良好调节器 Good Regulator ”''' 定理，该定理要求内部模型具有自组织的持久性和稳定性 例如，'''奈奎斯特稳定性标准 Nyquist stability criterion'''。沃伦·麦卡洛克 Warren McCulloch 提出的'''“潜在命令冗余 Redundancy of Potential Command”'''，是大脑和人类神经系统组织的特征，也是自组织的必要条件。Heinz von Foerster提出了'''“冗余度 Redundancy”'''，R = 1 −  H /Hmax，其中H是熵。本质上，这表明未使用的潜在通信带宽是对自组织的一种度量。&lt;br /&gt;
&lt;br /&gt;
1970年代，Stafford Beer 认为自组织对于持久的生命系统的自治是必要的。他将'''活性系统模型 viable system model'''应用于管理。它由五个部分组成： 1 监视生存过程的表现， 2 通过规则的递归应用进行管理， 3 稳态操作控制和 4 开发， 5 使得在环境干扰下依然可维持身份。通过警报“algedonic loop”反馈来优选焦点：这种反馈是一种对相对于标准功能表现不足或超出表现所产生的疼痛和愉悦的敏感性。&lt;br /&gt;
&lt;br /&gt;
在1990年代，Gordon Pask 辩称，von Foerster 的H和Hmax不是独立的，而是通过可数的'''无限递归并发自旋过程 Countably infinite recursive concurrent spin processes '''相互作用的，他称之为概念。他严格定义了“建立关系的程序 A procedure to bring about a relation”这一概念，使得他的定理“相似概念排斥，不同概念吸引 Like concepts repel, unlike concepts attract” ，以得出一种通用的、基于自旋的自组织原理。他的原则是一项排除原则，“ 非二重性 There are No Doppelgangers ”意味着没有两个概念完全相同。经过足够的时间后，所有概念都吸引并合并成为粉红噪音 Pink noise。该理论应用于可以产生持久、连贯产品的所有组织封闭 Organizationally closed 或体内平衡 Homeostatic 的过程，这些产品会不断发展，学习和适应。&lt;br /&gt;
&lt;br /&gt;
===人类社会===&lt;br /&gt;
社会动物的自组织行为和简单数学结构的自组织现象，都表明在人类社会中应该存在自组织。自组织的迹象通常是自组织物理系统所体现出的统计属性。社会学，经济学，行为金融学和人类学中存在很多这样的例子，比如'''临界质量 Critical mass'''，'''羊群效应 Herd behaviour'''，'''集体思维 Groupthink '''等。&lt;br /&gt;
&lt;br /&gt;
在社会理论中，尼古拉斯·卢曼 Niklas Luhmann 1984 引入了'''自我指涉 Self-referentiality'''的概念作为自组织理论的社会学应用。对于卢曼而言，社会系统的要素是'''自我再生产 Self-producing '''的交流，即交流产生进一步的交流，因此，只要存在不断变化的交流，社会系统就可以自我复制。对于卢曼而言，人类就是系统环境中的传感器。卢曼通过'''功能分析 Functional analyses '''和系统理论发展出一套关于社会及其子系统的进化论。&lt;br /&gt;
[[File:Map_of_International_illegal_drug_connections.png|300px|thumb|国际毒品贩卖路线的社会自组织|right]]&lt;br /&gt;
&lt;br /&gt;
在经济学中，市场经济有时被认为是自组织的 Self-organizing。保罗·克鲁格曼 Paul Krugman 在他的著作《自组织经济 》（The Self Organizing Economy） 中阐述了市场自组织在商业周期中的作用。弗里德里希·哈耶克 Friedrich Hayek 创造了术语'''“ 耦合秩序 catallaxy” '''，以描述一种'''“自愿合作的自组织系统 Self-organizing system of voluntary co-operation”''',这与自由市场经济中的自发秩序有关。新古典经济学家认为，加强中央计划通常会使自组织的经济体系效率降低。从另一个角度来看，经济学家认为市场失灵如此明显以至于自组织产生了不良结果，因此国家应指导生产和定价。大多数经济学家都采取中间立场，并建议将市场经济和'''计划经济 Command economy '''的特征混合在一起 有时称为'''混合经济 Mixed economy '''。当应用在经济学领域时，自组织的概念很容易变成一种意识形态上的渗透。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===学习领域===&lt;br /&gt;
使他人“学习如何学习” 通常是指教导他们如何服从于被教导。'''自组织学习 Self-organised learning, SOL '''否认“专家最了解”或存在“最佳方法”，反而坚持认为“个体层面显著的、相关的和可行意义的建构”，应由学习者进行体验性尝试。这可能是协作完成的，而且个人收获更大。它被视为一生的过程，并不受限于特定的学习环境 家庭，学校，大学 ，也不受限于父母或教授等权威机构的控制。它需要通过学习者的亲身经历去尝试、并且不断去修正。它也不必受限于意识或语言。 弗里特霍夫·卡普拉 Fritjof Capra 声称，这 自组织学习，译者加 在心理学和教育中鲜为人知。它可能与控制论有关，因为它涉及'''负反馈控制回路 Negative feedback control loop'''，或者与系统理论有关。它可以作为学习谈话或对话在学习者之间或一个人进行。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===交通流===&lt;br /&gt;
交通流中驾驶员的自组织行为几乎决定了交通的所有时空行为，例如高速公路瓶颈处的交通故障，高速公路通行能力以及交通拥堵的出现。在1996–2002年，鲍里斯·克纳 Boris Kerner 的三相交通理论解释了这些复杂的自组织效应。&lt;br /&gt;
[[File:Synchronized Flow.jpg|300px|thumb|同步（交通）流|right]]&lt;br /&gt;
&lt;br /&gt;
===语言学===&lt;br /&gt;
随着个体和群体行为与生物进化相互作用，秩序在语言的进化中自发出现。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===研究基金===&lt;br /&gt;
自组织拨款 Self-organized funding allocation，SOFA 是为科学研究分配资金的一种方法。在这个系统中，每个研究人员都被分配了相等数量的资金，并且被要求匿名分配他们一部分资金用于其他人的研究。SOFA的支持者认为，这将导致与目前的拨款系统相似的资金分配，但开销却更少。2016年，SOFA的测试试点在荷兰开始。&lt;br /&gt;
&lt;br /&gt;
==参考文献==&lt;br /&gt;
&amp;lt;references/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
*超级碗和奥运会开幕式上的无人机表演，都只是人为控制的程序，而在最近一期的 Science 子刊 Science Robitics 上，研究者经过算法优化和参数调节，让无人机群自发形成了非常优美的、自组织的集群行为，详见[https://swarma.org/?p=95 《Science Robotics：无人机的自组织飞行和集群智慧》]&lt;br /&gt;
[[File:3-1534215542.jpeg|300px|thumb|[https://swarma.org/?p=95 《Science Robotics：无人机的自组织飞行和集群智慧》]|right]]&lt;br /&gt;
*交通拥堵有没有可能“自行治愈”？答案是肯定的，研究人员提出了一种新颖的自组织交通管理策略，一旦所有受影响的交通流量沿着剩余的道路容量重新分配，交通网络就会“自行治愈”，详见[https://swarma.org/?p=13286 《自愈路网：城市道路网交通事故的自组织管理策略 | 论文速递10篇》]&lt;br /&gt;
*混合型社会是一种由不同组件组成的自组织的集群系统，这种自组织混合型社会面临哪些挑战？又有怎样的解决思路？请见[https://swarma.org/?p=8883 《混合型社会：设计自组织系统集群行为的挑战及前景 | 复杂性文摘》]&lt;br /&gt;
*北京师范大学系统科学学院教授狄增如亲授[https://campus.swarma.org/play/coursedetail?id=10671 《自组织理论》]，帮助梳理了科学的发展脉络，介绍了时间反演对称、热力学第二定律及自组织现象的理论方法。&lt;br /&gt;
*北京师范大学系统科学学院教授李红刚亲授[https://campus.swarma.org/play/coursedetail?id=11008 《结构与功能：从无序到有序》]，一起探讨系统的结构与功能，聚焦于自组织涌现，如何从无序走向有序。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
本中文词条由[[用户:木子二月鸟|木子二月鸟]]用户参与编译，  刘佩佩 用户审校，欢迎在讨论页面留言。&lt;br /&gt;
&lt;br /&gt;
'''本词条内容源自wikipedia及公开资料，遵守 CC3.0协议。'''&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E8%87%AA%E7%BB%84%E7%BB%87&amp;diff=7078</id>
		<title>自组织</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E8%87%AA%E7%BB%84%E7%BB%87&amp;diff=7078"/>
		<updated>2020-05-07T03:32:44Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{#seo:|keywords=自组织 Self-organization  |description=也被称为自发秩序，是指一种起源于初始无序系统的部分元素之间的局部相互作用、所产生出某种形式的整体秩序的过程。 }}&lt;br /&gt;
 [[File:Nb3O7(OH)_self-organization2.jpg|400px|thumb|right|abc]]&lt;br /&gt;
&lt;br /&gt;
'''自组织 Self-organization'''， 在社会科学中 也被称为自发秩序，&amp;lt;ref name=&amp;quot;G&amp;amp;P 1971&amp;quot;&amp;gt;Glansdorff, P., Prigogine, I. (1971). ''Thermodynamic Theory of Structure, Stability and Fluctuations'', Wiley-Interscience, London. ISBN:0-471-30280-5&amp;lt;/ref&amp;gt;是指一种起源于初始无序系统的部分元素之间的局部相互作用、所产生出某种形式的整体秩序的过程。当有足够的能量可用时，该过程可以是自发的，不需要任何外部个体 agent进行控制。它通常是由看似随机的波动触发，并由正反馈放大。最终形成的自组织是完全分散的，分布在系统的所有组件中。因此，自组织通常是健壮的，能够生存下来或者自我修复严重的干扰。混沌理论讨论的自组织，如同无序、不可预测的大海中的确定性孤岛。&lt;br /&gt;
&lt;br /&gt;
自组织发生在物理，化学，生物，机器人和认知系统等许多领域。自组织的例子包括结晶，流体的热对流，化学振荡，动物种群，神经回路。&lt;br /&gt;
&lt;br /&gt;
自组织是在'''非均衡 Non-equilibrium '''过程的物理学和化学反应中被发现的，通常将其描述为'''自组装 Self-assembly '''。在生物学中，从分子到生态系统，这一概念已被证明是有效的。 在自然科学和社会科学 例如经济学或人类学 的许多其他学科的文献中也出现了自组织行为的引证。在诸如'''[[元胞自动机]] Cellular automata '''这样的数学系统中也观察到了自组织。自组织是与'''[[涌现 Emergence]] '''概念相关的一个例子。&lt;br /&gt;
自组织依赖于四个基本要素：&lt;br /&gt;
*强烈的动态非线性，通常但不必然涉及正反馈和负反馈&lt;br /&gt;
*探索与开发的平衡&lt;br /&gt;
*多重互动&lt;br /&gt;
*能量的可用性 以克服'''熵增 Entropy '''或无序的自然趋势 &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==原理==&lt;br /&gt;
控制论专家威廉·罗斯·阿什比 W. Ross Ashby 在1947年提出了'''自组织 Self-organization '''的初始原理，它指出任何确定性动态系统都会自动演变成一个均衡状态，这种均衡状态可以描述为一个在盆地周围环绕状态的'''[[吸引子]] Attractor '''。一旦到达那里，系统的进一步演化就被约束以保持在吸引子中。这种约束代表了其组成元素或子系统之间相互依赖或协调的某种形式。用阿什比的话来说，每个子系统都适应了所有其他子系统形成的环境。&lt;br /&gt;
&lt;br /&gt;
控制论专家海因茨·冯·福斯特 Heinz von Foerster 于1960年提出了“ 从噪声中获得秩序 Order from noise ” 的原理。该原理指出，自组织是由随机扰动 “噪声” 促进的，该随机扰动使系统在其状态空间中探索各种状态。这增加了系统到达“强”或“深”吸引子池中的机会，然后系统会迅速进入吸引子本身。生物物理学家亨利·阿特兰 Henri Atlan 通过提出“ 噪声带来的复杂性 Complexity from noise，法语  le principe de complexité par le bruit ” 原理发展了这一概念，该原理首见于1972年出版的《L'organisation biologique et lathéoriede l'information》，然后是1979年出版的《Entre le cristal et lafumée》。热力学家伊利亚·普里戈吉因 Ilya Prigogine 提出了类似的原则，即“波动带来有序 Order through fluctuations ” 或“混乱带来有序 Order out of chaos ”。它也应用在用于解决问题和机器学习的模拟退火方法中。&lt;br /&gt;
&lt;br /&gt;
==历史演变==&lt;br /&gt;
&lt;br /&gt;
系统动态演化可以导致其组织增加的想法由来已久。像德谟克里特 Democritus  和卢克雷修斯 Lucretius 之类的古代原子论者认为，一种有计划的智能对于在自然界中创造秩序是不必要的，他们认为，只要有足够的时间、空间和物质，秩序就会自动产生。&lt;br /&gt;
&lt;br /&gt;
哲学家勒内·笛卡尔 RenéDescartes 在其1637 年《方法论》的第五部分中假设性提出了'''自我组织 Selft-organization '''的概念。他在未发表的作品“世界”中详细阐述了这个想法。&lt;br /&gt;
依曼纽尔·康德 Immanuel Kant 在他的1790年《审判批判》中使用了'''“自组织化 Selft-onganizing”'''一词，他认为只有存在这样的实体——其各个部分或“器官 Organs ”同时是终点和手段时——才是有意义的概念。这样的器官系统一定能够像拥有自己的思想一样行事，也就是说，它能够自我支配。&lt;br /&gt;
&lt;br /&gt;
''“在这样的天然产物中，其每一个部件都因其他剩余部件的存在而存在，也可以说它的存在是为了其他部件和整个整体，这是作为一种手段，或器官……该部件必须是可以产生其他部件的器官——因此每个部件都会相互产生其他部件……只有在这些条件和关系下，这样的产物才能成为一个系统的和自组织的存在，而且因此才能被称为一个物理结束。”''&lt;br /&gt;
&lt;br /&gt;
萨迪·卡诺 Sadi Carnot，1796-1832 和鲁道夫·克劳修斯 Rudolf Clausius，1822-1888 在19世纪发现了热力学第二定律。它指出：总的熵，有时被理解为无序，在一个孤立的系统中总会随着时间而增加。这意味着，如果没有外部联系降低系统中其他部位的'''有序 Order ''' 例如，通过消耗电池的低熵能量来扩散高熵热 ，那么系统无法自发地增加'''有序 Order 。&lt;br /&gt;
&lt;br /&gt;
18世纪的思想家试图理解“形式的普遍定律 Universal laws of form ”，以解释观察到的生物体形式。这个想法与'''拉马克主义 Lamarckism '''联系在一起，并声名狼藉，直到20世纪初 D'Arcy Wentworth Thompson 1860–1948 试图复兴它。&lt;br /&gt;
&lt;br /&gt;
精神病学家和工程师 Ashby 于1947年向当代科学引入了'''“自组织 Self-organizing”'''一词。控制论学者 Heinz von Foerster，戈登·帕斯克 Gordon Pask ，斯塔福德·比尔 Stafford Beer 采纳了这一概念，Heinz von Foerster于1960年6月在伊利诺伊大学阿勒顿公园组织了一次有关“自组织原理 The Principles of Self-Organization ”的会议，该会议引发了一系列关于自组织系统的会议。诺伯特·维纳 Norbert Wiener在他的《控制论》第二版中提出了这个想法：《动物与机器中的控制与通讯》 1961 。&lt;br /&gt;
&lt;br /&gt;
'''自组织 Self-organization '''与60年代的一般系统理论相关，但是直到物理学家 Hermann Haken等人和复杂系统的研究者从更大范围采纳了这一概念才在科学文献中变得司空见惯起来，这些范围包括宇宙学家埃里希•詹茨 Erich Jantsch ，耗散系统的化学，具备系统思维 兴起于1980年代圣塔菲学院 Santa Fe Institute和1990年代复杂适应系统 的'''自创生 Autopoiesis '''机制的生物学和社会学领域，以及如今受'''根茎网络理论 Rhizomatic network theory '''深刻影响而出现的颠覆性技术。&lt;br /&gt;
&lt;br /&gt;
在2008-2009年，'''引导式自组织 Guided self-organization '''的概念开始形成。这种方法旨在针对特定目的调整自组织，以便动态系统可以达到特定的吸引子或结果。这种调整通过限制系统组件之间的局部相互作用，而不是依靠一种明确的控制机制或全局设计蓝图，来限制复杂系统中的自组织过程。通过将任务无关的全局目标与任务相关的对局部相互作用的约束相结合，可以实现预期的结果，例如增加由此带来的内部结构和/或功能。&lt;br /&gt;
&lt;br /&gt;
==按领域==&lt;br /&gt;
&lt;br /&gt;
===物理===&lt;br /&gt;
物理学中的自组织现象包括'''[[相变]] Phase transitions '''和'''自发对称性破缺 Spontaneous symmetry breaking '''，例如'''自发磁化 Spontaneous magnetization ''' ，经典物理学中的晶体生长，激光，超导和量子物理学的'''玻色-爱因斯坦凝聚 Bose–Einstein condensation '''。它在动力学系统，摩擦学，'''自旋泡沫系统 Spin foam systems '''和'''环量子引力 Loop quantum gravity '''的'''自组织临界 Self-organized criticality '''中被发现，也在河流盆地和三角洲，'''枝晶凝固 Dendritic solidification （如雪花）  '''和'''湍流结构  Turbulent structure '''中被发现。&lt;br /&gt;
[[File:Convection_cell.png|300px|thumb|引力场中的对流单元|right]]&lt;br /&gt;
&lt;br /&gt;
===化学===&lt;br /&gt;
化学中的自组织包括分子'''自组装 Molecular self-assembly'''，'''反应扩散系统 Reaction–diffusion systems''' 和'''振荡反应 Oscillating reactions'''，'''自催化网络  Autocatalytic networks'''，'''液晶 Liquid crystals'''，'''网格络合物 Ggrid complexes'''，'''胶质晶体 Colloidal crystals'''，'''自组装单分子层 Self-assembled monolayers'''，'''胶束 Micelles'''，'''嵌段共聚物的微相分离 Microphase separation of block copolymers''' 和'''Langmuir-Blodgett膜  Langmuir–Blodgett films'''。&lt;br /&gt;
[[File:DNA_nanostructures.png|300px|thumb|左侧示意的DNA结构自组装为右侧的结构|right]]&lt;br /&gt;
&lt;br /&gt;
===生物===&lt;br /&gt;
在生物学中，从蛋白质和其它生物大分子的'''自发折叠 Spontaneous folding'''，'''磷脂双分子层 Lipid bilayer '''的形成，发育生物学的'''图案形成 Pattern formation'''和'''形态发生 Morphogenesis'''，人体运动的协调，群居昆虫 如蜜蜂，蚂蚁，白蚁 和哺乳动物的社会行为，到鸟类和鱼类的'''群集行为 Flocking behaviour'''，都可以观察到自组织现象。&lt;br /&gt;
&lt;br /&gt;
[[File:Birds_flocking.png|300px|thumb|鸟类蜂群，生物学中的自我组织的一个例子|right]]&lt;br /&gt;
&lt;br /&gt;
数学生物学家斯图尔特·考夫曼 Stuart Kauffman 和其他结构主义者认为，自组织可能与自然选择在进化生物学的三个领域中共同发挥作用，即'''种群动力学  Population dynamics'''，'''分子进化 Molecular evolution '''和'''形态发生 Morphogenesis'''。但是，这种假设没有考虑能量在驱动细胞中生化反应中的重要作用。任何细胞中的反应系统都是'''自催化 Self-catalyzing'''的，但不是简单的自组织，因为它们是依赖于持续能量输入的热力学开放系统。自组织不是自然选择的替代方法，但是它限制了进化可以做什么，并提供了诸如膜的自组装之类的机制，以便进化利用这种机制。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===计算机科学===&lt;br /&gt;
来自数学和计算机科学的现象，例如'''[[元胞自动机]]  Cellular automata'''，'''[[随机图]]  Random graphs'''，以及'''进化计算 Evolutionary computation '''和'''人工生命 Artificial life '''的某些实例，都表现出了自组织的特征。在群体机器人 Swarm robotics 中，自组织被用来产生涌现行为 Emergent behavior。尤其是随机图理论作为复杂系统的一般原理，已被用作自组织的正当理由。在多主体系统领域，理解如何设计一个能够表现出自组织行为的系统是一个活跃的研究领域。优化算法也可以认为是自组织化 Self-organizing的，因为它们旨在找到问题的最优解。如果将这个解视为迭代系统的一个状态，则最优解是系统选定的收敛结构。自组织网络包括''' [[小世界网络]]  Small-world networks '''和''' [[无标度网络]] Scale-free networks'''。它们来自自下而上的相互作用，这与组织内部的自上而下的层次网络不同，后者不是自组织的。有人认为云计算系统本质上也是自组织的，但尽管它们具有一定的自治性，它们并不是自我管理的，因为它们的目标不是降低自身的复杂性。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===控制论===&lt;br /&gt;
诺伯特·维纳认为黑盒的'''自动串行识别 Automatic serial identification '''及其随后的'''复制 Reproduction '''作为控制论中的自组织。维纳所称的'''锁相 Phase locking '''或'''“频率吸引 Attraction of frequencies”'''的重要性在他的《控制论——动物与机器中的控制与通信》第二版中进行了讨论。 埃里克·德雷克斯勒 K. Eric Drexler 将'''自我复制 Self-replication '''视为纳米和'''通用组装 universal assembly '''的关键步骤。相比之下，当 Ross Ashby 的同态调节器——四个同时连通的检流计——受到干扰时，会收敛于许多可能的稳定状态之一。Ross Ashby使用各种状态计数方法来描述稳定状态，并推导出'''“良好调节器 Good Regulator ”''' 定理，该定理要求内部模型具有自组织的持久性和稳定性 例如，'''奈奎斯特稳定性标准 Nyquist stability criterion'''。沃伦·麦卡洛克 Warren McCulloch 提出的'''“潜在命令冗余 Redundancy of Potential Command”'''，是大脑和人类神经系统组织的特征，也是自组织的必要条件。Heinz von Foerster提出了'''“冗余度 Redundancy”'''，R = 1 −  H /Hmax，其中H是熵。本质上，这表明未使用的潜在通信带宽是对自组织的一种度量。&lt;br /&gt;
&lt;br /&gt;
1970年代，Stafford Beer 认为自组织对于持久的生命系统的自治是必要的。他将'''活性系统模型 viable system model'''应用于管理。它由五个部分组成： 1 监视生存过程的表现， 2 通过规则的递归应用进行管理， 3 稳态操作控制和 4 开发， 5 使得在环境干扰下依然可维持身份。通过警报“algedonic loop”反馈来优选焦点：这种反馈是一种对相对于标准功能表现不足或超出表现所产生的疼痛和愉悦的敏感性。&lt;br /&gt;
&lt;br /&gt;
在1990年代，Gordon Pask 辩称，von Foerster 的H和Hmax不是独立的，而是通过可数的'''无限递归并发自旋过程 Countably infinite recursive concurrent spin processes '''相互作用的，他称之为概念。他严格定义了“建立关系的程序 A procedure to bring about a relation”这一概念，使得他的定理“相似概念排斥，不同概念吸引 Like concepts repel, unlike concepts attract” ，以得出一种通用的、基于自旋的自组织原理。他的原则是一项排除原则，“ 非二重性 There are No Doppelgangers ”意味着没有两个概念完全相同。经过足够的时间后，所有概念都吸引并合并成为粉红噪音 Pink noise。该理论应用于可以产生持久、连贯产品的所有组织封闭 Organizationally closed 或体内平衡 Homeostatic 的过程，这些产品会不断发展，学习和适应。&lt;br /&gt;
&lt;br /&gt;
===人类社会===&lt;br /&gt;
社会动物的自组织行为和简单数学结构的自组织现象，都表明在人类社会中应该存在自组织。自组织的迹象通常是自组织物理系统所体现出的统计属性。社会学，经济学，行为金融学和人类学中存在很多这样的例子，比如'''临界质量 Critical mass'''，'''羊群效应 Herd behaviour'''，'''集体思维 Groupthink '''等。&lt;br /&gt;
&lt;br /&gt;
在社会理论中，尼古拉斯·卢曼 Niklas Luhmann 1984 引入了'''自我指涉 Self-referentiality'''的概念作为自组织理论的社会学应用。对于卢曼而言，社会系统的要素是'''自我再生产 Self-producing '''的交流，即交流产生进一步的交流，因此，只要存在不断变化的交流，社会系统就可以自我复制。对于卢曼而言，人类就是系统环境中的传感器。卢曼通过'''功能分析 Functional analyses '''和系统理论发展出一套关于社会及其子系统的进化论。&lt;br /&gt;
[[File:Map_of_International_illegal_drug_connections.png|300px|thumb|国际毒品贩卖路线的社会自组织|right]]&lt;br /&gt;
&lt;br /&gt;
在经济学中，市场经济有时被认为是自组织的 Self-organizing。保罗·克鲁格曼 Paul Krugman 在他的著作《自组织经济 》（The Self Organizing Economy） 中阐述了市场自组织在商业周期中的作用。弗里德里希·哈耶克 Friedrich Hayek 创造了术语'''“ 耦合秩序 catallaxy” '''，以描述一种'''“自愿合作的自组织系统 Self-organizing system of voluntary co-operation”''',这与自由市场经济中的自发秩序有关。新古典经济学家认为，加强中央计划通常会使自组织的经济体系效率降低。从另一个角度来看，经济学家认为市场失灵如此明显以至于自组织产生了不良结果，因此国家应指导生产和定价。大多数经济学家都采取中间立场，并建议将市场经济和'''计划经济 Command economy '''的特征混合在一起 有时称为'''混合经济 Mixed economy '''。当应用在经济学领域时，自组织的概念很容易变成一种意识形态上的渗透。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===学习领域===&lt;br /&gt;
使他人“学习如何学习” 通常是指教导他们如何服从于被教导。'''自组织学习 Self-organised learning, SOL '''否认“专家最了解”或存在“最佳方法”，反而坚持认为“个体层面显著的、相关的和可行意义的建构”，应由学习者进行体验性尝试。这可能是协作完成的，而且个人收获更大。它被视为一生的过程，并不受限于特定的学习环境 家庭，学校，大学 ，也不受限于父母或教授等权威机构的控制。它需要通过学习者的亲身经历去尝试、并且不断去修正。它也不必受限于意识或语言。 弗里特霍夫·卡普拉 Fritjof Capra 声称，这 自组织学习，译者加 在心理学和教育中鲜为人知。它可能与控制论有关，因为它涉及'''负反馈控制回路 Negative feedback control loop'''，或者与系统理论有关。它可以作为学习谈话或对话在学习者之间或一个人进行。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===交通流===&lt;br /&gt;
交通流中驾驶员的自组织行为几乎决定了交通的所有时空行为，例如高速公路瓶颈处的交通故障，高速公路通行能力以及交通拥堵的出现。在1996–2002年，鲍里斯·克纳 Boris Kerner 的三相交通理论解释了这些复杂的自组织效应。&lt;br /&gt;
[[File:Synchronized Flow.jpg|300px|thumb|同步（交通）流|right]]&lt;br /&gt;
&lt;br /&gt;
===语言学===&lt;br /&gt;
随着个体和群体行为与生物进化相互作用，秩序在语言的进化中自发出现。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===研究基金===&lt;br /&gt;
自组织拨款 Self-organized funding allocation，SOFA 是为科学研究分配资金的一种方法。在这个系统中，每个研究人员都被分配了相等数量的资金，并且被要求匿名分配他们一部分资金用于其他人的研究。SOFA的支持者认为，这将导致与目前的拨款系统相似的资金分配，但开销却更少。2016年，SOFA的测试试点在荷兰开始。&lt;br /&gt;
&lt;br /&gt;
==参考文献==&lt;br /&gt;
&amp;lt;references/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==编者推荐==&lt;br /&gt;
*超级碗和奥运会开幕式上的无人机表演，都只是人为控制的程序，而在最近一期的 Science 子刊 Science Robitics 上，研究者经过算法优化和参数调节，让无人机群自发形成了非常优美的、自组织的集群行为，详见[https://swarma.org/?p=95 《Science Robotics：无人机的自组织飞行和集群智慧》]&lt;br /&gt;
[[File:3-1534215542.jpeg|300px|thumb|[https://swarma.org/?p=95 《Science Robotics：无人机的自组织飞行和集群智慧》]|right]]&lt;br /&gt;
*交通拥堵有没有可能“自行治愈”？答案是肯定的，研究人员提出了一种新颖的自组织交通管理策略，一旦所有受影响的交通流量沿着剩余的道路容量重新分配，交通网络就会“自行治愈”，详见[https://swarma.org/?p=13286 《自愈路网：城市道路网交通事故的自组织管理策略 | 论文速递10篇》]&lt;br /&gt;
*混合型社会是一种由不同组件组成的自组织的集群系统，这种自组织混合型社会面临哪些挑战？又有怎样的解决思路？请见[https://swarma.org/?p=8883 《混合型社会：设计自组织系统集群行为的挑战及前景 | 复杂性文摘》]&lt;br /&gt;
*北京师范大学系统科学学院教授狄增如亲授[https://campus.swarma.org/play/coursedetail?id=10671 《自组织理论》]，帮助梳理了科学的发展脉络，介绍了时间反演对称、热力学第二定律及自组织现象的理论方法。&lt;br /&gt;
*北京师范大学系统科学学院教授李红刚亲授[https://campus.swarma.org/play/coursedetail?id=11008 《结构与功能：从无序到有序》]，一起探讨系统的结构与功能，聚焦于自组织涌现，如何从无序走向有序。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
本中文词条由[[用户:木子二月鸟]]用户参与编译，  刘佩佩 用户审校，欢迎在讨论页面留言。&lt;br /&gt;
&lt;br /&gt;
'''本词条内容源自wikipedia及公开资料，遵守 CC3.0协议。'''&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E7%94%A8%E6%88%B7%E8%AE%A8%E8%AE%BA:%E6%9C%A8%E5%AD%90%E4%BA%8C%E6%9C%88%E9%B8%9F&amp;diff=7067</id>
		<title>用户讨论:木子二月鸟</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E7%94%A8%E6%88%B7%E8%AE%A8%E8%AE%BA:%E6%9C%A8%E5%AD%90%E4%BA%8C%E6%9C%88%E9%B8%9F&amp;diff=7067"/>
		<updated>2020-05-07T00:59:19Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
==模体发现算法 Motif discovery algorithms==&lt;br /&gt;
&lt;br /&gt;
Various solutions have been proposed for the challenging problem of motif discovery. These algorithms can be classified under various paradigms such as exact counting methods, sampling methods, pattern growth methods and so on. However, motif discovery problem comprises two main steps: first, calculating the number of occurrences of a sub-graph and then, evaluating the sub-graph significance. The recurrence is significant if it is detectably far more than expected. Roughly speaking, the expected number of appearances of a sub-graph can be determined by a Null-model, which is defined by an ensemble of random networks with some of the same properties as the original network.&lt;br /&gt;
&lt;br /&gt;
Here, a review on computational aspects of major algorithms is given and their related benefits and drawbacks from an algorithmic perspective are discussed.&lt;br /&gt;
&lt;br /&gt;
针对模体发现这一问题存在多种解决方案。这些算法可以归纳为不同的范式：例如精确计数方法，采样方法，模式增长方法等。但模体发现问题包括两个主要步骤：首先，计算子图的出现次数，然后评估子图的重要性。如果检测到的重现性远超过预期，那么这种重现性是很显著的。粗略地讲，子图的预期出现次数可以由'''零模型 Null-model''' 确定，该模型定义为具有与原始网络某些属性相同的随机网络的集合。&lt;br /&gt;
&lt;br /&gt;
接下来，对下列算法的计算原理进行简要回顾，并从算法的角度讨论了它们的优缺点。&lt;br /&gt;
&lt;br /&gt;
===mfinder 算法===&lt;br /&gt;
&lt;br /&gt;
mfinder, the first motif-mining tool, implements two kinds of motif finding algorithms: a full enumeration and a sampling method. Until 2004, the only exact counting method for NM (network motif) detection was the brute-force one proposed by Milo et al..[3] This algorithm was successful for discovering small motifs, but using this method for finding even size 5 or 6 motifs was not computationally feasible. Hence, a new approach to this problem was needed.&lt;br /&gt;
&lt;br /&gt;
'''mfinder'''是第一个模体挖掘工具，它主要有两种模体查找算法：完全枚举 full enumeration 和采样方法 sampling method。直到2004年，用于NM（'''网络模体 networkmotif'''）检测的唯一精确计数方法是'''Milo'''等人提出的暴力穷举方法。[3]该算法成功地发现了小规模的模体，但是这种方法甚至对于发现规模为5个或6个的模体在计算上都不可行的。因此，需要一种解决该问题的新方法。&lt;br /&gt;
&lt;br /&gt;
Kashtan et al. [9] presented the first sampling NM discovery algorithm, which was based on edge sampling throughout the network. This algorithm estimates concentrations of induced sub-graphs and can be utilized for motif discovery in directed or undirected networks. The sampling procedure of the algorithm starts from an arbitrary edge of the network that leads to a sub-graph of size two, and then expands the sub-graph by choosing a random edge that is incident to the current sub-graph. After that, it continues choosing random neighboring edges until a sub-graph of size n is obtained. Finally, the sampled sub-graph is expanded to include all of the edges that exist in the network between these n nodes. When an algorithm uses a sampling approach, taking unbiased samples is the most important issue that the algorithm might address. The sampling procedure, however, does not take samples uniformly and therefore Kashtan et al. proposed a weighting scheme that assigns different weights to the different sub-graphs within network.[9] The underlying principle of weight allocation is exploiting the information of the sampling probability for each sub-graph, i.e. the probable sub-graphs will obtain comparatively less weights in comparison to the improbable sub-graphs; hence, the algorithm must calculate the sampling probability of each sub-graph that has been sampled. This weighting technique assists mfinder to determine sub-graph concentrations impartially.&lt;br /&gt;
&lt;br /&gt;
'''Kashtan''' 等人[9]首次提出了一种基于边缘采样的网络模体（NM）采样发现算法。该算法估计了&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;所含子图 induced sub-graphs 的集中度 concentrations &amp;lt;/font&amp;gt;，可用于有向或无向网络中的模体发现。该算法的采样过程从网络的任意一条边开始，该边连向大小为2的子图，然后选择一条与当前子图相关的随机边对子图进行扩展。之后，它将继续选择随机的相邻边，直到获得大小为n的子图为止。最后，采样得到的子图扩展为包括这n个节点在内的网络中存在的所有边。当使用采样方法时，获取无偏样本是这类算法可能面临的最重要问题。而且，采样过程并不能保证采到所有的样本（也就是不能保证得到所有的子图，译者注），因此，Kashtan 等人又提出了一种加权方案，为网络中的不同子图分配不同的权重。[9]权重分配的基本原理是利用每个子图的抽样概率信息，即，与不可能的子图相比，可能的子图将获得相对较少的权重；因此，该算法必须计算已采样的每个子图的采样概率。这种加权技术有助于mfinder公正地确定子图的&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;集中度 concentrations &amp;lt;/font&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
In expanded to include sharp contrast to exhaustive search, the computational time of the algorithm surprisingly is asymptotically independent of the network size. An analysis of the computational time of the algorithm has shown that it takes O(nn) for each sample of a sub-graph of size n from the network. On the other hand, there is no analysis in [9] on the classification time of sampled sub-graphs that requires solving the graph isomorphism problem for each sub-graph sample. Additionally, an extra computational effort is imposed on the algorithm by the sub-graph weight calculation. But it is unavoidable to say that the algorithm may sample the same sub-graph multiple times – spending time without gathering any information.[10] In conclusion, by taking the advantages of sampling, the algorithm performs more efficiently than an exhaustive search algorithm; however, it only determines sub-graphs concentrations approximately. This algorithm can find motifs up to size 6 because of its main implementation, and as result it gives the most significant motif, not all the others too. Also, it is necessary to mention that this tool has no option of visual presentation. The sampling algorithm is shown briefly:&lt;br /&gt;
&lt;br /&gt;
与穷举搜索形成鲜明对比的是，该算法的计算时间竟然与网络大小渐近无关。对算法时间复杂度的分析表明，对于网络中大小为n的子图的每个样本，它的时间复杂度为&amp;lt;math&amp;gt;O(n^n)&amp;lt;/math&amp;gt;。另一方面，&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;并没有对已采样子图的每一个子图样本判断图同构问题的分类时间进行分析&amp;lt;/font&amp;gt;[9]。另外，子图权重计算将额外增加该算法的计算负担。但是不得不指出的是，该算法可能会多次采样相同的子图——花费时间而不收集任何有用信息。[10]总之，通过利用采样的优势，该算法的性能比穷举搜索算法更有效；但是，它只能大致确定子图的&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;集中度 concentrations &amp;lt;/font&amp;gt;。由于该算法的实现方式，使得它可以找到最大为6的模体，并且它会给出的最重要的模体，而不是其他所有模体。另外，有必要提到此工具没有可视化的呈现。采样算法简要显示如下：&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+ mfinder&lt;br /&gt;
|-&lt;br /&gt;
!rowspan=&amp;quot;1&amp;quot;|Definitions: Esis the set of picked edges. Vs is the set of all nodes that are touched by the edges in E.&lt;br /&gt;
|-&lt;br /&gt;
|rowspan=&amp;quot;5&amp;quot;|Init Vs and Es to be empty sets.&amp;lt;br&amp;gt;&lt;br /&gt;
1. Pick a random edge e1 = (vi, vj). Update Es = {e1}, Vs = {vi, vj} &amp;lt;br&amp;gt;&lt;br /&gt;
2. Make a list L of all neighbor edges of Es. Omit from L all edges between members of Vs. &amp;lt;br&amp;gt;&lt;br /&gt;
3. Pick a random edge e = {vk,vl} from L. Update Es = Es ⋃ {e}, Vs = Vs ⋃ {vk, vl}. &amp;lt;br&amp;gt;&lt;br /&gt;
4. Repeat steps 2-3 until completing an n-node subgraph (until |Vs| = n). &amp;lt;br&amp;gt;&lt;br /&gt;
5. Calculate the probability to sample the picked n-node subgraph. &amp;lt;br&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+ mfinder&lt;br /&gt;
|-&lt;br /&gt;
!rowspan=&amp;quot;1&amp;quot;|定义：&amp;lt;math&amp;gt;E_{s}&amp;lt;/math&amp;gt;是采集的边集合。&amp;lt;math&amp;gt;V_{s}&amp;lt;/math&amp;gt;是&amp;lt;math&amp;gt;E&amp;lt;/math&amp;gt;中所有边的顶点的集合。&lt;br /&gt;
|-&lt;br /&gt;
|rowspan=&amp;quot;5&amp;quot;|初始化&amp;lt;math&amp;gt;V_{s}&amp;lt;/math&amp;gt;和&amp;lt;math&amp;gt;E_{s}&amp;lt;/math&amp;gt;为空集。&amp;lt;br&amp;gt;&lt;br /&gt;
1. 随机选择一条边&amp;lt;math&amp;gt; e_{1} = (v_{i}, v_{j}) &amp;lt;/math&amp;gt;，更新 &amp;lt;math&amp;gt;E_{s} = \{e_{1}\}, V{s} = \{v_{i}, v_{j}\}&amp;lt;/math&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
2. 列出&amp;lt;math&amp;gt;E{s}&amp;lt;/math&amp;gt;的所有邻边列表&amp;lt;math&amp;gt; L &amp;lt;/math&amp;gt;，从&amp;lt;math&amp;gt; L &amp;lt;/math&amp;gt;中删除&amp;lt;math&amp;gt;V{s}&amp;lt;/math&amp;gt;中所有元素组成的边。&amp;lt;br&amp;gt;&lt;br /&gt;
3. 从&amp;lt;math&amp;gt; L &amp;lt;/math&amp;gt;中随机选择一条边&amp;lt;math&amp;gt; e = \{v_{k},v_{l}\} &amp;lt;/math&amp;gt;， 更新&amp;lt;math&amp;gt;E_{s} = E_{s} \cup  \{e\} , V_{s} = V_{s} \cup  \{v_{k}, v_{l}\}&amp;lt;/math&amp;gt;。&amp;lt;br&amp;gt;&lt;br /&gt;
4. 重复步骤2-3，直到完成包含n个节点的子图 (&amp;lt;math&amp;gt;\left | V_{s} \right | = n&amp;lt;/math&amp;gt;)。&amp;lt;br&amp;gt;&lt;br /&gt;
5. 计算对选取的n节点子图进行采样的概率。&amp;lt;br&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===FPF (Mavisto)算法===&lt;br /&gt;
&lt;br /&gt;
Schreiber and Schwöbbermeyer [12] proposed an algorithm named flexible pattern finder (FPF) for extracting frequent sub-graphs of an input network and implemented it in a system named Mavisto.[27] Their algorithm exploits the downward closure property which is applicable for frequency concepts F2 and F3. The downward closure property asserts that the frequency for sub-graphs decrease monotonically by increasing the size of sub-graphs; however, this property does not hold necessarily for frequency concept F1. FPF is based on a pattern tree (see figure) consisting of nodes that represents different graphs (or patterns), where the parent of each node is a sub-graph of its children nodes; in other words, the corresponding graph of each pattern tree's node is expanded by adding a new edge to the graph of its parent node.&lt;br /&gt;
&lt;br /&gt;
Schreiber和Schwöbbermeyer [12]提出了一种称为灵活模式查找器（FPF）的算法，用于提取输入网络的频繁子图，并将其在名为Mavisto的系统中加以实现。[27]他们的算法利用了向下闭包特性，该特性适用于频率概念&amp;lt;math&amp;gt;F_{2}&amp;lt;/math&amp;gt;和&amp;lt;math&amp;gt;F_{3}&amp;lt;/math&amp;gt;。向下闭包性质表明，子图的频率随着子图的大小而单调下降；但这一性质并不一定适用于频率概念&amp;lt;math&amp;gt;F_{1}&amp;lt;/math&amp;gt;。FPF算法基于模式树（见右图），由代表不同图形（或模式）的节点组成，其中每个节点的父节点是其子节点的子图；换句话说，每个模式树节点的对应图通过向其父节点图添加新边来扩展。&lt;br /&gt;
&lt;br /&gt;
[[Image:The pattern tree in FPF algorithm.jpg|right|thumb|''Illustration of the pattern tree in FPF algorithm.''.]]&lt;br /&gt;
&lt;br /&gt;
At first, the FPF algorithm enumerates and maintains the information of all matches of a sub-graph located at the root of the pattern tree. Then, one-by-one it builds child nodes of the previous node in the pattern tree by adding one edge supported by a matching edge in the target graph, and tries to expand all of the previous information about matches to the new sub-graph (child node). In next step, it decides whether the frequency of the current pattern is lower than a predefined threshold or not. If it is lower and if downward closure holds, FPF can abandon that path and not traverse further in this part of the tree; as a result, unnecessary computation is avoided. This procedure is continued until there is no remaining path to traverse.&lt;br /&gt;
&lt;br /&gt;
首先，FPF算法枚举并维护位于模式树根部的子图的所有匹配信息。然后，它通过在目标图中添加匹配边缘支持的一条边缘，在模式树中一一建立前一节点的子节点，然后通过在目标图中添加匹配边支持的一条边，逐个构建模式树中前一个节点的子节点，并尝试将以前关于匹配的所有信息拓展到新的子图(子节点)中。下一步，它判断当前模式的频率是否低于预定义的阈值。如果它低于阈值且保持向下闭包，则FPF算法会放弃该路径，而不会在树的此部分进一步遍历；这样就避免了不必要的计算。重复此过程，直到没有剩余可遍历的路径为止。&lt;br /&gt;
&lt;br /&gt;
The advantage of the algorithm is that it does not consider infrequent sub-graphs and tries to finish the enumeration process as soon as possible; therefore, it only spends time for promising nodes in the pattern tree and discards all other nodes. As an added bonus, the pattern tree notion permits FPF to be implemented and executed in a parallel manner since it is possible to traverse each path of the pattern tree independently. However, FPF is most useful for frequency concepts F2 and F3, because downward closure is not applicable to F1. Nevertheless, the pattern tree is still practical for F1 if the algorithm runs in parallel. Another advantage of the algorithm is that the implementation of this algorithm has no limitation on motif size, which makes it more amenable to improvements. The pseudocode of FPF (Mavisto) is shown below:&lt;br /&gt;
&lt;br /&gt;
该算法的优点是它不会考虑不频繁的子图，并尝试尽快完成枚举过程；因此，它只花时间在模式树中用于有希望的节点上，而放弃所有其他节点。还有一点额外的好处，模式树概念允许 FPF 以并行方式实现和执行，因为它可以独立地遍历模式树的每个路径。但是，FPF对于频率概念&amp;lt;math&amp;gt;F_{2}&amp;lt;/math&amp;gt;和&amp;lt;math&amp;gt;F_{3}&amp;lt;/math&amp;gt;最为有用，因为向下闭包不适用于&amp;lt;math&amp;gt;F_{1}&amp;lt;/math&amp;gt;。尽管如此，如果算法并行运行，那么模式树对于&amp;lt;math&amp;gt;F_{1}&amp;lt;/math&amp;gt;仍然是可行的。该算法的另一个优点是它的实现对模体大小没有限制，这使其更易于改进。FPF（Mavisto）的伪代码如下所示：&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+ Mavisto&lt;br /&gt;
|-&lt;br /&gt;
!rowspan=&amp;quot;1&amp;quot;|Data: Graph G, target pattern size t, frequency concept F.&amp;lt;br&amp;gt;&lt;br /&gt;
Result: Set R of patterns of size t with maximum frequency.&amp;lt;br&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|rowspan=&amp;quot;20&amp;quot;|R ← φ, fmax ← 0&amp;lt;br&amp;gt;&lt;br /&gt;
P ←start pattern p1 of size 1&amp;lt;br&amp;gt;&lt;br /&gt;
Mp1 ←all matches of p1 in G&amp;lt;br&amp;gt;&lt;br /&gt;
While P ≠ φ do&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;Pmax ←select all patterns from P with maximum size.&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;P ← select pattern with maximum frequency from Pmax&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;Ε = ExtensionLoop(G, p, Mp)&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;Foreach pattern p ∈ E&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;If F = F1 then f ← size(Mp)&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;Else f ← Maximum Independent set(F, Mp)&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;End&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;If size(p) = t then&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;If f = fmax then R ← R ⋃ {p}&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;Else if f &amp;gt; fmax then R ← {p}; fmax ← f&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;End&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;Else&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;If F = F1 or f ≥ fmax then P ← P ⋃ {p}&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;End&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;End&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;End&amp;lt;br&amp;gt;&lt;br /&gt;
End&amp;lt;br&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+ Mavisto&lt;br /&gt;
|-&lt;br /&gt;
!rowspan=&amp;quot;1&amp;quot;|数据: 图 &amp;lt;math&amp;gt;G&amp;lt;/math&amp;gt;, 目标模式规模 &amp;lt;math&amp;gt;t&amp;lt;/math&amp;gt;, 频率概念 &amp;lt;math&amp;gt;F&amp;lt;/math&amp;gt;。&amp;lt;br&amp;gt;&lt;br /&gt;
结果: 以最大频率设置大小为 &amp;lt;math&amp;gt;t&amp;lt;/math&amp;gt;的模式 &amp;lt;math&amp;gt;R&amp;lt;/math&amp;gt;.&amp;lt;br&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|rowspan=&amp;quot;20&amp;quot;| &amp;lt;math&amp;gt;R \leftarrow \Phi , f_{max}\leftarrow 0&amp;lt;/math&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;P \leftarrow&amp;lt;/math&amp;gt; 开始于大小为1的模式 &amp;lt;math&amp;gt;p_{1}&amp;lt;/math&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;M_{p_{1}} \leftarrow &amp;lt;/math&amp;gt; 图 &amp;lt;math&amp;gt;G&amp;lt;/math&amp;gt; 中模式 &amp;lt;math&amp;gt;p_{1}&amp;lt;/math&amp;gt; 的所有匹配&amp;lt;br&amp;gt;&lt;br /&gt;
当 &amp;lt;math&amp;gt;P \neq \Phi &amp;lt;/math&amp;gt; 时，执行：&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;lt;math&amp;gt;P_{max} \leftarrow&amp;lt;/math&amp;gt; 从 &amp;lt;math&amp;gt;P&amp;lt;/math&amp;gt; 中选择最大规模的所有模式。&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;lt;math&amp;gt;P\leftarrow&amp;lt;/math&amp;gt; 从 &amp;lt;math&amp;gt;P_{max}&amp;lt;/math&amp;gt; 中选择最大频率的模式&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;lt;math&amp;gt;E = ExtensionLoop(G, p, M_{p})&amp;lt;/math&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;对于 &amp;lt;math&amp;gt;p \in E &amp;lt;/math&amp;gt; 的所有模式：&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;如果 &amp;lt;math&amp;gt;F = F_{1}&amp;lt;/math&amp;gt; ，那么 &amp;lt;math&amp;gt;f \leftarrow size(M_{p})&amp;lt;/math&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;其他&amp;lt;math&amp;gt;f \leftarrow&amp;lt;/math&amp;gt; 最大独立集 &amp;lt;math&amp;gt;(F, M_{p})&amp;lt;/math&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;结束&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;如果 &amp;lt;math&amp;gt;size(p) = t&amp;lt;/math&amp;gt; ，那么&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;如果 &amp;lt;math&amp;gt;f = f_{max}&amp;lt;/math&amp;gt; ，那么 &amp;lt;math&amp;gt;R \leftarrow R \cup \{p\}&amp;lt;/math&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;其他 如果 &amp;lt;math&amp;gt;f &amp;gt; f_{max}&amp;lt;/math&amp;gt; ，那么 &amp;lt;math&amp;gt;R \leftarrow \{p\}&amp;lt;/math&amp;gt;； &amp;lt;math&amp;gt;f_{max} \leftarrow f&amp;lt;/math&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;结束&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;其他&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;如果 &amp;lt;math&amp;gt;F = F_{1} or f \geq  f_{max}&amp;lt;/math&amp;gt; ，那么 &amp;lt;math&amp;gt; P \leftarrow P \cup \{p\}&amp;lt;/math&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;结束&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;结束&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;结束&amp;lt;br&amp;gt;&lt;br /&gt;
结束&amp;lt;br&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[3]Milo R, Shen-Orr SS, Itzkovitz S, Kashtan N, Chklovskii D, Alon U (2002). &amp;quot;Network motifs: simple building blocks of complex networks&amp;quot;. Science. 298 (5594): 824–827. Bibcode:2002Sci...298..824M. CiteSeerX 10.1.1.225.8750. doi:10.1126/science.298.5594.824. PMID 12399590.&lt;br /&gt;
&lt;br /&gt;
[9]Kashtan N, Itzkovitz S, Milo R, Alon U (2004). &amp;quot;Efficient sampling algorithm for estimating sub-graph concentrations and detecting network motifs&amp;quot;. Bioinformatics. 20 (11): 1746–1758. doi:10.1093/bioinformatics/bth163. PMID 15001476.&lt;br /&gt;
&lt;br /&gt;
[10]Wernicke S (2006). &amp;quot;Efficient detection of network motifs&amp;quot;. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 3 (4): 347–359. CiteSeerX 10.1.1.304.2576. doi:10.1109/tcbb.2006.51. PMID 17085844.&lt;br /&gt;
&lt;br /&gt;
[12]Schreiber F, Schwöbbermeyer H (2005). Frequency concepts and pattern detection for the analysis of motifs in networks. Transactions on Computational Systems Biology III. Lecture Notes in Computer Science. 3737. pp. 89–104. CiteSeerX 10.1.1.73.1130. doi:10.1007/11599128_7. ISBN 978-3-540-30883-6.&lt;br /&gt;
&lt;br /&gt;
[27]Schreiber F, Schwobbermeyer H (2005). &amp;quot;MAVisto: a tool for the exploration of network motifs&amp;quot;. Bioinformatics. 21 (17): 3572–3574. doi:10.1093/bioinformatics/bti556. PMID 16020473.&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E7%94%A8%E6%88%B7%E8%AE%A8%E8%AE%BA:%E6%9C%A8%E5%AD%90%E4%BA%8C%E6%9C%88%E9%B8%9F&amp;diff=7065</id>
		<title>用户讨论:木子二月鸟</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E7%94%A8%E6%88%B7%E8%AE%A8%E8%AE%BA:%E6%9C%A8%E5%AD%90%E4%BA%8C%E6%9C%88%E9%B8%9F&amp;diff=7065"/>
		<updated>2020-05-07T00:58:45Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：/* 模体发现算法 Motif discovery algorithms */ 新章节&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
==模体发现算法 Motif discovery algorithms==&lt;br /&gt;
&lt;br /&gt;
Various solutions have been proposed for the challenging problem of motif discovery. These algorithms can be classified under various paradigms such as exact counting methods, sampling methods, pattern growth methods and so on. However, motif discovery problem comprises two main steps: first, calculating the number of occurrences of a sub-graph and then, evaluating the sub-graph significance. The recurrence is significant if it is detectably far more than expected. Roughly speaking, the expected number of appearances of a sub-graph can be determined by a Null-model, which is defined by an ensemble of random networks with some of the same properties as the original network.&lt;br /&gt;
&lt;br /&gt;
Here, a review on computational aspects of major algorithms is given and their related benefits and drawbacks from an algorithmic perspective are discussed.&lt;br /&gt;
&lt;br /&gt;
针对模体发现这一问题存在多种解决方案。这些算法可以归纳为不同的范式：例如精确计数方法，采样方法，模式增长方法等。但模体发现问题包括两个主要步骤：首先，计算子图的出现次数，然后评估子图的重要性。如果检测到的重现性远超过预期，那么这种重现性是很显著的。粗略地讲，子图的预期出现次数可以由'''零模型 Null-model''' 确定，该模型定义为具有与原始网络某些属性相同的随机网络的集合。&lt;br /&gt;
&lt;br /&gt;
接下来，对下列算法的计算原理进行简要回顾，并从算法的角度讨论了它们的优缺点。&lt;br /&gt;
&lt;br /&gt;
===mfinder 算法===&lt;br /&gt;
&lt;br /&gt;
mfinder, the first motif-mining tool, implements two kinds of motif finding algorithms: a full enumeration and a sampling method. Until 2004, the only exact counting method for NM (network motif) detection was the brute-force one proposed by Milo et al..[3] This algorithm was successful for discovering small motifs, but using this method for finding even size 5 or 6 motifs was not computationally feasible. Hence, a new approach to this problem was needed.&lt;br /&gt;
&lt;br /&gt;
'''mfinder'''是第一个模体挖掘工具，它主要有两种模体查找算法：完全枚举 full enumeration 和采样方法 sampling method。直到2004年，用于NM（'''网络模体 networkmotif'''）检测的唯一精确计数方法是'''Milo'''等人提出的暴力穷举方法。[3]该算法成功地发现了小规模的模体，但是这种方法甚至对于发现规模为5个或6个的模体在计算上都不可行的。因此，需要一种解决该问题的新方法。&lt;br /&gt;
&lt;br /&gt;
Kashtan et al. [9] presented the first sampling NM discovery algorithm, which was based on edge sampling throughout the network. This algorithm estimates concentrations of induced sub-graphs and can be utilized for motif discovery in directed or undirected networks. The sampling procedure of the algorithm starts from an arbitrary edge of the network that leads to a sub-graph of size two, and then expands the sub-graph by choosing a random edge that is incident to the current sub-graph. After that, it continues choosing random neighboring edges until a sub-graph of size n is obtained. Finally, the sampled sub-graph is expanded to include all of the edges that exist in the network between these n nodes. When an algorithm uses a sampling approach, taking unbiased samples is the most important issue that the algorithm might address. The sampling procedure, however, does not take samples uniformly and therefore Kashtan et al. proposed a weighting scheme that assigns different weights to the different sub-graphs within network.[9] The underlying principle of weight allocation is exploiting the information of the sampling probability for each sub-graph, i.e. the probable sub-graphs will obtain comparatively less weights in comparison to the improbable sub-graphs; hence, the algorithm must calculate the sampling probability of each sub-graph that has been sampled. This weighting technique assists mfinder to determine sub-graph concentrations impartially.&lt;br /&gt;
&lt;br /&gt;
'''Kashtan''' 等人[9]首次提出了一种基于边缘采样的网络模体（NM）采样发现算法。该算法估计了&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;所含子图 induced sub-graphs 的集中度 concentrations &amp;lt;/font&amp;gt;，可用于有向或无向网络中的模体发现。该算法的采样过程从网络的任意一条边开始，该边连向大小为2的子图，然后选择一条与当前子图相关的随机边对子图进行扩展。之后，它将继续选择随机的相邻边，直到获得大小为n的子图为止。最后，采样得到的子图扩展为包括这n个节点在内的网络中存在的所有边。当使用采样方法时，获取无偏样本是这类算法可能面临的最重要问题。而且，采样过程并不能保证采到所有的样本（也就是不能保证得到所有的子图，译者注），因此，Kashtan 等人又提出了一种加权方案，为网络中的不同子图分配不同的权重。[9]权重分配的基本原理是利用每个子图的抽样概率信息，即，与不可能的子图相比，可能的子图将获得相对较少的权重；因此，该算法必须计算已采样的每个子图的采样概率。这种加权技术有助于mfinder公正地确定子图的&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;集中度 concentrations &amp;lt;/font&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
In expanded to include sharp contrast to exhaustive search, the computational time of the algorithm surprisingly is asymptotically independent of the network size. An analysis of the computational time of the algorithm has shown that it takes O(nn) for each sample of a sub-graph of size n from the network. On the other hand, there is no analysis in [9] on the classification time of sampled sub-graphs that requires solving the graph isomorphism problem for each sub-graph sample. Additionally, an extra computational effort is imposed on the algorithm by the sub-graph weight calculation. But it is unavoidable to say that the algorithm may sample the same sub-graph multiple times – spending time without gathering any information.[10] In conclusion, by taking the advantages of sampling, the algorithm performs more efficiently than an exhaustive search algorithm; however, it only determines sub-graphs concentrations approximately. This algorithm can find motifs up to size 6 because of its main implementation, and as result it gives the most significant motif, not all the others too. Also, it is necessary to mention that this tool has no option of visual presentation. The sampling algorithm is shown briefly:&lt;br /&gt;
&lt;br /&gt;
与穷举搜索形成鲜明对比的是，该算法的计算时间竟然与网络大小渐近无关。对算法时间复杂度的分析表明，对于网络中大小为n的子图的每个样本，它的时间复杂度为&amp;lt;math&amp;gt;O(n^n)&amp;lt;/math&amp;gt;。另一方面，&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;并没有对已采样子图的每一个子图样本判断图同构问题的分类时间进行分析&amp;lt;/font&amp;gt;[9]。另外，子图权重计算将额外增加该算法的计算负担。但是不得不指出的是，该算法可能会多次采样相同的子图——花费时间而不收集任何有用信息。[10]总之，通过利用采样的优势，该算法的性能比穷举搜索算法更有效；但是，它只能大致确定子图的&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;集中度 concentrations &amp;lt;/font&amp;gt;。由于该算法的实现方式，使得它可以找到最大为6的模体，并且它会给出的最重要的模体，而不是其他所有模体。另外，有必要提到此工具没有可视化的呈现。采样算法简要显示如下：&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+ mfinder&lt;br /&gt;
|-&lt;br /&gt;
!rowspan=&amp;quot;1&amp;quot;|Definitions: Esis the set of picked edges. Vs is the set of all nodes that are touched by the edges in E.&lt;br /&gt;
|-&lt;br /&gt;
|rowspan=&amp;quot;5&amp;quot;|Init Vs and Es to be empty sets.&amp;lt;br&amp;gt;&lt;br /&gt;
1. Pick a random edge e1 = (vi, vj). Update Es = {e1}, Vs = {vi, vj} &amp;lt;br&amp;gt;&lt;br /&gt;
2. Make a list L of all neighbor edges of Es. Omit from L all edges between members of Vs. &amp;lt;br&amp;gt;&lt;br /&gt;
3. Pick a random edge e = {vk,vl} from L. Update Es = Es ⋃ {e}, Vs = Vs ⋃ {vk, vl}. &amp;lt;br&amp;gt;&lt;br /&gt;
4. Repeat steps 2-3 until completing an n-node subgraph (until |Vs| = n). &amp;lt;br&amp;gt;&lt;br /&gt;
5. Calculate the probability to sample the picked n-node subgraph. &amp;lt;br&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+ mfinder&lt;br /&gt;
|-&lt;br /&gt;
!rowspan=&amp;quot;1&amp;quot;|定义：&amp;lt;math&amp;gt;E_{s}&amp;lt;/math&amp;gt;是采集的边集合。&amp;lt;math&amp;gt;V_{s}&amp;lt;/math&amp;gt;是&amp;lt;math&amp;gt;E&amp;lt;/math&amp;gt;中所有边的顶点的集合。&lt;br /&gt;
|-&lt;br /&gt;
|rowspan=&amp;quot;5&amp;quot;|初始化&amp;lt;math&amp;gt;V_{s}&amp;lt;/math&amp;gt;和&amp;lt;math&amp;gt;E_{s}&amp;lt;/math&amp;gt;为空集。&amp;lt;br&amp;gt;&lt;br /&gt;
1. 随机选择一条边&amp;lt;math&amp;gt; e_{1} = (v_{i}, v_{j}) &amp;lt;/math&amp;gt;，更新 &amp;lt;math&amp;gt;E_{s} = \{e_{1}\}, V{s} = \{v_{i}, v_{j}\}&amp;lt;/math&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
2. 列出&amp;lt;math&amp;gt;E{s}&amp;lt;/math&amp;gt;的所有邻边列表&amp;lt;math&amp;gt; L &amp;lt;/math&amp;gt;，从&amp;lt;math&amp;gt; L &amp;lt;/math&amp;gt;中删除&amp;lt;math&amp;gt;V{s}&amp;lt;/math&amp;gt;中所有元素组成的边。&amp;lt;br&amp;gt;&lt;br /&gt;
3. 从&amp;lt;math&amp;gt; L &amp;lt;/math&amp;gt;中随机选择一条边&amp;lt;math&amp;gt; e = \{v_{k},v_{l}\} &amp;lt;/math&amp;gt;， 更新&amp;lt;math&amp;gt;E_{s} = E_{s} \cup  \{e\} , V_{s} = V_{s} \cup  \{v_{k}, v_{l}\}&amp;lt;/math&amp;gt;。&amp;lt;br&amp;gt;&lt;br /&gt;
4. 重复步骤2-3，直到完成包含n个节点的子图 (&amp;lt;math&amp;gt;\left | V_{s} \right | = n&amp;lt;/math&amp;gt;)。&amp;lt;br&amp;gt;&lt;br /&gt;
5. 计算对选取的n节点子图进行采样的概率。&amp;lt;br&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===FPF (Mavisto)算法===&lt;br /&gt;
&lt;br /&gt;
Schreiber and Schwöbbermeyer [12] proposed an algorithm named flexible pattern finder (FPF) for extracting frequent sub-graphs of an input network and implemented it in a system named Mavisto.[27] Their algorithm exploits the downward closure property which is applicable for frequency concepts F2 and F3. The downward closure property asserts that the frequency for sub-graphs decrease monotonically by increasing the size of sub-graphs; however, this property does not hold necessarily for frequency concept F1. FPF is based on a pattern tree (see figure) consisting of nodes that represents different graphs (or patterns), where the parent of each node is a sub-graph of its children nodes; in other words, the corresponding graph of each pattern tree's node is expanded by adding a new edge to the graph of its parent node.&lt;br /&gt;
&lt;br /&gt;
Schreiber和Schwöbbermeyer [12]提出了一种称为灵活模式查找器（FPF）的算法，用于提取输入网络的频繁子图，并将其在名为Mavisto的系统中加以实现。[27]他们的算法利用了向下闭包特性，该特性适用于频率概念&amp;lt;math&amp;gt;F_{2}&amp;lt;/math&amp;gt;和&amp;lt;math&amp;gt;F_{3}&amp;lt;/math&amp;gt;。向下闭包性质表明，子图的频率随着子图的大小而单调下降；但这一性质并不一定适用于频率概念&amp;lt;math&amp;gt;F_{1}&amp;lt;/math&amp;gt;。FPF算法基于模式树（见右图），由代表不同图形（或模式）的节点组成，其中每个节点的父节点是其子节点的子图；换句话说，每个模式树节点的对应图通过向其父节点图添加新边来扩展。&lt;br /&gt;
&lt;br /&gt;
[[Image:The pattern tree in FPF algorithm.jpg|right|thumb|''Illustration of the pattern tree in FPF algorithm.''.]]&lt;br /&gt;
&lt;br /&gt;
At first, the FPF algorithm enumerates and maintains the information of all matches of a sub-graph located at the root of the pattern tree. Then, one-by-one it builds child nodes of the previous node in the pattern tree by adding one edge supported by a matching edge in the target graph, and tries to expand all of the previous information about matches to the new sub-graph (child node). In next step, it decides whether the frequency of the current pattern is lower than a predefined threshold or not. If it is lower and if downward closure holds, FPF can abandon that path and not traverse further in this part of the tree; as a result, unnecessary computation is avoided. This procedure is continued until there is no remaining path to traverse.&lt;br /&gt;
&lt;br /&gt;
首先，FPF算法枚举并维护位于模式树根部的子图的所有匹配信息。然后，它通过在目标图中添加匹配边缘支持的一条边缘，在模式树中一一建立前一节点的子节点，然后通过在目标图中添加匹配边支持的一条边，逐个构建模式树中前一个节点的子节点，并尝试将以前关于匹配的所有信息拓展到新的子图(子节点)中。下一步，它判断当前模式的频率是否低于预定义的阈值。如果它低于阈值且保持向下闭包，则FPF算法会放弃该路径，而不会在树的此部分进一步遍历；这样就避免了不必要的计算。重复此过程，直到没有剩余可遍历的路径为止。&lt;br /&gt;
&lt;br /&gt;
The advantage of the algorithm is that it does not consider infrequent sub-graphs and tries to finish the enumeration process as soon as possible; therefore, it only spends time for promising nodes in the pattern tree and discards all other nodes. As an added bonus, the pattern tree notion permits FPF to be implemented and executed in a parallel manner since it is possible to traverse each path of the pattern tree independently. However, FPF is most useful for frequency concepts F2 and F3, because downward closure is not applicable to F1. Nevertheless, the pattern tree is still practical for F1 if the algorithm runs in parallel. Another advantage of the algorithm is that the implementation of this algorithm has no limitation on motif size, which makes it more amenable to improvements. The pseudocode of FPF (Mavisto) is shown below:&lt;br /&gt;
&lt;br /&gt;
该算法的优点是它不会考虑不频繁的子图，并尝试尽快完成枚举过程；因此，它只花时间在模式树中用于有希望的节点上，而放弃所有其他节点。还有一点额外的好处，模式树概念允许 FPF 以并行方式实现和执行，因为它可以独立地遍历模式树的每个路径。但是，FPF对于频率概念&amp;lt;math&amp;gt;F_{2}&amp;lt;/math&amp;gt;和&amp;lt;math&amp;gt;F_{3}&amp;lt;/math&amp;gt;最为有用，因为向下闭包不适用于&amp;lt;math&amp;gt;F_{1}&amp;lt;/math&amp;gt;。尽管如此，如果算法并行运行，那么模式树对于&amp;lt;math&amp;gt;F_{1}&amp;lt;/math&amp;gt;仍然是可行的。该算法的另一个优点是它的实现对模体大小没有限制，这使其更易于改进。FPF（Mavisto）的伪代码如下所示：&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+ Mavisto&lt;br /&gt;
|-&lt;br /&gt;
!rowspan=&amp;quot;1&amp;quot;|Data: Graph G, target pattern size t, frequency concept F.&amp;lt;br&amp;gt;&lt;br /&gt;
Result: Set R of patterns of size t with maximum frequency.&amp;lt;br&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|rowspan=&amp;quot;20&amp;quot;|R ← φ, fmax ← 0&amp;lt;br&amp;gt;&lt;br /&gt;
P ←start pattern p1 of size 1&amp;lt;br&amp;gt;&lt;br /&gt;
Mp1 ←all matches of p1 in G&amp;lt;br&amp;gt;&lt;br /&gt;
While P ≠ φ do&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;Pmax ←select all patterns from P with maximum size.&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;P ← select pattern with maximum frequency from Pmax&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;Ε = ExtensionLoop(G, p, Mp)&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;Foreach pattern p ∈ E&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;If F = F1 then f ← size(Mp)&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;Else f ← Maximum Independent set(F, Mp)&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;End&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;If size(p) = t then&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;If f = fmax then R ← R ⋃ {p}&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;Else if f &amp;gt; fmax then R ← {p}; fmax ← f&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;End&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;Else&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;If F = F1 or f ≥ fmax then P ← P ⋃ {p}&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;End&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;End&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;End&amp;lt;br&amp;gt;&lt;br /&gt;
End&amp;lt;br&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+ Mavisto&lt;br /&gt;
|-&lt;br /&gt;
!rowspan=&amp;quot;1&amp;quot;|数据: 图 &amp;lt;math&amp;gt;G&amp;lt;/math&amp;gt;, 目标模式规模 &amp;lt;math&amp;gt;t&amp;lt;/math&amp;gt;, 频率概念 &amp;lt;math&amp;gt;F&amp;lt;/math&amp;gt;。&amp;lt;br&amp;gt;&lt;br /&gt;
结果: 以最大频率设置大小为 &amp;lt;math&amp;gt;t&amp;lt;/math&amp;gt;的模式 &amp;lt;math&amp;gt;R&amp;lt;/math&amp;gt;.&amp;lt;br&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|rowspan=&amp;quot;20&amp;quot;| &amp;lt;math&amp;gt;R \leftarrow \Phi , f_{max}\leftarrow 0&amp;lt;/math&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;P \leftarrow&amp;lt;/math&amp;gt; 开始于大小为1的模式 &amp;lt;math&amp;gt;p_{1}&amp;lt;/math&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;M_{p_{1}} \leftarrow &amp;lt;/math&amp;gt; 图 &amp;lt;math&amp;gt;G&amp;lt;/math&amp;gt; 中模式 &amp;lt;math&amp;gt;p_{1}&amp;lt;/math&amp;gt; 的所有匹配&amp;lt;br&amp;gt;&lt;br /&gt;
当 &amp;lt;math&amp;gt;P \neq \Phi &amp;lt;/math&amp;gt; 时，执行：&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;lt;math&amp;gt;P_{max} \leftarrow&amp;lt;/math&amp;gt; 从 &amp;lt;math&amp;gt;P&amp;lt;/math&amp;gt; 中选择最大规模的所有模式。&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;lt;math&amp;gt;P\leftarrow&amp;lt;/math&amp;gt; 从 &amp;lt;math&amp;gt;P_{max}&amp;lt;/math&amp;gt; 中选择最大频率的模式&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;lt;math&amp;gt;E = ExtensionLoop(G, p, M_{p})&amp;lt;/math&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;对于 &amp;lt;math&amp;gt;p \in E &amp;lt;/math&amp;gt; 的所有模式：&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;如果 &amp;lt;math&amp;gt;F = F_{1}&amp;lt;/math&amp;gt; ，那么 &amp;lt;math&amp;gt;f \leftarrow size(M_{p})&amp;lt;/math&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;其他&amp;lt;math&amp;gt;f \leftarrow&amp;lt;/math&amp;gt; 最大独立集 &amp;lt;math&amp;gt;(F, M_{p})&amp;lt;/math&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;结束&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;如果 &amp;lt;math&amp;gt;size(p) = t&amp;lt;/math&amp;gt; ，那么&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;如果 &amp;lt;math&amp;gt;f = f_{max}&amp;lt;/math&amp;gt; ，那么 &amp;lt;math&amp;gt;R \leftarrow R \cup \{p\}&amp;lt;/math&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;其他 如果 &amp;lt;math&amp;gt;f &amp;gt; f_{max}&amp;lt;/math&amp;gt; ，那么 &amp;lt;math&amp;gt;R \leftarrow \{p\}&amp;lt;/math&amp;gt;； &amp;lt;math&amp;gt;f_{max} \leftarrow f&amp;lt;/math&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;结束&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;其他&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;如果 &amp;lt;math&amp;gt;F = F_{1} or f \geq  f_{max}&amp;lt;/math&amp;gt; ，那么 &amp;lt;math&amp;gt; P \leftarrow P \cup \{p\}&amp;lt;/math&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;结束&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;结束&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;结束&amp;lt;br&amp;gt;&lt;br /&gt;
结束&amp;lt;br&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[3]Milo R, Shen-Orr SS, Itzkovitz S, Kashtan N, Chklovskii D, Alon U (2002). &amp;quot;Network motifs: simple building blocks of complex networks&amp;quot;. Science. 298 (5594): 824–827. Bibcode:2002Sci...298..824M. CiteSeerX 10.1.1.225.8750. doi:10.1126/science.298.5594.824. PMID 12399590.&lt;br /&gt;
&lt;br /&gt;
[9]Kashtan N, Itzkovitz S, Milo R, Alon U (2004). &amp;quot;Efficient sampling algorithm for estimating sub-graph concentrations and detecting network motifs&amp;quot;. Bioinformatics. 20 (11): 1746–1758. doi:10.1093/bioinformatics/bth163. PMID 15001476.&lt;br /&gt;
&lt;br /&gt;
[10]Wernicke S (2006). &amp;quot;Efficient detection of network motifs&amp;quot;. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 3 (4): 347–359. CiteSeerX 10.1.1.304.2576. doi:10.1109/tcbb.2006.51. PMID 17085844.&lt;br /&gt;
&lt;br /&gt;
[12]Schreiber F, Schwöbbermeyer H (2005). Frequency concepts and pattern detection for the analysis of motifs in networks. Transactions on Computational Systems Biology III. Lecture Notes in Computer Science. 3737. pp. 89–104. CiteSeerX 10.1.1.73.1130. doi:10.1007/11599128_7. ISBN 978-3-540-30883-6.&lt;br /&gt;
&lt;br /&gt;
[27]Schreiber F, Schwobbermeyer H (2005). &amp;quot;MAVisto: a tool for the exploration of network motifs&amp;quot;. Bioinformatics. 21 (17): 3572–3574. doi:10.1093/bioinformatics/bti556. PMID 16020473.&lt;br /&gt;
&lt;br /&gt;
== 模体发现算法 Motif discovery algorithms ==&lt;br /&gt;
&lt;br /&gt;
模体发现算法 Motif discovery algorithms&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E7%BD%91%E7%BB%9C%E6%A8%A1%E4%BD%93&amp;diff=7063</id>
		<title>网络模体</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E7%BD%91%E7%BB%9C%E6%A8%A1%E4%BD%93&amp;diff=7063"/>
		<updated>2020-05-06T16:49:05Z</updated>

		<summary type="html">&lt;p&gt;木子二月鸟：&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;大家好，我们的公众号计划要推送一篇关于网络模体的综述文章，我们希望可以配套建议该重要概念：网络模体。现在希望可以大家一起协作完成这个词条。&lt;br /&gt;
翻译任务主要分为以下5个内容：&lt;br /&gt;
* 网络定义和历史  ---许菁 &lt;br /&gt;
* 网络模体的发现算法 mfinder和FPF算法---李鹏&lt;br /&gt;
* 网络模体的发现算法 G-Trie、算法对比和算法分类——Ricky（中英对照[[用户讨论:Qige96|初稿在这里]]）&lt;br /&gt;
* 已有网络模体及其函数表示 --周佳欣&lt;br /&gt;
* 活动模体+批判   --- 孙宇&lt;br /&gt;
* 代码实现&lt;br /&gt;
&lt;br /&gt;
大家可以在对应感兴趣的部分下面，写上姓名。我们的协作方式是石墨文档上翻译，最后再编辑成文。&lt;br /&gt;
对应的词条链接：https://en.wikipedia.org/wiki/Network_motif#Well-established_motifs_and_their_functions&lt;br /&gt;
&lt;br /&gt;
截止时间：今晚12：00&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
All networks, including [[biological network]]s, social networks, technological networks (e.g., computer networks and electrical circuits) and more, can be represented as [[complex network|graphs]], which include a wide variety of subgraphs. One important local property of networks are so-called '''network motifs''', which are defined as recurrent and [[statistically significant]] sub-graphs or patterns.&lt;br /&gt;
&lt;br /&gt;
所有网络，包括生物网络(biological networks)、社会网络(social networks)、技术网络（例如计算机网络和电路）等，都可以用图的形式来表示，这些图中会包括各种各样的子图(subgraphs)。网络的一个重要的局部性质是所谓的网络基序，即重复且具有统计意义的子图或模式(patterns)。&lt;br /&gt;
&lt;br /&gt;
Network motifs are sub-graphs that repeat themselves in a specific network or even among various networks. Each of these sub-graphs, defined by a particular pattern of interactions between vertices, may reflect a framework in which particular functions are achieved efficiently. Indeed, motifs are of notable importance largely because they may reflect functional properties. They have recently gathered much attention as a useful concept to uncover structural design principles of complex networks.&amp;lt;ref name=&amp;quot;mas1&amp;quot;&amp;gt;{{cite journal |vauthors=Masoudi-Nejad A, Schreiber F, Razaghi MK Z |title=Building Blocks of Biological Networks: A Review on Major Network Motif Discovery Algorithms |journal=IET Systems Biology |volume=6 |issue=5 |pages=164–74 |year=2012|doi=10.1049/iet-syb.2011.0011 |pmid=23101871 }}&amp;lt;/ref&amp;gt; Although network motifs may provide a deep insight into the network's functional abilities, their detection is computationally challenging.&lt;br /&gt;
网络模体(Network motifs)是指在特定网络或各种网络中重复出现的相同的子图。这些子图由顶点之间特定的交互模式定义，一个子图便可以反映一个框架，这个框架可以有效地实现某个特定的功能。事实上，之所以说模体是一个重要的特性，正是因为它们可能反映出对应网络功能的这一性质。近年来这一概念作为揭示复杂网络结构设计原理的一个有用概念而受到了广泛的关注。&amp;lt;ref name=&amp;quot;mas1&amp;quot;&amp;gt;{{cite journal |vauthors=Masoudi-Nejad A, Schreiber F, Razaghi MK Z |title=Building Blocks of Biological Networks: A Review on Major Network Motif Discovery Algorithms |journal=IET Systems Biology |volume=6 |issue=5 |pages=164–74 |year=2012|doi=10.1049/iet-syb.2011.0011 |pmid=23101871 }}&amp;lt;/ref&amp;gt; 但是，虽然通过研究网络模体可以深入了解网络的功能，但是对于模体的检测在计算上是具有挑战性的。&lt;br /&gt;
&lt;br /&gt;
==Definition==&lt;br /&gt;
Let {{math|G {{=}} (V, E)}} and {{math|G&amp;amp;prime; {{=}} (V&amp;amp;prime;, E&amp;amp;prime;)}} be two graphs. Graph {{math|G&amp;amp;prime;}} is a ''sub-graph'' of graph {{math|G}} (written as {{math|G&amp;amp;prime; ⊆ G}}) if {{math|V&amp;amp;prime; ⊆ V}} and {{math|E&amp;amp;prime; ⊆ E ∩ (V&amp;amp;prime; &amp;amp;times; V&amp;amp;prime;)}}. If {{math|G&amp;amp;prime; ⊆ G}} and {{math|G&amp;amp;prime;}} contains all of the edges  {{math|&amp;amp;lang;u, v&amp;amp;rang; ∈ E}} with {{math|u, v ∈ V&amp;amp;prime;}}, then {{math|G&amp;amp;prime;}} is an ''induced sub-graph'' of {{math|G}}. We call {{math|G&amp;amp;prime;}} and {{math|G}} isomorphic (written as {{math|G&amp;amp;prime; ↔ G}}), if there exists a bijection (one-to-one) {{math|f:V&amp;amp;prime; → V}} with  {{math|&amp;amp;lang;u, v&amp;amp;rang; ∈ E&amp;amp;prime; ⇔ &amp;amp;lang;f(u), f(v)&amp;amp;rang; ∈ E}} for all {{math|u, v ∈ V&amp;amp;prime;}}. The mapping {{math|f}} is called an isomorphism between {{math|G}} and {{math|G&amp;amp;prime;}}.&amp;lt;ref name=&amp;quot;die1&amp;quot;&amp;gt;{{cite journal |author=Diestel R |title=Graph Theory (Graduate Texts in Mathematics) |volume=173 |year=2005|publisher=New York: Springer-Verlag Heidelberg}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
设{{math|G {{=}} (V, E)}} 和 {{math|G&amp;amp;prime; {{=}} (V&amp;amp;prime;, E&amp;amp;prime;)}} 是两个图。若{{math|V&amp;amp;prime; ⊆ V}}且满足{{math|E&amp;amp;prime; ⊆ E ∩ (V&amp;amp;prime; &amp;amp;times; V&amp;amp;prime;)}}）（即图{{math|G&amp;amp;prime; ⊆ G}的所有边和点都属于图{{math|G}}）则称图{{math|G&amp;amp;prime; ⊆ G}是图{{math|G}}的一个子图&amp;lt;ref name=&amp;quot;die1&amp;quot;&amp;gt;{{cite journal |author=Diestel R |title=Graph Theory (Graduate Texts in Mathematics) |volume=173 |year=2005|publisher=New York: Springer-Verlag Heidelberg}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
若{{math|G&amp;amp;prime; ⊆ G}}，且对于顶点{{math|u}}、{{math|v}}及其连边，只要{{math|u}}和{{math|v}}存在于{{math|G&amp;amp;prime;}}（即若{{math|U}}, {{math|V&amp;amp;prime; ⊆ V}}），那么{{math|G&amp;amp;prime; ⊆ G}}中就应该包含原图{{math|G}}中的所有{{math|u}}和{{math|V}}的对应连边（即{{math|&amp;amp;lang;u, v&amp;amp;rang; ∈ E}}），则称此时图{{math|G&amp;amp;prime;}}就是图{{math|G}}的导出子图。&lt;br /&gt;
&lt;br /&gt;
如果存在一个双射（一对一）{{math|f:V&amp;amp;prime; → V}}，且对所有{{math|u, v ∈ V&amp;amp;prime;}}都有{{math|&amp;amp;lang;u, v&amp;amp;rang; ∈ E&amp;amp;prime; ⇔ &amp;amp;lang;f(u), f(v)&amp;amp;rang; ∈ E}} ，则称{{math|G&amp;amp;prime }}是{{math|G}}的同构图（记作：{{math|G&amp;amp;prime; → G}}），映射f则称为{{math|G}}与{{math|G&amp;amp;prime;}}之间的同构（isomorphism）。[2]&lt;br /&gt;
&lt;br /&gt;
When {{math|G&amp;amp;Prime; ⊂ G}} and there exists an isomorphism between the sub-graph {{math|G&amp;amp;Prime;}} and a graph {{math|G&amp;amp;prime;}}, this mapping represents an ''appearance'' of {{math|G&amp;amp;prime;}} in {{math|G}}. The number of appearances of graph {{math|G&amp;amp;prime;}} in {{math|G}}  is called the frequency {{math|F&amp;lt;sub&amp;gt;G&amp;lt;/sub&amp;gt;}} of {{math|G&amp;amp;prime;}} in {{math|G}}. A graph is called ''recurrent'' (or ''frequent'') in {{math|G}}, when its ''frequency'' {{math|F&amp;lt;sub&amp;gt;G&amp;lt;/sub&amp;gt;(G&amp;amp;prime;)}} is above a predefined threshold or cut-off value. We use terms ''pattern'' and ''frequent sub-graph'' in this review interchangeably. There is an [[Statistical ensemble (mathematical physics)|ensemble]] {{math|Ω(G)}} of random graphs corresponding to the [[Null model|null-model]] associated to {{math|G}}. We should choose {{math|N}} random graphs uniformly from {{math|Ω(G)}}  and calculate the frequency for a particular frequent sub-graph {{math|G&amp;amp;prime;}} in {{math|G}}. If the frequency of {{math|G&amp;amp;prime;}} in {{math|G}} is higher than its arithmetic mean frequency in {{math|N}} random graphs {{math|R&amp;lt;sub&amp;gt;i&amp;lt;/sub&amp;gt;}}, where {{math|1 ≤ i ≤ N}}, we call this recurrent pattern ''significant'' and hence treat {{math|G&amp;amp;prime;}} as a ''network motif'' for {{math|G}}. For a small graph {{math|G&amp;amp;prime;}}, the network {{math|G}} and a set of randomized networks {{math|R(G) ⊆ Ω(R)}}, where {{math|1=R(G) {{=}} N}}, the ''Z-Score'' that has been defined by the following formula:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;Z(G^\prime) = \frac{F_G(G^\prime) - \mu_R(G^\prime)}{\sigma_R(G^\prime)}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
当{{math|G&amp;amp;Prime; ⊂ G}}，且{{math|G&amp;amp;Prime;}}与图{{math|G&amp;amp;prime;}}之间存在同构时，该映射表示{{math|G&amp;amp;prime;}}对于{{math|G}}存在。图{{math|G&amp;amp;prime;}}在{{math|G}}的出现次数称为{{math|G&amp;amp;prime;}}出现在{{math|G}}的频率{{math|F&amp;lt;sub&amp;gt;G&amp;lt;/sub&amp;gt;}}。当一个子图的频率{{math|F&amp;lt;sub&amp;gt;G&amp;lt;/sub&amp;gt;}}高于预定的阈值或截止值时，则称{{math|G&amp;amp;prime;}}是{{math|G}}中的递归（或频繁）子图。&lt;br /&gt;
&lt;br /&gt;
在接下来的内容中，我们交替使用术语“模式（motifs）”和“频繁子图（frequent sub-graph）”。&lt;br /&gt;
&lt;br /&gt;
设从与{{math|G}}相关联的零模型（the null-model）获得的随机图集合为{{math|Ω(G)}}，我们从{{math|Ω(G)}}中均匀地选择N个随机图，并计算其特定频繁子图的频率。如果{{math|G&amp;amp;prime;}}出现在{{math|G}}的频率高于N个随机图Ri的算术平均频率，其中{{math|1 ≤ i ≤ N}}，我们称此递归模式是有意义的，因此可以将{{math|G&amp;amp;prime;}}视为{{math|G}}的网络模体。&lt;br /&gt;
&lt;br /&gt;
对于一个小图{{math|G&amp;amp;prime;}}，网络{{math|G}}和一组随机网络{{math|R(G) ⊆ Ω(R)}}，当{{math|1=R(G) {{=}} N}}时，由其Z分数（Z-score）的定义如下式：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;Z(G^\prime) = \frac{F_G(G^\prime) - \mu_R(G^\prime)}{\sigma_R(G^\prime)}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where {{math|μ&amp;lt;sub&amp;gt;R&amp;lt;/sub&amp;gt;(G&amp;amp;prime;)}} and {{math|σ&amp;lt;sub&amp;gt;R&amp;lt;/sub&amp;gt;(G&amp;amp;prime;)}} stand for mean and standard deviation frequency in set {{math|R(G)}}, respectively.&amp;lt;ref name=&amp;quot;mil1&amp;quot;&amp;gt;{{cite journal |vauthors=Milo R, Shen-Orr SS, Itzkovitz S, Kashtan N, Chklovskii D, Alon U |title=Network motifs: simple building blocks of complex networks |volume=298 |year=2002|journal=Science|issue=5594|pages=824–827 |doi=10.1126/science.298.5594.824 |pmid=12399590|bibcode=2002Sci...298..824M |citeseerx=10.1.1.225.8750 }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;alb1&amp;quot;&amp;gt;{{cite journal |vauthors=Albert R, Barabási AL |title=Statistical mechanics of complex networks |journal=Reviews of Modern Physics |volume=74 |issue=1 |year=2002 |pages=47–49 |doi=10.1103/RevModPhys.74.47 |bibcode=2002RvMP...74...47A|arxiv=cond-mat/0106096 |citeseerx=10.1.1.242.4753 }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;mil2&amp;quot;&amp;gt;{{cite journal |vauthors=Milo R, Itzkovitz S, Kashtan N, Levitt R, Shen-Orr S, Ayzenshtat I, Sheffer M, Alon U |title=Superfamilies of designed and evolved networks |journal=Science |volume=303 |issue=5663 |year=2004 |pages=1538–1542 |pmid=15001784 |doi=10.1126/science.1089167 |bibcode=2004Sci...303.1538M |url=https://semanticscholar.org/paper/87ad24efd5329046d37cd704f970323e878710ca }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;sch1&amp;quot;&amp;gt;{{cite encyclopedia|last=Schwöbbermeyer |first=H |title=Network Motifs |encyclopedia=Analysis of Biological Networks |editor=Junker BH, Schreiber F |publisher=Hoboken, New Jersey: John Wiley &amp;amp; Sons |year=2008 |pages=85–108}}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;bor1&amp;quot;&amp;gt;{{cite encyclopedia |last1=Bornholdt |first1=S |last2=Schuster |first2=HG |title=Handbook of graphs and networks : from the genome to the Internet |journal=Handbook of Graphs and Networks: From the Genome to the Internet |pages=417 |year=2003|bibcode=2003hgnf.book.....B }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;cir1&amp;quot;&amp;gt;{{cite journal |vauthors=Ciriello G, Guerra C |title=A review on models and algorithms for motif discovery in protein-protein interaction networks |journal=Briefings in Functional Genomics and Proteomics |year=2008 |volume=7 |issue=2 |pages=147–156 |doi=10.1093/bfgp/eln015|pmid=18443014 |doi-access=free }}&amp;lt;/ref&amp;gt; The larger the {{math|Z(G&amp;amp;prime;)}}, the more significant is the sub-graph {{math|G&amp;amp;prime;}} as a motif. Alternatively, another measurement in statistical hypothesis testing that can be considered in motif detection is the P-Value, given as the probability of  {{math|F&amp;lt;sub&amp;gt;R&amp;lt;/sub&amp;gt;(G&amp;amp;prime;) ≥ F&amp;lt;sub&amp;gt;G&amp;lt;/sub&amp;gt;(G&amp;amp;prime;)}} (as its null-hypothesis), where  {{math|F&amp;lt;sub&amp;gt;R&amp;lt;/sub&amp;gt;(G&amp;amp;prime;)}} indicates the frequency of G' in a randomized network.&amp;lt;ref name=&amp;quot;sch1&amp;quot; /&amp;gt; A sub-graph with P-value less than a threshold (commonly 0.01 or 0.05) will be treated as a significant pattern.  The P-value is defined as&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;P(G^\prime) = \frac{1}{N}\sum_{i=1}^N \delta(c(i)) ; c(i): F_R^i(G^\prime) \ge F_G(G^\prime)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
式中，{{math|μ&amp;lt;sub&amp;gt;R&amp;lt;/sub&amp;gt;(G&amp;amp;prime;)}} 和 {{math|σ&amp;lt;sub&amp;gt;R&amp;lt;/sub&amp;gt;(G&amp;amp;prime;)}}分别代表集合{{math|R(G)}}中的平均和标准偏差频率。.&amp;lt;ref name=&amp;quot;mil1&amp;quot;&amp;gt;{{cite journal |vauthors=Milo R, Shen-Orr SS, Itzkovitz S, Kashtan N, Chklovskii D, Alon U |title=Network motifs: simple building blocks of complex networks |volume=298 |year=2002|journal=Science|issue=5594|pages=824–827 |doi=10.1126/science.298.5594.824 |pmid=12399590|bibcode=2002Sci...298..824M |citeseerx=10.1.1.225.8750 }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;alb1&amp;quot;&amp;gt;{{cite journal |vauthors=Albert R, Barabási AL |title=Statistical mechanics of complex networks |journal=Reviews of Modern Physics |volume=74 |issue=1 |year=2002 |pages=47–49 |doi=10.1103/RevModPhys.74.47 |bibcode=2002RvMP...74...47A|arxiv=cond-mat/0106096 |citeseerx=10.1.1.242.4753 }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;mil2&amp;quot;&amp;gt;{{cite journal |vauthors=Milo R, Itzkovitz S, Kashtan N, Levitt R, Shen-Orr S, Ayzenshtat I, Sheffer M, Alon U |title=Superfamilies of designed and evolved networks |journal=Science |volume=303 |issue=5663 |year=2004 |pages=1538–1542 |pmid=15001784 |doi=10.1126/science.1089167 |bibcode=2004Sci...303.1538M |url=https://semanticscholar.org/paper/87ad24efd5329046d37cd704f970323e878710ca }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;sch1&amp;quot;&amp;gt;{{cite encyclopedia|last=Schwöbbermeyer |first=H |title=Network Motifs |encyclopedia=Analysis of Biological Networks |editor=Junker BH, Schreiber F |publisher=Hoboken, New Jersey: John Wiley &amp;amp; Sons |year=2008 |pages=85–108}}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;bor1&amp;quot;&amp;gt;{{cite encyclopedia |last1=Bornholdt |first1=S |last2=Schuster |first2=HG |title=Handbook of graphs and networks : from the genome to the Internet |journal=Handbook of Graphs and Networks: From the Genome to the Internet |pages=417 |year=2003|bibcode=2003hgnf.book.....B }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;cir1&amp;quot;&amp;gt;{{cite journal |vauthors=Ciriello G, Guerra C |title=A review on models and algorithms for motif discovery in protein-protein interaction networks |journal=Briefings in Functional Genomics and Proteomics |year=2008 |volume=7 |issue=2 |pages=147–156 |doi=10.1093/bfgp/eln015|pmid=18443014 |doi-access=free }}&amp;lt;/ref&amp;gt; {{math|Z(G&amp;amp;prime;)}}越大，子图{{math|G&amp;amp;prime;}}作为模体的意义也就越大。&lt;br /&gt;
&lt;br /&gt;
此外还可以使用统计假设检验中的另一个测量方法，可以作为模体检测中的一种方法，即P值（P-value），以 {{math|F&amp;lt;sub&amp;gt;R&amp;lt;/sub&amp;gt;(G&amp;amp;prime;) ≥ F&amp;lt;sub&amp;gt;G&amp;lt;/sub&amp;gt;(G&amp;amp;prime;)}}的概率给出（作为其零假设null-hypothesis），其中{{math|F&amp;lt;sub&amp;gt;R&amp;lt;/sub&amp;gt;(G&amp;amp;prime;)}}表示随机网络中{{math|G&amp;amp;prime;}}的频率。&amp;lt;ref name=&amp;quot;sch1&amp;quot; /&amp;gt; 当P值小于阈值（通常为0.01或0.05）时，该子图可以被称为显著模式。该P值定义为：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;P(G^\prime) = \frac{1}{N}\sum_{i=1}^N \delta(c(i)) ; c(i): F_R^i(G^\prime) \ge F_G(G^\prime)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[File:Different occurrences of a sub-graph in a graph.jpg|thumb|''Different occurrences of a sub-graph in a graph''. (M1 – M4) are different occurrences of sub-graph (b) in graph (a). For frequency concept {{math|F&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;}}, the set M1, M2, M3, M4 represent all matches, so {{math|F&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt; {{=}} 4}}. For {{math|F&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;}}, one of the two set M1, M4 or M2, M3 are possible matches, {{math|F&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt; {{=}} 2}}. Finally, for frequency concept {{math|F&amp;lt;sub&amp;gt;3&amp;lt;/sub&amp;gt;}}, merely one of the matches (M1 to M4) is allowed, therefore {{math|F&amp;lt;sub&amp;gt;3&amp;lt;/sub&amp;gt; {{=}} 1}}. The frequency of these three frequency concepts decrease as the usage of network elements are restricted.]]&lt;br /&gt;
&lt;br /&gt;
Where {{math|N}} indicates number of randomized networks, {{math|i}} is defined over an ensemble of randomized networks and the Kronecker delta function {{math|δ(c(i))}} is one if the condition {{math|c(i)}} holds. The concentration &amp;lt;ref name=&amp;quot;kas1&amp;quot;&amp;gt;{{cite journal |vauthors=Kashtan N, Itzkovitz S, Milo R, Alon U |title=Efficient sampling algorithm for estimating sub-graph concentrations and detecting network motifs |journal=Bioinformatics  |year=2004 |volume=20 |issue=11 |pages=1746–1758 |doi=10.1093/bioinformatics/bth163|pmid=15001476 |doi-access=free }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;wer1&amp;quot;&amp;gt;{{cite journal |author=Wernicke S |title=Efficient detection of network motifs |journal=IEEE/ACM Transactions on Computational Biology and Bioinformatics  |year=2006 |volume=3 |issue=4 |pages=347–359 |doi=10.1109/tcbb.2006.51|pmid=17085844 |citeseerx=10.1.1.304.2576 }}&amp;lt;/ref&amp;gt; of a particular n-size sub-graph {{math|G&amp;amp;prime;}} in network {{math|G}} refers to the ratio of the sub-graph appearance in the network to the total ''n''-size non-isomorphic sub-graphs’ frequencies, which is formulated by&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;C_G(G^\prime) = \frac{F_G(G^\prime)}{\sum_i F_G(G_i)}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where index {{math|i}} is defined over the set of all non-isomorphic n-size graphs. Another statistical measurement is defined for evaluating network motifs, but it is rarely used in known algorithms. This measurement is introduced by Picard ''et al.'' in 2008 and used the Poisson distribution, rather than the Gaussian normal distribution that is implicitly being used above.&amp;lt;ref name=&amp;quot;pic1&amp;quot;&amp;gt;{{cite journal |vauthors=Picard F, Daudin JJ, Schbath S, Robin S |title=Assessing the Exceptionality of Network Motifs |journal=J. Comp. Bio. |year=2005 |volume=15 |issue=1 |pages=1–20|doi=10.1089/cmb.2007.0137 |pmid=18257674 |citeseerx=10.1.1.475.4300 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
其中索引 i 定义在所有非同构 n 大小图的集合上。 另一种统计测量是用来评估网络主题的，但在已知的算法中很少使用。 这种测量方法是由 Picard 等人在2008年提出的，使用的是泊松分佈分布，而不是上面隐含使用的高斯正态分布。&amp;lt;ref name=&amp;quot;pic1&amp;quot;&amp;gt;{{cite journal |vauthors=Picard F, Daudin JJ, Schbath S, Robin S |title=Assessing the Exceptionality of Network Motifs |journal=J. Comp. Bio. |year=2005 |volume=15 |issue=1 |pages=1–20|doi=10.1089/cmb.2007.0137 |pmid=18257674 |citeseerx=10.1.1.475.4300 }}&amp;lt;/ref&amp;gt;其中{{math|N}}表示随机网络的数目，{{math|i}}定义在随机网络的集合上，若条件{{math|c(i)}}成立，则Kroneckerδ函数{{math|δ(c(i))}}是1。在网络{{math|G}}中，一个特定的n维子图{{math|N&amp;amp;prime;}}的集中度是指子图在网络中出现频率与n维非同构子图的总频率之比，其计算公式如下：&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;C_G(G^\prime) = \frac{F_G(G^\prime)}{\sum_i F_G(G_i)}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In addition, three specific concepts of sub-graph frequency have been proposed.&amp;lt;ref name=&amp;quot;schr1&amp;quot;&amp;gt;{{cite book |vauthors=Schreiber F, Schwöbbermeyer H |title=Frequency concepts and pattern detection for the analysis of motifs in networks |journal=Transactions on Computational Systems Biology III |volume=3737 |year=2005 |pages=89–104|doi=10.1007/11599128_7 |citeseerx=10.1.1.73.1130 |series=Lecture Notes in Computer Science |isbn=978-3-540-30883-6 }}&amp;lt;/ref&amp;gt; As the figure illustrates, the first frequency concept {{math|F&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;}} considers all matches of a graph in original network. This definition is similar to what we have introduced above. The second concept {{math|F&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;}} is defined as the maximum number of edge-disjoint instances of a given graph in original network. And finally, the frequency concept {{math|F&amp;lt;sub&amp;gt;3&amp;lt;/sub&amp;gt;}} entails matches with disjoint edges and nodes. Therefore, the two concepts {{math|F&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;}} and {{math|F&amp;lt;sub&amp;gt;3&amp;lt;/sub&amp;gt;}} restrict the usage of elements of the graph, and as can be inferred, the frequency of a sub-graph declines by imposing restrictions on network element usage. As a result, a network motif detection algorithm would pass over more candidate sub-graphs if we insist on frequency concepts {{math|F&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;}} and {{math|F&amp;lt;sub&amp;gt;3&amp;lt;/sub&amp;gt;}}.&lt;br /&gt;
&lt;br /&gt;
此外，他们还提出了子图频率的三个具体概念。&amp;lt;ref name=&amp;quot;schr1&amp;quot;&amp;gt;{{cite book |vauthors=Schreiber F, Schwöbbermeyer H |title=Frequency concepts and pattern detection for the analysis of motifs in networks |journal=Transactions on Computational Systems Biology III |volume=3737 |year=2005 |pages=89–104|doi=10.1007/11599128_7 |citeseerx=10.1.1.73.1130 |series=Lecture Notes in Computer Science |isbn=978-3-540-30883-6 }}&amp;lt;/ref&amp;gt; 如图所示，第一频率概念 {{math|F&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;}}考虑原始网络中图的所有匹配，这与我们前面介绍过的类似。第二个概念{{math|F&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;}}定义为原始网络中给定图的最大不相交边的数量。最后，频率概念{{math|F&amp;lt;sub&amp;gt;3&amp;lt;/sub&amp;gt;}}包含与不相交边（disjoint edges）和节点的匹配。因此，两个概念F2和F3限制了图元素的使用，并且可以看出，通过对网络元素的使用施加限制，子图的频率下降。因此，如果我们坚持使用频率概念{{math|F&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;}}和{{math|F&amp;lt;sub&amp;gt;3&amp;lt;/sub&amp;gt;}}，网络模体检测算法将可以筛选出更多的候选子图。&lt;br /&gt;
&lt;br /&gt;
==History==&lt;br /&gt;
The study of network motifs was pioneered by Holland and Leinhardt&amp;lt;ref&amp;gt;Holland, P. W., &amp;amp; Leinhardt, S. (1974). The statistical analysis of local structure in social networks. Working Paper No. 44, National Bureau of Economic Research.&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;Hollandi, P., &amp;amp; Leinhardt, S. (1975). The Statistical Analysis of Local. Structure in Social Networks. Sociological Methodology, David Heise, ed. San Francisco: Josey-Bass.&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt; Holland, P. W., &amp;amp; Leinhardt, S. (1976). Local structure in social networks. Sociological methodology, 7, 1-45.&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;Holland, P. W., &amp;amp; Leinhardt, S. (1977). A method for detecting structure in sociometric data. In Social Networks (pp. 411-432). Academic Press.&amp;lt;/ref&amp;gt; who introduced the concept of a triad census of networks. They introduced methods to enumerate various types of subgraph configurations, and test whether the subgraph counts are statistically different from those expected in random networks. &lt;br /&gt;
霍兰（Holland）和莱因哈特（Leinhardt）率先提出了'''网络三合会普查'''（a triad census of networks）的概念，开创了网络模体研究的先河。&amp;lt;ref&amp;gt;Holland, P. W., &amp;amp; Leinhardt, S. (1974). The statistical analysis of local structure in social networks. Working Paper No. 44, National Bureau of Economic Research.&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;Hollandi, P., &amp;amp; Leinhardt, S. (1975). The Statistical Analysis of Local. Structure in Social Networks. Sociological Methodology, David Heise, ed. San Francisco: Josey-Bass.&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt; Holland, P. W., &amp;amp; Leinhardt, S. (1976). Local structure in social networks. Sociological methodology, 7, 1-45.&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;Holland, P. W., &amp;amp; Leinhardt, S. (1977). A method for detecting structure in sociometric data. In Social Networks (pp. 411-432). Academic Press.&amp;lt;/ref&amp;gt; 他们介绍了枚举各种子图配置的方法，并测试子图计数是否与随机网络中的期望值存在统计学上的差异。&lt;br /&gt;
&lt;br /&gt;
 这里对于'''网络三合会普查'''（a triad census of networks）这一概念的翻译存疑&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This idea was further generalized in 2002 by [[Uri Alon]] and his group &amp;lt;ref name=&amp;quot;she1&amp;quot;&amp;gt;{{cite journal |vauthors=Shen-Orr SS, Milo R, Mangan S, Alon U |title=Network motifs in the transcriptional regulation network of ''Escherichia coli'' |journal=Nat. Genet. |volume=31 |issue=1 |pages=64–8 |date=May 2002 |pmid=11967538 |doi=10.1038/ng881}}&amp;lt;/ref&amp;gt; when network motifs were discovered in the gene regulation (transcription) network of the bacteria ''[[Escherichia coli|E. coli]]'' and then in a large set of natural networks. Since then, a considerable number of studies have been conducted on the subject. Some of these studies focus on the biological applications, while others focus on the computational theory of network motifs.&lt;br /&gt;
&lt;br /&gt;
2002年，Uri Alon和他的团队[17]在大肠杆菌的基因调控（gene regulation network）（转录 transcription）网络中发现了网络模体，随后在大量的自然网络中也发现了网络模体，从而进一步推广了这一观点。自那时起，许多科学家都对这一问题进行了大量的研究。其中一些研究集中在生物学应用上，而另一些则集中在网络模体的计算理论上。&amp;lt;ref name=&amp;quot;she1&amp;quot;&amp;gt;{{cite journal |vauthors=Shen-Orr SS, Milo R, Mangan S, Alon U |title=Network motifs in the transcriptional regulation network of ''Escherichia coli'' |journal=Nat. Genet. |volume=31 |issue=1 |pages=64–8 |date=May 2002 |pmid=11967538 |doi=10.1038/ng881}}&amp;lt;/ref&amp;gt; &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The biological studies endeavor to interpret the motifs detected for biological networks. For example, in work following,&amp;lt;ref name=&amp;quot;she1&amp;quot; /&amp;gt; the network motifs found in ''[[Escherichia coli|E. coli]]'' were discovered in the transcription networks of other bacteria&amp;lt;ref name=&amp;quot;eic1&amp;quot;&amp;gt;{{cite journal  |vauthors=Eichenberger P, Fujita M, Jensen ST, etal |title=The program of gene transcription for a single differentiating cell type during sporulation in ''Bacillus subtilis'' |journal=PLOS Biology |volume=2 |issue=10 |pages=e328 |date=October 2004 |pmid=15383836 |pmc=517825 |doi=10.1371/journal.pbio.0020328 }} {{open access}}&amp;lt;/ref&amp;gt; as well as yeast&amp;lt;ref name=&amp;quot;mil3&amp;quot;&amp;gt;{{cite journal |vauthors=Milo R, Shen-Orr S, Itzkovitz S, Kashtan N, Chklovskii D, Alon U |title=Network motifs: simple building blocks of complex networks |journal=Science |volume=298 |issue=5594 |pages=824–7 |date=October 2002 |doi=10.1126/science.298.5594.824 |pmid=12399590|bibcode=2002Sci...298..824M |citeseerx=10.1.1.225.8750 }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;lee1&amp;quot;&amp;gt;{{cite journal  |vauthors=Lee TI, Rinaldi NJ, Robert F, etal |title=Transcriptional regulatory networks in Saccharomyces cerevisiae |journal=Science |volume=298 |issue=5594 |pages=799–804 |date=October 2002 |pmid=12399584 |doi=10.1126/science.1075090 |bibcode=2002Sci...298..799L }}&amp;lt;/ref&amp;gt; and higher organisms.&amp;lt;ref name=&amp;quot;odo1&amp;quot;&amp;gt;{{cite journal  |vauthors=Odom DT, Zizlsperger N, Gordon DB, etal |title=Control of pancreas and liver gene expression by HNF transcription factors |journal=Science |volume=303 |issue=5662 |pages=1378–81 |date=February 2004 |pmid=14988562 |pmc=3012624 |doi=10.1126/science.1089769 |bibcode=2004Sci...303.1378O }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;boy1&amp;quot;&amp;gt;{{cite journal  |vauthors=Boyer LA, Lee TI, Cole MF, etal |title=Core transcriptional regulatory circuitry in human embryonic stem cells |journal=Cell |volume=122 |issue=6 |pages=947–56 |date=September 2005 |pmid=16153702 |pmc=3006442 |doi=10.1016/j.cell.2005.08.020 }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;ira1&amp;quot;&amp;gt;{{cite journal |vauthors=Iranfar N, Fuller D, Loomis WF |title=Transcriptional regulation of post-aggregation genes in Dictyostelium by a feed-forward loop involving GBF and LagC |journal=Dev. Biol. |volume=290 |issue=2 |pages=460–9 |date=February 2006 |pmid=16386729 |doi=10.1016/j.ydbio.2005.11.035 |doi-access=free }}&amp;lt;/ref&amp;gt; A distinct set of network motifs were identified in other types of biological networks such as neuronal networks and protein interaction networks.&amp;lt;ref name=&amp;quot;mil2&amp;quot; /&amp;gt;&amp;lt;ref name=&amp;quot;maa1&amp;quot;&amp;gt;{{cite journal  |vauthors=Ma'ayan A, Jenkins SL, Neves S, etal |title=Formation of regulatory patterns during signal propagation in a Mammalian cellular network |journal=Science |volume=309 |issue=5737 |pages=1078–83 |date=August 2005 |pmid=16099987 |pmc=3032439 |doi=10.1126/science.1108876 |bibcode=2005Sci...309.1078M }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;pta1&amp;quot;&amp;gt;{{cite journal  |vauthors=Ptacek J, Devgan G, Michaud G, etal |title=Global analysis of protein phosphorylation in yeast |journal=Nature |volume=438 |issue=7068 |pages=679–84 |date=December 2005 |pmid=16319894 |doi=10.1038/nature04187|bibcode=2005Natur.438..679P |url=https://authors.library.caltech.edu/56271/2/Tables.pdf |type=Submitted manuscript }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
生物学研究试图解释为生物网络检测到的模体。例如，在接下来的工作中，文献[17]在大肠杆菌中发现的网络模体存在于其他细菌&amp;lt;ref name=&amp;quot;eic1&amp;quot;&amp;gt;{{cite journal  |vauthors=Eichenberger P, Fujita M, Jensen ST, etal |title=The program of gene transcription for a single differentiating cell type during sporulation in ''Bacillus subtilis'' |journal=PLOS Biology |volume=2 |issue=10 |pages=e328 |date=October 2004 |pmid=15383836 |pmc=517825 |doi=10.1371/journal.pbio.0020328 }} {{open access}}&amp;lt;/ref&amp;gt;以及酵母&amp;lt;ref name=&amp;quot;mil3&amp;quot;&amp;gt;{{cite journal |vauthors=Milo R, Shen-Orr S, Itzkovitz S, Kashtan N, Chklovskii D, Alon U |title=Network motifs: simple building blocks of complex networks |journal=Science |volume=298 |issue=5594 |pages=824–7 |date=October 2002 |doi=10.1126/science.298.5594.824 |pmid=12399590|bibcode=2002Sci...298..824M |citeseerx=10.1.1.225.8750 }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;lee1&amp;quot;&amp;gt;{{cite journal  |vauthors=Lee TI, Rinaldi NJ, Robert F, etal |title=Transcriptional regulatory networks in Saccharomyces cerevisiae |journal=Science |volume=298 |issue=5594 |pages=799–804 |date=October 2002 |pmid=12399584 |doi=10.1126/science.1075090 |bibcode=2002Sci...298..799L }}&amp;lt;/ref&amp;gt;和高等生物的转录网络中。文献&amp;lt;ref name=&amp;quot;odo1&amp;quot;&amp;gt;{{cite journal  |vauthors=Odom DT, Zizlsperger N, Gordon DB, etal |title=Control of pancreas and liver gene expression by HNF transcription factors |journal=Science |volume=303 |issue=5662 |pages=1378–81 |date=February 2004 |pmid=14988562 |pmc=3012624 |doi=10.1126/science.1089769 |bibcode=2004Sci...303.1378O }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;boy1&amp;quot;&amp;gt;{{cite journal  |vauthors=Boyer LA, Lee TI, Cole MF, etal |title=Core transcriptional regulatory circuitry in human embryonic stem cells |journal=Cell |volume=122 |issue=6 |pages=947–56 |date=September 2005 |pmid=16153702 |pmc=3006442 |doi=10.1016/j.cell.2005.08.020 }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;ira1&amp;quot;&amp;gt;{{cite journal |vauthors=Iranfar N, Fuller D, Loomis WF |title=Transcriptional regulation of post-aggregation genes in Dictyostelium by a feed-forward loop involving GBF and LagC |journal=Dev. Biol. |volume=290 |issue=2 |pages=460–9 |date=February 2006 |pmid=16386729 |doi=10.1016/j.ydbio.2005.11.035 |doi-access=free }}&amp;lt;/ref&amp;gt;在其他类型的生物网络中发现了一组不同的网络模体，如神经元网络和蛋白质相互作用网络。&amp;lt;ref name=&amp;quot;mil2&amp;quot; /&amp;gt;&amp;lt;ref name=&amp;quot;maa1&amp;quot;&amp;gt;{{cite journal  |vauthors=Ma'ayan A, Jenkins SL, Neves S, etal |title=Formation of regulatory patterns during signal propagation in a Mammalian cellular network |journal=Science |volume=309 |issue=5737 |pages=1078–83 |date=August 2005 |pmid=16099987 |pmc=3032439 |doi=10.1126/science.1108876 |bibcode=2005Sci...309.1078M }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;pta1&amp;quot;&amp;gt;{{cite journal  |vauthors=Ptacek J, Devgan G, Michaud G, etal |title=Global analysis of protein phosphorylation in yeast |journal=Nature |volume=438 |issue=7068 |pages=679–84 |date=December 2005 |pmid=16319894 |doi=10.1038/nature04187|bibcode=2005Natur.438..679P |url=https://authors.library.caltech.edu/56271/2/Tables.pdf |type=Submitted manuscript }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The computational research has focused on improving existing motif detection tools to assist the biological investigations and allow larger networks to be analyzed. Several different algorithms have been provided so far, which are elaborated in the next section in chronological order.&lt;br /&gt;
&lt;br /&gt;
另一方面，对于计算研究的重点则是改进现有的模体检测工具，以协助生物学研究，并允许对更大的网络进行分析。到目前为止，已经提供了几种不同的算法，这些算法将在下一节按时间顺序进行阐述。&lt;br /&gt;
&lt;br /&gt;
Most recently, the acc-MOTIF tool to detect network motifs was released.&amp;lt;ref&amp;gt;{{Cite web | url=http://www.ft.unicamp.br/docentes/meira/accmotifs/ |title = Acc-Motif: Accelerated Motif Detection}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
最近，还发布了用于检测网络基序的acc基序工具。&amp;lt;ref&amp;gt;{{Cite web | url=http://www.ft.unicamp.br/docentes/meira/accmotifs/ |title = Acc-Motif: Accelerated Motif Detection}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==模体发现算法 Motif discovery algorithms==&lt;br /&gt;
&lt;br /&gt;
Various solutions have been proposed for the challenging problem of motif discovery. These algorithms can be classified under various paradigms such as exact counting methods, sampling methods, pattern growth methods and so on. However, motif discovery problem comprises two main steps: first, calculating the number of occurrences of a sub-graph and then, evaluating the sub-graph significance. The recurrence is significant if it is detectably far more than expected. Roughly speaking, the expected number of appearances of a sub-graph can be determined by a Null-model, which is defined by an ensemble of random networks with some of the same properties as the original network.&lt;br /&gt;
&lt;br /&gt;
针对模体发现这一问题存在多种解决方案。这些算法可以归纳为不同的范式：例如精确计数方法，采样方法，模式增长方法等。但模体发现问题包括两个主要步骤：首先，计算子图的出现次数，然后评估子图的重要性。如果检测到的重现性远超过预期，那么这种重现性是很显著的。粗略地讲，子图的预期出现次数可以由'''零模型 Null-model''' 确定，该模型定义为具有与原始网络某些属性相同的随机网络的集合。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Here, a review on computational aspects of major algorithms is given and their related benefits and drawbacks from an algorithmic perspective are discussed.&lt;br /&gt;
&lt;br /&gt;
接下来，对下列算法的计算原理进行简要回顾，并从算法的角度讨论了它们的优缺点。&lt;br /&gt;
&lt;br /&gt;
===mfinder 算法===&lt;br /&gt;
&lt;br /&gt;
''mfinder'', the first motif-mining tool, implements two kinds of motif finding algorithms: a full enumeration and a sampling method. Until 2004, the only exact counting method for NM (network motif) detection was the brute-force one proposed by Milo ''et al.''.&amp;lt;ref name=&amp;quot;mil1&amp;quot; /&amp;gt; This algorithm was successful for discovering small motifs, but using this method for finding even size 5 or 6 motifs was not computationally feasible. Hence, a new approach to this problem was needed.&lt;br /&gt;
&lt;br /&gt;
'''mfinder'''是第一个模体挖掘工具，它主要有两种模体查找算法：完全枚举 full enumeration 和采样方法 sampling method。直到2004年，用于NM（'''网络模体 networkmotif'''）检测的唯一精确计数方法是'''Milo'''等人提出的暴力穷举方法。&amp;lt;ref name=&amp;quot;mil1&amp;quot; /&amp;gt;该算法成功地发现了小规模的模体，但是这种方法甚至对于发现规模为5个或6个的模体在计算上都不可行的。因此，需要一种解决该问题的新方法。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Kashtan ''et al.'' &amp;lt;ref name=&amp;quot;kas1&amp;quot; /&amp;gt; presented the first sampling NM discovery algorithm, which was based on ''edge sampling'' throughout the network. This algorithm estimates concentrations of induced sub-graphs and can be utilized for motif discovery in directed or undirected networks. The sampling procedure of the algorithm starts from an arbitrary edge of the network that leads to a sub-graph of size two, and then expands the sub-graph by choosing a random edge that is incident to the current sub-graph. After that, it continues choosing random neighboring edges until a sub-graph of size n is obtained. Finally, the sampled sub-graph is expanded to include all of the edges that exist in the network between these n nodes. When an algorithm uses a sampling approach, taking unbiased samples is the most important issue that the algorithm might address. The sampling procedure, however, does not take samples uniformly and therefore Kashtan ''et al.'' proposed a weighting scheme that assigns different weights to the different sub-graphs within network.&amp;lt;ref name=&amp;quot;kas1&amp;quot; /&amp;gt; The underlying principle of weight allocation is exploiting the information of the [[sampling probability]] for each sub-graph, i.e. the probable sub-graphs will obtain comparatively less weights in comparison to the improbable sub-graphs; hence, the algorithm must calculate the sampling probability of each sub-graph that has been sampled. This weighting technique assists ''mfinder'' to determine sub-graph concentrations impartially.&lt;br /&gt;
&lt;br /&gt;
'''Kashtan''' 等人&amp;lt;ref name=&amp;quot;kas1&amp;quot; /&amp;gt;首次提出了一种基于边缘采样的网络模体（NM）采样发现算法。该算法估计了&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;所含子图 induced sub-graphs 的集中度 concentrations &amp;lt;/font&amp;gt;，可用于有向或无向网络中的模体发现。该算法的采样过程从网络的任意一条边开始，该边连向大小为2的子图，然后选择一条与当前子图相关的随机边对子图进行扩展。之后，它将继续选择随机的相邻边，直到获得大小为n的子图为止。最后，采样得到的子图扩展为包括这n个节点在内的网络中存在的所有边。当使用采样方法时，获取无偏样本是这类算法可能面临的最重要问题。而且，采样过程并不能保证采到所有的样本（也就是不能保证得到所有的子图，译者注），因此，Kashtan 等人又提出了一种加权方案，为网络中的不同子图分配不同的权重。&amp;lt;ref name=&amp;quot;kas1&amp;quot; /&amp;gt; 权重分配的基本原理是利用每个子图的抽样概率信息，即，与不可能的子图相比，可能的子图将获得相对较少的权重；因此，该算法必须计算已采样的每个子图的采样概率。这种加权技术有助于mfinder公正地确定子图的&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;集中度 concentrations &amp;lt;/font&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In expanded to include sharp contrast to exhaustive search, the computational time of the algorithm surprisingly is asymptotically independent of the network size. An analysis of the computational time of the algorithm has shown that it takes {{math|O(n&amp;lt;sup&amp;gt;n&amp;lt;/sup&amp;gt;)}} for each sample of a sub-graph of size {{math|n}} from the network. On the other hand, there is no analysis in &amp;lt;ref name=&amp;quot;kas1&amp;quot; /&amp;gt; on the classification time of sampled sub-graphs that requires solving the ''graph isomorphism'' problem for each sub-graph sample. Additionally, an extra computational effort is imposed on the algorithm by the sub-graph weight calculation. But it is unavoidable to say that the algorithm may sample the same sub-graph multiple times – spending time without gathering any information.&amp;lt;ref name=&amp;quot;wer1&amp;quot; /&amp;gt; In conclusion, by taking the advantages of sampling, the algorithm performs more efficiently than an exhaustive search algorithm; however, it only determines sub-graphs concentrations approximately.  This algorithm can find motifs up to size 6 because of its main implementation, and as result it gives the most significant motif, not all the others too. Also, it is necessary to mention that this tool has no option of visual presentation. The sampling algorithm is shown briefly:&lt;br /&gt;
&lt;br /&gt;
与穷举搜索形成鲜明对比的是，该算法的计算时间竟然与网络大小渐近无关。对算法时间复杂度的分析表明，对于网络中大小为n的子图的每个样本，它的时间复杂度为&amp;lt;math&amp;gt;O(n^n)&amp;lt;/math&amp;gt;。另一方面，&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;并没有对已采样子图的每一个子图样本判断图同构问题的分类时间进行分析&amp;lt;/font&amp;gt;&amp;lt;ref name=&amp;quot;kas1&amp;quot; /&amp;gt;。另外，子图权重计算将额外增加该算法的计算负担。但是不得不指出的是，该算法可能会多次采样相同的子图——花费时间而不收集任何有用信息。&amp;lt;ref name=&amp;quot;wer1&amp;quot; /&amp;gt;总之，通过利用采样的优势，该算法的性能比穷举搜索算法更有效；但是，它只能大致确定子图的&amp;lt;font color=&amp;quot;red&amp;quot;&amp;gt;集中度 concentrations &amp;lt;/font&amp;gt;。由于该算法的实现方式，使得它可以找到最大为6的模体，并且它会给出的最重要的模体，而不是其他所有模体。另外，有必要提到此工具没有可视化的呈现。采样算法简要显示如下：&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! mfinder&lt;br /&gt;
|-&lt;br /&gt;
| '''Definitions:''' {{math|E&amp;lt;sub&amp;gt;s&amp;lt;/sub&amp;gt;}}is the set of picked edges. {{math|V&amp;lt;sub&amp;gt;s&amp;lt;/sub&amp;gt;}} is the set of all nodes that are touched by the edges in {{math|E}}.&lt;br /&gt;
|-&lt;br /&gt;
| Init {{math|V&amp;lt;sub&amp;gt;s&amp;lt;/sub&amp;gt;}} and {{math|E&amp;lt;sub&amp;gt;s&amp;lt;/sub&amp;gt;}} to be empty sets.&lt;br /&gt;
1. Pick a random edge {{math|e&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt; {{=}} (v&amp;lt;sub&amp;gt;i&amp;lt;/sub&amp;gt;, v&amp;lt;sub&amp;gt;j&amp;lt;/sub&amp;gt;)}}. Update {{math|E&amp;lt;sub&amp;gt;s&amp;lt;/sub&amp;gt; {{=}} {e&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;}}}, {{math|V&amp;lt;sub&amp;gt;s&amp;lt;/sub&amp;gt; {{=}} {v&amp;lt;sub&amp;gt;i&amp;lt;/sub&amp;gt;, v&amp;lt;sub&amp;gt;j&amp;lt;/sub&amp;gt;}}}&lt;br /&gt;
&lt;br /&gt;
2. Make a list {{math|L}} of all neighbor edges of {{math|E&amp;lt;sub&amp;gt;s&amp;lt;/sub&amp;gt;}}. Omit from {{math|L}} all edges between members of {{math|V&amp;lt;sub&amp;gt;s&amp;lt;/sub&amp;gt;}}.&lt;br /&gt;
&lt;br /&gt;
3. Pick a random edge {{math|e {{=}} {v&amp;lt;sub&amp;gt;k&amp;lt;/sub&amp;gt;,v&amp;lt;sub&amp;gt;l&amp;lt;/sub&amp;gt;}}} from {{math|L}}. Update {{math|E&amp;lt;sub&amp;gt;s&amp;lt;/sub&amp;gt; {{=}} E&amp;lt;sub&amp;gt;s&amp;lt;/sub&amp;gt; ⋃ {e}}}, {{math|V&amp;lt;sub&amp;gt;s&amp;lt;/sub&amp;gt; {{=}} V&amp;lt;sub&amp;gt;s&amp;lt;/sub&amp;gt; ⋃ {v&amp;lt;sub&amp;gt;k&amp;lt;/sub&amp;gt;, v&amp;lt;sub&amp;gt;l&amp;lt;/sub&amp;gt;}}}.&lt;br /&gt;
&lt;br /&gt;
4. Repeat steps 2-3 until completing an ''n''-node subgraph (until {{math|{{!}}V&amp;lt;sub&amp;gt;s&amp;lt;/sub&amp;gt;{{!}} {{=}} n}}).&lt;br /&gt;
&lt;br /&gt;
5. Calculate the probability to sample the picked ''n''-node subgraph.&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+ mfinder&lt;br /&gt;
|-&lt;br /&gt;
!rowspan=&amp;quot;1&amp;quot;|定义：&amp;lt;math&amp;gt;E_{s}&amp;lt;/math&amp;gt;是采集的边集合。&amp;lt;math&amp;gt;V_{s}&amp;lt;/math&amp;gt;是&amp;lt;math&amp;gt;E&amp;lt;/math&amp;gt;中所有边的顶点的集合。&lt;br /&gt;
|-&lt;br /&gt;
|rowspan=&amp;quot;5&amp;quot;|初始化&amp;lt;math&amp;gt;V_{s}&amp;lt;/math&amp;gt;和&amp;lt;math&amp;gt;E_{s}&amp;lt;/math&amp;gt;为空集。&amp;lt;br&amp;gt;&lt;br /&gt;
1. 随机选择一条边&amp;lt;math&amp;gt; e_{1} = (v_{i}, v_{j}) &amp;lt;/math&amp;gt;，更新 &amp;lt;math&amp;gt;E_{s} = \{e_{1}\}, V{s} = \{v_{i}, v_{j}\}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
2. 列出&amp;lt;math&amp;gt;E{s}&amp;lt;/math&amp;gt;的所有邻边列表&amp;lt;math&amp;gt; L &amp;lt;/math&amp;gt;，从&amp;lt;math&amp;gt; L &amp;lt;/math&amp;gt;中删除&amp;lt;math&amp;gt;V{s}&amp;lt;/math&amp;gt;中所有元素组成的边。&lt;br /&gt;
&lt;br /&gt;
3. 从&amp;lt;math&amp;gt; L &amp;lt;/math&amp;gt;中随机选择一条边&amp;lt;math&amp;gt; e = \{v_{k},v_{l}\} &amp;lt;/math&amp;gt;， 更新&amp;lt;math&amp;gt;E_{s} = E_{s} \cup  \{e\} , V_{s} = V_{s} \cup  \{v_{k}, v_{l}\}&amp;lt;/math&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
4. 重复步骤2-3，直到完成包含n个节点的子图 (&amp;lt;math&amp;gt;\left | V_{s} \right | = n&amp;lt;/math&amp;gt;)。&lt;br /&gt;
&lt;br /&gt;
5. 计算对选取的n节点子图进行采样的概率。&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===FPF (Mavisto)算法===&lt;br /&gt;
&lt;br /&gt;
Schreiber and Schwöbbermeyer &amp;lt;ref name=&amp;quot;schr1&amp;quot; /&amp;gt; proposed an algorithm named ''flexible pattern finder (FPF)'' for extracting frequent sub-graphs of an input network and implemented it in a system named ''Mavisto''.&amp;lt;ref name=&amp;quot;schr2&amp;quot;&amp;gt;{{cite journal |vauthors=Schreiber F, Schwobbermeyer H |title=MAVisto: a tool for the exploration of network motifs |journal=Bioinformatics |volume=21 |issue=17|pages=3572–3574 |year=2005 |doi=10.1093/bioinformatics/bti556|pmid=16020473 |doi-access=free }}&amp;lt;/ref&amp;gt; Their algorithm exploits the ''downward closure'' property which is applicable for frequency concepts {{math|F&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;}} and {{math|F&amp;lt;sub&amp;gt;3&amp;lt;/sub&amp;gt;}}. The downward closure property asserts that the frequency for sub-graphs decrease monotonically by increasing the size of sub-graphs; however, this property does not hold necessarily for frequency concept {{math|F&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;}}. FPF is based on a ''pattern tree'' (see figure) consisting of nodes that represents different graphs (or patterns), where the parent of each node is a sub-graph of its children nodes; in other words, the corresponding graph of each pattern tree's node is expanded by adding a new edge to the graph of its parent node.&lt;br /&gt;
&lt;br /&gt;
Schreiber和Schwöbbermeyer &amp;lt;ref name=&amp;quot;schr1&amp;quot; /&amp;gt;提出了一种称为灵活模式查找器（FPF）的算法，用于提取输入网络的频繁子图，并将其在名为Mavisto的系统中加以实现。&amp;lt;ref name=&amp;quot;schr2&amp;quot;&amp;gt;{{cite journal |vauthors=Schreiber F, Schwobbermeyer H |title=MAVisto: a tool for the exploration of network motifs |journal=Bioinformatics |volume=21 |issue=17|pages=3572–3574 |year=2005 |doi=10.1093/bioinformatics/bti556|pmid=16020473 |doi-access=free }}&amp;lt;/ref&amp;gt; 他们的算法利用了向下闭包特性，该特性适用于频率概念&amp;lt;math&amp;gt;F_{2}&amp;lt;/math&amp;gt;和&amp;lt;math&amp;gt;F_{3}&amp;lt;/math&amp;gt;。向下闭包性质表明，子图的频率随着子图的大小而单调下降；但这一性质并不一定适用于频率概念&amp;lt;math&amp;gt;F_{1}&amp;lt;/math&amp;gt;。FPF算法基于模式树（见右图），由代表不同图形（或模式）的节点组成，其中每个节点的父节点是其子节点的子图；换句话说，每个模式树节点的对应图通过向其父节点图添加新边来扩展。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Image:The pattern tree in FPF algorithm.jpg|right|thumb|''FPF算法中的模式树展示''.&amp;lt;ref name=&amp;quot;schr1&amp;quot; /&amp;gt;]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
At first, the FPF algorithm enumerates and maintains the information of all matches of a sub-graph located at the root of the pattern tree. Then, one-by-one it builds child nodes of the previous node in the pattern tree by adding one edge supported by a matching edge in the target graph, and tries to expand all of the previous information about matches to the new sub-graph (child node). In next step, it decides whether the frequency of the current pattern is lower than a predefined threshold or not. If it is lower and if downward closure holds, FPF can abandon that path and not traverse further in this part of the tree; as a result, unnecessary computation is avoided. This procedure is continued until there is no remaining path to traverse.&lt;br /&gt;
&lt;br /&gt;
首先，FPF算法枚举并维护位于模式树根部的子图的所有匹配信息。然后，它通过在目标图中添加匹配边缘支持的一条边缘，在模式树中一一建立前一节点的子节点，然后通过在目标图中添加匹配边支持的一条边，逐个构建模式树中前一个节点的子节点，并尝试将以前关于匹配的所有信息拓展到新的子图(子节点)中。下一步，它判断当前模式的频率是否低于预定义的阈值。如果它低于阈值且保持向下闭包，则FPF算法会放弃该路径，而不会在树的此部分进一步遍历；这样就避免了不必要的计算。重复此过程，直到没有剩余可遍历的路径为止。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The advantage of the algorithm is that it does not consider infrequent sub-graphs and tries to finish the enumeration process as soon as possible; therefore, it only spends time for promising nodes in the pattern tree and discards all other nodes. As an added bonus, the pattern tree notion permits FPF to be implemented and executed in a parallel manner since it is possible to traverse each path of the pattern tree independently. However, FPF is most useful for frequency concepts {{math|F&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;}} and {{math|F&amp;lt;sub&amp;gt;3&amp;lt;/sub&amp;gt;}}, because downward closure is not applicable to {{math|F&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;}}. Nevertheless, the pattern tree is still practical for {{math|F&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;}} if the algorithm runs in parallel. Another advantage of the algorithm is that the implementation of this algorithm has no limitation on motif size, which makes it more amenable to improvements. The pseudocode of FPF (Mavisto) is shown below:&lt;br /&gt;
&lt;br /&gt;
该算法的优点是它不会考虑不频繁的子图，并尝试尽快完成枚举过程；因此，它只花时间在模式树中用于有希望的节点上，而放弃所有其他节点。还有一点额外的好处，模式树概念允许 FPF 以并行方式实现和执行，因为它可以独立地遍历模式树的每个路径。但是，FPF对于频率概念&amp;lt;math&amp;gt;F_{2}&amp;lt;/math&amp;gt;和&amp;lt;math&amp;gt;F_{3}&amp;lt;/math&amp;gt;最为有用，因为向下闭包不适用于&amp;lt;math&amp;gt;F_{1}&amp;lt;/math&amp;gt;。尽管如此，如果算法并行运行，那么模式树对于&amp;lt;math&amp;gt;F_{1}&amp;lt;/math&amp;gt;仍然是可行的。该算法的另一个优点是它的实现对模体大小没有限制，这使其更易于改进。FPF（Mavisto）的伪代码如下所示：&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Mavisto&lt;br /&gt;
|-&lt;br /&gt;
| '''Data:''' Graph {{math|G}}, target pattern size {{math|t}}, frequency concept {{math|F}}&lt;br /&gt;
&lt;br /&gt;
'''Result:''' Set {{math|R}} of patterns of size {{math|t}} with maximum frequency.&lt;br /&gt;
|-&lt;br /&gt;
| {{math|R ← φ}}, {{math|f&amp;lt;sub&amp;gt;max&amp;lt;/sub&amp;gt; ← 0}}&lt;br /&gt;
&lt;br /&gt;
{{math|P ←}}start pattern {{math|p1}} of size 1&lt;br /&gt;
&lt;br /&gt;
{{math|M&amp;lt;sub&amp;gt;p&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;&amp;lt;/sub&amp;gt; ←}}all matches of {{math|p&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;}} in {{math|G}}&lt;br /&gt;
&lt;br /&gt;
'''While''' {{math|P &amp;amp;ne; φ}} '''do'''&lt;br /&gt;
&lt;br /&gt;
{{pad|1em}}{{math|P&amp;lt;sub&amp;gt;max&amp;lt;/sub&amp;gt; ←}}select all patterns from {{math|P}} with maximum size.&lt;br /&gt;
&lt;br /&gt;
{{pad|1em}}{{math|P ←}} select pattern with maximum frequency from {{math|P&amp;lt;sub&amp;gt;max&amp;lt;/sub&amp;gt;}}&lt;br /&gt;
&lt;br /&gt;
{{pad|1em}}{{math|Ε {{=}} ''ExtensionLoop''(G, p, M&amp;lt;sub&amp;gt;p&amp;lt;/sub&amp;gt;)}}&lt;br /&gt;
&lt;br /&gt;
{{pad|1em}}'''Foreach''' pattern {{math|p &amp;amp;isin; E}}&lt;br /&gt;
&lt;br /&gt;
{{pad|2em}}'''If''' {{math|F {{=}} F&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;}} '''then''' {{math|f ← ''size''(M&amp;lt;sub&amp;gt;p&amp;lt;/sub&amp;gt;)}}&lt;br /&gt;
&lt;br /&gt;
{{pad|2em}}'''Else''' {{math|f ←}} ''Maximum Independent set''{{math|(F, M&amp;lt;sub&amp;gt;p&amp;lt;/sub&amp;gt;)}}&lt;br /&gt;
&lt;br /&gt;
{{pad|2em}}'''End'''&lt;br /&gt;
&lt;br /&gt;
{{pad|2em}}'''If''' {{math|''size''(p) {{=}} t}} '''then'''&lt;br /&gt;
&lt;br /&gt;
{{pad|3em}}'''If''' {{math|f {{=}} f&amp;lt;sub&amp;gt;max&amp;lt;/sub&amp;gt;}} '''then'''  {{math|R ← R ⋃ {p}}}&lt;br /&gt;
&lt;br /&gt;
{{pad|3em}}'''Else if''' {{math|f &amp;gt; f&amp;lt;sub&amp;gt;max&amp;lt;/sub&amp;gt;}} '''then''' {{math|R ← {p}}};  {{math|f&amp;lt;sub&amp;gt;max&amp;lt;/sub&amp;gt; ← f}}&lt;br /&gt;
&lt;br /&gt;
{{pad|3em}}'''End'''&lt;br /&gt;
&lt;br /&gt;
{{pad|2em}}'''Else'''&lt;br /&gt;
&lt;br /&gt;
{{pad|3em}}'''If''' {{math|F {{=}} F&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;}} '''or''' {{math|f &amp;amp;ge; f&amp;lt;sub&amp;gt;max&amp;lt;/sub&amp;gt;}} '''then'''  {{math|P ← P ⋃ {p}}}&lt;br /&gt;
&lt;br /&gt;
{{pad|3em}}'''End'''&lt;br /&gt;
&lt;br /&gt;
{{pad|2em}}'''End'''&lt;br /&gt;
&lt;br /&gt;
{{pad|1em}}'''End'''&lt;br /&gt;
&lt;br /&gt;
'''End'''&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+ Mavisto&lt;br /&gt;
|-&lt;br /&gt;
!rowspan=&amp;quot;1&amp;quot;|数据: 图 &amp;lt;math&amp;gt;G&amp;lt;/math&amp;gt;, 目标模式规模 &amp;lt;math&amp;gt;t&amp;lt;/math&amp;gt;, 频率概念 &amp;lt;math&amp;gt;F&amp;lt;/math&amp;gt;。&amp;lt;br&amp;gt;&lt;br /&gt;
结果: 以最大频率设置大小为 &amp;lt;math&amp;gt;t&amp;lt;/math&amp;gt;的模式 &amp;lt;math&amp;gt;R&amp;lt;/math&amp;gt;.&amp;lt;br&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|rowspan=&amp;quot;20&amp;quot;| &amp;lt;math&amp;gt;R \leftarrow \Phi , f_{max}\leftarrow 0&amp;lt;/math&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;P \leftarrow&amp;lt;/math&amp;gt; 开始于大小为1的模式 &amp;lt;math&amp;gt;p_{1}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;M_{p_{1}} \leftarrow &amp;lt;/math&amp;gt; 图 &amp;lt;math&amp;gt;G&amp;lt;/math&amp;gt; 中模式 &amp;lt;math&amp;gt;p_{1}&amp;lt;/math&amp;gt; 的所有匹配&lt;br /&gt;
&lt;br /&gt;
当 &amp;lt;math&amp;gt;P \neq \Phi &amp;lt;/math&amp;gt; 时，执行：&lt;br /&gt;
&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;lt;math&amp;gt;P_{max} \leftarrow&amp;lt;/math&amp;gt; 从 &amp;lt;math&amp;gt;P&amp;lt;/math&amp;gt; 中选择最大规模的所有模式&lt;br /&gt;
&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;lt;math&amp;gt;P\leftarrow&amp;lt;/math&amp;gt; 从 &amp;lt;math&amp;gt;P_{max}&amp;lt;/math&amp;gt; 中选择最大频率的模式&lt;br /&gt;
&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;lt;math&amp;gt;E = ExtensionLoop(G, p, M_{p})&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;对于 &amp;lt;math&amp;gt;p \in E &amp;lt;/math&amp;gt; 的所有模式：&lt;br /&gt;
&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;如果 &amp;lt;math&amp;gt;F = F_{1}&amp;lt;/math&amp;gt; ，那么 &amp;lt;math&amp;gt;f \leftarrow size(M_{p})&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;其他&amp;lt;math&amp;gt;f \leftarrow&amp;lt;/math&amp;gt; 最大独立集 &amp;lt;math&amp;gt;(F, M_{p})&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;结束&lt;br /&gt;
&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;如果 &amp;lt;math&amp;gt;size(p) = t&amp;lt;/math&amp;gt; ，那么&lt;br /&gt;
&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;如果 &amp;lt;math&amp;gt;f = f_{max}&amp;lt;/math&amp;gt; ，那么 &amp;lt;math&amp;gt;R \leftarrow R \cup \{p\}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;其他 如果 &amp;lt;math&amp;gt;f &amp;gt; f_{max}&amp;lt;/math&amp;gt; ，那么 &amp;lt;math&amp;gt;R \leftarrow \{p\}&amp;lt;/math&amp;gt;； &amp;lt;math&amp;gt;f_{max} \leftarrow f&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;结束&lt;br /&gt;
&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;其他&lt;br /&gt;
&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;如果 &amp;lt;math&amp;gt;F = F_{1} or f \geq  f_{max}&amp;lt;/math&amp;gt; ，那么 &amp;lt;math&amp;gt; P \leftarrow P \cup \{p\}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;结束&lt;br /&gt;
&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;结束&lt;br /&gt;
&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;结束&lt;br /&gt;
&lt;br /&gt;
结束&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
===ESU (FANMOD)===&lt;br /&gt;
The sampling bias of Kashtan ''et al.'' &amp;lt;ref name=&amp;quot;kas1&amp;quot; /&amp;gt; provided great impetus for designing better algorithms for the NM discovery problem. Although Kashtan ''et al.'' tried to settle this drawback by means of a weighting scheme, this method imposed an undesired overhead on the running time as well a more complicated implementation. This tool is one of the most useful ones, as it supports visual options and also is an efficient algorithm with respect to time. But, it has a limitation on motif size as it does not allow searching for motifs of size 9 or higher because of the way the tool is implemented.&lt;br /&gt;
&lt;br /&gt;
Wernicke &amp;lt;ref name=&amp;quot;wer1&amp;quot; /&amp;gt; introduced an algorithm named ''RAND-ESU'' that provides a significant improvement over ''mfinder''.&amp;lt;ref name=&amp;quot;kas1&amp;quot; /&amp;gt; This algorithm, which is based on the exact enumeration algorithm ''ESU'', has been implemented as an application called ''FANMOD''.&amp;lt;ref name=&amp;quot;wer1&amp;quot; /&amp;gt; ''RAND-ESU'' is a NM discovery algorithm applicable for both directed and undirected networks, effectively exploits an unbiased node sampling throughout the network, and prevents overcounting sub-graphs more than once. Furthermore, ''RAND-ESU'' uses a novel analytical approach called ''DIRECT'' for determining sub-graph significance instead of using an ensemble of random networks as a Null-model. The ''DIRECT'' method estimates the sub-graph concentration without explicitly generating random networks.&amp;lt;ref name=&amp;quot;wer1&amp;quot; /&amp;gt; Empirically, the DIRECT method is more efficient in comparison with the random network ensemble in case of sub-graphs with a very low concentration; however, the classical Null-model is faster than the ''DIRECT'' method for highly concentrated sub-graphs.&amp;lt;ref name=&amp;quot;mil1&amp;quot; /&amp;gt;&amp;lt;ref name=&amp;quot;wer1&amp;quot; /&amp;gt; In the following, we detail the ''ESU'' algorithm and then we show how this exact algorithm can be modified efficiently to ''RAND-ESU'' that estimates sub-graphs concentrations.&lt;br /&gt;
&lt;br /&gt;
The algorithms ''ESU'' and ''RAND-ESU'' are fairly simple, and hence easy to implement. ''ESU'' first finds the set of all induced sub-graphs of size {{math|k}}, let {{math|S&amp;lt;sub&amp;gt;k&amp;lt;/sub&amp;gt;}} be this set. ''ESU'' can be implemented as a recursive function; the running of this function can be displayed as a tree-like structure of depth {{math|k}}, called the ESU-Tree (see figure). Each of the ESU-Tree nodes indicate the status of the recursive function that entails two consecutive sets SUB and EXT. SUB refers to nodes in the target network that are adjacent and establish a partial sub-graph of size {{math|{{!}}SUB{{!}} ≤ k}}. If {{math|{{!}}SUB{{!}} {{=}} k}}, the algorithm has found an induced complete sub-graph, so {{math|S&amp;lt;sub&amp;gt;k&amp;lt;/sub&amp;gt; {{=}} SUB ∪ S&amp;lt;sub&amp;gt;k&amp;lt;/sub&amp;gt;}}. However, if  {{math|{{!}}SUB{{!}} &amp;lt; k}}, the algorithm must expand SUB to achieve cardinality {{math|k}}. This is done by the EXT set that contains all the nodes that satisfy two conditions: First, each of the nodes in EXT must be adjacent to at least one of the nodes in SUB; second, their numerical labels must be larger than the label of first element in SUB. The first condition makes sure that the expansion of SUB nodes yields a connected graph and the second condition causes ESU-Tree leaves (see figure) to be distinct; as a result, it prevents overcounting. Note that, the EXT set is not a static set, so in each step it may expand by some new nodes that do not breach the two conditions. The next step of ESU involves classification of sub-graphs placed in the ESU-Tree leaves into non-isomorphic size-{{math|k}} graph classes; consequently, ESU determines sub-graphs frequencies and concentrations. This stage has been implemented simply by employing McKay's ''nauty'' algorithm,&amp;lt;ref name=&amp;quot;mck1&amp;quot;&amp;gt;{{cite journal |author=McKay BD |title=Practical graph isomorphism |journal=Congressus Numerantium |year=1981 |volume=30 |pages=45–87|bibcode=2013arXiv1301.1493M |arxiv=1301.1493 }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;mck2&amp;quot;&amp;gt;{{cite journal |author=McKay BD |title=Isomorph-free exhaustive generation |journal=Journal of Algorithms |year=1998 |volume=26 |issue=2 |pages=306–324 |doi=10.1006/jagm.1997.0898}}&amp;lt;/ref&amp;gt; which classifies each sub-graph by performing a graph isomorphism test. Therefore, ESU finds the set of all induced {{math|k}}-size sub-graphs in a target graph by a recursive algorithm and then determines their frequency using an efficient tool.&lt;br /&gt;
&lt;br /&gt;
The procedure of implementing ''RAND-ESU'' is quite straightforward and is one of the main advantages of ''FANMOD''. One can change the ''ESU'' algorithm to explore just a portion of the ESU-Tree leaves by applying a probability value {{math|0 ≤ p&amp;lt;sub&amp;gt;d&amp;lt;/sub&amp;gt; ≤ 1}} for each level of the ESU-Tree and oblige ''ESU'' to traverse each child node of a node in level {{math|d-1}} with probability {{math|p&amp;lt;sub&amp;gt;d&amp;lt;/sub&amp;gt;}}. This new algorithm is called ''RAND-ESU''. Evidently, when {{math|p&amp;lt;sub&amp;gt;d&amp;lt;/sub&amp;gt; {{=}} 1}} for all levels, ''RAND-ESU'' acts like ''ESU''. For {{math|p&amp;lt;sub&amp;gt;d&amp;lt;/sub&amp;gt; {{=}} 0}} the algorithm finds nothing. Note that, this procedure ensures that the chances of visiting each leaf of the ESU-Tree are the same, resulting in ''unbiased'' sampling of sub-graphs through the network. The probability of visiting each leaf is {{math|∏&amp;lt;sub&amp;gt;d&amp;lt;/sub&amp;gt;p&amp;lt;sub&amp;gt;d&amp;lt;/sub&amp;gt;}} and this is identical for all of the ESU-Tree leaves; therefore, this method guarantees unbiased sampling of sub-graphs from the network. Nonetheless, determining the value of {{math|p&amp;lt;sub&amp;gt;d&amp;lt;/sub&amp;gt;}} for {{math|1 ≤ d ≤ k}} is another issue that must be determined manually by an expert to get precise results of sub-graph concentrations.&amp;lt;ref name=&amp;quot;cir1&amp;quot; /&amp;gt; While there is no lucid prescript for this matter, the Wernicke provides some general observations that may help in determining p_d values. In summary, ''RAND-ESU'' is a very fast algorithm for NM discovery in the case of induced sub-graphs supporting unbiased sampling method. Although, the main ''ESU'' algorithm and so the ''FANMOD'' tool is known for discovering induced sub-graphs, there is trivial modification to ''ESU'' which makes it possible for finding non-induced sub-graphs, too. The pseudo code of ''ESU (FANMOD)'' is shown below:&lt;br /&gt;
&lt;br /&gt;
[[File:ESU-Tree.jpg|thumb|(a) ''A target graph of size 5'', (b) ''the ESU-tree of depth k that is associated to the extraction of sub-graphs of size 3 in the target graph''. Leaves correspond to set S3 or all of the size-3 induced sub-graphs of the target graph (a). Nodes in the ESU-tree include two adjoining sets, the first set contains adjacent nodes called SUB and the second set named EXT holds all nodes that are adjacent to at least one of the SUB nodes and where their numerical labels are larger than the SUB nodes labels. The EXT set is utilized by the algorithm to expand a SUB set until it reaches a desired sub-graph size that are placed at the lowest level of ESU-Tree (or its leaves).]]&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Enumeration of ESU (FANMOD)&lt;br /&gt;
|-&lt;br /&gt;
|'''''EnumerateSubgraphs(G,k)'''''&lt;br /&gt;
&lt;br /&gt;
'''Input:''' A graph {{math|G {{=}} (V, E)}} and an integer {{math|1 ≤ k ≤ {{!}}V{{!}}}}.&lt;br /&gt;
&lt;br /&gt;
'''Output:''' All size-{{math|k}} subgraphs in {{math|G}}.&lt;br /&gt;
&lt;br /&gt;
'''for each''' vertex {{math|v ∈ V}} '''do'''&lt;br /&gt;
&lt;br /&gt;
{{pad|2em}}{{math|VExtension ← {u ∈ N({v}) {{!}} u &amp;gt; v}}}&lt;br /&gt;
&lt;br /&gt;
{{pad|2em}}'''call''' {{math|''ExtendSubgraph''({v}, VExtension, v)}}&lt;br /&gt;
&lt;br /&gt;
'''endfor'''&lt;br /&gt;
|-&lt;br /&gt;
|'''''ExtendSubgraph(VSubgraph, VExtension, v)'''''&lt;br /&gt;
&lt;br /&gt;
'''if''' {{math|{{!}}VSubgraph{{!}} {{=}} k}} '''then''' output {{math|G[VSubgraph]}} and '''return'''&lt;br /&gt;
&lt;br /&gt;
'''while''' {{math|VExtension ≠ ∅}} '''do'''&lt;br /&gt;
&lt;br /&gt;
{{pad|2em}}Remove an arbitrarily chosen vertex {{math|w}} from {{math|VExtension}}&lt;br /&gt;
&lt;br /&gt;
{{pad|2em}}{{math|VExtension&amp;amp;prime; ← VExtension ∪ {u ∈ N&amp;lt;sub&amp;gt;excl&amp;lt;/sub&amp;gt;(w, VSubgraph) {{!}} u &amp;gt; v}}}&lt;br /&gt;
&lt;br /&gt;
{{pad|2em}}'''call''' {{math|''ExtendSubgraph''(VSubgraph ∪ {w}, VExtension&amp;amp;prime;, v)}}&lt;br /&gt;
&lt;br /&gt;
'''return'''&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
===NeMoFinder===&lt;br /&gt;
Chen ''et al.'' &amp;lt;ref name=&amp;quot;che1&amp;quot;&amp;gt;{{cite conference |vauthors=Chen J, Hsu W, Li Lee M, etal |title=NeMoFinder: dissecting genome-wide protein-protein interactions with meso-scale network motifs |conference=the 12th ACM SIGKDD international conference on Knowledge discovery and data mining |year=2006 |location=Philadelphia, Pennsylvania, USA |pages=106–115}}&amp;lt;/ref&amp;gt; introduced a new NM discovery algorithm called ''NeMoFinder'', which adapts the idea in ''SPIN'' &amp;lt;ref name=&amp;quot;hua1&amp;quot;&amp;gt;{{cite conference |vauthors=Huan J, Wang W, Prins J, etal |title=SPIN: mining maximal frequent sub-graphs from graph databases |conference=the 10th ACM SIGKDD international conference on Knowledge discovery and data mining |year=2004 |pages=581–586}}&amp;lt;/ref&amp;gt; to extract frequent trees and after that expands them into non-isomorphic graphs.&amp;lt;ref name=&amp;quot;cir1&amp;quot; /&amp;gt; ''NeMoFinder'' utilizes frequent size-n trees to partition the input network into a collection of size-{{math|n}} graphs, afterward finding frequent size-n sub-graphs by expansion of frequent trees edge-by-edge until getting a complete size-{{math|n}} graph {{math|K&amp;lt;sub&amp;gt;n&amp;lt;/sub&amp;gt;}}. The algorithm finds NMs in undirected networks and is not limited to extracting only induced sub-graphs. Furthermore, ''NeMoFinder'' is an exact enumeration algorithm and is not based on a sampling method. As Chen ''et al.'' claim, ''NeMoFinder'' is applicable for detecting relatively large NMs, for instance, finding NMs up to size-12 from the whole ''S. cerevisiae'' (yeast) PPI network as the authors claimed.&amp;lt;ref name=&amp;quot;uet1&amp;quot;&amp;gt;{{cite journal |vauthors=Uetz P, Giot L, Cagney G, etal |title=A comprehensive analysis of protein-protein interactions in Saccharomyces cerevisiae |journal=Nature |year=2000 |volume=403 |issue=6770 |pages=623–627 |doi=10.1038/35001009 |pmid=10688190|bibcode=2000Natur.403..623U }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
''NeMoFinder'' consists of three main steps. First, finding frequent size-{{math|n}} trees, then utilizing repeated size-n trees to divide the entire network into a collection of size-{{math|n}} graphs, finally, performing sub-graph join operations to find frequent size-n sub-graphs.&amp;lt;ref name=&amp;quot;che1&amp;quot; /&amp;gt; In the first step, the algorithm detects all non-isomorphic size-{{math|n}} trees and mappings from a tree to the network. In the second step, the ranges of these mappings are employed to partition the network into size-n graphs. Up to this step, there is no distinction between ''NeMoFinder'' and an exact enumeration method. However, a large portion of non-isomorphic size-n graphs still remain. ''NeMoFinder'' exploits a heuristic to enumerate non-tree size-n graphs by the obtained information from the preceding steps. The main advantage of the algorithm is in the third step, which generates candidate sub-graphs from previously enumerated sub-graphs. This generation of new size-{{math|n}} sub-graphs is done by joining each previous sub-graph with derivative sub-graphs from itself called ''cousin sub-graphs''. These new sub-graphs contain one additional edge in comparison to the previous sub-graphs. However, there exist some problems in generating new sub-graphs: There is no clear method to derive cousins from a graph, joining a sub-graph with its cousins leads to redundancy in generating particular sub-graph more than once, and cousin determination is done by a canonical representation of the adjacency matrix which is not closed under join operation. ''NeMoFinder'' is an efficient network motif finding algorithm for motifs up to size 12 only for protein-protein interaction networks, which are presented as undirected graphs. And it is not able to work on directed networks which are so important in the field of complex and biological networks. The pseudocode of ''NeMoFinder'' is shown below:&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! NeMoFinder&lt;br /&gt;
|-&lt;br /&gt;
|'''Input:'''&lt;br /&gt;
&lt;br /&gt;
{{math|G}} - PPI network;&lt;br /&gt;
&lt;br /&gt;
{{math|N}} - Number of randomized networks;&lt;br /&gt;
&lt;br /&gt;
{{math|K}} - Maximal network motif size;&lt;br /&gt;
&lt;br /&gt;
{{math|F}} - Frequency threshold;&lt;br /&gt;
&lt;br /&gt;
{{math|S}} - Uniqueness threshold;&lt;br /&gt;
&lt;br /&gt;
'''Output:'''&lt;br /&gt;
&lt;br /&gt;
{{math|U}} - Repeated and unique network motif set;&lt;br /&gt;
&lt;br /&gt;
{{math|D ← ∅}};&lt;br /&gt;
&lt;br /&gt;
'''for''' motif-size {{math|k}} '''from''' 3 '''to''' {{math|K}} '''do'''&lt;br /&gt;
&lt;br /&gt;
{{pad|1em}}{{math|T ← ''FindRepeatedTrees''(k)}};&lt;br /&gt;
&lt;br /&gt;
{{pad|1em}}{{math|GD&amp;lt;sub&amp;gt;k&amp;lt;/sub&amp;gt; ← ''GraphPartition''(G, T)}}&lt;br /&gt;
&lt;br /&gt;
{{pad|1em}}{{math|D ← D ∪ T}};&lt;br /&gt;
&lt;br /&gt;
{{pad|1em}}{{math|D&amp;amp;prime; ← T}};&lt;br /&gt;
&lt;br /&gt;
{{pad|1em}}{{math|i ← k}};&lt;br /&gt;
&lt;br /&gt;
{{pad|1em}}'''while''' {{math|D&amp;amp;prime; ≠ ∅}} '''and''' {{math|i ≤ k &amp;amp;times; (k - 1) / 2}} '''do'''&lt;br /&gt;
&lt;br /&gt;
{{pad|2em}}{{math|D&amp;amp;prime; ← ''FindRepeatedGraphs''(k, i, D&amp;amp;prime;)}};&lt;br /&gt;
&lt;br /&gt;
{{pad|2em}}{{math|D ← D ∪ D&amp;amp;prime;}};&lt;br /&gt;
&lt;br /&gt;
{{pad|2em}}{{math|i ← i + 1}};&lt;br /&gt;
&lt;br /&gt;
{{pad|1em}}'''end while'''&lt;br /&gt;
&lt;br /&gt;
'''end for'''&lt;br /&gt;
&lt;br /&gt;
'''for''' counter {{math|i}} '''from''' 1 '''to''' {{math|N}} '''do'''&lt;br /&gt;
&lt;br /&gt;
{{pad|1em}}{{math|G&amp;lt;sub&amp;gt;rand&amp;lt;/sub&amp;gt; ← ''RandomizedNetworkGeneration''()}};&lt;br /&gt;
&lt;br /&gt;
{{pad|1em}}'''for each''' {{math|g ∈ D}} '''do'''&lt;br /&gt;
&lt;br /&gt;
{{pad|2em}}{{math|''GetRandFrequency''(g, G&amp;lt;sub&amp;gt;rand&amp;lt;/sub&amp;gt;)}};&lt;br /&gt;
&lt;br /&gt;
{{pad|1em}}'''end for'''&lt;br /&gt;
&lt;br /&gt;
'''end for'''&lt;br /&gt;
&lt;br /&gt;
{{math|U ← ∅}};&lt;br /&gt;
&lt;br /&gt;
'''for each''' {{math|g ∈ D}} '''do'''&lt;br /&gt;
&lt;br /&gt;
{{pad|1em}}{{math|s ← ''GetUniqunessValue''(g)}};&lt;br /&gt;
&lt;br /&gt;
{{pad|1em}}'''if''' {{math|s ≥ S}} '''then'''&lt;br /&gt;
&lt;br /&gt;
{{pad|2em}}{{math|U ← U ∪ {g}}};&lt;br /&gt;
&lt;br /&gt;
{{pad|1em}}'''end if'''&lt;br /&gt;
&lt;br /&gt;
'''end for'''&lt;br /&gt;
&lt;br /&gt;
'''return''' {{math|U}};&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
===Grochow–Kellis===&lt;br /&gt;
Grochow and Kellis &amp;lt;ref name=&amp;quot;gro1&amp;quot;&amp;gt;{{cite conference|vauthors=Grochow JA, Kellis M |title=Network Motif Discovery Using Sub-graph Enumeration and Symmetry-Breaking |conference=RECOMB |year=2007 |pages=92–106| doi=10.1007/978-3-540-71681-5_7| url=http://www.cs.colorado.edu/~jgrochow/Grochow_Kellis_RECOMB_07_Network_Motifs.pdf}}&amp;lt;/ref&amp;gt; proposed an ''exact'' algorithm for enumerating sub-graph appearances.   The algorithm is based on a ''motif-centric'' approach, which means that the frequency of a given sub-graph,called the ''query graph'', is exhaustively determined by searching for all possible mappings from the query graph into the larger network. It is claimed &amp;lt;ref name=&amp;quot;gro1&amp;quot; /&amp;gt; that a ''motif-centric'' method in comparison to ''network-centric'' methods has some beneficial features. First of all it avoids the increased complexity of sub-graph enumeration. Also, by using mapping instead of enumerating, it enables an improvement in the isomorphism test. To improve the performance of the algorithm, since it is an inefficient exact enumeration algorithm, the authors introduced a fast method which is called ''symmetry-breaking conditions''. During straightforward sub-graph isomorphism tests, a sub-graph may be mapped to the same sub-graph of the query graph multiple times. In the Grochow–Kellis (GK) algorithm symmetry-breaking is used to avoid such multiple mappings. Here we introduce the GK algorithm and the symmetry-breaking condition which eliminates redundant isomorphism tests.&lt;br /&gt;
&lt;br /&gt;
[[File:Automorphisms of a subgraph.jpg|thumb|(a) ''graph G'', (b) ''illustration of all automorphisms of G that is showed in (a)''. From set AutG we can obtain a set of symmetry-breaking conditions of G given by SymG in (c). Only the first mapping in AutG satisfies the SynG conditions; as a result, by applying SymG in the Isomorphism Extension module the algorithm only enumerate each match-able sub-graph in the network to G once. Note that SynG is not necessarily a unique set for an arbitrary graph G.]]&lt;br /&gt;
&lt;br /&gt;
The GK algorithm discovers the whole set of mappings of a given query graph to the network in two major steps. It starts with the computation of symmetry-breaking conditions of the query graph. Next, by means of a branch-and-bound method, the algorithm tries to find every possible mapping from the query graph to the network that meets the associated symmetry-breaking conditions. An example of the usage of symmetry-breaking conditions in GK algorithm is demonstrated in figure.&lt;br /&gt;
&lt;br /&gt;
As it is mentioned above, the symmetry-breaking technique is a simple mechanism that precludes spending time finding a sub-graph more than once due to its symmetries.&amp;lt;ref name=&amp;quot;gro1&amp;quot; /&amp;gt;&amp;lt;ref name=&amp;quot;gro2&amp;quot;&amp;gt;{{cite conference|author=Grochow JA |title=On the structure and evolution of protein interaction networks |conference=Thesis M. Eng., Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science|year=2006| url=http://www.cs.toronto.edu/~jgrochow/Grochow_MIT_Masters_06_PPI_Networks.pdf}}&amp;lt;/ref&amp;gt; Note that, computing symmetry-breaking conditions requires finding all automorphisms of a given query graph. Even though, there is no efficient (or polynomial time) algorithm for the graph automorphism problem, this problem can be tackled efficiently in practice by McKay's tools.&amp;lt;ref name=&amp;quot;mck1&amp;quot; /&amp;gt;&amp;lt;ref name=&amp;quot;mck2&amp;quot; /&amp;gt; As it is claimed, using symmetry-breaking conditions in NM detection lead to save a great deal of running time. Moreover, it can be inferred from the results in &amp;lt;ref name=&amp;quot;gro1&amp;quot; /&amp;gt;&amp;lt;ref name=&amp;quot;gro2&amp;quot; /&amp;gt; that using the symmetry-breaking conditions results in high efficiency particularly for directed networks in comparison to undirected networks.  The symmetry-breaking conditions used in the GK algorithm are similar to the restriction which ''ESU'' algorithm applies to the labels in EXT and SUB sets. In conclusion, the GK algorithm computes the exact number of appearance of a given query graph in a large complex network and exploiting symmetry-breaking conditions improves the algorithm performance. Also, GK algorithm is one of the known algorithms having no limitation for motif size in implementation and potentially it can find motifs of any size.&lt;br /&gt;
&lt;br /&gt;
===Color-coding approach===&lt;br /&gt;
Most algorithms in the field of NM discovery are used to find induced sub-graphs of a network. In 2008, Noga Alon ''et al.'' &amp;lt;ref name=&amp;quot;alo1&amp;quot;&amp;gt;{{cite journal|author1=Alon N |author2=Dao P |author3=Hajirasouliha I |author4=Hormozdiari F |author5=Sahinalp S.C |title=Biomolecular network motif counting and discovery by color coding |journal=Bioinformatics |year=2008 |volume=24 |issue=13 |pages=i241–i249 |doi=10.1093/bioinformatics/btn163|pmid=18586721 |pmc=2718641 }}&amp;lt;/ref&amp;gt;  introduced an approach for finding non-induced sub-graphs too. Their technique works on undirected networks such as PPI ones. Also, it counts non-induced trees and bounded treewidth sub-graphs. This method is applied for sub-graphs of size up to 10.&lt;br /&gt;
&lt;br /&gt;
This algorithm counts the number of non-induced occurrences of a tree {{math|T}} with {{math|k {{=}} O(logn)}} vertices in a network {{math|G}} with {{math|n}} vertices as follows:&lt;br /&gt;
&lt;br /&gt;
# '''Color coding.''' Color each vertex of input network G independently and uniformly at random with one of the {{math|k}} colors.&lt;br /&gt;
# '''Counting.''' Apply a dynamic programming routine to count the number of non-induced occurrences of {{math|T}} in which each vertex has a unique color. For more details on this step, see.&amp;lt;ref name=&amp;quot;alo1&amp;quot; /&amp;gt;&lt;br /&gt;
# Repeat the above two steps {{math|O(e&amp;lt;sup&amp;gt;k&amp;lt;/sup&amp;gt;)}} times and add up the number of occurrences of {{math|T}} to get an estimate on the number of its occurrences in {{math|G}}.&lt;br /&gt;
&lt;br /&gt;
As available PPI networks are far from complete and error free, this approach is suitable for NM discovery for such networks. As Grochow–Kellis Algorithm and this one are the ones popular for non-induced sub-graphs, it is worth to mention that the algorithm introduced by Alon ''et al.'' is less time-consuming than the Grochow–Kellis Algorithm.&amp;lt;ref name=&amp;quot;alo1&amp;quot; /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===MODA===&lt;br /&gt;
Omidi ''et al.'' &amp;lt;ref name=&amp;quot;omi1&amp;quot;&amp;gt;{{cite journal|vauthors=Omidi S, Schreiber F, Masoudi-Nejad A |title=MODA: an efficient algorithm for network motif discovery in biological networks |journal=Genes Genet Syst |year=2009 |volume=84 |issue=5 |pages=385–395 |doi=10.1266/ggs.84.385|pmid=20154426 |doi-access=free }}&amp;lt;/ref&amp;gt; introduced a new algorithm for motif detection named ''MODA'' which is applicable for induced and non-induced NM discovery in undirected networks. It is based on the motif-centric approach discussed in the Grochow–Kellis algorithm section. It is very important to distinguish motif-centric algorithms such as MODA and GK algorithm because of their ability to work as query-finding algorithms. This feature allows such algorithms to be able to find a single motif query or a small number of motif queries (not all possible sub-graphs of a given size) with larger sizes. As the number of possible non-isomorphic sub-graphs increases exponentially with sub-graph size, for large size motifs (even larger than 10), the network-centric algorithms, those looking for all possible sub-graphs, face a problem. Although motif-centric algorithms also have problems in discovering all possible large size sub-graphs, but their ability to find small numbers of them is sometimes a significant property.&lt;br /&gt;
&lt;br /&gt;
Using a hierarchical structure called an ''expansion tree'', the ''MODA'' algorithm is able to extract NMs of a given size systematically and similar to ''FPF'' that avoids enumerating unpromising sub-graphs; ''MODA'' takes into consideration potential queries (or candidate sub-graphs) that would result in frequent sub-graphs. Despite the fact that ''MODA'' resembles ''FPF'' in using a tree like structure, the expansion tree is applicable merely for computing frequency concept {{math|F&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;}}. As we will discuss next, the advantage of this algorithm is that it does not carry out the sub-graph isomorphism test for ''non-tree'' query graphs. Additionally, it utilizes a sampling method in order to speed up the running time of the algorithm.&lt;br /&gt;
&lt;br /&gt;
Here is the main idea: by a simple criterion one can generalize a mapping of a k-size graph into the network to its same size supergraphs. For example, suppose there is mapping {{math|f(G)}} of graph {{math|G}} with {{math|k}} nodes into the network and we have a same size graph {{math|G&amp;amp;prime;}} with one more edge {{math|&amp;amp;langu, v&amp;amp;rang;}}; {{math|f&amp;lt;sub&amp;gt;G&amp;lt;/sub&amp;gt;}} will map {{math|G&amp;amp;prime;}} into the network, if there is an edge {{math|&amp;amp;lang;f&amp;lt;sub&amp;gt;G&amp;lt;/sub&amp;gt;(u), f&amp;lt;sub&amp;gt;G&amp;lt;/sub&amp;gt;(v)&amp;amp;rang;}} in the network. As a result, we can exploit the mapping set of a graph to determine the frequencies of its same order supergraphs simply in {{math|O(1)}} time without carrying out sub-graph isomorphism testing. The algorithm starts ingeniously with minimally connected query graphs of size k and finds their mappings in the network via sub-graph isomorphism. After that, with conservation of the graph size, it expands previously considered query graphs edge-by-edge and computes the frequency of these expanded graphs as mentioned above. The expansion process continues until reaching a complete graph {{math|K&amp;lt;sub&amp;gt;k&amp;lt;/sub&amp;gt;}} (fully connected with {{math|{{frac|k(k-1)|2}}}} edge).&lt;br /&gt;
&lt;br /&gt;
As discussed above, the algorithm starts by computing sub-tree frequencies in the network and then expands sub-trees edge by edge. One way to implement this idea is called the expansion tree {{math|T&amp;lt;sub&amp;gt;k&amp;lt;/sub&amp;gt;}} for each {{math|k}}. Figure shows the expansion tree for size-4 sub-graphs. {{math|T&amp;lt;sub&amp;gt;k&amp;lt;/sub&amp;gt;}} organizes the running process and provides query graphs in a hierarchical manner. Strictly speaking, the expansion tree {{math|T&amp;lt;sub&amp;gt;k&amp;lt;/sub&amp;gt;}} is simply a [[directed acyclic graph]] or DAG, with its root number {{math|k}} indicating the graph size existing in the expansion tree and each of its other nodes containing the adjacency matrix of a distinct {{math|k}}-size query graph. Nodes in the first level of {{math|T&amp;lt;sub&amp;gt;k&amp;lt;/sub&amp;gt;}} are all distinct {{math|k}}-size trees and by traversing {{math|T&amp;lt;sub&amp;gt;k&amp;lt;/sub&amp;gt;}} in depth query graphs expand with one edge at each level. A query graph in a node is a sub-graph of the query graph in a node's child with one edge difference. The longest path in {{math|T&amp;lt;sub&amp;gt;k&amp;lt;/sub&amp;gt;}} consists of {{math|(k&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt;-3k+4)/2}} edges and is the path from the root to the leaf node holding the complete graph. Generating expansion trees can be done by a simple routine which is explained in.&amp;lt;ref name=&amp;quot;omi1&amp;quot; /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
''MODA'' traverses {{math|T&amp;lt;sub&amp;gt;k&amp;lt;/sub&amp;gt;}} and when it extracts query trees from the first level of {{math|T&amp;lt;sub&amp;gt;k&amp;lt;/sub&amp;gt;}} it computes their mapping sets and saves these mappings for the next step. For non-tree queries from {{math|T&amp;lt;sub&amp;gt;k&amp;lt;/sub&amp;gt;}}, the algorithm extracts the mappings associated with the parent node in {{math|T&amp;lt;sub&amp;gt;k&amp;lt;/sub&amp;gt;}} and determines which of these mappings can support the current query graphs. The process will continue until the algorithm gets the complete query graph. The query tree mappings are extracted using the Grochow–Kellis algorithm. For computing the frequency of non-tree query graphs, the algorithm employs a simple routine that takes {{math|O(1)}} steps. In addition, ''MODA'' exploits a sampling method where the sampling of each node in the network is linearly proportional to the node degree, the probability distribution is exactly similar to the well-known Barabási-Albert preferential attachment model in the field of complex networks.&amp;lt;ref name=&amp;quot;bar1&amp;quot;&amp;gt;{{cite journal|vauthors=Barabasi AL, Albert R |title=Emergence of scaling in random networks |journal=Science |year=1999 |volume=286 |issue=5439 |pages=509–512 |doi=10.1126/science.286.5439.509 |pmid=10521342|bibcode=1999Sci...286..509B |arxiv=cond-mat/9910332 }}&amp;lt;/ref&amp;gt; This approach generates approximations; however, the results are almost stable in different executions since sub-graphs aggregate around highly connected nodes.&amp;lt;ref name=&amp;quot;vaz1&amp;quot;&amp;gt;{{cite journal |vauthors=Vázquez A, Dobrin R, Sergi D, etal |title=The topological relationship between the large-scale attributes and local interaction patterns of complex networks |journal=PNAS |year=2004 |volume=101 |issue=52 |pages=17940–17945 |doi=10.1073/pnas.0406024101|pmid=15598746 |pmc=539752 |bibcode=2004PNAS..10117940V |arxiv=cond-mat/0408431 }}&amp;lt;/ref&amp;gt; The pseudocode of ''MODA'' is shown below:&lt;br /&gt;
&lt;br /&gt;
[[File:Expansion Tree.jpg|thumb|''Illustration of the expansion tree T4 for 4-node query graphs''. At the first level, there are non-isomorphic k-size trees and at each level, an edge is added to the parent graph to form a child graph. In the second level, there is a graph with two alternative edges that is shown by a dashed red edge. In fact, this node represents two expanded graphs that are isomorphic.&amp;lt;ref name=&amp;quot;omi1&amp;quot; /&amp;gt;]]&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! MODA&lt;br /&gt;
|-&lt;br /&gt;
|'''Input:''' {{math|G}}: Input graph, {{math|k}}: sub-graph size, {{math|Δ}}: threshold value&lt;br /&gt;
&lt;br /&gt;
'''Output:''' Frequent Subgraph List: List of all frequent {{math|k}}-size sub-graphs&lt;br /&gt;
&lt;br /&gt;
'''Note:''' {{math|F&amp;lt;sub&amp;gt;G&amp;lt;/sub&amp;gt;}}: set of mappings from {{math|G}} in the input graph {{math|G}}&lt;br /&gt;
&lt;br /&gt;
'''fetch''' {{math|T&amp;lt;sub&amp;gt;k&amp;lt;/sub&amp;gt;}}&lt;br /&gt;
&lt;br /&gt;
'''do'''&lt;br /&gt;
&lt;br /&gt;
{{pad|1em}}{{math|G&amp;amp;prime; {{=}} ''Get-Next-BFS''(T&amp;lt;sub&amp;gt;k&amp;lt;/sub&amp;gt;)}} // {{math|G&amp;amp;prime;}} is a query graph&lt;br /&gt;
&lt;br /&gt;
{{pad|1em}}if {{math|{{!}}E(G&amp;amp;prime;){{!}} {{=}} (k – 1)}}&lt;br /&gt;
&lt;br /&gt;
{{pad|1em}}'''call''' {{math|''Mapping-Module''(G&amp;amp;prime;, G)}}&lt;br /&gt;
&lt;br /&gt;
{{pad|1em}}'''else'''&lt;br /&gt;
&lt;br /&gt;
{{pad|2em}}'''call''' {{math|''Enumerating-Module''(G&amp;amp;prime;, G, T&amp;lt;sub&amp;gt;k&amp;lt;/sub&amp;gt;)}}&lt;br /&gt;
&lt;br /&gt;
{{pad|1em}}'''end if'''&lt;br /&gt;
&lt;br /&gt;
{{pad|1em}}'''save''' {{math|F&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;}}&lt;br /&gt;
&lt;br /&gt;
{{pad|1em}}'''if''' {{math|{{!}}F&amp;lt;sub&amp;gt;G&amp;lt;/sub&amp;gt;{{!}} &amp;gt; Δ}} '''then'''&lt;br /&gt;
&lt;br /&gt;
{{pad|2em}}add {{math|G&amp;amp;prime;}} into Frequent Subgraph List&lt;br /&gt;
&lt;br /&gt;
{{pad|1em}}'''end if'''&lt;br /&gt;
&lt;br /&gt;
'''Until''' {{math|{{!}}E(G'){{!}} {{=}} (k – 1)/2}}&lt;br /&gt;
&lt;br /&gt;
'''return''' Frequent Subgraph List&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
===Kavosh===&lt;br /&gt;
A recently introduced algorithm named ''Kavosh'' &amp;lt;ref name=&amp;quot;kash1&amp;quot;&amp;gt;{{cite journal|vauthors=Kashani ZR, Ahrabian H, Elahi E, Nowzari-Dalini A, Ansari ES, Asadi S, Mohammadi S, Schreiber F, Masoudi-Nejad A |title=Kavosh: a new algorithm for finding network motifs |journal=BMC Bioinformatics |year=2009 |volume=10 |issue=318|pages=318 |doi=10.1186/1471-2105-10-318 |pmid=19799800 |pmc=2765973}} {{open access}}&amp;lt;/ref&amp;gt; aims at improved main memory usage. ''Kavosh'' is usable to detect NM in both directed and undirected networks. The main idea of the enumeration is similar to the ''GK'' and ''MODA'' algorithms, which first find all {{math|k}}-size sub-graphs that a particular node participated in, then remove the node, and subsequently repeat this process for the remaining nodes.&amp;lt;ref name=&amp;quot;kash1&amp;quot; /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
For counting the sub-graphs of size {{math|k}} that include a particular node, trees with maximum depth of k, rooted at this node and based on neighborhood relationship are implicitly built. Children of each node include both incoming and outgoing adjacent nodes. To descend the tree, a child is chosen at each level with the restriction that a particular child can be included only if it has not been included at any upper level. After having descended to the lowest level possible, the tree is again ascended and the process is repeated with the stipulation that nodes visited in earlier paths of a descendant are now considered unvisited nodes. A final restriction in building trees is that all children in a particular tree must have numerical labels larger than the label of the root of the tree. The restrictions on the labels of the children are similar to the conditions which ''GK'' and ''ESU'' algorithm use to avoid overcounting sub-graphs.&lt;br /&gt;
&lt;br /&gt;
The protocol for extracting sub-graphs makes use of the compositions of an integer. For the extraction of sub-graphs of size {{math|k}}, all possible compositions of the integer {{math|k-1}} must be considered. The compositions of {{math|k-1}} consist of all possible manners of expressing {{math|k-1}} as a sum of positive integers. Summations in which the order of the summands differs are considered distinct. A composition can be expressed as {{math|k&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;,k&amp;lt;sub&amp;gt;3&amp;lt;/sub&amp;gt;,…,k&amp;lt;sub&amp;gt;m&amp;lt;/sub&amp;gt;}} where {{math|k&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt; + k&amp;lt;sub&amp;gt;3&amp;lt;/sub&amp;gt; + … + k&amp;lt;sub&amp;gt;m&amp;lt;/sub&amp;gt; {{=}} k-1}}. To count sub-graphs based on the composition, {{math|k&amp;lt;sub&amp;gt;i&amp;lt;/sub&amp;gt;}} nodes are selected from the {{math|i}}-th level of the tree to be nodes of the sub-graphs ({{math|i {{=}} 2,3,…,m}}). The {{math|k-1}} selected nodes along with the node at the root define a sub-graph within the network. After discovering a sub-graph involved as a match in the target network, in order to be able to evaluate the size of each class according to the target network, ''Kavosh'' employs the ''nauty'' algorithm &amp;lt;ref name=&amp;quot;mck1&amp;quot; /&amp;gt;&amp;lt;ref name=&amp;quot;mck2&amp;quot; /&amp;gt; in the same way as ''FANMOD''. The enumeration part of Kavosh algorithm is shown below:&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Enumeration of Kavosh&lt;br /&gt;
|-&lt;br /&gt;
|'''''Enumerate_Vertex(G, u, S, Remainder, i)'''''&lt;br /&gt;
&lt;br /&gt;
'''Input:''' {{math|G}}: Input graph&amp;lt;br&amp;gt;&lt;br /&gt;
{{pad|3em}}{{math|u}}: Root vertex&amp;lt;br&amp;gt;&lt;br /&gt;
{{pad|3em}}{{math|S}}: selection ({{math|S {{=}} { S&amp;lt;sub&amp;gt;0&amp;lt;/sub&amp;gt;,S&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;,...,S&amp;lt;sub&amp;gt;k-1&amp;lt;/sub&amp;gt;}}} is an array of the set of all {{math|S&amp;lt;sub&amp;gt;i&amp;lt;/sub&amp;gt;}})&amp;lt;br&amp;gt;&lt;br /&gt;
{{pad|3em}}{{math|Remainder}}: number of remaining vertices to be selected&amp;lt;br&amp;gt;&lt;br /&gt;
{{pad|3em}}{{math|i}}: Current depth of the tree.&amp;lt;br&amp;gt;&lt;br /&gt;
'''Output:''' all {{math|k}}-size sub-graphs of graph {{math|G}} rooted in {{math|u}}.&lt;br /&gt;
&lt;br /&gt;
'''if''' {{math|Remainder {{=}} 0}} '''then'''&amp;lt;br&amp;gt;&lt;br /&gt;
{{pad|1em}}'''return'''&amp;lt;br&amp;gt;&lt;br /&gt;
'''else'''&amp;lt;br&amp;gt;&lt;br /&gt;
{{pad|1em}}{{math|ValList ← ''Validate''(G, S&amp;lt;sub&amp;gt;i-1&amp;lt;/sub&amp;gt;, u)}}&amp;lt;br&amp;gt;&lt;br /&gt;
{{pad|1em}}{{math|n&amp;lt;sub&amp;gt;i&amp;lt;/sub&amp;gt; ← ''Min''({{!}}ValList{{!}}, Remainder)}}&amp;lt;br&amp;gt;&lt;br /&gt;
{{pad|1em}}'''for''' {{math|k&amp;lt;sub&amp;gt;i&amp;lt;/sub&amp;gt; {{=}} 1}} '''to''' {{math|n&amp;lt;sub&amp;gt;i&amp;lt;/sub&amp;gt;}} '''do'''&amp;lt;br&amp;gt;&lt;br /&gt;
{{pad|2em}}{{math|C ← ''Initial_Comb''(ValList, k&amp;lt;sub&amp;gt;i&amp;lt;/sub&amp;gt;)}}&amp;lt;br&amp;gt;&lt;br /&gt;
{{pad|2em}}(Make the first vertex combination selection according)&amp;lt;br&amp;gt;&lt;br /&gt;
{{pad|2em}}'''repeat'''&amp;lt;br&amp;gt;&lt;br /&gt;
{{pad|3em}}{{math|S&amp;lt;sub&amp;gt;i&amp;lt;/sub&amp;gt; ← C}}&amp;lt;br&amp;gt;&lt;br /&gt;
{{pad|3em}}{{math|''Enumerate_Vertex''(G, u, S, Remainder-k&amp;lt;sub&amp;gt;i&amp;lt;/sub&amp;gt;, i+1)}}&amp;lt;br&amp;gt;&lt;br /&gt;
{{pad|3em}}{{math|''Next_Comb''(ValList, k&amp;lt;sub&amp;gt;i&amp;lt;/sub&amp;gt;)}}&amp;lt;br&amp;gt;&lt;br /&gt;
{{pad|3em}}(Make the next vertex combination selection according)&amp;lt;br&amp;gt;&lt;br /&gt;
{{pad|2em}}'''until''' {{math|C {{=}} NILL}}&amp;lt;br&amp;gt;&lt;br /&gt;
{{pad|2em}}'''end for'''&amp;lt;br&amp;gt;&lt;br /&gt;
{{pad|1em}}'''for each''' {{math|v ∈ ValList}} '''do'''&amp;lt;br&amp;gt;&lt;br /&gt;
{{pad|2em}}{{math|Visited[v] ← false}}&amp;lt;br&amp;gt;&lt;br /&gt;
{{pad|1em}}'''end for'''&amp;lt;br&amp;gt;&lt;br /&gt;
'''end if'''&lt;br /&gt;
|-&lt;br /&gt;
|'''''Validate(G, Parents, u)'''''&amp;lt;br&amp;gt;&lt;br /&gt;
'''Input:''' {{math|G}}: input graph, {{math|Parents}}: selected vertices of last layer, {{math|u}}: Root vertex.&amp;lt;br&amp;gt;&lt;br /&gt;
'''Output:''' Valid vertices of the current level.&lt;br /&gt;
&lt;br /&gt;
{{math|ValList ← NILL}}&amp;lt;br&amp;gt;&lt;br /&gt;
'''for each''' {{math|v ∈ Parents}} '''do'''&amp;lt;br&amp;gt;&lt;br /&gt;
{{pad|1em}}'''for each''' {{math|w ∈ Neighbor[u]}} '''do'''&amp;lt;br&amp;gt;&lt;br /&gt;
{{pad|2em}}'''if''' {{math|label[u] &amp;lt; label[w]}} '''AND NOT''' {{math|Visited[w]}} '''then'''&amp;lt;br&amp;gt;&lt;br /&gt;
{{pad|3em}}{{math|Visited[w] ← true}}&amp;lt;br&amp;gt;&lt;br /&gt;
{{pad|3em}}{{math|ValList {{=}} ValList + w}}&amp;lt;br&amp;gt;&lt;br /&gt;
{{pad|2em}}'''end if'''&amp;lt;br&amp;gt;&lt;br /&gt;
{{pad|1em}}'''end for'''&amp;lt;br&amp;gt;&lt;br /&gt;
'''end for'''&amp;lt;br&amp;gt;&lt;br /&gt;
'''return''' {{math|ValList}}&amp;lt;br&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
Recently a ''Cytoscape'' plugin called ''CytoKavosh'' &amp;lt;ref name=&amp;quot;mas2&amp;quot;&amp;gt;{{cite journal|author1=Ali Masoudi-Nejad |author2=Mitra Anasariola |author3=Ali Salehzadeh-Yazdi |author4=Sahand Khakabimamaghani |title=CytoKavosh: a Cytoscape Plug-in for Finding Network Motifs in Large Biological Networks |journal=PLoS ONE |volume=7 |issue=8 |pages=e43287 |year=2012 |doi=10.1371/journal.pone.0043287|pmid=22952659 |pmc=3430699 |bibcode=2012PLoSO...743287M }} {{open access}}&amp;lt;/ref&amp;gt; is developed for this software. It is available via ''Cytoscape'' web page [http://apps.cytoscape.org/apps/cytokavosh].&lt;br /&gt;
&lt;br /&gt;
===G-Tries===&lt;br /&gt;
2010年， Pedro Ribeiro 和 Fernando Silva 提出了一个叫做''g-trie''的新数据结构，用来存储一组子图。&amp;lt;ref name=&amp;quot;rib1&amp;quot;&amp;gt;{{cite conference|vauthors=Ribeiro P, Silva F |title=G-Tries: an efficient data structure for discovering network motifs |conference=ACM 25th Symposium On Applied Computing - Bioinformatics Track |location=Sierre, Switzerland |year=2010 |pages=1559–1566 |url=http://www.nrcbioinformatics.ca/acmsac2010/}}&amp;lt;/ref&amp;gt;这个在概念上类似前缀树的数据结构，根据子图结构来进行存储，并找出了每个子图在一个更大的图中出现的次数。这个数据结构有一个突出的方面：在应用于模体发现算法时，主网络中的子图需要进行评估。因此，在随机网络中寻找那些在不在主网络中的子图，这个消耗时间的步骤就不再需要执行了。&lt;br /&gt;
&lt;br /&gt;
''g-trie'' 是一个存储一组图的多叉树。每一个树节点都存储着一个'''图节点'''及其'''对应的到前一个节点的边'''的信息。从根节点到叶节点的一条路径对应一个图。一个 g-trie 节点的子孙节点共享一个子图（即每一次路径的分叉意味着从一个子图结构中扩展出不同的图结构，而这些扩展出来的图结构自然有着相同的子图结构）。如何构造一个 ''g-trie'' 在&amp;lt;ref name=&amp;quot;rib1&amp;quot; /&amp;gt;中有详细描述。构造好一个 ''g-trie'' 以后，需要进行计数步骤。计数流程的主要思想是回溯所有可能的子图，同时进行同构性测试。这种回溯技术本质上和其他以模体为中心的方法，比如''MODA'' 和 ''GK'' 算法中使用的技术是一样的。这种技术利用了共同的子结构，亦即在一定时间内，几个不同的候选子图中存在部分是同构的。&lt;br /&gt;
&lt;br /&gt;
在上述算法中，''G-Tries'' 是最快的。然而，它的一个缺点是内存的超量使用，这局限了它在个人电脑运行时所能发现的模体的大小&lt;br /&gt;
&lt;br /&gt;
===对比===&lt;br /&gt;
&lt;br /&gt;
下面的表格和数据显示了在各种标准网络中运行上述算法所获得的结果。这些结果皆获取于各自相应的来源&amp;lt;ref name=&amp;quot;omi1&amp;quot; /&amp;gt;&amp;lt;ref name=&amp;quot;kash1&amp;quot; /&amp;gt;&amp;lt;ref name=&amp;quot;rib1&amp;quot; /&amp;gt; ，因此需要独立地对待它们。&lt;br /&gt;
&lt;br /&gt;
[[Image:Runtimes of algorithms.jpg|thumb|''Runtimes of Grochow–Kellis, mfinder, FANMOD, FPF and MODA for subgraphs from three nodes up to nine nodes''.&amp;lt;ref name=&amp;quot;omi1&amp;quot; /&amp;gt;]]&lt;br /&gt;
&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+ Grochow–Kellis, FANMOD, 和 G-Trie 在5个不同网络上生成含3到9个节点子图所用的运行时间 &amp;lt;ref name=&amp;quot;rib1&amp;quot; /&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot;|网络&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot;|子图大小&lt;br /&gt;
!colspan=&amp;quot;3&amp;quot;|原始网络数据&lt;br /&gt;
!colspan=&amp;quot;3&amp;quot;|随机网络平均数据&lt;br /&gt;
|-&lt;br /&gt;
!FANMOD&lt;br /&gt;
!GK&lt;br /&gt;
!G-Trie&lt;br /&gt;
!FANMOD&lt;br /&gt;
!GK&lt;br /&gt;
!G-Trie&lt;br /&gt;
|-&lt;br /&gt;
|rowspan=&amp;quot;5&amp;quot;|Dolphins&lt;br /&gt;
|5 || 0.07 || 0.03 || 0.01 || 0.13 || 0.04 || 0.01&lt;br /&gt;
|-&lt;br /&gt;
|6||0.48||0.28||0.04||1.14||0.35||0.07&lt;br /&gt;
|-&lt;br /&gt;
|7||3.02||3.44||0.23||8.34||3.55||0.46&lt;br /&gt;
|-&lt;br /&gt;
|8||19.44||73.16||1.69||67.94||37.31||4.03&lt;br /&gt;
|-&lt;br /&gt;
|9||100.86||2984.22||6.98||493.98||366.79||24.84&lt;br /&gt;
|-&lt;br /&gt;
|rowspan=&amp;quot;3&amp;quot;|Circuit&lt;br /&gt;
|6||0.49||0.41||0.03||0.55||0.24||0.03&lt;br /&gt;
|-&lt;br /&gt;
|7||3.28||3.73||0.22||3.53||1.34||0.17&lt;br /&gt;
|-&lt;br /&gt;
|8||17.78||48.00||1.52||21.42||7.91||1.06&lt;br /&gt;
|-&lt;br /&gt;
|rowspan=&amp;quot;3&amp;quot;|Social&lt;br /&gt;
|3||0.31||0.11||0.02||0.35||0.11||0.02&lt;br /&gt;
|-&lt;br /&gt;
|4||7.78||1.37||0.56||13.27||1.86||0.57&lt;br /&gt;
|-&lt;br /&gt;
|5||208.30||31.85||14.88||531.65||62.66||22.11&lt;br /&gt;
|-&lt;br /&gt;
|rowspan=&amp;quot;3&amp;quot;|Yeast&lt;br /&gt;
|3||0.47||0.33||0.02||0.57||0.35||0.02&lt;br /&gt;
|-&lt;br /&gt;
|4||10.07||2.04||0.36||12.90||2.25||0.41&lt;br /&gt;
|-&lt;br /&gt;
|5||268.51||34.10||12.73||400.13||47.16||14.98&lt;br /&gt;
|-&lt;br /&gt;
|rowspan=&amp;quot;5&amp;quot;|Power&lt;br /&gt;
|3||0.51||1.46||0.00||0.91||1.37||0.01&lt;br /&gt;
|-&lt;br /&gt;
|4||1.38||4.34||0.02||3.01||4.40||0.03&lt;br /&gt;
|-&lt;br /&gt;
|5||4.68||16.95||0.10||12.38||17.54||0.14&lt;br /&gt;
|-&lt;br /&gt;
|6||20.36||95.58||0.55||67.65||92.74||0.88&lt;br /&gt;
|-&lt;br /&gt;
|7||101.04||765.91||3.36||408.15||630.65||5.17&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+ mfinder, FANMOD, Mavisto 和 Kavosh 在3个不同网络上生成含3到10个节点子图所用的运行时间&amp;lt;ref name=&amp;quot;kash1&amp;quot; /&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
!&amp;amp;nbsp;&lt;br /&gt;
!子图大小→&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot;|3&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot;|4&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot;|5&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot;|6&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot;|7&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot;|8&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot;|9&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot;|10&lt;br /&gt;
|-&lt;br /&gt;
!网络↓&lt;br /&gt;
!算法↓&lt;br /&gt;
|-&lt;br /&gt;
|rowspan=&amp;quot;4&amp;quot;|E. coli&lt;br /&gt;
|Kavosh||0.30||1.84||14.91||141.98||1374.0||13173.7||121110.3||1120560.1&lt;br /&gt;
|-&lt;br /&gt;
|FANMOD||0.81||2.53||15.71||132.24||1205.9||9256.6||-||-&lt;br /&gt;
|-&lt;br /&gt;
|Mavisto||13532||-||-||-||-||-||-||-&lt;br /&gt;
|-&lt;br /&gt;
|Mfinder||31.0||297||23671||-||-||-||-||-&lt;br /&gt;
|-&lt;br /&gt;
|rowspan=&amp;quot;4&amp;quot;|Electronic&lt;br /&gt;
|Kavosh||0.08||0.36||8.02||11.39||77.22||422.6||2823.7||18037.5&lt;br /&gt;
|-&lt;br /&gt;
|FANMOD||0.53||1.06||4.34||24.24||160||967.99||-||-&lt;br /&gt;
|-&lt;br /&gt;
|Mavisto||210.0||1727||-||-||-||-||-||-&lt;br /&gt;
|-&lt;br /&gt;
|Mfinder||7||14||109.8||2020.2||-||-||-||-&lt;br /&gt;
|-&lt;br /&gt;
|rowspan=&amp;quot;4&amp;quot;|Social&lt;br /&gt;
|Kavosh||0.04||0.23||1.63||10.48||69.43||415.66||2594.19||14611.23&lt;br /&gt;
|-&lt;br /&gt;
|FANMOD||0.46||0.84||3.07||17.63||117.43||845.93||-||-&lt;br /&gt;
|-&lt;br /&gt;
|Mavisto||393||1492||-||-||-||-||-||-&lt;br /&gt;
|-&lt;br /&gt;
|Mfinder||12||49||798||181077||-||-||-||-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
===算法的分类===&lt;br /&gt;
正如表格所示，模体发现算法可以分为两大类：基于精确计数的算法，以及使用统计采样以及估计的算法。因为后者并不计数所有子图在主网络中出现的次数，所以第二类算法会更快，却也可能产生带有偏向性的，甚至不现实的结果。&lt;br /&gt;
&lt;br /&gt;
更深一层地，基于精确计数的算法可以分为'''以网络为中心'''的方法以及以'''子图为中心'''的方法。前者在给定网络中搜索给定大小的子图，而后者首先根据给定大小生成各种可能的非同构图，然后在网络中分别搜索这些生成的图。这两种方法都有各自的优缺点，这些在上文有讨论。&lt;br /&gt;
&lt;br /&gt;
另一方面，基于估计的方法可能会利用如前面描述过的颜色编码手段，其它的手段则通常会在枚举过程中忽略一些子图(比如，像在 FANMOD 中做的那样)，然后只在枚举出来的子图上做估计。&lt;br /&gt;
&lt;br /&gt;
此外，表格还指出了一个算法能否应用于有向网络或无向网络，以及导出子图或非导出子图。更多信息请参考下方提供的网页和实验室地址及联系方式。&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+ 模体发现算法的分类&lt;br /&gt;
|-&lt;br /&gt;
!计数方式&lt;br /&gt;
!基础&lt;br /&gt;
!算法名称&lt;br /&gt;
!有向 / 无向&lt;br /&gt;
!导出/ 非导出&lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;9&amp;quot; |精确基数&lt;br /&gt;
| rowspan=&amp;quot;5&amp;quot; |以网络为中心&lt;br /&gt;
|[http://www.weizmann.ac.il/mcb/UriAlon/ mfinder]||皆可||导出&lt;br /&gt;
|-&lt;br /&gt;
|[http://theinf1.informatik.uni-jena.de/~wernicke/motifs/ ESU (FANMOD)]||皆可||导出&lt;br /&gt;
|-&lt;br /&gt;
|[http://lbb.ut.ac.ir/Download/LBBsoft/Kavosh/ Kavosh] (used in [http://apps.cytoscape.org/apps/cytokavosh CytoKavosh])||皆可||导出&lt;br /&gt;
|-&lt;br /&gt;
|[http://www.dcc.fc.up.pt/gtries/ G-Tries]||皆可||导出&lt;br /&gt;
|-&lt;br /&gt;
|[http://nesreenahmed.com/graphlets PGD]&lt;br /&gt;
|无向&lt;br /&gt;
|导出&lt;br /&gt;
|-&lt;br /&gt;
|rowspan=&amp;quot;4&amp;quot;|以子图为中心&lt;br /&gt;
|[http://mavisto.ipk-gatersleben.de/ FPF (Mavisto)]||皆可||导出&lt;br /&gt;
|-&lt;br /&gt;
|[https://www.msu.edu/~jinchen/ NeMoFinder]||无向||导出&lt;br /&gt;
|-&lt;br /&gt;
|[http://people.cs.uchicago.edu/~joshuag/index.html Grochow–Kellis]||皆可||Both&lt;br /&gt;
|-&lt;br /&gt;
|[http://lbb.ut.ac.ir/Download/LBBsoft/MODA/ MODA]||皆可||皆可&lt;br /&gt;
|-&lt;br /&gt;
|rowspan=&amp;quot;3&amp;quot;|采样估计&lt;br /&gt;
|颜色编码&lt;br /&gt;
|[http://www.math.tau.ac.il/~nogaa/ N. Alon] ''et al.''’s Algorithm||无向||非导出&lt;br /&gt;
|-&lt;br /&gt;
|rowspan=&amp;quot;2&amp;quot;|其他手段&lt;br /&gt;
|[http://www.weizmann.ac.il/mcb/UriAlon/ mfinder]||皆可||导出&lt;br /&gt;
|-&lt;br /&gt;
|[http://theinf1.informatik.uni-jena.de/~wernicke/motifs/ ESU (FANMOD)]||皆可||导出&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+ 算法提出者的地址和联系方式&lt;br /&gt;
|-&lt;br /&gt;
!算法&lt;br /&gt;
!实验室/研究组&lt;br /&gt;
!学院&lt;br /&gt;
!大学/研究所&lt;br /&gt;
!地址&lt;br /&gt;
!电子邮件&lt;br /&gt;
|-&lt;br /&gt;
|[http://www.weizmann.ac.il/mcb/UriAlon/ mfinder]||Uri Alon's Group||Department of Molecular Cell Biology||Weizmann Institute of Science||Rehovot, Israel, Wolfson, Rm. 607||urialon at weizmann.ac.il&lt;br /&gt;
|-&lt;br /&gt;
|[http://mavisto.ipk-gatersleben.de/ FPF (Mavisto)]||----||----||Leibniz-Institut für Pflanzengenetik und Kulturpflanzenforschung (IPK)||Corrensstraße 3, D-06466 Stadt Seeland, OT Gatersleben, Deutschland||schreibe at ipk-gatersleben.de&lt;br /&gt;
|-&lt;br /&gt;
|[http://theinf1.informatik.uni-jena.de/~wernicke/motifs/ ESU (FANMOD)]||Lehrstuhl Theoretische Informatik I||Institut für Informatik||Friedrich-Schiller-Universität Jena||Ernst-Abbe-Platz 2,D-07743 Jena, Deutschland||sebastian.wernicke at gmail.com&lt;br /&gt;
|-&lt;br /&gt;
|[https://www.msu.edu/~jinchen/ NeMoFinder]||----||School of Computing||National University of Singapore||Singapore 119077||chenjin at comp.nus.edu.sg&lt;br /&gt;
|-&lt;br /&gt;
|[http://www.cs.colorado.edu/~jgrochow/ Grochow–Kellis]||CS Theory Group &amp;amp; Complex Systems Group||Computer Science||University of Colorado, Boulder||1111 Engineering Dr. ECOT 717, 430 UCB Boulder, CO 80309-0430 USA||jgrochow at colorado.edu&lt;br /&gt;
|-&lt;br /&gt;
|[http://www.math.tau.ac.il/~nogaa/ N. Alon] ''et al.''’s Algorithm||Department of Pure Mathematics||School of Mathematical Sciences||Tel Aviv University||Tel Aviv 69978, Israel||nogaa at post.tau.ac.il&lt;br /&gt;
|-&lt;br /&gt;
|[http://lbb.ut.ac.ir/Download/LBBsoft/MODA/ MODA]||Laboratory of Systems Biology and Bioinformatics (LBB)||Institute of Biochemistry and Biophysics (IBB)||University of Tehran||Enghelab Square, Enghelab Ave, Tehran, Iran||amasoudin at ibb.ut.ac.ir&lt;br /&gt;
|-&lt;br /&gt;
|[http://lbb.ut.ac.ir/Download/LBBsoft/Kavosh/ Kavosh] (used in [http://apps.cytoscape.org/apps/cytokavosh CytoKavosh])||Laboratory of Systems Biology and Bioinformatics (LBB)||Institute of Biochemistry and Biophysics (IBB)||University of Tehran||Enghelab Square, Enghelab Ave, Tehran, Iran||amasoudin at ibb.ut.ac.ir&lt;br /&gt;
|-&lt;br /&gt;
|[http://www.dcc.fc.up.pt/gtries/ G-Tries]||Center for Research in Advanced Computing Systems||Computer Science||University of Porto||Rua Campo Alegre 1021/1055, Porto, Portugal||pribeiro at dcc.fc.up.pt&lt;br /&gt;
|-&lt;br /&gt;
|[http://nesreenahmed.com/graphlets PGD]&lt;br /&gt;
|Network Learning and Discovery Lab&lt;br /&gt;
|Department of Computer Science&lt;br /&gt;
|Purdue University&lt;br /&gt;
|Purdue University, 305 N University St, West Lafayette, IN 47907&lt;br /&gt;
|nkahmed@purdue.edu&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Well-established motifs and their functions==&lt;br /&gt;
Much experimental work has been devoted to understanding network motifs in [[gene regulatory networks]]. These networks control which genes are expressed in the cell in response to biological signals. The network is defined such that genes are nodes, and directed edges represent the control of one gene by a transcription factor (regulatory protein that binds DNA) encoded by another gene. Thus, network motifs are patterns of genes regulating each other's transcription rate. When analyzing transcription networks, it is seen that the same network motifs appear again and again in diverse organisms from bacteria to human. The transcription network of ''[[Escherichia coli|E. coli]]'' and yeast, for example, is made of three main motif families, that make up almost the entire network. The leading hypothesis is that the network motif were independently selected by evolutionary processes in a converging manner,&amp;lt;ref name=&amp;quot;bab1&amp;quot;&amp;gt;{{cite journal |vauthors=Babu MM, Luscombe NM, Aravind L, Gerstein M, Teichmann SA |title=Structure and evolution of transcriptional regulatory networks |journal=Current Opinion in Structural Biology |volume=14 |issue=3 |pages=283–91 |date=June 2004 |pmid=15193307 |doi=10.1016/j.sbi.2004.05.004 |citeseerx=10.1.1.471.9692 }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;con1&amp;quot;&amp;gt;{{cite journal |vauthors=Conant GC, Wagner A |title=Convergent evolution of gene circuits |journal=Nat. Genet. |volume=34 |issue=3 |pages=264–6 |date=July 2003 |pmid=12819781 |doi=10.1038/ng1181}}&amp;lt;/ref&amp;gt; since the creation or elimination of regulatory interactions is fast on evolutionary time scale, relative to the rate at which genes change,&amp;lt;ref name=&amp;quot;bab1&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;con1&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;dek1&amp;quot;&amp;gt;{{cite journal |vauthors=Dekel E, Alon U |title=Optimality and evolutionary tuning of the expression level of a protein |journal=Nature |volume=436 |issue=7050 |pages=588–92 |date=July 2005 |pmid=16049495 |doi=10.1038/nature03842 |bibcode=2005Natur.436..588D }}&amp;lt;/ref&amp;gt; Furthermore, experiments on the dynamics generated by network motifs in living cells indicate that they have characteristic dynamical functions. This suggests that the network motif serve as building blocks in gene regulatory networks that are beneficial to the organism.&lt;br /&gt;
&lt;br /&gt;
The functions associated with common network motifs in transcription networks were explored and demonstrated by several research projects both theoretically and experimentally. Below are some of the most common network motifs and their associated function.&lt;br /&gt;
&lt;br /&gt;
===Negative auto-regulation (NAR)===&lt;br /&gt;
[[Image:Autoregulation motif.png|thumb|Schematic representation of an auto-regulation motif]]&lt;br /&gt;
One of simplest and most abundant network motifs in ''[[Escherichia coli|E. coli]]'' is negative auto-regulation in which a transcription factor (TF) represses its own transcription. This motif was shown to perform two important functions. The first function is response acceleration. NAR was shown to speed-up the response to signals both theoretically &amp;lt;ref name=&amp;quot;zab1&amp;quot;&amp;gt;{{cite journal |doi=10.1016/j.jtbi.2011.06.021 |author=Zabet NR |title=Negative feedback and physical limits of genes |journal=Journal of Theoretical Biology |volume= 284|issue=1 |pages=82–91 |date=September 2011 |pmid=21723295 |arxiv=1408.1869 |citeseerx=10.1.1.759.5418 }}&amp;lt;/ref&amp;gt; and experimentally. This was first shown in a synthetic transcription network&amp;lt;ref name=&amp;quot;ros1&amp;quot;&amp;gt;{{cite journal |doi=10.1016/S0022-2836(02)00994-4 |vauthors=Rosenfeld N, Elowitz MB, Alon U |title=Negative autoregulation speeds the response times of transcription networks |journal=J. Mol. Biol. |volume=323 |issue=5 |pages=785–93 |date=November 2002 |pmid=12417193 |citeseerx=10.1.1.126.2604 }}&amp;lt;/ref&amp;gt; and later on in the natural context in the SOS DNA repair system of E .coli.&amp;lt;ref name=&amp;quot;cam1&amp;quot;&amp;gt;{{cite journal |vauthors=Camas FM, Blázquez J, Poyatos JF |title=Autogenous and nonautogenous control of response in a genetic network |journal=Proc. Natl. Acad. Sci. U.S.A. |volume=103 |issue=34 |pages=12718–23 |date=August 2006 |pmid=16908855 |pmc=1568915 |doi=10.1073/pnas.0602119103 |bibcode=2006PNAS..10312718C }}&amp;lt;/ref&amp;gt; The second function is increased stability of the auto-regulated gene product concentration against stochastic noise, thus reducing variations in protein levels between different cells.&amp;lt;ref name=&amp;quot;bec1&amp;quot;&amp;gt;{{cite journal |vauthors=Becskei A, Serrano L |title=Engineering stability in gene networks by autoregulation |journal=Nature |volume=405 |issue=6786 |pages=590–3 |date=June 2000 |pmid=10850721 |doi=10.1038/35014651}}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;dub1&amp;quot;&amp;gt;{{cite journal |vauthors=Dublanche Y, Michalodimitrakis K, Kümmerer N, Foglierini M, Serrano L |title=Noise in transcription negative feedback loops: simulation and experimental analysis |journal=Mol. Syst. Biol. |volume=2 |pages=41 |year=2006 |pmid=16883354 |pmc=1681513 |doi=10.1038/msb4100081 |issue=1}}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;shi1&amp;quot;&amp;gt;{{cite journal |vauthors=Shimoga V, White J, Li Y, Sontag E, Bleris L |title= Synthetic mammalian transgene negative autoregulation |journal=Mol. Syst. Biol. |volume=9 |pages=670 |year=2013|doi=10.1038/msb.2013.27|pmid= 23736683 |pmc= 3964311 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Positive auto-regulation (PAR)===&lt;br /&gt;
Positive auto-regulation (PAR) occurs when a transcription factor enhances its own rate of production. Opposite to the NAR motif this motif slows the response time compared to simple regulation.&amp;lt;ref name=&amp;quot;mae1&amp;quot;&amp;gt;{{cite journal |vauthors=Maeda YT, Sano M |title=Regulatory dynamics of synthetic gene networks with positive feedback |journal=J. Mol. Biol. |volume=359 |issue=4 |pages=1107–24 |date=June 2006 |pmid=16701695 |doi=10.1016/j.jmb.2006.03.064 }}&amp;lt;/ref&amp;gt; In the case of a strong PAR the motif may lead to a bimodal distribution of protein levels in cell populations.&amp;lt;ref name=&amp;quot;bec2&amp;quot;&amp;gt;{{cite journal |vauthors=Becskei A, Séraphin B, Serrano L |title=Positive feedback in eukaryotic gene networks: cell differentiation by graded to binary response conversion |journal=EMBO J. |volume=20 |issue=10 |pages=2528–35 |date=May 2001 |pmid=11350942 |pmc=125456 |doi=10.1093/emboj/20.10.2528}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Feed-forward loops (FFL)===&lt;br /&gt;
[[Image:Feed-forward motif.GIF|thumb|Schematic representation of a Feed-forward motif]]&lt;br /&gt;
This motif is commonly found in many gene systems and organisms. The motif consists of three genes and three regulatory interactions. The target gene C is regulated by 2 TFs A and B and in addition TF B  is also regulated by TF A . Since each of the regulatory interactions may either be positive or negative there are possibly eight types of FFL motifs.&amp;lt;ref name=&amp;quot;man1&amp;quot;&amp;gt;{{cite journal |vauthors=Mangan S, Alon U |title=Structure and function of the feed-forward loop network motif |journal=Proc. Natl. Acad. Sci. U.S.A. |volume=100 |issue=21 |pages=11980–5 |date=October 2003 |pmid=14530388 |pmc=218699 |doi=10.1073/pnas.2133841100 |bibcode=2003PNAS..10011980M }}&amp;lt;/ref&amp;gt; Two of those eight types: the coherent type 1 FFL (C1-FFL) (where all interactions are positive) and the incoherent type 1 FFL (I1-FFL) (A activates C and also activates B which represses C) are found much more frequently in the transcription network of ''[[Escherichia coli|E. coli]]'' and yeast than the other six types.&amp;lt;ref name=&amp;quot;man1&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;ma1&amp;quot;&amp;gt;{{cite journal |vauthors=Ma HW, Kumar B, Ditges U, Gunzer F, Buer J, Zeng AP |title=An extended transcriptional regulatory network of ''Escherichia coli'' and analysis of its hierarchical structure and network motifs |journal=Nucleic Acids Res. |volume=32 |issue=22 |pages=6643–9 |year=2004 |pmid=15604458 |pmc=545451 |doi=10.1093/nar/gkh1009 |url=http://nar.oxfordjournals.org/cgi/pmidlookup?view=long&amp;amp;pmid=15604458}}&amp;lt;/ref&amp;gt; In addition to the structure of the circuitry the way in which the signals from A and B are integrated by the C promoter should also be considered. In most of the cases the FFL is either an AND gate (A and B are required for C activation) or OR gate (either A or B are sufficient for C activation) but other input function are also possible.&lt;br /&gt;
&lt;br /&gt;
===Coherent type 1 FFL (C1-FFL)===&lt;br /&gt;
The C1-FFL with an AND gate was shown to have a function of a ‘sign-sensitive delay’ element and a persistence detector both theoretically &amp;lt;ref name=&amp;quot;man1&amp;quot;/&amp;gt; and experimentally&amp;lt;ref name=&amp;quot;man2&amp;quot;&amp;gt;{{cite journal |doi=10.1016/j.jmb.2003.09.049 |vauthors=Mangan S, Zaslaver A, Alon U |title=The coherent feedforward loop serves as a sign-sensitive delay element in transcription networks |journal=J. Mol. Biol. |volume=334 |issue=2 |pages=197–204 |date=November 2003 |pmid=14607112 |citeseerx=10.1.1.110.4629 }}&amp;lt;/ref&amp;gt; with the arabinose system of ''[[Escherichia coli|E. coli]]''. This means that this motif can provide pulse filtration in which short pulses of signal will not generate a response but persistent signals will generate a response after short delay. The shut off of the output when a persistent pulse is ended will be fast. The opposite behavior emerges in the case of a sum gate with fast response and delayed shut off as was demonstrated in the flagella system of ''[[Escherichia coli|E. coli]]''.&amp;lt;ref name=&amp;quot;kal1&amp;quot;&amp;gt;{{cite journal |vauthors=Kalir S, Mangan S, Alon U |title=A coherent feed-forward loop with a SUM input function prolongs flagella expression in ''Escherichia coli'' |journal=Mol. Syst. Biol. |volume=1 |pages=E1–E6 |year=2005 |pmid=16729041 |pmc=1681456 |doi=10.1038/msb4100010 |issue=1}}&amp;lt;/ref&amp;gt; De novo evolution of C1-FFLs in [[gene regulatory network]]s has been demonstrated computationally in response to selection to filter out an idealized short signal pulse, but for non-idealized noise, a dynamics-based system of feed-forward regulation with different topology was instead favored.&amp;lt;ref&amp;gt;{{cite journal |last1=Xiong |first1=Kun |last2=Lancaster |first2=Alex K. |last3=Siegal |first3=Mark L. |last4=Masel |first4=Joanna |title=Feed-forward regulation adaptively evolves via dynamics rather than topology when there is intrinsic noise |journal=Nature Communications |date=3 June 2019 |volume=10 |issue=1 |pages=2418 |doi=10.1038/s41467-019-10388-6|pmid=31160574 |pmc=6546794 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Incoherent type 1 FFL (I1-FFL)===&lt;br /&gt;
The I1-FFL is a pulse generator and response accelerator. The two signal pathways of the I1-FFL act in opposite directions where one pathway activates Z and the other represses it. When the repression is complete this leads to a pulse-like dynamics. It was also demonstrated experimentally that the I1-FFL can serve as response accelerator in a way which is similar to the NAR motif. The difference is that the I1-FFL can speed-up the response of any gene and not necessarily a transcription factor gene.&amp;lt;ref name=&amp;quot;man3&amp;quot;&amp;gt;{{cite journal |vauthors=Mangan S, Itzkovitz S, Zaslaver A, Alon U |title=The incoherent feed-forward loop accelerates the response-time of the gal system of ''Escherichia coli'' |journal=J. Mol. Biol. |volume=356 |issue=5 |pages=1073–81 |date=March 2006 |pmid=16406067 |doi=10.1016/j.jmb.2005.12.003 |citeseerx=10.1.1.184.8360 }}&amp;lt;/ref&amp;gt; An additional function was assigned to the I1-FFL network motif: it was shown both theoretically and experimentally that the I1-FFL can generate non-monotonic input function in both a synthetic &amp;lt;ref name=&amp;quot;ent1&amp;quot;&amp;gt;{{cite journal |vauthors=Entus R, Aufderheide B, Sauro HM |title=Design and implementation of three incoherent feed-forward motif based biological concentration sensors |journal=Syst Synth Biol |volume=1 |issue=3 |pages=119–28 |date=August 2007 |pmid=19003446 |pmc=2398716 |doi=10.1007/s11693-007-9008-6 }}&amp;lt;/ref&amp;gt; and native systems.&amp;lt;ref name=&amp;quot;kap1&amp;quot;&amp;gt;{{cite journal |vauthors=Kaplan S, Bren A, Dekel E, Alon U |title=The incoherent feed-forward loop can generate non-monotonic input functions for genes |journal=Mol. Syst. Biol. |volume=4 |pages=203 |year=2008 |pmid=18628744 |pmc=2516365 |doi=10.1038/msb.2008.43 |issue=1}}&amp;lt;/ref&amp;gt; Finally, expression units that incorporate incoherent feedforward control of the gene product provide adaptation to the amount of DNA template and can be superior to simple combinations of constitutive promoters.&amp;lt;ref name=&amp;quot;ble1&amp;quot;&amp;gt;{{cite journal |vauthors=Bleris L, Xie Z, Glass D, Adadey A, Sontag E, Benenson Y |title=Synthetic incoherent feedforward circuits show adaptation to the amount of their genetic template |journal=Mol. Syst. Biol. |volume=7 |pages=519|year=2011 |doi=10.1038/msb.2011.49 |issue=1 |pmid=21811230 |pmc=3202791}}&amp;lt;/ref&amp;gt; Feedforward regulation displayed better adaptation than negative feedback, and circuits based on RNA interference were the most robust to variation in DNA template amounts.&amp;lt;ref name=&amp;quot;ble1&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Multi-output FFLs===&lt;br /&gt;
In some cases the same regulators X and Y regulate several Z genes of the same system. By adjusting the strength of the interactions this motif was shown to determine the temporal order of gene activation. This was demonstrated experimentally in the flagella system of ''[[Escherichia coli|E. coli]]''.&amp;lt;ref name=&amp;quot;kal2&amp;quot;&amp;gt;{{cite journal  |vauthors=Kalir S, McClure J, Pabbaraju K, etal |title=Ordering genes in a flagella pathway by analysis of expression kinetics from living bacteria |journal=Science |volume=292 |issue=5524 |pages=2080–3 |date=June 2001 |pmid=11408658 |doi=10.1126/science.1058758 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Single-input modules (SIM)===&lt;br /&gt;
This motif occurs when a single regulator regulates a set of genes with no additional regulation. This is useful when the genes are cooperatively carrying out a specific function and therefore always need to be activated in a synchronized manner. By adjusting the strength of the interactions it can create temporal expression program of the genes it regulates.&amp;lt;ref name=&amp;quot;zas1&amp;quot;&amp;gt;{{cite journal  |vauthors=Zaslaver A, Mayo AE, Rosenberg R, etal |title=Just-in-time transcription program in metabolic pathways |journal=Nat. Genet. |volume=36 |issue=5 |pages=486–91 |date=May 2004 |pmid=15107854 |doi=10.1038/ng1348|doi-access=free }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In the literature, Multiple-input modules (MIM) arose as a generalization of SIM. However, the precise definitions of SIM and MIM have been a source of inconsistency. There are attempts to provide orthogonal definitions for canonical motifs in biological networks and algorithms to enumerate them, especially SIM, MIM and Bi-Fan (2x2 MIM).&amp;lt;ref&amp;gt;{{cite journal |vauthors=Konagurthu AS, Lesk AM |title=Single and Multiple Input Modules in regulatory networks |journal=Proteins |volume=73 |issue=2 |pages=320–324 |year=2008 |doi=10.1002/prot.22053|pmid=18433061 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Dense overlapping regulons (DOR)===&lt;br /&gt;
This motif occurs in the case that several regulators combinatorially control a set of genes  with diverse regulatory combinations. This motif was found in ''[[Escherichia coli|E. coli]]'' in various systems such as carbon utilization, anaerobic growth, stress response and others.&amp;lt;ref name=&amp;quot;she1&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;boy1&amp;quot;/&amp;gt; In order to better understand the function of this motif one has to obtain more information about the way the multiple inputs are integrated by the genes. Kaplan ''et al.''&amp;lt;ref name=&amp;quot;kap2&amp;quot;&amp;gt;{{cite journal |vauthors=Kaplan S, Bren A, Zaslaver A, Dekel E, Alon U |title=Diverse two-dimensional input functions control bacterial sugar genes |journal=Mol. Cell |volume=29 |issue=6 |pages=786–92 |date=March 2008 |pmid=18374652 |pmc=2366073 |doi=10.1016/j.molcel.2008.01.021 }}&amp;lt;/ref&amp;gt; has mapped the input functions of the sugar utilization genes in ''[[Escherichia coli|E. coli]]'', showing diverse shapes.&lt;br /&gt;
&lt;br /&gt;
==已知的模体及其功能==&lt;br /&gt;
许多实验工作致力于理解[[基因调控网络]]中的网络模体。在响应生物信号的过程中，这些网络控制细胞中需要表达的基因。这样的网络以基因作为节点，有向边代表对某个基因的调控，基因调控通过其他基因编码的转录因子[[结合在DNA上的调控蛋白]]来实现。因此，网络模体是基因之间相互调控转录速率的模式。在分析转录调控网络的时候，人们发现某些相同的网络模体在不同的物种中不断地出现，从细菌到人类。例如，''[[大肠杆菌]]''和酵母的转录网络由三种主要的网络模体家族组成，它们可以构建几乎整个网络。主要的假设是在进化的过程中，网络模体是被以收敛的方式独立选择出来的。&amp;lt;ref name=&amp;quot;bab1&amp;quot;&amp;gt;{{cite journal |vauthors=Babu MM, Luscombe NM, Aravind L, Gerstein M, Teichmann SA |title=Structure and evolution of transcriptional regulatory networks |journal=Current Opinion in Structural Biology |volume=14 |issue=3 |pages=283–91 |date=June 2004 |pmid=15193307 |doi=10.1016/j.sbi.2004.05.004 |citeseerx=10.1.1.471.9692 }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;con1&amp;quot;&amp;gt;{{cite journal |vauthors=Conant GC, Wagner A |title=Convergent evolution of gene circuits |journal=Nat. Genet. |volume=34 |issue=3 |pages=264–6 |date=July 2003 |pmid=12819781 |doi=10.1038/ng1181}}&amp;lt;/ref&amp;gt; 因为相对于基因改变的速率，转录相互作用产生和消失的时间尺度在进化上是很快的。&amp;lt;ref name=&amp;quot;bab1&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;con1&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;dek1&amp;quot;&amp;gt;{{cite journal |vauthors=Dekel E, Alon U |title=Optimality and evolutionary tuning of the expression level of a protein |journal=Nature |volume=436 |issue=7050 |pages=588–92 |date=July 2005 |pmid=16049495 |doi=10.1038/nature03842 |bibcode=2005Natur.436..588D }}&amp;lt;/ref&amp;gt; 此外，对活细胞中网络模体所产生的动力学行为的实验表明，它们具有典型的动力学功能。这表明，网络模体是基因调控网络中对生物体有益的基本单元。&lt;br /&gt;
&lt;br /&gt;
一些研究从理论和实验两方面探讨和论证了转录网络中与共同网络模体相关的功能。下面是一些最常见的网络模体及其相关功能。&lt;br /&gt;
&lt;br /&gt;
===负自反馈调控(NAR)===&lt;br /&gt;
[[Image:Autoregulation motif.png|thumb|Schematic representation of an auto-regulation motif]]&lt;br /&gt;
负自反馈调控是[[大肠杆菌]]中最简单和最冗余的网络模体之一，其中一个转录因子抑制它自身的转录。这种网络模体有两个重要的功能，其中第一个是加速响应。人们发现在实验和理论上， &amp;lt;ref name=&amp;quot;zab1&amp;quot;&amp;gt;{{cite journal |doi=10.1016/j.jtbi.2011.06.021 |author=Zabet NR |title=Negative feedback and physical limits of genes |journal=Journal of Theoretical Biology |volume= 284|issue=1 |pages=82–91 |date=September 2011 |pmid=21723295 |arxiv=1408.1869 |citeseerx=10.1.1.759.5418 }}&amp;lt;/ref&amp;gt;NAR都可以加快对信号的响应。这个功能首先在一个人工合成的转录网络中被发现，&amp;lt;ref name=&amp;quot;ros1&amp;quot;&amp;gt;{{cite journal |doi=10.1016/S0022-2836(02)00994-4 |vauthors=Rosenfeld N, Elowitz MB, Alon U |title=Negative autoregulation speeds the response times of transcription networks |journal=J. Mol. Biol. |volume=323 |issue=5 |pages=785–93 |date=November 2002 |pmid=12417193 |citeseerx=10.1.1.126.2604 }}&amp;lt;/ref&amp;gt; 然后在大肠杆菌SOS DAN修复系统这个自然体系中也被发现。&amp;lt;ref name=&amp;quot;cam1&amp;quot;&amp;gt;{{cite journal |vauthors=Camas FM, Blázquez J, Poyatos JF |title=Autogenous and nonautogenous control of response in a genetic network |journal=Proc. Natl. Acad. Sci. U.S.A. |volume=103 |issue=34 |pages=12718–23 |date=August 2006 |pmid=16908855 |pmc=1568915 |doi=10.1073/pnas.0602119103 |bibcode=2006PNAS..10312718C }}&amp;lt;/ref&amp;gt; 负自反馈网络的第二个功能是增强自调控基因的产物浓度的稳定性，从而抵抗随机的噪声，减少该蛋白含量在不同细胞中的差异。&amp;lt;ref name=&amp;quot;bec1&amp;quot;&amp;gt;{{cite journal |vauthors=Becskei A, Serrano L |title=Engineering stability in gene networks by autoregulation |journal=Nature |volume=405 |issue=6786 |pages=590–3 |date=June 2000 |pmid=10850721 |doi=10.1038/35014651}}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;dub1&amp;quot;&amp;gt;{{cite journal |vauthors=Dublanche Y, Michalodimitrakis K, Kümmerer N, Foglierini M, Serrano L |title=Noise in transcription negative feedback loops: simulation and experimental analysis |journal=Mol. Syst. Biol. |volume=2 |pages=41 |year=2006 |pmid=16883354 |pmc=1681513 |doi=10.1038/msb4100081 |issue=1}}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;shi1&amp;quot;&amp;gt;{{cite journal |vauthors=Shimoga V, White J, Li Y, Sontag E, Bleris L |title= Synthetic mammalian transgene negative autoregulation |journal=Mol. Syst. Biol. |volume=9 |pages=670 |year=2013|doi=10.1038/msb.2013.27|pmid= 23736683 |pmc= 3964311 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===正自反馈调控(PAR)===&lt;br /&gt;
正自反馈调控是指转录因子增强它自身转录速率的调控。和负自反馈调节相反，NAR模体相比于简单的调控能够延长反应时间。&amp;lt;ref name=&amp;quot;mae1&amp;quot;&amp;gt;{{cite journal |vauthors=Maeda YT, Sano M |title=Regulatory dynamics of synthetic gene networks with positive feedback |journal=J. Mol. Biol. |volume=359 |issue=4 |pages=1107–24 |date=June 2006 |pmid=16701695 |doi=10.1016/j.jmb.2006.03.064 }}&amp;lt;/ref&amp;gt; 在强PAR的情况下，模体可能导致蛋白质水平在细胞群中呈现双峰分布。&amp;lt;ref name=&amp;quot;bec2&amp;quot;&amp;gt;{{cite journal |vauthors=Becskei A, Séraphin B, Serrano L |title=Positive feedback in eukaryotic gene networks: cell differentiation by graded to binary response conversion |journal=EMBO J. |volume=20 |issue=10 |pages=2528–35 |date=May 2001 |pmid=11350942 |pmc=125456 |doi=10.1093/emboj/20.10.2528}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===前馈回路 (FFL)===&lt;br /&gt;
[[Image:Feed-forward motif.GIF|thumb|Schematic representation of a Feed-forward motif]]&lt;br /&gt;
前馈回路普遍存在于许多基因系统和生物体中。这种模体包括三个基因以及三个相互作用。目标基因C被两个转录因子（TFs）A和B调控，并且TF B同时被TF A调控。由于每个调控相互作用可以是正的或者负的，所以总共可能有八种类型的FFL模体。&amp;lt;ref name=&amp;quot;man1&amp;quot;&amp;gt;{{cite journal |vauthors=Mangan S, Alon U |title=Structure and function of the feed-forward loop network motif |journal=Proc. Natl. Acad. Sci. U.S.A. |volume=100 |issue=21 |pages=11980–5 |date=October 2003 |pmid=14530388 |pmc=218699 |doi=10.1073/pnas.2133841100 |bibcode=2003PNAS..10011980M }}&amp;lt;/ref&amp;gt; 其中的两种：一致前馈回路的类型一（C1-FFL）（所有相互作用都是正的）和非一致前馈回路的类型一（I1-FFL）（A激活C和B，B抑制C）在[[大肠杆菌]]和酵母中相比于其他六种更频繁的出现。&amp;lt;ref name=&amp;quot;man1&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;ma1&amp;quot;&amp;gt;{{cite journal |vauthors=Ma HW, Kumar B, Ditges U, Gunzer F, Buer J, Zeng AP |title=An extended transcriptional regulatory network of ''Escherichia coli'' and analysis of its hierarchical structure and network motifs |journal=Nucleic Acids Res. |volume=32 |issue=22 |pages=6643–9 |year=2004 |pmid=15604458 |pmc=545451 |doi=10.1093/nar/gkh1009 |url=http://nar.oxfordjournals.org/cgi/pmidlookup?view=long&amp;amp;pmid=15604458}}&amp;lt;/ref&amp;gt; 除了网络的结构外，还应该考虑来自A和B的信号被C的启动子集成的方式。在大多数情况下，FFL要么是一个与门(激活C需要A和B)，要么是或门(激活C需要A或B)，但也可以是其他输入函数。&lt;br /&gt;
&lt;br /&gt;
===一致前馈回路类型一(C1-FFL)===&lt;br /&gt;
具有与门的C1-FFL有“符号-敏感延迟”单元和持久性探测器的功能，这一点在[[大肠杆菌]]阿拉伯糖系系统的理论&amp;lt;ref name=&amp;quot;man1&amp;quot;/&amp;gt;和实验上&amp;lt;ref name=&amp;quot;man2&amp;quot;&amp;gt;{{cite journal |doi=10.1016/j.jmb.2003.09.049 |vauthors=Mangan S, Zaslaver A, Alon U |title=The coherent feedforward loop serves as a sign-sensitive delay element in transcription networks |journal=J. Mol. Biol. |volume=334 |issue=2 |pages=197–204 |date=November 2003 |pmid=14607112 |citeseerx=10.1.1.110.4629 }}&amp;lt;/ref&amp;gt; 都有发现。这意味着该模体可以提供脉冲过滤，短脉冲信号不会产生响应，而持久信号在短延迟后会产生响应。当持久脉冲结束时，输出的关闭将很快。与此相反的行为出现在具有快速响应和延迟关闭特性的加和门的情况下，这在[[大肠杆菌]]的鞭毛系统中得到了证明。&amp;lt;ref name=&amp;quot;kal1&amp;quot;&amp;gt;{{cite journal |vauthors=Kalir S, Mangan S, Alon U |title=A coherent feed-forward loop with a SUM input function prolongs flagella expression in ''Escherichia coli'' |journal=Mol. Syst. Biol. |volume=1 |pages=E1–E6 |year=2005 |pmid=16729041 |pmc=1681456 |doi=10.1038/msb4100010 |issue=1}}&amp;lt;/ref&amp;gt;在[[基因调控网络]]的重头进化中，对于滤除理想化的短信号脉冲作为进化压，C1-FFLs已经在计算上被证明可以进化出来。但是对于非理想化的噪声，不同拓扑结构前馈调节的动态系统将被优先考虑。 &amp;lt;ref&amp;gt;{{cite journal |last1=Xiong |first1=Kun |last2=Lancaster |first2=Alex K. |last3=Siegal |first3=Mark L. |last4=Masel |first4=Joanna |title=Feed-forward regulation adaptively evolves via dynamics rather than topology when there is intrinsic noise |journal=Nature Communications |date=3 June 2019 |volume=10 |issue=1 |pages=2418 |doi=10.1038/s41467-019-10388-6|pmid=31160574 |pmc=6546794 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===非一致前馈回路类型一(I1-FFL)===&lt;br /&gt;
I1-FFL是一个脉冲生成器和响应加速器。I1-FFL的两种信号通路作用方向相反，一种通路激活Z，而另一种抑制Z。完全的抑制会导致类似脉冲的动力学行为。另外有实验证明，它可以类似于NAR模体起到响应加速器的作用。与NAR模体的不同之处在于，它可以加速任何基因的响应，而不必是转录因子。&amp;lt;ref name=&amp;quot;man3&amp;quot;&amp;gt;{{cite journal |vauthors=Mangan S, Itzkovitz S, Zaslaver A, Alon U |title=The incoherent feed-forward loop accelerates the response-time of the gal system of ''Escherichia coli'' |journal=J. Mol. Biol. |volume=356 |issue=5 |pages=1073–81 |date=March 2006 |pmid=16406067 |doi=10.1016/j.jmb.2005.12.003 |citeseerx=10.1.1.184.8360 }}&amp;lt;/ref&amp;gt;I1-FFL网络还有另外一个功能：在理论和实验上都有证明I1-FFL可以生成非单调的输入函数，无论在人工合成的&amp;lt;ref name=&amp;quot;ent1&amp;quot;&amp;gt;{{cite journal |vauthors=Entus R, Aufderheide B, Sauro HM |title=Design and implementation of three incoherent feed-forward motif based biological concentration sensors |journal=Syst Synth Biol |volume=1 |issue=3 |pages=119–28 |date=August 2007 |pmid=19003446 |pmc=2398716 |doi=10.1007/s11693-007-9008-6 }}&amp;lt;/ref&amp;gt;还是自然的系统中。 &amp;lt;ref name=&amp;quot;kap1&amp;quot;&amp;gt;{{cite journal |vauthors=Kaplan S, Bren A, Dekel E, Alon U |title=The incoherent feed-forward loop can generate non-monotonic input functions for genes |journal=Mol. Syst. Biol. |volume=4 |pages=203 |year=2008 |pmid=18628744 |pmc=2516365 |doi=10.1038/msb.2008.43 |issue=1}}&amp;lt;/ref&amp;gt; 最后，包含非一致前馈调控的基因生成物的表达单元对DNA模板的数量具有适应性，可以优于简单的组合本构启动子。&amp;lt;ref name=&amp;quot;ble1&amp;quot;&amp;gt;{{cite journal |vauthors=Bleris L, Xie Z, Glass D, Adadey A, Sontag E, Benenson Y |title=Synthetic incoherent feedforward circuits show adaptation to the amount of their genetic template |journal=Mol. Syst. Biol. |volume=7 |pages=519|year=2011 |doi=10.1038/msb.2011.49 |issue=1 |pmid=21811230 |pmc=3202791}}&amp;lt;/ref&amp;gt; 前馈调控比负反馈具有更好的适应性，并且基于RNA干扰的网络对DNA模板数具有最高的鲁棒性。&amp;lt;ref name=&amp;quot;ble1&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===多输出前馈回路===&lt;br /&gt;
在某些情况，相同的调控子X和Y可以调控同一系统中的多个Z基因。通过调节相互作用的强度，这些网络可以决定基因激活的时间顺序。这一点在[[大肠杆菌]]的鞭毛系统中有实验证据。&amp;lt;ref name=&amp;quot;kal2&amp;quot;&amp;gt;{{cite journal  |vauthors=Kalir S, McClure J, Pabbaraju K, etal |title=Ordering genes in a flagella pathway by analysis of expression kinetics from living bacteria |journal=Science |volume=292 |issue=5524 |pages=2080–3 |date=June 2001 |pmid=11408658 |doi=10.1126/science.1058758 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===单一输入模块(SIM)===&lt;br /&gt;
当单个调控子调控一组基因，并且没有其他的调控因素时，这样的模体叫做单一输入模块（SIM）。当很多基因合作执行某个功能时这是有用的，因为这些基因需要同步地被激活。通过调节相互作用的强度，可以编排它所调控的基因表达的时间顺序。&amp;lt;ref name=&amp;quot;zas1&amp;quot;&amp;gt;{{cite journal  |vauthors=Zaslaver A, Mayo AE, Rosenberg R, etal |title=Just-in-time transcription program in metabolic pathways |journal=Nat. Genet. |volume=36 |issue=5 |pages=486–91 |date=May 2004 |pmid=15107854 |doi=10.1038/ng1348|doi-access=free }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
在文献中，多输入模块（MIM）来自于SIM的扩展。但是二者的精确定义并不太一致。有一些尝试给出生物网络中规范模体的正交定义，也有一些算法去枚举它们，特别是SIM，MIM和2x2 MIM等。&amp;lt;ref&amp;gt;{{cite journal |vauthors=Konagurthu AS, Lesk AM |title=Single and Multiple Input Modules in regulatory networks |journal=Proteins |volume=73 |issue=2 |pages=320–324 |year=2008 |doi=10.1002/prot.22053|pmid=18433061 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===密集交盖调节网(DOR)===&lt;br /&gt;
这种类型的网络存在于多个调节子结合起来控制一组基因的情形，并且有多种调控的组合。这种模体出现在[[大肠杆菌]]的多种系统中，例如碳利用、厌氧生长、应激反应等。&amp;lt;ref name=&amp;quot;she1&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;boy1&amp;quot;/&amp;gt; 为了更好地理解这种网络，我们必须得到关于基因集成多种输入的方式的信息。Kaplan ''et al.''&amp;lt;ref name=&amp;quot;kap2&amp;quot;&amp;gt;{{cite journal |vauthors=Kaplan S, Bren A, Zaslaver A, Dekel E, Alon U |title=Diverse two-dimensional input functions control bacterial sugar genes |journal=Mol. Cell |volume=29 |issue=6 |pages=786–92 |date=March 2008 |pmid=18374652 |pmc=2366073 |doi=10.1016/j.molcel.2008.01.021 }}&amp;lt;/ref&amp;gt;绘制了[[大肠杆菌]]糖利用基因的输入函数，表现出各种各样的形状。&lt;br /&gt;
&lt;br /&gt;
==活动模体==&lt;br /&gt;
&lt;br /&gt;
有一个对网络模体的有趣概括：'''活动模体'''是在对节点和边都被量化标准的网络中可发现的【反复】的斑图。例如，当新城代谢的边以相应基因的表达量或【时间】来标注时，一些斑图在'''给定的'''底层网络结构里【是反复的】。&amp;lt;ref name=&amp;quot;agc&amp;quot;&amp;gt;{{cite journal |vauthors=Chechik G, Oh E, Rando O, Weissman J, Regev A, Koller D |title=Activity motifs reveal principles of timing in transcriptional control of the yeast metabolic network |journal=Nat. Biotechnol. |volume=26 |issue=11 |pages=1251–9 |date=November 2008 |pmid=18953355 |pmc=2651818 |doi=10.1038/nbt.1499}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==批判==&lt;br /&gt;
&lt;br /&gt;
关于拓扑子结构的一个（某种程度上隐含的）前提性假设是其具有特定的功能重要性。但这个假设最近遭到质疑，有人提出在不同的网络环境下模体可能表现出多样性，例如双扇模体，所以&amp;lt;ref name=&amp;quot;ad&amp;quot;&amp;gt;{{cite journal |vauthors=Ingram PJ, Stumpf MP, Stark J |title=Network motifs: structure does not determine function |journal=BMC Genomics |volume=7 |pages=108 |year=2006 |pmid=16677373 |pmc=1488845 |doi=10.1186/1471-2164-7-108 }} {{open access}}&amp;lt;/ref&amp;gt;模体的结构不必然决定功能，网络结构也不当然能揭示其功能；这种见解由来已久，可参见【Sin 操纵子】&amp;lt;/font&amp;gt;。&amp;lt;ref&amp;gt;{{cite journal |vauthors=Voigt CA, Wolf DM, Arkin AP |title=The ''Bacillus subtilis'' sin operon: an evolvable network motif |journal=Genetics |volume=169 |issue=3 |pages=1187–202 |date=March 2005 |pmid=15466432 |pmc=1449569 |doi=10.1534/genetics.104.031955 |url=http://www.genetics.org/cgi/pmidlookup?view=long&amp;amp;pmid=15466432}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
大多数模体功能分析是基于模体孤立运行的情形。最近的研究&amp;lt;ref&amp;gt;{{cite journal |vauthors=Knabe JF, Nehaniv CL, Schilstra MJ |title=Do motifs reflect evolved function?—No convergent evolution of genetic regulatory network subgraph topologies |journal=BioSystems |volume=94 |issue=1–2 |pages=68–74 |year=2008 |pmid=18611431 |doi=10.1016/j.biosystems.2008.05.012 }}&amp;lt;/ref&amp;gt;表明网络环境至关重要，不能忽视网络环境而仅从本地结构来对其功能进行推论——引用的论文还回顾了对观测数据的批判及其他可能的解释。人们研究了单个模体模组对网络全局的动力学影响及其分析&amp;lt;ref&amp;gt;{{cite journal |vauthors=Taylor D, Restrepo JG |title=Network connectivity during mergers and growth: Optimizing the addition of a module |journal=Physical Review E |volume=83 |issue=6 |year=2011 |page=66112 |doi=10.1103/PhysRevE.83.066112 |pmid=21797446 |bibcode=2011PhRvE..83f6112T |arxiv=1102.4876 }}&amp;lt;/ref&amp;gt;。而另一项近期的研究工作提出生物网络的某些拓扑特征能自然地引起经典模体的常见形态，让人不禁疑问：发生频率是否能证明模体的结构是出于其对所在网络运行的功能性贡献而被选择保留下的结果？&amp;lt;ref&amp;gt;{{cite journal|last1=Konagurthu|first1=Arun S.|last2=Lesk|first2=Arthur M.|title=Single and multiple input modules in regulatory networks|journal=Proteins: Structure, Function, and Bioinformatics|date=23 April 2008|volume=73|issue=2|pages=320–324|doi=10.1002/prot.22053|pmid=18433061}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal |vauthors=Konagurthu AS, Lesk AM |title=On the origin of distribution patterns of motifs in biological networks |journal=BMC Syst Biol |volume=2 |pages=73 |year=2008 |pmid=18700017 |pmc=2538512 |doi=10.1186/1752-0509-2-73 }} {{open access}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
模体的研究主要应用于静态复杂网络，而时变复杂网络的研究&amp;lt;ref&amp;gt;Braha, D., &amp;amp; Bar‐Yam, Y. (2006). [https://static1.squarespace.com/static/5b68a4e4a2772c2a206180a1/t/5c5de3faf4e1fc43e7b3d21e/1549657083988/Complexity_Braha_Original_w_Cover.pdf From centrality to temporary fame: Dynamic centrality in complex networks]. Complexity, 12(2), 59-63. &amp;lt;/ref&amp;gt;就网络模体提出了重大的新解释，并介绍了'''时变网络模体'''的概念。Braha和Bar-Yam&amp;lt;ref&amp;gt; Braha D., Bar-Yam Y. (2009) [https://s3.amazonaws.com/academia.edu.documents/4892116/Adaptive_Networks__Theory__Models_and_Applications__Understanding_Complex_Systems_.pdf?response-content-disposition=inline%3B%20filename%3DRedes_teoria.pdf&amp;amp;X-Amz-Algorithm=AWS4-HMAC-SHA256&amp;amp;X-Amz-Credential=AKIAIWOWYYGZ2Y53UL3A%2F20191111%2Fus-east-1%2Fs3%2Faws4_request&amp;amp;X-Amz-Date=20191111T173250Z&amp;amp;X-Amz-Expires=3600&amp;amp;X-Amz-SignedHeaders=host&amp;amp;X-Amz-Signature=89d08c9e92b88ed817e4eb0f87c480757ef79c4b865919a5e0890cbefa164c61#page=55 Time-Dependent Complex Networks: Dynamic Centrality, Dynamic Motifs, and Cycles of Social Interactions]. In: Gross T., Sayama H. (eds) Adaptive Networks. Understanding Complex Systems. Springer, Berlin, Heidelberg &amp;lt;/ref&amp;gt;研究了&lt;br /&gt;
本地模体结构在时间依赖网络/时变网络的动力学，发现的一些反复模式有望成为社会互动周期的经验论据。他们证明了对于时变网络，其本地结构是时间依赖的且可能随时间演变，可作为对复杂网络中稳定模体观及模体表达观的反论，Braha和Bar-Yam还进一步提出，对时变本地结构的分析有可能揭示系统级任务和功能方面的动力学的重要信息。&lt;br /&gt;
&lt;br /&gt;
==See also==&lt;br /&gt;
* [[Clique (graph theory)]]&lt;br /&gt;
* [[Graphical model]]&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
{{reflist|2}}&lt;br /&gt;
&lt;br /&gt;
==External links==&lt;br /&gt;
&lt;br /&gt;
* [http://www.weizmann.ac.il/mcb/UriAlon/groupNetworkMotifSW.html A software tool that can detect network motifs]&lt;br /&gt;
* [http://www.bio-physics.at/wiki/index.php?title=Network_Motifs bio-physics-wiki NETWORK MOTIFS]&lt;br /&gt;
* [http://theinf1.informatik.uni-jena.de/~wernicke/motifs/ FANMOD: a tool for fast network motif detection]&lt;br /&gt;
* [http://mavisto.ipk-gatersleben.de/ MAVisto: network motif analysis and visualisation tool]&lt;br /&gt;
* [https://www.msu.edu/~jinchen/ NeMoFinder]&lt;br /&gt;
* [http://people.cs.uchicago.edu/~joshuag/index.html Grochow–Kellis]&lt;br /&gt;
* [http://lbb.ut.ac.ir/Download/LBBsoft/MODA/ MODA]&lt;br /&gt;
* [http://lbb.ut.ac.ir/Download/LBBsoft/Kavosh/ Kavosh]&lt;br /&gt;
* [http://apps.cytoscape.org/apps/cytokavosh CytoKavosh]&lt;br /&gt;
* [http://www.dcc.fc.up.pt/gtries/ G-Tries]&lt;br /&gt;
* [http://www.ft.unicamp.br/docentes/meira/accmotifs/ acc-MOTIF detection tool]&lt;br /&gt;
&lt;br /&gt;
[[Category:Gene expression]]&lt;br /&gt;
[[Category:Networks]]&lt;/div&gt;</summary>
		<author><name>木子二月鸟</name></author>
	</entry>
</feed>