Related papers: Extending P\'olya's random walker beyond probabili…
We study joint distributions of cycles and patterns in permutations written in standard cycle form. We explore both classical and generalised patterns of length 2 and 3. Many extensions of classical theory are achieved; bivariate generating…
Over the last two decades, network theory has shown to be a fruitful paradigm in understanding the organization and functioning of real-world complex systems. One technique helpful to this endeavor is identifying functionally influential…
We investigate the dynamics of random walks on weighted networks. Assuming that the edge's weight and the node's strength are used as local information by a random walker, we study two kinds of walks, weight-dependent walk and…
We revisit strong approximation theory from a new perspective, culminating in a proof of the Koml\'os-Major-Tusn\'ady embedding theorem for the simple random walk. The proof is almost entirely based on a series of soft arguments and easy…
In their seminal paper, Berman and Boucksom exploited ideas from complex geometry to analyze asymptotics of spaces of holomorphic sections of tensor powers of certain line bundles $L$ over compact, complex manifolds as the power grows. This…
We study growing networks in which each link carries a certain weight (randomly assigned at birth and fixed thereafter). The weight of a node is defined as the sum of the weights of the links attached to the node, and the network grows via…
Right multiplication operators $R_w: l_2G \rightarrow l_2G$, $w \in \C[G]$, are interpreted as random-walk operators on labelled graphs that are analogous to Cayley graphs. Applying a generalization of the graph convergence defined by R.…
The power of multiple testing procedures can be increased by using weighted p-values (Genovese, Roeder and Wasserman 2005). We derive the optimal weights and we show that the power is remarkably robust to misspecification of these weights.…
Consider d uniformly random permutation matrices on n labels. Consider the sum of these matrices along with their transposes. The total can be interpreted as the adjacency matrix of a random regular graph of degree 2d on n vertices. We…
We explain how complexity of rational points on projective varieties can be interpreted via the theories of Chow forms and Okounkov bodies. Precisely, we study discrete measures on filtered linear series and build on work of Boucksom and…
We consider a weighted random walk on the backbone of an oriented percolation cluster. We determine necessary conditions on the weights for Brownian scaling limits under the annealed and the quenched law. This model is a random walk in…
We study skew-orthogonal polynomials with respect to the weight function $\exp[-2V(x)]$, with $V(x)=\sum_{K=1}^{2d}(u_{K}/{K})x^{K}$, $u_{2d} > 0$, $d > 0$. A finite subsequence of such skew-orthogonal polynomials arising in the study of…
We study branching random walks in random i.i.d. environment in $\Z^d, d \geq 1$. For this model, the population size cannot decrease, and a natural definition of recurrence is introduced. We prove a dichotomy for recurrence/transience,…
The weight systems of finite-dimensional representations of complex, simple Lie algebras exhibit patterns beyond Weyl-group symmetry. These patterns occur because weight systems can be decomposed into lattice polytopes in a natural way.…
In this paper we introduce a novel Bayesian data augmentation approach for estimating the parameters of the generalised logistic regression model. We propose a P\'olya-Gamma sampler algorithm that allows us to sample from the exact…
We establish two theorems for assessing the accuracy in total variation of multivariate discrete normal approximation to the distribution of an integer valued random vector $W$. The first is for sums of random vectors whose dependence…
We give new proofs for the hardness amplification of efficiently samplable predicates and of weakly verifiable puzzles which generalize to new settings. More concretely, in the first part of the paper, we give a new proof of Yao's XOR-Lemma…
In this paper, we provide an $O(n \mathrm{polylog} n)$ bound on the expected complexity of the randomly weighted Voronoi diagram of a set of $n$ sites in the plane, where the sites can be either points, interior-disjoint convex sets, or…
We study random walk on complex networks with transition probabilities which depend on the current and previously visited nodes. By using an absorbing Markov chain we derive an exact expression for the mean first passage time between pairs…
Symmetric heavily tailed random walks on $Z^d, d\geq 1,$ are considered. Under appropriate regularity conditions on the tails of the jump distributions, global (i.e., uniform in $x,t, |x|+t\to\infty,$) asymptotic behavior of the transition…