Publications related to Reducing Randomness in Matrix Models for Wireless Communication

Fast recovery and approximation of hidden Cauchy structure

We derive an algorithm of optimal complexity which determines whether a given matrix is a Cauchy matrix, and which exactly recovers the Cauchy points defining a Cauchy matrix from the matrix entries. Moreover, we study how to approximate a given matrix by ...

Elsevier Science Inc2016

Soft optical composites for tunable transmittance

Pedro Miguel Nunes Pereira de Almeida Reis, Sanjeev Kumar

We introduce a soft composite that is actuated mechanically to achieve switchable and tunable optical transmittance. Our design comprises a series of parallel opaque platelets embedded into an optically clear silicone-based elastomer matrix. Under an appli ...

2016

Accelerated Spectral Clustering Using Graph Filtering of Random Signals

Pierre Vandergheynst, Rémi Gribonval, Gilles Puy, Nicolas Tremblay

We build upon recent advances in graph signal processing to propose a faster spectral clustering algorithm. Indeed, classical spectral clustering is based on the computation of the first

k

eigenvectors of the similarity matrix' Laplacian, whose computati ...

Ieee2016

On Polynomial Lieb–Robinson Bounds for the XY Chain in a Decaying Random Field

Marius Christopher Lemm

We consider the isotropic XY quantum spin chain in a random external field in the z direction, with single site distributions given by i.i.d. random variables times the critical decaying envelope j−1/2. Our motivation is the study of many-body localization ...

2016

MATHICSE Technical Report : Multi-index stochastic collocation convergence rates for random PDEs with parametric regularity

Fabio Nobile, Lorenzo Tamellini

We analyze the recent Multi-index Stochastic Collocation (MISC) method for computing statistics of the solution of a partial differential equation with random data, where the random coefficient is parametrized by means of a countable sequence of terms in a ...

MATHICSE2015

Incentive Schemes for Participatory Sensing

Boi Faltings, Goran Radanovic

We consider a participatory sensing scenario where a group of private sensors observes the same phenomenon, such as air pollution. Since sensors need to be installed and maintained, owners of sensors are inclined to provide inaccurate or random data. We de ...

2015

Lyapunov exponents of random walks in small random potential: the upper bound

Thomas Mountford, Jean-Christophe Mourrat

We consider the simple random walk on Z(d) evolving in a random i.i.d. potential taking values in [0, +infinity). The potential is not assumed integrable, and can be rescaled by a multiplicative factor lambda > 0. Completing the work started in a companion ...

Univ Washington, Dept Mathematics2015

Masking vs. Multiparty Computation: How Large Is the Gap for AES?

Sebastian Faust

In this paper, we evaluate the performances of state-of-the art higher-order masking schemes for the AES. Doing so, we pay a particular attention to the comparison between specialized solutions introduced exclusively as countermeasures against side-channel ...

2013

Towards a High-Speed Quantum Random Number Generator

Edoardo Charbon, Francesco Regazzoni, Samuel Burri

Randomness is of fundamental importance in various fields, such as cryptography, numerical simulations, or the gaming industry. Quantum physics, which is fundamentally probabilistic, is the best option for a physical random number generator. In this articl ...

2013

Asynchronous diffusion adaptation over networks

Ali H. Sayed

This work studies the asynchronous behavior of diffusion adaptation strategies for distributed optimization over networks. Under the assumed model, agents in the network may stop updating their estimates or may stop exchanging information at random times. ...

2012

Reducing Randomness in Matrix Models for Wireless Communication

Graph Chatbot

Chat with Graph Search

Fast recovery and approximation of hidden Cauchy structure

Soft optical composites for tunable transmittance

Accelerated Spectral Clustering Using Graph Filtering of Random Signals

On Polynomial Lieb–Robinson Bounds for the XY Chain in a Decaying Random Field

MATHICSE Technical Report : Multi-index stochastic collocation convergence rates for random PDEs with parametric regularity

Incentive Schemes for Participatory Sensing

Lyapunov exponents of random walks in small random potential: the upper bound

Masking vs. Multiparty Computation: How Large Is the Gap for AES?

Towards a High-Speed Quantum Random Number Generator

Asynchronous diffusion adaptation over networks

Fast recovery and approximation of hidden Cauchy structure

MATHICSE Technical Report : Multi-index stochastic collocation convergence rates for random PDEs with parametric regularity

Accelerated Spectral Clustering Using Graph Filtering of Random Signals

On Polynomial Lieb–Robinson Bounds for the XY Chain in a Decaying Random Field

Incentive Schemes for Participatory Sensing

Soft optical composites for tunable transmittance

Lyapunov exponents of random walks in small random potential: the upper bound

Masking vs. Multiparty Computation: How Large Is the Gap for AES?

Towards a High-Speed Quantum Random Number Generator

Asynchronous diffusion adaptation over networks