Graph sparsification, spectral sketches, and faster resistance computation via short cycle decompositions
We develop a framework for graph sparsification and sketching, based on a new tool, short
cycle decomposition, which is a decomposition of an unweighted graph into an edge-disjoint …
cycle decomposition, which is a decomposition of an unweighted graph into an edge-disjoint …
Non-redundant dynamic fragment allocation with horizontal partition in Distributed Database System
NKZ Lwin, TM Naing - 2018 International Conference on …, 2018 - ieeexplore.ieee.org
The main task of distributed database is how to fragment the global database into small
fragments, how to allocate and replicate the fragments among different sites over the …
fragments, how to allocate and replicate the fragments among different sites over the …
Think globally, act locally: On the optimal seeding for nonsubmodular influence maximization
In the influence maximization problem, one chooses a fixed number of initial seeds in a
social network to maximize the spread of their influence. We study this problem with the r …
social network to maximize the spread of their influence. We study this problem with the r …
Dynamics and Social Networks
FY Yu - 2019 - deepblue.lib.umich.edu
Social networks are everywhere in our everyday lives. We aggregate information, make
decisions, and form opinions through these interactions on social networks. This thesis aims …
decisions, and form opinions through these interactions on social networks. This thesis aims …