Network Extreme Eigenvalue - from Multimodal to Scale-free Network

The extreme eigenvalues of adjacency matrices are important indicators on the influences of topological structures to collective dynamical behavior of complex networks. Recent findings on the ensemble averageability of the extreme eigenvalue further authenticate its sensibility in the study of network dynamics. Here we determine the ensemble average of the extreme eigenvalue and characterize the deviation across the ensemble through the discrete form of random scale-free network. Remarkably, the analytical approximation derived from the discrete form shows significant improvement over the previous results. This has also led us to the same conclusion as [Phys. Rev. Lett. 98, 248701 (2007)] that deviation in the reduced extreme eigenvalues vanishes as the network size grows.Comment: 12 pages, 4 figure

Divergence in Dialogue

Copyright: 2014 Healey et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.This work was supported by the Economic and Social Research Council (ESRC; http://www.esrc.ac.uk/) through the DynDial project (Dynamics of Conversational Dialogue, RES-062-23-0962) and the Engineering and Physical Sciences Research Council (EPSRC; http://www.epsrc.ac.uk/) through the RISER project (Robust Incremental Semantic Resources for Dialogue, EP/J010383/1). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript

Global analysis of entrainment in dialogues

This paper performs a global analysis of entrainment between dyads in map-task dialogues in European Portuguese (EP), including 48 dialogues, between 24 speakers. Our main goals focus on the acoustic-prosodic similarities between speakers, namely if there are global entrainment cues displayed in the dialogues, if there are degrees of entrainment manifested in distinct sets of features shared amongst the speakers, if entrainment depends on the role of the speaker as either giver or follower, and also if speakers tend to entrain more with specific pairs regardless of the role. Results show global entrainment in almost all the dyads, but the degrees of entrainment (stronger within the same gender), and the role effects tend to be less striking than the interlocutors’ effect. Globally, speakers tend to be more similar to their own speech in other dialogues than to their partners. However, speakers are also more similar to their interlocutors than to speakers with whom they never spoke.info:eu-repo/semantics/publishedVersio

Dynamics of a deep-water seagrass population on the Great Barrier Reef: annual occurrence and response to a major dredging program

Global seagrass research efforts have focused on shallow coastal and estuarine seagrass populations where alarming declines have been recorded. Comparatively little is known about the dynamics of deep-water seagrasses despite evidence that they form extensive meadows in some parts of the world. Deep-water seagrasses are subject to similar anthropogenic threats as shallow meadows, particularly along the Great Barrier Reef lagoon where they occur close to major population centres. We examine the dynamics of a deep-water seagrass population in the GBR over an 8 year period during which time a major capital dredging project occurred. Seasonal and inter-annual changes in seagrasses were assessed as well as the impact of dredging. The seagrass population was found to occur annually, generally present between July and December each year. Extensive and persistent turbid plumes from a large dredging program over an 8 month period resulted in a failure of the seagrasses to establish in 2006, however recruitment occurred the following year and the regular annual cycle was re-established. Results show that despite considerable inter annual variability, deep-water seagrasses had a regular annual pattern of occurrence, low resistance to reduced water quality but a capacity for rapid recolonisation on the cessation of impacts

Enhanced imaging of microcalcifications in digital breast tomosynthesis through improved image-reconstruction algorithms

PURPOSE: We develop a practical, iterative algorithm for image-reconstruction in under-sampled tomographic systems, such as digital breast tomosynthesis (DBT). METHOD: The algorithm controls image regularity by minimizing the image total $p$-variation (TpV), a function that reduces to the total variation when $p=1.0$ or the image roughness when $p=2.0$. Constraints on the image, such as image positivity and estimated projection-data tolerance, are enforced by projection onto convex sets (POCS). The fact that the tomographic system is under-sampled translates to the mathematical property that many widely varied resultant volumes may correspond to a given data tolerance. Thus the application of image regularity serves two purposes: (1) reduction of the number of resultant volumes out of those allowed by fixing the data tolerance, finding the minimum image TpV for fixed data tolerance, and (2) traditional regularization, sacrificing data fidelity for higher image regularity. The present algorithm allows for this dual role of image regularity in under-sampled tomography. RESULTS: The proposed image-reconstruction algorithm is applied to three clinical DBT data sets. The DBT cases include one with microcalcifications and two with masses. CONCLUSION: Results indicate that there may be a substantial advantage in using the present image-reconstruction algorithm for microcalcification imaging.Comment: Submitted to Medical Physic

Parameterized Edge Hamiltonicity

We study the parameterized complexity of the classical Edge Hamiltonian Path problem and give several fixed-parameter tractability results. First, we settle an open question of Demaine et al. by showing that Edge Hamiltonian Path is FPT parameterized by vertex cover, and that it also admits a cubic kernel. We then show fixed-parameter tractability even for a generalization of the problem to arbitrary hypergraphs, parameterized by the size of a (supplied) hitting set. We also consider the problem parameterized by treewidth or clique-width. Surprisingly, we show that the problem is FPT for both of these standard parameters, in contrast to its vertex version, which is W-hard for clique-width. Our technique, which may be of independent interest, relies on a structural characterization of clique-width in terms of treewidth and complete bipartite subgraphs due to Gurski and Wanke

Self-organization of collaboration networks

We study collaboration networks in terms of evolving, self-organizing bipartite graph models. We propose a model of a growing network, which combines preferential edge attachment with the bipartite structure, generic for collaboration networks. The model depends exclusively on basic properties of the network, such as the total number of collaborators and acts of collaboration, the mean size of collaborations, etc. The simplest model defined within this framework already allows us to describe many of the main topological characteristics (degree distribution, clustering coefficient, etc.) of one-mode projections of several real collaboration networks, without parameter fitting. We explain the observed dependence of the local clustering on degree and the degree--degree correlations in terms of the ``aging'' of collaborators and their physical impossibility to participate in an unlimited number of collaborations.Comment: 10 pages, 8 figure