Skip to content
DraconiticResearch
Search Sources API
190,839 studies31 sourcesUpdated 53 min ago
PreprintLicence not statedHAL

Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations

Related

  1. Asymptotic Theory for Restricted Maximum Likelihood Estimators in Generalized Linear Mixed Models
    Zhanzhongyu Gao, Huadong Mo, Ziyang Lyu
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  2. Lifted Restricted Isometry Property and Fast Algorithm for Spectral Compressed Sensing With Near-Optimal Sample Complexity
    Xunmeng Wu, Jian-Feng Cai, Zongben Xu +1
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  3. Strong Simultaneous Inference for Restricted Mean Survival Time Processes in Multi-Arm Trials under Covariate-Adaptive Randomization
    Guannan Zhai, Feifang Hu
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  4. Formal solution and strong asymptotic expansion of some initial value problem in two complex time variables, infinite order irregular singularities and Mahler transforms
    Alberto Lastra, Stephane Malek
    arXivPreprintCC BY-NC-ND 4.0Full textAnalysis & PDEsarXiv
  5. Strong stable sets and asymptotic fineness
    Sergi Burniol Clotet, Françoise Dal'Bo
    arXivPreprintCC BY 4.0Full textDynamical systemsarXiv
BibTeX
@misc{chakraborty2026strong,
  title = {{Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations}},
  author = {Dibyayan Chakraborty and Florent Foucaud},
  howpublished = {HAL},
  year = {2026},
  month = sep,
  eprint = {2501.10828},
  archivePrefix = {arXiv},
  url = {https://hal.science/hal-05765921v1},
}
RIS
TY  - UNPB
TI  - Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations
AU  - Dibyayan Chakraborty
AU  - Florent Foucaud
PY  - 2026
DA  - 2026/09/27
PB  - HAL
UR  - https://hal.science/hal-05765921v1
ER  -