相关论文: A Random Necklace Model
For random piecewise linear systems T of the interval that are expanding on average we construct explicitly the density functions of absolutely continuous T-invariant measures. In case the random system uses only expanding maps our…
We survey recent results on spectral properties of random Schr\"odinger operators. The focus is set on the integrated density of states (IDS). First we present a proof of the existence of a self-averaging IDS which is general enough to be…
We study asymptotic percolation as $N\to \infty$ in an infinite random graph ${\cal G}_N$ embedded in the hierarchical group of order $N$, with connection probabilities depending on an ultrametric distance between vertices. ${\cal G}_N$ is…
We analyze complexity in spatial network ensembles through the lens of graph entropy. Mathematically, we model a spatial network as a soft random geometric graph, i.e., a graph with two sources of randomness, namely nodes located randomly…
It is known that a unitary matrix can be decomposed into a product of reflections, one for each dimension, and the Haar measure on the unitary group pushes forward to independent uniform measures on the reflections. We consider the sequence…
Random walks have been intensively studied on regular and complex networks, which are used to represent pairwise interactions. Nonetheless, recent works have demonstrated that many real-world processes are better captured by higher-order…
Random intersection graphs have received much interest and been used in diverse applications. They are naturally induced in modeling secure sensor networks under random key predistribution schemes, as well as in modeling the topologies of…
We analyze spectrum of Laplacian supported by a periodic honeycomb lattice with generally unequal edge lengths and a $\delta$ type coupling in the vertices. Such a quantum graph has nonempty point spectrum with compactly supported…
Random, uncorrelated displacements of particles on a lattice preserve the hyperuniformity of the original lattice, that is, normalized density fluctuations vanish in the limit of infinite wavelengths. In addition to a diffuse contribution,…
We develop a new approach to recurrence and the existence of non-constant harmonic functions on infinite weighted graphs. The approach is based on the capacity of subsets of metric boundaries with respect to intrinsic metrics. The main tool…
This paper concerns the long-term behaviour of a system of interacting random walks labeled by vertices of a finite graph. The model is reversible which allows to use the method of electric networks in the study. In addition, examples of…
We study a discrete Laplace operator $\Delta$ on percolation subgraphs of an infinite graph. The ball volume is assumed to grow at most polynomially. We are interested in the behavior of the integrated density of states near the lower…
Quantifying the complexity of large graphs requires measures that extend beyond predefined structural features and scale efficiently with graph size. This work adopts a generative perspective, modeling large networks as exchangeable graphs…
Several interesting approaches have been reported in the literature on complex networks, random walks, and hierarchy of graphs. While many of these works perform random walks on stable, fixed networks, in the present work we address the…
We continue the development of transfer operator techniques for expanding maps on a lattice coupled by general interaction functions. We obtain a spectral gap for an appropriately defined transfer operator, and, as corollaries, the…
We introduce a class of random graphs that we argue meets many of the desiderata one would demand of a model to serve as the foundation for a statistical analysis of real-world networks. The class of random graphs is defined by a…
Starting from a finitely ramified self-similar set $X$ we can construct an unbounded set $X_{<\infty>}$ by blowing-up the initial set $X$. We consider random blow-ups and prove elementary properties of the spectrum of the natural Laplace…
We obtain expected number of arrivals, absorption probabilities and expected time until absorption for an asymmetric discrete random walk on a graph in the presence of multiple function barriers. On each edge of the graph and in each vertex…
This paper focuses on asymptotic properties of random monomial ideals through a statistical viewpoint. It extends the study of redundancy in monomial ideals by analyzing the poset density of the LCM-lattice. We explore how this density…
In this paper, we construct scaling limits of some branching random walks in random environment whose off-spring distributions have infinite variance. The Laplace functional of the obtained random measure is given by a non-linear PAM, whose…