相关论文: A Random Necklace Model

Via operator theoretic methods, we formalize the concentration phenomenon for a given observable `$r$' of a discrete time Markov chain with `$\mu_{\pi}$' as invariant ergodic measure, possibly having support on an unbounded state space. The…

We develop random graph models where graphs are generated by connecting not only pairs of vertices by edges but also larger subsets of vertices by copies of small atomic subgraphs of arbitrary topology. This allows the for the generation of…

The distribution of shortest path lengths (DSPL) of random networks provides useful information on their large scale structure. In the special case of random regular graphs (RRGs), which consist of $N$ nodes of degree $c \ge 3$, the DSPL,…

Here, we focus on Anderson type operators over infinite graphs where the randomness acts through higher rank perturbations. We show that for special family of graphs, the operator has non-trivial multiplicity for its pure point spectrum.…

Many real-world networks of interest are embedded in physical space. We present a new random graph model aiming to reflect the interplay between the geometries of the graph and of the underlying space. The model favors configurations with…

In this thesis, which is supervised by Dr. David Penman, we examine random interval graphs. Recall that such a graph is defined by letting $X_{1},\ldots X_{n},Y_{1},\ldots Y_{n}$ be $2n$ independent random variables, with uniform…

We study the random loop model with crosses and bars on sparse random graphs. Our main objective is to prove the existence of macroscopic loops, in the sense that a loop visits a positive proportion of the vertices. We develop a…

We define a growing model of random graphs. Given a sequence of nonnegative integers $\{d_n\}_{n=0}^\infty$ with the property that $d_i\leq i$, we construct a random graph on countably infinitely many vertices $v_0,v_1\ldots$ by the…

Given a countable set of sites and a collection of flip rates at each site, we give a sufficient condition on the long-range dependancies of the flip rates ensuring the well-definedness of the corresponding spin system. This hypothesis has…

Consider a random three-coordinate lattice of spherical topology having 2v vertices and being densely covered by a single closed, self-avoiding walk, i.e. being equipped with a Hamiltonian cycle. We determine the number of such objects as a…

We solve exactly the 6-vertex model on a dynamical random lattice, using its representation as a large N matrix model. The model describes a gas of dense nonintersecting oriented loops coupled to the local curvature defects on the lattice.…

The term interlacing refers to systematic inequalities between the sequences of eigenvalues of two operators defined on objects related by a specific oper- ation. In particular, knowledge of the spectrum of one of the objects then implies…

We consider the universality for the trace invariants of $c_1 N \times \cdots \times c_D N$ tensors with i.i.d. complex random elements. In the case $c_1 = \cdots = c_D$, Gurau derived the universality in the limit $N \to \infty$ by…

Consider directed polymers in a random environment on the complete graph of size $N$. This model can be formulated as a product of i.i.d. $N\times N$ random matrices and its large time asymptotics is captured by Lyapunov exponents and the…

We introduce a new class of countably infinite random geometric graphs, whose vertices are points in a metric space, and vertices are adjacent independently with probability p if the metric distance between the vertices is below a given…

We introduce a non-backtracking Laplace operator for graphs and we investigate its spectral properties. With the use of both theoretical and computational techniques, we show that the spectrum of this operator captures several structural…

We consider a ring of identical or near identical coupled periodic oscillators in which the connections have randomly heterogeneous strength. We use the master stability function method to determine the possible patterns at the…

We introduce a new kind of symbol in the framework of It\^o processes which are bounded on one side. The connection between this symbol and the infinitesimal generator is analyzed. Based on this concept, an integral criterion for invariant…

We consider linear and obstacle problems driven by a nonlocal integral operator, for which nonlocal interactions are restricted to a ball of finite radius. These type of operators are used to model anomalous diffusion and, for a special…

We consider the Dyson hierarchical graph $\mathcal{G}$, that is a weighted fully-connected graph, where the pattern of weights is ruled by the parameter $\sigma \in (1/2, 1]$. Exploiting the deterministic recursivity through which…