205 research outputs found
Flows and bisections in cubic graphs
A -weak bisection of a cubic graph is a partition of the vertex-set of
into two parts and of equal size, such that each connected
component of the subgraph of induced by () is a tree of at
most vertices. This notion can be viewed as a relaxed version of
nowhere-zero flows, as it directly follows from old results of Jaeger that
every cubic graph with a circular nowhere-zero -flow has a -weak bisection. In this paper we study problems related to the
existence of -weak bisections. We believe that every cubic graph which has a
perfect matching, other than the Petersen graph, admits a 4-weak bisection and
we present a family of cubic graphs with no perfect matching which do not admit
such a bisection. The main result of this article is that every cubic graph
admits a 5-weak bisection. When restricted to bridgeless graphs, that result
would be a consequence of the assertion of the 5-flow Conjecture and as such it
can be considered a (very small) step toward proving that assertion. However,
the harder part of our proof focuses on graphs which do contain bridges.Comment: 14 pages, 6 figures - revised versio
Internal Partitions of Regular Graphs
An internal partition of an -vertex graph is a partition of
such that every vertex has at least as many neighbors in its own part as in the
other part. It has been conjectured that every -regular graph with
vertices has an internal partition. Here we prove this for . The case
is of particular interest and leads to interesting new open problems on
cubic graphs. We also provide new lower bounds on and find new families
of graphs with no internal partitions. Weighted versions of these problems are
considered as well
Graph bisection algorithms
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1986.MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING.Bibliography: leaves 64-66.by Thang Nguyen Bui.Ph.D
On the minimum bisection of random regular graphs
In this paper we give new asymptotically almost sure lower and upper bounds
on the bisection width of random regular graphs. The main contribution is a
new lower bound on the bisection width of , based on a first moment
method together with a structural decomposition of the graph, thereby improving
a 27 year old result of Kostochka and Melnikov. We also give a complementary
upper bound of , combining known spectral ideas with original
combinatorial insights. Developping further this approach, with the help of
Monte Carlo simulations, we obtain a non-rigorous upper bound of .Comment: 48 pages, 20 figure
Cartan subalgebras in C*-algebras of Hausdorff etale groupoids
The reduced -algebra of the interior of the isotropy in any Hausdorff
\'etale groupoid embeds as a -subalgebra of the reduced
-algebra of . We prove that the set of pure states of with unique
extension is dense, and deduce that any representation of the reduced
-algebra of that is injective on is faithful. We prove that there
is a conditional expectation from the reduced -algebra of onto if
and only if the interior of the isotropy in is closed. Using this, we prove
that when the interior of the isotropy is abelian and closed, is a Cartan
subalgebra. We prove that for a large class of groupoids with abelian
isotropy---including all Deaconu--Renault groupoids associated to discrete
abelian groups--- is a maximal abelian subalgebra. In the specific case of
-graph groupoids, we deduce that is always maximal abelian, but show by
example that it is not always Cartan.Comment: 14 pages. v2: Theorem 3.1 in v1 incorrect (thanks to A. Kumjain for
pointing out the error); v2 shows there is a conditional expectation onto
iff the interior of the isotropy is closed. v3: Material (including some
theorem statements) rearranged and shortened. Lemma~3.5 of v2 removed. This
version published in Integral Equations and Operator Theor
Towards Resistance Sparsifiers
We study resistance sparsification of graphs, in which the goal is to find a
sparse subgraph (with reweighted edges) that approximately preserves the
effective resistances between every pair of nodes. We show that every dense
regular expander admits a -resistance sparsifier of size , and conjecture this bound holds for all graphs on nodes. In
comparison, spectral sparsification is a strictly stronger notion and requires
edges even on the complete graph.
Our approach leads to the following structural question on graphs: Does every
dense regular expander contain a sparse regular expander as a subgraph? Our
main technical contribution, which may of independent interest, is a positive
answer to this question in a certain setting of parameters. Combining this with
a recent result of von Luxburg, Radl, and Hein~(JMLR, 2014) leads to the
aforementioned resistance sparsifiers
Deleterious effect of suboptimal diet on rest-activity cycle in Anastrepha ludens manifests itself with age.
Activity patterns and sleep-wake cycles are among the physiological processes that change most prominently as animals age, and are often good indicators of healthspan. In this study, we used the video-based high-resolution behavioral monitoring system (BMS) to monitor the daily activity cycle of tephritid fruit flies Anastrepha ludens over their lifetime. Surprisingly, there was no dramatic change in activity profile with respect to age if flies were consistently fed with a nutritionally balanced diet. However, if flies were fed with sugar-only diet, their activity profile decreased in amplitude at old age, suggesting that suboptimal diet affected activity patterns, and its detrimental effect may not manifest itself until the animal ages. Moreover, by simulating different modes of behavior monitoring with a range of resolution and comparing the resulting conclusions, we confirmed the superior performance of video-based monitoring using high-resolution BMS in accurately representing activity patterns in an insect model
- …