Learning Bollobas-Riordan Graphs Under Partial Observability
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.
Since the seminal work of Watts in the late 90s [1], graph-theoretic analyses have been performed on many complex dynamic networks, including brain structures [2]. Most studies have focused on functional connectivity defined between whole brain regions, us ...
We study the existence of equilibria with endogenously complete mar- kets in a continuous-time, heterogenous agents economy driven by a multi- dimensional diffusion process. Our main results show that if prices are real analytic as functions of time and the ...
We provide a tight approximate characterization of the n-dimensional product multicommodity flow (PMF) region for a wireless network of n nodes. Separate characterizations in terms of the spectral properties of appropriate network graphs are obtained in bo ...
The famous min-cut, max-flow theorem states that a source node can send a commodity through a network to a sink node at the rate determined by the flow of the min-cut separating the source and the sink. Recently it has been shown that by linear re-encoding ...
We develop new algebraic algorithms for scalar and vector network coding. In vector network coding, the source multicasts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying th ...
The framework of complex networks has been shown to describe adequately a wide class of complex systems made up of a large number of interacting units. In this framework, a node is associated to each unit and two nodes are connected by an edge if the two u ...
A statistical physics perspective of complex networks: from the architecture of the Internet and the brain to the spreading of an epidemic Statistical physics has revealed itself as the ideal framework to describe large networks appearing in a variety of d ...
The famous min-cut, max-flow theorem states that a source node can send a commodity through a network to a sink node at the rate determined by the flow of the min-cut separating the source and the sink. Recently it has been shown that by linear re-encoding ...
Institute of Electrical and Electronics Engineers2006
In this paper, the multi-agent containment problem is investigated. In particular, we focus our efforts on a continuation of our previous work on leader-follower networks, by imposing a hierarchical structure on the network topology. The main idea is to or ...
In randomly connected networks of pulse-coupled elements a time-dependent input signal can be buffered over a short time. We studied the signal buffering properties in simulated networks as a function of the networks' state, characterized by both the Lyapu ...
