arXiv subjects

Hongbin Chen

Publications and source records attributed to Hongbin Chen.

27 records · Page 2Linked to original sources

arXiv2017

A Numerical Approach to Virasoro Blocks and the Information Paradox

We chart the breakdown of semiclassical gravity by analyzing the Virasoro conformal blocks to high numerical precision, focusing on the heavy-light limit corresponding to a light probe propagating in a BTZ black hole background. In the Lorentzian regime, we find empirically that the initial exponential time-dependence of the blocks transitions to a universal $t^{-\frac{3}{2}}$ power-law decay. For the vacuum block the transition occurs at $t \approx \frac{πc}{6 h_L}$, confirming analytic predictions. In the Euclidean regime, due to Stokes phenomena the naive semiclassical approximation fails completely in a finite region enclosing the `forbidden singularities'. We emphasize that limitations on the reconstruction of a local bulk should ultimately stem from distinctions between semiclassical and exact correlators.

hep-th↗

arXiv2017

Order parameter analysis of synchronization transitions on star networks

Collective behaviors of populations of coupled oscillators have attracted much attention in recent years. In this paper, an order parameter approach is proposed to study the low-dimensional dynam- ical mechanism of collective synchronizations by adopting the star-topology of coupled oscillators as a prototype system. The order parameter equation of star-linked phase oscillators can be obtained in terms of the Watanabe-Strogatz transformation, Ott-Antonsen ansatz, and the ensemble order parameter approach. Different solutions of the order parameter equation correspond to diverse col- lective states, and different bifurcations reveal various transitions among these collective states. The properties of various transitions are revealed in the star-network model by using tools of nonlinear dynamics such as time reversibility analysis and linear stability analysis.

nlin.AO↗

arXiv2016

A Survey of Multi-Objective Optimization in Wireless Sensor Networks: Metrics, Algorithms and Open Problems

Wireless sensor networks (WSNs) have attracted substantial research interest, especially in the context of performing monitoring and surveillance tasks. However, it is challenging to strike compelling trade-offs amongst the various conflicting optimization criteria, such as the network's energy dissipation, packet-loss rate, coverage and lifetime. This paper provides a tutorial and survey of recent research and development efforts addressing this issue by using the technique of multi-objective optimization (MOO). First, we provide an overview of the main optimization objectives used in WSNs. Then, we elaborate on various prevalent approaches conceived for MOO, such as the family of mathematical programming based scalarization methods, the family of heuristics/metaheuristics based optimization algorithms, and a variety of other advanced optimization techniques. Furthermore, we summarize a range of recent studies of MOO in the context of WSNs, which are intended to provide useful guidelines for researchers to understand the referenced literature. Finally, we discuss a range of open problems to be tackled by future research.

cs.NI↗

arXiv2016

Degenerate Operators and the $1/c$ Expansion: Lorentzian Resummations, High Order Computations, and Super-Virasoro Blocks

One can obtain exact information about Virasoro conformal blocks by analytically continuing the correlators of degenerate operators. We argued in recent work that this technique can be used to explicitly resolve information loss problems in AdS$_3$/CFT$_2$. In this paper we use the technique to perform calculations in the small $1/c \propto G_N$ expansion: (1) we prove the all-orders resummation of logarithmic factors $\propto \frac{1}{c} \log z$ in the Lorentzian regime, demonstrating that $1/c$ corrections directly shift Lyapunov exponents associated with chaos, as claimed in prior work, (2) we perform another all-orders resummation in the limit of large $c$ with fixed $cz$, interpolating between the early onset of chaos and late time behavior, (3) we explicitly compute the Virasoro vacuum block to order $1/c^2$ and $1/c^3$, corresponding to $2$ and $3$ loop calculations in AdS$_3$, and (4) we derive the heavy-light vacuum blocks in theories with $\mathcal{N}=1,2$ superconformal symmetry.

hep-th↗

arXiv2014

Power Allocation and Transmitter Switching for Broadcasting with Multiple Energy Harvesting Transmitters

With the advancement of battery technology, energy harvesting communication systems attracted great research attention in recent years. However, energy harvesting communication systems with multiple transmitters and multiple receivers have not been considered yet. In this paper, the problem of broadcasting in a communication system with multiple energy harvesting transmitters and multiple receivers is studied. First, regarding the transmitters as a 'hole transmitter' [1], the optimal total transmission power is obtained and the optimal power allocation policy in [2] is extended to our system setup, with the aim of minimizing the transmission completion time. Then, a simpler power allocation policy is developed to allocate the optimal total transmission power to the data transmissions. As transmitter switching can provide flexibility and robustness to an energy harvesting communication system, especially when a transmitter is broken or the energy harvested by a transmitter is insufficient, a transmitter switching policy is further developed to choose a suitable transmitter to work whenever necessary. The results show that the proposed power allocation policy performs close to the optimal one and outperforms some heuristic ones in terms of transmission completion time. Besides, the proposed transmitter switching policy outperforms some heuristic ones in terms of number of switches.

cs.IT↗

arXiv2008

A New Comparative Definition of Community and Corresponding Identifying Algorithm

In this paper, a new comparative definition for community in networks is proposed and the corresponding detecting algorithm is given. A community is defined as a set of nodes, which satisfy that each node's degree inside the community should not be smaller than the node's degree toward any other community. In the algorithm, the attractive force of a community to a node is defined as the connections between them. Then employing attractive force based self-organizing process, without any extra parameter, the best communities can be detected. Several artificial and real-world networks, including Zachary Karate club network and College football network are analyzed. The algorithm works well in detecting communities and it also gives a nice description for network division and group formation.

physics.soc-ph↗

arXiv2007

Rate of Decay of Stable Periodic Solutions of Duffing Equations

In this paper, we consider the second-order equations of Duffing type. Bounds for the derivative of the restoring force are given that ensure the existence and uniqueness of a periodic solution. Furthermore, the stability of the unique periodic solution is analyzed; the sharp rate of exponential decay is determined for a solution that is near to the unique periodic solution.

math.CA↗

arXiv2007

Existence, uniqueness, and stability of periodic solutions of an equation of Duffing type

We consider a second-order equation of Duffing type. Bounds for the derivative of the restoring force are given which ensure the existence and uniqueness of a periodic solution. Furthermore, the unique periodic solution is asymptotically stable with sharp rate of exponential decay. In particular, for a restoring term independent of the variable $t$, a necessary and sufficient condition is obtained which guarantees the existence and uniqueness of a periodic solution that is stable.

math.CA↗

arXiv2007

Stability and exact multiplicity of periodic solutions of Duffing equations with cubic nonlinearities

We study the stability and exact multiplicity of periodic solutions of the Duffing equation with cubic nonlinearities. We obtain sharp bounds for h such that the equation has exactly three ordered T-periodic solutions. Moreover, when h is within these bounds, one of the three solutions is negative, while the other two are positive. The middle solution is asymptotically stable, and the remaining two are unstable.

math.CA↗