Related papers: Resource location based on precomputed partial ran…
We study exploration properties of a random walk on a network. For a fully connected network we find that the problem can be mapped to the well known coupon collector problem, thus allowing us to estimate form of $P(S,t)$: the distribution…
We propose a unifying framework based on configuration linear programs and randomized rounding, for different energy optimization problems in the dynamic speed-scaling setting. We apply our framework to various scheduling and routing…
Complex networks have emerged as a simple yet powerful framework to represent and analyze a wide range of complex systems. The problem of ranking the nodes and the edges in complex networks is critical for a broad range of real-world…
The study of dynamical systems on networks, describing complex interactive processes, provides insight into how network structure affects global behaviour. Yet many methods for network dynamics fail to cope with large or partially-known…
This paper studies distributed resource allocation problem in multi-agent systems, where all the agents cooperatively minimize the sum of their cost functions with global resource constraints over stochastic communication networks. This…
Probabilistic sampling methods have become very popular to solve single-shot path planning problems. Rapidly-exploring Random Trees (RRTs) in particular have been shown to be very efficient in solving high dimensional problems. Even though…
The co-evolution between network structure and functional performance is a fundamental and challenging problem whose complexity emerges from the intrinsic interdependent nature of structure and function. Within this context, we investigate…
In this paper we study the dynamics of nonlinear random walks. While typical random walks on networks consist of standard Markov chains whose static transition probabilities dictate the flow of random walkers through the network, nonlinear…
Control and characterization of networks is a paramount step for the development of many quantum technologies. Even for moderate-sized networks, this amounts to explore an extremely vast parameters space in search for the couplings defining…
Sampling a network with a given probability distribution has been identified as a useful operation. In this paper we propose distributed algorithms for sampling networks, so that nodes are selected by a special node, called the…
This paper proposes an analytical framework for modelling resource contention in multi-robot systems, where the travel times and task durations are uncertain. It uses several approximation methods to quickly and accurately calculate the…
Neural networks have been achieving high generalization performance on many tasks despite being highly over-parameterized. Since classical statistical learning theory struggles to explain this behavior, much effort has recently been focused…
Understanding the dynamics of evolving social or infrastructure networks is a challenge in applied areas such as epidemiology, viral marketing, or urban planning. During the past decade, data has been collected on such networks but has yet…
Redistribution mechanisms have been proposed for more efficient resource allocation but not for profit. We consider redistribution mechanism design in a setting where participants are connected and the resource owner is only connected to…
We introduce and study a metapopulation model of random walkers interacting at the nodes of a complex network. The model integrates random relocation moves over the links of the network with local interactions depending on the node…
We propose a method for analyzing the distributed random coordinate descent algorithm for solving separable resource allocation problems in the context of an open multiagent system, where agents can be replaced during the process. In…
An analytic effective medium theory is constructed to study the mean access times for random walks on hybrid disordered structures formed by embedding complex networks into regular lattices, considering transition rates $F$ that are…
In this work, we propose distributed and networked energy management scenarios to optimize the production and reservation of energy among a set of distributed energy nodes. In other words, the idea is to optimally allocate the generated and…
We propose a resource distribution strategy to reduce the average travel time in a transportation network given a fixed generation rate. Suppose that there are essential resources to avoid congestion in the network as well as some extra…
Analysis of social networks with limited data access is challenging for third parties. To address this challenge, a number of studies have developed algorithms that estimate properties of social networks via a simple random walk. However,…