English
Related papers

Related papers: The Sackin Index of Simplex Networks

200 papers

Graphs can model networked data by representing them as nodes and their pairwise relationships as edges. Recently, signal processing and neural networks have been extended to process and learn from data on graphs, with achievements in tasks…

Machine Learning · Computer Science 2021-10-07 Maosheng Yang , Elvin Isufi , Geert Leus

Phylogenetic inference, the task of reconstructing how related sequences evolved from common ancestors, is a central objective in evolutionary genomics. The current state-of-the-art methods exploit probabilistic models of sequence evolution…

Populations and Evolution · Quantitative Biology 2026-02-19 Luc Blassel , Noémie Sauvage , Pierre Barrat-Charlaix , Bastien Boussau , Nicolas Lartillot , Laurent Jacob

Acyclic networks are a class of complex networks in which links are directed and don't have closed loops. Here we present an algorithm for transforming an ordinary undirected complex network into an acyclic one. Further analysis of an…

Physics and Society · Physics 2012-07-17 Roman Shevchuk , Andrew Snarskii

Phylogenetic networks are used to represent the evolutionary history of species. They are versatile when compared to traditional phylogenetic trees, as they capture more complex evolutionary events such as hybridization and horizontal gene…

Combinatorics · Mathematics 2023-05-18 Shunsuke Maeda , Yusuke Kaneko , Hideaki Muramatsu , Yukihiro Murakami , Momoko Hayamizu

In this work, we answer an open problem in the study of phylogenetic networks. Phylogenetic trees are rooted binary trees in which all edges are directed away from the root, whereas phylogenetic networks are rooted acyclic digraphs. For the…

Populations and Evolution · Quantitative Biology 2015-11-12 Andreas D. M. Gunawan , Bhaskar DasGupta , Louxin Zhang

Billey et al. [arXiv:1507.04976] have recently discovered a surprisingly simple formula for the number $a_n(\sigma)$ of leaf-labelled rooted non-embedded binary trees (also known as phylogenetic trees) with $n\geq 1$ leaves, fixed (for the…

Combinatorics · Mathematics 2016-03-08 Éric Fusy

Rooted binary phylogenetic networks are extensions of rooted binary trees, adding reticulation nodes that are designed to represent evolutionary processes that involve hybridization events. Enumerative combinatorics studies have counted…

In principle, the rules of links formation of a network model can be considered as a kind of link prediction algorithm. By revisiting the preferential attachment mechanism for generating a scale-free network, here we propose a class of…

Physics and Society · Physics 2012-11-09 Ke Hu , Ju Xiang , Wanchun Yang , Xiaoke Xu , Yi Tang

Phylogenetic networks are a generalization of phylogenetic trees that allow for representation of reticulate evolution. Recently, a space of unrooted phylogenetic networks was introduced, where such a network is a connected graph in which…

Populations and Evolution · Quantitative Biology 2017-03-09 Andrew Francis , Katharina Huber , Vincent Moulton , Taoyang Wu

Phylogenetic networks are useful in representing the evolutionary history of taxa. In certain scenarios, one requires a way to compare different networks. In practice, this can be rather difficult, except within specific classes of…

Populations and Evolution · Quantitative Biology 2025-07-30 Christopher Reichling , Leo van Iersel , Yukihiro Murakami

For a given set $\mathcal{L}$ of species and a set $\mathcal{T}$ of triplets on $\mathcal{L}$, one wants to construct a phylogenetic network which is consistent with $\mathcal{T}$, i.e which represents all triplets of $\mathcal{T}$. The…

Populations and Evolution · Quantitative Biology 2015-03-19 Michel Habib , Thu-Hien To

A spanning tree $T$ in a graph $G$ is a sub-graph of $G$ with the same vertex set as $G$ which is a tree. In 1981, McKay proved an asymptotic result regarding the number of spanning trees in random $k$-regular graphs. In this paper we prove…

Combinatorics · Mathematics 2023-01-31 Ron Rosenthal , Lior Tenenbaum

Systems as diverse as genetic networks or the world wide web are best described as networks with complex topology. A common property of many large networks is that the vertex connectivities follow a scale-free power-law distribution. This…

Disordered Systems and Neural Networks · Physics 2015-06-25 Albert-Laszlo Barabasi , Reka Albert

A phylogenetic tree is an acyclic graph with distinctly labeled leaves, whose internal edges have a positive weight. Given a set of n leaves, the collection of all phylogenetic trees with this leaf set can be assembled into a metric cube…

Combinatorics · Mathematics 2019-04-02 Gillian Grindstaff

Driven by the need for better models that allow one to shed light into the question how life's diversity has evolved, phylogenetic networks have now joined phylogenetic trees in the center of phylogenetics research. Like phylogenetic trees,…

Combinatorics · Mathematics 2016-10-04 Philippe Gambette , Katharina T. Huber

Real-world networks such as the Internet and WWW have many common traits. Until now, hundreds of models were proposed to characterize these traits for understanding the networks. Because different models used very different mechanisms, it…

Social and Information Networks · Computer Science 2014-09-02 Bojin Zheng , Hongrun Wu , Li Kuang , Jun Qin , Wenhua Du , Jianmin Wang , Deyi Li

Simplicial complexes describe collaboration networks, protein interaction networks and brain networks and in general network structures in which the interactions can include more than two nodes. In real applications, often simplicial…

Physics and Society · Physics 2017-06-21 Owen T. Courtney , Ginestra Bianconi

Phylogenetic networks are important for the study of evolution. The number of methods to find such networks is increasing, but most such methods can only reconstruct small networks. To find bigger networks, one can attempt to combine small…

Discrete Mathematics · Computer Science 2019-12-10 Remie Janssen , Mark Jones , Yukihiro Murakami

Here we show that, given a set of clusters C on a set of taxa X, where |X|=n, it is possible to determine in time f(k).poly(n) whether there exists a level-<= k network (i.e. a network where each biconnected component has reticulation…

Computational Complexity · Computer Science 2011-08-19 Steven Kelk , Celine Scornavacca

Network science is a powerful framework allowing to model complex systems, it is capable to describe and take into account the intricate web of connections existing among the constituting basic element of the system. Recently scholars have…

Statistical Mechanics · Physics 2026-05-19 Diego Febbe , Duccio Fanelli , Timoteo Carletti