catalytic networks
play

Catalytic Networks Mark Baumback Introduction Summary w Artificial - PowerPoint PPT Presentation

Catalytic Networks Mark Baumback Introduction Summary w Artificial Chemistry review w Self organization w Catalytic Networks n Autocatalytic Sets n Self Reproduction n Self Maintenance w Evolving autocatalytic sets (in a catalytic network) w


  1. Catalytic Networks Mark Baumback

  2. Introduction

  3. Summary w Artificial Chemistry review w Self organization w Catalytic Networks n Autocatalytic Sets n Self Reproduction n Self Maintenance w Evolving autocatalytic sets (in a catalytic network) w Training autocatalytic sets (in a catalytic network)

  4. Artificial Chemistry Review

  5. Artificial Life (AL) w Artificial Life (AL) n Hypothesis – “Biotic phenomena can be modeled by using complex systems of many interacting components” n Emergence l Deduce global properties of a system from local interactions

  6. Artificial Chemistry(AC) w AC tries to investigate the dynamics of complex systems n Organization n Self Maintenance n Self Construction

  7. What is an AC? w Man made system which is similar to real chemical systems w A triple ( S, R, A) n S - The set of possible molecules n R - The set of collision rules n A - Algorithm describing reaction vessel

  8. The Molecules - S S = { S , S ,..., S } 1 2 n n Abstract symbols n Character sequences n Lambda Expressions n Binary strings n Numbers n Etc…

  9. Rule Set - R w Example: ' ' ' S S ... S S S ... S + + + = + + + 1 2 m 1 2 n w Based on n Neighborhood n Rate constants n Probability n Energy Consumption

  10. Reaction Vessel - A w Determines how rules are applied w 2 separate models n Molecules are either separate [Stochastic] n Similar molecules are grouped [Differential]

  11. Self Organization w “Sufficiently complex mixes of chemicals can spontaneously crystallize into systems with the ability to collectively catalyze the network of chemical reactions by which the molecules themselves are formed. Such collectively autocatalytic sets sustain themselves and reproduce”[1]

  12. Self Organization(2) w “Something is self organizing, if left to itself, it tends to become more organized.” [2] w Mechanisms which lead to self-organization n Self Replication n Replication of several types by cooperation

  13. Catalytic Networks Introduction w Catalyst – A substrate that enhances a reaction without being consumed itself n Is a mechanism for cooperation w Catalytic Network – A network where catalysts speed up certain reactions without being consumed

  14. Catalytic Networks w Used to explain the cooperation of several types of molecules, which may be been precursors to the first cells w Allows cooperation to feed back to the same set of molecules that act as catalysts n This can create a cycle n Provides positive feedback that lets selected molecules grow

  15. Autocatalytic Sets Introduction w Reaction – A process by which substrates (molecules) combine or split to form products n Reactions are slow n Catalyst plays role of facilitator l Dynamically increases speed of reaction w Catalyst is unaffected by reaction n A single catalyst can aid in many reactions

  16. Autocatalytic Sets w A collection of molecules which catalyze each others reactions n “Help bring each other into existence” Source:www.mgtaylor.com/mgtaylor/jotm/summer97/Complexity.html

  17. Self Reproduction Introduction w Replicator: n “Any entity in the universe which interacts with it’s world in such a way that copies of itself are made”[8] n Basics done by John von Neumann l System that could support self-replicating machines l Could withstand some mutation and pass these on l These machines could therefore participate in evolution

  18. Self reproduction(2) A ( X ) X + f - > B ( X ) ( X ) + f - > f A B C ( X ) X ( X ) + + + f - > + f A B C ( A B C ) A B C ( A B C ) + + + f + + - > + + + f + + w + = A single machine composed of components to left and right w --> = Process of construction

  19. Self maintenance w Not self replication j k i j k + Æ + + i K ( j , k K ) " Œ $ Œ w The set K maintains itself n It doesn’t copy itself it makes more of itself

  20. Catalytic Networks w S, R, A w Population P w Two different types n Stochastic n Differential

  21. Stochastic w Stochastic molecular collisions w Typical algorithm [Simple] n Draw a sample of molecules from population P n Check if a rule applies n If so, molecules are replaced by right hand side of rule

  22. Stochastic w Advantages n Very realistic w Disadvantages n Complexity drastically rises with l Concentrations of molecular species l Constants of reactions n Inefficient l The number of species is low or population P is large

  23. Differential w Continuous differential collisions n Example: r : a s a s ... a s b s b s ... b s + + + æ æÆ + + + 1 1 2 2 n n 1 1 2 s n n a , i b w i n Stoichiometric factors a s • is zero if is not a reactant i i s b • is zero if is not a product i i

  24. Differential w Application of all all rules N ds È ˘ r a r r i ( b a ) s  ’ j = - Í ˙ i i j dt Î ˚ r R j 1 Œ = i 1 .. N =

  25. Spatial Topology w Spatial structure of the reactor is a parameter of the algorithm A of {S,R,A} w Usually n Reactor is modeled as a well-stirred tank reactor n Probability of Si to participate in a reaction R is independent of position in reactor n Size of reactor (number of molecules) is held constant

  26. Competition w Competition is achieved by limiting the population numbers n Originally keeping the rum of all population variables constant n Population Numbers are scaled relative to total population

  27. Autocatalytic Sets w A particular type of dynamics that occur naturally in biochemical or ecosystems w Characterized by cooperation in a competitive environment l Several population dynamic variables maintaining a high level through cooperation in a competitive environment

  28. Evolving Catalytic Networks w “Evolving Catalytic Reaction sets using Genetic Algorithms”[7] w Goal: Study emergence of a chemical reaction network n Starting from a state of relative disorder n Thought to be a crucial step in the evolution of metabolisms

  29. Protocell Model w Simple mass-conserving, well-stirred reactor w Molecules(S) – Linear Polymers (chains) w Rules (R) n Bonding (condensation) n Breaking (cleavage) w Ex: Bonding monomer with 4-mer a aaaa aaaaa + æ æÆ

  30. Protocell Model (2) w Algorithm (A) n Stochastic Model n Well-stirred reactor n Fixed initial distribution n Interactions must be catalytic C A B P w Reactions + æ æÆ w A,B,C,P are polymers

  31. Protocell Model (3) w An autocatalytic set will occur when one of the reactants also catalyzes the reaction

  32. Goal w Automatically produce reactions sets n Input: An initial disordered distribution n Output: A distribution biased towards building up long polymers w Two Target distributions n Peak n Target

  33. Peak vs Target

  34. Genetic Algorithm w Genetic algorithm is used to change reaction rules towards biased distribution w Reaction Set represented by Boolean arrays w Max polymer size is 34 n 289 combinations of A and B n 289*34 possible different reactions 100 n possible reactions sets 9826

  35. Fitness function w Absolute different between target distribution and simulation distribution

  36. The result

  37. Reaction Graph w Characteristics n Shows Complexity l Produces large polymers l Then breaks these down n Short Cycle formation n Key polymers act as both reactants/catalysts n Target polymers act only as catalysts

  38. Conclusion w Highly simplified models of interaction w Can move to a system of increasing complexity w Reactions sets robust in producing desirable behavior

  39. Association w Autocatalytic sets are a result of self organization n Specifically in a catalytic network w Can we do anything with them?

  40. Learning w Goal n Develop a mathematical model of learning in autocatalytic sets n Achieve some degree of the adaptability of evolving systems w Example Task n Association of word symbols with letters

  41. The network w Differential model x ^ x g ( x ) i max( g ( x ), g ( x ),..., g ( x )) = - i i 1 2 n 0 . 5 w w w w w w w w w g ( x ) max( b x x ... x , b x x ... x ,..., b x x ... x ) i 1 m i 2 m ism = i 11 i 21 is 1 i 12 i 22 is 2 i i i i i 1 1 2 s i 2 1 2 s im 1 1 1 n Models growth of population variables n Each input/connected node is weighted w Competition through limiting population size

  42. Output w Output should be some learned response n Based off of inputs (bi-directional) w Training Phase n Apply some input n Allow chemical reactions to occur (with competition) n Learning: Apply a learning algorithm (Based off of population numbers)

  43. A picture(Initial architecture) Input - W1: ace & ACE W2: bde & BDE

  44. Doctored Stochastic version w OR-a,Ia => a w OR-a,IA => A w a,W1 => OR-a w A,W1 => OR-a w OR-a, other => W1

  45. Learning in catalytic networks w The learning rules n Adjusts the weights (connections) n Adjusts the biases of equations 1 w ( x w ) D = - ijk j ijk n ( 1 - b 1 ) D = a ik g i

  46. Goal w Task of learning n Find a suitable bias for the word nodes w The biased nodes n Are in terms of large population size n Caused by some sort of organization

  47. Example •Data 1: An incomplete word •Data 2: A word that has been trained •Data 3: A word that has not been trained

  48. Word response

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend