SearcharxivSearch

arXiv subjects

C. -H. Lai

Publications and source records attributed to C. -H. Lai.

At least 19 recordsLinked to original sources

AT 2024qfm: a luminous fast blue optical transient at a redshift of z = 0.2267 identified by Lasair-ZTF

Luminous fast blue optical transients (LFBOTs) emit from x-ray to radio wavelengths, epitomised by the discovery of AT 2018cow in a host galaxy at 65 Mpc. In the following eight years eleven more have been found, at redshifts $0.075 \lesssim z \lesssim0.34$, plus one identified retrospectively from 2016. Here we present the discovery of AT 2024qfm, classified as an LFBOT in a host galaxy at $z = 0.2267 \pm 0.0002$. Its ultraviolet-to-optical luminosity and rapid 13 day fade closely match AT 2018cow. We describe how the transient was identified in the Zwicky Transient Facility alert stream using a custom filter in the Lasair broker that flags flux gradients over time. Another LFBOT candidate was identified with the same methodology (AT 2024kth). The physical origin of LFBOTs remains debated with no firm consensus, and further progress requires more discoveries, host-galaxy characterisation, and multi-wavelength analysis to constrain theory. We discuss this discovery in the context of Rubin Observatory's Legacy Survey of Space and Time (LSST), whose sensitivity will increase the effective LFBOT survey volume tenfold relative to ZTF, out to $z \lesssim 0.6$, and show that our FastFinder filter could recover such events. We highlight the challenge of detecting their fast evolution with sufficiently low latency to trigger multi-wavelength follow-up that can constrain theoretical models.

astro-ph.HE

Propagation of Uncertainty in a Rotating Pipe Mechanism to Generate an Impinging Swirling Jet Flow for Heat Transfer from a Flat Plate

In Computational Fluid Dynamics (CFD) studies composed of the coupling of different simulations, the uncertainty in one stage may be propagated to the following stage and affect the accuracy of the prediction. In this paper, a framework for uncertainty quantification is applied to the two-step simulation of the mechanical design of a swirling jet flow generated by a rotating pipe (\textit{Simulation 1}) impinging on a flat plate to provide convective heat transfer (\textit{Simulation 2}). The first approach is the Stochastic Collocation Method (SCM) with Clenshaw-Curtis sparse grids. The conclusion drawn from the analysis is that the simulated system does not exhibit a significant sensitivity to stochastic variations of model input parameters, over the tested uncertainty ranges. Additionally, a set of non-linear regression models for the stochastic velocity and turbulent profiles for the pipe nozzle are created and tested, since impinging jets at Reynolds number of $Re=23000$ are very frequent in the literature, but stochastic inlet conditions have never been provided. Numerical results demonstrate a negligible difference in the predicted convective heat transfer with respect to the use of the profiles simulated via CFD. These suggested surrogate models can be directly embedded onto other CFD applications (e.g arrays of jets or jet flows impinging on plates with different shapes) in which a realistic swirling flow under uncertainty can be of interest.

physics.flu-dyn

Spontaneous Formation of Dynamical Groups in an Adaptive Networked System

In this work, we investigate a model of an adaptive networked dynamical system, where the coupling strengths among phase oscillators coevolve with the phase states. It is shown that in this model the oscillators can spontaneously differentiate into two dynamical groups after a long time evolution. Within each group, the oscillators have similar phases, while oscillators in different groups have approximately opposite phases. The network gradually converts from the initial random structure with a uniform distribution of connection strengths into a modular structure which is characterized by strong intra connections and weak inter connections. Furthermore, the connection strengths follow a power law distribution, which is a natural consequence of the coevolution of the network and the dynamics. Interestingly, it is found that if the inter connections are weaker than a certain threshold, the two dynamical groups will almost decouple and evolve independently. These results are helpful in further understanding the empirical observations in many social and biological networks.

cond-mat.dis-nn

Dynamical formation of stable irregular transients in discontinuous map systems

Stable chaos refers to the long irregular transients, with a negative largest Lyapunov exponent, which is usually observed in certain high-dimensional dynamical systems. The mechanism underlying this phenomenon has not been well studied so far. In this paper, we investigate the dynamical formation of stable irregular transients in coupled discontinuous map systems. Interestingly, it is found that the transient dynamics has a hidden pattern in the phase space: it repeatedly approaches a basin boundary and then jumps from the bundary to a remote region in the phase space. This pattern can be clearly visualized by measuring the distance sequences between the trajectory and the basin boundary. The dynamical formation of stable chaos originates from the intersection points of the discontinuous boundaries and their images. We carry out numerical experiments to verify this mechanism.

cond-mat.dis-nn

Symmetry consideration in identifying network structures

The topological information of a network can be retrieved equivalently from its complement consisting of the same nodes but complementary edges. Hence the partition of a network into certain substructures based on given criteria should be the same as that of its complement based on the equivalent criteria if the topological information is considered exclusively. This symmetry of partitioning between a network and its complement is due to the equivalence of their topological information and hence should be respected regardless of the detailed characteristics of the substructures considered. In this work we suggest this symmetry consideration as a general guideline and propose a symmetric community detection scheme to show its implications. Our method has no resolution limit and can be used to detect hierarchical community structures at different levels. Our study also suggests that the community structure is unlikely a result of random fluctuations in large networks.

physics.soc-ph

Visualizing and exploring modular networks based on a probabilistic model

We propose a method to investigate modular structure in networks based on fitted probabilistic model, where the connection probability between nodes is related to a set of introduced local attributes. The attributes, as parameters of the empirical model, can be estimated by maximizing the likelihood function of the observed network. We demonstrate that the distribution of attributes provides an informative visulization of modular networks on low-dimensional space, and suggest the attribute space can be served as a better platform for further network analysis.

physics.soc-ph

Exploring network structures in feature space

We propose a multi-phase approach to explore network structures. In this method, structure analysis is not carried out on the observed network directly. Instead, certain similarity measures of the nodes are derived from the network firstly, which are then projected onto an appropriate lower-dimensional feature space. The clustering structure can be defined in the feature space, and analyzed by conventional clustering algorithms. The classified data are finally mapped back to the original network space if necessary to complete the analysis of network structures. By mapping onto the feature space, some difficulties due to the diversity of micro-structures and scale of the network can be circumvented. This makes it possible for the proposed method to deal with more general structures such as detecting groups in a random background, as well as identifying usual community structures in networks.

physics.soc-ph

A one dimensional hard-point gas as a thermoelectric engine

We demonstrate the possibility to build a thermoelectric engine using a one dimensional gas of molecules with unequal masses and hard-point interaction. Most importantly, we show that the efficiency of this engine is determined by a new parameter YT which is different from the well known figure of merit ZT. Even though the efficiency of this particular model is low, our results shed new light on the problem and open the possibility to build efficient thermoelectric engines.

cond-mat.stat-mech

Detecting groups of similar components in complex networks

We study how to detect groups in a complex network each of which consists of component nodes sharing a similar connection pattern. Based on the mixture models and the exploratory analysis set up by Newman and Leicht (Newman and Leicht 2007 {\it Proc. Natl. Acad. Sci. USA} {\bf 104} 9564), we develop an algorithm that is applicable to a network with any degree distribution. The partition of a network suggested by this algorithm also applies to its complementary network. In general, groups of similar components are not necessarily identical with the communities in a community network; thus partitioning a network into groups of similar components provides additional information of the network structure. The proposed algorithm can also be used for community detection when the groups and the communities overlap. By introducing a tunable parameter that controls the involved effects of the heterogeneity, we can also investigate conveniently how the group structure can be coupled with the heterogeneity characteristics. In particular, an interesting example shows a group partition can evolve into a community partition in some situations when the involved heterogeneity effects are tuned. The extension of this algorithm to weighted networks is discussed as well.

physics.data-an

The development of generalized synchronization on complex networks

In this paper, we investigate the development of generalized synchronization (GS) on typical complex networks, such as scale-free networks, small-world networks, random networks and modular networks. By adopting the auxiliary-system approach to networks, we show that GS can take place in oscillator networks with both heterogeneous and homogeneous degree distribution, regardless of whether the coupled chaotic oscillators are identical or nonidentical. For coupled identical oscillators on networks, we find that there exists a general bifurcation path from initial non-synchronization to final global complete synchronization (CS) via GS as the coupling strength is increased. For coupled nonidentical oscillators on networks, we further reveal how network topology competes with the local dynamics to dominate the development of GS on networks. Especially, we analyze how different coupling strategies affect the development of GS on complex networks. Our findings provide a further understanding for the occurrence and development of collective behavior in complex networks.

nlin.CD

Bias dependent inversion of tunneling magnetoresistance in Fe/GaAs/Fe tunnel junctions

We investigated spin dependent transport through Fe/GaAs/Fe tunnel junctions. The tunneling magnetoresistance effect (TMR) was probed for different types of Fe/GaAs interfaces. For interfaces cleaned by hydrogen plasma the TMR effect is increased and observable at room temperature. If an epitaxial Fe/GaAs(001) interface is involved, the tunnel junction exhibits a bias dependent inversion of the TMR effect. This is a first experimental signature for band structure effects at a Fe/GaAs interface and relevant for spin injection experiments.

cond-mat.mes-hall

Error Function Attack of chaos synchronization based encryption schemes

Different chaos synchronization based encryption schemes are reviewed and compared from the practical point of view. As an efficient cryptanalysis tool for chaos encryption, a proposal based on the Error Function Attack is presented systematically and used to evaluate system security. We define a quantitative measure (Quality Factor) of the effective applicability of a chaos encryption scheme, which takes into account the security, the encryption speed, and the robustness against channel noise. A comparison is made of several encryption schemes and it is found that a scheme based on one-way coupled chaotic map lattices performs outstandingly well, as judged from Quality Factor.

nlin.PS

Strange nonchaotic attractors in noise driven systems

Strange nonchaotic attractors (SNAs) in noise driven systems are investigated. Before the transition to chaos, due to the effect of noise, a typical trajectory will wander between the periodic attractor and its nearby chaotic saddle in an intermittent way, forms a strange attractor gradually. The existence of SNAs is confirmed by simulation results of various critera both in map and continuous systems. Dimension transition is found and intermittent behavior is studied by peoperties of local Lyapunov exponent. The universality and generalization of this kind of SNAs are discussed and common features are concluded.

nlin.CD

Amplification of weak signals and stochastic resonance via on-off intermittency with symmetry breaking

Nonlinear dynamical systems possessing reflection symmetry have an invariant subspace in the phase space. The dynamics within the invariant subspace can be random or chaotic. As a system parameter changes, the motion transverse to the invariant subspace can lose stability, leading to on-off intermittency. Under certain conditions, the bursting behavior is symmetry-breaking. We demonstrate the possibility of observing multiplicative noise(chaos)-induced amplification of weak signal and stochastic resonance via on-off intermittency with symmetry breaking in a general class of symmetrical systems. Differences of this mechanism of stochastic resonance to that in noisy bistable or threshold systems are discussed

nlin.CD

Robustness of Supersensitivity to Small Signals in Nonlinear Dynamical Systems

Nonlinear dynamical systems possessing an invariant subspace can display interesting dynamical behavior, such as on-off intermittency and bubbling. This letter shows that a class of such systems have amazing features of (1) supersensitivity to small input signals and (2) robustness of the supersensitivity in the presence of noise. These features make the systems very promising as small signal detectors.

nlin.CD

Extracting Messages Masked by Chaotic Signals of Time-delay Systems

We show how to extract messages masked by a chaotic signal of a time-delay system with very high dimension and many positive Lyapunov exponents. Using a special embedding coordinate, the infinite dimensional phase space of the time-delay system is projected to a special three-dimensional space, which enables us to identify the time-delay of the system from the transmitted signal, and reconstruct the chaotic dynamics to unmask the hidden message successfully. The message extraction procedure is illustrated by simulations with Mackey-Glass time-delay system for two type of masking schemes and different kinds of messages.

nlin.CD

Decoding Information by Following Parameter Modulation With Parameter Adaptive Control

It has been proposed to realize secure communication using chaotic synchronization via transmission of binary message encoded by parameter modulation in the chaotic system. This paper considers the use of parameter adaptive control techniques to extract the message, based on the assumptions that we know the equation form of the chaotic system in the transmitter but do not have access to the precise values of the parameters which are kept secret as a secure set. In the case that a synchronizing system can be constructed using parameter adaptive control by the transmitted signal and the synchronization is robust to parameter mismatches, the parameter modulation can be revealed and the message decoded without resorting to exact parameter values in the secure set. A practical local Lyapunov function method for designing parameter adaptive control rules based on originally synchronized systems is presented.

nlin.CD

Synchronization With Positive Conditional Lyapunov Exponents

Synchronization of chaotic system may occur only when the largest conditional Lyapunov exponent of the driven system is negative. The synchronization with positive conditional Lyapunov reported in a recent paper (Phys. Rev. E, {\bf 56}, 2272 (1997)) is a combined result of the contracting region of the system and the finite precision in computer simulations.

nlin.CD