A unimodular random graph with large upper growth and no growth
Fuente:
arXiv
Saved in:
| Main Authors: | Mester, Péter, Timár, Ádám |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Finitely dependent random colorings of bounded degree graphs
by: Timár, Ádám
Published: (2024)
by: Timár, Ádám
Published: (2024)
Unimodular random one-ended planar graphs are sofic
by: Timar, Adam
Published: (2019)
by: Timar, Adam
Published: (2019)
A full characterization of invariant embeddability of unimodular planar graphs
by: Timár, Ádám, et al.
Published: (2021)
by: Timár, Ádám, et al.
Published: (2021)
A factor matching of optimal tail between Poisson processes
by: Timar, Adam
Published: (2021)
by: Timar, Adam
Published: (2021)
Factor of iid's through stochastic domination
by: Timár, Ádám
Published: (2023)
by: Timár, Ádám
Published: (2023)
On invariant generating sets for the cycle space
by: Timár, Ádám
Published: (2023)
by: Timár, Ádám
Published: (2023)
Parabolic-hyperbolic dichotomy through half-plane coexistence
by: Timár, Ádám
Published: (2026)
by: Timár, Ádám
Published: (2026)
Spectral non-concentration near the top for unimodular random graphs
by: Fraczyk, Mikolaj, et al.
Published: (2024)
by: Fraczyk, Mikolaj, et al.
Published: (2024)
A Unimodular Random Graph With Large Upper Growth and No Growth
by: Péter Mester, et al.
Published: (2026)
by: Péter Mester, et al.
Published: (2026)
Invariant splitting of a slab into infinitely many robust clusters
by: Mester, Péter
Published: (2024)
by: Mester, Péter
Published: (2024)
Optimal factor matchings for point processes on non-amenable unimodular graphs
by: Spinka, Yinon, et al.
Published: (2026)
by: Spinka, Yinon, et al.
Published: (2026)
Uniform Borel Amenability
by: Elek, Gábor, et al.
Published: (2024)
by: Elek, Gábor, et al.
Published: (2024)
A large hole in pseudo-random graphs
by: Diskin, Sahar, et al.
Published: (2025)
by: Diskin, Sahar, et al.
Published: (2025)
Stability of large cuts in random graphs
by: Hoshen, Ilay, et al.
Published: (2024)
by: Hoshen, Ilay, et al.
Published: (2024)
Chemical distance in graphs of polynomial growth
by: Gorski, Christian, et al.
Published: (2025)
by: Gorski, Christian, et al.
Published: (2025)
Indistinguishability for recurrent clusters
by: Alami, Damis El, et al.
Published: (2025)
by: Alami, Damis El, et al.
Published: (2025)
Exponential growth of random infinite Fibonacci sequences
by: Goldsheid, Ilya, et al.
Published: (2025)
by: Goldsheid, Ilya, et al.
Published: (2025)
Connectedness of the Free Uniform Spanning Forest as a function of edge weights
by: Alexy, Marcell, et al.
Published: (2020)
by: Alexy, Marcell, et al.
Published: (2020)
Does freezing impede the growth of random recursive trees?
by: Brandenberger, Anna, et al.
Published: (2025)
by: Brandenberger, Anna, et al.
Published: (2025)
Examples of stable-like random walks on groups of polynomial growth
by: Saloff-Coste, Laurent, et al.
Published: (2025)
by: Saloff-Coste, Laurent, et al.
Published: (2025)
An asymptotic shape theorem for additive random linear growth models
by: Deshayes, Aurelia, et al.
Published: (2015)
by: Deshayes, Aurelia, et al.
Published: (2015)
Anticoncentration of random spanning trees in graphs with large minimum degree
by: Bitonti, Veronica, et al.
Published: (2026)
by: Bitonti, Veronica, et al.
Published: (2026)
Revisiting the temporal law in KPZ random growth
by: Rahman, Mustazee
Published: (2025)
by: Rahman, Mustazee
Published: (2025)
Quantitative indistinguishability and sparse and dense clusters in factor of IID percolations
by: Csóka, Endre, et al.
Published: (2025)
by: Csóka, Endre, et al.
Published: (2025)
The partial duplication random graph with edge deletion
by: Hermann, Felix, et al.
Published: (2019)
by: Hermann, Felix, et al.
Published: (2019)
A lower bound on the spectrum of unimodular networks
by: Rahman, Mustazee
Published: (2016)
by: Rahman, Mustazee
Published: (2016)
Weighted-amenability and percolation
by: Terlov, Grigory, et al.
Published: (2025)
by: Terlov, Grigory, et al.
Published: (2025)
Small entropy doubling for random walks and polynomial growth
by: Blachar, Guy
Published: (2026)
by: Blachar, Guy
Published: (2026)
The critical percolation window in growing random graphs
by: Jorritsma, Joost, et al.
Published: (2025)
by: Jorritsma, Joost, et al.
Published: (2025)
Large-scale behavior of the partial duplication random graph
by: Hermann, Felix, et al.
Published: (2014)
by: Hermann, Felix, et al.
Published: (2014)
The fewest-big-jumps principle and an application to random graphs
by: Kerriou, Céline, et al.
Published: (2022)
by: Kerriou, Céline, et al.
Published: (2022)
Density of growth rates of subgroups of a free group -- an alternative proof
by: Timár, Ádám
Published: (2026)
by: Timár, Ádám
Published: (2026)
Spread-out percolation on transitive graphs of polynomial growth
by: Spanos, Panagiotis, et al.
Published: (2024)
by: Spanos, Panagiotis, et al.
Published: (2024)
Physical networks as network-of-networks
by: Pete, Gábor, et al.
Published: (2023)
by: Pete, Gábor, et al.
Published: (2023)
Percolation on random graphs
by: van der Hofstad, Remco
Published: (2025)
by: van der Hofstad, Remco
Published: (2025)
A random walk among random graphs
by: Curien, Nicolas
Published: (2024)
by: Curien, Nicolas
Published: (2024)
Incipient infinite clusters and volume growth for Gaussian free fields and loop soups on metric graphs
by: Cai, Zhenhao, et al.
Published: (2024)
by: Cai, Zhenhao, et al.
Published: (2024)
The real-time growth rate of stochastic epidemics on random intersection graphs
by: Fransson, Carolina
Published: (2022)
by: Fransson, Carolina
Published: (2022)
Borel Local Lemma: arbitrary random variables and limited exponential growth
by: Bernshteyn, Anton, et al.
Published: (2024)
by: Bernshteyn, Anton, et al.
Published: (2024)
On random matrices with large corank
by: Hunter, Zach, et al.
Published: (2025)
by: Hunter, Zach, et al.
Published: (2025)
Similar Items
-
Finitely dependent random colorings of bounded degree graphs
by: Timár, Ádám
Published: (2024) -
Unimodular random one-ended planar graphs are sofic
by: Timar, Adam
Published: (2019) -
A full characterization of invariant embeddability of unimodular planar graphs
by: Timár, Ádám, et al.
Published: (2021) -
A factor matching of optimal tail between Poisson processes
by: Timar, Adam
Published: (2021) -
Factor of iid's through stochastic domination
by: Timár, Ádám
Published: (2023)