Fractal time random walk and subrecoil laser cooling considered as renewal processes with infinite mean waiting times

There exist important stochastic physical processes involving infinite mean waiting times. The mean divergence has dramatic consequences on the process dynamics. Fractal time random walks, a diffusion process, and subrecoil laser cooling, a concentration process, are two such processes that look qualitatively dissimilar. Yet, a unifying treatment of these two processes, which is the topic of this pedagogic paper, can be developed by combining renewal theory with the generalized central limit theorem. This approach enables to derive without technical difficulties the key physical properties and it emphasizes the role of the behaviour of sums with infinite means.Comment: 9 pages, 7 figures, to appear in the Proceedings of Cargese Summer School on "Chaotic dynamics and transport in classical and quantum systems

Ising Model Observables and Non-Backtracking Walks

This paper presents an alternative proof of the connection between the partition function of the Ising model on a finite graph $G$ and the set of non-backtracking walks on $G$. The techniques used also give formulas for spin-spin correlation functions in terms of non-backtracking walks. The main tools used are Viennot's theory of heaps of pieces and turning numbers on surfaces.Comment: 33 pages, 11 figures. Typos and errors corrected, exposition improved, results unchange

The boundary action of a sofic random subgroup of the free group

We prove that the boundary action of a sofic random subgroup of a finitely generated free group is conservative. This addresses a question asked by Grigorchuk, Kaimanovich, and Nagnibeda, who studied the boundary actions of individual subgroups of the free group. Following their work, we also investigate the cogrowth and various limit sets associated to sofic random subgroups. We make heavy use of the correspondence between subgroups and their Schreier graphs, and central to our approach is an investigation of the asymptotic density of a given set inside of large neighborhoods of the root of a sofic random Schreier graph.Comment: 21 pages, 2 figures, made minor corrections, to appear in Groups, Geometry, and Dynamic

Finite size effect of harmonic measure estimation in a DLA model: Variable size of probe particles

A finite size effect in the probing of the harmonic measure in simulation of diffusion-limited aggregation (DLA) growth is investigated. We introduce a variable size of probe particles, to estimate harmonic measure and extract the fractal dimension of DLA clusters taking two limits, of vanishingly small probe particle size and of infinitely large size of a DLA cluster. We generate 1000 DLA clusters consisting of 50 million particles each, using an off-lattice killing-free algorithm developed in the early work. The introduced method leads to unprecedented accuracy in the estimation of the fractal dimension. We discuss the variation of the probability distribution function with the size of probing particles

Exact Solution for the Time Evolution of Network Rewiring Models

We consider the rewiring of a bipartite graph using a mixture of random and preferential attachment. The full mean field equations for the degree distribution and its generating function are given. The exact solution of these equations for all finite parameter values at any time is found in terms of standard functions. It is demonstrated that these solutions are an excellent fit to numerical simulations of the model. We discuss the relationship between our model and several others in the literature including examples of Urn, Backgammon, and Balls-in-Boxes models, the Watts and Strogatz rewiring problem and some models of zero range processes. Our model is also equivalent to those used in various applications including cultural transmission, family name and gene frequencies, glasses, and wealth distributions. Finally some Voter models and an example of a Minority game also show features described by our model.Comment: This version contains a few footnotes not in published Phys.Rev.E versio

Solving multivariate polynomial systems and an invariant from commutative algebra

The complexity of computing the solutions of a system of multivariate polynomial equations by means of Gr\"obner bases computations is upper bounded by a function of the solving degree. In this paper, we discuss how to rigorously estimate the solving degree of a system, focusing on systems arising within public-key cryptography. In particular, we show that it is upper bounded by, and often equal to, the Castelnuovo Mumford regularity of the ideal generated by the homogenization of the equations of the system, or by the equations themselves in case they are homogeneous. We discuss the underlying commutative algebra and clarify under which assumptions the commonly used results hold. In particular, we discuss the assumption of being in generic coordinates (often required for bounds obtained following this type of approach) and prove that systems that contain the field equations or their fake Weil descent are in generic coordinates. We also compare the notion of solving degree with that of degree of regularity, which is commonly used in the literature. We complement the paper with some examples of bounds obtained following the strategy that we describe

Stopping time signatures for some algorithms in cryptography

We consider the normalized distribution of the overall running times of some cryptographic algorithms, and what information they reveal about the algorithms. Recent work of Deift, Menon, Olver, Pfrang, and Trogdon has shown that certain numerical algorithms applied to large random matrices exhibit a characteristic distribution of running times, which depends only on the algorithm but are independent of the choice of probability distributions for the matrices. Different algorithms often exhibit different running time distributions, and so the histograms for these running time distributions provide a time-signature for the algorithms, making it possible, in many cases, to distinguish one algorithm from another. In this paper we extend this analysis to cryptographic algorithms, and present examples of such algorithms with time-signatures that are indistinguishable, and others with time-signatures that are clearly distinct.Comment: 20 page

A low-memory parallel version of Matsuo, Chao and Tsujii's algorithm

International audienceWe present an algorithm based on the birthday paradox, which is a low-memory parallel counterpart to the algorithm of Matsuo, Chao and Tsujii. This algorithm computes the group order of the Jacobian of a genus 2 curve over a finite field for which the characteristic polynomial of the Frobenius endomorphism is known modulo some integer. The main tool is a 2-dimensional pseudo-random walk that allows to heuristically choose random elements in a 2-dimensional space. We analyze the expected running time based on heuristics that we validate by computer experiments. Compared with the original algorithm by Matsuo, Chao and Tsujii, we lose a factor of about 3 in running time, but the memory requirement drops from several GB to almost nothing. Our method is general and can be applied in other contexts to transform a baby-step giant-step approach into a low memory algorithm