Hitting time of large subsets of the hypercube

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

The mammalian brain, one of the most fascinating systems in nature, is a complex biological structure that has kept scientists busy for over a century. Many of the brain's mysteries have been unraveled due to the enormous efforts of the scientific communit ...

In order to collaborate with humans, robots are often provided with a Theory of Mind (ToM) architecture. Such architectures can be evaluated by humans perception of the robot's adaptations. However, humans sensitivities to these adaptations are not the one ...

Mass is one of the crucial parameters for hardware that has to be placed in Earth orbit. Due to its harsh environment, a material with highest specific properties is desired to achieve space missions. The rise and development of new technologies, such as a ...

In dynamical systems, the full stability of fixed point solutions is determined by their basins of attraction. Characterizing the structure of these basins is, in general, a complicated task, especially in high dimensionality. Recent works have advocated t ...

In this paper, we introduce and analyze a new low-rank multilevel strategy for the solution of random diffusion problems. Using a standard stochastic collocation scheme, we first approximate the infinite dimensional random problem by a deterministic parame ...

Although our work lies in the field of random processes, this thesis was originally motivated by signal processing applications, mainly the stochastic modeling of sparse signals. We develop a mathematical study of the innovation model, under which a signal ...

Bias-resistant public randomness is a critical component in many (distributed) protocols. Existing solutions do not scale to hundreds or thousands of participants, as is needed in many decentralized systems. We propose two large-scale distributed protocols ...

We consider elliptic random walks in i.i.d. random environments on . The main goal of this paper is to study under which ellipticity conditions local trapping occurs. Our main result is to exhibit an ellipticity criterion for ballistic behavior which exten ...

Although stochastic programming problems were always believed to be computationally challenging, this perception has only recently received a theoretical justification by the seminal work of Dyer and Stougie (Mathematical Programming A, 106(3):423–432, 200 ...

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

Hitting time of large subsets of the hypercube

Chat with Graph Search

Neuronal morphologies: the shapes of thoughts

Sensitivity To Perceived Mutual Understanding In Human-Robot Collaborations

Periodic cellular aluminum structures for space applications : from casting to additive manufacturing

The size of the sync basin revisited

Multilevel tensor approximation of PDEs with random data

Gaussian versus Sparse Stochastic Processes : Construction, Regularity, Compressibility

Scalable Bias-Resistant Distributed Randomness

Local trapping for elliptic random walks in random environments in Z(d)

A Comment on “Computational Complexity of Stochastic Programming Problems”

Multi-index stochastic collocation convergence rates for random PDEs with parametric regularity