14 research outputs found
On the Role of Mobility for Multi-message Gossip
We consider information dissemination in a large -user wireless network in
which users wish to share a unique message with all other users. Each of
the users only has knowledge of its own contents and state information;
this corresponds to a one-sided push-only scenario. The goal is to disseminate
all messages efficiently, hopefully achieving an order-optimal spreading rate
over unicast wireless random networks. First, we show that a random-push
strategy -- where a user sends its own or a received packet at random -- is
order-wise suboptimal in a random geometric graph: specifically,
times slower than optimal spreading. It is known that this
gap can be closed if each user has "full" mobility, since this effectively
creates a complete graph. We instead consider velocity-constrained mobility
where at each time slot the user moves locally using a discrete random walk
with velocity that is much lower than full mobility. We propose a simple
two-stage dissemination strategy that alternates between individual message
flooding ("self promotion") and random gossiping. We prove that this scheme
achieves a close to optimal spreading rate (within only a logarithmic gap) as
long as the velocity is at least . The key
insight is that the mixing property introduced by the partial mobility helps
users to spread in space within a relatively short period compared to the
optimal spreading time, which macroscopically mimics message dissemination over
a complete graph.Comment: accepted to IEEE Transactions on Information Theory, 201
Symmetry in quantum walks
A discrete-time quantum walk on a graph is the repeated application of a
unitary evolution operator to a Hilbert space corresponding to the graph.
Hitting times for discrete quantum walks on graphs give an average time before
the walk reaches an ending condition. We derive an expression for hitting time
using superoperators, and numerically evaluate it for the walk on the hypercube
for various coins and decoherence models. We show that, by contrast to
classical walks, quantum walks can have infinite hitting times for some initial
states. We seek criteria to determine if a given walk on a graph will have
infinite hitting times, and find a sufficient condition for their existence.
The phenomenon of infinite hitting times is in general a consequence of the
symmetry of the graph and its automorphism group. Symmetries of a graph, given
by its automorphism group, can be inherited by the evolution operator. Using
the irreducible representations of the automorphism group, we derive conditions
such that quantum walks defined on this graph must have infinite hitting times
for some initial states. Symmetry can also cause the walk to be confined to a
subspace of the original Hilbert space for certain initial states. We show that
a quantum walk confined to the subspace corresponding to this symmetry group
can be seen as a different quantum walk on a smaller quotient graph and we give
an explicit construction of the quotient graph. We conjecture that the
existence of a small quotient graph with finite hitting times is necessary for
a walk to exhibit a quantum speed-up. Finally, we use symmetry and the theory
of decoherence-free subspaces to determine when the subspace of the quotient
graph is a decoherence-free subspace of the dynamics.Comment: 136 pages, Ph.D. thesis, University of Southern California, 200
Scalable Algorithms for the Analysis of Massive Networks
Die Netzwerkanalyse zielt darauf ab, nicht-triviale Erkenntnisse aus vernetzten Daten zu gewinnen. Beispiele für diese Erkenntnisse sind die Wichtigkeit einer Entität im Verhältnis zu anderen nach bestimmten Kriterien oder das Finden des am besten geeigneten Partners für jeden Teilnehmer eines Netzwerks - bekannt als Maximum Weighted Matching (MWM).
Da der Begriff der Wichtigkeit an die zu betrachtende Anwendung gebunden ist, wurden zahlreiche Zentralitätsmaße eingeführt. Diese Maße stammen hierbei aus Jahrzehnten, in denen die Rechenleistung sehr begrenzt war und die Netzwerke im Vergleich zu heute viel kleiner waren. Heute sind massive Netzwerke mit Millionen von Kanten allgegenwärtig und eine triviale Berechnung von Zentralitätsmaßen ist oft zu zeitaufwändig. Darüber hinaus ist die Suche nach der Gruppe von k Knoten mit hoher Zentralität eine noch kostspieligere Aufgabe. Skalierbare Algorithmen zur Identifizierung hochzentraler (Gruppen von) Knoten in großen Graphen sind von großer Bedeutung für eine umfassende Netzwerkanalyse.
Heutigen Netzwerke verändern sich zusätzlich im zeitlichen Verlauf und die effiziente Aktualisierung der Ergebnisse nach einer Änderung ist eine Herausforderung. Effiziente dynamische Algorithmen sind daher ein weiterer wesentlicher Bestandteil moderner Analyse-Pipelines.
Hauptziel dieser Arbeit ist es, skalierbare algorithmische Lösungen für die zwei oben genannten Probleme zu finden. Die meisten unserer Algorithmen benötigen Sekunden bis einige Minuten, um diese Aufgaben in realen Netzwerken mit bis zu Hunderten Millionen von Kanten zu lösen, was eine deutliche Verbesserung gegenüber dem Stand der Technik darstellt. Außerdem erweitern wir einen modernen Algorithmus für MWM auf dynamische Graphen. Experimente zeigen, dass unser dynamischer MWM-Algorithmus Aktualisierungen in Graphen mit Milliarden von Kanten in Millisekunden bewältigt.Network analysis aims to unveil non-trivial insights from networked data by studying relationship patterns between the entities of a network. Among these insights, a popular one is to quantify the importance of an entity with respect to the others according to some criteria. Another one is to find the most suitable matching partner for each participant of a network knowing the pairwise preferences of the participants to be matched with each other - known as Maximum Weighted Matching (MWM).
Since the notion of importance is tied to the application under consideration, numerous centrality measures have been introduced. Many of these measures, however, were conceived in a time when computing power was very limited and networks were much smaller compared to today's, and thus scalability to large datasets was not considered. Today, massive networks with millions of edges are ubiquitous, and a complete exact computation for traditional centrality measures are often too time-consuming. This issue is amplified if our objective is to find the group of k vertices that is the most central as a group. Scalable algorithms to identify highly central (groups of) vertices on massive graphs are thus of pivotal importance for large-scale network analysis.
In addition to their size, today's networks often evolve over time, which poses the challenge of efficiently updating results after a change occurs. Hence, efficient dynamic algorithms are essential for modern network analysis pipelines.
In this work, we propose scalable algorithms for identifying important vertices in a network, and for efficiently updating them in evolving networks. In real-world graphs with hundreds of millions of edges, most of our algorithms require seconds to a few minutes to perform these tasks. Further, we extend a state-of-the-art algorithm for MWM to dynamic graphs. Experiments show that our dynamic MWM algorithm handles updates in graphs with billion edges in milliseconds