Qiuping Alexandre Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Qiuping Alexandre Wang has a total of 79 co-authors. Here are the top co-authors by number of shared publications:
A. El Kaabouchi
ESTACA Parc universitaire Laval-Changé Rue Georges Charpak Laval France
5 shared publicationsA. Le Méhauté
Institut Supérieur des Matériaux et Mécaniques Avancées du Mans, 44 Avenue Bartholdi, 72000 Le Mans, France
3 shared publicationsAziz El Kaabouchi
ESTACA Rue Georges Charpak Parc universitaire Laval Changé Laval France
3 shared publicationsF. Tsobnang
Institut Supérieur des Matériaux et Mécaniques Avancées du Mans, 44 Avenue Bartholdi, 72000 Le Mans, France
3 shared publicationsL. Nivanen
Laboratoire de Physique Statistique et Systèmes Complexes, ISMANS, 44 Avenue, F.A. Bartholdi, 72000 Le Mans, France
3 shared publicationsR. Wang
Laboratoire SCIQ ESIEA 9 Rue Vésale 75005 Paris France
3 shared publications
Latest Publications
- Open Access
- 30 June 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (13) , 2311
A Non-Negative Measure of Information for Continuous Probability Distributions
In this work, we investigate the possibility of using varentropy, an information measure previously proposed for discrete probability distribution, as a measure of the probabilistic uncertainty of continuous probability distribution. We show that varentropy allows avoiding negative values and some undesirable features of informational entropy encountered while using the Boltzmann–Shannon formula (and others) for continuous probability distributions.
- 30 June 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (13) , 2311
Open AccessA Non-Negative Measure of Information for Continuous Probability Distributions
In this work, we investigate the possibility of using varentropy, an information measure previously proposed for discrete probability distribution, as a measure of the probabilistic uncertainty of continuous probability distribution. We show that varentropy allows avoiding negative values and some undesirable features of informational entropy encountered while using the Boltzmann–Shannon formula (and others) for continuous probability distributions.
- 21 December 2025
- Published by Springer Nature in The European Physical Journal Plus
- Vol. 140 (12)
Derivation of the maximum entropy principle from the virtual work principle
- 21 December 2025
- Published by Springer Nature in The European Physical Journal Plus
- Vol. 140 (12)
Derivation of the maximum entropy principle from the virtual work principle
- Open Access
Supervised and Unsupervised Learning with Numerical Computation for the Wolfram Cellular Automata
The local rules of elementary cellular automata (ECA) with one-dimensional three-cell neighborhoods are represented by eight-bit binary numbers that encode deterministic update rules. This class of systems is also commonly referred to as the Wolfram cellular automata. These automata are widely utilized to investigate self-organization phenomena and the dynamics of complex systems. In this work, we employ numerical simulations and computational methods to investigate the asymptotic density and dynamical evolution mechanisms in Wolfram automata. We explore alternative initial conditions under which certain Wolfram rules generate similar fractal patterns over time, even when starting from a single active site. Our results reveal the relationship between the asymptotic density and the initial density of selected rules. Furthermore, we apply both supervised and unsupervised learning methods to identify the configurations associated with different Wolfram rules. The supervised learning methods effectively identify the configurations of various Wolfram rules, while unsupervised methods like principal component analysis and autoencoders can approximately cluster configurations of different Wolfram rules into distinct groups, yielding results that align well with simulated density outputs. Machine learning methods offer significant advantages in identifying different Wolfram rules, as they can effectively distinguish highly similar configurations that are challenging to differentiate manually.
Open AccessSupervised and Unsupervised Learning with Numerical Computation for the Wolfram Cellular Automata
The local rules of elementary cellular automata (ECA) with one-dimensional three-cell neighborhoods are represented by eight-bit binary numbers that encode deterministic update rules. This class of systems is also commonly referred to as the Wolfram cellular automata. These automata are widely utilized to investigate self-organization phenomena and the dynamics of complex systems. In this work, we employ numerical simulations and computational methods to investigate the asymptotic density and dynamical evolution mechanisms in Wolfram automata. We explore alternative initial conditions under which certain Wolfram rules generate similar fractal patterns over time, even when starting from a single active site. Our results reveal the relationship between the asymptotic density and the initial density of selected rules. Furthermore, we apply both supervised and unsupervised learning methods to identify the configurations associated with different Wolfram rules. The supervised learning methods effectively identify the configurations of various Wolfram rules, while unsupervised methods like principal component analysis and autoencoders can approximately cluster configurations of different Wolfram rules into distinct groups, yielding results that align well with simulated density outputs. Machine learning methods offer significant advantages in identifying different Wolfram rules, as they can effectively distinguish highly similar configurations that are challenging to differentiate manually.
- 27 March 2023
- Published by Springer Nature in The European Physical Journal Plus
- Vol. 138 (3) , 1-10
Assessing black swan events with the stochastic least action principle, Tsallis entropy and heavy-tailed distribution
- 27 March 2023
- Published by Springer Nature in The European Physical Journal Plus
- Vol. 138 (3) , 1-10
Assessing black swan events with the stochastic least action principle, Tsallis entropy and heavy-tailed distribution
- Open Access
A System-Independent Derivation of Preferential Attachment from the Principle of Least Effort
Preferential attachment (PA) is a widely observed behavior in many living systems and has been used in modeling many networks. The aim of this work is to show that the mechanism of PA is a consequence of the fundamental principle of least effort. We derive PA directly from this principle in maximizing an efficiency function. This approach not only allows a better understanding of the different PA mechanisms already reported but also naturally extends these mechanisms with a non-power law probability of attachment. The possibility of using the efficiency function as a general measure of attachment efficiency is also investigated.
Open AccessA System-Independent Derivation of Preferential Attachment from the Principle of Least Effort
Preferential attachment (PA) is a widely observed behavior in many living systems and has been used in modeling many networks. The aim of this work is to show that the mechanism of PA is a consequence of the fundamental principle of least effort. We derive PA directly from this principle in maximizing an efficiency function. This approach not only allows a better understanding of the different PA mechanisms already reported but also naturally extends these mechanisms with a non-power law probability of attachment. The possibility of using the efficiency function as a general measure of attachment efficiency is also investigated.
- 9 November 2022
- Published by Springer Nature in The European Physical Journal Plus
- Vol. 137 (11) , 1-11
You certainly know the second law of thermodynamics, Do you know its connection to other laws of physics and chemistry?
- 9 November 2022
- Published by Springer Nature in The European Physical Journal Plus
- Vol. 137 (11) , 1-11
You certainly know the second law of thermodynamics, Do you know its connection to other laws of physics and chemistry?
- Open Access
Uniqueness of the efficiency functional for deriving the Zipf and the Pareto laws from the principle of least effort
In a previous work, we applied the principle of least effort to derive the Zipf and the Pareto power law distributions using a calculus of variation and an efficiency functional. This functional was arrived at by considering living systems containing a great number of agents all trying to achieve something with effort, similarly to thermal engines producing work from source energy, and a nonadditive relationship of efficiency in thermodynamics. In the present work, we provide a complete proof of the uniqueness of this efficiency functional, thus confirms the intrinsic link between the power laws and the principle of least effort.
Open AccessUniqueness of the efficiency functional for deriving the Zipf and the Pareto laws from the principle of least effort
In a previous work, we applied the principle of least effort to derive the Zipf and the Pareto power law distributions using a calculus of variation and an efficiency functional. This functional was arrived at by considering living systems containing a great number of agents all trying to achieve something with effort, similarly to thermal engines producing work from source energy, and a nonadditive relationship of efficiency in thermodynamics. In the present work, we provide a complete proof of the uniqueness of this efficiency functional, thus confirms the intrinsic link between the power laws and the principle of least effort.
- Open Access
Study of a measure of efficiency as a tool for applying the principle of least effort to the derivation of the Zipf and the Pareto laws
The principle of least effort is believed to be a universal rule for living systems. Its application to the derivation of the power law probability distributions of living systems has long been challenging. Recently, a measure of efficiency was proposed as a tool of deriving Zipf s and Pareto s laws directly from the principle of least effort. The present work is a further investigation of this efficiency measure from a mathematical point of view. The aim is to get further insight into its properties and usefulness as a metric of performance. We address some key mathematical properties of this efficiency such as its sign, uniqueness and robustness. We also look at the relationship between this measure and other properties of the system of interest such as inequality and uncertainty, by introducing a new method for calculating non-negative continuous entropy.
Open AccessStudy of a measure of efficiency as a tool for applying the principle of least effort to the derivation of the Zipf and the Pareto laws
The principle of least effort is believed to be a universal rule for living systems. Its application to the derivation of the power law probability distributions of living systems has long been challenging. Recently, a measure of efficiency was proposed as a tool of deriving Zipf s and Pareto s laws directly from the principle of least effort. The present work is a further investigation of this efficiency measure from a mathematical point of view. The aim is to get further insight into its properties and usefulness as a metric of performance. We address some key mathematical properties of this efficiency such as its sign, uniqueness and robustness. We also look at the relationship between this measure and other properties of the system of interest such as inequality and uncertainty, by introducing a new method for calculating non-negative continuous entropy.
- 1 December 2021
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 153, 111489
Principle of least effort vs. maximum efficiency: deriving Zipf-Pareto's laws
- 1 December 2021
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 153, 111489
Principle of least effort vs. maximum efficiency: deriving Zipf-Pareto's laws