Prominent examples of flip processes

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F24%3A00579756" target="_blank" >RIV/67985807:_____/24:00579756 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1002/rsa.21192" target="_blank" >https://doi.org/10.1002/rsa.21192</a>

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Prominent examples of flip processes

Popis výsledku v původním jazyce

Flip processes, introduced in [Garbe, Hladký, Šileikis, Skerman: From flip processes to dynamical systems on graphons], are a class of random graph processes defined using a rule which is just a function R : H_k -> H_k from all labelled graphs of a fixed order k into itself. The process starts with an arbitrary given n-vertex graph G_0. In each step, the graph G_i is obtained by sampling k random vertices v_1, ... ,v_k of G_{i-1} and replacing the induced graph G_{i-1}[v_1, ... ,v_k] by R(G_{i-1}[v_1, ... ,v_k]). Using the formalism of dynamical systems on graphons associated to each such flip process from ibid. we study several specific flip processes, including the triangle removal flip process and its generalizations, 'extremist flip processes' (in which R(H) is either a clique or an independent set, depending on whether e(H) has less or more than half of all potential edges), and 'ignorant flip processes' in which the output R(H) does not depend on H.

Název v anglickém jazyce

Prominent examples of flip processes

Popis výsledku anglicky

Flip processes, introduced in [Garbe, Hladký, Šileikis, Skerman: From flip processes to dynamical systems on graphons], are a class of random graph processes defined using a rule which is just a function R : H_k -> H_k from all labelled graphs of a fixed order k into itself. The process starts with an arbitrary given n-vertex graph G_0. In each step, the graph G_i is obtained by sampling k random vertices v_1, ... ,v_k of G_{i-1} and replacing the induced graph G_{i-1}[v_1, ... ,v_k] by R(G_{i-1}[v_1, ... ,v_k]). Using the formalism of dynamical systems on graphons associated to each such flip process from ibid. we study several specific flip processes, including the triangle removal flip process and its generalizations, 'extremist flip processes' (in which R(H) is either a clique or an independent set, depending on whether e(H) has less or more than half of all potential edges), and 'ignorant flip processes' in which the output R(H) does not depend on H.

Druh

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

CEP obor

—

OECD FORD obor

10101 - Pure mathematics

Projekt

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

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2024

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

1098-2418

Svazek periodika

64

Číslo periodika v rámci svazku

3

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

49

Strana od-do

692-740

Kód UT WoS článku

001098087600001

EID výsledku v databázi Scopus

2-s2.0-85176098025