Source author record

Hao Liao

Hao Liao appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

16works
14topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

16 published item(s)

preprint2026arXiv

PersonaArena: Dynamic Simulation for Evaluating and Enhancing Persona-Level Role-Playing in Large Language Models

Large language models (LLMs) increasingly serve as interactive social agents, yet their ability to maintain coherent and authentic persona-level role-playing remains limited, particularly in realistic social scenarios. Existing research predominantly focuses on character-level settings and relies on static evaluation formats, failing to capture the complexity of everyday social interactions. In this work, we present PersonaArena, a dynamic simulation framework for evaluating and improving persona-level role-playing in LLMs. PersonaArena leverages a large, filtered corpus of user-generated social content to construct a nuanced persona bank, and elicits multi-turn, context-rich interactions within simulated social environments. Our framework features a multi-agent debating judge for holistic and unbiased assessment. Through extensive experiments, we demonstrate that PersonaArena enables rigorous evaluation and enhancement of LLMs' role-playing capabilities, advancing the development of more authentic and socially adept AI agents.

preprint2022arXiv

Epidemic Plateau: A Phenomenon under Adaptive Prevention Strategies

Since the beginning of the COVID-19 spreading, the number of studies on the epidemic models increased dramatically. It is important for policymakers to know how the disease will spread and what are the effects of the policies and environment on the spreading. In this paper, we propose two extensions to the standard SIR model: (a) we consider the prevention measures adopted based on the current severity of the infection. Those measures are adaptive and change over time; (b) multiple cities and regions are considered, with population movements between those cities and regions, while taking into account that each region may have different prevention measures. Although the adaptive measures and mobility of the population were often observed during the pandemic, these effects are rarely explicitly modeled and studied in the classical epidemic models. The model we propose gives rise to a plateau phenomenon: the number of people infected by the disease stays at the same level during an extended period of time. We show what are conditions need to be met in order for the spreading to exhibit a plateau period in a single city. In addition, this phenomenon is interdependent when considering multiple cities. We verify from the real-world data that the plateau phenomenon does exist in many regions of the world in the current COVID-19 development. Finally, we provide theoretical analysis on the plateau phenomenon for the single-city model and derive a series of results on the emergence and the ending of the plateau, as well as on the height and length of the plateau. Our theoretical results match well with our experimental findings.

preprint2022arXiv

Towards Fine-Grained Reasoning for Fake News Detection

The detection of fake news often requires sophisticated reasoning skills, such as logically combining information by considering word-level subtle clues. In this paper, we move towards fine-grained reasoning for fake news detection by better reflecting the logical processes of human thinking and enabling the modeling of subtle clues. In particular, we propose a fine-grained reasoning framework by following the human information-processing model, introduce a mutual-reinforcement-based method for incorporating human knowledge about which evidence is more important, and design a prior-aware bi-channel kernel graph network to model subtle differences between pieces of evidence. Extensive experiments show that our model outperforms the state-of-the-art methods and demonstrate the explainability of our approach.

preprint2021arXiv

Fake News Detection through Graph Comment Advanced Learning

Disinformation has long been regarded as a severe social problem, where fake news is one of the most representative issues. What is worse, today's highly developed social media makes fake news widely spread at incredible speed, bringing in substantial harm to various aspects of human life. Yet, the popularity of social media also provides opportunities to better detect fake news. Unlike conventional means which merely focus on either content or user comments, effective collaboration of heterogeneous social media information, including content and context factors of news, users' comments and the engagement of social media with users, will hopefully give rise to better detection of fake news. Motivated by the above observations, a novel detection framework, namely graph comment-user advanced learning framework (GCAL) is proposed in this paper. User-comment information is crucial but not well studied in fake news detection. Thus, we model user-comment context through network representation learning based on heterogeneous graph neural network. We conduct experiments on two real-world datasets, which demonstrate that the proposed joint model outperforms 8 state-of-the-art baseline methods for fake news detection (at least 4% in Accuracy, 7% in Recall and 5% in F1). Moreover, the proposed method is also explainable.

preprint2020arXiv

Accumulative time-based ranking method to reputation evaluation in information networks

