Concept

Axiom of countable choice

Related publications (54)

Lie groups in the symmetric group: Reducing Ulam's problem to the simple case

Ulam asked whether all Lie groups can be represented faithfully on a countable set. We establish a reduction of Ulam's problem to the case of simple Lie groups. In particular, we solve the problem for all solvable Lie groups and more generally Lie groups w ...

San Diego2023

Representing location choice within activity-based models

Michel Bierlaire, Timothy Michael Hillel, Janody Pougala, Nicolas Jean Salvadé

Since the 70s, there has been a growing interest in activity-based modelling. This approach models the need to travel as a result of performing daily activities (Bowman and Ben-Akiva, 2001). Nevertheless, the activities need to be scheduled which involves ...

2022

Biocompatible Chitosan-Based Hydrogels for Bioabsorbable Wound Dressings

Maria-Alexandra Paun

Supramolecular hydrogels based on chitosan and monoaldehydes are biomaterials with high potential for a multitude of bioapplications. This is due to the proper choice of the monoaldehyde that can tune the hydrogel properties for specific practices. In this ...

MDPI2022

Property FW, differentiable structures and smoothability of singular actions

Yash Lodha, Nicolas Matte Bon

We provide a smoothening criterion for group actions on manifolds by singular diffeomorphisms. We prove that if a countable group Gamma has the fixed point property FW for walls (for example, if it has property(T)), every aperiodic action of Gamma by diffe ...

WILEY2020

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

A pathwise approach to the extinction of branching processes with countably many types

Sophie Myriam Hautphenne

We consider the extinction events of Galton-Watson processes with countably infinitely many types. In particular, we construct truncated and augmented Galton-Watson processes with finite but increasing sets of types. A pathwise approach is then used to sho ...

ELSEVIER SCIENCE BV2019

A lower bound on opaque sets

János Pach

It is proved that the total length of any set of countably many rectifiable curves whose union meets all straight lines that intersect the unit square U is at least 2.00002. This is the first improvement on the lower bound of 2 known since 1964. A similar ...

ELSEVIER SCIENCE BV2019

Dynamics of functional connectivity at high spatial resolution reveal long-range interactions and fine-scale organization

Dimitri Nestor Alice Van De Ville, Maria Giulia Preti

Dynamic functional connectivity (dFC) derived from resting-state functional magnetic resonance imaging sheds light onto moment-to-moment reconfigurations of large-scale functional brain networks. Due to computational limits, connectivity is typically compu ...

Nature Publishing Group2017

Fast and Accurate Inference of Plackett-Luce Models

Matthias Grossglauser, Lucas Maystre

We show that the maximum-likelihood (ML) estimate of models derived from Luce’s choice axiom (e.g., the Plackett–Luce model) can be expressed as the stationary distribution of a Markov chain. This conveys insight into several recently proposed spectral inf ...

2015

Destination Choice Model including a panel effect using WiFi localization in a pedestrian facility

Michel Bierlaire, Matthieu Marie Cochon de Lapparent, Antonin Danalet, Loïc Tinguely

This paper proposes a general methodology to model pedestrian destination choice from WiFi localization in multi-modal transport facilities, e.g., airports, railway stations. It is based on the output of Danalet et al. (2014) method to generate candidates ...

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.