*Phys Rev E ; 103(2-1): 022135, 2021 Feb.*

##### RESUMO

We compute exactly the mean perimeter and the mean area of the convex hull of a two-dimensional isotropic Brownian motion of duration t and diffusion constant D, in the presence of resetting to the origin at a constant rate r. We show that for any t, the mean perimeter is given by ãL(t)ã=2πsqrt[D/r]f_{1}(rt) and the mean area is given by ãA(t)ã=2πD/rf_{2}(rt) where the scaling functions f_{1}(z) and f_{2}(z) are computed explicitly. For large tâ«1/r, the mean perimeter grows extremely slowly as ãL(t)ãâln(rt) with time. Likewise, the mean area also grows slowly as ãA(t)ãâln^{2}(rt) for tâ«1/r. Our exact results indicate that the convex hull, in the presence of resetting, approaches a circular shape at late times due to the isotropy of the Brownian motion. Numerical simulations are in perfect agreement with our analytical predictions.

*Phys Rev E ; 103(1-1): 012130, 2021 Jan.*

##### RESUMO

We study a class of stochastic processes of the type d^{n}x/dt^{n}=v_{0}σ(t) where n>0 is a positive integer and σ(t)=±1 represents an active telegraphic noise that flips from one state to the other with a constant rate Î³. For n=1, it reduces to the standard run-and-tumble process for active particles in one dimension. This process can be analytically continued to any n>0, including noninteger values. We compute exactly the mean-squared displacement at time t for all n>0 and show that at late times while it grows as â¼t^{2n-1} for n>1/2, it approaches a constant for n<1/2. In the marginal case n=1/2, it grows very slowly with time as â¼lnt. Thus, the process undergoes a localization transition at n=1/2. We also show that the position distribution p_{n}(x,t) remains time-dependent even at late times for n≥1/2, but approaches a stationary time-independent form for n<1/2. The tails of the position distribution at late times exhibit a large deviation form, p_{n}(x,t)â¼exp[-Î³tΦ_{n}(x/x^{*}(t))], where x^{*}(t)=v_{0}t^{n}/Γ(n+1). We compute the rate function Φ_{n}(z) analytically for all n>0 and also numerically using importance sampling methods, finding excellent agreement between them. For three special values n=1, n=2, and n=1/2 we compute the exact cumulant-generating function of the position distribution at all times t.

*Phys Rev E ; 102(5-1): 052108, 2020 Nov.*

##### RESUMO

We study the stochastic block model, which is often used to model community structures and study community-detection algorithms. We consider the case of two blocks in regard to its largest connected component and largest biconnected component, respectively. We are especially interested in the distributions of their sizes including the tails down to probabilities smaller than 10^{-800}. For this purpose we use sophisticated Markov chain Monte Carlo simulations to sample graphs from the stochastic block model ensemble. We use these data to study the large-deviation rate function and conjecture that the large-deviation principle holds. Further we compare the distribution to the well-known Erdos-Rényi ensemble, where we notice subtle differences at and above the percolation threshold.

*Sci Rep ; 10(1): 13825, 2020 Aug 14.*

##### RESUMO

We study the dynamics of opinion formation in the situation where changing opinion involves a cost for the agents. To do so we couple the dynamics of a heterogeneous bounded confidence Hegselmann-Krause model with that of the resources that the agents invest on each opinion change. The outcomes of the dynamics are non-trivial and strongly depend on the different regions of the confidence parameter space. In particular, a second order phase transition, for which we determine the corresponding critical exponents, is found in the region where a re-entrant consensus phase is observed in the heterogeneous Hegselmann-Krause model. For regions where consensus always exist in the heterogeneous Hegselmann-Krause model, the introduction of cost does not lead to a phase transition but just to a continuous decrease of the size of the largest opinion cluster. Finally in the region where fragmentation is expected in the heterogeneous HK model, the introduction of a very small cost surprisingly increases the size of the largest opinion cluster.

*Phys Rev E ; 101(6-1): 062109, 2020 Jun.*

##### RESUMO

