Research
Research
Research
Research
218+ open-access research outputs.
We present a Spatially Embedded Evolutionary Algorithm where robot individuals exist in a physically simulated 2D environment, must navigate to encounter potential mates, and compete for survival unde…
Locating and intercepting a moving target from possibly delayed, intermittent sensory signals is a paradigmatic problem in decision-making under uncertainty, and a fundamental challenge for, e.g., ani…
The main result of this paper shows that almost all graphs of order $n$ have no cospectral mates with height $o(( n / \ln n)^{1/10})$, improving an earlier result on cospectral mates with fixed level …
We study convergence rates of random-order best-response dynamics in games on networks with linear best responses and strategic substitutes. Combining formal analysis with numerical simulations we ide…
This paper establishes an upper bound on the number of generalized cospectral mates of simple graphs, where the generalized spectrum consists of the spectrum of a graph and its complement. Moving beyo…
Measuring the function similarity to detect bugs is effective, but the statements unrelated to the bugs can impede the performance due to the noise interference. Suppressing the noise interference in …
Let $\mathcal{P}$ be a graph property. A $\mathcal{P}$-coloring with at most $k$ colors is a coloring of the vertices of a simple graph $G$ such that each color class induces a graph in $\mathcal{P}$.…
We study compact hyperbolic surfaces and multiplication observables, establishing a large-scale analogue of Zelditch's quantum mixing theorem with hypotheses that hold for both arithmetic and Weil--Pe…
This article offers a critical response to the preprint by Matheus et al. (2025), which evaluates the academic performance of students admitted through different entry routes at Sao Paulo State Univer…
We study the Bonnet problem in Bianchi--Cartan--Vr\u{a}nceanu spaces and in $\mathrm{Sol}_3$. Our main contribution is to establish the uniqueness of Bonnet mates, which leads us to address the proble…
Navigation through narrow passages during colony relocation by the tandem-running ants, $\textit{Diacamma}$ $\textit{indicum}$, is a tour de force of biological traffic coordination. Even on one-lane …
The problem of characterizing graphs determined by their spectrum (DS) or generalized spectrum (DGS) has been a longstanding topic of interest in spectral graph theory, originating from questions in c…
This paper presents a comprehensive computational approach to verify and inductively construct Hamiltonian paths for the Buratti--Horak--Rosa (BHR) Conjecture. The conjecture posits that for any multi…
We quantitatively relate the resonance sets of topologically finite infinite-area hyperbolic surfaces with no cusps to the resonance sets of certain metric graphs via the spine graph construction. In …
Nucleic acids have been regarded as stiff polymers with long-range flexibility and generally modeled using elastic rod models of polymer physics. Notwithstanding, investigations carried out over the p…
Insects rely on their hearing in order to communicate, identify and locate potential mates, and avoid predators. Due to their small sizes, many insect species are not able to utilize the interaural ti…
This paper examines the spectral characterizations of oriented graphs. Let $\Sigma$ be an $n$-vertex oriented graph with skew-adjacency matrix $S$. Previous research mainly focused on self-converse or…
Let $D$ be an oriented graph with skew adjacency matrix $S(D)$. Two oriented graphs $D$ and $C$ are said to share the same generalized skew spectrum if $S(D)$ and $S(C)$ have the same eigenvalues, and…
We prove that for finitely generated free semigroup actions the average shadowing property, the weak asymptotic average shadowing property, the mean ergodic shadowing property, the almost asymptotic a…
A challenging simulation of evolutionary dynamics based on a three-state cellular automaton is used as a test of how cooperation can drive the evolution of complex traits. Building on the approach of …
Free open-access publishing with Google Scholar indexing.
Submission Guide →