We consider the voter model with binary opinions on a random regular graph with $ n $
vertices of degree $ d\geq 3$, subject to a rewiring dynamics in which pairs of edges are …

We propose an algebraic approach to stochastic graph-rewriting which extends the classical
construction of the Heisenberg-Weyl algebra and its canonical representation on the Fock …

We consider an asynchronous voting process on graphs called discordant voting, which can
be described as follows. Initially each vertex holds one of two opinions, red or blue …

在這篇論文中, 我們深入研究了一種廣義的投票模型, 其中個體有能力與持不同意見的人斷絕
聯繫, 同時與志同道合的人建立聯繫. 我們的分析集中在隨機正則圖上考慮Durrett 等人於[6] …

Time-evolving random graph models have appeared and have been studied in various
fields of research over the past decades. However, the rigorous mathematical treatment of …

Given a connected graph G whose vertices are coloured in some way, a discordant voting
process on G is as follows. At each step a pair of adjacent vertices with different colours …

The study of social phenomena identifies humans as the essential entity and attempts to
describe human behaviour. Probably, the opinions an individual holds represent the most …

Networks play a critical role in many physical, biological, and social systems. In this thesis,
we investigate tools to model and analyze networked systems. We first examine some of the …

This thesis deals with voting processes. A Voting process models the exchange of opinions
in a population of agents, commonly represented by vertices of a graph. Usually, an opinion …