Related papers: Asymptotic Shape of Subadditive Processes on Group…
We develop a new method for studying the asymptotics of symmetric polynomials of representation-theoretic origin as the number of variables tends to infinity. Several applications of our method are presented: We prove a number of theorems…
Random graph models with limited choice have been studied extensively with the goal of understanding the mechanism of the emergence of the giant component. One of the standard models are the Achlioptas random graph processes on a fixed set…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
In a growth-fragmentation system, cells grow in size slowly and split apart at random. Typically, the number of cells in the system grows exponentially and the distribution of the sizes of cells settles into an equilibrium 'asymptotic…
This paper investigates asymptotic properties of multifractal products of random fields. The obtained limit theorems provide sufficient conditions for the convergence of cumulative fields in the spaces $L_q.$ New results on the rate of…
The asymptotic shape of randomly growing radial clusters is studied. We pose the problem in terms of the dynamics of stochastic partial differential equations. We concentrate on the properties of the realizations of the stochastic growth…
The asymptotic spectrum of graphs, introduced by Zuiddam (arXiv:1807.00169, 2018), is the space of graph parameters that are additive under disjoint union, multiplicative under the strong product, normalized and monotone under homomorphisms…
In this article we study asymptotic properties of certain discrete groups $\Gamma$ acting by isometries on a product $\XX=\XX_1\times \XX_2$ of locally compact Hadamard spaces. The motivation comes from the fact that Kac-Moody groups over…
Let $G$ be a directed graph on finitely many vertices and edges, and assign a positive weight to each edge on $G$. Fix vertices $u$ and $v$ and consider the set of paths that start at $u$ and end at $v$, self-intersecting in any number of…
In this thesis, we investigate the asymptotics of random partitions chosen according to probability measures coming from the representation theory of the symmetric groups $S_n$ and of the finite Chevalley groups $GL(n,F_q)$ and…
We consider two independent Erd\H{o}s-R\'enyi random graphs, with possibly different parameters, and study two isomorphism problems, a graph embedding problem and a common subgraph problem. Under certain conditions on the graph parameters…
Let $(X,d,f)$ be a dynamical system, where $(X,d)$ is a compact metric space and $f:X\rightarrow X$ is a continuous map. Using the concepts of \textit{g-almost product property} and \textit{uniform separation property} introduced by Pfister…
Extreme value theory offers a statistical framework for quantifying the risk of rare events, with the generalized Pareto (GP) distribution providing the canonical limit model for univariate threshold exceedances. In many applications,…
We develop a battery of tools for studying quasi-isometric rigidity and classification problems for splittings of groups. The techniques work best for finite graphs of groups where all edge and vertex groups are coarse PD groups. For…
In this note, we study non-transitive graphs and prove a number of results when they satisfy a coarse version of transitivity. Also, for each finitely generated group $G$, we produce continuum many pairwise non-quasi-isometric regular…
This PhD thesis aims at combining the framework of noncommutative geometry and supersymmetry. A particular class of non-commutative geometries called almost-commutative geometries can be used to describe particle theories. This thesis…
In this monograph, we prove an asymptotic approximation for integrals of probability densities over sets in finite dimensional euclidean space, which are far away from the origin (asymptotic sets). We use this approximation to investigate…
We are interested in evolution phenomena on star-like networks composed of several branches which vary considerably in physical properties. The initial boundary value problem for singularly perturbed hyperbolic differential equation on a…
The algebraic approach to the Constraint Satisfaction Problem (CSP) uses high order symmetries of relational structures -- polymorphisms -- to study the complexity of the CSP. In this paper we further develop one of the methods the…
We calculate full asymptotic expansions of prime-independent multiplicative functions on additive arithmetic semigroups that satisfy a strong form of Knopfmacher's axioms. When applied to the semigroup of unlabeled graphs, our method yields…