English
Related papers

Related papers: The Network HHD: Quantifying Cyclic Competition in…

200 papers

Tournament solutions are standard tools for identifying winners based on pairwise comparisons between competing alternatives. The recently studied notion of margin of victory (MoV) offers a general method for refining the winner set of any…

Computer Science and Game Theory · Computer Science 2023-06-27 Markus Brill , Ulrike Schmidt-Kraepelin , Warut Suksompong

Scale-free and non-computable characteristics of natural networks are found to result from the least-time dispersal of energy. To consider a network as a thermodynamic system is motivated since ultimately everything that exists can be…

General Physics · Physics 2011-06-22 Tuomo Hartonen , Arto Annila

Growing attention has been brought to the fact that many real directed networks exhibit hierarchy and directionality as measured through techniques like Trophic Analysis and non-normality. We propose a simple growing network model where the…

Physics and Society · Physics 2024-05-13 Niall Rodgers , Peter Tino , Samuel Johnson

A tournament is called locally transitive if the outneighbourhood and the inneighbourhood of every vertex are transitive. Equivalently, a tournament is locally transitive if it avoids the tournaments $W_4$ and $L_4$, which are the only…

Combinatorics · Mathematics 2015-04-16 Leonardo Nagami Coregliano

Intransitive player dominance, where player A beats B, B beats C, but C beats A, is common in competitive tennis. Yet, there are few known attempts to incorporate it within forecasting methods. We address this problem with a graph neural…

Machine Learning · Computer Science 2025-10-24 Lawrence Clegg , John Cartlidge

The Rock-Paper-Scissors(RPS) game is a paradigmatic model for cyclic dominance in biological systems. Here we consider this game in the social context of competition between opinions in a networked society. In our model, every agent has an…

Adaptation and Self-Organizing Systems · Physics 2010-11-08 Güven Demirel , Roshan Prizak , P. Nitish Reddy , Thilo Gross

This paper proposes a new lens for studying threshold games played on networks when the thresholds are heterogeneous. These are games where agents have two possible actions, and prefer action 1 if and only if enough of their neighbours…

Theoretical Economics · Economics 2025-08-07 Alastair Langtry , Sarah Taylor , Yifan Zhang

Using a set of heterogeneous competing systems with intra-system cooperation and inter-system aggression, we show how the coevolution of the system parameters (degree of organization and conditions for aggression) depends on the rate of…

Adaptation and Self-Organizing Systems · Physics 2015-05-13 Jose M. Albornoz , Antonio Parravano

Adaptive transport networks in biological and physical systems exhibit hierarchical organization, characteristic channel spacing, and robust scaling relations. Existing adaptive network models, formulated on a lattice, successfully…

Adaptation and Self-Organizing Systems · Physics 2026-05-18 Sidney Holden , Mia C. Morrell , Geoffrey Vasil , Eleni Katifori

The paper presents a hierarchical Bayesian model for simultaneous inference of tournament graphs and informant error. From multiple informant reports or measurement instrument outputs, the model estimates the structure of a criterion (i.e.,…

Methodology · Statistics 2013-10-14 Ben Hanowell

Existing match classification models in the tournament design literature have two major limitations: a contestant is considered indifferent only if uncertain future results do never affect its prize, and competitive matches are not…

Physics and Society · Physics 2026-01-29 László Csató , András Gyimesi

Modeling the spread of social contagions is central to various applications in social computing. In this paper, we study the learnability of the competitive threshold model from a theoretical perspective. We demonstrate how competitive…

Machine Learning · Computer Science 2022-05-10 Yifan Wang , Guangmo Tong

Cycling chaos is a heteroclinic connection between several chaotic attractors, at which switching between the chaotic sets occur at growing time intervals. Here we characterize the coherence properties of these switchings, considering…

Chaotic Dynamics · Physics 2014-03-05 T. A. Levanova , G. V. Osipov , A. Pikovsky

We survey some recent results on long-standing conjectures regarding Hamilton cycles in directed graphs, oriented graphs and tournaments. We also combine some of these to prove the following approximate result towards Kelly's conjecture on…

Combinatorics · Mathematics 2010-06-04 Daniela Kühn , Deryk Osthus

Tournaments are widely used models to represent pairwise dominance between candidates, alternatives, or teams. We study the problem of providing certified explanations for why a candidate appears among the winners under various tournament…

Artificial Intelligence · Computer Science 2026-01-22 Clément Contet , Umberto Grandi , Jérôme Mengin

The connectivity properties of ad hoc networks have been extensively studied over the past few years, from local observables, to global network properties. In this paper we introduce a novel layer of network dynamics which lives and evolves…

Networking and Internet Architecture · Computer Science 2016-02-05 Orestis Georgiou , Georgios Kalogridis , Hachem Yassine , Stojan Denic

As one of the main subjects of investigation in data science, network science has been demonstrated a wide range of applications to real-world networks analysis and modeling. For example, the pervasive presence of structural or topological…

Logic in Computer Science · Computer Science 2020-09-28 Felipe S. Abrahão , Klaus Wehmuth , Artur Ziviani

The principle that 'the brand effect is attractive' underlies preferential attachment. Here we show that the brand effect is just one dimension of attractiveness. Another dimension is competitiveness. We firstly develop a general framework…

Physics and Society · Physics 2014-05-20 Jin-Li Guo

The seminal Bradley-Terry model exhibits transitivity, i.e., the property that the probabilities of player A beating B and B beating C give the probability of A beating C, with these probabilities determined by a skill parameter for each…

Methodology · Statistics 2025-04-10 Jess Spearing , Jonathan Tawn , David Irons , Tim Paulden

Let $H$ be a 3-uniform hypergraph. A tournament $T$ defined on $V(T)=V(H)$ is a realization of $H$ if the edges of $H$ are exactly the 3-element subsets of $V(T)$ that induce 3-cycles. We characterize the 3-uniform hypergraphs that admit…

Combinatorics · Mathematics 2018-05-15 Abderrahim Boussaïri , Brahim Chergui , Pierre Ille , Mohamed Zaidi
‹ Prev 1 3 4 5 6 7 10 Next ›