Publications related to Association Generation in Synthetic Population for Transportation Applications: Graph-Theoretic Solution

Finding Perfect Matchings in Bipartite Hypergraphs

Haxell's condition [14] is a natural hypergraph analog of Hall's condition, which is a well-known necessary and sufficient condition for a bipartite graph to admit a perfect matching. That is, when Haxell's condition holds it forces the existence of a perf ...

SPRINGER HEIDELBERG2018

Geometric Graph Matching Using Monte Carlo Tree Search

Pascal Fua, Jan Kybic, Miguel Amável Dos Santos Pinheiro

We present an efficient matching method for generalized geometric graphs. Such graphs consist of vertices in space connected by curves and can represent many real world structures such as road networks in remote sensing, or vessel networks in medical imagi ...

Ieee Computer Soc2017

The weighted stable matching problem

Linda Farczadi

We study the stable matching problem in non-bipartite graphs with incomplete but strict preference lists, where the edges have weights and the goal is to compute a stable matching of minimum or maximum weight. This problem is known to be NP-hard in general ...

2017

Extension complexity of stable set polytopes of bipartite graphs

Yuri Faenza, Manuel Francesco Aprile

The extension complexity xc(P) of a polytope P is the minimum number of facets of a polytope that affinely projects to P. Let G be a bipartite graph with n vertices, m edges, and no isolated vertices. Let STAB(G) be the convex hull of the stable sets of G. ...

Springer2017

Bartering Books to Beers: a Recommender System for Exchange Platforms

Michele Catasta, Jérémie Rappaz, Maria-Luiza Vladarean

Bartering is a timeless practice that is becoming increasingly popular on the Web. Recommending trades for an online bartering platform shares many similarities with traditional approaches to recommendation, in particular the need to model the preferences ...

2017

Uncovering substitution patterns in new car sales using a cross nested logit model

Michel Bierlaire, Matthieu Marie Cochon de Lapparent, Anna Fernández Antolín

In the context of sales of new cars it is important to understand and model the consumers substitution patterns as well as their price elasticity towards different types of cars. To do so we develop (i) a multinomial logit model (MNL) and (ii) a cross-nest ...

2016

Partial Recovery Bounds for the Sparse Stochastic Block Model

Volkan Cevher, Jonathan Mark Scarlett

In this paper, we study the information-theoretic limits of community detection in the symmetric two-community stochastic block model, with intra-community and inter-community edge probabilities

\frac{a}{n}

and

\frac{b}{n}

respectively. We consider the ...

Ieee2016

A Fast Hadamard Transform for Signals with Sub-linear Sparsity in the Transform Domain

Martin Vetterli, Robin Scheibler, Saeid Haghighatshoar

In this paper, we design a new iterative low-complexity algorithm for computing the Walsh-Hadamard transform (WHT) of an N dimensional signal with a K-sparse WHT. We suppose that N is a power of two and K = O(N^α), scales sub-linearly in N for some α ∈ (0, ...

Institute of Electrical and Electronics Engineers2015

Synthesizing Data on Agents and Their Associations: A Simulation and Graph Theoretic Approach

Michel Bierlaire, Bilal Farooq

Data on the entire population is almost never publicly available. Moreover, there is an alarming trend of discontinuing the exercise of conducting full Census in many countries (Belgium, Switzerland, etc.). In this context, population synthesis techniques ...

2013

Population Synthesis: A Different Perspective

Michel Bierlaire, Bilal Farooq

Microsimulation of urban systems evolution requires synthetic population as a key input. Currently, the focus is on treating synthesis as a fitting problem and thus various techniques have been developed, including Iterative Proportional Fitting (IPF) and ...

2013

Association Generation in Synthetic Population for Transportation Applications: Graph-Theoretic Solution

Graph Chatbot

Chat with Graph Search

Finding Perfect Matchings in Bipartite Hypergraphs

Geometric Graph Matching Using Monte Carlo Tree Search

The weighted stable matching problem

Extension complexity of stable set polytopes of bipartite graphs

Bartering Books to Beers: a Recommender System for Exchange Platforms

Uncovering substitution patterns in new car sales using a cross nested logit model

Partial Recovery Bounds for the Sparse Stochastic Block Model

A Fast Hadamard Transform for Signals with Sub-linear Sparsity in the Transform Domain

Synthesizing Data on Agents and Their Associations: A Simulation and Graph Theoretic Approach

Population Synthesis: A Different Perspective

The weighted stable matching problem

Extension complexity of stable set polytopes of bipartite graphs

Geometric Graph Matching Using Monte Carlo Tree Search

A Fast Hadamard Transform for Signals with Sub-linear Sparsity in the Transform Domain

Synthesizing Data on Agents and Their Associations: A Simulation and Graph Theoretic Approach

Uncovering substitution patterns in new car sales using a cross nested logit model

Finding Perfect Matchings in Bipartite Hypergraphs

Partial Recovery Bounds for the Sparse Stochastic Block Model

Bartering Books to Beers: a Recommender System for Exchange Platforms

Population Synthesis: A Different Perspective