Estimating the Topology of Preferential Attachment Graphs Under Partial Observability

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.

Dynamical system (DS) based motion planning offers collision-free motion, with closed-loop reactivity thanks to their analytical expression. It ensures that obstacles are not penetrated by reshaping a nominal DS through matrix modulation, which is construc ...

Decentralized storage networks offer services with intriguing possibilities to reduce inequalities in an extremely centralized market. Fair distribution of rewards, however, is still a persistent problem in the current generation of decentralized applicati ...

This work is concerned with the computation of the action of a matrix function f(A), such as the matrix exponential or the matrix square root, on a vector b. For a general matrix A, this can be done by computing the compression of A onto a suitable Krylov ...

A key challenge across many disciplines is to extract meaningful information from data which is often obscured by noise. These datasets are typically represented as large matrices. Given the current trend of ever-increasing data volumes, with datasets grow ...

In this thesis we will present and analyze randomized algorithms for numerical linear algebra problems. An important theme in this thesis is randomized low-rank approximation. In particular, we will study randomized low-rank approximation of matrix functio ...

In this paper, we propose a novel approach that employs kinetic equations to describe the collective dynamics emerging from graph-mediated pairwise interactions in multi-agent systems. We formally show that for large graphs and specific classes of interact ...

By juxtaposing ideas from fractal geometry and dynamical systems, Furstenberg proposed a series of conjectures in the late 1960's that explore the relationship between digit expansions with respect to multiplicatively independent bases. In this work, we in ...

In the rapidly evolving landscape of machine learning research, neural networks stand out with their ever-expanding number of parameters and reliance on increasingly large datasets. The financial cost and computational resources required for the training p ...

Spectral algorithms are some of the main tools in optimization and inference problems on graphs. Typically, the graph is encoded as a matrix and eigenvectors and eigenvalues of the matrix are then used to solve the given graph problem. Spectral algorithms ...

Buildings are a promising source of flexibility for the application of demand response. In this work, we introduce a novel battery model formulation to capture the state evolution of a single building. Being fully data-driven, the battery model identificat ...

We propose a model order reduction technique to accurately approximate the behavior of multi-component systems without any a-priori knowledge of the coupled model. In the offline phase, we construct independent surrogate models by solving the local problem ...

We study an energy market composed of producers who compete to supply energy to different markets and want to maximize their profits. The energy market is modeled by a graph representing a constrained power network where nodes represent the markets and lin ...

We propose a principled method for projecting an arbitrary square matrix to the non- convex set of asymptotically stable matrices. Leveraging ideas from large deviations theory, we show that this projection is optimal in an information-theoretic sense and ...

Various forms of real-world data, such as social, financial, and biological networks, can be represented using graphs. An efficient method of analysing this type of data is to extract subgraph patterns, such as cliques, cycles, and motifs, from graphs. For ...

Time-sensitive networks, as in the context of IEEE Time-Sensitive Networking (TSN) and IETF Deterministic Networking (DetNet), offer deterministic services with guaranteed bounded latency in order to support safety-critical applications. In this thesis, we ...

In-network devices around the world monitor and tamper with connections for many reasons, including intrusion prevention, combating spam or phishing, and country-level censorship. Connection tampering seeks to block access to specific domain names or keywo ...

In control system networks, reconfiguration of the controller when agents are leaving or joining the network is still an open challenge, in particular when operation constraints that depend on each agent's behavior must be met. Drawing our motivation from ...

This thesis focuses on two selected learning problems: 1) statistical inference on graphs models, and, 2) gradient descent on neural networks, with the common objective of defining and analysing the measures that characterize the fundamental limits. In th ...

Headwater streams often experience intermittent flow. Consequently, the flowing drainage network expands and contracts and the flowing drainage density (DD) varies over time. Monitoring the DD dynamics is essential to understand the processes controlling i ...

Last-mile delivery in the logistics chain contributes to congestion in urban networks due to frequent stops. Crowd-shipping is a sustainable and low-cost alternative to traditional delivery but relies heavily on the availability of occasional couriers. In ...

Estimating the Topology of Preferential Attachment Graphs Under Partial Observability

Chat with Graph Search

Reactive collision-free motion generation in joint space via dynamical systems and sampling-based MPC

Altruism, reciprocity, and tokens to reward forwarding data: Is that fair?

SPEEDING UP KRYLOV SUBSPACE METHODS FOR COMPUTING f(A)b VIA RANDOMIZATION

Spectral Estimators for High-Dimensional Matrix Inference

Randomized low-rank approximation and its applications

Network-based kinetic models: Emergence of a statistical description of the graph topology

Additive and geometric transversality of fractal sets in the integers

Random matrix methods for high-dimensional machine learning models

The Power of Two Matrices in Spectral Algorithms for Community Recovery

Uncertainty-aware Flexibility Envelope Prediction in Buildings with Controller-agnostic Battery Models

Localized model order reduction and domain decomposition methods for coupled heterogeneous systems

Equilibria in Network Constrained Energy Markets

Efficient Learning of a Linear Dynamical System with Stability Guarantees

Acceleration of graph pattern mining and applications to financial crime

Worst-Case Delay Analysis of Time-Sensitive Networks with Network Calculus

Global, Passive Detection of Connection Tampering

Model Predictive Control for Multi-Agent Systems under Limited Communication and Time-Varying Network Topology

Fundamental Limits in Statistical Learning Problems: Block Models and Neural Networks

Short-term dynamics of drainage density based on a combination of channel flow state surveys and water level measurements

A continuum approximation approach to the depot location problem in a crowd-shipping system