Strong evidence links the 5-HTTLPR genotype to the modulation of amygdala reactivity during fear conditioning, which is considered to convey the increased vulnerability for anxiety disorders in s-allele carriers. In addition to amygdala reactivity, the 5-HTTLPR has been shown to be related to alterations in structural and effective connectivity. The aim of this study was to investigate the effe...

We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log(·) obtained by Armoni, Ta-Shma, Wigderson and Zhou [ATSWZ00]. As undirected st-connectivity is complete for the class of problems solvable by symmetric, non-deterministic, log-space computations (the class SL), this al...

We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log(·) obtained by Armoni, Ta-Shma, Wigderson and Zhou [ATSWZ00]. As undirected st-connectivity is complete for the class of problems solvable by symmetric, non-deterministic, log-space computations (the class SL), this al...

Changes in effective connectivity during the performance of a motor task appear important for the pathogenesis of motor symptoms in Parkinson's disease (PD). One type of task that is typically difficult for individuals with PD is simultaneous or bimanual movement, and here we investigate the changes in effective connectivity as a potential mechanism. Eight PD subjects off and on l-DOPA medicati...

Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...