Related papers: Random simplicial complexes - around the phase tra…
We introduce several notions of `random fewnomials', i.e. random polynomials with a fixed number f of monomials of degree N. The f exponents are chosen at random and then the coefficients are chosen to be Gaussian random, mainly from the…
In this work, we show how number theoretical problems can be fruitfully approached with the tools of statistical physics. We focus on g-Sidon sets, which describe sequences of integers whose pairwise sums are different, and propose a random…
We investigate the random dynamics of rational maps on the Riemann sphere and the dynamics of semigroups of rational maps on the Riemann sphere. We show that regarding random complex dynamics of polynomials, in most cases, the chaos of the…
One-dimensional problem for quantum harmonic oscillator with "regular+random" frequency subjected to the external "regular+random" force is considered. Averaged transition probabilities are found.
We study a system of simple random walks on graphs, known as frog model. This model can be described as follows: There are active and sleeping particles living on some graph G. Each active particle performs a simple random walk with…
A soft random graph $G(n,r,p)$ can be obtained from the random geometric graph $G(n,r)$ by keeping every edge in $G(n,r)$ with probability $p$. The soft random simplicial complexes is a model for random simplicial complexes built over the…
In this letter we study the NP-complete vertex cover problem on finite connectivity random graphs. When the allowed size of the cover set is decreased, a discontinuous transition in solvability and typical-case complexity occurs. This…
We deduce the appearance of a polymeric phase in 4-dimensional simplicial quantum gravity by varying the values of the coupling constants and discuss the geometric structure of the phase in terms of ergodic moves. A similar result is true…
We study the phase transition in generalized chiral or Stiefel's models using Monte Carlo simulations. These models are characterized by a breakdown of symmetry O(N)/O(N-P). We show that the phase transition is clearly first order for N >=…
We consider the multiparameter random simplicial complex on a vertex set $\{ 1,\dots,n \}$, which is parameterized by multiple connectivity probabilities. Our key results concern the topology of this complex of dimensions higher than the…
For random graphs, the containment problem considers the probability that a binomial random graph $G(n,p)$ contains a given graph as a substructure. When asking for the graph as a topological minor, i.e., for a copy of a subdivision of the…
This is in the sequel of authors' paper \cite{LPW} in which we had set up a program to verify rigorously some formal statements associated with the multiple component phase transitions with higher dimensional wells. The main goal here is to…
This paper makes some preliminary observations towards an extension of current work on graphs defined on groups to simplicial complexes. I define a variety of simplicial complexes on a group which are preserved by automorphisms of the…
The goal of this paper is to establish the fundamental tools to analyze signals defined over a topological space, i.e. a set of points along with a set of neighborhood relations. This setup does not require the definition of a metric and…
The involution walk is the random walk on $S_n$ generated by involutions with a binomially distributed with parameter $1-p$ number of $2$-cycles. This is a parallelization of the transposition walk. The involution walk is shown in this…
Phase Transition is associated with a drastic change in some observable (ordered parameter) of the system when the controlled parameter is tuned smoothly. Lee-Yang theory of phase transition is discussed which is related to the accumulation…
Many problems of interest in computer science and information theory can be phrased in terms of a probability distribution over discrete variables associated to the vertices of a large (but finite) sparse graph. In recent years,…
Let $L$ be a simplicial complex. In this paper, we study random sub-hypergraphs and random sub-complexes of $L$. By considering the minimal complex that a sub-hypergraph can be embedded in and the maximal complex that can be embedded in a…
Some of the recent developments in the theory of random surfaces and simplicial quantum gravity is reviewed. For 2d quantum gravity this includes the failure of Regge calculus, our improved understanding of the $c>1$ regime, some surprises…
In part I (math.PR/0406392) we proved for an arbitrary one-dimensional random walk with independent increments that the probability of crossing a level at a given time n is of the maximal order square root of n. In higher dimensions we call…