arXiv subjects

Jie Sun

Publications and source records attributed to Jie Sun.

At least 127 records · Page 7Linked to original sources

arXiv2017

Y-net: 3D intracranial artery segmentation using a convolutional autoencoder

Automated segmentation of intracranial arteries on magnetic resonance angiography (MRA) allows for quantification of cerebrovascular features, which provides tools for understanding aging and pathophysiological adaptations of the cerebrovascular system. Using a convolutional autoencoder (CAE) for segmentation is promising as it takes advantage of the autoencoder structure in effective noise reduction and feature extraction by representing high dimensional information with low dimensional latent variables. In this report, an optimized CAE model (Y-net) was trained to learn a 3D segmentation model of intracranial arteries from 49 cases of MRA data. The trained model was shown to perform better than the three traditional segmentation methods in both binary classification and visual evaluation.

eess.IV↗

arXiv2017

Sensitive Dependence of Optimal Network Dynamics on Network Structure

The relation between network structure and dynamics is determinant for the behavior of complex systems in numerous domains. An important long-standing problem concerns the properties of the networks that optimize the dynamics with respect to a given performance measure. Here we show that such optimization can lead to sensitive dependence of the dynamics on the structure of the network. Specifically, using diffusively coupled systems as examples, we demonstrate that the stability of a dynamical state can exhibit sensitivity to unweighted structural perturbations (i.e., link removals and node additions) for undirected optimal networks and to weighted perturbations (i.e., small changes in link weights) for directed optimal networks. As mechanisms underlying this sensitivity, we identify discontinuous transitions occurring in the complement of undirected optimal networks and the prevalence of eigenvector degeneracy in directed optimal networks. These findings establish a unified characterization of networks optimized for dynamical stability, which we illustrate using Turing instability in activator-inhibitor systems, synchronization in power-grid networks, network diffusion, and several other network processes. Our results suggest that the network structure of a complex system operating near an optimum can potentially be fine-tuned for a significantly enhanced stability compared to what one might expect from simple extrapolation. On the other hand, they also suggest constraints on how close to the optimum the system can be in practice. Finally, the results have potential implications for biophysical networks, which have evolved under the competing pressures of optimizing fitness while remaining robust against perturbations.

nlin.AO↗

arXiv2017

New strategy for black phosphorus crystal growth through ternary clathrate

We are reporting a new synthetic strategy to grow large size black phosphorus (Black-P) crystals through a ternary clathrate Sn$_{24}$P$_{22-x}$I$_8$, under lower synthetic temperature and pressure. The Black-P crystals are found grown in situ at the site where the solid clathrate originally resides, which suggests chemical vapor mineralizer does not play a critical role for the Black-P formation. More detailed systematical studies has indicated the P vacancies in the framework of ternary clathrate Sn$_{24}$P$_{22-x}$I$_8$ is important for the subsequent Black-P from phosphorus vapors, and a likely Vapor-Solid-Solid (VSS) model is responsible for the Black-P crystal growth. The obtained room temperature mobility μ is ~ 350 $cm^2/Vs$ from Hall measurements at mechanically-cleaved flake, where noticeable micro-cracks are visible. The obtained high mobility value further suggest the high quality of the Black-P crystals synthesized through this route.

cond-mat.mtrl-sci↗

arXiv2017

Construction,sensitivity index, and synchronization speed of optimal networks

The stability (or instability) of synchronization is important in a number of real world systems, including the power grid, the human brain and biological cells. For identical synchronization, the synchronizability of a network, which can be measured by the range of coupling strength that admits stable synchronization, can be optimized for a given number of nodes and links. Depending on the geometric degeneracy of the Laplacian eigenvectors, optimal networks can be classified into different sensitivity levels, which we define as a network's sensitivity index. We introduce an efficient and explicit way to construct optimal networks of arbitrary size over a wide range of sensitivity and link densities. Using coupled chaotic oscillators, we study synchronization dynamics on optimal networks, showing that cospectral optimal networks can have drastically different speed of synchronization. Such difference in dynamical stability is found to be closely related to the different structural sensitivity of these networks: generally, networks with high sensitivity index are slower to synchronize, and, surprisingly, may not synchronize at all, despite being theoretically stable under linear stability analysis.

