Presented on October 2, 2017 at 11:00 a.m. in the Klaus Advanced Computing Building, room 1116E.
For all other @math , Glauber dynamics for the Potts model on @math is again known to have @math for all @math by combining the following results: Alexander @cite_22 related exponential decay of connection probabilities in the FK model on @math to an analogous spatial mixing property in the Potts model on a finite box; Beffara and Duminil-Copin @cite_38 proved the exponential decay of correlations in the FK model for all @math ; and the works of Martinelli @cite_42 @cite_45 @cite_40 translate the aforementioned spatial mixing property to an @math bound on the inverse gap. In contrast, Potts Glauber dynamics on @math is always expected to be exponentially slow for @math : as mentioned before, this is known for @math , and was proved for large enough @math in @cite_8 @cite_17 .
@cite_38 @cite_22 @cite_8 @cite_42 @cite_40 @cite_45 @cite_17
1982328614 2126692288 2011373957 2092260192 2004959470 2152708178
We investigate the minimization of Newton's functional for the problem of the body of minimal resistance with maximal height @math cite butt in the class of convex developable functions defined in a disc. This class is a natural candidate to find a (non-radial) minimizer in accordance with the results of cite lrp2. We prove that the minimizer in this class has a minimal set in the form of a regular polygon with @math sides centered in the disc, and numerical experiments indicate that the natural number @math is a non-decreasing function of @math . The corresponding functions all achieve a lower value of the functional than the optimal radially symmetric function with the same height @math . We prove tight upper and lower bounds on the internal energy per particle (expected number of monochromatic edges per vertex) in the anti-ferromagnetic Potts model on cubic graphs at every temperature and for all @math . This immediately implies corresponding tight bounds on the anti-ferromagnetic Potts partition function. Taking the zero-temperature limit gives new results in extremal combinatorics: the number of @math -colorings of a @math -regular graph, for any @math , is maximized by a union of @math 's. This proves the @math case of a conjecture of Galvin and Tet ali. Studies two widely used algorithms, Glauber dynamics and the Swendsen-Wang (1987) algorithm, on rectangular subsets of the hypercubic lattice Z sup d . We prove that, under certain circumstances, the mixing time in a box of side length L with periodic boundary conditions can be exponential in L sup d-1 . In other words, under these circumstances, the mixing in these widely used algorithms is not rapid; instead it is torpid. The models we study are the independent set model and the q-state Potts model. For both models, we prove that Glauber dynamics is torpid in the region with phase coexistence. For the Potts model, we prove that the Swendsen-Wang mixing is torpid at the phase transition point. We consider a switched network, a fairly general constrained queueing network model that has been used successfully to model the detailed packet-level dynamics in communication networks, such as input-queued switches and wireless networks. The main operational issue in this model is that of deciding which queues to serve, subject to certain constraints. In this paper, we study qualitative performance properties of the well known @math -weighted scheduling policies. The stability, in the sense of positive recurrence, of these policies has been well understood. We establish exponential upper bounds on the tail of the steady-state distribution of the backlog. Along the way, we prove finiteness of the expected steady-state backlog when @math , a property that was known only for @math . Finally, we analyze the excursions of the maximum backlog over a finite time horizon for @math . As a consequence, for @math , we establish the full state space collapse property. The spatial decay properties of Wannier functions and related quantities have been investigated using analytical and numerical methods. We find that the form of the decay is a power law times an exponential, with a particular power-law exponent that is universal for each kind of quantity. In one dimension we find an exponent of @math for Wannier functions, @math for the density matrix and for energy matrix elements, and @math or @math for different constructions of nonorthonormal Wannier-like functions. Abstract Irregular sampling and stable sampling of band-limited functions have been studied by H.J. Landau [H.J. Landau, Necessary density conditions for sampling and interpolation of certain entire functions, Acta Math. 117 (1967) 3752]. We prove that quasicrystals are sets of stable sampling. To cite this article: B. Matei, Y. Meyer, C. R. Acad. Sci. Paris, Ser. I 346 (2008). We investigate the clustering performances of the relaxed @math means in the setting of sub-Gaussian Mixture Model (sGMM) and Stochastic Block Model (SBM). After identifying the appropriate signal-to-noise ratio (SNR), we prove that the misclassification error decay exponentially fast with respect to this SNR. These partial recovery bounds for the relaxed @math means improve upon results currently known in the sGMM setting. In the SBM setting, applying the relaxed @math means SDP allows to handle general connection probabilities whereas other SDPs investigated in the literature are restricted to the assortative case (where within group probabilities are larger than between group probabilities). Again, this partial recovery bound complements the state-of-the-art results. All together, these results put forward the versatility of the relaxed @math means.