Discrete Mathematics and Combinatorics Commons^™

Generating Polynomials Of Exponential Random Graphs, Mohabat Tarkeshian

Electronic Thesis and Dissertation Repository

The theory of random graphs describes the interplay between probability and graph theory: it is the study of the stochastic process by which graphs form and evolve. In 1959, Erdős and Rényi defined the foundational model of random graphs on n vertices, denoted G(n, p) ([ER84]). Subsequently, Frank and Strauss (1986) added a Markov twist to this story by describing a topological structure on random graphs that encodes dependencies between local pairs of vertices ([FS86]). The general model that describes this framework is called the exponential random graph model (ERGM).

In the past, determining when a probability distribution has strong …

Complex-Valued Approach To Kuramoto-Like Oscillators, Jacqueline Bao Ngoc Doan

Electronic Thesis and Dissertation Repository

The Kuramoto Model (KM) is a nonlinear model widely used to model synchrony in a network of oscillators – from the synchrony of the flashing fireflies to the hand clapping in an auditorium. Recently, a modification of the KM (complex-valued KM) was introduced with an analytical solution expressed in terms of a matrix exponential, and consequentially, its eigensystem. Remarkably, the analytical KM and the original KM bear significant similarities, even with phase lag introduced, despite being determined by distinct systems. We found that this approach gives a geometric perspective of synchronization phenomena in terms of complex eigenmodes, which in turn …