Home

Publication

Gelfand pairs admit an Iwasawa decomposition

About
Privacy
Disclaimer

Graph Chatbot

Related publications (34)

Page 2 of 2

A nonlinear model predictive control scheme for sensor fault tolerance in observation processes

Colin Neil Jones, Andrea Alessandretti

This article addresses the problem of designing a sensor fault-tolerant controller for an observation process where a primary, controlled system observes, through a set of measurements, an exogenous system to estimate the state of this system. We consider ...

WILEY2020

A Crossing Lemma for Multigraphs

János Pach

Let G be a drawing of a graph with n vertices and e > 4n edges, in which no two adjacent edges cross and any pair of independent edges cross at most once. According to the celebrated Crossing Lemma of Ajtai, Chvatal, Newborn, Szemeredi and Leighton, the nu ...

SPRINGER2020

On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices

Daniel Kressner, Stefano Massei, Alice Cortinovis

The problem of finding a k x k submatrix of maximum volume of a matrix A is of interest in a variety of applications. For example, it yields a quasi-best low-rank approximation constructed from the rows and columns of A. We show that such a submatrix can a ...

ELSEVIER SCIENCE INC2020

A non-intrusive multifidelity method for the reduced order modeling of nonlinear problems

Jan Sickmann Hesthaven, Mengwu Guo, Mariella Kast

We propose a non-intrusive reduced basis (RB) method for parametrized nonlinear partial differential equations (PDEs) that leverages models of different accuracy. From a collection of low-fidelity (LF) snapshots, parameter locations are extracted for the e ...

ELSEVIER SCIENCE SA2020

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

Graph Signal Processing for Machine Learning: A Review and New Perspectives

Pascal Frossard, Ntorina Thanou, Laura Toni, Xiaowen Dong, Michael Bronstein

The effective representation, processing, analysis, and visualization of large-scale structured data, especially those related to complex domains, such as networks and graphs, are one of the key questions in modern machine learning. Graph signal processing ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

hm-toolbox: MATLAB SOFTWARE FOR HODLR AND HSS MATRICES

Daniel Kressner, Stefano Massei

Matrices with hierarchical low-rank structure, including HODLR and HSS matrices, constitute a versatile tool to develop fast algorithms for addressing large-scale problems. While existing software packages for such matrices often focus on linear systems, t ...

SIAM PUBLICATIONS2020

The time-dependent expected reward and deviation matrix of a finite QBD process

Sophie Myriam Hautphenne

Deriving the time-dependent expected reward function associated with a continuous-time Markov chain involves the computation of its transient deviation matrix. In this paper we focus on the special case of a finite quasi-birth-and-death (QBD) process, moti ...

ELSEVIER SCIENCE INC2019

An Improved Analysis of Local Search for Max-Sum Diversification

Friedrich Eisenbrand, Alfonso Bolívar Cevallos Manzano

We present new techniques to analyze natural local search algorithms for several variants of the max-sum diversification problem which, in its most basic form, is as follows: given an n-point set X subset of R-d and an integer k, select k points in X so th ...

INFORMS2019

Finitely generated infinite simple groups of homeomorphisms of the real line

Yash Lodha

We construct examples of finitely generated infinite simple groups of homeomorphisms of the real line. Equivalently, these are examples of finitely generated simple left (or right) orderable groups. This answers a well known open question of Rhemtulla from ...

SPRINGER HEIDELBERG2019

Numerical Homogenization And Model Order Reduction For Multiscale Inverse Problems

Assyr Abdulle, Andrea Di Blasio

A new numerical method based on numerical homogenization and model order reduction is introduced for the solution of multiscale inverse problems. We consider a class of elliptic problems with highly oscillatory tensors that varies on a microscopic scale. W ...

SIAM PUBLICATIONS2019

Perfect Matchings in O (n(1.5)) Time in Regular Bipartite Graphs

Mikhail Kapralov

Springer-Verlag2019

A construction of the Stable Web

Thomas Mountford

We provide a process on the space of collections of coalescing cadlag stable paths and show convergence in an appropriate topology for coalescing stable random walks on the integer lattice. ...

IMPA2019

On the Rainbow Turan number of paths

Abhishek Methuku

Let F be a fixed graph. The rainbow Turan number of F is defined as the maximum number of edges in a graph on n vertices that has a proper edge-coloring with no rainbow copy of F (i.e., a copy of F all of whose edges have different colours). The systematic ...

ELECTRONIC JOURNAL OF COMBINATORICS2019