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 …

Characteristic Polynomial Of Arrangements And Multiarrangements, Mehdi Garrousian

Electronic Thesis and Dissertation Repository

This thesis is on algebraic and algebraic geometry aspects of complex hyperplane arrangements and multiarrangements. We start by examining the basic properties of the logarithmic modules of all orders such as their freeness, the cdga structure, the local properties and close the first chapter with a multiarrangement version of a theorem due to M. Mustata and H. Schenck.

In the next chapter, we obtain long exact sequences of the logarithmic modules of an arrangement and its deletion-restriction under the tame conditions. We observe how the tame conditions transfer between an arrangement and its deletion-restriction.

In chapter 3, we use some …