Spectral dynamics of guided edge removals and identifying transient amplifiers for death-birth updating
From MaRDI portal
Publication:6158565
Abstract: The paper deals with two interrelated topics, identifying transient amplifiers in an iterative process and analyzing the process by its spectral dynamics, which is the change in the graph spectra by edge manipulations. Transient amplifiers are networks representing population structures which shift the balance between natural selection and random drift. Thus, amplifiers are highly relevant for understanding the relationships between spatial structures and evolutionary dynamics. We study an iterative procedure to identify transient amplifiers for death-Birth updating. The algorithm starts with a regular input graph and iteratively removes edges until desired structures are achieved. Thus, a sequence of candidate graphs is obtained. The edge removals are guided by quantities derived from the sequence of candidate graphs. Moreover, we are interested in the Laplacian spectra of the candidate graphs and analyze the iterative process by its spectral dynamics. The results show that although transient amplifiers for death-Birth updating are rare, a substantial number of them can be obtained by the proposed procedure. The graphs identified share structural properties and have some similarity to dumbbell and barbell graphs. Also, the spectral dynamics possesses characteristic features useful for deducing links between structural and spectral properties and for distinguishing transient amplifiers among evolutionary graphs in general.
Recommendations
Cites work
- scientific article; zbMATH DE number 5605063 (Why is no real title available?)
- scientific article; zbMATH DE number 1232919 (Why is no real title available?)
- A construction of cospectral graphs for the normalized Laplacian
- A note on the spectral characterization of dumbbell graphs
- Amplifiers of selection
- An Interlacing Result on Normalized Laplacians
- Braess's paradox for the spectral gap in random graphs and delocalization of eigenvectors
- Clique-inserted-graphs and spectral dynamics of clique-inserting
- Effect on normalized graph Laplacian spectrum by motif attachment and duplication
- Evolutionary graph theory revisited: when is an evolutionary process equivalent to the Moran process
- Evolutionary graph theory: breaking the symmetry between interaction and replacement
- Fast generation of regular graphs and construction of cages
- Fixation probabilities in evolutionary dynamics under weak selection
- Fixation probabilities on superstars, revisited and revised
- GROUP, GRAPHS, ALGORITHMS: THE GRAPH ISOMORPHISM PROBLEM
- Graph spectra as a systematic tool in computational biology
- Graph theory
- Hamilton cycles and eigenvalues of graphs
- Martingales and the fixation probability of high-dimensional evolutionary graphs
- Metastable evolutionary dynamics: crossing fitness barriers or escaping via neutral paths?
- Minimizing Effective Resistance of a Graph
- Mutation-selection networks of cancer initiation: tumor suppressor genes and chromosomal instability
- On the spectrum of the normalized Laplacian for signed graphs: interlacing, contraction, and replication
- On the spectrum of the normalized graph Laplacian
- Optimizing algebraic connectivity by edge rewiring
- Optimizing network robustness by edge rewiring: a general framework
- Spatial stochastic models for cancer initiation and progression
- Spectral analysis of transient amplifiers for death-birth updating constructed from regular graphs
- Spectral classes of regular, random, and empirical graphs
- Spectral dynamics of graph sequences generated by subdivision and triangle extension
Cited in
(1)
This page was built for publication: Spectral dynamics of guided edge removals and identifying transient amplifiers for death-birth updating
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6158565)
