research
∙
05/03/2023
Perfect Sampling for Hard Spheres from Strong Spatial Mixing
We provide a perfect sampling algorithm for the hard-sphere model on sub...
share
research
∙
02/13/2023
A simple statistic for determining the dimensionality of complex networks
Detecting the dimensionality of graphs is a central topic in machine lea...
research
∙
02/08/2023
Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs
A recent trend in the context of graph theory is to bring theoretical an...
research
∙
04/04/2022
Using random graphs to sample repulsive Gibbs point processes with arbitrary-range potentials
We study computational aspects of Gibbs point processes that are defined...
research
∙
07/19/2021
Algorithms for general hard-constraint point processes via discretization
We study a general model for continuous spin systems with hard-core inte...
research
∙
02/12/2021
Adaptive Sampling for Fast Constrained Maximization of Submodular Function
Several large-scale machine learning tasks, such as data summarization, ...
research
∙
11/09/2020
On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime Order
We study the problem of counting the number of homomorphisms from an inp...
research
∙
07/16/2020
Polymer Dynamics via Cliques: New Conditions for Approximations
Abstract polymer models are systems of weighted objects, called polymers...
research
∙
04/15/2020
The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability
Satisfiability is considered the canonical NP-complete problem and is us...
research
∙
11/15/2019
Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings
We study the problem of maximizing a non-monotone submodular function un...
research
∙
05/08/2019
Zeros and approximations of Holant polynomials on the complex plane
We present fully polynomial approximation schemes for general classes of...
research
∙
11/13/2018
Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints
We investigate the performance of a deterministic GREEDY algorithm for t...
research
∙
05/28/2018
Randomized Local Search Heuristics for Submodular Maximization and Covering Problems: Benefits of Heavy-tailed Mutation Operators
A core feature of evolutionary algorithms is their mutation operator. Re...
research
∙
05/22/2018
Intuitive Analyses via Drift Theory
Humans are bad with probabilities, and the analysis of randomized algori...
research
∙
02/16/2018
