Related papers: The phase transition in random Horn satisfiability…

In this paper we determine the complexity of a broad class of problems that extends the temporal constraint satisfaction problems. To be more precise we study the problems Poset-SAT($\Phi$), where $\Phi$ is a given set of quantifier-free…

We show that universal positive almost sure termination (UPAST) is decidable for a class of simple randomized programs, i.e., it is decidable whether the expected runtime of such a program is finite for all inputs. Our class contains all…

Machine learning approaches relying on such criteria as adversarial robustness or multi-agent settings have raised the need for solving game-theoretic equilibrium problems. Of particular relevance to these applications are methods targeting…

As a variant of the Area Under the ROC Curve (AUC), the partial AUC (PAUC) focuses on a specific range of false positive rate (FPR) and/or true positive rate (TPR) in the ROC curve. It is a pivotal evaluation metric in real-world scenarios…

The quantified constraint satisfaction problem $\mathrm{QCSP}(\mathcal{A})$ is the problem to decide whether a positive Horn sentence, involving nothing more than the two quantifiers and conjunction, is true on some fixed structure…

We study the regularity of the interface between the disjoint supports of a pair of nonnegative subharmonic functions. The portion of the interface where the Alt-Caffarelli-Friedman (ACF) monotonicity formula is asymptotically positive…

A result of Fiz Pontiveros shows that if $A$ is a random subset of $\mathbb{Z}_N$ where each element is chosen independently with probability $N^{-1/2+o(1)}$, then with high probability every Freiman homomorphism defined on $A$ can be…

Using elementary rigorous methods we prove the existence of a clustered phase in the random $K$-SAT problem, for $K\geq 8$. In this phase the solutions are grouped into clusters which are far away from each other. The results are in…

We generalize Grover algorithm with two arbitrary phases in a density matrix set up. We give exact analytic expressions for the success probability after arbitrary number of iteration of the generalized Grover operator as a function of…

This paper tackles the problem of the existence of solutions for recursive systems of Horn clauses with second-order variables interpreted as integer relations, and harnessed by quantifier-free difference bounds arithmetic. We start by…

We study threshold properties of random constraint satisfaction problems under a probabilistic model due to Molloy. We give a sufficient condition for the existence of a sharp threshold that leads (for boolean constraints) to a necessary…

We investigate the properties of the Hybrid Monte-Carlo algorithm (HMC) in high dimensions. HMC develops a Markov chain reversible w.r.t. a given target distribution $\Pi$ by using separable Hamiltonian dynamics with potential $-\log\Pi$.…

We study the frog model on $\mathbb{Z}$ with particle-wise random geometric lifetimes: each particle has a survival parameter $\pi\in(0,1)$ sampled i.i.d., whose density near $1$ satisfies $f_\pi(u)\sim (1-u)^{\beta-1}L\big((1-u)^{-1}\big)$…

We investigate randomized benchmarking in a general setting with quantum gates that form a representation, not necessarily an irreducible one, of a finite group. We derive an estimate for the average fidelity, to which experimental data may…

Let g : $\Omega$ = [0, 1] d $\rightarrow$ R denote a Lipschitz function that can be evaluated at each point, but at the price of a heavy computational time. Let X stand for a random variable with values in $\Omega$ such that one is able to…

Generalized Friedman urn is one of the simplest and most useful models considered in probability theory. Since Athreya and Ney (1972) showed the almost sure convergence of urn proportions in a randomized urn model with irreducible…

Given a finite structure $M$ and property $p$, it is a natural to study the degree of satisfiability of $p$ in $M$; i.e. to ask: what is the probability that uniformly randomly chosen elements in $M$ satisfy $p$? In group theory, a…

Random Forest has become one of the most popular tools for feature selection. Its ability to deal with high-dimensional data makes this algorithm especially useful for studies in neuroimaging and bioinformatics. Despite its popularity and…

The Parameterized Inapproximability Hypothesis (PIH) is the analog of the PCP theorem in the world of parameterized complexity. It asserts that no FPT algorithm can distinguish a satisfiable 2CSP instance from one which is only…

In the present paper we prove that for any open connected set $\Omega\subset\mathbb{R}^{n+1}$, $n\geq 1$, and any $E\subset \partial \Omega$ with $\mathcal{H}^n(E)<\infty$, absolute continuity of the harmonic measure $\omega$ with respect…