본문

서브메뉴

Dynamics of Averaging Systems: Convergence and Cyclical Trends
Dynamics of Averaging Systems: Convergence and Cyclical Trends
Dynamics of Averaging Systems: Convergence and Cyclical Trends

Detailed Information

자료유형  
 학위논문 서양
최종처리일시  
20250211151126
ISBN  
9798382808697
DDC  
004
저자명  
Karntikoon, Kritkorn.
서명/저자  
Dynamics of Averaging Systems: Convergence and Cyclical Trends
발행사항  
[Sl] : Princeton University, 2024
발행사항  
Ann Arbor : ProQuest Dissertations & Theses, 2024
형태사항  
184 p
주기사항  
Source: Dissertations Abstracts International, Volume: 85-12, Section: B.
주기사항  
Advisor: Chazelle, Bernard.
학위논문주기  
Thesis (Ph.D.)--Princeton University, 2024.
초록/해제  
요약Averaging dynamics drives countless processes in biology, social science, physics, and engineering. Notable examples include opinion dynamics, bird flocking, and synchronization processes. These processes involve agents interacting across a dynamic network by averaging their state variables with those of their neighbors. The dynamics of averaging systems therefore depend on the structure of the underlying network sequences. Under mild conditions, such systems are known to converge to fixed-point attractors but are hard to analyze because of the time-varying nature of networks. The s-energy, a generating function over inter-agent distances, has emerged as a powerful tool to deal with this issue.In this thesis, we refine the analysis of the s-energy by highlighting the impact of network connectivity. This allows us to address an intriguing exponential gap in the convergence rate of averaging systems. We also apply this new s-energy bound to resolve open questions in several areas including bird flocking, where we establish sufficient conditions for the first polynomial bound in bird flocking convergence. Additionally, we investigate the emergence of cyclical trends in opinion dynamics. Augmenting the model with a separation rule reveals that the systems either converge to a nonconsensual equilibrium or are attracted to periodic or quasi-periodic orbits. Our analysis includes exploring geometric properties such as dimensionality, periodicity, and conditions for various behaviors.Later, we shift our focus from averaging systems to explore compelling examples of dynamic multi-agent systems, such as epidemiological and traffic network models. Furthermore, our emphasis is not on convergence rates or dynamic evolution but rather on practical applications: approximating the relevant values within these systems.
일반주제명  
Computer science
일반주제명  
Computer engineering
일반주제명  
Information technology
키워드  
Averaging systems
키워드  
Convergence rate
키워드  
Cyclical trends
키워드  
s-energy
키워드  
Synchronization processes
기타저자  
Princeton University Computer Science
기본자료저록  
Dissertations Abstracts International. 85-12B.
전자적 위치 및 접속  
로그인 후 원문을 볼 수 있습니다.

MARC

 008250123s2024        us                              c    eng  d
■001000017160854
■00520250211151126
■006m          o    d                
■007cr#unu||||||||
■020    ▼a9798382808697
■035    ▼a(MiAaPQ)AAI31147093
■040    ▼aMiAaPQ▼cMiAaPQ
■0820  ▼a004
■1001  ▼aKarntikoon,  Kritkorn.▼0(orcid)0000-0002-6398-3097
■24510▼aDynamics  of  Averaging  Systems:  Convergence  and  Cyclical  Trends
■260    ▼a[Sl]▼bPrinceton  University▼c2024
■260  1▼aAnn  Arbor▼bProQuest  Dissertations  &  Theses▼c2024
■300    ▼a184  p
■500    ▼aSource:  Dissertations  Abstracts  International,  Volume:  85-12,  Section:  B.
■500    ▼aAdvisor:  Chazelle,  Bernard.
■5021  ▼aThesis  (Ph.D.)--Princeton  University,  2024.
■520    ▼aAveraging  dynamics  drives  countless  processes  in  biology,  social  science,  physics,  and  engineering.  Notable  examples  include  opinion  dynamics,  bird  flocking,  and  synchronization  processes.  These  processes  involve  agents  interacting  across  a  dynamic  network  by  averaging  their  state  variables  with  those  of  their  neighbors.  The  dynamics  of  averaging  systems  therefore  depend  on  the  structure  of  the  underlying  network  sequences.  Under  mild  conditions,  such  systems  are  known  to  converge  to  fixed-point  attractors  but  are  hard  to  analyze  because  of  the  time-varying  nature  of  networks.  The  s-energy,  a  generating  function  over  inter-agent  distances,  has  emerged  as  a  powerful  tool  to  deal  with  this  issue.In  this  thesis,  we  refine  the  analysis  of  the  s-energy  by  highlighting  the  impact  of  network  connectivity.  This  allows  us  to  address  an  intriguing  exponential  gap  in  the  convergence  rate  of  averaging  systems.  We  also  apply  this  new  s-energy  bound  to  resolve  open  questions  in  several  areas  including  bird  flocking,  where  we  establish  sufficient  conditions  for  the  first  polynomial  bound  in  bird  flocking  convergence.  Additionally,  we  investigate  the  emergence  of  cyclical  trends  in  opinion  dynamics.  Augmenting  the  model  with  a  separation  rule  reveals  that  the  systems  either  converge  to  a  nonconsensual  equilibrium  or  are  attracted  to  periodic  or  quasi-periodic  orbits.  Our  analysis  includes  exploring  geometric  properties  such  as  dimensionality,  periodicity,  and  conditions  for  various  behaviors.Later,  we  shift  our  focus  from  averaging  systems  to  explore  compelling  examples  of  dynamic  multi-agent  systems,  such  as  epidemiological  and  traffic  network  models.  Furthermore,  our  emphasis  is  not  on  convergence  rates  or  dynamic  evolution  but  rather  on  practical  applications:  approximating  the  relevant  values  within  these  systems.
■590    ▼aSchool  code:  0181.
■650  4▼aComputer  science
■650  4▼aComputer  engineering
■650  4▼aInformation  technology
■653    ▼aAveraging  systems
■653    ▼aConvergence  rate
■653    ▼aCyclical  trends
■653    ▼as-energy
■653    ▼aSynchronization  processes
■690    ▼a0984
■690    ▼a0489
■690    ▼a0464
■71020▼aPrinceton  University▼bComputer  Science.
■7730  ▼tDissertations  Abstracts  International▼g85-12B.
■790    ▼a0181
■791    ▼aPh.D.
■792    ▼a2024
■793    ▼aEnglish
■85640▼uhttp://www.riss.kr/pdu/ddodLink.do?id=T17160854▼nKERIS▼z이  자료의  원문은  한국교육학술정보원에서  제공합니다.

Preview

Export

ChatGPT Discussion

AI Recommended Related Books


    New Books MORE
    Statistics for the past 3 years. Go to brief

    Подробнее информация.

    • Бронирование
    • не существует
    • моя папка
    • Первый запрос зрения
    • Non-Book Loan Application
    • Nighttime Book Loan Application
    материал
    Reg No. Количество платежных Местоположение статус Ленд информации
    TF10613 전자도서 대출가능 My Folder 부재도서신고 비도서대출신청 야간 도서대출신청

    * Бронирование доступны в заимствований книги. Чтобы сделать предварительный заказ, пожалуйста, нажмите кнопку бронирование

    Books borrowed together with this book

    Related Popular Books

    Available after logging in.