Related publications (23)

Detecting whether a stochastic process is finitely expressed in a basis

Victor Panaretos, Neda Mohammadi Jouzdani

Is it possible to detect if the sample paths of a stochastic process almost surely admit a finite expansion with respect to some/any basis? The determination is to be made on the basis of a finite collection of discretely/noisily observed sample paths. We ...
ACADEMIC PRESS INC ELSEVIER SCIENCE2023

Exceptional graphs for the random walk

Juhan Aru

If W is the simple random walk on the square lattice Z(2), then W induces a random walk W-G on any spanning subgraph G subset of Z(2) of the lattice as follows: viewing W as a uniformly random infinite word on the alphabet {x, -x, y, -y}, the walk W-G star ...
INST MATHEMATICAL STATISTICS2020

Geometric ergodicity for some space-time max-stable Markov chains

Erwan Fabrice Koch

Max-stable processes are central models for spatial extremes. In this paper, we focus on some space-time max-stable models introduced in Embrechts et al. (2016). The processes considered induce discrete-time Markov chains taking values in the space of cont ...
ELSEVIER SCIENCE BV2019

On the existence of ordinary triangles

Sebastian Urban Stich, Radoslav Fulek, Márton Naszódi

Let P be a finite point set in the plane. A \emph{c-ordinary triangle} in P is a subset of P consisting of three non-collinear points such that each of the three lines determined by the three points contains at most c points of P. Motivated by a question o ...
Elsevier2017

Neutron Electric Dipole Moment from Gauge-String Duality

Andrea Manenti

We compute the electric dipole moment of nucleons in the large N-c QCD model by Witten, Sakai, and Sugimoto with N-f = 2 degenerate massive flavors. Baryons in the model are instantonic solitons of an effective five-dimensional action describing the whole ...
Amer Physical Soc2017

Topological Structures on DMC spaces

Rajai Nasser

Two channels are said to be equivalent if they are degraded from each other. The space of equivalent channels with input alphabet X and output alphabet Y can be naturally endowed with the quotient of the Euclidean topology by the equivalence relation. We s ...
2017

Algebraic and topological methods in combinatorics

Adrian Claudiu Valculescu

The present thesis deals with problems arising from discrete mathematics, whose proofs make use of tools from algebraic geometry and topology. The thesis is based on four papers that I have co-authored, three of which have been published in journals, and o ...
EPFL2017

On the Structure of Cortical Microcircuits Inferred from Small Sample Sizes

Rodrigo de Campos Perin

The structure in cortical microcircuits deviates from what would be expected in a purely random network, which has been seen as evidence of clustering. To address this issue, we sought to reproduce the nonrandom features of cortical circuits by considering ...
Soc Neuroscience2017

On The Number Of Ordinary Conics

Frank de Zeeuw, Adrian Claudiu Valculescu

We prove a lower bound on the number of ordinary conics determined by a finite point set in R-2. An ordinary conic for S subset of R-2 is a conic that is determined by five points of S and contains no other points of S. Wiseman and Wilson proved the Sylves ...
Siam Publications2016

Sampling Spherical Finite Rate of Innovation Signals

Yue Lu, Ivan Dokmanic

Sampling schemes on the sphere require O(L^2) samples to perfectly sample and reconstruct a signal with bandwidth L. If the signal in question is a low-pass observation of a finite collection of spikes or rotations of a known function, we can use less samp ...
2015

Graph Chatbot

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.