Prominent examples of flip processes
The result's identifiers
Result code in 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>
Result on the web
<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>
Alternative languages
Result language
angličtina
Original language name
Prominent examples of flip processes
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2024
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Random Structures and Algorithms
ISSN
1042-9832
e-ISSN
1098-2418
Volume of the periodical
64
Issue of the periodical within the volume
3
Country of publishing house
US - UNITED STATES
Number of pages
49
Pages from-to
692-740
UT code for WoS article
001098087600001
EID of the result in the Scopus database
2-s2.0-85176098025