nlin.CD↗

arXiv2017

On coherency and other properties of MAXVAR

This paper is concerned with the MAXVAR risk measure on L^2 space. We present an elementary and direct proof of its coherency and averseness. Based on the observation that the MAXVAR measure is a continuous convex combination of the CVaR measure, we provide an explicit formula for the risk envelope of MAXVAR.

q-fin.MF↗

arXiv2017

Data Fusion Reconstruction of Spatially Embedded Complex Networks

We introduce a kernel Lasso (kLasso) optimization that simultaneously accounts for spatial regularity and network sparsity to reconstruct spatial complex networks from data. Through a kernel function, the proposed approach exploits spatial embedding distances to penalize overabundance of spatially long-distance connections. Examples of both synthetic and real-world spatial networks show that the proposed method improves significantly upon existing network reconstruction techniques that mainly concerns sparsity but not spatial regularity. Our results highlight the promise of data fusion in the reconstruction of complex networks, by utilizing both microscopic node-level dynamics (e.g., time series data) and macroscopic network-level information (metadata).

physics.data-an↗

arXiv2017

BiFold visualization of bipartite datasets

The emerging domain of data-enabled science necessitates development of algorithms and tools for knowledge discovery. Human interaction with data through well-constructed graphical representation can take special advantage of our visual ability to identify patterns. We develop a data visualization framework, called BiFold, for exploratory analysis of bipartite datasets that describe binary relationships between groups of objects. Typical data examples would include voting records, organizational memberships, and pairwise associations, or other binary datasets. BiFold provides a low dimensional embedding of data that represents similarity by visual nearness, analogous to Multidimensional Scaling (MDS). The unique and new feature of BiFold is its ability to simultaneously capture both within-group and between-group relationships among objects, enhancing knowledge discovery. We benchmark BiFold using the {\it Southern Women Dataset}, where social groups are now visually evident. We construct BiFold plots for two US voting datasets: For the presidential election outcomes since 1976, BiFold illustrates the evolving geopolitical structures that underlie these election results. For Senate congressional voting, BiFold identifies a partisan coordinate, separating senators into two parties while simultaneously visualizing a bipartisan-coalition coordinate which captures the ultimate fate of the bills (pass/fail). Finally, we consider a global cuisine dataset of the association between recipes and food ingredients. BiFold allows us to visually compare and contrast cuisines while also allowing identification of signature ingredients of individual cuisines.

cs.SI↗

arXiv2017

Modeling spatial social complex networks for dynamical processes

The study of social networks --- where people are located, geographically, and how they might be connected to one another --- is a current hot topic of interest, because of its immediate relevance to important applications, from devising efficient immunization techniques for the arrest of epidemics, to the design of better transportation and city planning paradigms, to the understanding of how rumors and opinions spread and take shape over time. We develop a spatial social complex network (SSCN) model that captures not only essential connectivity features of real-life social networks, including a heavy-tailed degree distribution and high clustering, but also the spatial location of individuals, reproducing Zipf's law for the distribution of city populations as well as other observed hallmarks. We then simulate Milgram's Small-World experiment on our SSCN model, obtaining good qualitative agreement with the known results and shedding light on the role played by various network attributes and the strategies used by the players in the game. This demonstrates the potential of the SSCN model for the simulation and study of the many social processes mentioned above, where both connectivity and geography play a role in the dynamics.

physics.soc-ph↗

arXiv2017

On the Dual Representation of Coherent Risk Measures

A classical result in risk measure theory states that every coherent risk measure has a dual representation as the supremum of certain expected value over a risk envelope. We study this topic in more detail. The related issues include: 1. Set operations of risk envelopes and how they change the risk measures, 2. The structure of risk envelopes of popular risk measures, 3. Aversity of risk measures and its impact to risk envelopes, and 4. A connection between risk measures in stochastic optimization and uncertainty sets in robust optimization.

math.OC↗

arXiv2016

Information theoretical noninvasive damage detection in bridge structures

