APPROXIMATING THE NEAREST NEIGHBOR INTERCHARGE DISTANCE FOR NON-UNIFORM-DEGREE EVOLUTIONARY TREES

2001 ◽  
Vol 12 (04) ◽  
pp. 533-550 ◽  
Author(s):  
WING-KAI HON ◽  
TAK-WAH LAM
Keyword(s):  
Approximation Algorithms ◽  
Maximum Degree ◽  
Nearest Neighbor ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Approximation Ratio ◽  
Evolutionary Trees ◽  
Weighted Trees ◽  
Np Complete ◽  
Necessary And Sufficient

The nearest neighbor interchange (nni) distance is a classical metric for measuring the distance (dissimilarity) between evolutionary trees. It has been known that computing the nni distance is NP-complete. Existing approximation algorithms can attain an approximation ratio log n for unweighted trees and 4 log n for weighted trees; yet these algorithms are limited to degree-3 trees. This paper extends the study of nni distance to trees with non-uniform degrees. We formulate the necessary and sufficient conditions for nni transformation and devise more topology-sensitive approximation algorithms to handle trees with non-uniform degrees. The approximation ratios are respectively [Formula: see text] and [Formula: see text] for unweighted and weighted trees, where d ≥ 4 is the maximum degree of the input trees.

scholarly journals Equivalent necessary and sufficient conditions on noise sequences for stochastic approximation algorithms

1996 ◽  
Vol 28 (3) ◽  
pp. 784-801 ◽  
Author(s):  
I-Jeng Wang ◽  
Edwin K. P. Chong ◽  
Sanjeev R. Kulkarni
Keyword(s):  
Hilbert Space ◽  
Approximation Algorithms ◽  
Stochastic Approximation ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Necessary And Sufficient ◽  
Noise Sequences

We consider stochastic approximation algorithms on a general Hilbert space, and study four conditions on noise sequences for their analysis: Kushner and Clark's condition, Chen's condition, a decomposition condition, and Kulkarni and Horn's condition. We discuss various properties of these conditions. In our main result we show that the four conditions are all equivalent, and are both necessary and sufficient for convergence of stochastic approximation algorithms under appropriate assumptions.

scholarly journals Hamiltonian Paths in Some Classes of Grid Graphs

2012 ◽  
Vol 2012 ◽  
pp. 1-17 ◽  
Author(s):  
Fatemeh Keshavarz-Kohjerdi ◽  
Alireza Bagheri
Keyword(s):  
Linear Time ◽  
Hamiltonian Path ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Hamiltonian Paths ◽  
Grid Graphs ◽  
Hamiltonian Path Problem ◽  
Np Complete ◽  
Necessary And Sufficient ◽  
Linear Time Algorithms

The Hamiltonian path problem for general grid graphs is known to be NP-complete. In this paper, we give necessary and sufficient conditions for the existence of Hamiltonian paths inL-alphabet,C-alphabet,F-alphabet, andE-alphabet grid graphs. We also present linear-time algorithms for finding Hamiltonian paths in these graphs.

scholarly journals Density and trace results in generalized fractal networks

2018 ◽  
Vol 52 (3) ◽  
pp. 1023-1049
Author(s):  
Serge Nicaise ◽  
Adrien Semin
Keyword(s):  
Sobolev Space ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Trace Operator ◽  
Compactly Supported ◽  
Weighted Trees ◽  
Compactly Supported Functions ◽  
Necessary And Sufficient

The first aim of this paper is to give different necessary and sufficient conditions that guarantee the density of the set of compactly supported functions into the Sobolev space of order one in infinite p-adic weighted trees. The second goal is to define properly a trace operator in this Sobolev space if it makes sense.

scholarly journals Equivalent necessary and sufficient conditions on noise sequences for stochastic approximation algorithms