We study the entropy S of longest increasing subsequences (LISs), i.e., the logarithm of the number of distinct LISs. We consider two ensembles of sequences, namely, random permutations of integers and sequences drawn independent and identically distributed (i.i.d.) from a limited number of distinct integers. Using sophisticated algorithms, we are able to exactly count the number of LISs for each given sequence. Furthermore, we are not only measuring averages and variances for the considered ensembles of sequences, but we sample very large parts of the probability distribution p(S) with very high precision. Especially, we are able to observe the tails of extremely rare events which occur with probabilities smaller than 10^{-600}. We show that the distribution of the entropy of the LISs is approximately Gaussian with deviations in the far tails, which might vanish in the limit of long sequences. Further, we propose a large-deviation rate function which fits best to our observed data.

*Sci Rep ; 10(1): 8273, 2020 May 19.*

##### RESUMO

We perform a detailed study of the Hegselmann-Krause bounded confidence opinion dynamics model with heterogeneousconfidence Îµi drawn from uniform distributions in different intervals [Îµ1, Îµu]. The phase diagram reveals a highly complex andnon-monotonous behaviour, with a re-entrant consensus phase in the region where fragmentation into multiple distinct opinionsis expected for the homogeneous case. A careful exploration of the phase diagram, along with an extensive finite-size analysis,allows us to identify the mechanism leading to this counter-intuitive behaviour. This systematic study over system sizes whichgo well beyond those of previous works, is enabled by an efficient algorithm presented in this article.

*Phys Rev E ; 101(3-1): 032102, 2020 Mar.*

##### RESUMO

We numerically estimate the leading asymptotic behavior of the length L_{n} of the longest increasing subsequence of random walks with step increments following Student's t-distribution with parameters in the range 1/2≤ν≤5. We find that the expected value E(L_{n})â¼n^{Î¸}lnn, with Î¸ decreasing from Î¸(ν=1/2)≈0.70 to Î¸(ν≥5/2)≈0.50. For random walks with a distribution of step increments of finite variance (ν>2), this confirms previous observation of E(L_{n})â¼sqrt[n]lnn to leading order. We note that this asymptotic behavior (including the subleading term) resembles that of the largest part of random integer partitions under the uniform measure and that, curiously, both random variables seem to follow Gumbel statistics. We also provide more refined estimates for the asymptotic behavior of E(L_{n}) for random walks with step increments of finite variance.

*Phys Rev E ; 102(6-1): 062141, 2020 Dec.*

##### RESUMO

We study an agent-based model of animals marking their territory and evading adversarial territory in one dimension with respect to the distribution of the size of the resulting territories. In particular, we use sophisticated sampling methods to determine it over a large part of territory sizes, including atypically small and large configurations, which occur with probability of less than 10^{-30}. We find hints for the validity of a large deviation principle, the shape of the rate function for the right tail of the distribution, and insight into the structure of atypical realizations.

*Phys Rev E ; 100(3-1): 032135, 2019 Sep.*

##### RESUMO

We study the energy landscape of the traveling salesperson problem (TSP) using exact ground states and a novel linear programming approach to generate excited states with closely defined properties. We look at four different ensembles, notably the classic finite dimensional Euclidean TSP and the mean-field-like (1,2)-TSP, which has its origin directly in the mapping of the Hamiltonian circuit problem on the TSP. Our data supports previous conjectures that the Euclidean TSP does not show signatures of replica symmetry breaking neither in two nor in higher dimension. On the other hand the (1,2)-TSP exhibits some signature which does not exclude broken replica symmetry, making it a candidate for further studies in the future.

*Phys Rev E ; 99(4-1): 042104, 2019 Apr.*

##### RESUMO

We study numerically the length distribution of the longest increasing subsequence (LIS) for random permutations and one-dimensional random walks. Using sophisticated large-deviation algorithms, we are able to obtain very large parts of the distribution, especially also covering probabilities smaller than 10^{-1000}. This enables us to verify for the length of the LIS of random permutations the analytically known asymptotics of the rate function and even the whole Tracy-Widom distribution. We observe a rather fast convergence in the larger than typical part to this limiting distribution. For the length L of LIS of random walks no analytical results are known to us. We test a proposed scaling law and observe convergence of the tails into a collapse for increasing system size. Further, we obtain estimates for the leading-order behavior of the rate functions in both tails.

