Skip to Main Content
 

Global Search Box

 
 
 
 

Files

File List


Thesis.pdf (20.24 MB)

ETD Abstract Container

Abstract Header

Combinatorial and probabilistic aspects of coupled oscillators

Yu, Han Baek
http://orcid.org/0000-0002-6323-5240
http://rave.ohiolink.edu/etdc/view?acc_num=osu1524195989591036

Abstract Details

2018, Doctor of Philosophy, Ohio State University, Mathematics.
A prime example of complex systems is a population of \textit{coupled oscillators}, which is a network of oscillatory units with local tendency to synchronize with their neighbors. Oscillators may evolve in their oscillation cycle automatically (e.g., circadian pacemaker cells and blinking fireflies) or by excitation from neighbors (e.g., neurons in the brain and B-Z chemical oscillator). In this thesis, we propose and analyze various mathematical models of coupled oscillators in combinatorial and probabilistic perspectives. In Part I, we introduce the $\kappa$-color \textit{firefly cellular automata} (FCA), which is a model for $\kappa$-state pulse-coupled oscillators defined for each integer parameter $\kappa\ge 3$, and obtain various theorems guaranteeing global synchronization. Our rigorous analysis on the model is based on classifying local limit cycles with their enforced dynamics, and recursively reducing global dynamics on proper subgraphs. We generalize this technique to a continuum version of the 4-color FCA, and derive global convergence on arbitrary finite tree. As an application, we obtain a memory-efficient distributed clock synchronization algorithm by composing our coupling with a spanning tree algorithm. Our composite algorithm especially suitable for synchronizing modern wireless sensor networks. In Part II, we study the FCA on the one-dimensional infinite integer lattice $\mathbb{Z}$ as well as the 3-color cyclic cellular automaton and the Greenberg-Hastings model on arbitrary graphs in a probabilistic framework. A guiding principle of our analysis on these discrete models is to lift the dynamics to an integer-valued monotone process defined on the universal cover of underlying graph. While incorporating various techniques from probability theory such as annihilating particle systems, persistence of random walks, generating functions, large deviations for tree-indexed random walks, and mass transport principle, we also establish sharp asymptotics for persistence of Markov additive functionals.
David Sivakoff, Ph.D (Advisor)
Matthew Kahle, Ph.D (Committee Member)
Hoi Nguyen, Ph.D (Committee Member)
Elliot Paquette, Ph.D (Committee Member)
231 p.
Mathematics
Pulse-coupled oscillators, global synchronization, excitable media, cellular automata, clustering, interacting particle systems, persistence of Markov additive functional

Recommended Citations

Citations

  • Yu, H. B. (2018). Combinatorial and probabilistic aspects of coupled oscillators [Doctoral dissertation, Ohio State University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=osu1524195989591036

    APA Style (7th edition)

  • Yu, Han Baek. Combinatorial and probabilistic aspects of coupled oscillators . 2018. Ohio State University, Doctoral dissertation. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=osu1524195989591036.

    MLA Style (8th edition)

  • Yu, Han Baek. "Combinatorial and probabilistic aspects of coupled oscillators ." Doctoral dissertation, Ohio State University, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=osu1524195989591036

    Chicago Manual of Style (17th edition)

osu1524195989591036
388
© 2018, all rights reserved.
This open access ETD is published by The Ohio State University and OhioLINK.