On the public citation graph

Probability Theory of Classical Euclidean Optimization Problems

0 signed · 202 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/(sici)1098-2418(199903)14:2<139::aid-rsa2>3.0.co;2-eopenalex-snapshot
On the variance of the random sphere of influence graph
inferred← citeshttps://doi.org/10.1002/0471667196.ess6056openalex-snapshot
Graph‐Theoretical Methods
inferred← citeshttps://doi.org/10.1002/9781118445112.stat02416openalex-snapshot
Graph‐Theoretical Methods
inferred← citeshttps://doi.org/10.1002/net.22099openalex-snapshot
Continuous approximation formulas for location problems
inferred← citeshttps://doi.org/10.1002/rsa.20156openalex-snapshot
Probabilistic analysis for a multiple depot vehicle routing problem
inferred← citeshttps://doi.org/10.1002/rsa.20185openalex-snapshot
Limit theory for the random on‐line nearest‐neighbor graph
inferred← citeshttps://doi.org/10.1002/rsa.20651openalex-snapshot
Central limit theorems for the radial spanning tree
inferred← citeshttps://doi.org/10.1002/rsa.20714openalex-snapshot
Probabilistic analysis of power assignments
inferred← citeshttps://doi.org/10.1002/rsa.20831openalex-snapshot
An average case analysis of the minimum spanning tree heuristic for the power assignment problem
inferred← citeshttps://doi.org/10.1006/jmva.2001.1992openalex-snapshot
Graph-Theoretic Procedures for Dimension Identification
inferred← citeshttps://doi.org/10.1007/0-387-23394-6_10openalex-snapshot
Statistical Distances Based on Euclidean Graphs
inferred← citeshttps://doi.org/10.1007/0-8176-4481-4_9openalex-snapshot
Determining Intrinsic Dimension and Entropy of High-Dimensional Shape Spaces
inferred← citeshttps://doi.org/10.1007/11550907_27openalex-snapshot
Independent Subspace Analysis Using k-Nearest Neighborhood Distances
inferred← citeshttps://doi.org/10.1007/11564096_71openalex-snapshot
Independent Subspace Analysis on Innovations
inferred← citeshttps://doi.org/10.1007/11590156_29openalex-snapshot
Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1007/11679363_113openalex-snapshot
Cross-Entropy Optimization for Independent Process Analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-43408-3_1openalex-snapshot
A Fractal Dimension for Measures via Persistent Homology
inferred← citeshttps://doi.org/10.1007/978-3-031-12244-6_43openalex-snapshot
Optimal Matching of Random Samples and Rates of Convergence of Empirical Measures
inferred← citeshttps://doi.org/10.1007/978-3-032-21300-6_51openalex-snapshot
Topological Metric for Unsupervised Embedding Quality Evaluation
inferred← citeshttps://doi.org/10.1007/978-3-319-00321-4_19openalex-snapshot
Combinatorial Optimization Over Two Random Point Sets
inferred← citeshttps://doi.org/10.1007/978-3-319-46577-7_4openalex-snapshot
Euclidean Matching Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-47886-9_15openalex-snapshot
Generation of Spatially Embedded Random Networks to Model Complex Transportation Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-74180-2_5openalex-snapshot
Probabilistic Properties of Highly Connected Random Geometric Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-77050-3_41openalex-snapshot
Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_10openalex-snapshot
Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals
inferred← citeshttps://doi.org/10.1007/978-3-642-31155-0_20openalex-snapshot
A Probabilistic Analysis of Christofides’ Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-33305-7_6openalex-snapshot
Asymptotic Methods for Random Tessellations
inferred← citeshttps://doi.org/10.1007/978-3-642-33305-7_8openalex-snapshot
Limit Theorems in Discrete Stochastic Geometry
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_21openalex-snapshot
Random Shortest Paths: Non-euclidean Instances for Metric Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-45030-3_54openalex-snapshot
Smoothed Analysis of the 2-Opt Heuristic for the TSP: Polynomial Bounds for Gaussian Noise
inferred← citeshttps://doi.org/10.1007/978-3-662-09444-0_1openalex-snapshot
The Objective Method: Probabilistic Combinatorial Optimization and Local Weak Convergence
inferred← citeshttps://doi.org/10.1007/978-3-662-44465-8_18openalex-snapshot
Probabilistic Analysis of Power Assignments
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_70openalex-snapshot
Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic
inferred← citeshttps://doi.org/10.1007/978-3-662-49768-5openalex-snapshot
Recueil de Modèles Aléatoires
inferred← citeshttps://doi.org/10.1007/978-3-7908-2628-9_13openalex-snapshot
Laws of Large Numbers and Nearest Neighbor Distances
inferred← citeshttps://doi.org/10.1007/pl00008785openalex-snapshot
Large deviation principles for Euclidean functionals and other nearly additive processes
inferred← citeshttps://doi.org/10.1007/s00220-013-1725-yopenalex-snapshot
Random Parking, Euclidean Functionals, and Rubber Elasticity
inferred← citeshttps://doi.org/10.1007/s002200100387openalex-snapshot
Random Parking, Sequential Adsorption,¶and the Jamming Limit
inferred← citeshttps://doi.org/10.1007/s00440-006-0026-1openalex-snapshot
Concentration inequalities for random fields via coupling
inferred← citeshttps://doi.org/10.1007/s00440-015-0678-9openalex-snapshot
Random geometric complexes in the thermodynamic regime
inferred← citeshttps://doi.org/10.1007/s00440-018-0837-xopenalex-snapshot
A PDE approach to a 2-dimensional matching problem
inferred← citeshttps://doi.org/10.1007/s00440-023-01245-1openalex-snapshot
Optimal transport methods for combinatorial optimization over two random point sets
inferred← citeshttps://doi.org/10.1007/s00453-008-9164-4openalex-snapshot
Note on the Structure of Kruskal’s Algorithm
inferred← citeshttps://doi.org/10.1007/s00453-012-9643-5openalex-snapshot
Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals
inferred← citeshttps://doi.org/10.1007/s00453-014-9901-9openalex-snapshot
Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems
inferred← citeshttps://doi.org/10.1007/s00453-016-0160-9openalex-snapshot
Distribution-Sensitive Construction of the Greedy Spanner
inferred← citeshttps://doi.org/10.1007/s00453-025-01335-7openalex-snapshot
Smoothed Analysis of the 2-Opt Heuristic for the TSP under Gaussian Noise
inferred← citeshttps://doi.org/10.1007/s10100-016-0437-8openalex-snapshot
Generating subtour elimination constraints for the TSP from pure integer solutions
inferred← citeshttps://doi.org/10.1007/s10107-023-02011-wopenalex-snapshot
The simultaneous semi-random model for TSP
inferred← citeshttps://doi.org/10.1007/s10589-012-9472-0openalex-snapshot
Computing the variance of tour costs over the solution space of the TSP in polynomial time
inferred← citeshttps://doi.org/10.1007/s10958-019-04253-6openalex-snapshot
On Optimal Matching of Gaussian Samples
inferred← citeshttps://doi.org/10.1007/s10959-007-0089-7openalex-snapshot
Rates of Convergence of Means of Euclidean Functionals
inferred← citeshttps://doi.org/10.1007/s10959-021-01080-xopenalex-snapshot
Euclidean Travelling Salesman Problem with Location-Dependent and Power-Weighted Edges
inferred← citeshttps://doi.org/10.1007/s11118-020-09852-6openalex-snapshot
Some Results on the Optimal Matching Problem for the Jacobi Model
inferred← citeshttps://doi.org/10.1007/s11134-011-9246-xopenalex-snapshot
On the greedy walk problem
inferred← citeshttps://doi.org/10.1007/s11222-011-9242-3openalex-snapshot
Design of computer experiments: space filling and beyond
inferred← citeshttps://doi.org/10.1016/j.cosrev.2008.10.002openalex-snapshot
The saga of minimum spanning trees
inferred← citeshttps://doi.org/10.1016/j.dam.2019.04.007openalex-snapshot
Probabilistic properties of highly connected random geometric graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.05.034openalex-snapshot
Performance of efficient variants of the 2-Opt heuristic for the traveling salesperson problem
inferred← citeshttps://doi.org/10.1016/j.dsp.2012.04.018openalex-snapshot
Distributed high dimensional information theoretical image registration via random projections
inferred← citeshttps://doi.org/10.1016/j.jmva.2012.12.007openalex-snapshot
Intrinsic dimension identification via graph-theoretic methods
inferred← citeshttps://doi.org/10.1016/j.neucom.2025.130619openalex-snapshot
Data vulnerability index for the “crowding problem” in nonlinear dimensionality reduction
inferred← citeshttps://doi.org/10.1016/j.peva.2010.08.024openalex-snapshot
Asymptotically optimal trade-off between local and global connectivity in wireless networks
inferred← citeshttps://doi.org/10.1016/j.sigpro.2004.10.002openalex-snapshot
Image matching using alpha-entropy measures and entropic graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.05.021openalex-snapshot
Optimal random matchings, tours, and spanning trees in hierarchically separated trees
inferred← citeshttps://doi.org/10.1016/j.trb.2017.09.019openalex-snapshot
Advancements in continuous approximation models for logistics and transportation systems: 1996–2016
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00437-xopenalex-snapshot
Worst case asymptotics of power-weighted Euclidean functionals
inferred← citeshttps://doi.org/10.1016/s0167-7152(01)00073-6openalex-snapshot
Rate of convergence of bootstrapped empirical measures
inferred← citeshttps://doi.org/10.1016/s0167-7152(01)00175-4openalex-snapshot
Strong laws for Euclidean graphs with general edge weights
inferred← citeshttps://doi.org/10.1016/s0167-7152(02)00144-xopenalex-snapshot
Gaussian tail for empirical distributions of MST on random graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00066-xopenalex-snapshot
An asymptotic theory for recurrence relations based on minimization and maximization
inferred← citeshttps://doi.org/10.1016/s0304-4149(98)00065-9openalex-snapshot
Asymptotics of power-weighted Euclidean functionals
inferred← citeshttps://doi.org/10.1016/s0304-4149(99)00035-6openalex-snapshot
Asymptotics for Voronoi tessellations on random samples
inferred← citeshttps://doi.org/10.1016/s0304-4149(99)00068-xopenalex-snapshot
Asymptotics for weighted minimal spanning trees on random points
inferred← citeshttps://doi.org/10.1016/s0304-4149(99)00091-5openalex-snapshot
Rate of convergence of power-weighted Euclidean minimal spanning trees
inferred← citeshttps://doi.org/10.1017/9781108637435.018openalex-snapshot
Smoothed Analysis of Local Search
inferred← citeshttps://doi.org/10.1017/apr.2022.1openalex-snapshot
Sub-tree counts on hyperbolic random geometric graphs
inferred← citeshttps://doi.org/10.1017/apr.2023.10openalex-snapshot
Upper large deviations for power-weighted edge lengths in spatial random networks
inferred← citeshttps://doi.org/10.1017/s000186780000077xopenalex-snapshot
Rooted edges of a minimal directed spanning tree on random points
inferred← citeshttps://doi.org/10.1017/s0001867800001002openalex-snapshot
On the total length of the random minimal directed spanning tree
inferred← citeshttps://doi.org/10.1017/s000186780000313xopenalex-snapshot
Nearest-neighbor graphs on the cantor set
inferred← citeshttps://doi.org/10.1017/s0001867800009332openalex-snapshot
Asymptotics for geometric location problems over random samples
inferred← citeshttps://doi.org/10.1017/s0001867800013069openalex-snapshot
Random minimal directed spanning trees and Dickman-type distributions
inferred← citeshttps://doi.org/10.1017/s0001867800050394openalex-snapshot
Limit theorems for random spatial drainage networks
inferred← citeshttps://doi.org/10.1017/s0269964821000115openalex-snapshot
THE NEAREST UNVISITED VERTEX WALK ON RANDOM GRAPHS
inferred← citeshttps://doi.org/10.1017/s0305004115000250openalex-snapshot
The stretch-length tradeoff in geometric networks: average case and worst case study
inferred← citeshttps://doi.org/10.1017/s0963548300004454openalex-snapshot
Convergence Theorems for Some Layout Measures on Random Lattice and Random Geometric Graphs
inferred← citeshttps://doi.org/10.1017/s096354830600798xopenalex-snapshot
On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem
inferred← citeshttps://doi.org/10.1017/s0963548323000445openalex-snapshot
On minimum spanning trees for random Euclidean bipartite graphs
inferred← citeshttps://doi.org/10.1023/a:1014819112010openalex-snapshot
Asymptotics for Statistical Distances Based on Voronoi Tessellations
inferred← citeshttps://doi.org/10.1023/a:1022229713275openalex-snapshot
Gaussian Fields and Random Packing
inferred← citeshttps://doi.org/10.1063/1.5126724openalex-snapshot
Macroscopic and edge behavior of a planar jellium
inferred← citeshttps://doi.org/10.1080/03610926.2017.1285925openalex-snapshot
Asymptotics for Euclidean functionals of mixing processes
inferred← citeshttps://doi.org/10.1090/fic/055/03openalex-snapshot
Solving min-max multi-depot vehicle routing problem
inferred← citeshttps://doi.org/10.1090/memo/1259openalex-snapshot
One-dimensional empirical measures, order statistics, and Kantorovich transport distances
inferred← citeshttps://doi.org/10.1098/rspa.2008.0235openalex-snapshot
A law of large numbers for nearest neighbour statistics
inferred← citeshttps://doi.org/10.1103/physreve.90.012118openalex-snapshot
Scaling hypothesis for the Euclidean bipartite matching problem
inferred← citeshttps://doi.org/10.1103/physreve.95.052129openalex-snapshot
Finite-size corrections in the random assignment problem
inferred← citeshttps://doi.org/10.1109/18.782114openalex-snapshot
Asymptotic theory of greedy approximations to minimal k-point random graphs
inferred← citeshttps://doi.org/10.1109/acssc.2003.1291928openalex-snapshot
Entropic graphs for manifold learning
inferred← citeshttps://doi.org/10.1109/allerton.2014.7028443openalex-snapshot
Active target detection with navigation costs: A randomized benchmark
inferred← citeshttps://doi.org/10.1109/icassp.2004.1326713openalex-snapshot
Manifold learning using Euclidean k-nearest neighbor graphs [image processing examples]
inferred← citeshttps://doi.org/10.1109/icassp.2018.8462306openalex-snapshot
A Dimension-Independent Discriminant Between Distributions
inferred← citeshttps://doi.org/10.1109/icassp.2019.8682529openalex-snapshot
Feature Selection for Mutlti-labeled Variables via Dependency Maximization
inferred← citeshttps://doi.org/10.1109/isic.2013.6658624openalex-snapshot
Probabilistic analysis of sampling based path planning algorithms
inferred← citeshttps://doi.org/10.1109/isit.2017.8006659openalex-snapshot
Direct estimation of information divergence using nearest neighbor ratios
inferred← citeshttps://doi.org/10.1109/jsac.2009.090916openalex-snapshot
Energy scaling laws for distributed inference in random fusion networks
inferred← citeshttps://doi.org/10.1109/jsac.2009.090919openalex-snapshot
Scalability of node degrees in random wireless network topologies
inferred← citeshttps://doi.org/10.1109/msp.2002.1028355openalex-snapshot
Applications of entropic spanning graphs
inferred← citeshttps://doi.org/10.1109/qest.2009.44openalex-snapshot
Quantifying the Trade-off Between the Level of Connectivity and Local Complexity in Random Wireless Network Topologies
inferred← citeshttps://doi.org/10.1109/saic51296.2020.9239155openalex-snapshot
Mathematical Modeling Of Transport Logistics Problems
inferred← citeshttps://doi.org/10.1109/siu.2017.7960448openalex-snapshot
Registration and optimization in entropic graphs using branch skeleton features
inferred← citeshttps://doi.org/10.1109/ssp.2005.1628631openalex-snapshot
Estimating Local Intrinsic Dimension with k-Nearest Neighbor Graphs
inferred← citeshttps://doi.org/10.1109/tsp.2004.831130openalex-snapshot
Geodesic Entropic Graphs for Dimension and Entropy Estimation in Manifold Learning
inferred← citeshttps://doi.org/10.1134/s207004661102004xopenalex-snapshot
Asymptotic properties of combinatorial optimization problems in p-adic space
inferred← citeshttps://doi.org/10.1137/130946642openalex-snapshot
Variable Density Sampling with Continuous Trajectories
inferred← citeshttps://doi.org/10.1137/19m1296859openalex-snapshot
Coulomb Gases Under Constraint: Some Theoretical and Numerical Results
inferred← citeshttps://doi.org/10.1137/20m1385895openalex-snapshot
$k$-Variance: A Clustered Notion of Variance
inferred← citeshttps://doi.org/10.1142/s0219199715500200openalex-snapshot
Circular law for random matrices with unconditional log-concave distribution
inferred← citeshttps://doi.org/10.1142/s1793525323500590openalex-snapshot
Central limit theorem for euclidean minimal spanning acycles
inferred← citeshttps://doi.org/10.1145/1060590.1060656openalex-snapshot
On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem
inferred← citeshttps://doi.org/10.1145/1102351.1102436openalex-snapshot
Independent subspace analysis using geodesic spanning trees
inferred← citeshttps://doi.org/10.1145/509907.509951openalex-snapshot
Average case analysis for batched disk scheduling and increasing subsequences
inferred← citeshttps://doi.org/10.1184/r1/6475520openalex-snapshot
Conditional Distance Variance and Correlation
inferred← citeshttps://doi.org/10.1184/r1/6475955openalex-snapshot
Nonparametric Estimation of Conditional Information and Divergences
inferred← citeshttps://doi.org/10.1184/r1/6476306openalex-snapshot
Robust Nonparametric Copula Based Dependence Estimators
inferred← citeshttps://doi.org/10.1201/b11431-3openalex-snapshot
Robust Laplacian Eigenmaps Using Global Information
inferred← citeshttps://doi.org/10.1214/009117905000000206openalex-snapshot
Multivariate spatial central limit theorems with applications to percolation and spatial graphs
inferred← citeshttps://doi.org/10.1214/009117906000000719openalex-snapshot
Optimal flow through the disordered lattice
inferred← citeshttps://doi.org/10.1214/07-aap472openalex-snapshot
Navigation on a Poisson point process
inferred← citeshttps://doi.org/10.1214/07-aihp138openalex-snapshot
Near-minimal spanning trees: A scaling exponent in probability models
inferred← citeshttps://doi.org/10.1214/07-aop370openalex-snapshot
A new method of normal approximation
inferred← citeshttps://doi.org/10.1214/10-aap724openalex-snapshot
Geodesics and flows in a Poissonian city
inferred← citeshttps://doi.org/10.1214/10-aos773openalex-snapshot
Correction: A class of Rényi information estimators for multidimensional densities
inferred← citeshttps://doi.org/10.1214/10-sts335openalex-snapshot
Connected Spatial Networks over Random Points and a Route-Length Statistic
inferred← citeshttps://doi.org/10.1214/105051604000000594openalex-snapshot
Gaussian limits for random measures in geometric probability
inferred← citeshttps://doi.org/10.1214/105051606000000826openalex-snapshot
The radial spanning tree of a Poisson point process
inferred← citeshttps://doi.org/10.1214/12-aap897openalex-snapshot
Limit theory for point processes in manifolds
inferred← citeshttps://doi.org/10.1214/15-aap1142openalex-snapshot
Beardwood–Halton–Hammersley theorem for stationary ergodic sequences: A counterexample
inferred← citeshttps://doi.org/10.1214/15-aap1162openalex-snapshot
Shortest path through random points
inferred← citeshttps://doi.org/10.1214/16-aop1132openalex-snapshot
The scaling limit of the minimum spanning tree of the complete graph
inferred← citeshttps://doi.org/10.1214/17-aop1252openalex-snapshot
The scaling limits of the Minimal Spanning Tree and Invasion Percolation in the plane
inferred← citeshttps://doi.org/10.1214/18-aop1273openalex-snapshot
Limit theory for geometric statistics of point processes having fast decay of correlations
inferred← citeshttps://doi.org/10.1214/20-aap1630openalex-snapshot
Central limit theorems for combinatorial optimization problems on sparse Erdős–Rényi graphs
inferred← citeshttps://doi.org/10.1214/20-aap1656openalex-snapshot
A simple Fourier analytic proof of the AKT optimal matching theorem
inferred← citeshttps://doi.org/10.1214/20-aap1661openalex-snapshot
Limit theory of combinatorial optimization for random geometric graphs
inferred← citeshttps://doi.org/10.1214/20-aoas1362openalex-snapshot
A nearest-neighbor based nonparametric test for viral remodeling in heterogeneous single-cell proteomic data
inferred← citeshttps://doi.org/10.1214/20-aos1997openalex-snapshot
Minimax estimation of smooth optimal transport maps
inferred← citeshttps://doi.org/10.1214/21-aap1768openalex-snapshot
Quantitative two-scale stabilization on the Poisson space
inferred← citeshttps://doi.org/10.1214/21-aop1562openalex-snapshot
A fluctuation result for the displacement in the optimal matching problem
inferred← citeshttps://doi.org/10.1214/21-aos2073openalex-snapshot
A simple measure of conditional dependence
inferred← citeshttps://doi.org/10.1214/21-ejs1946openalex-snapshot
The entropy based goodness of fit tests for generalized von Mises-Fisher distributions and beyond
inferred← citeshttps://doi.org/10.1214/22-aap1822openalex-snapshot
Rates of multivariate normal approximation for statistics in geometric probability
inferred← citeshttps://doi.org/10.1214/22-ejp784openalex-snapshot
On the quadratic random matching problem in two-dimensional domains
inferred← citeshttps://doi.org/10.1214/24-ejp1129openalex-snapshot
Lower bounds for variances of Poisson functionals
inferred← citeshttps://doi.org/10.1214/aoap/1015345393openalex-snapshot
Central Limit Theorems for Some Graphs in Computational Geometry
inferred← citeshttps://doi.org/10.1214/aoap/1019487353openalex-snapshot
Vertex ordering and partitioning problems for random spatial graphs
inferred← citeshttps://doi.org/10.1214/aoap/1029962596openalex-snapshot
Asymptotics for the length of a minimal triangulation on a random sample
inferred← citeshttps://doi.org/10.1214/aoap/1042765669openalex-snapshot
Weak laws of large numbers in geometric probability
inferred← citeshttps://doi.org/10.1214/aoap/1050689601openalex-snapshot
Covering algorithms, continuum percolation and the geometry of wireless networks
inferred← citeshttps://doi.org/10.1214/aop/1008956686openalex-snapshot
Special Invited Paper: Geodesics And Spanning Tees For Euclidean First-Passage Percolaton
inferred← citeshttps://doi.org/10.1214/ejp.v16-969openalex-snapshot
Asymptotic Moments of Near Neighbor Distances for the Gaussian Distribution
inferred← citeshttps://doi.org/10.1214/ejp.v19-2920openalex-snapshot
Scale-invariant random spatial networks
inferred← citeshttps://doi.org/10.1239/aap/1183667613openalex-snapshot
Explicit laws of large numbers for random nearest-neighbour-type graphs
inferred← citeshttps://doi.org/10.1239/aap/1208358883openalex-snapshot
Short-length routes in low-cost networks via Poisson line patterns
inferred← citeshttps://doi.org/10.1239/aap/1427814579openalex-snapshot
New Bounds for the Traveling Salesman Constant
inferred← citeshttps://doi.org/10.1287/ijoc.2024.0538openalex-snapshot
A New Upper Bound for the Euclidean TSP Constant
inferred← citeshttps://doi.org/10.1287/moor.2014.0706openalex-snapshot
Euclidean Networks with a Backbone and a Limit Theorem for Minimum Spanning Caterpillars
inferred← citeshttps://doi.org/10.1287/trsc.1030.0037openalex-snapshot
Bounds and Approximations for the Transportation Problem of Linear Programming and Other Scalable Network Problems
inferred← citeshttps://doi.org/10.13130/di-gioacchino-andrea_phd2019-12-17openalex-snapshot
EUCLIDEAN CORRELATIONS IN COMBINATORIAL OPTIMIZATION PROBLEMS: A STATISTICAL PHYSICS APPROACH
inferred← citeshttps://doi.org/10.13130/malatesta-enrico-maria_phd2018-12-21openalex-snapshot
RANDOM COMBINATORIAL OPTIMIZATION PROBLEMS: MEAN FIELD AND FINITE-DIMENSIONAL RESULTS
inferred← citeshttps://doi.org/10.16943/ptinsa/2018/49402openalex-snapshot
Stress Granules and P-Bodies: An Insight into mRNA Translational Control and Decay
inferred← citeshttps://doi.org/10.17918/00001208openalex-snapshot
Problems in extremal and combinatorial geometry
inferred← citeshttps://doi.org/10.2140/pmp.2021.2.121openalex-snapshot
Convergence of asymptotic costs for random Euclidean matching problems
inferred← citeshttps://doi.org/10.2140/pmp.2021.2.341openalex-snapshot
Convergence of asymptotic costs for random Euclidean matching problems
inferred← citeshttps://doi.org/10.23919/ecc57647.2023.10178400openalex-snapshot
On Asymptotic Optimality Property of a Sampling based Motion Planner
inferred← citeshttps://doi.org/10.26518/2071-7296-2018-2-179-188openalex-snapshot
ECONOMIC-MATHEMATICAL MODELING OF FOUNDATION CONSTRUCTION TECHNOLOGY BY THE “WALL IN THE GROUND” METHOD
inferred← citeshttps://doi.org/10.3150/20-bej1318openalex-snapshot
Minimum spanning trees of random geometric graphs with location dependent weights
inferred← citeshttps://doi.org/10.33612/diss.925933989openalex-snapshot
Limit theory for spatial random networks
inferred← citeshttps://doi.org/10.3390/e21080787openalex-snapshot
Geometric Estimation of Multivariate Dependency
inferred← citeshttps://doi.org/10.3390/e21121144openalex-snapshot
Convergence Rates for Empirical Estimation of Binary Classification Bounds
inferred← citeshttps://doi.org/10.3390/e23040430openalex-snapshot
Robust Procedures for Estimating and Testing in the Framework of Divergence Measures
inferred← citeshttps://doi.org/10.4018/978-1-930708-26-6.ch009openalex-snapshot
The Gamma Test
inferred← citeshttps://doi.org/10.4064/am28-2-5openalex-snapshot
On the weighted Euclidean matching problem in Rd
inferred← citeshttps://doi.org/10.46298/dmtcs.3556openalex-snapshot
Point process stabilization methods and dimension estimation
inferred← citeshttps://doi.org/10.46298/dmtcs.3557openalex-snapshot
Error bounds in stochastic-geometric normal approximation
inferred← citeshttps://doi.org/10.48550/arxiv.1003.1954openalex-snapshot
Estimation of Rényi Entropy and Mutual Information Based on Generalized Nearest-Neighbor Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1302.1281openalex-snapshot
Travelling salesman-based compressive sampling
inferred← citeshttps://doi.org/10.48550/arxiv.1306.3030openalex-snapshot
Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1307.6837openalex-snapshot
Travelling Salesman-Based Variable Density Sampling
inferred← citeshttps://doi.org/10.48550/arxiv.1401.1085openalex-snapshot
Distribution-Sensitive Construction of the Greedy Spanner
inferred← citeshttps://doi.org/10.48550/arxiv.1707.03976openalex-snapshot
Asymptotic Optimality of Rapidly Exploring Random Tree
inferred← citeshttps://doi.org/10.48550/arxiv.2010.13362openalex-snapshot
Quantitative two-scale stabilization on the Poisson space
inferred← citeshttps://doi.org/10.48550/arxiv.2011.10716openalex-snapshot
Euclidean traveling salesman problem with location dependent and power weighted edges
inferred← citeshttps://doi.org/10.48550/arxiv.2012.14804openalex-snapshot
Kernel Partial Correlation Coefficient -- a Measure of Conditional Dependence
inferred← citeshttps://doi.org/10.48550/arxiv.2106.00453openalex-snapshot
Statistical tests based on Rényi entropy estimation
inferred← citeshttps://doi.org/10.48550/arxiv.math/0503483openalex-snapshot
Concentration inequalities for random fields via coupling
inferred← citeshttps://doi.org/10.48550/arxiv.math/0609547openalex-snapshot
Near-Minimal Spanning Trees: a Scaling Exponent in Probability Models
inferred← citeshttps://doi.org/10.5281/zenodo.38676openalex-snapshot
Learning Intrinsic Dimension And Intrinsic Entropy Of High-Dimensional Datasets
inferred← citeshttps://doi.org/10.5402/2012/362603openalex-snapshot
Network Topology Models for Multihop Wireless Networks
showing the first 200 of 202 · page through all 202
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.