Damage detection of mechanical structures such as bridges is an important research problem in civil engineering. Using spatially distributed sensor time series data collected from a recent experiment on a local bridge in upper state New York, we study noninvasive damage detection using information-theoretical methods. Several findings are in order. First, the time series data, which represent accelerations measured at the sensors, more closely follow Laplace distribution than normal distribution, allowing us to develop parameter estimators for various information-theoretic measures such as entropy and mutual information. Secondly, as damage is introduced by the removal of bolts of the first diaphragm connection, the interaction between spatially nearby sensors as measured by mutual information become weaker, suggesting that the bridge is "loosened". Finally, using a proposed oMII procedure to prune away indirect interactions, we found that the primary direction of interaction or influence aligns with the traffic direction on the bridge even after damaging the bridge.

stat.AP↗

arXiv2016

Inference of Causal Information Flow in Collective Animal Behavior

Understanding and even defining what constitutes animal interactions remains a challenging problem. Correlational tools may be inappropriate for detecting communication between a set of many agents exhibiting nonlinear behavior. A different approach is to define coordinated motions in terms of an information theoretic channel of direct causal information flow. In this work, we consider time series data obtained by an experimental protocol of optical tracking of the insect species Chironomus riparius. The data constitute reconstructed 3-D spatial trajectories of the insects' flight trajectories and kinematics. We present an application of the optimal causation entropy (oCSE) principle to identify direct causal relationships or information channels among the insects. The collection of channels inferred by oCSE describes a network of information flow within the swarm. We find that information channels with a long spatial range are more common than expected under the assumption that causal information flows should be spatially localized. The tools developed herein are general and applicable to the inference and study of intercommunication networks in a wide variety of natural settings.

q-bio.QM↗

arXiv2016

A robust optimal control problem with moment constraints on distribution: theoretical analysis and an algorithm

We study an optimal control problem in which both the objective function and the dynamic constraint contain an uncertain parameter. Since the distribution of this uncertain parameter is not exactly known, the objective function is taken as the worst-case expectation over a set of possible distributions of the uncertain parameter. This ambiguity set of distributions is, in turn, defined by the first two moments of the random variables involved. The optimal control is found by minimizing the worst-case expectation over all possible distributions in this set. If the distributions are discrete, the stochastic min-max optimal control problem can be converted into a convensional optimal control problem via duality, which is then approximated as a finite-dimensional optimization problem via the control parametrization. We derive necessary conditions of optimality and propose an algorithm to solve the approximation optimization problem. The results of discrete probability distribution are then extended to the case with one dimensional continuous stochastic variable by applying the control parametrization methodology on the continuous stochastic variable, and the convergence results are derived. A numerical example is present to illustrate the potential application of the proposed model and the effectiveness of the algorithm.

math.OC↗

arXiv2016

Chiral charge pumping in graphene deposited on a magnetic insulator

We demonstrate that a sizable chiral charge pumping can be achieved at room temperature in graphene/Yttrium Iron Garnet (YIG) bilayer systems. The effect, which cannot be attributed to the ordinary spin pumping, reveals itself in the creation of a dc electric field/voltage in graphene as a response to the dynamic magnetic excitations (spin waves) in an adjacent out-of-plane magnetized YIG film. We show that the induced voltage changes its sign when the orientation of the static magnetization is reversed, clearly indicating the broken spatial inversion symmetry in the studied system. The strength of effect shows a non-monotonous dependence on the spin-wave frequency, in agreement with the proposed theoretical model.

cond-mat.mes-hall↗

arXiv2016

Synchronization of heterogeneous oscillators under network modifications: Perturbation and optimization of the synchrony alignment function

Synchronization is central to many complex systems in engineering physics (e.g., the power-grid, Josephson junction circuits, and electro-chemical oscillators) and biology (e.g., neuronal, circadian, and cardiac rhythms). Despite these widespread applications---for which proper functionality depends sensitively on the extent of synchronization---there remains a lack of understanding for how systems evolve and adapt to enhance or inhibit synchronization. We study how network modifications affect the synchronization properties of network-coupled dynamical systems that have heterogeneous node dynamics (e.g., phase oscillators with non-identical frequencies), which is often the case for real-world systems. Our approach relies on a synchrony alignment function (SAF) that quantifies the interplay between heterogeneity of the network and of the oscillators and provides an objective measure for a system's ability to synchronize. We conduct a spectral perturbation analysis of the SAF for structural network modifications including the addition and removal of edges, which subsequently ranks the edges according to their importance to synchronization. Based on this analysis, we develop gradient-descent algorithms to efficiently solve optimization problems that aim to maximize phase synchronization via network modifications. We support these and other results with numerical experiments.