With the rapid development of modern technology, the Web has become an important platform for users to make friends and acquire information. However, since information on the Web is over-abundant, information filtering becomes a key task for online users to obtain relevant suggestions. As most Websites can be ranked according to users' rating and preferences, relevance to queries, and recency, how to extract the most relevant item from the over-abundant information is always a key topic for researchers in various fields. In this paper, we adopt tools used to analyze complex networks to evaluate user reputation and item quality. In our proposed accumulative time-based ranking (ATR) algorithm, we incorporate two behavioral weighting factors which are updated when users select or rate items, to reflect the evolution of user reputation and item quality over time. We showed that our algorithm outperforms state-of-the-art ranking algorithms in terms of precision and robustness on empirical datasets from various online retailers and the citation datasets among research publications.

preprint2019arXiv

Where is your field going? A Machine Learning approach to study the relative motion of the domains of Physics

We propose an original approach to describe the scientific progress in a quantitative way. Using innovative Machine Learning techniques we create a vector representation for the PACS codes and we use them to represent the relative movements of the various domains of Physics in a multi-dimensional space. This methodology unveils about 25 years of scientific trends, enables us to predict innovative couplings of fields, and illustrates how Nobel Prize papers and APS milestones drive the future convergence of previously unrelated fields.

preprint2015arXiv

Analysis of ground state in random bipartite matching

In human society, a lot of social phenomena can be concluded into a mathematical problem called the bipartite matching, one of the most well known model is the marriage problem proposed by Gale and Shapley. In this article, we try to find out some intrinsic properties of the ground state of this model and thus gain more insights and ideas about the matching problem. We apply Kuhn-Munkres Algorithm to find out the numerical ground state solution of the system. The simulation result proves the previous theoretical analysis using replica method. In the result, we also find out the amount of blocking pairs which can be regarded as a representative of the system stability. Furthermore, we discover that the connectivity in the bipartite matching problem has a great impact on the stability of the ground state, and the system will become more unstable if there were more connections between men and women.

preprint2015arXiv

Black hole entropy arising from massless scalar field with Lorentz violation induced by the coupling to Einstein tensor

We have investigated quantum entropy of a static black hole arising from the massless scalar field with Lorentz violation induced by the coupling to Einstein tensor. Our results show that the coupled massless scalar field contributes to the classical Bekenstein-Hawking term in the black hole entropy. The corrected classical Bekenstein-Hawking entropy is not one quarter of the event horizon area of the original background black hole, but of a corresponding effective metric related to the coupling. It means that the classical Bekenstein-Hawking entropy depends not only on the black hole parameter, but also on the coupling which reduces Lorentz violation.

preprint2015arXiv

Enhancing speed of pinning synchronizability: low-degree nodes with high feedback gains

Controlling complex networks is of paramount importance in science and engineering. Despite recent efforts to improve controllability and synchronous strength, little attention has been paid to the speed of pinning synchronizability (rate of convergence in pinning control) and the corresponding pinning node selection. To address this issue, we propose a hypothesis to restrict the control cost, then build a linear matrix inequality related to the speed of pinning controllability. By solving the inequality, we obtain both the speed of pinning controllability and optimal control strength (feedback gains in pinning control) for all nodes. Interestingly, some low-degree nodes are able to achieve large feedback gains, which suggests that they have high influence on controlling system. In addition, when choosing nodes with high feedback gains as pinning nodes, the controlling speed of real systems is remarkably enhanced compared to that of traditional large-degree and large-betweenness selections. Thus, the proposed approach provides a novel way to investigate the speed of pinning controllability and can evoke other effective heuristic pinning node selections for large-scale systems.

preprint2014arXiv

Predicting missing links via correlation between nodes

As a fundamental problem in many different fields, link prediction aims to estimate the likelihood of an existing link between two nodes based on the observed information. Since this problem is related to many applications ranging from uncovering missing data to predicting the evolution of networks, link prediction has been intensively investigated recently and many methods have been proposed so far. The essential challenge of link prediction is to estimate the similarity between nodes. Most of the existing methods are based on the common neighbor index and its variants. In this paper, we propose to calculate the similarity between nodes by the correlation coefficient. This method is found to be very effective when applied to calculate similarity based on high order paths. We finally fuse the correlation-based method with the resource allocation method, and find that the combined method can substantially outperform the existing methods, especially in sparse networks.