1996 ◽  
Vol 28 (03) ◽  
pp. 784-801 ◽  
Author(s):  
I-Jeng Wang ◽  
Edwin K. P. Chong ◽  
Sanjeev R. Kulkarni
Keyword(s):  
Hilbert Space ◽  
Approximation Algorithms ◽  
Stochastic Approximation ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Necessary And Sufficient ◽  
Noise Sequences

We consider stochastic approximation algorithms on a general Hilbert space, and study four conditions on noise sequences for their analysis: Kushner and Clark's condition, Chen's condition, a decomposition condition, and Kulkarni and Horn's condition. We discuss various properties of these conditions. In our main result we show that the four conditions are all equivalent, and are both necessary and sufficient for convergence of stochastic approximation algorithms under appropriate assumptions.

scholarly journals Quasi-Eulerian Hypergraphs

10.37236/6361 ◽  
2017 ◽  
Vol 24 (3) ◽  
Author(s):  
Amin Bahmanian ◽  
Mateja Šajna
Keyword(s):  
Sufficient Conditions ◽  
Single Component ◽  
Necessary And Sufficient Conditions ◽  
Uniform Hypergraph ◽  
Triple Systems ◽  
Universal Cycles ◽  
Np Complete ◽  
Euler Tour ◽  
Necessary And Sufficient ◽  
Overlap Cycles

We generalize the notion of an Euler tour in a graph in the following way. An Euler family in a hypergraph is a family of closed walks that jointly traverse each edge of the hypergraph exactly once. An Euler tourthus corresponds to an Euler family with a single component. We provide necessary and sufficient conditions for the existence of an Euler family in an arbitrary hypergraph, and in particular, we show that every 3-uniform hypergraph without cut edges admits an Euler family. Finally, we show that the problem of existence of an Euler family is polynomial on the class of all hypergraphs.This work complements existing results on rank-1 universal cycles and 1-overlap cycles in triple systems, as well as recent results by Lonc and Naroski, who showed that the problem of existence of an Euler tour in a hypergraph is NP-complete.

scholarly journals The game chromatic number of trees and forests

2015 ◽  
Vol Vol. 17 no.2 (Graph Theory) ◽  
Author(s):  
Charles Dunn ◽  
Victor Larsen ◽  
Kira Lindke ◽  
Troy Retter ◽  
Dustin Toci
Keyword(s):  
Computational Complexity ◽  
Chromatic Number ◽  
Polynomial Time ◽  
Maximum Degree ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Game Chromatic Number ◽  
International Audience ◽  
Necessary And Sufficient ◽  
Open Question

International audience While the game chromatic number of a forest is known to be at most 4, no simple criteria are known for determining the game chromatic number of a forest. We first state necessary and sufficient conditions for forests with game chromatic number 2 and then investigate the differences between forests with game chromatic number 3 and 4. In doing so, we present a minimal example of a forest with game chromatic number 4, criteria for determining in polynomial time the game chromatic number of a forest without vertices of degree 3, and an example of a forest with maximum degree 3 and game chromatic number 4. This gives partial progress on the open question of the computational complexity of the game chromatic number of a forest.

The extinction time of a general birth and death process with catastrophes

1986 ◽  
Vol 23 (04) ◽  
pp. 851-858 ◽  
Author(s):  
P. J. Brockwell
Keyword(s):  
Laplace Transform ◽  
Size Distribution ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Death Process ◽  
Extinction Time ◽  
Birth And Death Process ◽  
Different Types ◽  
The Laplace Transform ◽  
Necessary And Sufficient

The Laplace transform of the extinction time is determined for a general birth and death process with arbitrary catastrophe rate and catastrophe size distribution. It is assumed only that the birth rates satisfyλ0= 0,λj> 0 for eachj> 0, and. Necessary and sufficient conditions for certain extinction of the population are derived. The results are applied to the linear birth and death process (λj=jλ, µj=jμ) with catastrophes of several different types.

Sign in / Sign up

Export Citation Format

Share Document