Related papers: Self-similarity and random walks
In recent work of the authors the notion of a derivation being approximately semi-inner arose as a tool for investigating (approximate) amenability questions for Banach algebras. Here we investigate this property in its own right, together…
For any finitely generated group G, let n ---> \Phi_G(n) be the function that describes the rough asymptotic behavior of the probability of return to the identity element at time 2n of a symmetric simple random walk on G (this is an…
Recently, several papers have been devoted to the analysis of lamplighter random walks, in particular when the underlying graph is the infinite path $\mathbb{Z}$. In the present paper, we develop a spectral analysis for lamplighter random…
We achieve the multifractal analysis of a class of complex valued statistically self-similar continuous functions. For we use multifractal formalisms associated with pointwise oscillation exponents of all orders. Our study exhibits new…
The theory of complex trees is introduced as a new approach to study a broad class of self-similar sets. Systems of equations encoded by complex trees tip-to-tip equivalence relations are used to obtain one-parameter families of connected…
It is shown explicitly how self-similar graphs can be obtained as `blow-up' constructions of finite cell graphs $\hat C$. This yields a larger family of graphs than the graphs obtained by discretising continuous self-similar fractals. For a…
We use the random self-similarity of the continuum random tree to show that it is homeomorphic to a post-critically finite self-similar fractal equipped with a random self-similar metric. As an application we determine the mean and…
The goal is to extend a non-standard amenability test for groups, based on random walks and superharmonic functions, to group actions on sets, and to apply it to Thompson's group F using certain properties of extensive amenability. While no…
Continuing from a companion article: 'Random walks and contracting elements I: Deviation inequality and limit laws', we study random walks on metric spaces with contracting elements. We prove that random subgroups of the isometry group of a…
Random walks find applications in many areas of science and are the heart of essential network analytic tools. When defined on temporal networks, even basic random walk models may exhibit a rich spectrum of behaviours, due to the…
In this short note we give various near optimal characterizations of random walks over finite Abelian groups with large maximum discrepancy from the uniform measure. We also provide several interesting connections to existing results in the…
The trace anomaly for a conformally invariant scalar field theory on a curved manifold of positive constant curvature with boundary is considered. In the context of a perturbative evaluation of the theory's effective action explicit…
We study the cut-off phenomenon for random walks on free unitary quantum groups coming from quantum conjugacy classes of classical reflections. We obtain in particular a quantum analogue of the result of U. Porod concerning certain mixtures…
This essay is presented with two principal objectives in mind: first, to document the prevalence of fractals at all levels of the nervous system, giving credence to the notion of their functional relevance; and second, to draw attention to…
In this paper analogies between different (dis)similarity matrices are derived. These matrices, which are connected to path enumeration and random walks, are used in community detection methods or in computation of centrality measures for…
We study using large deviation theory the fluctuations of time-integrated functionals or observables of the unbiased random walk evolving on Erd\"os-R\'enyi random graphs, and construct a modified, biased random walk that explains how these…
We study the self-similar structure of electromagnetic showers and introduce the notion of the fractal dimension of a shower. Studies underway of showers in various materials and at various energies are presented, and the range over which…
This paper works out the rate of convergence of two "natural" random walks on the dicyclic group.
We show that fractality in complex networks arises from the geometric self-similarity of their built-in hierarchical community-like structure, which is mathematically described by the scale-invariant equation for the masses of the boxes…
I start by reviewing some basic properties of random graphs. I then consider the role of random walks in complex networks and show how they may be used to explain why so many long tailed distributions are found in real data sets. The key…