Optimizing Mixing in Pervasive Networks: A Graph-Theoretic Perspective

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.

Distributed learning is the key for enabling training of modern large-scale machine learning models, through parallelising the learning process. Collaborative learning is essential for learning from privacy-sensitive data that is distributed across various ...

This article investigates the performance and accuracy of continuous Real-Time Kinematic (RTK) Global Navigation Satellite System (GNSS) position tracking for hydromorphological surveys, based on a comprehensive river restoration monitoring campaign. The a ...

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n. Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed ...

This article investigates the optimal containment control problem for a class of heterogeneous multi-agent systems with time-varying actuator faults and unmatched disturbances based on adaptive dynamic programming. Since there exist unknown input signals i ...

Consider the family of bounded degree graphs in any minor-closed family (such as planar graphs). Let d be the degree bound and n be the number of vertices of such a graph. Graphs in these classes have hyperfinite decompositions, where, one removes a small ...

Traffic congestion constitutes one of the most frequent, yet challenging, problems to address in the urban space. Caused by the concentration of population, whose mobility needs surpass the serving capacity of urban networks, congestion cannot be resolved ...

Internet ranking algorithms play a crucial role in information technologies and numerical analysis due to their efficiency in high dimensions and wide range of possible applications, including scientometrics and systemic risk in finance (SinkRank, DebtRank ...

Future low-carbon societies will need to store vast amounts of electricity to stabilize electricity grids and to power electric vehicles. Vehicle-to-grid allows vehicle owners and grid operators to share the costs of electricity storage by making the batte ...

Although encryption hides the content of communications from third parties, metadata, i.e., the information attached to the content (such as the size or timing of communication) can be a rich source of details and context. In this dissertation, we demonstr ...

We exhibit an unambiguous k-DNF formula that requires CNF width (Omega) over tilde (k(2)), which is optimal up to logarithmic factors. As a consequence, we get a near-optimal solution to the Alon-Saks-Seymour problem in graph theory (posed in 1991), which ...

With the increasing prevalence of massive datasets, it becomes important to design algorithmic techniques for dealing with scenarios where the input to be processed does not fit in the memory of a single machine. Many highly successful approaches have emer ...

In recent years, several industries have widely applied BLDC servomotors for various purposes that they almost need a control system to be accurate and robust. In this paper, we compare an adaptive fuzzy controller and PI controller for BLDC servomotor pos ...

Goods can exhibit positive externalities impacting decisions of customers in social networks. Suppliers can integrate these externalities in their pricing strategies to increase their revenue. Besides optimizing the prize, suppliers also have to consider t ...

Many transportation markets are characterized by oligopolistic competition. In these markets customers, suppliers and regulators make decisions that are influenced by the preferences and the decisions of all other agents. In particular, capturing and under ...

Suppose that the vertices of a graph G are colored with two colors in an unknown way. The color that occurs on more than half of the vertices is called the majority color (if it exists), and any vertex of this color is called a majority vertex. We study th ...

We develop random graph models where graphs are generated by connecting not only pairs of vertices by edges, but also larger subsets of vertices by copies of small atomic subgraphs of arbitrary topology. This allows for the generation of graphs with extens ...

Dedicated bus lanes provide a low cost and easily implementable strategy to improve transit service by minimizing congestion-related delays. Identifying the best spatial distribution of bus-only lanes in order to maximize traffic performance of an urban ne ...

Motivation: Finding biosynthetic pathways is essential for metabolic engineering of organisms to produce chemicals, biodegradation prediction of pollutants and drugs, and for the elucidation of bioproduction pathways of secondary metabolites. A key step in ...

Given a source of iid samples of edges of an input graph G with n vertices and m edges, how many samples does one need to compute a constant factor approximation to the maximum matching size in G? Moreover, is it possible to obtain such an estimate in a sm ...

This article introduces a new class of models for multiple networks. The core idea is to parameterize a distribution on labeled graphs in terms of a Frechet mean graph (which depends on a user-specified choice of metric or graph distance) and a parameter t ...

Optimizing Mixing in Pervasive Networks: A Graph-Theoretic Perspective

Chat with Graph Search

Optimization Algorithms for Decentralized, Distributed and Collaborative Machine Learning

Performance and accuracy of cross‐section tracking methods for hydromorphological habitat assessment in wadable rivers with sparse canopy conditions

Results on Sparse Integer Programming and Geometric Independent Sets

Optimal containment control for a class of heterogeneous multi-agent systems with actuator faults

Random walks and forbidden minors III: poly(d epsilon(-1))-time partition oracles for minor-free graph classes

Large-scale traffic signal control and multimodal network design

Information Retrieval Under Network Uncertainty: Robust Internet Ranking

Vehicle-to-Grid for Reliable Frequency Regulation

Protecting privacy through metadata analysis

Unambiguous DNFs and Alon-Saks-Seymour

Space-Efficient Representations of Graphs

Comparison of PI and Adaptive Fuzzy Controllers for Position Tracking of Servo System with Variable Loaded BLDC Motor

Maintenance scheduling of manufacturing systems based on optimal price of the network

Optimization and equilibrium problems with discrete choice models

Adaptive majority problems for restricted query graphs and for weighted sets

Atomic subgraphs and the statistical mechanics of networks

Modeling and optimization of dedicated bus lanes space allocation in large networks with dynamic congestion

NICEpath: Finding metabolic pathways in large networks through atom-conserving substrate-product pairs

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples

Modeling Network Populations via Graph Distances