JHJulien M. Hendrickx

Julien M. Hendrickx

*This is an algorithmically generated author record based on publicly available information.

Julien M. Hendrickx has a total of 3 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Matrix P-norms are NP-hard to approximate if p \neq 1,2,\infty

    by Julien M. Hendrickx, Alex Olshevsky

    We show that for any rational p \in [1,\infty) except p = 1, 2, unless P = NP, there is no polynomial-time algorithm for approximating the matrix p-norm to arbitrary relative precision. We also show that for any rational p\in [1,\infty) including p = 1, 2, unless P = NP, there is no polynomial-time algorithm approximates the \infty, p mixed norm to some fixed relative precision.

  • Open Access

    Distributed anonymous function computation in information fusion and multiagent systems

    by Julien M. Hendrickx, Alex Olshevsky, John N. Tsitsiklis

    We propose a model for deterministic distributed function computation by a network of identical and anonymous nodes, with bounded computation and storage capabilities that do not scale with the network size. Our goal is to characterize the class of functions that can be computed within this model. In our main result, we exhibit a class of non-computable functions, and prove that every function outside this class can at least be approximated. The problem of computing averages in a distributed manner plays a central role in our development.

  • Open Access

    Continuous-time average-preserving opinion dynamics with opinion-dependent communications

    by Vincent D. Blondel, Julien M. Hendrickx, John N. Tsitsiklis

    We study a simple continuous-time multi-agent system related to Krause's model of opinion dynamics: each agent holds a real value, and this value is continuously attracted by every other value differing from it by less than 1, with an intensity proportional to the difference. We prove convergence to a set of clusters, with the agents in each cluster sharing a common value, and provide a lower bound on the distance between clusters at a stable equilibrium, under a suitable notion of multi-agent system stability. To better understand the behavior of the system for a large number of agents, we introduce a variant involving a continuum of agents. We prove, under some conditions, the existence of a solution to the system dynamics, convergence to clusters, and a non-trivial lower bound on the distance between clusters. Finally, we establish that the continuum model accurately represents the asymptotic behavior of a system with a finite but large number of agents.