4,941 research outputs found
Greed is Good for Deterministic Scale-Free Networks
Large real-world networks typically follow a power-law degree distribution. To study such networks, numerous random graph models have been proposed. However, real-world networks are not drawn at random. In fact, the behavior of real-world networks and random graph models can be the complete opposite of one another, depending on the considered property. Brach, Cygan, Lacki, and Sankowski [SODA 2016] introduced two natural deterministic conditions: (1) a power-law upper bound on the degree distribution (PLB-U) and (2) power-law neighborhoods, that is, the degree distribution of neighbors of each vertex is also upper bounded by a power law (PLB-N). They showed that many real-world networks satisfy both deterministic properties and exploit them to design faster algorithms for a number of classical graph problems like transitive closure, maximum matching, determinant, PageRank, matrix inverse, counting triangles and maximum clique.
We complement the work of Brach et al. by showing that some well-studied random graph models exhibit both the mentioned PLB properties and additionally also a power-law lower bound on the degree distribution (PLB-L). All three properties hold with high probability for Chung-Lu Random Graphs and Geometric Inhomogeneous Random Graphs and almost surely for Hyperbolic Random Graphs. As a consequence, all results of Brach et al. also hold with high probability for Chung-Lu Random Graphs and Geometric Inhomogeneous Random Graphs and almost surely for Hyperbolic Random Graphs.
In the second part of this work we study three classical NP-hard combinatorial optimization problems on PLB networks. It is known that on general graphs, a greedy algorithm, which chooses nodes in the order of their degree, only achieves an approximation factor of asymptotically at least logarithmic in the maximum degree for Minimum Vertex Cover and Minimum Dominating Set, and an approximation factor of asymptotically at least the maximum degree for Maximum Independent Set. We prove that the PLB-U property suffices such that the greedy approach achieves a constant-factor approximation for all three problems. We also show that all three combinatorial optimization problems are APX-complete, even if all PLB-properties hold. Hence, a PTAS cannot be expected, unless P=NP
A Distributed Frank-Wolfe Algorithm for Communication-Efficient Sparse Learning
Learning sparse combinations is a frequent theme in machine learning. In this
paper, we study its associated optimization problem in the distributed setting
where the elements to be combined are not centrally located but spread over a
network. We address the key challenges of balancing communication costs and
optimization errors. To this end, we propose a distributed Frank-Wolfe (dFW)
algorithm. We obtain theoretical guarantees on the optimization error
and communication cost that do not depend on the total number of
combining elements. We further show that the communication cost of dFW is
optimal by deriving a lower-bound on the communication cost required to
construct an -approximate solution. We validate our theoretical
analysis with empirical studies on synthetic and real-world data, which
demonstrate that dFW outperforms both baselines and competing methods. We also
study the performance of dFW when the conditions of our analysis are relaxed,
and show that dFW is fairly robust.Comment: Extended version of the SIAM Data Mining 2015 pape
The non-equilibrium statistical physics of stochastic search, foraging and clustering
This dissertation explores two themes central to the field of non-equilibrium statistical physics. The first is centered around the use of random walks, first-passage processes, and Brownian motion to model basic stochastic search processes found in biology and ecological systems. The second is centered around clustered networks: how clustering modifies the nature of transition in the appearance of various graph motifs and their use in modeling social networks.
In the first part of this dissertation, we start by investigating properties of intermediate crossings of Brownian paths. We develop simple analytical tools to obtain probability distributions of intermediate crossing positions and intermediate crossing times of Brownian paths. We find that the distribution of intermediate crossing times can be unimodal or bimodal. Next, we develop analytical and numerical methods to solve a system of diffusive searchers which are reset to the origin at stochastic or periodic intervals. We obtain the optimal criteria to search for a fixed target in one, two and three dimensions. For these two systems, we also develop efficient ways to simulate Brownian paths, where the simulation kernel makes maximal use of first-passage ideas. Finally we develop a model to understand foraging in a resource-rich environment. Specifically, we investigate the role of greed on the lifetime of a diffusive forager. This lifetime shows non-monotonic dependence on greed in one and two dimensions, and surprisingly, a peak for negative greed in 1d.
In the second part of this dissertation, we develop simple models to capture the non-tree-like (clustering) aspects of random networks that arise in the real world. By 'clustered networks', we specifically mean networks where the probability of links between neighbors of a node (i.e., 'friends of friends') is positive. We discuss three simple and related models. We find a series of transitions in the density of graph motifs such as triangles (3-cliques), 4-cliques etc as a function of the clustering probability. We also find that giant 3-cores emerge through first- or second-order, or even mixed transitions in clustered networks
A Paradox of Plenty? Rent Distribution and Political Stability in Oil States
Resource curse theory claims that resource abundance encourages violent conflict. A study of 37 oil-producing developing countries, however, reveals that oil states with very high levels of oil revenue are remarkably stable. An analysis of the ways in which governments spend oil revenues identifies two distinct types of rentier systems â the large-scale distributive state and the patronage-based system â which are strongly linked to instability or its absence. However, some deviant cases, such as Equatorial Guinea and Gabon, illustrate the need for further research. Apparently, the notion of a âparadox of plentyâ has neglected rentier mechanisms that avoid conflict.Resource Curse, Paradox of Plenty, Oil, Rentier State, Violent Conflict, Political Stability, Developing World
Spectrum-Adapted Tight Graph Wavelet and Vertex-Frequency Frames
We consider the problem of designing spectral graph filters for the
construction of dictionaries of atoms that can be used to efficiently represent
signals residing on weighted graphs. While the filters used in previous
spectral graph wavelet constructions are only adapted to the length of the
spectrum, the filters proposed in this paper are adapted to the distribution of
graph Laplacian eigenvalues, and therefore lead to atoms with better
discriminatory power. Our approach is to first characterize a family of systems
of uniformly translated kernels in the graph spectral domain that give rise to
tight frames of atoms generated via generalized translation on the graph. We
then warp the uniform translates with a function that approximates the
cumulative spectral density function of the graph Laplacian eigenvalues. We use
this approach to construct computationally efficient, spectrum-adapted, tight
vertex-frequency and graph wavelet frames. We give numerous examples of the
resulting spectrum-adapted graph filters, and also present an illustrative
example of vertex-frequency analysis using the proposed construction
- âŠ