Related papers: Self-Avoiding Walk on Fractal Complex Networks: Ex…
When circuits are set up and dismantled dynamically in elastic optical networks, spectrum tends to become fragmented in the fiber links. The fragmentation limits the available path choices and may lead to significant blocking of connection…
In these Notes, a comprehensive description of the universal fractal geometry of conformally-invariant scaling curves or interfaces, in the plane or half-plane, is given. The present approach focuses on deriving critical exponents…
In cellular vortical flows, namely arrays of counter-rotating vortices, short but flexible filaments can show simple random walks through their stretch-coil interactions with flow stagnation points. Here, we study the dynamics of semi-rigid…
Simple time-reversible systems can generate {\it irreversible} flows satisfying the Second Law of Thermodynamics. Maps, and equivalent random walks, can also do this. We study a pair of time-reversible Baker Maps, $N2$ and $N3$, which…
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…
Stretched exponential relaxation ($\exp{-(t/\tau)}^{\beta_K}$) is observed in a large variety of systems but has not been explained so far. Studying random walks on percolation clusters in curved spaces whose dimensions range from 2 to 7,…
We prove $|x|^{-2}$ decay of the critical two-point function for the continuous-time weakly self-avoiding walk on $\mathbb{Z}^d$, in the upper critical dimension $d=4$. This is a statement that the critical exponent $\eta$ exists and is…
Consider $N$ points randomly distributed along a line segment of unitary length. A walker explores this disordered medium moving according to a partially self-avoiding deterministic walk. The walker, with memory $\mu$, leaves from the…
The self-avoiding walk, and lattice spin systems such as the $\varphi^4$ model, are models of interest both in mathematics and in physics. Many of their important mathematical problems remain unsolved, particularly those involving critical…
We reduce the problem of counting self-avoiding walks in the square lattice to a problem of counting the number of integral points in multidimensional domains. We obtain an asymptotic estimate of the number of self-avoiding walks of length…
We study independent long-range percolation on $\mathbb{Z}^d$ where the vertices $u$ and $v$ are connected with probability asymptotic to $\frac{\beta}{\|u-v\|^{2d}}$ for $\|u-v\|_\infty\geq 2$ and with probability 1 for $\|u-v\|_\infty=1$,…
We present an exact solution of percolation in a generalized class of Watts-Strogatz graphs defined on a 1-dimensional underlying lattice. We find a non-classical critical point in the limit of the number of long-range bonds in the system…
How does removal of sites by a random walk lead to blockage of percolation? To study this problem of correlated site percolation, we consider a random walk (RW) of $N=uL^d$ steps on a $d$-dimensional hypercubic lattice of size $L^d$ (with…
In this paper, we study the problem of pathfinding on traversal-dependent graphs, i.e., graphs whose edges change depending on the previously visited vertices. In particular, we study \emph{self-deleting graphs}, introduced by Carmesin et…
Building upon [1], this study aims to introduce fractal geometry into graph theory, and to establish a potential theoretical foundation for complex networks. Specifically, we employ the method of substitution to create and explore…
We have obtained the exact expression of the diffusion propagator in the time-dependent anharmonic potential $V(x,t)={1/2}a(t)x^2+b\ln x$. The underlying Euclidean metric of the problem allows us to obtain analytical solutions for a whole…
The task of representing entire graphs has seen a surge of prominent results, mainly due to learning convolutional neural networks (CNNs) on graph-structured data. While CNNs demonstrate state-of-the-art performance in graph classification…
We apply a semi-classical method to compute the conformal field theory (CFT) data for the U(N)xU(N) non-abelian Higgs theory in four minus epsilon dimensions at its complex fixed point. The theory features more than one coupling and walking…
Complex networks from such different fields as biology, technology or sociology share similar organization principles. The possibility of a unique growth mechanism promises to uncover universal origins of collective behaviour. In…
We study the random walk problem on a class of deterministic Scale-Free networks displaying a degree sequence for hubs scaling as a power law with an exponent $\gamma=\log 3/\log2$. We find exact results concerning different first-passage…