Related papers: Random infinite ideal angled graphs and ideal hype…
We generalize the asymptotic behavior of the graph distance between two uniformly chosen nodes in the configuration model to a wide class of random graphs. Among others, this class contains the Poissonian random graph, the expected degree…
Consider a complete intersection I of type (d_1,..., d_r) in a polynomial ring over a field of characteristic 0. We study the graded system of ideals {gin(I^n)}_n obtained by taking the reverse lexicographic generic initial ideals of the…
A simple symmetric random walk in the space $\mathbb{Z}^2$ is considered. The asymptotic behavior as the number of jumps tends to infinity of the probability that a fixed edge of the random walk lies in the polygon that forms the boundary…
We give a one-to-one correspondence between ideals in the Steinberg algebra of a Hausdorff ample groupoid $G$, and certain families of ideals in the group algebras of isotropy groups in $G$. This generalises a known ideal correspondence…
In this paper, we prove the conjectures of Gharakhloo and Welker (2023) that the positive matching decomposition number (pmd) of a $3$-uniform hypergraph is bounded from above by a polynomial of degree $2$ in terms of the number of…
The hyperbolic random graph model (HRG) has proven useful in the analysis of scale-free networks, which are ubiquitous in many fields, from social network analysis to biology. However, working with this model is algorithmically and…
The Rado graph, also known as the random graph $G(\infty, p)$, is a classical limit object for finite graphs. We study natural ball walks as a way of understanding the geometry of this graph. For the walk started at $i$, we show that order…
We consider a natural model of inhomogeneous random graphs that extends the classical Erd\H os-R\'enyi graphs and shares a close connection with the multiplicative coalescence, as pointed out by Aldous [AOP 1997]. In this model, the…
The hyperbolic random graph model (HRG) has proven useful in the analysis of scale-free networks, which are ubiquitous in many fields, from social network analysis to biology. However, working with this model is algorithmically and…
This paper consists of two halves. In the first half of the paper, we consider real-valued functions $f$ whose domain is the vertex set of a graph $G$ and that are Lipschitz with respect to the graph distance. By placing a uniform…
The Densest Subgraph Problem (DSP) is widely used to identify community structures and patterns in networks such as bioinformatics and social networks. While solvable in polynomial time, traditional exact algorithms face computational and…
A graph is Hamiltonian if it contains a cycle passing through every vertex. One of the cornerstone results in the theory of random graphs asserts that for edge probability $p \gg \frac{\log n}{n}$, the random graph $G(n,p)$ is…
We consider a recurrent random walk (RW) in random environment (RE) on a strip. We prove that if the RE is i. i. d. and its distribution is not supported by an algebraic subsurface in the space of parameters defining the RE then the RW…
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…
Using perfectoid algebras, we introduce a mixed characteristic analog of the multiplier ideal, respectively test ideal, from characteristic zero, respectively $p > 0$, in the case of a regular ambient ring. We prove several properties about…
Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…
Let X be an algebraic toric set in a projective space over a finite field. We study the vanishing ideal, I(X), of X and show some useful degree bounds for a minimal set of generators of I(X). We give an explicit description of a set of…
Motivated by Gromov's geodesic flow problem on hyperbolic groups $G$, we develop in this paper an analog using random walks. This leads to a notion of a harmonic analog $\Theta$ of the Bowen-Margulis-Sullivan measure on $\partial^2 G$. We…
Real-world networks, like social networks or the internet infrastructure, have structural properties such as large clustering coefficients that can best be described in terms of an underlying geometry. This is why the focus of the…
This paper considers asymptotically hyperbolic manifolds with a finite boundary intersecting the usual infinite boundary -- cornered asymptotically hyperbolic manifolds -- and proves a theorem of Cartan-Hadamard type near infinity for the…