Sayeh Khaniha

Sayeh Khaniha
  • National Institute for Research in Computer Science and Control

About

3
Publications
83
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
0
Citations
Introduction
Skills and Expertise
Markov Chains
Markov
Graphs
Stochastic Processes
Markov Processes
Stochastic Modeling
Current institution
National Institute for Research in Computer Science and Control
National Institute for Research in Computer Science and Control
  • DYOGEN - Dynamics of Geometrics Networks Research Team
  • Le Chesnay, France

Publications

Publications (3)
Figure 1: Clusters of order zero generated by the CHN 2 clustering...
Figure 8: Clusters of order zero generated by the SHN 2 (and H 2 N 2 )...
Figure 11: A realization of the Cox point process from Example 4.2,...
Figure 12: A realization of the Cox point process from Example 4.2,...
+3 Figure 13: Left Diagram: Mean distances between clusters at different...
Hierarchical Clustering Algorithms on Poisson and Cox Point Processes
Preprint
Full-text available
  • Mar 2025
Clustering is a widely used technique in unsupervised learning to identify groups within a dataset based on the similarities between its elements. This paper introduces three new hierarchical clustering models, Clustroid Hierarchical Nearest Neighbor (\(\mathrm{CHN}^2\)), Single Linkage Hierarchical Nearest Neighbor (\(\mathrm{SHN}^2\)), and Hausdo...
View
Coupling from the past for the null recurrent Markov chain
Article
  • Aug 2024
The Doeblin graph of a countable state space Markov chain describes the joint pathwise evolutions of the Markov dynamics starting from all possible initial conditions, with two paths coalescing when they reach the same point of the state space at the same time. Its bridge Doeblin subgraph only contains the paths starting from a tagged point of the...
View
Figure 1. The maximally coupled Doeblin Graph and Bridge Graph of lazy...
Figure 2. The Taboo multiplicity and the Potential multiplicity
Figure 3. Coupling between Renewal EFT and Renewal Bridge Graph
Figure 4. Equivalence of connectedness of the Renewal Bridge Graph and...
Figure 5. Correspondence between an edge that flying over zero in the...
Coupling from the Past for the Null Recurrent Markov Chain
Preprint
Full-text available
  • Mar 2022
The Doeblin Graph of a countable state space Markov chain describes the joint pathwise evolutions of the Markov dynamics starting from all possible initial conditions, with two paths coalescing when they reach the same point of the state space at the same time. Its Bridge Doeblin subgraph only contains the paths starting from a tagged point of the...
View

Network