This dissertation consists of three papers about opinion dynamics. The first paper is in collaboration with Prof. Lanchier while the other two papers are individual works. Two models are introduced and studied analytically: the Deffuant model and the Hegselmann-Krause~(HK) model. The main difference between the two models is that the Deffuant dynamics consists of pairwise interactions whereas the HK dynamics consists of group interactions. Translated into graph, each vertex stands for an agent in both models. In the Deffuant model, two graphs are combined: the social graph and the opinion graph. The social graph is assumed to be a general finite connected graph where each edge is interpreted as a social link, such as a friendship relationship, between two agents. At each time step, two social neighbors are randomly selected and interact if and only if their opinion distance does not exceed some confidence threshold, which results in the neighbors' opinions getting closer to each other. The main result about the Deffuant model is the derivation of a positive lower bound for the probability of consensus that is independent of the size and topology of the social graph but depends on the confidence threshold, the choice of the opinion space and the initial distribution. For the HK model, agent~$i$ updates its opinion~$x_i$ by taking the average opinion of its neighbors, defined as the set of agents with opinion at most~$\epsilon$ apart from~$x_i$. Here,~$\epsilon > 0$ is a confidence threshold. There are two types of HK models: the synchronous and the asynchronous HK models. In the former, all the agents update their opinion simultaneously at each time step, whereas in the latter, only one agent is selected uniformly at random to update its opinion at each time step. The mixed model is a variant of the HK model in which each agent can choose its degree of stubbornness and mix its opinion with the average opinion of its neighbors. The main results of this dissertation about HK models show conditions under which the asymptotic stability holds or a consensus can be achieved, and give a positive lower bound for the probability of consensus and, in the one-dimensional case, an upper bound for the probability of consensus. I demonstrate the bounds for the probability of consensus on a unit cube and a unit interval.