preprint2014arXiv

Reconstructing propagation networks with temporal similarity metrics

Node similarity is a significant property driving the growth of real networks. In this paper, based on the observed spreading results we apply the node similarity metrics to reconstruct propagation networks. We find that the reconstruction accuracy of the similarity metrics is strongly influenced by the infection rate of the spreading process. Moreover, there is a range of infection rate in which the reconstruction accuracy of some similarity metrics drops to nearly zero. In order to improve the similarity-based reconstruction method, we finally propose a temporal similarity metric to take into account the time information of the spreading. The reconstruction results are remarkably improved with the new method.

preprint2014arXiv

Towards an objective ranking in online reputation systems: the effect of the rating projection

Online reputation systems are commonly used by e-commerce providers nowadays. In order to generate an objective ranking of online items' quality according to users' ratings, many sophisticated algorithms have been proposed in the literature. In this paper, instead of proposing new algorithms we focus on a more fundamental problem: the rating projection. The basic idea is that even though the rating values given by users are linearly separated, the real preference of users to items between different values gave is nonlinear. We thus design an approach to project the original ratings of users to more representative values. This approach can be regarded as a data pretreatment method. Simulation in both artificial and real networks shows that the performance of the ranking algorithms can be improved when the projected ratings are used.

preprint2013arXiv

Absorption cross section and Hawking radiation of the electromagnetic field with Weyl corrections

We have investigated the absorption cross section and the Hawking radiation of electromagnetic field with Weyl correction in the background of a four-dimensional Schwarzschild black hole spacetime. Our results show that the properties of the absorption cross section and the Hawking radiation depend not only on the Weyl correction parameter, but also on the parity of the electromagnetic field, which is quite different from those of the usual electromagnetic field without Weyl correction in the four-dimensional spacetime. With increase of Weyl correction parameter, the absorption probability, the absorption cross section, the power emission spectra and the luminosity of Hawking radiation decreases with Weyl correction parameter for the odd-parity electromagnetic field and increases with the event-parity electromagnetic field.

preprint2013arXiv

Firm competition in a probabilistic framework of consumer choice

We develop a probabilistic consumer choice framework based on information asymmetry between consumers and firms. This framework makes it possible to study market competition of several firms by both quality and price of their products. We find Nash market equilibria and other optimal strategies in various situations ranging from competition of two identical firms to firms of different sizes and firms which improve their efficiency.

preprint2012arXiv

Measuring quality, reputation and trust in online communities

In the Internet era the information overload and the challenge to detect quality content has raised the issue of how to rank both resources and users in online communities. In this paper we develop a general ranking method that can simultaneously evaluate users' reputation and objects' quality in an iterative procedure, and that exploits the trust relationships and social acquaintances of users as an additional source of information. We test our method on two real online communities, the EconoPhysics forum and the Last.fm music catalogue, and determine how different variants of the algorithm influence the resultant ranking. We show the benefits of considering trust relationships, and define the form of the algorithm better apt to common situations.

preprint2011arXiv

Scattering of Scalar Waves by Schwarzschild Black Hole Immersed in Magnetic Field

The magnetic field is one of the most important constituents of the cosmic space and one of the main sources of the dynamics of interacting matter in the universe. The astronomical observations imply the existence of a strong magnetic fields of up to $10^4-10^8G$ near supermassive black holes in the active galactic nuclei and even around stellar mass black holes. In this paper, with the quantum scattering theory, we analysis the Schröedinger-type scalar wave equation of black hole immersed in magnetic field and numerically investigate its absorption cross section and scattering cross section. We find that the absorption cross sections oscillate about the geometric optical value in the high frequency regime. Furthermore in low frequency regime, the magnetic field makes the absorption cross section weaker and this effect is more obviously on lower frequency brand. On the other hand, for the effects of scattering cross sections for the black hole immersed in magnetic field, we find that the magnetic field makes the scattering flux weaker and its width narrower in the forward direction. We find that there also exists the glory phenomenon along the backforward direction. At fixed frequency, the glory peak is higher and the glory width becomes narrower due to the black hole immersed in magnetic field.