Zobrazeno 1 - 10
of 328
pro vyhledávání: '"Šileikis A"'
We consider maximum rooted tree extension counts in random graphs, i.e., we consider M_n = \max_v X_v where X_v counts the number of copies of a given tree in G_{n,p} rooted at vertex v. We determine the asymptotics of M_n when the random graph is no
Externí odkaz:
http://arxiv.org/abs/2310.11661
Publikováno v:
Open Medicine, Vol 9, Iss 3, Pp 424-430 (2014)
Externí odkaz:
https://doaj.org/article/263c97f562434b4e82b0eb4de9d2421a
Publikováno v:
Open Medicine, Vol 6, Iss 2, Pp 152-157 (2011)
Externí odkaz:
https://doaj.org/article/f32a86b0f37a47bcb835304eef0b5297
Publikováno v:
Random Structures & Algorithms, volume 64 (2024), issue 3, pages 692-740
Flip processes, introduced in [Garbe, Hladk\'y, \v{S}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 $\mathcal{R}:\mathcal{H}_k\rightarrow \m
Externí odkaz:
http://arxiv.org/abs/2206.03884
Publikováno v:
Annales de l'Institut Henri Poincar\'e, Probabilit\'es et Statistiques 60(4), pages 2878-2922 (November 2024)
We introduce a class of random graph processes, which we call \emph{flip processes}. Each such process is given by a \emph{rule} which is a function $\mathcal{R}:\mathcal{H}_k\rightarrow \mathcal{H}_k$ from all labelled $k$-vertex graphs into itself
Externí odkaz:
http://arxiv.org/abs/2201.12272
Let $V_n$ be a set of $n$ points in the plane and let $x \notin V_n$. An $x$-loop is a continuous closed curve not containing any point of $V_n$. We say that two $x$-loops are non-homotopic if they cannot be transformed continuously into each other w
Externí odkaz:
http://arxiv.org/abs/2108.13953
Let $G(n,n,m)$ be a uniformly random $m$-edge subgraph of the complete bipartite graph $K_{n,n}$ with bipartition $(V_1, V_2)$, where $n_i = |V_i|$. Given a real number $p \in [0,1]$ such that $d_1 := pn_2$ and $d_2 := pn_1$ are integers, let $R(n,n,
Externí odkaz:
http://arxiv.org/abs/2010.15751
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Šileikis, Matas, Warnke, Lutz
Publikováno v:
Random Structures and Algorithms 61 (2022) 3-30
We consider rooted subgraphs in random graphs, i.e., extension counts such as (i) the number of triangles containing a given vertex or (ii) the number of paths of length three connecting two given vertices. In 1989, Spencer gave sufficient conditions
Externí odkaz:
http://arxiv.org/abs/1911.03012
Publikováno v:
J. Graph Theory 97 (2021), no. 4, 578-599
The theory of graphons comes with a natural sampling procedure, which results in an inhomogeneous variant of the Erd\H{o}s--R\'enyi random graph, called $W$-random graphs. We prove, via the method of moments, a limit theorem for the number of $r$-cli
Externí odkaz:
http://arxiv.org/abs/1903.10570