相关论文: The Network HHD: Quantifying Cyclic Competition in…
In this paper we bring a novel approach to the theory of tournament rankings. We combine two different theories that are widely used to establish rankings of populations after a given tournament. First, we use the statistical approach of…
Food webs have been found to exhibit remarkable motif profiles, patterns in the relative prevalences of all possible three-species sub-graphs, and this has been related to ecosystem properties such as stability and robustness. Analysing 46…
In this paper we investigate a relaxed concept of controllability, known in the literature as herdability, namely the capability of a system to be driven towards the(interior of the) positive orthant. Specifically, we investigate…
Competition and collaboration are at the heart of multi-agent probabilistic spreading processes. The battle on public opinion and competitive marketing campaigns are typical examples of the former, while the joint spread of multiple…
We study the macroscopic geometry of first-passage competition on the integer lattice $Z^d$, with a particular interest in describing the behavior when one species initially occupies the exterior of a cone. First-passage competition is a…
The concept of 'complexity' plays a central role in complex network science. Traditionally, this term has been taken to express heterogeneity of the node degrees of a therefore complex network. However, given that the degree distribution is…
Ecological resilience refers to the ability of a system to retain its state when subject to state variables perturbations or parameter changes. While understanding and quantifying resilience is crucial to anticipate the possible regime…
Competition is a primary driver of player satisfaction and engagement in multiplayer online games. Traditional matchmaking systems aim at creating matches involving teams of similar aggregated individual skill levels, such as Elo score or…
A tournament is a directed graph resulting from an orientation of the complete graph; so, if $M$ is a tournament's adjacency matrix, then $M + M^T$ is a matrix with $0$s on its diagonal and all other entries equal to $1$. An outstanding…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
In this work, we present and analyze a general framework for vegetation dynamics in arid and semi-arid ecosystems in which non-local interactions are purely competitive. The generality of the formulation enables a systematic search for…
The paper develops a new technique to extract a characteristic subset from a random source that repeatedly samples from a set of elements. Here a characteristic subset is a set that when containing an element contains all elements that have…
Professional team sports provide an excellent domain for studying the dynamics of social competitions. These games are constructed with simple, well-defined rules and payoffs that admit a high-dimensional set of possible actions and…
In cognitive science, behaviour is often separated into two types. Reflexive control is habitual and immediate, whereas reflective is deliberative and time consuming. We examine the argument that Hierarchical Predictive Coding (HPC) can…
We study the stochastic evolution of four species in cyclic competition in a well mixed environment. In systems composed of a finite number $N$ of particles these simple interaction rules result in a rich variety of extinction scenarios,…
Given a tournament $T$, a module of $T$ is a subset $X$ of $V(T)$ such that for $x, y\in X$ and $v\in V(T)\setminus X$, $(x,v)\in A(T)$ if and only if $(y,v)\in A(T)$. The trivial modules of $T$ are $\emptyset$, $\{u\}$ $(u\in V(T))$ and…
In this work we give specific examples of competition models, with six and eight species, whose three-dimensional dynamics naturally leads to the formation of string networks with junctions, associated with regions that have a high…
We study the phenomenon of intransitivity in models of dice and voting. First, we follow a recent thread of research for $n$-sided dice with pairwise ordering induced by the probability, relative to $1/2$, that a throw from one die is…
We consider a dynamical network model in which two competitors have fixed and different states, and each normal agent adjusts its state according to a distributed consensus protocol. The state of each normal agent converges to a steady…
For a regular tournament $T$ of order $n,$ denote by $c_{8}(T)$ the number of cycles of length $8$ in $T.$ Let $DR_{n}$ be a doubly-regular tournament of order $n\equiv 3\mod4$ (so, the out-sets and in-sets of its vertices are also regular…