*PLoS One ; 14(4): e0215309, 2019.*

##### RESUMO

Here we study linear programming applied to the random K-SAT problem, a fundamental problem in computational complexity. The K-SAT problem is to decide whether a Boolean formula with N variables and structured as a conjunction of M clauses, each being a disjunction of K variables or their negations is satisfiable or not. The ensemble of random K-SAT attracted considerable interest from physicists because for a specific ratio αs = M/N it undergoes in the limit of large N a sharp phase transition from a satisfiable to an unsatisfiable phase. In this study we will concentrate on finding for linear programming algorithms "easy-hard" transitions between phases of different typical hardness of the problems on either side. Linear programming is widely applied to solve practical optimization problems, but has been only rarely considered in the physics community. This is a deficit, because those typically studied types of algorithms work in the space of feasible {0, 1}N configurations while linear programming operates outside the space of valid configurations hence gives a very different perspective on the typical-case hardness of a problem. Here, we demonstrate that the technique leads to one simple-to-understand transition for the well known 2-SAT problem. On the other hand we detect multiple transitions in 3-SAT and 4-SAT. We demonstrate that, in contrast to the previous work on vertex cover and therefore somewhat surprisingly, the hardness transitions are not driven by changes of any of various standard percolation or solution space properties of the problem instances. Thus, here a more complex yet undetected property must be related to the easy-hard transition.

##### Assuntos

Algoritmos , Modelos Teóricos , Transição de Fase , Programação Linear , Simulação por Computador*Phys Rev E ; 97(6-1): 062159, 2018 Jun.*

##### RESUMO

A global picture of a random particle movement is given by the convex hull of the visited points. We obtained numerically the probability distributions of the volume and surface of the convex hulls of a selection of three types of self-avoiding random walks, namely, the classical self-avoiding walk, the smart-kinetic self-avoiding walk, and the loop-erased random walk. To obtain a comprehensive description of the measured random quantities, we applied sophisticated large-deviation techniques, which allowed us to obtain the distributions over a large range of support down to probabilities far smaller than P=10^{-100}. We give an approximate closed form of the so-called large-deviation rate function Φ which generalizes above the upper critical dimension to the previously studied case of the standard random walk. Further, we show correlations between the two observables also in the limits of atypical large or small values.

*Sci Rep ; 7(1): 8040, 2017 Aug 14.*

##### RESUMO

We perform Monte Carlo simulations to determine the critical temperatures of Ising Ferromagnets (IFM) on different types of two-dimensional proximity graphs, in which the distribution of their underlying node sets has been changed systematically by means of a parameter σ. This allows us to interpolate between regular grids and proximity graphs based on complete random placement of nodes. Each edge of the planar proximity graphs carries a weighted ferromagnetic coupling. The coupling strengths are determined via the Euclidean distances between coupled spins. The simulations are carried out on graphs with N = 162 to N = 1282 nodes utilising the Wolff cluster algorithm and parallel tempering method in a wide temperature range around the critical point to measure the Binder cumulant in order to obtain the critical temperature for different values of σ. Interestingly, the critical temperatures depend partially non-monotonously on the disorder parameter σ, corresponding to a non-monotonous change of the graph structure. For completeness, we further verify using finite-size scaling methods that the IFM on proximity graphs is for all values of the disorder in the same universality class as the IFM on the two-dimensional square lattice.

*Phys Rev E ; 96(6-1): 062101, 2017 Dec.*

##### RESUMO

The distribution of the hypervolume V and surface ∂V of convex hulls of (multiple) random walks in higher dimensions are determined numerically, especially containing probabilities far smaller than P=10^{-1000} to estimate large deviation properties. For arbitrary dimensions and large walk lengths T, we suggest a scaling behavior of the distribution with the length of the walk T similar to the two-dimensional case and behavior of the distributions in the tails. We underpin both with numerical data in d=3 and d=4 dimensions. Further, we confirm the analytically known means of those distributions and calculate their variances for large T.