English
Related papers

Related papers: The second will be first: competition on directed …

200 papers

Despite the enormous success of graph neural networks (GNNs), most existing GNNs can only be applicable to undirected graphs where relationships among connected nodes are two-way symmetric (i.e., information can be passed back and forth).…

Machine Learning · Computer Science 2021-10-15 Zhuo Tan , Bin Liu , Guosheng Yin

The dynamics of interacting perceptrons is solved analytically. For a directed flow of information the system runs into a state which has a higher symmetry than the topology of the model. A symmetry breaking phase transition is found with…

Disordered Systems and Neural Networks · Physics 2007-05-23 W. Kinzel , R. Metzler , I. Kanter

An adaptive, adversarial methodology is developed for the optimal transport problem between two distributions $\mu$ and $\nu$, known only through a finite set of independent samples $(x_i)_{i=1..N}$ and $(y_j)_{j=1..M}$. The methodology…

Optimization and Control · Mathematics 2019-02-20 Montacer Essid , Debra Laefer , Esteban G. Tabak

In this paper we study the topological properties of wireless communication maps and their usability in algorithmic design. We consider the SINR model, which compares the received power of a signal at a receiver against the sum of strengths…

Data Structures and Algorithms · Computer Science 2011-03-25 Erez Kantor , Zvi Lotker , Merav Parter , David Peleg

A signed network represents how a set of nodes are connected by two logically contradictory types of links: positive and negative links. In a signed products network, two products can be complementary (purchased together) or substitutable…

Physics and Society · Physics 2018-08-23 Huijuan Wang , Cunquan Qu , Chongze Jiao , Wioletta Ruszel

This study proposes a distributed algorithm that makes agents' adaptive grouping entrap multiple targets via automatic decision making, smooth flocking, and well-distributed entrapping. Agents make their own decisions about which targets to…

Multiagent Systems · Computer Science 2022-06-30 Chen Wang , Minqiang Gu , Wenxi Kuang , Dongliang Wang , Weicheng Luo , Zhaohui Shi , Zhun Fan

We outline a detection method for adversarial inputs to deep neural networks. By viewing neural network computations as graphs upon which information flows from input space to out- put distribution, we compare the differences in graphs…

Machine Learning · Computer Science 2017-12-01 Thomas Gebhart , Paul Schrater

Competition for a limited resource is the hallmark of many complex systems, and often, that resource turns out to be the physical space itself. In this work, we study a novel model designed to elucidate the dynamics and emergence in complex…

Physics and Society · Physics 2026-03-18 Ann Mary Mathew , V Sasidevan

Drinking water for human health and well-being is crucial. Accidental and intentional water contamination can pose great danger to consumers. Optimal design of a system that can quickly detect the presence of contamination in a water…

Social and Information Networks · Computer Science 2016-01-12 Rezvan Nazempour , Mohammad Ali Saniee Monfared , Enrico Zio

We investigate the survivor distributions of a spatially extended model of competitive dynamics in different geometries. The model consists of a deterministic dynamical system of individual agents at specified nodes, which might or might…

Quantitative Methods · Quantitative Biology 2015-11-24 J. M. Luck , A. Mehta

The distributed coordination problem of multi-agent systems is addressed in this paper under the assumption of intermittent communication between agents in the presence of time-varying communication delays. Specifically, we consider the…

Optimization and Control · Mathematics 2016-09-20 Abdelkader Abdessameud , Ilia G. Polushin , Abdelhamid Tayebi

We consider protocols that serve communication requests arising over time in a wireless network that is subject to interference. Unlike previous approaches, we take the geometry of the network and power control into account, both allowing…

Networking and Internet Architecture · Computer Science 2012-03-07 Thomas Kesselheim

Using molecular dynamics simulation, we investigate the effect of confinement on a system that comprises several stiff segmented polymer chains where each chain has similar segments, but length and stiffness of the segments vary among the…

Soft Condensed Matter · Physics 2015-07-14 Arash Azari , Kristian K. Müller-Nedebock

To study gap acceptance behaviour one needs the distribution (or probability density function) of gaps in the opposing stream. Further, in these times of widespread availability of large computing powers, traffic simulation has emerged as a…

Applications · Statistics 2025-12-10 Ankita Sharma , Partha Chakroborty , Pranamesh Chakraborty

In this Letter we propose a method to control a set of arbitrary nodes in a directed network such that they follow a synchronous trajectory which is, in general, not shared by the other units of the network. The problem is inspired to those…

Chaotic Dynamics · Physics 2021-01-19 Bruno Ursino , Lucia Valentina Gambuzza , Vito Latora , Mattia Frasca

Many transport processes on networks depend crucially on the underlying network geometry, although the exact relationship between the structure of the network and the properties of transport processes remain elusive. In this paper we…

Physics and Society · Physics 2015-06-26 Bosiljka Tadic , G. J. Rodgers , Stefan Thurner

We propose a simple adaptive-network model describing recent swarming experiments. Exploiting an analogy with human decision making, we capture the dynamics of the model by a low-dimensional system of equations permitting analytical…

Disordered Systems and Neural Networks · Physics 2011-07-15 Cristián Huepe , Gerd Zschaler , Anne-Ly Do , Thilo Gross

Cognitive relaying has been introduced for opportunistic spectrum access systems by which a secondary node forwards primary packets whenever the primary link faces an outage condition. For spectrum sharing systems, cognitive relaying is…

Networking and Internet Architecture · Computer Science 2013-04-02 F. Foukalas , T. Khattab , H. V. Poor

In a model of network communication based on a random walk in an undirected graph, what subset of nodes (subject to constraints on the set size), enables the fastest spread of information? In this paper, we assume the dynamics of spread is…

Discrete Mathematics · Computer Science 2017-04-11 F. Y. Hunt

In network interdiction problems, evaders (e.g., hostile agents or data packets) may be moving through a network towards targets and we wish to choose locations for sensors in order to intercept the evaders before they reach their…

Social and Information Networks · Computer Science 2011-08-04 Matthew P. Johnson , Alexander Gutfraind