相关论文: Adjacencies on random ordering polytopes and flow …

Latent position models (LPMs) are a large and popular class of models for random graphs. However, fitting Bayesian LPMs is computationally challenging - computing the likelihood even once takes time that is quadratic in the number of…

The problem of finding a point in the intersection of closed sets can be solved by the method of alternating projections and its variants. It was shown in earlier papers that for convex sets, the strategy of using quadratic programming (QP)…

The convex and metric structures underlying probabilistic physical theories are generally described in terms of base normed vector spaces. According to a recent proposal, the purely geometrical features of these spaces are appropriately…

Identifying clusters of similar elements in a set is a common task in data analysis. With the immense growth of data and physical limitations on single processor speed, it is necessary to find efficient parallel algorithms for clustering…

In this paper, we study a class of multiscale McKean-Vlasov stochastic systems where the entire system depends on the distribution of the fast component. First of all, by the Poisson equation method we prove that the slow component…

Quasi-logarithmic combinatorial structures are a class of decomposable combinatorial structures which extend the logarithmic class considered by Arratia, Barbour and Tavar\'{e} (2003). In order to obtain asymptotic approximations to their…

Luis Ferroni and Alex Fink recently introduced a polytope of all unlabeled matroids of rank $r$ on $n$ elements, and they showed that the vertices of this polytope come from matroids that can be characterized by maximizing a sequence of…

We develop a fluctuation theory of connectivities for subcritical random cluster models. The theory is based on a comprehensive nonperturbative probabilistic description of long connected clusters in terms of essentially one-dimensional…

We consider a system of particles lined up on a finite interval with Coulomb 3-dimensional interactions between close neighbours, i.e. only a few other neighbours apart. This model was introduced by Malyshev (2015) to study the flow of…

We study the linear convergence of Frank-Wolfe algorithms over product polytopes. We analyze two condition numbers for the product polytope, namely the \emph{pyramidal width} and the \emph{vertex-facet distance}, based on the condition…

In 1975 Szemer\'edi proved the long-standing conjecture of Erd\H{o}s and Tur\'an that any subset of $\bbZ$ having positive upper Banach density contains arbitrarily long arithmetic progressions. Szemer\'edi's proof was entirely…

An extended formulation of a polytope is a linear description of this polytope using extra variables besides the variables in which the polytope is defined. The interest of extended formulations is due to the fact that many interesting…

In this report, the explicit probability density functions of the random Euclidean distances associated with equilateral triangles are given, when the two endpoints of a link are randomly distributed in 1) the same triangle, 2) two adjacent…

An identity due to Efron dating from 1965 relates the expected volume of the convex hull of $n$ random points to the expected number of vertices of the convex hull of $n+1$ random points. Forty years later this identity was extended from…

Building on introducing exponentially clustered poles, Trefethen and his collaborators introduced lightning algorithms for approximating functions of singularities. These schemes may achieve root-exponential convergence rates. In…

We solve the conjecture posed by Fill, Scheinerman and Singer-Cohen and show the equivalence of the sharp threshold functions of the random intersection graph G(n,m,p) with $m >= n^3$ and a graph in which each edge appears independently.…

We develop the theory of Diophantine approximation for systems of simultaneously small linear forms, which coefficients are drawn from any given analytic non-degenerate manifolds. This setup originates from a problem of Sprind\v{z}uk from…

We introduce a class of polytopes that we call chainlink polytopes and which allow us to construct infinite families of pairs of non isomorphic rational polytopes with the same Ehrhart quasi-polynomial. Our construction is based on circular…

The fixed-horizon constrained Markov Decision Process (C-MDP) is a well-known model for planning in stochastic environments under operating constraints. Chance-Constrained MDP (CC-MDP) is a variant that allows bounding the probability of…

In 1904, Dickson [5] stated a very important conjecture. Now people call it Dickson's conjecture. In 1958, Schinzel and Sierpinski [14] generalized Dickson's conjecture to the higher order integral polynomial case. However, they did not…