相关论文: Large-deviation Properties of Linear-programming C…

We consider a variational convex relaxation of a class of optimal partitioning and multiclass labeling problems, which has recently proven quite successful and can be seen as a continuous analogue of Linear Programming (LP) relaxation…

We consider a dynamic Erd\H{o}s-R\'enyi random graph (ERRG) on $n$ vertices in which each edge switches on at rate $\lambda$ and switches off at rate $\mu$, independently of other edges. The focus is on the analysis of the evolution of the…

The subgraph-centric programming model is a promising approach and has been applied in many state-of-the-art distributed graph computing frameworks. However, traditional graph partition algorithms have significant difficulties in processing…

A vertex cover on a graph is a set of vertices in which each edge of the graph is adjacent to at least one vertex in the set. The Minimal Vertex Cover (MVC) Problem concerns finding vertex covers with a smallest cardinality. The MVC problem…

For a finite random graph, we defined a simple model of statistical mechanics. We obtain an annealed asymptotic result for the random partition function for this model on finite random graphs as n; the size of the graph is very large. To…

The current bottleneck of globally solving mixed-integer (non-convex) quadratically constrained problem (MIQCP) is still to construct strong but computationally cheap convex relaxations, especially when dense quadratic functions are…

Universality, namely distributional invariance, is a well-known property for many random structures. For example, it is known to hold for a broad range of variational problems with random input. Much less is known about the algorithmic…

The graph bisection problem is the problem of partitioning the vertex set of a graph into two sets of given sizes such that the sum of weights of edges joining these two sets is optimized. We present a semidefinite programming relaxation…

Querying graph data with low latency is an important requirement in application domains such as social networks and knowledge graphs. Graph queries perform multiple hops between vertices. When data is partitioned and stored across multiple…

We study random graphs with latent geometric structure, where the probability of each edge depends on the underlying random positions corresponding to the two endpoints. We focus on the setting where this conditional probability is a…

The core challenge in designing an effective static program analysis is to find a good program abstraction -- one that retains only details relevant to a given query. In this paper, we present a new approach for automatically finding such…

We consider the problem of finding lower bounds on the I/O complexity of arbitrary computations in a two level memory hierarchy. Executions of complex computations can be formalized as an evaluation order over the underlying computation…

We show that large deviation properties of Erd\"os-R\'enyi random graphs can be derived from the free energy of the $q$-state Potts model of statistical mechanics. More precisely the Legendre transform of the Potts free energy with respect…

The last few years have seen the development of a promising theoretical framework for statistics of the cosmic large-scale structure -- the theory of large deviations (LDT) for modelling weak-lensing one-point statistics in the mildly…

We consider (annealed) large deviation principles for component empirical measures of several families of marked sparse random graphs, including (i) uniform graphs on $n$ vertices with a fixed degree distribution; (ii) uniform graphs on $n$…

Consider a distributed coding for computing problem with constant decoding locality, i.e., with a vanishing error probability, any single sample of the function can be approximately recovered by probing only constant number of compressed…

We consider a natural variant of the Erd\H{o}s-R\'enyi random graph process in which $k$ vertices are special and are never put into the same connected component. The model is natural and interesting on its own, but is actually inspired by…

We analyze a power distribution line with high penetration of distributed generation and strong variations of power consumption and generation levels. In the presence of uncertainty the statistical description of the system is required to…

Can we efficiently compute optimal solutions to instances of a hard problem from optimal solutions to neighboring (i.e., locally modified) instances? For example, can we efficiently compute an optimal coloring for a graph from optimal…

The graph partition problem (GPP) aims at clustering the vertex set of a graph into a fixed number of disjoint subsets of given sizes such that the sum of weights of edges joining different sets is minimized. This paper investigates the…