1,600 research outputs found
Random induced subgraphs of Cayley graphs induced by transpositions
In this paper we study random induced subgraphs of Cayley graphs of the
symmetric group induced by an arbitrary minimal generating set of
transpositions. A random induced subgraph of this Cayley graph is obtained by
selecting permutations with independent probability, . Our main
result is that for any minimal generating set of transpositions, for
probabilities where , a random induced subgraph has a.s. a unique
largest component of size , where
is the survival probability of a specific branching process.Comment: 18 pages, 1 figur
Backbone colorings for networks: tree and path backbones
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph and a spanning subgraph of (the backbone of ), a backbone coloring for and is a proper vertex coloring of in which the colors assigned to adjacent vertices in differ by at least two. We study the cases where the backbone is either a spanning tree or a spanning path
A general framework for coloring problems: old results, new results, and open problems
In this survey paper we present a general framework for coloring problems that was introduced in a joint paper which the author presented at WG2003. We show how a number of different types of coloring problems, most of which have been motivated from frequency assignment, fit into this framework. We give a survey of the existing results, mainly based on and strongly biased by joint work of the author with several different groups of coauthors, include some new results, and discuss several open problems for each of the variants
Distributed Testing of Excluded Subgraphs
We study property testing in the context of distributed computing, under the
classical CONGEST model. It is known that testing whether a graph is
triangle-free can be done in a constant number of rounds, where the constant
depends on how far the input graph is from being triangle-free. We show that,
for every connected 4-node graph H, testing whether a graph is H-free can be
done in a constant number of rounds too. The constant also depends on how far
the input graph is from being H-free, and the dependence is identical to the
one in the case of testing triangles. Hence, in particular, testing whether a
graph is K_4-free, and testing whether a graph is C_4-free can be done in a
constant number of rounds (where K_k denotes the k-node clique, and C_k denotes
the k-node cycle). On the other hand, we show that testing K_k-freeness and
C_k-freeness for k>4 appear to be much harder. Specifically, we investigate two
natural types of generic algorithms for testing H-freeness, called DFS tester
and BFS tester. The latter captures the previously known algorithm to test the
presence of triangles, while the former captures our generic algorithm to test
the presence of a 4-node graph pattern H. We prove that both DFS and BFS
testers fail to test K_k-freeness and C_k-freeness in a constant number of
rounds for k>4
Anyonic interferometry and protected memories in atomic spin lattices
Strongly correlated quantum systems can exhibit exotic behavior called
topological order which is characterized by non-local correlations that depend
on the system topology. Such systems can exhibit remarkable phenomena such as
quasi-particles with anyonic statistics and have been proposed as candidates
for naturally fault-tolerant quantum computation. Despite these remarkable
properties, anyons have never been observed in nature directly. Here we
describe how to unambiguously detect and characterize such states in recently
proposed spin lattice realizations using ultra-cold atoms or molecules trapped
in an optical lattice. We propose an experimentally feasible technique to
access non-local degrees of freedom by performing global operations on trapped
spins mediated by an optical cavity mode. We show how to reliably read and
write topologically protected quantum memory using an atomic or photonic qubit.
Furthermore, our technique can be used to probe statistics and dynamics of
anyonic excitations.Comment: 14 pages, 6 figure
Automorphisms generating disjoint Hamilton cycles in star graphs
In the first part of the thesis we define an automorphism φn for each star graph
Stn of degree n − 1, which yields permutations of labels for the edges of Stn
taken from the set of integers {1, . . . , bn/2c}. By decomposing these permutations
into permutation cycles, we are able to identify edge-disjoint Hamilton cycles
that are automorphic images of a known two-labelled Hamilton cycle H1 2(n)
in Stn. Our main result is an improvement from the existing lower bound of
bϕ(n)/10c to b2ϕ(n)/9c, where ϕ is Euler’s totient function, for the known number
of edge-disjoint Hamilton cycles in Stn for all odd integers n. For prime n, the
improvement is from bn/8c to bn/5c. We extend this result to the cases when n
is the power of a prime other than 3 and 7.
The second part of the thesis studies ‘symmetric’ collections of edge-disjoint
Hamilton cycles in Stn, i.e. collections that comprise images of H1 2(n) under
general label-mapping automorphisms. We show that, for all even n, there exists
a symmetric collection of bϕ(n)/2c edge-disjoint Hamilton cycles, and Stn cannot
have symmetric collections of greater than bϕ(n)/2c such cycles for any n. Thus,
Stn is not symmetrically Hamilton decomposable if n is not prime. We also give
cases of even n, in terms of Carmichael’s reduced totient function λ, for which
‘strongly’ symmetric collections of edge-disjoint Hamilton cycles, which are generated
from H1 2(n) by a single automorphism, can and cannot attain the optimum
bound bϕ(n)/2c for symmetric collections. In particular, we show that if n is a
power of 2, then Stn has a spanning subgraph with more than half of the edges
of Stn, which is strongly symmetrically Hamilton decomposable. For odd n, it remains
an open problem as to whether the bϕ(n)/2c can be achieved for symmetric
collections, but we are able to show that, for certain odd n, a Ï•(n)/4 bound is
achievable and optimal for strongly symmetric collections.
The search for edge-disjoint Hamilton cycles in star graphs is important for the
design of interconnection network topologies in computer science. All our results
improve on the known bounds for numbers of any kind of edge-disjoint Hamilton
cycles in star graphs
The zero forcing polynomial of a graph
Zero forcing is an iterative graph coloring process, where given a set of
initially colored vertices, a colored vertex with a single uncolored neighbor
causes that neighbor to become colored. A zero forcing set is a set of
initially colored vertices which causes the entire graph to eventually become
colored. In this paper, we study the counting problem associated with zero
forcing. We introduce the zero forcing polynomial of a graph of order
as the polynomial , where is
the number of zero forcing sets of of size . We characterize the
extremal coefficients of , derive closed form expressions for
the zero forcing polynomials of several families of graphs, and explore various
structural properties of , including multiplicativity,
unimodality, and uniqueness.Comment: 23 page
High-dimensional quantum information processing with linear optics
Quantum information processing (QIP) is an interdisciplinary field concerned with the development of computers and information processing systems that utilize quantum mechanical properties of nature to carry out their function. QIP systems have become vastly more practical since the turn of the century. Today, QIP applications span imaging, cryptographic security, computation, and simulation (quantum systems that mimic other quantum systems).
Many important strategies improve quantum versions of classical information system hardware, such as single photon detectors and quantum repeaters. Another more abstract strategy engineers high-dimensional quantum state spaces, so that each successful event carries more information than traditional two-level systems allow. Photonic states in particular bring the added advantages of weak environmental coupling and data transmission near the speed of light, allowing for simpler control and lower system design complexity.
In this dissertation, numerous novel, scalable designs for practical high-dimensional linear-optical QIP systems are presented. First, a correlated photon imaging scheme using orbital angular momentum (OAM) states to detect rotational symmetries in objects using measurements, as well as building images out of those interactions is reported. Then, a statistical detection method using chains of OAM superpositions distributed according to the Fibonacci sequence is established and expanded upon. It is shown that the approach gives rise to schemes for sorting, detecting, and generating the recursively defined high-dimensional states on which some quantum cryptographic protocols depend.
Finally, an ongoing study based on a generalization of the standard optical multiport for applications in quantum computation and simulation is reported upon. The architecture allows photons to reverse momentum inside the device. This in turn enables realistic implementation of controllable linear-optical scattering vertices for carrying out quantum walks on arbitrary graph structures, a powerful tool for any quantum computer. It is shown that the novel architecture provides new, efficient capabilities for the optical quantum simulation of Hamiltonians and topologically protected states. Further, these simulations use exponentially fewer resources than feedforward techniques, scale linearly to higher-dimensional systems, and use only linear optics, thus offering a concrete experimentally achievable implementation of graphical models of discrete-time quantum systems
- …