English
Related papers

Related papers: Evolutionary Hamiltonian Graph Theory

200 papers

The rise of trait-based ecology has led to an increased focus on the distribution and dynamics of traits in communities. However, a general theory of trait-based ecology, that can apply across different scales (e.g., species that differ in…

Populations and Evolution · Quantitative Biology 2015-02-25 Brian J. Enquist , Jon Norberg , Stephen P. Bonser , Cyrille Violle , Colleen T. Webb , Amanda Henderson , Lindsey L. Sloat , Van M. Savage

Causality is essential for understanding complex systems, such as the economy, the brain, and the climate. Constructing causal graphs often relies on either data-driven or expert-driven approaches, both fraught with challenges. The former…

Artificial Intelligence · Computer Science 2024-06-12 Kai-Hendrik Cohrs , Gherardo Varando , Emiliano Diaz , Vasileios Sitokonstantinou , Gustau Camps-Valls

For a connected graph, a path containing all vertices is known as \emph{Hamiltonian path}. For general graphs, there is no known necessary and sufficient condition for the existence of Hamiltonian paths and the complexity of finding a…

Discrete Mathematics · Computer Science 2016-07-21 P. Renjith , N. Sadagopan

Bayesian methods since the time of Laplace have been understood by their practitioners as closely aligned to the scientific method. Indeed a recent champion of Bayesian methods, E. T. Jaynes, titled his textbook on the subject Probability…

General Physics · Physics 2010-01-05 John Campbell

Economic growth and the growth of human population in the past 2,000,000 years are extensively examined. Data are found to be in a clear contradiction of the currently accepted explanations of the mechanism of growth, which revolve around…

Economics · Quantitative Finance 2017-10-06 Ron W. Nielsen

A Hamiltonian path (a Hamiltonian cycle) in a graph is a path (a cycle, respectively) that traverses all of its vertices. The problems of deciding their existence in an input graph are well-known to be NP-complete, in fact, they belong to…

Discrete Mathematics · Computer Science 2025-04-02 Nikola Jedličková , Jan Kratochvíl

We prove that if an $n$-vertex graph with minimum degree at least $3$ contains a Hamiltonian cycle, then it contains another cycle of length $n-o(n)$; this implies, in particular, that a well-known conjecture of Sheehan from 1975 holds…

Combinatorics · Mathematics 2017-09-19 António Girão , Teeradej Kittipassorn , Bhargav Narayanan

Lateral gene transfer (LGT) is a common mechanism of non-vertical evolution where genetic material is transferred between two more or less distantly related organisms. It is particularly common in bacteria where it contributes to adaptive…

Probability · Mathematics 2012-06-18 Sebastien Roch , Sagi Snir

In this paper, we discuss the conceptual underpinnings of Modern Coexistence Theory (MCT), a quantitative framework for understanding ecological coexistence. In order to use MCT to infer how species are coexisting, one must relate a complex…

Populations and Evolution · Quantitative Biology 2022-01-21 Evan Johnson , Alan Hastings

We show how to construct an explicit Hamilton cycle in the directed Cayley graph Cay({\sigma_n, sigma_{n-1}} : \mathbb{S}_n), where \sigma_k = (1 2 >... k). The existence of such cycles was shown by Jackson (Discrete Mathematics, 149 (1996)…

Discrete Mathematics · Computer Science 2007-10-10 Frank Ruskey , Aaron Williams

Large Language Models (LLMs) have demonstrated impressive reasoning capabilities, yet their performance is highly dependent on the prompting strategy and model scale. While reinforcement learning and fine-tuning have been deployed to boost…

Artificial Intelligence · Computer Science 2025-02-10 Tushar Pandey , Ara Ghukasyan , Oktay Goktas , Santosh Kumar Radha

A common assumption employed in most previous works on evolutionary game dynamics is that every individual player has full knowledge about and full access to the complete set of available strategies. In realistic social, economical, and…

Adaptation and Self-Organizing Systems · Physics 2018-11-14 Jun-Jie Jiang , Yu-Zhong Chen , Zi-Gang Huang , Ying-Cheng Lai

Large Language Models (LLMs) have unveiled remarkable capabilities in understanding and generating both natural language and code, but LLM reasoning is prone to hallucination and struggle with complex, novel scenarios, often getting stuck…

Neural and Evolutionary Computing · Computer Science 2025-05-12 Antonio Jimeno Yepes , Pieter Barnard

Large animal groups -- bird flocks, fish schools, insect swarms -- are often assumed to form by gradual aggregation of sparsely distributed individuals. Using a mathematically precise framework based on time-varying directed interaction…

Populations and Evolution · Quantitative Biology 2025-12-02 Jidong Jin

This MSci thesis surveys results in extremal graph theory, in particular relating to Hamilton cycles. Szem\'eredi's Regularity Lemma plays a central role. We also investigate the robust outexpansion property for digraphs. Kelly showed that…

Combinatorics · Mathematics 2014-06-30 Amelia Taylor

The natural infinite analogue of a (finite) Hamilton cycle is a two-way-infinite Hamilton path (connected spanning 2-valent subgraph). Although it is known that every connected $2k$-valent infinite circulant graph has a two-way-infinite…

Combinatorics · Mathematics 2017-01-31 Darryn Bryant , Sarada Herke , Barbara Maenhaut , Bridget Webb

A mathematical model of interacting species filling ecological niches left by the extinction of others is introduced. Species organize themselves into genera of all sizes. The size of a genus on average grows linearly with its age,…

Condensed Matter · Physics 2008-02-03 Susanna Manrubia , Maya Paczuski

In phylogenetic studies, the evolution of molecular sequences is assumed to have taken place along the phylogeny traced by the ancestors of extant species. In the presence of lateral gene transfer (LGT), however, this may not be the case,…

Populations and Evolution · Quantitative Biology 2013-07-01 Gergely J Szöllösi , Eric Tannier , Nicolas Lartillot , Vincent Daubin

We present eighteen exact analogs of six well-known fundamental Theorems (due to Dirac, Nash-Williams and Jung) in hamiltonian graph theory providing alternative compositions of graph invariants. In Theorems 1-3 we give three lower bounds…

Combinatorics · Mathematics 2012-04-10 Zh. G. Nikoghosyan

Inspired by the prospect of having discretized spaces emerge from random graphs, we construct a collection of simple and explicit exponential random graph models that enjoy, in an appropriate parameter regime, a roughly constant vertex…

Disordered Systems and Neural Networks · Physics 2021-10-01 Pawat Akara-pipattana , Thiparat Chotibut , Oleg Evnin