Emergence in Random Noisy Environments
Yilun Shang

TL;DR
This paper studies how different dynamical systems exhibit emergent behavior when subjected to random environmental noise, providing conditions for emergence and building on flocking models by Cucker and Smale.
Contribution
It introduces new sufficient conditions for emergence in dynamical systems under stochastic perturbations, inspired by foundational flocking models.
Findings
Conditions for nearly-emergence identified
Analysis applicable to multiple dynamical systems
Builds on and extends flocking model theories
Abstract
We investigate the emergent behavior of four types of generic dynamical systems under random environmental perturbations. Sufficient conditions for nearly-emergence in various scenarios are presented. Recent fundamental works of F. Cucker and S. Smale on the construction and analysis of flocking models directly inspired our present work.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed Control Multi-Agent Systems · Diffusion and Search Dynamics · Evolutionary Game Theory and Cooperation
**Emergence in Random Noisy Environments
**Yilun Shang111Department of Mathematics, Shanghai Jiao Tong University, Shanghai 200240, CHINA. email: [email protected]
Abstract
We investigate the emergent behavior of four types of generic dynamical systems under random environmental perturbations. Sufficient conditions for nearly-emergence in various scenarios are presented. Recent fundamental works of F. Cucker and S. Smale on the construction and analysis of flocking models directly inspired our present work.
Keywords: emergence; Cucker-Smale model; dynamical system; flocking; multi-agent system; consensus problems; random noise; linguistic evolution.
AMS subject classification: 34F05, 37N35, 39A11, 93C15, 93C73, 92D50, 92D40, 91C20
1. Introduction
The emergent behaviors of a large number of autonomous interacting agents such as flocking/schooling/swarming/herding in birds/fishes/bacterica/animals [20, 13, 24], multi-agent cooperative coordination in mobile networks [1, 3] and emergence of a common language in primitive societies [9, 15, 19, 14] have been attracting great research attentions since the last two decades from biologists, computer scientists, physicists, sociologists, engineers and mathematicians.
Recently, Cucker and Smale [8] have proposed a remarkable model aiming to exploring the flocking phenomenon and mathematical analysis is performed to show the convergence results only depend on some initial states of the population. This notable feature is in contrast with the previous models (e.g. the so called Vicsek model [24, 13]) where convergence relies on the global behavior of the agents’ trajectories (or on the neighborhood graphs of the underlying dynamical systems), which are quite hard to verify in general. The same authors [7] extend the model later to a more general setting beyond flocking. [21] further develops a hierarchical leadership architecture in the Cucker-Smale flocking model. The work in [5] focuses on a situation where uniform or Gaussian noises are involved in the environments. A hydrodynamic description and the mean-field limit of this very model are also provided in [10].
The starting point of our present work is directly motivated by the aforementioned series work. Primarily, we want to refine the rudimental results (in the noisy environment) in [5] and extend them to more general scenarios such as those discussed by [7]; and try to shed some light on the understanding of various emergence behaviors observed in diverse natural, social and man-made complex systems [12, 22]. To do so, we first introduce four types of non-autonomous, nonlinear dynamical systems; two ( I(D) and II(D) ) for discrete time and two ( I(C) and II(C) ) for continuous time. In each case, we provide a convergence analysis. Systems I(D) and I(C) are adapted from [7, 8] and the underlying idea stems from the birds flocking in a noisy environment. Whereas the original idea behind systems II(D) and II(C) is the linguistic evolution with some possible fluctuations in a primitive society. The random noises considered here may reflect the change of the environment which is usually unclear to the objects. Moreover, information interaction among agents may be contaminated or corrupted by errors. Hence, it becomes significant to analyze systems in the presence of random noises. We mention that the systems tackled in this paper are quintessential in the sense of reflecting some typical mechanisms behind emergence (see Remark 1 in Section 2.1), but by no means limited to flocking or language evolution since we will treat them in a quite general manner with emphasis on the methodology. Concrete examples will follow and illustrate the strength of our generic frameworks. Some other related work about emergent behaviors under random environmental perturbation can be found in e.g. [17, 16, 18, 23] and references therein.
The rest of this paper is organized as follows. In Section 2, we will study the discrete time models I(D), II(D) and the statement of main results in this section appears at Section 2.2. Section 3 is devoted to the continuous counterparts I(C), II(C) and see Section 3.2 for the statement of main results in the continuous case. We then draw our conclusion and discuss future direction in Section 4.
2. Discrete-time emergence
Let . We assume the population under consideration consists of agents throughout the paper.
2.1 Models setup (I(D), II(D))
We shall first introduce the dynamical system I(D), which is developed similarly with that considered in [7].
Suppose and are two given inner product spaces whose elements are denoted as and , respectively. Let and represent two kinds of characteristics of the agents at time instant . Convergence of (or ) is naturally understood as entrywise convergence as approaches infinity. Let signify the diagonal of , that is, . Denote and fix an inner product in , which induces a norm . (Here in the discrete case, we do not really need an inner; what we want is should be a normed space. The same remark applies to and .) Since is a finite dimensional space, for some if and only if , where for . In what follows, we denote norms in all different spaces as with some ambiguity, but the proper meaning will be clear in the context.
For , , consider the following dynamical system:
[TABLE]
Here is the time step and we shall denote in the sequel , and for brevity. Take herein. We now explain the notations in system I(D). Let be a Lipschitz or operator satisfying, for some , , that
[TABLE]
for all , . Let be an operator satisfying, for some , , that
[TABLE]
for all . The operator norm in (2) is defined as . Let be a random element. is some probability space and is the Borel -algebra on . We assume is independent and identically distributed for different . Notice that is a random variable and let for be the distribution function of .
Next, we present our dynamical system II(D) as follows. The spaces are defined as before. For , , consider the following dynamical system:
[TABLE]
Here are the time steps w.r.t. and . Take and we denote , , and . In light of these notations, the system II(D) can be rewritten as follows
[TABLE]
In analogy with the system I(D), suppose and are two operators satisfying, for some , , that
[TABLE]
for all , . Let and be two random elements as before. We assume is independent and identically distributed for different and so is . Furthermore, is assumed to be independent with . The distribution functions of random variables and are defined as and for , respectively. It is worth noting that we do not ask the time scales , to be the same; and the coupled system may thus work in a kind of asynchronous way.
Before going further, we give a definition for nearly-emergence that we adopt in this paper.
Definition 1.* Let , , , (or )-nearly-emergence occurs for the population if (or ).*
Clearly, the exact emergence is no longer possible due to the random perturbation.
Remark 1.* The two features and of agents in the system I(D) are asymmetric and is the object whose emergence behavior is of interest. In the system II(D), the status of and is symmetric and both emergence behaviors may be of interest. The same can be said for the continuous case in Section 3 below.*
2.2 Main results
We define several constants that are only related with the initial state of the population.
For system I(D):
[TABLE]
[TABLE]
For system II(D):
[TABLE]
The main results in this section are stated as follows.
Theorem 1.* For dynamical system I(D), we assume h<\min\Big{\{}\frac{1}{G},\ \frac{1}{2^{1-\gamma}C||y(0)||^{\delta}}\big{(}\frac{G}{2\mathcal{H}_{0}}\big{)}^{\frac{1-\gamma}{\beta}}\Big{\}}, and one of the following hypotheses holds:
(i) ,
(ii), and ||y(0)||<\big{(}\frac{G}{2CQ(\delta)}\big{)}^{\frac{1}{\delta}},
(iii), and \big{(}\frac{1}{a(\beta+\gamma)}\big{)}^{\frac{1}{\beta+\gamma-1}}\frac{\beta+\gamma-1}{\beta+\gamma}>b+h\big{(}(\frac{\beta+\gamma}{\beta+\gamma-1})b\big{)}^{\gamma}\frac{aG}{2Q(\delta)}.
Then, for , -nearly-emergence occurs in a number of iterations bounded by T_{0}:=\frac{2U_{0}^{\beta}}{hG}\ln\big{(}\frac{||y(0)||}{\nu}\big{)} with probability at least . In addition, if , let T_{1}:=\frac{2U_{0}^{\beta}}{\delta hG}\ln\big{(}\frac{aU_{0}^{\beta+\gamma}}{\mu}\big{)}, then the events and -nearly-emergence occurs in a number of iterations bounded by hold simultaneously with probability at least .*
Theorem 2.* For dynamical system II(D), we assume and . Then, for , with T_{2}:=\frac{1}{h_{1}\mathcal{H}_{1}}\ln\big{(}\frac{||x(0)||}{\mu}\big{)} and T_{3}:=\frac{1}{h_{2}\mathcal{H}_{2}}\ln\big{(}\frac{||y(0)||}{\nu}\big{)}, -nearly-emergence and -nearly-emergence both occur in a number of iterations bounded by with probability at least .*
We now give some concrete substances to illustrate emergence behaviors of the general models I(D) and II(D).
For the system I(D), take with standard inner product , and . For , define the inner product on as . Here represents the spatial positions of agents (e.g. birds, fishes, robots,…) and their velocities both projected to the subspace [8]. Given , let the matrix has entries . Let be the diagonal matrix whose th diagonal element is and . Then is the Laplacian of [4]. For , take , , here is the identity matrix of order , and let the noise term has the uniform distribution for some or the Gaussian distribution in the model I(D), and then we recover the situations encountered in [5]. Thm.1 in [5] is clearly a special case of Theorem 1 (and note that we really said more). Other kinds of flocking scenarios such as flocking with unrelated pairs and flocking with leader-follower schemes can also be dealt with under our present framework (c.f. [7] Sect. 3). We mention here that the asymmetric conclusions of and in Theorem 1 indeed give what we desire in a flocking phenomenon; see [8] (Rem. 2).
For the system II(D), let be the diagonal of and take with inner product defined as above. Let be the space of languages with some appropriate distance defined on it (c.f. [9]); and the metric of is inherited from that of . Given , let , be the matrices with entries and . are some bounded non-increasing functions. For , take and with , in the model II(D). Here and are diagonal matrices defined similarly as above. Computation of the distributions of and from some proper random noises , is a routine [2]. Here is interpreted as the geographical positions of agents projected to and as the space of languages projected to . This specification of system II(D) can be used to model emergence behavior in linguistic evolution, since each agent tends to move to others using similar languages and meanwhile the influence from other agents’ languages decreases according to distances [8] (Sect. 6).
2.3 Proof of Theorem 1
The proof closely follows that of [5], and we prove Theorem 1 through some intermediate steps.
Proposition 1.* Suppose , and for . Then we have ||y[t]||\leq\big{(}1-\frac{hG}{(1+||x[t-1]||)^{\beta}}+h\mathcal{H}_{0}\big{)}||y[t-1]|| for . Hence, for , ||y[t]||\leq||y(0)||\prod_{i=0}^{t-1}\big{(}1-\frac{hG}{(1+||x[i]||)^{\beta}}+h\mathcal{H}_{0}\big{)}.*
Proof. By (2), we have
[TABLE]
The following proposition is taken from [6].
Proposition 2.([6]) Let and . Then the equation has a unique positive zero . Moreover, and for .
Proposition 3.* Let or . Suppose for and h<\min\Big{\{}\frac{1}{G},\ \frac{1}{2^{1-\gamma}C||y(0)||^{\delta}}\big{(}\frac{G}{2\mathcal{H}_{0}}\big{)}^{\frac{1-\gamma}{\beta}}\Big{\}}, and one of the following hypotheses holds:
(i) ,
(ii), and ||y(0)||<\big{(}\frac{G}{2CQ(\delta)}\big{)}^{\frac{1}{\delta}},
(iii), and \big{(}\frac{1}{a(\beta+\gamma)}\big{)}^{\frac{1}{\beta+\gamma-1}}\frac{\beta+\gamma-1}{\beta+\gamma}>b+h\big{(}(\frac{\beta+\gamma}{\beta+\gamma-1})b\big{)}^{\gamma}\frac{aG}{2Q(\delta)}.
Then , for , and ||y[t]||\leq||y(0)||\big{(}1-\frac{hG}{2U_{0}^{\beta}}\big{)}^{t}. If , then as , and moreover, there exists such that as , and ||x[t]-\hat{x}||\leq aU_{0}^{\beta+\gamma}\big{(}1-\frac{hG}{2U_{0}^{\beta}}\big{)}^{\delta t} for .*
Proof. Let . Assume . Since by the assumptions, let . For , let be the point maximizing in . Then by Proposition 1, for and we have
[TABLE]
By Proposition 1, for ,
[TABLE]
Take , and then we have
[TABLE]
Let , then the above inequality becomes .
(i) Assume . By Proposition 2 and the definition of , we get . Thereby for , . This implies
[TABLE]
for . Hence by Proposition 1 and is decreasing,
[TABLE]
This is in contradiction with the definition of , therefore and , for all . It follows from Proposition 1 that for ,
[TABLE]
For , by employing (1) we obtain
[TABLE]
When , we take to see that there exists which is the limit of . Let in the above expression, we have
[TABLE]
(ii) Assume . Then the inequality becomes
[TABLE]
By the assumption and definition of , we get . Thereby, for
[TABLE]
We now proceed as in case (i).
(iii) Assume . has a unique zero and . Since for , is a convex function in and has two positive zero , satisfying .
For , let . We then have , which suggests . Now assume there exists such that and denote be the first such . Hence, and for . Let be the intersection of the axis with the line joining and , (c.f. Fig.1 in [5]). Straightforward calculation yields .
By the definition of , for
[TABLE]
We get , and accordingly, since . By the Lagrange intermediate value theorem, there is such that . Thereby since . Then . On the other hand,
[TABLE]
which together with the above expression gives . This is, however, contrary to our hypothesis. Therefore, for all , and by noting inequality (4). We then obtain,
[TABLE]
for . Now we proceed as in case (i).
Proof of Theorem 1. Suppose the conditions of Proposition 3 hold for some . Then we have ||y[t]||\leq||y(0)||\big{(}1-\frac{hG}{2U_{0}^{\beta}}\big{)}^{t} for and ||x[\tau]-x[t]||\leq aU_{0}^{\beta+\gamma}\big{(}1-\frac{hG}{2U_{0}^{\beta}}\big{)}^{\delta t} for . If , ||x[t]-\hat{x}||\leq aU_{0}^{\beta+\gamma}\big{(}1-\frac{hG}{2U_{0}^{\beta}}\big{)}^{\delta t} for . By the proof of Proposition 3 and straightforward calculations, we have when ; when ; and when . If -nearly-emergence has not occurred, then , wherefore by the definition of function ,
[TABLE]
Since are i.i.d. for varying , we get
[TABLE]
which yields the first part of the conclusions. Likewise, we have
[TABLE]
We then conclude the proof.
2.4 Proof of Theorem 2
Proposition 4.* Suppose , , and for ; for . Then we have ||x[t_{1}]||\leq\big{(}1-\frac{h_{1}G_{1}}{(1+||y[t_{1}-1]||)^{\beta_{1}}}+h_{1}\mathcal{H}_{1}\big{)}||x[t_{1}-1]|| for and ||y[t_{2}]||\leq\big{(}1-\frac{h_{2}G_{2}}{(1+||x[t_{2}-1]||)^{\beta_{2}}}+h_{2}\mathcal{H}_{2}\big{)}||y[t_{2}-1]|| for . Consequently, for , ||x[t_{1}]||\leq||x(0)||\prod_{i=0}^{t-1}\big{(}1-\frac{h_{1}G_{1}}{(1+||y[i]||)^{\beta_{1}}}+h_{1}\mathcal{H}_{1}\big{)}; and for , ||y[t_{2}]||\leq||y(0)||\prod_{j=0}^{t-1}\big{(}1-\frac{h_{2}G_{2}}{(1+||x[j]||)^{\beta_{2}}}+h_{2}\mathcal{H}_{2}\big{)}.*
Proof. The proof readily follows by utilizing condition (3).
The following proposition is critical to the proof of Theorem 2.
Proposition 5.* Let . Suppose for ; for and , . Then, for , and .*
Proof. Denote for brevity. Let . Assume . Since by the assumptions, let . For , let be the point maximizing in . Analogously, we define and assume . Let . For , let be the point maximizing in .
Then by Proposition 4, for and we have
[TABLE]
By exploiting Proposition 4, for ,
[TABLE]
Likewise, for and we have
[TABLE]
And for , we have
[TABLE]
Now we shall compare with to deduce contradictions. If . We take and get from (6), . This is in contradiction with definition of . Similarly, if , we can also deduce a contradiction. Now let’s consider the case . If so, take in (5) and in (6). We then have and . These inequalities imply . That is to say, for all , and . Combining these with Proposition 4, we derive
[TABLE]
Here is the contradiction as in the first case above. It is at this stage that we may conclude that and must not both exist.
Without loss of generality, we assume does not exist, i.e. . For , . Hence, and . From (5), we have . If exists, we then take in the above inequality to get . It is in contradiction with the definition of . Therefore, does not exist either. Now we can proceed as above to get for , by using (6).
Proof of Theorem 2. Suppose the conditions of Proposition 5 hold for some . Then we have and for . By direct calculations, we get when and when . If -nearly-emergence and -nearly-emergence have not occurred at time and resp., then and . Whence,
[TABLE]
and
[TABLE]
Since are i.i.d. for varying , , and is independent with , by letting be the independent product of and (c.f. [2]), we get
[TABLE]
which concludes the proof.
3. Continuous-time emergence
3.1 Models setup (I(C), II(C))
In principle, by letting the time steps , approach zero, we may derive the continuous counterparts of systems I(D) and II(D). We shall, however, make some modifications for technical reason and it is at this time the inner product structures of spaces take effect.
Let , for , , consider the following dynamical system:
[TABLE]
Here, as in the system I(D), is a Lipschitz or operator. We now require, for some , , that
[TABLE]
for all , . Denote as the space of real matrices. Let be a Lipschitz or operator with . can be seen as a linear transformation on by mapping to . Here, is the entry of matrix . For , define . We impose the following two hypotheses on : (i) For , , . (ii) there exists such that
[TABLE]
for all . It is easy to see from (i) that induces a linear transformation on , which will also be denoted as for notational simplicity. Let be a continuous time stochastic process defined on some probability space taking value in . Let be a real function (not necessarily a distribution function) such that , for . We may observe that is non-decreasing w.r.t. while non-increasing w.r.t. .
Next, we introduce a continuous version of II(D). For , , consider the following dynamical system:
[TABLE]
Here operators are given similarly as above with defined on and on . For , , define and . The corresponding hypothesis (ii) above becomes (ii*′*): there exist , such that
[TABLE]
for all , . Let and be two continuous time stochastic processes, which are independent with each other. Let , be real functions such that , for .
For notational convenience we sometimes write , , and .
3.2 Main results
As in the discrete case, we define several constants which are only dependent on the initial state of the population.
For system I(C):
[TABLE]
[TABLE]
[TABLE]
For system II(C):
[TABLE]
The main results in this section are stated as follows.
Theorem 3.* Let and , then there exists a unique solution of the dynamical system I(C) for all . Moreover, assume one of the following hypotheses holds:
(i) ,
(ii), and ||y(0)||<\big{(}\frac{(\delta K)^{2}}{2^{1+\gamma+2\beta}((1-\gamma)C)^{2}}\big{)}^{\frac{1}{2\delta}},
(iii), and \big{(}\frac{1}{a\alpha}\big{)}^{\frac{1}{\alpha-1}}\frac{\alpha-1}{\alpha}>b.
Then, for , -nearly-emergence occurs before time T_{0}:=\frac{2B_{0}^{\beta}}{K}\ln\big{(}\frac{||y(0)||}{\nu}\big{)} with probability at least . In addition, if , let T_{1}:=\frac{2B_{0}^{\beta}}{K\delta}\ln\big{(}\frac{B_{1}}{\mu}\big{)}, then the events and -nearly-emergence occurs before time hold simultaneously with probability at least .*
As in Section 2.2, we may readily recover the continuous-time result in [5] by letting be the Laplacian of , for ; and taking and the coordinate processes of as independent smoothed Wiener processes.
Theorem 4.* Let and , then there exists a unique solution of the dynamical system II(C) for all . Furthermore, for , with T_{2}:=\frac{2(1+||y(0)||^{2})^{\beta_{2}}}{K_{2}}\ln\big{(}\frac{||x(0)||}{\mu}\big{)} and T_{3}:=\frac{2(1+||x(0)||^{2})^{\beta_{1}}}{K_{1}}\ln\big{(}\frac{||y(0)||}{\nu}\big{)}, either -nearly-emergence or -nearly-emergence occurs before time with probability at least
.*
Compared with Theorem 2, the last result is weaker due to the fact that in the continuous case the stochastic processes do not possess “independence property” among different “time steps”. However, if the noise does not impose on both equations of system II(C), we have the following corollary.
Corollary 1.* Suppose . Under the assumptions of Theorem 4, the events -nearly-emergence occurs before time and -nearly-emergence occurs before time hold simultaneously with probability at least . An analogous result holds for the case .*
We mention that it is possible to have results similar with Corollary 1 when is small enough or possesses independent increments.
3.3 Proof of Theorem 3
The main procedure of the proof follows that of [5]. Let , and .
Proposition 6.* Suppose for , . Then we have for .*
Proof. The proof parallels with that of [5] (Prop. 4), by using assumption (9). Hence we omit it.
Proposition 7.* Suppose for , . Then we have*
[TABLE]
for .
Proof. Mimicking the proof of [7] (Prop. 6) by employing Proposition 6. We leave this proof as an exercise for the reader.
Proposition 8.* Suppose for , . Assume one of the following hypotheses holds:
(i) ,
(ii), and \Lambda(0)<\big{(}\frac{(\delta K)^{2}}{2^{1+\gamma+2\beta}((1-\gamma)C)^{2}}\big{)}^{\frac{1}{\delta}},
(iii), and \big{(}\frac{1}{a\alpha}\big{)}^{\frac{1}{\alpha-1}}\frac{\alpha-1}{\alpha}>b.
Then for , and . If , then as and there exists such that as and for .*
Proof. Let . Assume . Since by the assumptions, let . Let and be the point maximizing in . Then by Proposition 6,
[TABLE]
Since , , we deduce
[TABLE]
Thereby Proposition 7 implies,
[TABLE]
Take in the above expression, and then we have
[TABLE]
Let . Then inequality (11) becomes with . To complete the proof, we may argue as in Proposition 3 dividing into three cases and consult the proof of Thm. 2 of [7].
Proof of Theorem 3. The existence of a unique solution for each follows from [11] (Ch. 8).
By assumption, we have for , . Define and take . To prove the first claim in Theorem 3, it suffices to proof
[TABLE]
Take . Assume . Then there is some such that . Wherefore, on the interval . In particular, . Since , Proposition 8 holds for . Then for , we have . As is continuous, we obtain . This is a contradiction, which then finishes the proof of (12).
Next, by the proof of Proposition 8 and straightforward calculations (much the same way as in the proof of Theorem 1), we have when ; and when . We then conclude the proof by replace with in the above argument.
3.4 Proof of Theorem 4
Denote and . In the sequel, we will suppress the subscript of for brevity.
Proposition 9.* Suppose for and for . Then for , ; and for , .*
Proof. Let . Therefore, by using (10) we have
[TABLE]
Integrating the above inequality from [math] to deduces the first result. The other can be proved likewise.
Proposition 10.* Suppose for ; and for . Then we obtain for , and .*
Proof. Denote . Let . Assume . Since by the assumptions, let . Let and be the point maximizing in . Analogously, we define and assume . Let . Let and be the point maximizing in .
Since , , and then we have
[TABLE]
Likewise, since , . We then get
[TABLE]
By Proposition 9, for
[TABLE]
and similarly, for , Now we can proceed as in Proposition 5 to show neither nor exists. Hence, for all , , i.e. . Combining this with expression (13), we obtain , which concludes the first part of the proposition. The other inequality can be derived similarly.
Proof of Theorem 4. The existence of a unique solution for each , follows from [11] (Ch. 8).
By the assumptions, we have for , , . Take and in the above expression, respectively. By the independence of and (and let as in the proof of Theorem 2), we obtain
[TABLE]
Define and . It now suffices to proof
[TABLE]
Take , and
. Assume . Then there are some such that . Accordingly, , on the interval . In particular, and . Since and , Proposition 10 holds for . Then for , we have and . As are continuous, we obtain and . Now we obtain a contradiction, which then completes the proof of (15).
4. Conclusion
In this paper, we have studied the emergent behavior of four dynamical systems (I(D), I(C), II(D), II(C)) in the presence of random fluctuation contained in the environments. In all these cases, “nearly-emergence” phenomena of interested objectives are shown under certain conditions on the systems and the noises. Our results are presented in a quite general setting and reveal some intrinsic mechanisms of emergence which come up in a variety of disciplines [12]. We will extend the results herein onto other dynamical systems and different kinds of random environment will be treated in future work.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. Aldana, C. Huepe, Phase transitions in self-driven many-particle systems and related nonequilibrium models: a network approach. J. Stat. Phys. , 112(2003) pp.135–153
- 2[2] P. Billingsley, Probability and Measure . John Wiley & Sons, New York, 1995
- 3[3] Y.-L. Chuang, M. R. D’Orsogna, D. Marthaler, A. L. Bertozzi, L. Chayes, State transitions and the continuum limit for a 2D interacting, self-propelled particle system. Physica D , 232(2007) pp.33–47
- 4[4] F. Chung, Spectral Grapph Theory . AMS, Providence, 1997
- 5[5] F. Cucker, E. Mordecki, Flocking in noisy environments. Journal des Mathématiques Pures et Appliquées , 89(2008) pp.278-296
- 6[6] F. Cucker, S. Smale, Best choices for regularization parameters in learning theory. Found. Comput. Math. , 2(2002) pp.413–428
- 7[7] F. Cucker, S. Smale, On the mathematics of emergence. Japan J. Math. , 2(2007) pp.197–227
- 8[8] F. Cucker, S. Smale, Emergent behavior in flocks. IEEE Trans. on Autom. Control , 52(2007) pp.852–862