nlin.AO↗

arXiv2016

Commutators of multilinear Calderón-Zygmund operators with kernels of Dini's type and applications

Let $T$ be a multilinear Calderón-Zygmund operator of type $ω$ with $ω(t)$ being nondecreasing and satisfying a kind of Dini's type condition. Let $T_{Π\vec{b}}$ be the iterated commutators of $T$ with $BMO$ functions. The weighted strong and weak $L(\log{L})$-type endpoint estimates for $T_{Π\vec{b}}$ with multiple weights are established. Some boundedness properties on weighted variable exponent Lebesgue spaces are also obtained. As applications, multiple weighted estimates for iterated commutators of paraproducts and bilinear pseudo-differential operators with mild regularity are given.

math.CA↗

arXiv2016

Optimal synchronization of directed complex networks

We study optimal synchronization of networks of coupled phase oscillators. We extend previous theory for optimizing the synchronization properties of undirected networks to the important case of directed networks. We derive a generalized synchrony alignment function that encodes the interplay between network structure and the oscillators' natural frequencies and serves as an objective measure for the network's degree of synchronization. Using the generalized synchrony alignment function, we show that a network's synchronization properties can be systematically optimized. This framework also allows us to study the properties of synchrony-optimized networks, and in particular, investigate the role of directed network properties such as nodal in- and out-degrees. For instance, we find that in optimally rewired networks the heterogeneity of the in-degree distribution roughly matches the heterogeneity of the natural frequency distribution, but no such relationship emerges for out-degrees. We also observe that a network's synchronization properties are promoted by a strong correlation between the nodal in-degrees and the natural frequencies of oscillators, whereas the relationship between the nodal out-degrees and the natural frequencies has comparatively little effect. This result is supported by our theory, which indicates that synchronization is promoted by a strong alignment of the natural frequencies with the left singular vectors corresponding to the largest singular values of the Laplacian matrix.

nlin.AO↗

arXiv2016

Collective frequency variation in network synchronization and reverse PageRank

A wide range of natural and engineered phenomena rely on large networks of interacting units to reach a dynamical consensus state where the system collectively operates. Here we study the dynamics of self-organizing systems and show that for generic directed networks the collective frequency of the ensemble is {\it not} the same as the mean of the individuals' natural frequencies. Specifically, we show that the collective frequency equals a weighted average of the natural frequencies, where the weights are given by an out-flow centrality measure that is equivalent to a reverse PageRank centrality. Our findings uncover an intricate dependence of the collective frequency on both the structural directedness and dynamical heterogeneity of the network, and also reveal an unexplored connection between synchronization and PageRank, which opens the possibility of applying PageRank optimization to synchronization. Finally, we demonstrate the presence of collective frequency variation in real-world networks by considering the UK and Scandinavian power grids.

nlin.AO↗

arXiv2016

Master Stability Islands for Amplitude Death in Networks of Delay-Coupled Oscillators

This paper presents a master stability function (MSF) approach for analyzing the stability of amplitude death (AD) in networks of delay-coupled oscillators. Unlike the familiar MSFs for instantaneously coupled networks, which typically have a single input encoding for the effects of the eigenvalues of the network Laplacian matrix, for delay-coupled networks we show that such MSFs generally require two additional inputs: the time delay and the coupling strength. To utilize the MSF for predicting the stability of AD of arbitrary networks for a chosen nonlinear system (node dynamics) and coupling function, we introduce the concept of master stability islands (MSIs), which are two-dimensional stability islands of the delay-coupling space together with a third dimension ("altitude") encoding for eigenvalues that result in stable AD. We compute the MSFs and show the corresponding MSIs for several common chaotic systems including the Rossler, the Lorenz, and Chen's system, and found that it is generally possible to achieve AD and that a nonzero time delay is necessary for the stabilization of the AD states.

math.DS↗