Presentation is loading. Please wait.

Presentation is loading. Please wait.

A Mathematical Formalism for Agent- Based Modeling 22 nd Mini-Conference on Discrete Mathematics and Algorithms Clemson University October 11, 2007 Reinhard.

Similar presentations


Presentation on theme: "A Mathematical Formalism for Agent- Based Modeling 22 nd Mini-Conference on Discrete Mathematics and Algorithms Clemson University October 11, 2007 Reinhard."— Presentation transcript:

1 A Mathematical Formalism for Agent- Based Modeling 22 nd Mini-Conference on Discrete Mathematics and Algorithms Clemson University October 11, 2007 Reinhard Laubenbacher Virginia Bioinformatics Institute and Mathematics Department Virginia Tech

2 Large-scale agent-based simulations present several challenges: Code verification Parallel computation Analysis of dynamics Porting to different platforms A rigorous formalism is needed to develop non-heuristic approaches to these challenges.

3 Existing formalisms for agent-based simulations: Cellular automata Hopfield networks Communicating finite state machines Petri nets

4 Polynomial dynamical systems Let k be a finite field and f 1, …, f n  k[x 1,…,x n ] f = (f 1, …, f n ) : k n → k n is an n-dimensional polynomial dynamical system over k. Natural generalization of Boolean networks. Fact: Every function k n → k can be represented by a polynomial, so all finite dynamical systems k n → k n are polynomial dynamical systems.

5 Example. k = F 2. Let f 1 = x 1 +x 2 +x 3 +x 4, f 2 = x 1 +x 2, f 3 = x 1 +x 3, f 4 = x 1 +x 4. The dependency graph

6 Dynamics with parallel update:

7 Sequential variable update: Let π=(a,b,c, …, x, y, z) be a permutation of 1, 2, …, n. Let f π = f z ◦f y ◦ … ◦f b ◦f a : k n → k n. Sequential update is motivated either by features in the system to be modeled or in the way a model simulation is computed. General case: Use words in 1, …,n rather than permutations xxyaaaabzbz

8 Dynamics with sequential update ( ):

9 Example k = F 3 = {0, 1, 2}, n = 3 f 1 = x 1 x 2 2 +x 3, f 2 = x 2 +x 3, f 3 = x 1 2 +x 2 2. Dependency graph (wiring diagram)

10

11 Stochastic systems: Choose random update order at each update step Choose random local update function at each step Important for various applications, e.g., parallel computation, biochemical network models, etc.

12 Questions How does the dependency graph topology affect dynamics? How does the update order affect dynamics? How does the function structure affect dynamics? How does the probability distribution on update orders affect dynamics?

13 f M = (~R)  ( ~G ) f A = E  (L  B) f B = M f R = ~A f L = P  E f P = M MR P B A L Hard to determine (more information) Easier to find (less information) Network topology Network dynamics ? Phase space obtained using Discrete Visualizer of Dynamics (dvd.vbi.vt.edu) Model

14 - Distance to PF of a network: least number of changes in sign needed to make it PF (to get rid of negative feedback loops). Terminology Example: G 0 is a PF network; PF distance is 0. - Positive-feedback network (PF): no odd parity directed cycles (negative feedback loops). G0G0 G2G2 G1G1 Distance to PF = “number of independent negative feedback loops” G 1 is not a PF network; PF distance is 1. G 2 is not a PF network; PF distance is 2.

15 Results (with A. Jarrah, E. Sontag, A. Veliz-Cuba) Histograms for the slopes (for n=5) 99.98% have negative slope for the number of limit cycles 99.99% have positive slope for the length of limit cycles As PF-distance increases: fewer and larger attractors

16 Definition. The update graph U(G) of a system with dependency graph G has a nodes the permutations of 1, …, n. Two permutations are connected by an edge if they differ by a transposition of two adjacent elements and the corresponding nodes in G are not connected by an edge.

17 Theorem (Barrett, Mortveit, Reidys). There is a 1-1 correspondence between the set of connected components of U(G) and the set of acyclic orientations of G. Theorem (B., M., R.). This provides a sharp upper bound (for Boolean systems) for the number of different systems one obtains by varying the update order.

18 Theorem. (Garcia, Jarrah, L.) A similar upper bound is also valid for update orders given by general words.

19 Nested canalyzing functions (joint work with A. Jarrah and B. Raposa, Physica D)

20 Nested canalyzing functions

21 A non-canalyzing Boolean network f1 = x4 f2 = x4+x3 f3 = x2+x4 f4 = x2+x1+x3

22 A nested canalyzing Boolean network g1 = x4 g2 = x4*x3 g3 = x2*x4 g4 = x2*x1*x3

23 Polynomial form of nested canalyzing Boolean functions

24 The vector space of Boolean polynomial functions

25 The variety of nested canalyzing functions

26 Corollary. The ideal of relations defining the class of nested canalyzing Boolean functions on n variables forms an affine toric variety over the algebraic closure of F 2. The irreducible components correspond to the functions that are nested canalyzing with respect to a given variable ordering.

27 Theorem. The family of nested canalyzing functions is identical with the family of unate cascade functions.


Download ppt "A Mathematical Formalism for Agent- Based Modeling 22 nd Mini-Conference on Discrete Mathematics and Algorithms Clemson University October 11, 2007 Reinhard."

Similar presentations


Ads by Google