Publications related to Shortest-Weight Paths In Random Regular Graphs

MATHICSE Technical Report : Convergence estimates in probability and in expectation for discrete least squares with noisy evaluations at random points

We study the accuracy of the discrete least-squares approximation on a finite dimensional space of a real-valued target function from noisy pointwise evaluations at independent random points distributed according to a given sampling probability measure. Th ...

MATHICSE2015

Perturbation analysis for the Darcy problem with log-normal permeability

Fabio Nobile, Francesca Bonizzoni

We study the single-phase flow in a saturated, bounded heterogeneous porous medium. We model the permeability as a log-normal random field. We perform a perturbation analysis, expanding the solution in Taylor series. The series is directly computable in th ...

2014

A New Entropy Power Inequality for Integer-Valued Random Variables

Emmanuel Abbé, Saeid Haghighatshoar

The entropy power inequality (EPI) yields lower bounds on the differential entropy of the sum of two independent real-valued random variables in terms of the individual entropies. Versions of the EPI for discrete random variables have been obtained for spe ...

Institute of Electrical and Electronics Engineers2014

Approximate Message Passing With Consistent Parameter Estimation and Applications to Sparse Learning

Michaël Unser, Ulugbek Kamilov

We consider the estimation of an independent and identically distributed (i.i.d.) (possibly non-Gaussian) vector x is an element of R-n from measurements y is an element of R-m obtained by a general cascade model consisting of a known linear transform foll ...

Ieee-Inst Electrical Electronics Engineers Inc2014

MATHICSE Technical Report : Perturbation analysis for the Darcy problem with log-normal permeability

Fabio Nobile, Francesca Bonizzoni

We study the single-phase flow in a saturated, bounded heterogeneous porous medium. We model the permeability as a log-normal random field. We perform a perturbation analysis, expanding the solution in Taylor series. The series is directly computable in th ...

MATHICSE2013

A PTAS for the Highway Problem

Thomas Rothvoss

In the highway problem, we are given an n-edge line graph (the highway), and a set of paths (the drivers), each one with its own budget. For a given assignment of edge weights (the tolls), the highway owner collects from each driver the weight of the assoc ...

2011

Sufficient-Statistics Based Multiple Access over Wireless Fading Channels

Michael Christoph Gastpar

In this work, we study a communication scheme in which nodes transmit sufficient statistics of their observations over non-orthogonal medium access channels for distributed estimation. This scheme unifies and generalizes several multiple access schemes suc ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008

An anisotropic sparse grid stochastic collocation method for partial differential equations with random input data

Fabio Nobile

This work proposes and analyzes an anisotropic sparse grid stochastic collocation method for solving partial differential equations with random coefficients and forcing terms ( input data of the model). The method consists of a Galerkin approximation in th ...

Society for Industrial and Applied Mathematics2008

A delay optimal policy for symmetric broadcast channels

Stéphane Musy

We consider the rate allocation problem when two users (each one associated with one receiver) send packets through a symmetric broadcast channel. Under the assumption that the packet lengths are exponentially distributed, we establish the delay optimality ...

2006

A Note on the Stochastic Bias of Some Increase-Decrease Congestion Cont rols: HighSpeed TCP Case Study

Jean-Yves Le Boudec, Milan Vojnovic

We consider increase-decrease congestion controls, a formulation that accommodates many known congestion controls. There have been many works that aim to obtain relation between the loss-event rate

\fpp

and time-average window

\taw

for some known parti ...

2003

Shortest-Weight Paths In Random Regular Graphs

Graph Chatbot

Chat with Graph Search

MATHICSE Technical Report : Convergence estimates in probability and in expectation for discrete least squares with noisy evaluations at random points

Perturbation analysis for the Darcy problem with log-normal permeability

A New Entropy Power Inequality for Integer-Valued Random Variables

Approximate Message Passing With Consistent Parameter Estimation and Applications to Sparse Learning

MATHICSE Technical Report : Perturbation analysis for the Darcy problem with log-normal permeability

A PTAS for the Highway Problem

Sufficient-Statistics Based Multiple Access over Wireless Fading Channels

An anisotropic sparse grid stochastic collocation method for partial differential equations with random input data

A delay optimal policy for symmetric broadcast channels

A Note on the Stochastic Bias of Some Increase-Decrease Congestion Cont rols: HighSpeed TCP Case Study

A delay optimal policy for symmetric broadcast channels

Approximate Message Passing With Consistent Parameter Estimation and Applications to Sparse Learning

A PTAS for the Highway Problem

An anisotropic sparse grid stochastic collocation method for partial differential equations with random input data

Perturbation analysis for the Darcy problem with log-normal permeability

A New Entropy Power Inequality for Integer-Valued Random Variables

MATHICSE Technical Report : Perturbation analysis for the Darcy problem with log-normal permeability

MATHICSE Technical Report : Convergence estimates in probability and in expectation for discrete least squares with noisy evaluations at random points

Sufficient-Statistics Based Multiple Access over Wireless Fading Channels

A Note on the Stochastic Bias of Some Increase-Decrease Congestion Cont rols: HighSpeed TCP Case Study