arXiv subjects

Yu Sun

Publications and source records attributed to Yu Sun.

330 records · Page 19Linked to original sources

arXiv2014

The Tunable Hybrid Surface Phonon and Plasmon Polariton Modes in Boron Nitride Nanotube and Graphene Monolayer Heterostructures

The hybrid modes incorporating surface phonon polariton (SPhP) modes in boron nitride nanotubes (BNNTs) and surface plasmon polariton (SPP) modes in graphene monolayers are theoretically studied. The combination of the 1D BNNTs and 2D graphene monolayer further improves the modal characteristics with electrical tunability. Superior to the graphene monolayers, the proposed heterostructures supports single mode transmission with lateral optical confinement. The modal characteristics can be shifted from SPP-like toward SPhP-like. Both the figure of merit and field enhancement of hybrid modes are improved over 3 times than those of BNNT SPhP modes, which may further enable sub-wavelength mid-infrared applications.

physics.optics↗

arXiv2014

Complexity of Multilevel Monte Carlo Tau-Leaping

Tau-leaping is a popular discretization method for generating approximate paths of continuous time, discrete space, Markov chains, notably for biochemical reaction systems. To compute expected values in this context, an appropriate multilevel Monte Carlo form of tau-leaping has been shown to improve efficiency dramatically. In this work we derive new analytic results concerning the computational complexity of multilevel Monte Carlo tau-leaping that are significantly sharper than previous ones. We avoid taking asymptotic limits, and focus on a practical setting where the system size is large enough for many events to take place along a path, so that exact simulation of paths is expensive, making tau-leaping an attractive option. We use a general scaling of the system components that allows for the reaction rate constants and the abundances of species to vary over several orders of magnitude, and we exploit the random time change representation developed by Kurtz. The key feature of the analysis that allows for the sharper bounds is that when comparing relevant pairs of processes we analyze the variance of their difference directly rather than bounding via the second moment. Use of the second moment is natural in the setting of a diffusion equation, where multilevel was first developed and where strong convergence results for numerical methods are readily available, but is not optimal for the Poisson-driven jump systems that we consider here. We also present computational results that illustrate the new analysis.

math.NA↗

arXiv2014

Information Transfer in Swarms with Leaders

Swarm dynamics is the study of collections of agents that interact with one another without central control. In natural systems, insects, birds, fish and other large mammals function in larger units to increase the overall fitness of the individuals. Their behavior is coordinated through local interactions to enhance mate selection, predator detection, migratory route identification and so forth [Andersson and Wallander 2003; Buhl et al. 2006; Nagy et al. 2010; Partridge 1982; Sumpter et al. 2008]. In artificial systems, swarms of autonomous agents can augment human activities such as search and rescue, and environmental monitoring by covering large areas with multiple nodes [Alami et al. 2007; Caruso et al. 2008; Ogren et al. 2004; Paley et al. 2007; Sibley et al. 2002]. In this paper, we explore the interplay between swarm dynamics, covert leadership and theoretical information transfer. A leader is a member of the swarm that acts upon information in addition to what is provided by local interactions. Depending upon the leadership model, leaders can use their external information either all the time or in response to local conditions [Couzin et al. 2005; Sun et al. 2013]. A covert leader is a leader that is treated no differently than others in the swarm, so leaders and followers participate equally in whatever interaction model is used [Rossi et al. 2007]. In this study, we use theoretical information transfer as a means of analyzing swarm interactions to explore whether or not it is possible to distinguish between followers and leaders based on interactions within the swarm. We find that covert leaders can be distinguished from followers in a swarm because they receive less transfer entropy than followers.

cs.NE↗

arXiv2013

An Optimal ODAM-Based Broadcast Algorithm for Vehicular Ad-Hoc Networks

Broadcast routing has become an important research field for vehicular ad-hoc networks (VANETs) recently. However, the packet delivery rate is generally low in existing VANET broadcast routing protocols. Therefore, the design of an appropriate broadcast protocol based on the features of VANET has become a crucial part of the development of VANET. This paper analyzes the disadvantage of existing broadcast routing protocols in VANETs, and proposes an improved algorithm (namely ODAM-C) based on the ODAM (Optimized Dissemination of Alarm Messages) protocol. The ODAM-C algorithm improves the packet delivery rate by two mechanisms based on the forwarding features of ODAM. The first distance-based mechanism reduces the possibility of packet loss by considering the angles between source nodes, forwarding nodes and receiving nodes. The second mechanism increases the redundancy of forwarding nodes to guarantee the packet success delivery ratio. We show by analysis and simulations that the proposed algorithm can improve packet delivery rate for vehicular networks compared against two widely-used existing protocols.

cs.NI↗

arXiv2013

A Fractal and Scale-free Model of Complex Networks with Hub Attraction Behaviors

It is widely believed that fractality of complex networks origins from hub repulsion behaviors (anticorrelation or disassortativity), which means large degree nodes tend to connect with small degree nodes. This hypothesis was demonstrated by a dynamical growth model, which evolves as the inverse renormalization procedure proposed by Song et al. Now we find that the dynamical growth model is based on the assumption that all the cross-boxes links has the same probability e to link to the most connected nodes inside each box. Therefore, we modify the growth model by adopting the flexible probability e, which makes hubs have higher probability to connect with hubs than non-hubs. With this model, we find some fractal and scale-free networks have hub attraction behaviors (correlation or assortativity). The results are the counter-examples of former beliefs.

physics.soc-ph↗

arXiv2007

On the linear fractional self-attracting diffusion

In this paper, we introduce the linear fractional self-attracting diffusion driven by a fractional Brownian motion with Hurst index 1/2<H<1, which is analogous to the linear self-attracting diffusion. For 1-dimensional process we study its convergence and the corresponding weighted local time. For 2-dimensional process, as a related problem, we show that the renormalized self-intersection local time exists in L^2 if $\frac12<H<\frac3{4}$.

math.PR↗