LIST OF TABLES................................... (2009)
Jessie Katherine Campbell, Patrick Schnable, Cliff Bergman, Ryan Martin, John Mayfield, Jessie Katherine Campbell
Enumeration and symmetry of edit metric spaces by
Consistency of a recursive estimate of mixing distributions (2009)
Tokdar, Surya T., Martin, Ryan, Ghosh, Jayanta K.
Mixture models have received considerable attention recently and Newton [Sankhy\={a} Ser. A 64 (2002) 306--322] proposed a fast recursive algorithm for estimating a mixing distribution. We prove...
SITUATION-SPECIFIC INFERENCE USING THE DEMPSTER-SHAFER THEORY (2009)
Chuanhai Liu, Ryan Martin, Jianchun Zhang
R.A. Fisher questioned the sampling-based approach to statistical inference on the grounds that it often cannot really answer the scientific question of interest. Fisher’s fiducial argument and the...
Results from the Neutral Current Detector phase of the Sudbury Neutrino Observatory (2009)
The Sudbury Neutrino Observatory (SNO) was a heavy water Cerenkov detector designed to solve the long-standing ``solar neutrino problem''; a discrepancy between the measured and predicted flux of...
Thesis (Ph.D, Physics, Engineering Physics and Astronomy) -- Queen's University, 2009-09-16 15:56:28.195
Tiling tripartite graphs with 3-colorable graphs (2008)
For a fixed integer h>=1, let G be a tripartite graph with N vertices in each vertex class, N divisible by 6h, such that every vertex is adjacent to at least 2N/3+h-1 vertices in each of the other...
AVOIDING RAINBOW INDUCED SUBGRAPHS IN VERTEX-COLORINGS (2008)
Abstract. For a fixed graph H on k vertices, and a graph G on at least k vertices, we write G − → H if in any vertex-coloring of G with k colors, there is an induced subgraph isomorphic to H...
Avoiding rainbow induced subgraphs in vertex-colorings (2008)
For a fixed graph H on k vertices, and a graph G on at least k vertices, we write G − → H if in any vertex-coloring of G with k colors, there is an induced subgraph isomorphic to H whose vertices...
On Avoider-Enforcer games (2008)
In the Avoider-Enforcer game on the complete graph Kn, the players (Avoider and Enforcer) each take an edge in turn. Enforcer wins the game when he can require Avoider’s graph to have a given...
Avoiding patterns in matrices via a small number of changes (2008)
Let A = {A1,..., Ar} be a partition of a set {1,..., m} × {1,..., n} into r nonempty subsets, and A = (aij) be an m × n matrix. We say that A has a pattern A provided that aij = ai ′ j ′ if and...
Sub-Ramsey numbers for arithmetic progressions (2008)
Abstract. Let the integers 1,...,n be assigned colors. Szemerédi’s theorem implies that if there is a dense color class then there is an arithmetic progression of length three in that color. We...
The editing distance in graphs (2008)
Maria Axenovich, André Kézdy, Ryan Martin
An edge-operation on a graph G is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs G, the editing distance from G to G is the...
The editing distance in graphs (2008)
Maria Axenovich, André Kézdy, Ryan Martin
An edge-operation on a graph G is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs G, the editing distance from G to G is the...
Tom Bohman, Colin Cooper, Ryan Martin, Miklós Ruszinkó
Let c be a positive constant. We show that if r = ⌊cn1/3 � ⌋ and the members of are chosen sequentially at random to form an intersecting hypergraph then with � [n] r limiting probability (1...
Let G be a quadripartite graph with N vertices in each vertex class and each vertex is adjacent to at least (3/4)N vertices in each of the other classes. There exists an N0 such that, if N ≥ N0,...
Automation of compressor test procedure using Advantech Data Acquisition Module (2008)
Mazid, Abdul Md., Martin, Ryan.
Abstract—This article offers a newly design and built industrial automation technique for compressor testing procedures for their final tests of assembled compressors. Sequential total test...
Automation of compressor test procedure using Advantech Data Acquisition Module (2008)
Mazid, Abdul Md., Martin, Ryan.
Abstract—This article offers a newly design and built industrial automation technique for compressor testing procedures for their final tests of assembled compressors. Sequential total test...
Adding random edges to dense graphs (2007)
Tom Bohman, Alan Frieze, Michael Krivelevich, Ryan Martin
This paper investigates the addition of random edges to arbitrary dense graphs; in particular, we determine the number of random edges required to ensure various monotone properties including the...
Let the edges of a graph G be coloured so that no colour is used more than k times. We refer to this as a k-bounded colouring. We say that a subset of the edges of G is polychromatic if each edge is...
Tahir Cagin, Guofeng Wang, Ryan Martin, Georgios Zamanakos, Daniel T. Mainz
Dendrimers and hyperbranched polymers represent a novel class of structurally controlled macromolecules derived from a branches-upon-branches structural motif. The synthetic procedures developed for...
Recent Advances in Simulation of Dendritic Polymers (2007)
Tahir Cagin, Paul J. Miklis, Guofeng Wang, Georgios Zamanakos, Ryan Martin, Hao Li, ...
Dendrimers and hyperbranched polymers represent a revolution in methodology for directed synthesis of monodisperse polymers with enormous possibility of novel architectures. They demonstrate ability...
Edit distance and its computation (2007)
In this paper, we provide a method for determining the asymptotic value of the maximum edit distance from a given hereditary property. This method permits the edit distance to be computed without...
On the editing distance of graphs (2006)
Axenovich, Maria, Kézdy, André, Martin, Ryan
An edge-operation on a graph $G$ is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs $\cG$, the editing distance from $G$ to $\cG$...
József Balogh, Ryan Martin, András Pluhár
Abstract. A large class of the so-called Positional Games are defined on the complete graph on n vertices. The players, Maker and Breaker, take the edges of the graph in turns, and Maker wins iff his...
Tom Bohman, Miklós Ruszinkó, Ryan Martin, Cliff Smyth
Let c be a positive constant. Suppose that r = o(n5/12) and the members of � � [n] r are chosen sequentially at random to form an intersecting hypergraph H. We show that whp1 H consists of a...
Hungarian Academy of Sciences (2006)
Alan Frieze, Ryan Martin, Julien Moncel, Miklós Ruszinkó, Cliff Smyth
In this paper we deal with codes identifying sets of vertices in random networks; that is, (1, ≤ ℓ)-identifying codes. These codes enable us to detect sets of faulty processors in a...
On weighted Ramsey numbers (2006)
The weighted Ramsey number, wR(n, k), is the minimum q such that there is an assignment of nonnegative real numbers (weights) to the edges of Kn with the total sum of the weights equal to � � n 2...
In a generalized Maker-Breaker positional game, Maker and Breaker play in turns. Maker makes a moves in each turn and Breaker makes b moves in each turn. We choose Maker to be the first player,...
On Randomly Generated Intersecting Hypergraphs II (2004)
Tom Bohman, Alan Frieze, Ryan Martin, Miklos Ruszinko, Cliff Smyth
Let c be a positive constant. Suppose that r=n ! 1 and r = o(n ) and the members of are chosen sequentially at random to form an intersecting hypergraph H.
How many random edges make a dense graph Hamiltonian?, Random Structures and Algorithms 22 (2003)
Tom Bohman, Alan Frieze, Ryan Martin
This paper investigates the number of random edges required to add to an arbitrary dense graph in order to make the resulting graph Hamiltonian with high probability. Adding (n) random edges is both...
On Randomly Generated Intersecting Hypergraphs (2003)
Tom Bohman, Colin Cooper, Alan Frieze, Ryan Martin, Miklós Ruszinkó
Let c be a positive constant. We show that if r = #cn and the members of are chosen sequentially at random to form an intersecting hypergraph then with limiting probability (1 + c ) -1 ,asn ##, the...
On Randomly Generated Intersecting Hypergraphs (2003)
Tom Bohman, Colin Cooper, Alan Frieze, Ryan Martin
Let c be a positive constant. We show that if r = bcn c and the members of are chosen sequentially at random to form an intersecting hypergraph then with limiting probability (1 + c ) , as n !1, the...
The Emergence of a Giant Component in Random Subgraphs of Pseudo-Random Graphs (2003)
Alan Frieze, Michael Krivelevich, Ryan Martin
Let G be a d-regular graph G on n vertices. Suppose that the adjacency matrix of G is such that the eigenvalue which is second largest in absolute value satis es = o(d).
Adding Random Edges to Dense Graphs (2003)
Tom Bohman, Alan Frieze, Michael Krivelevich, Ryan Martin
This paper investigates the addition of random edges to arbitrary dense graphs; in particular, we determine the number of random edges required to ensure various monotone properties including the...
Tahir Cagin, Guofeng Wang, Ryan Martin, Georgios Zamanakos, Nagarajan Vaidehi, T. Mainz, ...
Multiscale modeling and simulation methods with applications
Molecular modelling of dendrimers for nanoscale applications (2000)
Çağin, Tahir, Wang, Guofeng, Martin, Ryan, Breen, Nicholas
Dendrimers are well defined, highly branched macromolecules that radiate from a central core and are synthesized through a stepwise, repetitive reaction sequence that guarantees complete shells for...
Molecular Modelling of Dendrimers for Nanoscale Applications (2000)
Tahir Çagin, Tahir Ça ˘gın, Guofeng Wang, Ryan Martin, Nicholas Breen, ...
. Dendrimers are well defined, highly branched macromolecules that radiate from a central core and are synthesized through a stepwise, repetitive reaction sequence that guarantees complete shells for...
Extremal graph theory; probabilistic methods. combinatorics; regularity methods; random models; Education Rutgers University Ph.D. in Mathematics, October 2000. Adviser: Prof. Endre Szemerédi....
This article examines what states are doing to help Temporary Assistance to Needy Families (TANF) recipients move into the workforce and become self-supporting. We first present documentation...