BEGIN:VCALENDAR
VERSION:2.0
PRODID:IEEE vTools.Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:US/Eastern
BEGIN:DAYLIGHT
DTSTART:20220313T030000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
RRULE:FREQ=YEARLY;BYDAY=2SU;BYMONTH=3
TZNAME:EDT
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20211107T010000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=11
TZNAME:EST
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20211216T023532Z
UID:68449BF2-4E34-449C-97FF-058696789102
DTSTART;TZID=US/Eastern:20211215T140000
DTEND;TZID=US/Eastern:20211215T144500
DESCRIPTION:Please join us for an invited talk from Tyler Diggans.\n\nAppli
 cations of the process of synchronization of networked oscillators range f
 rom chaos-based encrypted LANs to the important civil engineering problems
  associated with the power grid. A new optimization problem is proposed fo
 r network oscillator systems that have a stable synchronization manifold\;
  we seek a minimal-edge spanning subgraph of the original network for whic
 h the synchronization manifold has conjugate stability. The coupling stren
 gths may need to be adjusted and the time to synchronization may change wi
 ldly\, but the goal is stability as measured by the Master Stability Funct
 ion formalism. The solution space of this simple problem elucidates an int
 eresting relationship between the property of graph conductance and the fo
 rmation of hierarchies in functional network structures. For simple (non-c
 haotic) oscillator models\, the solution space consists of all spanning tr
 ees of the original network\, and we briefly discuss unpublished work on g
 enerating spanning trees of a well-studied complex network model called th
 e (u\,v)-flower graph. The majority of the talk will feature chaotic oscil
 lator systems\, which can be thought of as collections of information gene
 rators\, where the process of synchronization becomes a process of sharing
  and exchanging information. Depending on the Lyapunov exponent of the osc
 illators a number of feedback loops are required to enable synchronization
 \, and we consider this feature through symbolic dynamics. We seek to quan
 tify the required information flow for synchronization to occur as a funct
 ion of the topological entropy of the oscillators in question. This is sti
 ll ongoing research and will be the bulk of my dissertation for a PhD in P
 hysics (currently projected graduation is May 2022).\n\nSpeaker(s): Tyler 
 Diggans\, \n\nVirtual: https://events.vtools.ieee.org/m/294304
LOCATION:Virtual: https://events.vtools.ieee.org/m/294304
ORGANIZER:lee.seversky@us.af.mil
SEQUENCE:1
SUMMARY:The Essential Synchronization Backbone Problem
URL;VALUE=URI:https://events.vtools.ieee.org/m/294304
X-ALT-DESC:Description: <br /><p>Please join us for an invited talk from Ty
 ler Diggans.&nbsp\;</p>\n<p>Applications of the process of synchronization
  of networked oscillators range from chaos-based encrypted LANs to the imp
 ortant civil engineering problems associated with the power grid.&nbsp\; A
  new optimization problem is proposed for network oscillator systems that 
 have a stable synchronization manifold\; we seek a minimal-edge spanning s
 ubgraph of the original network for which the synchronization manifold has
  conjugate stability.&nbsp\; The coupling strengths may need to be adjuste
 d and the time to synchronization may change wildly\, but the goal is stab
 ility as measured by the Master Stability Function formalism.&nbsp\; The s
 olution space of this simple problem elucidates an interesting relationshi
 p between the property of graph conductance and the formation of hierarchi
 es in functional network structures.&nbsp\; For simple (non-chaotic) oscil
 lator models\, the solution space consists of all spanning trees of the or
 iginal network\, and we briefly discuss unpublished work on generating spa
 nning trees of a well-studied complex network model called the (u\,v)-flow
 er graph. The majority of the talk will feature chaotic oscillator systems
 \, which can be thought of as collections of information generators\, wher
 e the process of synchronization becomes a process of sharing and exchangi
 ng information. Depending on the Lyapunov exponent of the oscillators a nu
 mber of feedback loops are required to enable synchronization\, and we con
 sider this feature through symbolic dynamics. &nbsp\;We seek to quantify t
 he required information flow for synchronization to occur as a function of
  the topological entropy of the oscillators in question. &nbsp\;This is st
 ill ongoing research and will be the bulk of my dissertation for a PhD in 
 Physics (currently projected graduation is May 2022).</p>
END:VEVENT
END:VCALENDAR