50,297 research outputs found
Hittingtime and PageRank
In this thesis, we study convergence of finite state, discrete, and time homogeneous Markov chains to a stationary distribution. Expressing the probability of transitioning between states as a matrix allows us to look at the conditions that make the matrix primitive. Using the Perron-Frobenius theorem we find the stationary distribution of a Markov chain to be the left Perron vector of the probability transition matrix.
We study a special type of Markov chain &mdash random walks on connected graphs. Using the concept of fundamental matrix and the method of spectral decomposition, we derive a formula
that calculates expected hitting times for random walks on finite, undirected, and connected graphs.
The mathematical theory behind Google\u27s vaunted search engine is its PageRank algorithm. Google interprets the web as a strongly connected, directed graph and browsing the web as a random walk on this graph. PageRank is the stationary distribution of this random walk. We define a modified random walk called the lazy random walk and define personalized PageRank to be its stationary distribution. Finally, we derive a formula to relate hitting time and personalized PageRank by considering the connected graph as an electrical network, hitting time as voltage potential difference between nodes, and effective resistance as commute time
The Naming Game in Social Networks: Community Formation and Consensus Engineering
We study the dynamics of the Naming Game [Baronchelli et al., (2006) J. Stat.
Mech.: Theory Exp. P06014] in empirical social networks. This stylized
agent-based model captures essential features of agreement dynamics in a
network of autonomous agents, corresponding to the development of shared
classification schemes in a network of artificial agents or opinion spreading
and social dynamics in social networks. Our study focuses on the impact that
communities in the underlying social graphs have on the outcome of the
agreement process. We find that networks with strong community structure hinder
the system from reaching global agreement; the evolution of the Naming Game in
these networks maintains clusters of coexisting opinions indefinitely. Further,
we investigate agent-based network strategies to facilitate convergence to
global consensus.Comment: The original publication is available at
http://www.springerlink.com/content/70370l311m1u0ng3
Optimal network topologies: Expanders, Cages, Ramanujan graphs, Entangled networks and all that
We report on some recent developments in the search for optimal network
topologies. First we review some basic concepts on spectral graph theory,
including adjacency and Laplacian matrices, and paying special attention to the
topological implications of having large spectral gaps. We also introduce
related concepts as ``expanders'', Ramanujan, and Cage graphs. Afterwards, we
discuss two different dynamical feautures of networks: synchronizability and
flow of random walkers and so that they are optimized if the corresponding
Laplacian matrix have a large spectral gap. From this, we show, by developing a
numerical optimization algorithm that maximum synchronizability and fast random
walk spreading are obtained for a particular type of extremely homogeneous
regular networks, with long loops and poor modular structure, that we call
entangled networks. These turn out to be related to Ramanujan and Cage graphs.
We argue also that these graphs are very good finite-size approximations to
Bethe lattices, and provide almost or almost optimal solutions to many other
problems as, for instance, searchability in the presence of congestion or
performance of neural networks. Finally, we study how these results are
modified when studying dynamical processes controlled by a normalized (weighted
and directed) dynamics; much more heterogeneous graphs are optimal in this
case. Finally, a critical discussion of the limitations and possible extensions
of this work is presented.Comment: 17 pages. 11 figures. Small corrections and a new reference. Accepted
for pub. in JSTA
Microscopic activity patterns in the Naming Game
The models of statistical physics used to study collective phenomena in some
interdisciplinary contexts, such as social dynamics and opinion spreading, do
not consider the effects of the memory on individual decision processes. On the
contrary, in the Naming Game, a recently proposed model of Language formation,
each agent chooses a particular state, or opinion, by means of a memory-based
negotiation process, during which a variable number of states is collected and
kept in memory. In this perspective, the statistical features of the number of
states collected by the agents becomes a relevant quantity to understand the
dynamics of the model, and the influence of topological properties on
memory-based models. By means of a master equation approach, we analyze the
internal agent dynamics of Naming Game in populations embedded on networks,
finding that it strongly depends on very general topological properties of the
system (e.g. average and fluctuations of the degree). However, the influence of
topological properties on the microscopic individual dynamics is a general
phenomenon that should characterize all those social interactions that can be
modeled by memory-based negotiation processes.Comment: submitted to J. Phys.
- …