Pedro Miranda
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Pedro Miranda has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Pedro Garcia-Segador
National Statistics Institute Pedro García- Segador is Researcher with , Spain
7 shared publications - Leandro Pardo
Department of Statistics, O.R., Complutense University of Madrid, Madrid, Spain
4 shared publications - María Jaenada
National University of Distance Education (UNED)
4 shared publications - Ángel Felipe
Department of Statistics and Operational Research, Complutense University of Madrid, 28040 Madrid, Spain
4 shared publications - Michel Grabisch
Centre d’Économie de la Sorbonne
3 shared publications - Eilas Fernandez Combarro
Department of Computer Science, University of Oviedo, Gijón, Spain
2 shared publications
Latest Publications
- 23 September 2026
- Published by Oxford University Press (OUP) in Journal of Survey Statistics and Methodology
Conditional Optimal Sampling: Enhancing Unequal-Probability Designs with Auxiliary Information
We address the problem of selecting a fixed-size sample from a finite population when the goal is to reduce the estimation error as much as possible. Our approach builds on the idea of choosing samples that are nearly optimal with respect to the values of the study variable, even though these values are not observed in advance. Instead, we rely on predictions derived from auxiliary information, for example, through statistical or machine-learning models, and construct sampling designs that are optimal for these predicted values. We show that this strategy is remarkably effective: even when the predictions are imperfect, the resulting designs tend to be very close to the unknown optimal design based on the true values. To understand why this happens, we study the geometric structure underlying the space of all feasible sampling designs and use this perspective to develop practical algorithms. Simulation experiments indicate that the proposed methodology achieves noticeably lower estimation error than classical unequal-probability sampling methods commonly used in the literature, including balanced procedures such as cube and classical fixed-size designs like conditional Poisson sampling.
- 23 September 2026
- Published by Oxford University Press (OUP) in Journal of Survey Statistics and Methodology
Conditional Optimal Sampling: Enhancing Unequal-Probability Designs with Auxiliary Information
We address the problem of selecting a fixed-size sample from a finite population when the goal is to reduce the estimation error as much as possible. Our approach builds on the idea of choosing samples that are nearly optimal with respect to the values of the study variable, even though these values are not observed in advance. Instead, we rely on predictions derived from auxiliary information, for example, through statistical or machine-learning models, and construct sampling designs that are optimal for these predicted values. We show that this strategy is remarkably effective: even when the predictions are imperfect, the resulting designs tend to be very close to the unknown optimal design based on the true values. To understand why this happens, we study the geometric structure underlying the space of all feasible sampling designs and use this perspective to develop practical algorithms. Simulation experiments indicate that the proposed methodology achieves noticeably lower estimation error than classical unequal-probability sampling methods commonly used in the literature, including balanced procedures such as cube and classical fixed-size designs like conditional Poisson sampling.
- 22 November 2025
- Published by Springer Nature in Journal of the Indian Society for Probability and Statistics
- Vol. 27 (1) , 133-157
Robust Fit to the Log-Logistic Distribution by Minimum Density Power Divergence Estimator
- 22 November 2025
- Published by Springer Nature in Journal of the Indian Society for Probability and Statistics
- Vol. 27 (1) , 133-157
Robust Fit to the Log-Logistic Distribution by Minimum Density Power Divergence Estimator
- 1 August 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 50 (3) , 2047-2072
On the Set of Balanced Games
We study the geometric structure of the set of cooperative transferable utility games having a nonempty core, characterized by Bondareva and Shapley as balanced games. We show that this set is a nonpointed polyhedral cone, and we find the set of its extremal rays and facets. This study is also done for the set of balanced games whose value for the grand coalition is fixed, which yields an affine nonpointed polyhedral cone. Finally, the case of nonnegative balanced games with fixed value for the grand coalition is tackled. This set is a convex polytope, with remarkable properties. We characterize its vertices and facets, study the adjacency structure of vertices, develop an algorithm for generating vertices in a random uniform way, and show that this polytope is combinatorial and its adjacency graph is Hamiltonian. Last, we give a characterization of the set of games having a core reduced to a singleton. Funding: This work was supported by the Spanish Government [Grant PID2021-124933NB-I00].
- 1 August 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 50 (3) , 2047-2072
On the Set of Balanced Games
We study the geometric structure of the set of cooperative transferable utility games having a nonempty core, characterized by Bondareva and Shapley as balanced games. We show that this set is a nonpointed polyhedral cone, and we find the set of its extremal rays and facets. This study is also done for the set of balanced games whose value for the grand coalition is fixed, which yields an affine nonpointed polyhedral cone. Finally, the case of nonnegative balanced games with fixed value for the grand coalition is tackled. This set is a convex polytope, with remarkable properties. We characterize its vertices and facets, study the adjacency structure of vertices, develop an algorithm for generating vertices in a random uniform way, and show that this polytope is combinatorial and its adjacency graph is Hamiltonian. Last, we give a characterization of the set of games having a core reduced to a singleton. Funding: This work was supported by the Spanish Government [Grant PID2021-124933NB-I00].
- Open Access
- 2 July 2025
- Published by Springer Nature in Theory and Decision
- Vol. 99 (1-2) , 255-283
Structure of polytopes associated to non-additive measures via toric ideals and Gröbner bases
In this paper we study the geometrical structure of some polytopes appearing in the study of families of non-additive measures using toric ideals and Gröbner bases. Toric ideals and Gröbner bases are tools appearing in Computational Algebra when dealing with ideals in the ring of polynomials in several variables, and they have been applied for obtaining both the faces and a triangulation of a polytope whose vertices are integer-valued. In this paper we provide examples on which we compare these tools with other ones: order polytopes and the polytope of 2-additive measures. Finally, we derive the combinatorial structure of the subfamily of 2-additive k-ary capacities.
- 2 July 2025
- Published by Springer Nature in Theory and Decision
- Vol. 99 (1-2) , 255-283
Open AccessStructure of polytopes associated to non-additive measures via toric ideals and Gröbner bases
In this paper we study the geometrical structure of some polytopes appearing in the study of families of non-additive measures using toric ideals and Gröbner bases. Toric ideals and Gröbner bases are tools appearing in Computational Algebra when dealing with ideals in the ring of polynomials in several variables, and they have been applied for obtaining both the faces and a triangulation of a polytope whose vertices are integer-valued. In this paper we provide examples on which we compare these tools with other ones: order polytopes and the polytope of 2-additive measures. Finally, we derive the combinatorial structure of the subfamily of 2-additive k-ary capacities.
- 24 September 2024
- Published by Springer Nature in Japanese Journal of Statistics and Data Science
- Vol. 8 (1) , 189-216
Robust estimators for the log-logistic model based on ranked set sampling
- 24 September 2024
- Published by Springer Nature in Japanese Journal of Statistics and Data Science
- Vol. 8 (1) , 189-216
Robust estimators for the log-logistic model based on ranked set sampling
- Open Access
- 18 October 2023
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 440
Model Selection for independent not identically distributed observations based on Rényi’s pseudodistances
- 18 October 2023
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 440
Open AccessModel Selection for independent not identically distributed observations based on Rényi’s pseudodistances
- Open Access
- 20 July 2023
- Published by Elsevier in Fuzzy Sets and Systems
- Vol. 470
A triangulation for pointed order polytopes
- 20 July 2023
- Published by Elsevier in Fuzzy Sets and Systems
- Vol. 470
Open AccessA triangulation for pointed order polytopes
- Open Access
An Approach to Canonical Correlation Analysis Based on Rényi’s Pseudodistances
Canonical Correlation Analysis (CCA) infers a pairwise linear relationship between two groups of random variables, and In this paper, we present a new procedure based on Rényi’s pseudodistances (RP) aiming to detect linear and non-linear relationships between the two groups. RP canonical analysis (RPCCA) finds canonical coefficient vectors, and , by maximizing an RP-based measure. This new family includes the Information Canonical Correlation Analysis (ICCA) as a particular case and extends the method for distances inherently robust against outliers. We provide estimating techniques for RPCCA and show the consistency of the proposed estimated canonical vectors. Further, a permutation test for determining the number of significant pairs of canonical variables is described. The robustness properties of the RPCCA are examined theoretically and empirically through a simulation study, concluding that the RPCCA presents a competitive alternative to ICCA with an added advantage in terms of robustness against outliers and data contamination.Open AccessAn Approach to Canonical Correlation Analysis Based on Rényi’s Pseudodistances
Canonical Correlation Analysis (CCA) infers a pairwise linear relationship between two groups of random variables, and In this paper, we present a new procedure based on Rényi’s pseudodistances (RP) aiming to detect linear and non-linear relationships between the two groups. RP canonical analysis (RPCCA) finds canonical coefficient vectors, and , by maximizing an RP-based measure. This new family includes the Information Canonical Correlation Analysis (ICCA) as a particular case and extends the method for distances inherently robust against outliers. We provide estimating techniques for RPCCA and show the consistency of the proposed estimated canonical vectors. Further, a permutation test for determining the number of significant pairs of canonical variables is described. The robustness properties of the RPCCA are examined theoretically and empirically through a simulation study, concluding that the RPCCA presents a competitive alternative to ICCA with an added advantage in terms of robustness against outliers and data contamination. - Open Access
- 17 March 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (6) , 1480
Restricted Distance-Type Gaussian Estimators Based on Density Power Divergence and Their Applications in Hypothesis Testing
In this paper, we introduce the restricted minimum density power divergence Gaussian estimator (MDPDGE) and study its main asymptotic properties. In addition, we examine it robustness through its influence function analysis. Restricted estimators are required in many practical situations, such as testing composite null hypotheses, and we provide in this case constrained estimators to inherent restrictions of the underlying distribution. Furthermore, we derive robust Rao-type test statistics based on the MDPDGE for testing a simple null hypothesis, and we deduce explicit expressions for some main important distributions. Finally, we empirically evaluate the efficiency and robustness of the method through a simulation study.
- 17 March 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (6) , 1480
Open AccessRestricted Distance-Type Gaussian Estimators Based on Density Power Divergence and Their Applications in Hypothesis Testing
In this paper, we introduce the restricted minimum density power divergence Gaussian estimator (MDPDGE) and study its main asymptotic properties. In addition, we examine it robustness through its influence function analysis. Restricted estimators are required in many practical situations, such as testing composite null hypotheses, and we provide in this case constrained estimators to inherent restrictions of the underlying distribution. Furthermore, we derive robust Rao-type test statistics based on the MDPDGE for testing a simple null hypothesis, and we deduce explicit expressions for some main important distributions. Finally, we empirically evaluate the efficiency and robustness of the method through a simulation study.
- 28 June 2022
- Published by Springer Nature
- p. 223-231
Phi-divergence Test Statistics Applied to Latent Class Models for Binary Data
- 28 June 2022
- Published by Springer Nature
- p. 223-231
Phi-divergence Test Statistics Applied to Latent Class Models for Binary Data