output
19932020
most citedRotation equivariant vector field networks

242 citations

Showing 2011Show all

31 papers · 1 filter

stat.ML2011★ 3 cited

Regret lower bounds and extended Upper Confidence Bounds policies in stochastic multi-armed bandit problem

Antoine Salomon, Jean-Yves Audibert, Issam El Alaoui

This paper is devoted to regret lower bounds in the classical model of stochastic multi-armed bandit. A well-known result of Lai and Robbins, which has then been extended by Burnet…

math.CO2011★ 4 cited

Logarithmic and complex constant term identities

Tom Chappell, Alain Lascoux, S. Ole Warnaar +1

In recent work on the representation theory of vertex algebras related to the Virasoro minimal models M(2,p), Adamovic and Milas discovered logarithmic analogues of (special cases…

math.ST2011★ 2 cited

Estimation of a semiparametric contaminated regression model

Pierre Vandekerkhove

We consider in this paper a contamined regression model where the distribution of the contaminating component is known when the Eu- clidean parameters of the regression model, the…

math.ST2011

Semiparametric mixtures of symmetric distributions

Cristina Butucea, Pierre Vandekerkhove

We consider in this paper the semiparametric mixture of two distributions equal up to a shift parameter. The model is said to be semiparametric in the sense that the mixed distribu…

math-ph2011★ 7 cited

Cyclicity in rank-one perturbation problems

Evgeny Abakumov, Constanze Liaw, Alexei Poltoratski

The property of cyclicity of a linear operator, or equivalently the property of simplicity of its spectrum, is an important spectral characteristic that appears in many problems of…

quant-ph2011★ 29 cited

Topologically protected measurement-based quantum computation on the thermal state of a nearest-neighbor two-body Hamiltonian with spin-3/2 particles

Keisuke Fujii, Tomoyuki Morimae

Recently, Li {\it et al.} [Phys. Rev. Lett. {\bf 107}, 060501 (2011)] have demonstrated that topologically protected measurement-based quantum computation can be implemented on the…

math.CO2011

The algebraic combinatorics of snakes

Matthieu Josuat-Vergès, Jean-Christophe Novelli, Jean-Yves Thibon

Snakes are analogues of alternating permutations defined for any Coxeter group. We study these objects from the point of view of combinatorial Hopf algebras, such as noncommutative…

math.CO2011★ 2 cited

Noncommutative symmetric functions with matrix parameters

Alain Lascoux, Jean-Christophe Novelli, Jean-Yves Thibon

We define new families of noncommutative symmetric functions and quasi-symmetric functions depending on two matrices of parameters, and more generally on parameters associated with…

math.DG2011

Skew Killing spinors

Georges Habib, Julien Roth

In this paper, we study the existence of a skew Killing spinor (see the definition below) on 2 and 3-dimensional Riemannian spin manifolds. We establish the integrability condition…

quant-ph2011★ 130 cited

Blind topological measurement-based quantum computation

Tomoyuki Morimae, Keisuke Fujii

Blind quantum computation is a novel secure quantum-computing protocol that enables Alice, who does not have sufficient quantum technology at her disposal, to delegate her quantum…

math.NA2011★ 27 cited

A new model for shallow viscoelastic fluids

François Bouchut, Sébastien Boyaval

We propose a new reduced model for gravity-driven free-surface flows of shallow elastic fluids. It is obtained by an asymptotic expansion of the upper-convected Maxwell model for e…

math.CO2011

Noncommutative Symmetric Functions and an Amazing Matrix

Jean-Christophe Novelli, Jean-Yves Thibon

We present a simple way to derive the results of Diaconis and Fulman [arXiv:1102.5159] in terms of noncommutative symmetric functions.

math.PR2011★ 162 cited

Around the circular law

Charles Bordenave, Djalil Chafai

These expository notes are centered around the circular law theorem, which states that the empirical spectral distribution of a nxn random matrix with i.i.d. entries of variance 1/…

math.CO2011★ 7 cited

Mould calculus, polyhedral cones, and characters of combinatorial Hopf algebras

Frédéric Menous, Jean-Christophe Novelli, Jean-Yves Thibon

We describe a method for constructing characters of combinatorial Hopf algebras by means of integrals over certain polyhedral cones. This is based on ideas from resurgence theory,…

math.ST2011★ 122 cited

Detection of a sparse submatrix of a high-dimensional noisy matrix

Cristina Butucea, Yuri I. Ingster

We observe a matrix with i.i.d. in , and . We test the null hypothesis fo…

math.ST2011★ 30 cited

Noise Covariance Properties in Dual-Tree Wavelet Decompositions

Caroline Chaux, Jean-Christophe Pesquet, Laurent Duval

Dual-tree wavelet decompositions have recently gained much popularity, mainly due to their ability to provide an accurate directional analysis of images combined with a reduced red…

cs.FL2011★ 8 cited

Finite-Repetition threshold for infinite ternary words

Golnaz Badkobeh, Maxime Crochemore

The exponent of a word is the ratio of its length over its smallest period. The repetitive threshold r(a) of an a-letter alphabet is the smallest rational number for which there ex…

math.PR2011★ 1 cited

The almost sure invariance principle for unbounded functions of expanding maps

Jerome Dedecker, Sébastien Gouëzel, Florence Merlevede

We consider two classes of piecewise expanding maps of : a class of uniformly expanding maps for which the Perron-Frobenius operator has a spectral gap in the space of b…

math.CO2011★ 3 cited

Intervals of balanced binary trees in the Tamari lattice

Samuele Giraudo

We show that the set of balanced binary trees is closed by interval in the Tamari lattice. We establish that the intervals [T, T'] where T and T' are balanced binary trees are isom…

quant-ph2011

Not all physical errors can be linear CPTP maps in a correlation space

Tomoyuki Morimae, Keisuke Fujii

In the framework of quantum computational tensor network, which is a general framework of measurement-based quantum computation, the resource many-body state is represented in a te…

quant-ph2011★ 10 cited

Computational Power and Correlation in Quantum Computational Tensor Network

Keisuke Fujii, Tomoyuki Morimae

We investigate relations between computational power and correlation in resource states for quantum computational tensor network, which is a general framework for measurement-based…

math.PR2011★ 4 cited

A Subspace Estimator for Fixed Rank Perturbations of Large Random Matrices

Walid Hachem, Philippe Loubaton, X. Mestre +2

This paper deals with the problem of parameter estimation based on certain eigenspaces of the empirical covariance matrix of an observed multidimensional time series, in the case w…

cs.IT2011★ 23 cited

Multiple Access Channel with States Known Noncausally at One Encoder and Only Strictly Causally at the Other Encoder

Abdellatif Zaidi, Pablo Piantanida, Shlomo Shamai

We consider a two-user state-dependent multiaccess channel in which the states of the channel are known non-causally to one of the encoders and only strictly causally to the other…

cs.OH2011★ 23 cited

Relaxing Tight Frame Condition in Parallel Proximal Methods for Signal Restoration

Nelly Pustelnik, Jean-Christophe Pesquet, Caroline Chaux

A fruitful approach for solving signal deconvolution problems consists of resorting to a frame-based convex variational formulation. In this context, parallel proximal algorithms a…