Related papers: The solution space geometry of random linear equat…

We discuss the computational complexity of solving linear programming problems by means of an analog computer. The latter is modeled by a dynamical system which converges to the optimal vertex solution. We analyze various probability…

We present a new approach for search of coexisting classes of localised modes admitted by the repulsive (defocusing) scalar or vector nonlinear Schr\"odinger-type equations. The approach is based on the observation that generic solutions of…

Clustering is a fundamental problem in many areas, which aims to partition a given data set into groups based on some distance measure, such that the data points in the same group are similar while that in different groups are dissimilar.…

This paper is devoted to study a model of individual clustering with two specific reproduction rates in two space dimensions. Given q > 2 and an initial condition in W 1,q (\Omega), the local existence and uniqueness of solution have been…

In this paper the limit probabilities of first-order properties are studied. The random graph $G(n,p)$ {\it obeys Zero-One $k$-Law} if for each first-order property with quantifier depth not greater than $k$ its probability tends to 0 or…

Using the cavity equations of \cite{mezard:parisi:zecchina:02,mezard:zecchina:02}, we derive the various threshold values for the number of clauses per variable of the random $K$-satisfiability problem, generalizing the previous results to…

In this paper, we analyze the decision version of the NK landscape model from the perspective of threshold phenomena and phase transitions under two random distributions, the uniform probability model and the fixed ratio model. For the…

We prove a lower bound of exp(-C (log(2/alpha))^7)N^{k-1} to the number of solutions of an invariant equation in k variables, contained in a set of density alpha. Moreover, we give a Behrend-type construction for the same problem with the…

We consider two related problems arising from a question of R. Graham on quasirandom phenomena in permutation patterns. A ``pattern'' in a permutation $\sigma$ is the order type of the restriction of $\sigma : [n] \to [n]$ to a subset $S…

This paper is devoted to the study of the large time behaviour of viscosity solutions of parabolic equations with Neumann boundary conditions. This work is the sequel of [13] in which a probabilistic method was developped to show that the…

We prove that suitably generic pairs of linear equations on an even number of variables are uncommon. This verifies a conjecture of Kam\v{c}ev, Morrison and the second author. Moreover, we prove that any large system containing such a…

We present the results of a systematic survey of numerical solutions to the coagulation equation for a rate coefficient of the form A_ij \propto (i^mu j^nu + i^nu j^mu) and monodisperse initial conditions. The results confirm that there are…

A large family of linear, usually overdetermined, systems of partial differential equations that admit a multiplication of solutions, i.e, a bi-linear and commutative mapping on the solution space, is studied. This family of PDE's contains…

We develop a new approach for approximating large independent sets when the input graph is a one-sided spectral expander - that is, the uniform random walk matrix of the graph has its second eigenvalue bounded away from 1. Consequently, we…

The probability density function (PDF) of a random variable associated with the solution of a partial differential equation (PDE) with random parameters is approximated using a truncated series expansion. The random PDE is solved using two…

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

Let $V$ be any vector space of multivariate degree-$d$ homogeneous polynomials with co-dimension at most $k$, and $S$ be the set of points where all polynomials in $V$ {\em nearly} vanish. We establish a qualitatively optimal upper bound on…

Extending the thoroughly studied theory of group stability, we study Ulam stability type problems for associative and Lie algebras; namely, we investigate obstacles to rank-approximation of almost solutions by exact solutions for systems of…

Random constraint satisfaction problems are interesting model systems for spin-glasses and glassy dynamics studies. As the constraint density of such a system reaches certain threshold value, its solution space may split into extremely many…

Introducing inequality constraints in Gaussian process (GP) models can lead to more realistic uncertainties in learning a great variety of real-world problems. We consider the finite-dimensional Gaussian approach from Maatouk and Bay (2017)…