Cluster analysis of local convergent sequences of structures

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F17%3A10369540" target="_blank" >RIV/00216208:11320/17:10369540 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1002/rsa.20719" target="_blank" >http://dx.doi.org/10.1002/rsa.20719</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1002/rsa.20719" target="_blank" >10.1002/rsa.20719</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Cluster analysis of local convergent sequences of structures

Popis výsledku v původním jazyce

The cluster analysis of very large objects is an important problem, which spans several theoretical as well as applied branches of mathematics and computer science. Here we suggest a novel approach: under assumption of local convergence of a sequence of finite structures we derive an asymptotic clustering. This is achieved by a blend of analytic and geometric techniques, and particularly by a new interpretation of the authors&apos; representation theorem for limits of local convergent sequences, which serves as a guidance for the whole process. Our study may be seen as an effort to describe connectivity structure at the limit (without having a defined explicit limit structure) and to pull this connectivity structure back to the finite structures in the sequence in a continuous way. (c) 2017 Wiley Periodicals, Inc. Random Struct. Alg., 51, 674-728, 2017

Název v anglickém jazyce

Cluster analysis of local convergent sequences of structures

Popis výsledku anglicky

The cluster analysis of very large objects is an important problem, which spans several theoretical as well as applied branches of mathematics and computer science. Here we suggest a novel approach: under assumption of local convergence of a sequence of finite structures we derive an asymptotic clustering. This is achieved by a blend of analytic and geometric techniques, and particularly by a new interpretation of the authors&apos; representation theorem for limits of local convergent sequences, which serves as a guidance for the whole process. Our study may be seen as an effort to describe connectivity structure at the limit (without having a defined explicit limit structure) and to pull this connectivity structure back to the finite structures in the sequence in a continuous way. (c) 2017 Wiley Periodicals, Inc. Random Struct. Alg., 51, 674-728, 2017

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2017

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Random Structures and Algorithms

ISSN

1042-9832

e-ISSN

—

Svazek periodika

51

Číslo periodika v rámci svazku

4

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

55

Strana od-do

674-728

Kód UT WoS článku

000413405500005

EID výsledku v databázi Scopus

—