Searcharxiv⌕ Search

arXiv subjects

Italo'Ivo Lima Dias Pinto

Publications and source records attributed to Italo'Ivo Lima Dias Pinto.

4 recordsLinked to original sources

A Generative Model of Complex Networks Using Graphons and Neural Inverse Operators

Generative graph models are central to understanding and simulating complex networks. However, existing approaches have complementary strengths and limitations. Mechanistic models offer interpretability but rely on instance-specific estimation methods. Deep generative models, on the other hand, offer amortized inference at the cost of interpretability and are largely limited to graph sizes seen during training. Scientific applications motivate a framework that retains the strengths of both paradigms. We bridge them by formulating both the generative model and parameter recovery in function space. A multifractal step graphon extends standard step graphons with a recursive construction that compactly parameterizes complex networks. This formulation admits a neural inverse operator to recover its parameters, enabling inference on unseen graph sizes. We evaluate our model, trained only on synthetic multifractal step graphon realizations, against both paradigms. Against a graph foundation model pretrained on empirical networks, our method achieves the best average performance on three of four metrics in a zero-shot graph-generation benchmark, indicating that the model transfers to real-world graphs. We also apply our method to single-observation networks, a regime largely inaccessible to deep models that require training corpora, where it performs comparably to an instance-specific method that optimizes on each graph. In a multi-subject EEG case study, the inferred parameters track a reversible change in brain state more sensitively than traditional network statistics. Together, these results indicate that mechanistic interpretability and amortized inference can be effectively unified in a generative graph model to enhance our understanding of complex networks.

cs.LG↗

Dynamical approach to weakly dissipative granular collisions

Granular systems present surprisingly complicated dynamics. In particular, nonlinear interactions and energy dissipation play important roles in these dynamics. Usually, constant coefficients of restitution are introduced phenomenologically to account for energy dissipation when grains collide. The collisions are assumed to be instantaneous and to conserve momentum. Here, we improve on this phenomenology by introducing the dissipation through a viscous (velocity dependent) term in the equations of motion for two colliding grains. Using a first order approximation, we solve the equations of motion in the low viscosity regime. This approach allows us to calculate the collision time, the final velocity of each grain, and a coefficient of restitution that depends on the relative velocity of the grains. We compare our analytic results with those obtained by numerical integration of the equations of motion.

cond-mat.soft↗

Arrays of stochastic oscillators: Nonlocal coupling, clustering, and wave formation

We consider an array of units each of which can be in one of three states. Unidirectional transitions between these states are governed by Markovian rate processes.The interactions between units occur through a dependence of the transition rates of a unit on the states of the units with which it interacts. This coupling is nonlocal, that is, it is neither an all-to-all interaction (referred as global coupling), nor is it a nearest neighbor interaction (referred to as local coupling).The coupling is chosen so as to disfavor the crowding of interacting units in the same state. As a result, there is no global synchronization. Instead, the resultant spatiotemporal configuration is one of clusters that move at a constant speed and that can be interpreted as \emph{traveling waves}. We develop a mean field theory to describe the cluster formation and analyze this model analytically. The predictions of the model are compared favorably with the results obtained by direct numerical simulations.

cond-mat.stat-mech↗

Pulse propagation in a chain of o-rings with and without precompression

We implement a binary collision approximation to study pulse propagation in a chain of o-rings. In particular, we arrive at analytic results from which the pulse velocity is obtained by simple quadrature. The predicted pulse velocity is compared to the velocity obtained from the far more resource-intensive numerical integration of the equations of motion. We study chains without precompression, chains precompressed by a constant force at the chain ends (constant precompression), and chains precompressed by gravity (variable precompression). The application of the binary collision approximation to precompressed chains provides an important generalization of a successful theory that had up to this point only been implemented to chains without precompression, that is, to chains in a sonic vacuum.

cond-mat.soft↗